Provenance describes how an object came to be in its present state. Intelligence dossiers, medical records and corporate financial reports capture provenance information. Many of these applications call for security, but existing security models are not up to the task. Provenance is a causality graph with annotations. The causality graph connects the various participating objects describing the...

This paper describes a graphical method of Skeletal Shock Graph, which is based on the shape or geometry of the object. Shock Graph is an abstraction of the skeleton of a shape onto a Directed Acyclic Graph (DAG) in which the skeleton points are labeled according to the local variation of the radius function at each point. A large image data base is created by using suitable image acquisition t...

This paper describes and demonstrates a graphical method of Skeletal Shock Graph, which is based on the shape or geometry of the object. Shock Graph is an abstraction of the skeleton of a shape onto a Directed Acyclic Graph (DAG) in which the skeleton points are labeled according to the local variation of the radius function at each point. A large image data base is created by using suitable im...

Stack layouts and queue layouts of undirected graphs are used to model problems in fault tolerant computing, in VLSI design, and in managing the ow of data in a parallel processing system. In certain applications, such as managing the ow of data in a parallel processing system, it is more realistic to use layouts of directed acyclic graphs (dags) as a model. A stack layout of a dag consists of ...

Two new scheduling algorithms are presented. They are used to isolate polynomial real roots on massively parallel systems. One algorithm schedules computations modeled by a pyramid DAG. This is a directed acyclic graph isomorphic to Pascal’s triangle. Pyramid DAGs are scheduled so that the communication overhead is linear. The other algorithm schedules parallelizable independent tasks that have...

This vignette demonstrates how to easily use the DO.db package. The Disease Ontology (DO) is a manually inspected subset of Unified Medical Language System (UMLS) and includes concepts from outside the UMLS disease/disorder semantic network including various cancers, congenital abnormalities, deformities and metal disorders. Terms in DO are organized in Directed Acyclic Graph (DAG). DO.db is us...

Directed acyclic graph (DAG) models are popular tools for describing causal relationships and for guiding attempts to learn them from data. In particular, they appear to supply a means of extracting causal conclusions from probabilistic conditional independence properties inferred from purely observational data. I take a critical look at this enterprise, and suggest that it is in need of more, ...

To address the coding and software challenges of modern hybrid architectures, we propose an approach to multiphysics code development for high-performance computing. This approach is based on using a Domain Specific Language (DSL) in tandem with a directed acyclic graph (DAG) representation of the problem that allows runtime algorithm generation. When coupled with a large-scale parallel framewo...

We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that best matches a query. In the proposed algorithm we map the problem of the best matching subsequence to the problem of a cheapest path in a directed acyclic graph (DAG). The approach allows us to compute the optimal scal...

QoS constraint based workflow scheduling described by Directed Acyclic Graph (DAG) has been proved to be a NP-hard problem in Cloud Computing Services, especially for cost minimization under deadline constraint. Due to Deadline Bottom Level (DBL) hasn’t considered the concurrence during the real executing process that cause much more shatter time to solve such problem, this paper proposes a nov...