«linear graph»
۲۲٬۳۳۹ نتیجهEpileptic seizure detection from electroencephalogram (EEG) signals using linear graph convolutional network and DenseNet based hybrid framework
A clinical condition known as epilepsy occurs when the brain's regular electrical activity is disturbed, resulting in a rapid, aberrant, and excessive discharge of brain neurons. The electroencephalogram (EEG) signal measurement received from nerve cells cerebral cortex to make p
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas
of (1981a). (sg: LG, A(LG), Aut(LG)) 1981a Generalized line graphs. J. Graph Theory 5 (1981), 385–399. MR 82k:05091. Zbl. 475.05061. (sg: LG, A(LG), Aut(LG)) Dragoš M. Cvetković and Slobodan K. Simić 1978a Graphs which are switching equivalent to their line graphs. Publ. Inst. Ma
Colinear Coloring and Colinear Graphs∗
Motivated by the notion of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology, and the framework through which it was studied, we introduce the colinear coloring on graphs. We provide an upper bound for the chromatic number χ(G), for
The Mathematical Foundations of Bond Graphs-I. Algebraic Theory
Elementary mathematical concepts from linear algebra are used to develop an independent theory for non-directed bond graphs. The dejinition of a bond graph is given and its structure as a combinatorial object is studied. This is accomplished by constructing a vector space, called
Modeling Scalability in Distributed Self-Stabilization: The Case of Graph Linearization
This paper investigates how to efficiently and locally linearize graphs—i.e., how to build a sorted list of the nodes of a connected graph—in a distributed and self-stabilizing manner. This problem has many interesting application domains; for instance, self-stabilizing algorithm
The Basic Cyclic Scheduling Problem with Linear Precedence Constraints
In this paper, we consider a nite set of generic tasks that we execute a large number of times. We introduce the linear constraints between two generic tasks : the di erence of iteration indices between the execution of two tasks subject to a precedence constraint is a linear fun
Monotone Linear Relations: Maximality and Fitzpatrick Functions
We analyze and characterize maximal monotonicity of linear relations (set-valued operators with linear graphs). An important tool in our study are Fitzpatrick functions. The results obtained partially extend work on linear and at most single-valued operators by Phelps and Simons
Graph Theory and Topology for 3 Phase Power System under Faulted Studies
This manuscript will provide a step by step method on how a graph theory and topology can be utilized to construct a Z-loop matrix for the study of faulted 3 phase power systems. The growing demand for reliable electrical power supply has forced the pace developments in electrica
Structure and strategy in encoding simplified graphs.
Tversky and Schiano (1989) found a systematic bias toward the 45 degrees line in memory for the slopes of identical lines when embedded in graphs, but not in maps, suggesting the use of a cognitive reference frame specifically for encoding meaningful graphs. The present experimen
Interactive Software for Symbolic Modeling of Physical Systems Using Graphs
This paper presents a computational environment for teaching of control systems: Modsym. The software implements a graphical interface for physical systems modeling using graphs and calculates systems transfer functions in symbolic form. ModSym generalizes elements and dynamics v