Directed Acyclic Graph (DAG) is a popular approach to achieve scalability of blockchain networks. Due its high efficiency in data communication and great scalability, DAG has been widely adopted many applications such as Internet Things (IoT) Decentralized Finance (DeFi). DAG-based blockchain, nevertheless, faces the key challenge transaction inclusion collision due concurrency network delay. P...

In this paper we elicit a directed acyclic graph (DAG) for the multivariate time series of hourly vehicle counts at the junction of three major roads in the UK. A flow diagram is introduced to give a pictorial representation of the possible vehicle routes through the network. It is shown how this flow diagram, together with a map of the network, can suggest a suitable DAG which represents the c...

In this work, we present a method to the building of a global hierarchical classification of the proteins functions for a structure of classes represented by a DAG (Directed Acyclic Graph), called RCMDE-GSD (Rule Construction Method Using Differential Evolution-Global Single DAG). Here, we compare RCMDE-GSD with hAntMiner, a method based on ACO (Ant Colony Optimization) algorithm and with HLCS,...

We propose a recursive clustering and order restriction (R-CORE) method for learning large-scale Bayesian networks. The proposed method considers a reduced search space for directed acyclic graph (DAG) structures in scoring-based Bayesian network learning. The candidate DAG structures are restricted by clustering variables and determining the intercluster directionality. The proposed method con...

In this paper, we present a novel and efficient algorithm to find the k longest (shortest) paths between sources and sinks in a directed acyclic graph (DAG). The algorithm does not enumerate paths therefore it is especially useful for very large k values. It is based on the Valued-Sum-of-Product (VSOP) tool, which is an extension of Zero-suppressed Binary Decision Diagrams (ZBDDs). We assessed ...

We consider power distribution networks containing source nodes producing electricity and representing consumers. These sources these consumers are interconnected by a switched network. Configuring this network consists in deciding which switches activated the orientation of links between switches, so as to obtain directed acyclic graph (DAG) from producer consumer nodes. This DAG is valid if e...

Local maxima and minima, or extremal events, in experimental time series can be used as a coarse summary to characterize data. However, the discrete sampling recording measurements suggests uncertainty on true timing of extrema during experiment. This turn gives order within series. Motivated by applications genomic biological network analysis, we construct weighted directed acyclic graph (DAG)...

In multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for achieving a high performance. The problem of multiprocessor scheduling can be stated as finding a schedule for a general task graph to be executed on a multiprocessor system so that the schedule length can be minimize. This scheduling problem is know...

Nowadays the demand of network is increasing rapidly. The ever increasing usage of such network requirements additionally demands fast recovery from network failures. Multipath routing is one in all the most promising routing schemes to accommodate the various needs of the network. It has basic features like load balancing and improved bandwidth. Author Cho et al. introduced a reliable multipat...

We consider a binary response which is potentially affected by set of continuous variables. Of special interest the causal effect on due to an intervention specific variable. The latter can be meaningfully determined basis observational data through suitable assumptions generating mechanism. In particular we assume that joint distribution obeys conditional independencies (Markov properties) inh...