scholarly journals FCA in a Logical Programming Setting for Visualization-Oriented Graph Compression

2017 ◽  
pp. 89-105 ◽  
Author(s):  
Lucas Bourneuf ◽  
Jacques Nicolas
Keyword(s):  
Oriented Graph ◽  
Graph Compression ◽  
Logical Programming

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.

Graph Compression based on Transitivity for Neighborhood Query

2021 ◽  
Author(s):  
Amin Emamzadeh Esmaeili Nejad ◽  
Mansoor Zolghadri Jahromi ◽  
Mohammad Taheri
Keyword(s):  
Graph Compression

scholarly journals G-CREWE: Graph CompREssion With Embedding for Network Alignment

2020 ◽  
Author(s):  
Kyle K. Qin ◽  
Flora D. Salim ◽  
Yongli Ren ◽  
Wei Shao ◽  
Mark Heimann ◽  
...  
Keyword(s):  
Network Alignment ◽  
Graph Compression

scholarly journals Clique Partitions, Graph Compression and Speeding-Up Algorithms

1995 ◽  
Vol 51 (2) ◽  
pp. 261-272 ◽  
Author(s):  
T. Feder ◽  
R. Motwani
Keyword(s):  
Graph Compression

Laplacian Energy of Digraphs and a Minimum Laplacian Energy Algorithm

2015 ◽  
Vol 26 (03) ◽  
pp. 367-380 ◽  
Author(s):  
Xingqin Qi ◽  
Edgar Fuller ◽  
Rong Luo ◽  
Guodong Guo ◽  
Cunquan Zhang
Keyword(s):  
Oriented Graph ◽  
Laplacian Matrix ◽  
Upper Bounds ◽  
Spectral Graph Theory ◽  
Extremal Graphs ◽  
Lower And Upper Bounds ◽  
Spectral Graph ◽  
Laplacian Energy ◽  
Energy Formula ◽  
Matrix Formula

In spectral graph theory, the Laplacian energy of undirected graphs has been studied extensively. However, there has been little work yet for digraphs. Recently, Perera and Mizoguchi (2010) introduced the directed Laplacian matrix [Formula: see text] and directed Laplacian energy [Formula: see text] using the second spectral moment of [Formula: see text] for a digraph [Formula: see text] with [Formula: see text] vertices, where [Formula: see text] is the diagonal out-degree matrix, and [Formula: see text] with [Formula: see text] whenever there is an arc [Formula: see text] from the vertex [Formula: see text] to the vertex [Formula: see text] and 0 otherwise. They studied the directed Laplacian energies of two special families of digraphs (simple digraphs and symmetric digraphs). In this paper, we extend the study of Laplacian energy for digraphs which allow both simple and symmetric arcs. We present lower and upper bounds for the Laplacian energy for such digraphs and also characterize the extremal graphs that attain the lower and upper bounds. We also present a polynomial algorithm to find an optimal orientation of a simple undirected graph such that the resulting oriented graph has the minimum Laplacian energy among all orientations. This solves an open problem proposed by Perera and Mizoguchi at 2010.

Some Possibilities of Modeling Colored Petri Nets

2021 ◽  
pp. 77-91
Author(s):  
Goharik Petrosyan ◽  
Armen Gaboutchian ◽  
Vladimir Knyaz
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Optimal Allocation ◽  
Production Systems ◽  
Oriented Graph ◽  
Discrete Systems ◽  
Colored Petri Nets ◽  
Venn Diagram ◽  
Colored Petri Net ◽  
Language Class

Petri nets are a mathematical apparatus for modelling dynamic discrete systems. Their feature is the ability to display parallelism, asynchrony and hierarchy. First was described by Karl Petri in 1962 [1,2,8]. The Petri net is a bipartite oriented graph consisting of two types of vertices - positions and transitions connected by arcs between each other; vertices of the same type cannot be directly connected. Positions can be placed by tags (markers) that can move around the network. [2] Petri Nets (PN) used for modelling real systems is sometimes referred to as Condition/Events nets. Places identify the conditions of the parts of the system (working, idling, queuing, and failing), and transitions describe the passage from one state to another (end of a task, failure, repair...). An event occurs (a transition fire) when all the conditions are satisfied (input places are marked) and give concession to the event. The occurrence of the event entirely or partially modifies the status of the conditions (marking). The number of tokens in a place can be used to identify the number of resources lying in the condition denoted by that place [1,2,8]. Coloured Petri nets (CPN) is a graphical oriented language for design, specification, simulation and verification of systems [3-6,9,15]. It is in particular well-suited for systems that consist of several processes which communicate and synchronize. Typical examples of application areas are communication protocols, distributed systems, automated production systems, workflow analysis and VLSI chips. In the Classical Petri Net, tokens do not differ; we can say that they are colourless. Unlike standard Petri nets in Colored Petri Net of a position can contain tokens of arbitrary complexity, such as lists, etc., that enables modelling to be more reliable. The article is devoted to the study of the possibilities of modelling Colored Petri nets. The article discusses the interrelation of languages of the Colored Petri nets and traditional formal languages. The Venn diagram, which the author has modified, shows the relationship between the languages of the Colored Petri nets and some traditional languages. The language class of the Colored Petri nets includes a whole class of Context-free languages and some other classes. The paper shows modelling the task synchronization Patil using Colored Petri net, which can't be modeled using well- known operations P and V or by classical Petri network, since the operations P and V and classical Petri networks have limited mathematical properties which do not allow to model the mechanisms in which the process should be synchronized with the optimal allocation of resources.

Sign in / Sign up

Export Citation Format

Share Document