A complex computing problem can be solved efficiently on a system with multiple computing nodes by dividing its implementation code into several parallel processing modules or tasks that can be formulated as directed acyclic graph (DAG) problems. The DAG jobs may be mapped to and scheduled on the computing nodes to minimize the total execution time. Searching an optimal DAG scheduling solution ...

To build a Bayesian network, one may directly construct a directed acyclic graph (DAG) based on causal relationship of the domain variables. However, it may be necessary in many applications to construct a DAG from conditional independencies (CIs). In this paper, we characterize CIs that can be represented by a perfect DAG and suggest an algorithm to construct such a DAG, provided that the give...

Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set; it is cyclic otherwise. As far as we know, only the enumeration of acyclic orientations has been addressed in the literature. In this paper, we pose the prob...

In the past decade, blockchain has evolved as a promising solution to develop secure distributed ledgers and gained massive attention. However, current systems face problems of limited throughput, poor scalability, high latency. Due failure consensus algorithms in managing nodes’identities, technology is considered inappropriate for many applications, e.g., IoT environments, because scalability...

In this paper, we introduce a new graph structure named an ST-reachable directed acyclic which is (DAG) that guarantees reachability (i.e., path exists) from every sender to target. When arbitrarily connected undirected G=(V,E) and two sets of the vertices, senders S (?V) targets T (?V), are given, consider construction minimal DAG by changing some edges arcs removing remaining edges. present n...

Provenance is defined in some literature as a complete documentation of process that led to an object. Provenance has been utilized in some contexts, i.e. database systems, file systems and grid systems. Provenance can be represented by a directed acyclic graph (DAG). In this paper we show an access control method to the provenance information that is represented by a directed acyclic graph and...

A Bayesian network is a graph-based representation of a joint probability distribution that captures properties of conditional independence between variables. This representation consists of two components. The first component is a directed acyclic graph (DAG), where the nodes represent genes and arrows between nodes indicate that one gene directly regulates the expression of another gene. The ...

A Bayesian network consists of two distinct parts: a directed acyclic graph (DAG or belief-network structure) and a set of parameters for the DAG. The DAG in a Bayesian network can be used to represent both causal hypotheses and sets of probability distributions. Under the causal interpretation, a DAG represents the causal relations in a given population with a set of vertices V when there is a...

Distributed computing environments are well suited to meet the computational demands of diverse groups of tasks. At present the most popular model characterizing task’s precedence is DAG(directed acyclic graph). In [2], a novel model called TTIG(Temporal Task In Interaction Graph)that is more realistic and universal than DAG and its corresponding algorithm called MATE are presented. This paper ...

Abbreviations: BN, Bayesian network; IBTS, Internatio International Council for the Exploration of the Sea; C pelagics; SP, small piscivorous; LP, large piscivorous a primary production; DAG, directed acyclic graph; distribution; CPT, conditional probability table; DBN, dyn hidden Markov model; ARHMM, autoregressive hidde variable; EM, Expectation Maximization algorithm; SSE, s ⁎ Corresponding ...