Practical Realization of Algorithm of Oriented Graph Paths Decomposition

2020 ◽  
Vol 10 (3) ◽  
pp. 60-68
Author(s):  
I.A. Zolotarev ◽  
V.A. Rasskazova
Keyword(s):  
Original Problem ◽  
Oriented Graph ◽  
Decomposition Algorithms ◽  
Rail Transportation ◽  
Transport Networks ◽  
Matrix Formulation ◽  
Original Algorithm ◽  
Complex Topology ◽  
Graph Size ◽  
Methodological Status

This study aims to clarify the methodological status program realization of oriented graph paths decomposition. Algorithms of matrix formulation of decomposition table M from multitude of paths, table sorting by NΣ and balance computing explored. On the basis of those algorithms and original algorithm of oriented graph paths decomposition realized Python 3 program. Results for random-generated graph size of 100 vertices computed and time measured. The results obtained can be used to solve the problem of organizing freight rail transportation at the stage of assignment and movement of locomotives. The scientifi c and practical novelty of the work lies in a signifi cant reduction in the dimension of the original problem, which is especially important in the conditions of transport networks of complex topology.

Modification of Algorithm of Directed Graph Paths Decomposition with Schedule

2021 ◽  
Vol 11 (2) ◽  
pp. 51-58
Author(s):  
I.A. Zolotarev ◽  
V.A. Rasskazova
Keyword(s):  
Directed Graph ◽  
Original Problem ◽  
Oriented Graph ◽  
Additional Constraint ◽  
Decomposition Algorithm ◽  
Transport Networks ◽  
Complex Topology ◽  
Balance Parameter

This study aims to refinement of the oriented graph paths decomposition algorithm. An additional constraint on the balance parameter is considered to take into account the locomotive departure schedule. Also new rule to compute Ns parameters is given. An example of the operation of the oriented graph paths decomposition algorithm with the schedule is given. The scientific and practical novelty of the work lies in a significant reduction in the dimension of the original problem, which is especially important in the conditions of transport networks of complex topology.

South Asia rail electrification will progress unevenly

2019 ◽  
Keyword(s):  
Power Supply ◽  
Early Stage ◽  
Institutional Capacity ◽  
Rail Transportation ◽  
Transport Networks ◽  
Content Type ◽  
Operational Costs ◽  
Power Load ◽  
Reliable Power Supply ◽  
Domestic Economies

Subject Rail electrification. Significance India’s railway electrification is extensive and progressing well, while Pakistani and Bangladeshi plans are still at an early stage. Barriers include lack of finance, reliable power supply, institutional capacity and integration into existing diesel-dominated transport networks. Impacts Rail electrification in India should increase train reliability and reduce operational costs. The additional power load required will support LNG imports, particularly in Pakistan and Bangladesh where renewable capacity is low. Improved rail transportation, electrified or not, will boost domestic economies.

“Preparation of Single Crystalline Gold Films for ED Studies”

1972 ◽  
Vol 30 ◽  
pp. 634-635
Author(s):  
Joseph D. C. Peng
Keyword(s):  
Crystal Morphology ◽  
Diffraction Theory ◽  
Scattering Matrix ◽  
Vacuum Evaporation ◽  
Gold Films ◽  
Matrix Formulation ◽  
Silver Films ◽  
Single Crystalline ◽  
Grating Pattern ◽  
Stacking Disorder

The relative intensities of the ED spots in a cross-grating pattern can be calculated using N-beam electron diffraction theory. The scattering matrix formulation of N-beam ED theory has been previously applied to imperfect microcrystals of gold containing stacking disorder (coherent twinning) in the (111) crystal plane. In the present experiment an effort has been made to grow single-crystalline, defect-free (111) gold films of a uniform and accurately know thickness using vacuum evaporation techniques. These represent stringent conditions to be met experimentally; however, if a meaningful comparison is to be made between theory and experiment, these factors must be carefully controlled. It is well-known that crystal morphology, perfection, and orientation each have pronounced effects on relative intensities in single crystals.The double evaporation method first suggested by Pashley was employed with some modifications. Oriented silver films of a thickness of about 1500Å were first grown by vacuum evaporation on freshly cleaved mica, with the substrate temperature at 285° C during evaporation with the deposition rate at 500-800Å/sec.

Quantitative analysis by reconstruction of HREM focal series

1994 ◽  
Vol 52 ◽  
pp. 740-741
Author(s):  
W. Coene ◽  
A. Thust ◽  
M. Op de Beeck ◽  
D. Van Dyck
Keyword(s):  
Phase Retrieval ◽  
Image Plane ◽  
Initial Guess ◽  
Recursive Least Squares ◽  
Objective Lens ◽  
Electron Wave ◽  
Electron Sources ◽  
Original Algorithm ◽  
Coherent Field ◽  
Direct Interpretation

Compared to conventional electron sources, the use of a highly coherent field-emission gun (FEG) in TEM improves the information resolution considerably. A direct interpretation of this extra information, however, is hampered since amplitude and phase of the electron wave are scrambled in a complicated way upon transfer from the specimen exit plane through the objective lens towards the image plane. In order to make the additional high-resolution information interpretable, a phase retrieval procedure is applied, which yields the aberration-corrected electron wave from a focal series of HRTEM images (Coene et al, 1992).Kirkland (1984) tackled non-linear image reconstruction using a recursive least-squares formalism in which the electron wave is modified stepwise towards the solution which optimally matches the contrast features in the experimental through-focus series. The original algorithm suffers from two major drawbacks : first, the result depends strongly on the quality of the initial guess of the first step, second, the processing time is impractically high.

Fractal Analysis of Transport Networks

2011 ◽  
Vol 7 (3) ◽  
pp. 5-13
Author(s):  
Ya.V. Shevchuk ◽  
Keyword(s):  
Fractal Analysis ◽  
Transport Networks

On Some Properties of Semi-rings

2018 ◽  
pp. 35-50
Author(s):  
A. I. Belousov
Keyword(s):  
Linear Equations ◽  
Oriented Graph ◽  
Theoretical Computer Science ◽  
Alternative Methods ◽  
Main Role ◽  
Cost Matrix ◽  
Sequential Elimination ◽  
The Matrix ◽  
Systems Of Linear Equations ◽  
The Cost

The main objective of this paper is to prove a theorem according to which a method of successive elimination of unknowns in the solution of systems of linear equations in the semi-rings with iteration gives the really smallest solution of the system. The proof is based on the graph interpretation of the system and establishes a relationship between the method of sequential elimination of unknowns and the method for calculating a cost matrix of a labeled oriented graph using the method of sequential calculation of cost matrices following the paths of increasing ranks. Along with that, and in terms of preparing for the proof of the main theorem, we consider the following important properties of the closed semi-rings and semi-rings with iteration.We prove the properties of an infinite sum (a supremum of the sequence in natural ordering of an idempotent semi-ring). In particular, the proof of the continuity of the addition operation is much simpler than in the known issues, which is the basis for the well-known algorithm for solving a linear equation in a semi-ring with iteration.Next, we prove a theorem on the closeness of semi-rings with iteration with respect to solutions of the systems of linear equations. We also give a detailed proof of the theorem of the cost matrix of an oriented graph labeled above a semi-ring as an iteration of the matrix of arc labels.The concept of an automaton over a semi-ring is introduced, which, unlike the usual labeled oriented graph, has a distinguished "final" vertex with a zero out-degree.All of the foregoing provides a basis for the proof of the main theorem, in which the concept of an automaton over a semi-ring plays the main role.The article's results are scientifically and methodologically valuable. The proposed proof of the main theorem allows us to relate two alternative methods for calculating the cost matrix of a labeled oriented graph, and the proposed proofs of already known statements can be useful in presenting the elements of the theory of semi-rings that plays an important role in mathematical studies of students majoring in software technologies and theoretical computer science.

THE DEVELOPMENT OF THE MATHEMATICAL MODEL OF PREDICTING THE INDICATORS OF ACCREDITATION OF TECHNICAL UNIVERSITIES IN THE RUSSIAN FEDERATION

2017 ◽  
pp. 27-38
Author(s):  
Olga Mikhaylovna Tikhonova ◽  
Alexander Fedorovich Rezchikov ◽  
Vladimir Andreevich Ivashchenko ◽  
Vadim Alekseevich Kushnikov
Keyword(s):  
Mathematical Model ◽  
System Dynamics ◽  
Regression Model ◽  
Oriented Graph ◽  
Real Data ◽  
Educational Process ◽  
Proposed Model ◽  
Linear Differential ◽  
The University ◽  
The Mathematical Model

The paper presents the system of predicting the indicators of accreditation of technical universities based on J. Forrester mechanism of system dynamics. According to analysis of cause-and-effect relationships between selected variables of the system (indicators of accreditation of the university) there was built the oriented graph. The complex of mathematical models developed to control the quality of training engineers in Russian higher educational institutions is based on this graph. The article presents an algorithm for constructing a model using one of the simulated variables as an example. The model is a system of non-linear differential equations, the modelling characteristics of the educational process being determined according to the solution of this system. The proposed algorithm for calculating these indicators is based on the system dynamics model and the regression model. The mathematical model is constructed on the basis of the model of system dynamics, which is further tested for compliance with real data using the regression model. The regression model is built on the available statistical data accumulated during the period of the university's work. The proposed approach is aimed at solving complex problems of managing the educational process in universities. The structure of the proposed model repeats the structure of cause-effect relationships in the system, and also provides the person responsible for managing quality control with the ability to quickly and adequately assess the performance of the system.

Sign in / Sign up

Export Citation Format

Share Document