We consider computations suitable for systolic arrays, often called regular array computations or systems of uniform recurrence relations. In such computations, the tasks to be computed are viewed as the nodes of a directed acyclic graph (dag), where the data dependencies are represented as arcs. A processor-time-minimal schedule measures the minimum number of processors needed to extract the m...

Let $H$ be a directed acyclic graph (dag) that is not rooted star. It known there are constants $c=c(H)$ and $C=C(H)$ such the following holds for $D_n$, complete on $n$ vertices. There set of at most $C\log n$ subgraphs $D_n$ covers every $H$-copy while $c\log does cover all $H$-copies. Here this dichotomy considerably strengthened.
 ${\vec G}(n,p)$ denote probability space graphs with ve...

This paper describes a parameterised protocol applicable to directed acyclic graph (DAG ) topologiesThe function parameter of the protocol is instantiated twice to design two specific protocols: (i) the topological sorting of the successor list at every node, and (ii) a shortest path routing table constructionBoth protocols are self-Stabilizing and thus they are resilient to transient failures ...

In this paper, the authors incorporate sufficient-component causes into the directed acyclic graph (DAG) causal framework in order to make apparent several properties of conditioning on a common effect. By incorporating sufficient causes on a graph, it is possible to detect conditional independencies within strata of the conditioning variable which are not evident on DAGs without the representa...

In this paper, the authors incorporate sufficient-component causes into the directed acyclic graph (DAG) causal framework in order to make apparent several properties of conditioning on a common effect. By incorporating sufficient causes on a graph, it is possible to detect conditional independencies within strata of the conditioning variable which are not evident on DAGs without the representa...

The emergence of Intelligent Connected Vehicles (ICVs) shows great potential for future intelligent traffic systems, enhancing both safety and road efficiency. However, the ICVs relying on data driven perception driving models face many challenges, such as lack comprehensive knowledge to deal with complicated context. In this paper, we investigate cooperative sharing ICVs. We propose a secure e...

A true-concurrency semantics is often given via pomsets. A pomset is an abstract directed acyclic graph that is in addition transitive: any grandson of a node is also a son of that node. We will drop this rather artificial transitive property in this paper and research abstract directed acyclic graphs (dags) as a true-concurrency semantics for Petri nets and their relation to regular languages ...

A Bayesian network consists of a directed acyclic graph (DAG) and a set of conditional probability distributions (CPDs); they together define a joint probability distribution (jpd). The structure of the DAG dictates how a jpd can be factorized as a product of CPDs. This CPD factorization view of Bayesian networks has been well recognized and studied in the uncertainty community. In this article...

This paper considers the scheduling of parallel realtime tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to prior work in this area, where decomposition-based scheduling algorithms are proposed based on the DAG-structure and inter-task interference is analyzed as self-suspending behavior, this paper generalizes the federate...