1. The inheritance hierarchy is actually a directed acyclic graph.

2. The relationship among the layers is acyclic.

3. G is a maximal acyclic graph.

4. A constructible definition of the directed acyclic graph was described, and the reason why exists a solution that does not exceed the total execution time of all tasks was explained.

5. Methods : The rabbits underwent acyclic exercise and received the manipulations the rear limbs the same periods.

6. The probability updating algorithm for acyclic Temporal Bayesian network based on model simplification and general probability updating algorithm for Temporal Bayesian network are presented.

7. The inheritance hierarchy is a actually a directed acyclic graph.

8. To solve multi-class classification problem,[http:///acyclic.html] Decision Directed Acyclic Graph algorithm support vector machine (DDAGSVM) has been proposed.

9. The Acyclic Dependencies Principle: Allow no cycles in the package dependency graph.

10. Bayes network is a directed acyclic graph with a series of conditional probabilities.

11. Finally, it achieves the throughput of each network, we can find out the directed acyclic network which has the maximum throughput and construct the linear network coding for it.

12. A Dryad job is a graph generator which can synthesize any directed acyclic graph.

13. In this paper, we have devoted our efforts to design and prepare acyclic nucleosides, 8-bromo adenosine derivatives and 5-iodo uracil derivatives.

14. The correlation results show that the method is valuable in understanding the structure performance relationship for the antiknock of acyclic alkanes.

15. Based on the abstract model of reconfigurable hardware resources, we use Hybrid Tasks Directed Acyclic Graph (HTDAG) to describe an application and propose a list scheduling algorithm.

16. The topological sort is an important operation of directed graphs. Th is paper presents a linear algorithm to obtain a more reasonable topological sorting in the directed acyclic graph.

17. Thus, the directed cyclic network has been transformed into a directed acyclic network.

18. This paper proposes a reusable minimum-time path algorithm for the solution to a special time-dependent network, directed acyclic network.

19. Thirdly learning machines are extended to - class problems by using the Decision Directed Acyclic Graph ( DDAG ) strategy.

20. Furthermore, prior probability of each knowledge point is determined by the directed acyclic graph based on knowledge points, and Bayesian Network based on knowledge points is built.

21. Then, the classifier with multi - class support vector machines of DDAG ( decision directed acyclic graph ) is given.

22. Ring closing metathesis (RCM) re action is a very efficient method for the construction ofm any functionalized carbocycles and heterocycles from acyclic diene or enyne precursors.

23. It takes the precondition in courses in altitude academy as directed acyclic graph and takes the problem of selecting course as searching topological order sequence in directed acyclic graph.

24. This paper presents a linear algorithm to obtain a more reasonable topological sorting in the directed acyclic graph.

25. End - to - end network is modeled as a directed acyclic graph, and transformed into a segmented form.

26. A multiobjective shortest path evolutionary algorithm is presented for acyclic directed graph.

27. The isocyanates can be obtained by the fluorination of nitrogenous cylic or acyclic molecules.

28. Virtual Laboratory of Cryptology based on Components(VLCC) uses topological sorting in Directed Acyclic Graph(DAG) to manage the data-dependant and execute-order between components.

29. By computing the system reliability, the performance reliability of the multi-state-node acyclic network system can be evaluated.

30. Global instruction scheduling techniques can be roughly divided into two categories:cyclic scheduling and acyclic scheduling.

31. Markov network is an undirected graph, while Bayesian network is a directed acyclic graph.

32. A universal algorithm for detecting all simple paths between any two nodes in weighted directed acyclic network was presented.

33. A topological sort is carried out on a directed graph with no cycles. Such a graph is called a directed, acyclic graph, often abbreviated DAG.