Planning in Intelligent Sensor Fusion

Directed acyclic graphs (DAGs) are useful for modeling of quantum-dot cellular automata (QCA)-based digital circuits. In this paper, DAGs are used to design the single-layer architecture of QCA circuits. A context-free grammar is proposed to check whether a majority gate-based Boolean expression is syntactically correct or not. Whether a given sentence satisfies the grammar can be tested using the corresponding parse tree. Language-independent (three-address) code can then be constructed from the parse tree to draw a DAG and thereby design the QCA circuit corresponding to a given Boolean expression. The clock zones are partitioned according to each level of the DAG. The abstract architecture developed from the DAG is simulated using the QCADesigner tool.

In this paper, a hierarchical ensemble classification approach that utilizes a Directed Acyclic Graph (DAG) structure is proposed as a solution to the multi-class classification problem. Two main DAG structures are considered: (i) rooted DAG, and (ii) non-rooted DAG. The main challenges that are considered in this paper are: (i) the successive misclassification issue associated with hierarchical classification, and (i) identification of the starting node within the non-rooted DAG approach. To address these issues the idea is to utilize Bayesian probability values to: select the best starting DAG node, and to dictate whether single or multiple paths should be followed within the DAG structure. The reported experimental results indicated that the proposed DAG structure is more effective than when using a simple binary tree structure for generating a hierarchical classification model.

BackgroundDirected acyclic graphs (DAGs) are an effective means of presenting expert-knowledge assumptions when selecting adjustment variables in epidemiology, whereas the change-in-estimate procedure is a common statistics-based approach. As DAGs imply specific empirical relationships which can be explored by the change-in-estimate procedure, it should be possible to combine the two approaches. This paper proposes such an approach which aims to produce well-adjusted estimates for a given research question, based on plausible DAGs consistent with the data at hand, combining prior knowledge and standard regression methods.MethodsBased on the relationships laid out in a DAG, researchers can predict how a collapsible estimator (e.g. risk ratio or risk difference) for an effect of interest should change when adjusted on different variable sets. Implied and observed patterns can then be compared to detect inconsistencies and so guide adjustment-variable selection.ResultsThe proposed approach involves i. drawing up a set of plausible background-knowledge DAGs; ii. starting with one of these DAGs as a working DAG, identifying a minimal variable set, S, sufficient to control for bias on the effect of interest; iii. estimating a collapsible estimator adjusted on S, then adjusted on S plus each variable not in S in turn (“add-one pattern”) and then adjusted on the variables in S minus each of these variables in turn (“minus-one pattern”); iv. checking the observed add-one and minus-one patterns against the pattern implied by the working DAG and the other prior DAGs; v. reviewing the DAGs, if needed; and vi. presenting the initial and all final DAGs with estimates.ConclusionThis approach to adjustment-variable selection combines background-knowledge and statistics-based approaches using methods already common in epidemiology and communicates assumptions and uncertainties in a standardized graphical format. It is probably best suited to areas where there is considerable background knowledge about plausible variable relationships. Researchers may use this approach as an additional tool for selecting adjustment variables when analyzing epidemiological data.

The Directed Acyclic Graph (DAG) is a graph representing causal pathways for informing the conduct of an observational study. The use of DAGs allows transparent communication of a causal model between researchers and can prevent over-adjustment biases when conducting causal inference, permitting greater confidence and transparency in reported causal estimates. In the era of ‘big data’ and increasing number of observational studies, the role of the DAG is becoming more important. Recent best-practice guidance for constructing a DAG with reference to the literature has been published in the ‘Evidence synthesis for constructing DAGs’ (ESC-DAG) protocol. We aimed to assess adherence to these principles for DAGs constructed within perioperative literature. Following registration on the International Prospective Register of Systematic Reviews (PROSPERO) and with adherence to the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) reporting framework for systematic reviews, we searched the Excerpta Medica dataBASE (Embase), the Medical Literature Analysis and Retrieval System Online (MEDLINE) and Cochrane databases for perioperative observational research incorporating a DAG. Nineteen studies were included in the final synthesis. No studies demonstrated any evidence of following the mapping stage of the protocol. Fifteen (79%) fulfilled over half of the translation and integration one stages of the protocol. Adherence with one stage did not guarantee fulfilment of the other. Two studies (11%) undertook the integration two stage. Unmeasured variables were handled inconsistently between studies. Only three (16%) studies included unmeasured variables within their DAG and acknowledged their implication within the main text. Overall, DAGs that were constructed for use in perioperative observational literature did not consistently adhere to best practice, potentially limiting the benefits of subsequent causal inference. Further work should focus on exploring reasons for this deviation and increasing methodological transparency around DAG construction.

Rooted phylogenetic networks, or more generally, directed acyclic graphs (DAGs), are widely used to model species or gene relationships that traditional rooted trees cannot fully capture, especially in the presence of reticulate processes or horizontal gene transfers. Such networks or DAGs are typically inferred from observable data (e.g., genomic sequences of extant species), providing only an estimate of the true evolutionary history. However, these inferred DAGs are often complex and difficult to interpret. In particular, many contain vertices that do not serve as least common ancestors (LCAs) for any subset of the underlying genes or species, thus may lack direct support from the observable data. In contrast, LCA vertices are witnessed by historical traces justifying their existence and thus represent ancestral states substantiated by the data. To reduce unnecessary complexity and eliminate unsupported vertices, we aim to simplify a DAG to retain only LCA vertices while preserving essential evolutionary information. In this paper, we characterize LCA-relevant and lca-relevant DAGs, defined as those in which every vertex serves as an LCA (or unique LCA) for some subset of taxa. We introduce methods to identify LCAs in DAGs and efficiently transform any DAG into an LCA-relevant or lca-relevant one while preserving key structural properties of the original DAG or network. This transformation is achieved using a simple operator “⊖” that mimics vertex suppression.

Directed acyclic graphs (DAGs) play a large role in the modern approach to causal inference. DAGs describe the relationship between measurements taken at various discrete times including the effect of interventions. The causal mechanisms, on the other hand, would naturally be assumed to be a continuous process operating over time in a cause–effect fashion. How does such immediate causation, that is causation occurring over very short time intervals, relate to DAGs constructed from discrete observations? We introduce a time-continuous model and simulate discrete observations in order to judge the relationship between the DAG and the immediate causal model. We find that there is no clear relationship; indeed the Bayesian network described by the DAG may not relate to the causal model. Typically, discrete observations of a process will obscure the conditional dependencies that are represented in the underlying mechanistic model of the process. It is therefore doubtful whether DAGs are always suited to describe causal relationships unless time is explicitly considered in the model. We relate the issues to mechanistic modeling by using the concept of local (in)dependence. An example using data from the Swiss HIV Cohort Study is presented.

Cancer progression models such as Oncogenetic Tress [1], Conjunctive Bayesian Networks [2], or CAPRI [3], try to infer possible restrictions in the order of accumulation of mutations using cancer cross-sectional data. These restrictions would arise from epistatic interactions between mutations. The Directed Acyclic Graphs (DAGs) returned by these methods predict the genotypes that can and cannot be observed. Since fitness landscapes are shaped by those same epistatics interactions and also specify what genotypes are accessible and inaccessible [4] we would expect a close correspondence between a fitness landscape and the DAGs inferred from evolutionary processes in that landscape. I will show here, however, that there is a many-to- many mapping between fitness landscapes and DAGs inferred from cancer progression models. I show that many fitness landscapes cannot be represented by a cancer progression DAG in the sense that no DAG can codify the genotypes that are accessible under that landscape and I propose two measures of “DAG-non-representability”. Next, using 500 different random fitness lanscapes (with 100 begin perfectly DAG-representable) I simulate cancer progression using different mutation rates and sampling regimes; I analyze 20 replicates (of 1000 genotypes) under each condition with CAPRI[3] and CBN[2]. I show that, even under constant mutation and sampling regime conditions, data obtained from the same landscape lead to inferring widely different DAGs (e.g., median Gini-Simpson index of 0.5); this one-landscape-to-many-DAGs phenomenon increases with DAG-non-representability. I also show the one-DAG-to-many-landscapes phenomenon where the same DAG is frequently inferred from very different fitness landscapes (e.g., > 50% difference in accessible genotypes). Finally, I “reverse landscape engineer” the pancreatic cancer data used in [6]: using 190 random fitness landscapes, I show that genotype frequencies similar to the empirically observed one can be obtained under fitness landscapes that are very different from each other and that produce data that lead to the inference of DAGs that are also widely different among themselves (e.g., pairwise difference in edges of DAGs > 50%). I discuss the implications of these results for the interpretation and applied use of cancer progression models. Novelty and significance This paper explicitly establishes a connection between the inference of cancer progression models and the fitness landscapes that condition that cancer progression. It shows there is a many-to- many mapping between them, even under large sample sizes, that can limit their interpretability.

Adjusting for Selection Effects in Epidemiologic Studies

Directed Gaussian graphical models with toric vanishing ideals

We propose a self-stabilizing algorithm to construct a minimal weakly $\mathcal{ST}$-reachable directed acyclic graph (DAG), which is suited for routing messages on wireless networks. Given an arbitrary, simple, connected, and undirected graph $G=(V, E)$ and two sets of nodes, senders $\mathcal{S} (\subset V)$ and targets $\mathcal{T} (\subset V)$, a directed subgraph $\vec{G}$ of $G$ is a weakly $\mathcal{ST}$-reachable DAG on $G$, if $\vec{G}$ is a DAG and every sender can reach at least one target, and every target is reachable from at least one sender in $\vec{G}$. We say that a weakly $\mathcal{ST}$-reachable DAG $\vec{G}$ on $G$ is minimal if any proper subgraph of $\vec{G}$ is no longer a weakly $\mathcal{ST}$-reachable DAG. This DAG is a relaxed version of the original (or strongly) $\mathcal{ST}$-reachable DAG, where every target is reachable from every sender. This is because a strongly $\mathcal{ST}$-reachable DAG $G$ does not always exist; some graph has no strongly $\mathcal{ST}$-reachable DAG even in the case $|\mathcal{S}|=|\mathcal{T}|=2$. On the other hand, the proposed algorithm always constructs a weakly $\mathcal{ST}$-reachable DAG for any $|\mathcal{S}|$ and $|\mathcal{T}|$. Furthermore, the proposed algorithm is self-stabilizing; even if the constructed DAG deviates from the reachability requirement by a breakdown or exhausting the battery of a node having an arc in the DAG, this algorithm automatically reconstructs the DAG to satisfy the requirement again. The convergence time of the algorithm is $O(D)$ asynchronous rounds, where $D$ is the diameter of a given graph. We conduct small simulations to evaluate the performance of the proposed algorithm. The simulation result indicates that its execution time decreases when the number of sender nodes or target nodes is large.

We address the problem of instruction selection in code generation for embedded DSP microprocessors. Such processors have highly irregular data-paths, and conventional code generation methods typically result in inefficient code. Instruction selection can be formulated as directed acyclic graph (DAG) covering. Conventional methods for instruction selection use heuristics that break up the DAG into a forest of trees and then cover them independently. This breakup can result in suboptimal solutions for the original DAG. Alternatively, the DAG covering problem can be formulated as a binate covering problem, and solved exactly or heuristically using branch-and-bound methods. We show that optimal instruction selection on a DAG in the case of accumulator-based architectures requires a partial scheduling of nodes in the DAG, and we augment the binate covering formulation to minimize spills and reloads. We show how the irregular data transfer costs of typical DSP data-paths can be modeled in the binate covering formulation.

Dependence of Confounding on the Target Population: A Modification of Causal Graphs to Account for Co-Action

Development and application of an evidence-based directed acyclic graph to evaluate the associations between metal mixtures and cardiometabolic outcomes.

Intelligence-based detection techniques are significant for dysgraphia diagnosis in school children at an early age. The method involves analyzing the symptoms through handwriting images. Directed Acyclic Graph (DAG) network is one of the intelligence-based technique in handwriting identification. The layer of DAG construction differs from the standard sequential convolution network that exhibits successful image classification. Recently, limited research has been conducted to investigate the learning rate that could affect the DAG network performance in classifying handwriting images. The issue of inconsistent handwriting patterns among dysgraphia children solved by the standard sequential convolution network layer remains different from the DAG operation. Therefore, this study aims to investigate the DAG operations with four acyclic blocks, along with varying the learning rates that could impact the performance of dysgraphia handwriting classification based on synthetic letter images. Experimentally, an improved DAG network model was investigated on four variant values of learning rate; 0.1, 0.01, 0.001, and 0.0001. The performance was measured using a confusion matrix for predicting dysgraphia or non-dysgraphia handwriting. The results obtained the best training accuracy of 99.01% produced by the DAG model at 0. 01learning rate. The testing performance for dysgraphia handwriting classification dropped at the lowest learning rate.

Cloud computing workflows are collections of interdependent tasks. Workflow scheduling is mainly concerned with cost reduction and overall completion time reduction. Our algorithm devised for workflow scheduling aims to address these two QoS factors. Workflows have many tasks which may require different kinds of execution environment for each task. Supporting all these environment dependencies and task dependencies is really difficult for a cloud scheduling system. Workflows are represented using directed acyclic graph (DAG) which shows the dependencies among tasks. Introducing execution environment dependencies to a DAG will lead to a several combinatorial DAGs. In this paper, our system provides a modified DAG which supports task and execution environment dependency. This paper deals with this time-cost tradeoff and tries to balance both these QoS in compromised way. It compromises the cost when the completion time of tasks is higher and vice versa. Hence, the cost as well as makespan will be as minimum as possible. Experimental results show that our algorithm provides a better time-cost balanced solution in imposing execution environment into task DAG.