Directed Acyclic Graph
55 resources related to Directed Acyclic Graph
- Topics related to Directed Acyclic Graph
- IEEE Organizations related to Directed Acyclic Graph
- Conferences related to Directed Acyclic Graph
- Periodicals related to Directed Acyclic Graph
- Most published Xplore authors for Directed Acyclic Graph
No organizations are currently tagged "Directed Acyclic Graph"
2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)
IEEE CCNC 2020 will present the latest developments and technical solutions in the areas of home networking, consumer networking, enabling technologies (such as middleware) and novel applications and services. The conference will include a peer-reviewed program of technical sessions, special sessions, business application sessions, tutorials, and demonstration sessions.
The scope of the symposium includes all aspects of information theory and its applications. Itcovers a wide range of topics such as Shannon Theory, Coding Theory, and InformationSecurity as well as novel applications of information theory.
The ICASSP meeting is the world's largest and most comprehensive technical conference focused on signal processing and its applications. The conference will feature world-class speakers, tutorials, exhibits, and over 50 lecture and poster sessions.
ICC 2020 - 2020 IEEE International Conference on Communications
All topics relating to existing and emerging communications networking technologies.
With technically co-sponsored by IEEE ComSoc(Communications Society), IEEE ComSocCISTC(Communications & Information Security Technical Community), and IEEE ComSocONTC(Optical Networking Technical Community), the ICACT(International Conference onAdvanced Communications Technology) Conference has been providing an open forum forscholars, researchers, and engineers to the extensive exchange of information on newlyemerging technologies, standards, services, and applications in the area of the advancedcommunications technology. The conference official language is English. All the presentedpapers have been published in the Conference Proceedings, and posted on the ICACT Websiteand IEEE Xplore Digital Library since 2004. The honorable ICACT Out-Standing Paper Awardlist has been posted on the IEEE Xplore Digital Library also, and all the Out-Standing papersare subjected to the invited paper of the "ICACT Transactions on the Advanced Communications Technology" Journal issue by GIRI
No periodicals are currently tagged "Directed Acyclic Graph"
IEEE Transactions on Circuits and Systems II: Express Briefs, None
This paper presents some further results on the finite-time stability of probabilistic logical networks (PLNs). By semi-tensor product technique routinely, the dynamic behavior of a PLN is characterized by its corresponding state transition graph (STG). Then, an irradiative result is found. That is, a PLN is globally stable within finite time, if and only if, its STG is acyclic, except ...
2018 International Symposium on Information Theory and Its Applications (ISITA), 2018
This paper presents yet another instance of the power of vector linear network coding over scalar linear network coding. Previous works have established that the size of the finite field required to achieve a vector linear solution may be smaller than that size of the finite field required to achieve a scalar linear solution. It has been also shown there ...
2019 5th International Conference on Web Research (ICWR), 2019
Number of devices using Internet is increasing every day and this fact makes the need to improve the Internet of things protocol more than ever. Data protection and privacy is one of the key challenges in the Internet of Things technology. Dangers involved in the centralized technology of Blockchain system have led to the idea of using Tangle, which is ...
2018 IEEE Information Theory Workshop (ITW), 2018
We study the rate region of variable-length source-network codes that are used to compute a function of messages observed over a network. The particular network considered here is the simplest instance of a directed acyclic graph (DAG) that is not a tree. Existing work on zero-error function computation in DAG networks provides bounds on the computation capacity, which is a ...
2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC), 2019
Steady progress in ubiquitous technologies and machine learning facilitates ever-new and better digital assistants. However, most of these emerging assistants rely on – partly similar – data-driven analyses that are independent of each other, leading to redundancy issues. In this paper, we propose a novel concept (termed AssistantGraph) for an efficient design and runtime support of digital assistants. More specifically, ...
Merge Network for a Non-Von Neumann Accumulate Accelerator in a 3D Chip - Anirudh Jain - ICRC 2018
IEEE Themes - Distance-Dependent Kronecker Graphs For Modeling Social Networks
Welcome to EMBC 2012
Spiking Network Algorithms for Scientific Computing - William Severa: 2016 International Conference on Rebooting Computing
IEEE Themes - Efficient networking services underpin social networks
Micro-Apps 2013: Environment Simulation for Counter-IED Jammer Test
Zhun Fan - Mechatronic Design Automation Using Evolutionary Approaches
IROS TV 2019- Pohang University of Science and Technology- Haptics and Virtual Reality Laboratory
Uncovering the Neural Code of Learning Control - Jennie Si - WCCI 2012 invited lecture
How Much Autonomy Is Acceptable? - IEEE TechEthics Virtual Panel
Shaping the Future Workforce: Transformative Impacts of Emerging Technologies | IEEE TechEthics Public Forum
2011 IEEE Awards James H. Mulligan, Jr. Education Medal - Raj Mittra
This paper presents some further results on the finite-time stability of probabilistic logical networks (PLNs). By semi-tensor product technique routinely, the dynamic behavior of a PLN is characterized by its corresponding state transition graph (STG). Then, an irradiative result is found. That is, a PLN is globally stable within finite time, if and only if, its STG is acyclic, except for the self loop at the priorly-designated vertex. Based on this observation, some properties of STG, which is associated with a finite-time stable PLN, are formulated. The most significant finding is that the determinant of its anti-adjacency matrix is compactly related to the existence of a Hamilton path and is only equal to 0 or 1. Afterwards, the topological sort of all the vertices in STG is defined. As a consequence, two topological sorting algorithms are presented to analyze the stability of PLNs applicably and efficiently. Finally, a simulation example is employed to illustrate the applicability of the obtained results.
This paper presents yet another instance of the power of vector linear network coding over scalar linear network coding. Previous works have established that the size of the finite field required to achieve a vector linear solution may be smaller than that size of the finite field required to achieve a scalar linear solution. It has been also shown there exist networks which do not have a scalar linear solution but have a vector linear solution. In this paper we show that the set of characteristics over which a network has a vector linear solution may be larger than the set of characteristics over which it has a scalar linear solution. We prove this result by showing a network which has a scalar linear solution if and only if the characteristic of the finite field is 2, but has a 2-dimensional vector linear solution over every finite fields.
Number of devices using Internet is increasing every day and this fact makes the need to improve the Internet of things protocol more than ever. Data protection and privacy is one of the key challenges in the Internet of Things technology. Dangers involved in the centralized technology of Blockchain system have led to the idea of using Tangle, which is a decentralized system. The main purpose of this new technology is to improve the problems and limitations of Blockchain such as high cost and time to confirm a transaction. In this new architecture, every node is involved in maintaining network security. This way, if a transaction is created, then it should select and confirm two unconfirmed transactions issued before. A walking algorithm is needed for this selection. Walking algorithms presented in literature thus far are either weighted or unweighted. An unweighted random walk algorithm can approve transactions nearly proportional to the time of their arrivals while a weighted algorithm can better defend against lazy and malicious transactions. In this paper, a new random walk algorithm is presented that has the benefits of both algorithms at the same time. The idea is to adapt the weight value to the current situation of transactions. Numerical results have shown the superiority of the proposed algorithm in comparison to the existing algorithms in providing a balance between timeliness of approving transactions and protecting against malicious activities.
We study the rate region of variable-length source-network codes that are used to compute a function of messages observed over a network. The particular network considered here is the simplest instance of a directed acyclic graph (DAG) that is not a tree. Existing work on zero-error function computation in DAG networks provides bounds on the computation capacity, which is a measure of the amount of communication required per edge in the worst case. This work focuses on the average case: an achievable rate tuple describes the expected amount of communication required on each edge, where the expectation is over the probability mass function of the source messages. We describe a systematic procedure to obtain outer bounds to the rate region for computing an arbitrary demand function at the terminal. Our bounding technique works by lower bounding the entropy of the descriptions observed by the terminal conditioned on the function value and by utilizing the Schur-concave property of the entropy function.
Steady progress in ubiquitous technologies and machine learning facilitates ever-new and better digital assistants. However, most of these emerging assistants rely on – partly similar – data-driven analyses that are independent of each other, leading to redundancy issues. In this paper, we propose a novel concept (termed AssistantGraph) for an efficient design and runtime support of digital assistants. More specifically, assistants need to represent their data-driven processing pipelines as a directed acyclic graph of assistant components (modularity) to benefit from serverless computing with data access. Facilitated component sharing across assistants (reusability) leads to a more connected and efficient overall graph: a shared component instance requires to run only once; versioned components are enabled by the proposed backward chains of converters (versioning). We further develop data and control flow mechanisms through recursive filtering on demand to trigger the data-driven components as required. Within a novel proposed and prototypically implemented open assistant infrastructure, we evaluate our concept in terms of feasibility and performance. The results show reduced redundancy with simultaneous significant performance gains (through component sharing) despite minimal additional overhead (due to modularization and backward compatibility). We believe that our approach gives a new perspective on data-driven assistants and complements an open assistant ecosystem.
The problem of universal source coding for binary trees is considered. Zhang, Yang, and Kieffer derived upper bounds on the average-case redundancy of codes based on directed acyclic graph (DAG) compression for binary tree sources with certain properties. In this paper, a natural class of binary tree sources is presented such that the demanded properties are fulfilled. Moreover, for both subclasses considered in the paper of Zhang, Yang, and Kieffer, their result is improved by deriving bounds on the maximal pointwise redundancy (or worst- case redundancy) instead of the average-case redundancy. Finally, using context-free tree grammars instead of DAGs, upper bounds on the maximal pointwise redundancy for certain binary tree sources are derived. This yields universal codes for new classes of binary tree sources.
Blockchain is a shared distributed ledger that promises tamper-proof secure transactions over the highly available and resilient network involving multiple participants. Directed Acyclic Graph (DAG) has revolutionized the blockchain technology. Owing to its optimized validation mechanism, high scalability, efficient provenance, support for IoT and multiparty involvement, DAG is rapidly over-shadowing traditional blockchain architecture. In this paper, we present a comparative analysis of most popular DAG based blockchain architectures including Nxt, IOTA, Orumesh, DagCoin,Byteball, Nano and XDAG. The comparison is based on the functional data structures for maintaining the ledger, consensus algorithms, transaction validation, ledger size, scalability and popularity. Extracting the best features various DAG based blockchains, we move on to outline the best of all worlds DAG-based blockchain architecture.
Many problems that are relevant to sensor networks such as active sensing and coverage planning have objectives that exhibit diminishing returns and specifically are submodular. When each agent selects an action local space of actions, sequential maximization techniques for submodular function maximization obtain solutions within half of optimal even though such problems are often NP-Hard. However, adapting methods for submodular function maximization to distributed computation on sensor networks is challenging as sequential execution of planning steps is time-consuming and inefficient. Further, prior works have found that planners suffer severely impaired worst- case performance whenever large numbers of agents plan in parallel. This work develops new tools for analysis of submodular maximization problems which we apply to design of randomized distributed planners that provide constant- factor suboptimality approaching that of standard sequential planners. These bounds apply when the objective satisfies a higher-order monotonicity condition and when cumulative interactions between agents are proportional to the optimal objective value. Problems including generalizations of sensor coverage satisfy these conditions when agents have spatially local sensing actions and limited sensor range. We present simulation results for two such cases.
Irrelevant variables are always omitted in knowledge compilation languages since their assignments do not change the satisfiability of sentences. In order to identify new knowledge compilation languages and reduce the scale of compiling result of d-DNNF, we augment NNF with irrelevant variables in this paper. The NNFPNI, NNFPI, and NNFNI are proposed based on different combinations of positive literals, negative literals, and irrelevant variables. Each sentence in NNF, NNFPI, NNFNI, or NNFPNI can be translated to an equivalent sentence in another language in polynomial time. We also define d-DNNFNI, d-DNNFPI, and d-DNNFPNI based on decomposability and determinism in NNF, which are subclasses of NNFPI, NNFNI, and NNFPNI, respectively. A number of querying and transforming methods for d-DNNFPNI, d-DNNFPI, and d-DNNFPI are designed to solve relevant reasoning problems in knowledge compilation map. Overall, d-DNNFPI and d-DNNFNI do not reduce the tractability of d-DNNF, so we propose a compressing method for d-DNNF based on d-DNNFPI and d-DNNFNI. The experimentally, the compiling results of the d-DNNFPI and d-DNNFNI are better with respect to d-DNNF for most instances, and our compressing method is significantly effective for all instances.
In this paper we consider the problem of a multiagent system achieving a formation in the presence of misbehaving or adversarial agents. We introduce a novel continuous time resilient controller to guarantee that normally behaving agents can converge to a formation with respect to a set of leaders. The controller employs a norm-based filtering mechanism, and unlike most prior algorithms, also incorporates input bounds. In addition, the controller is shown to guarantee convergence in finite time. A sufficient condition for the controller to guarantee convergence is shown to be a graph theoretical structure which we denote as Resilient Directed Acyclic Graph (RDAG). Further, we employ our filtering mechanism on a discrete time system which is shown to have exponential convergence. Our results are demonstrated through simulations.
No standards are currently tagged "Directed Acyclic Graph"