Is Your Graph Algorithm Eligible for Nondeterministic Execution?

2015 ◽  
Author(s):  
Zhiyuan Shao ◽  
Lin Hou ◽  
Yan Ai ◽  
Yu Zhang ◽  
Hai Jin
Keyword(s):  
Graph Algorithm

Hydraulic model of a water cooling system in a chemical plant

1988 ◽  
Vol 53 (4) ◽  
pp. 788-806
Author(s):  
Miloslav Hošťálek ◽  
Jiří Výborný ◽  
František Madron
Keyword(s):  
Flow Rate ◽  
Cooling System ◽  
Cooling Water ◽  
Graph Algorithm ◽  
Automatic Generation ◽  
Hydraulic Calculation ◽  
Return Flow ◽  
Flow Rates ◽  
Pressure Losses ◽  
Controlled Flow

Steady state hydraulic calculation has been described of an extensive pipeline network based on a new graph algorithm for setting up and decomposition of balance equations of the model. The parameters of the model are characteristics of individual sections of the network (pumps, pipes, and heat exchangers with armatures). In case of sections with controlled flow rate (variable characteristic), or sections with measured flow rate, the flow rates are direct inputs. The interactions of the network with the surroundings are accounted for by appropriate sources and sinks of individual nodes. The result of the calculation is the knowledge of all flow rates and pressure losses in the network. Automatic generation of the model equations utilizes an efficient (vector) fixing of the network topology and predominantly logical, not numerical operations based on the graph theory. The calculation proper utilizes a modification of the model by the method of linearization of characteristics, while the properties of the modified set of equations permit further decrease of the requirements on the computer. The described approach is suitable for the solution of practical problems even on lower category personal computers. The calculations are illustrated on an example of a simple network with uncontrolled and controlled flow rates of cooling water while one of the sections of the network is also a gravitational return flow of the cooling water.

Graph Algorithm for Anomaly Prediction in East Java Student Admission System

2021 ◽  
Author(s):  
Dwi Sunaryono ◽  
Annas Nuril Iman ◽  
Diana Purwitasari ◽  
Agus Budi Raharjo
Keyword(s):  
Graph Algorithm ◽  
Admission System

scholarly journals Metrics for evaluation of metaprogram complexity

2010 ◽  
Vol 7 (4) ◽  
pp. 769-787 ◽  
Author(s):  
Robertas Damasevicius ◽  
Vytautas Stuikys
Keyword(s):  
Measurement Techniques ◽  
Graph Algorithm ◽  
Aspect Oriented Programming ◽  
Engineering Software ◽  
Software Complexity ◽  
Complexity Management ◽  
Complexity Metrics ◽  
Cognitive Difficulty ◽  
Cognitive Dimensions

The concept of complexity is used in many areas of computer science and software engineering. Software complexity metrics can be used to evaluate and compare quality of software development and maintenance processes and their products. Complexity management and measurement is especially important in novel programming technologies and paradigms, such as aspect-oriented programming, generative programming, and metaprogramming, where complex multilanguage and multi-aspect program specifications are developed and used. This paper analyzes complexity management and measurement techniques, and proposes five complexity metrics (Relative Kolmogorov Complexity, Metalanguage Richness, Cyclomatic Complexity, Normalized Difficulty, Cognitive Difficulty) for measuring complexity of metaprograms at information, metalanguage, graph, algorithm, and cognitive dimensions.

A Dijkstra-Inspired Graph Algorithm for Fully Autonomous Tasking in Industrial Applications

2021 ◽  
pp. 1-1
Author(s):  
Mohamed Lotfi ◽  
Gerardo J. Osorio ◽  
Mohammad Sadegh Javadi ◽  
Abdelrahman Ashraf ◽  
Mustafa Mahmoud ◽  
...  
Keyword(s):  
Graph Algorithm ◽  
Industrial Applications

A Multiplayer Virtual Intelligent System Based on Distributed Virtual Reality

2021 ◽  
Author(s):  
Zhen You ◽  
Jiewen Huang ◽  
Jinyun Xue ◽  
Jiaxiang Chen ◽  
Jiaxin Liu ◽  
...  
Keyword(s):  
Virtual Reality ◽  
Intelligent System ◽  
Interaction Mechanism ◽  
Graph Algorithm ◽  
Theoretical Research ◽  
Behavioral Consistency ◽  
Tourist Attractions ◽  
World Heritage List ◽  
Distributed Virtual Reality ◽  
3D Scene

Distributed Virtual Reality (DVR) is a combination of network and virtual reality technology, it could facilitate to construct a uniformly shared Distributed Virtual Environment (DVE) by using network to connect geographically distributed multiplayers. This paper concentrates on the theoretical research and practical development about Multiplayer Virtual Intelligent System (MVIS), and the main contribution could be summarized as two points. (1) Based on the DVR technology, this paper presented some theoretical research on MVIS, including the classification of virtual entities, communication pattern of entities, and the behavioral consistency research. Furthermore, a Multiplayer Earliest Deadline First (MEDF) program was proposed in order to guarantee the consistency of entities. (2) A prototype algorithm experiment system, called Multiplayer Graph-algorithm Intelligent System (MGIS), was designed. MGIS not onlyefficiently solves many problems in traditional computer algorithm teaching, such as high-abstraction, difficulty to understand, and lack of interaction mechanism; but also extends the application of DVR to cultural tourism, because MGIS is developed on the 3D scene of Lushan Mountain, which is one of the notable tourist attractions in China, and was included in the UNESCO World Heritage list in 1996. What i’s more, MGIS illustrates the ability of expression, applicability and generality of the theoretical research about MVIS.

Sign in / Sign up

Export Citation Format

Share Document