Statistics and Calculation of Entropy of Dominating David Derived Networks

A graph’s entropy is a functional one, based on both the graph itself and the distribution of probability on its vertex set. In the theory of information, graph entropy has its origins. Dominating David derived networks have a variety of important applications in medication store, hardware, and system administration. In this study, we discuss dominating David derived network of type 1, 2, and 3 written as D 1 n , D 2 n , and D 3 n , respectively of order n . We also compute some degree-based entropies such as Randić , A B C , and GA entropy of D 1 n , D 2 n , and D 3 n .

On Computation of Entropy of Hex-Derived Network

A graph’s entropy is a functional one, based on both the graph itself and the distribution of probability on its vertex set. In the theory of information, graph entropy has its origins. Hex-derived networks have a variety of important applications in medication store, hardware, and system administration. In this article, we discuss hex-derived network of type 1 and 2, written as HDN 1 n and HDN 2 n , respectively of order n . We also compute some degree-based entropies such as Randić, ABC , and G A entropy of HDN 1 n and HDN 2 n .

Deductive and abductive argumentation based on information graphs

In this paper, we propose an argumentation formalism that allows for both deductive and abductive argumentation, where ‘deduction’ is used as an umbrella term for both defeasible and strict ‘forward’ inference. Our formalism is based on an extended version of our previously proposed information graph (IG) formalism, which provides a precise account of the interplay between deductive and abductive inference and causal and evidential information. In the current version, we consider additional types of information such as abstractions which allow domain experts to be more expressive in stating their knowledge, where we identify and impose constraints on the types of inferences that may be performed with the different types of information. A new notion of attack is defined that captures a crucial aspect of abductive reasoning, namely that of competition between abductively inferred alternative explanations. Our argumentation formalism generates an abstract argumentation framework and thus allows arguments to be formally evaluated. We prove that instantiations of our argumentation formalism satisfy key rationality postulates.

Differentiation of Healthy Individuals from Those with Autism Spectrum Disorders using Information Graph of Complementary Opposites

This study aimed to examine the brain signals of children with Autism Spectrum Disorder (ASD) and use a method according to the concept of complementary opposites to obtain the prominent features or a pattern of EEG signal that represents the biological characteristic of such children. In this study, 20 children with the mean±SD age of 8±5 years were divided into two groups of normal control (NC) and ASD. The diagnosis and approval of individuals in both groups were conducted by two experts in the field of pediatric psychiatry and neurology. The recording protocol was designed with the most accuracy; therefore, the brain signals were recorded with the least noise in the awake state of the individuals in both groups. Moreover, the recording was conducted in three stages from two channels (C3-C4) of EEG ( referred to as the central part of the brain) which were symmetrical in function. In this study, the Mandala method was adopted based on the concept of complementary opposites to investigate the features extracted from Mandala pattern topology and obtain new features and pseudo-patterns for the screening and early diagnosis of ASD. The optimal feature here was based on different stages of processing and statistical analysis of Pattern Detection Capability (PDC). The PDC is a biomarker derived from the Mandala pattern for differentiating the NC from ASD groups.

On the problem of automatic development of parallel applications for reconfigurable computer systems

Рассмотрена оригинальная методика отображения информационного графа прикладной программы на архитектуру реконфигурируемой вычислительной системы с помощью методов редукции производительности, обеспечивающих решение задач, аппаратные затраты на реализацию которых превышают доступный вычислительный ресурс. Доказаны теоремы о свойствах последовательного применения редукций по числу базовых подграфов, по числу вычислительных устройств и разрядности. На основе доказанных теорем и следствий из них сформулирована методика редукционных преобразований информационного графа прикладной программы для автоматической адаптации к архитектуре реконфигурируемой вычислительной системы. Приведена оценка максимального числа преобразований согласно предложенной методике для сбалансированной редукции производительности и аппаратных затрат прикладных программ для реконфигурируемых вычислительных систем. To solve applied problems, the hardware costs of which exceed the available computing resource of FPGA-based computer systems, an original technique was developed for mapping the information graph of an application program to the architecture of a reconfigurable computing system. The proposed technique is based on the performance reduction methods that reduce the productivity of an applied task, which, along with the reducing productivity, does so for the hardware costs of its implementation and, thereby, solve the problem on the available computing resource. We demonstrate that the decrease in hardware costs for the computing structure realization occurs only during the reduction the basic subgraph number, the number of computing devices in a basic subgraph and the data width. The influence of sequential reduction transformations on the computing structure of a problem is examined. The proved theorems are concerned with the possibility of representing the reduction coefficient as a product of the coefficients of successive reductions, on the inability of additive increase in reduction coefficient during sequential reductions and on the superposition commutativity of different sequential reductions. The proved theorems and the corollaries presented in the article allow formulating the basic principles for the method of reduction transformations of the information graph of the problem for adaptation to the architecture of a hybrid reconfigurable computing system. A distinctive feature of the technique is a relatively small number of transformations for a balanced reduction of the information graph of the problem and the implementation of the task on a reconfigurable computer system.The comparatively small number of transformations required for the balanced reduction of the information graph of the problem and for the implementation of calculations on a reconfigurable computer system is the distinctive feature of the technique. For the developed technique, we estimated the maximal number of transformations and found out the decrease in the quantity of analyzed reduction variants from each class. The proposed technique permits the significant reduction of the time needed to create the computational structure of a parallel program adapted to the architecture and configuration of the reconfigurable computing system. Furthermore, the technique allows automatization of this process using the specialized software and providing at least 5075 efficiency in comparison with the solutions of the same problems by specialists.