Redirigiendo al acceso original de articulo en 21 segundos...
Inicio  /  Information  /  Vol: 13 Par: 12 (2022)  /  Artículo
ARTÍCULO
TITULO

Automatically Testing Containedness between Geometric Graph Classes defined by Inclusion, Exclusion, and Transfer Axioms under Simple Transformations

Lucas Böltz and Hannes Frey    

Resumen

We study classes of geometric graphs, which all correspond to the following structural characteristic. For each instance of a vertex set drawn from a universe of possible vertices, each pair of vertices is either required to be connected, forbidden to be connected, or existence or non-existence of an edge is undetermined. The conditions which require or forbid edges are universally quantified predicates defined over the vertex pair, and optionally over existence or non-existence of another edge originating at the vertex pair. We consider further a set of simple graph transformations, where the existence of an edge between two vertices is logically determined by the existence or non-existence of directed edges between both vertices in the original graph. We derive and prove the correctness of a logical expression, which is a necessary and sufficient condition for containedness relations between graph classes that are described this way. We apply the expression on classes of geometric graphs, which are used as theoretical wireless network graph models. The models are constructed from three base class types and intersection combinations of them, with some considered directly and some considered as symmetrized variants using two of the simple graph transformations. Our study then goes systematically over all possible graph classes resulting from those base classes and all possible simple graph transformations. We derive automatically containedness relations between those graph classes. Moreover, in those cases where containedness does not hold, we provide automatically derived counter examples.

 Artículos similares

       
 
Juan Xu, Meng Ding, Zhen-Zhen Zhang, Yu-Bin Xu, Xu-Hui Wang and Fan Zhao    
The automatic collection of key milestone nodes in the process of aircraft turnaround plays an important role in the development needs of airport collaborative decision-making. This article exploits a computer vision-based framework to automatically reco... ver más
Revista: Applied Sciences

 
Adrian Brezulianu, Oana Geman and Iolanda Valentina Popa    
The optimization of locomotive drivers? scheduling in rail freight transportation comes as a necessity for minimizing economic expenses and training investments. The Ferodata AI engine, an artificial intelligence (AI)/machine learning (ML) software modul... ver más
Revista: Applied Sciences

 
Michael R. Lindstrom, Xiaofu Ding, Feng Liu, Anand Somayajula and Deanna Needell    
Nonnegative matrix factorization can be used to automatically detect topics within a corpus in an unsupervised fashion. The technique amounts to an approximation of a nonnegative matrix as the product of two nonnegative matrices of lower rank. In certain... ver más
Revista: Algorithms

 
Lwando Nkuzo, Malusi Sibiya and Elisha Didam Markus    
Using a safety belt is crucial for preventing severe injuries and fatalities during vehicle accidents. In this paper, we propose a real-time vehicle occupant safety belt detection system based on the YOLOv7 (You Only Look Once version seven) object detec... ver más
Revista: Algorithms

 
Qaisar Abbas, Talal Saad Albalawi, Ganeshkumar Perumal and M. Emre Celebi    
In recent years, advances in deep learning (DL) techniques for video analysis have developed to solve the problem of real-time processing. Automated face recognition in the runtime environment has become necessary in video surveillance systems for urban ... ver más
Revista: Applied Sciences