Skip to Content

477 Results Found

  • Article
  • Open Access
1 Citations
2,592 Views
31 Pages

Graph-DEM: A Graph Neural Network Model for Proxy and Acceleration Discrete Element Method

  • Bohao Li,
  • Bowen Du,
  • Kaixin Liu,
  • Ke Cheng and ,
  • Junchen Ye,
  • Jinyan Feng and
  • Xuhao Cui
  • + 2 authors+ 0 author

26 September 2025

The discrete element method (DEM) is widely employed in various fields for analyzing rock and soil movement. However, the traditional DEM involves a large number of calculations, which leads to reduced computational efficiency. Deep-learning presents...

  • Article
  • Open Access
49 Views
18 Pages

4 November 2026

The Education for Sustainable Development approach calls for mathematical tasks that illuminate the structure and changing behaviour of interdependent systems. This study develops R4-Graph, a four-phase sequence for sustainability-oriented discrete m...

(This article belongs to the Special Issue Education for Sustainability in the Context of Emerging Educational Frameworks)
  • Article
  • Open Access
6 Citations
5,322 Views
16 Pages

MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk

  • Kai Liu,
  • Yi Zhang,
  • Kai Lu,
  • Xiaoping Wang and ,
  • Xin Wang and
  • Guojing Tian
  • + 1 author+ 0 author

5 June 2019

Graph isomorphism is to determine whether two graphs have the same topological structure. It plays a significant role in areas of image matching, biochemistry, and information retrieval. Quantum walk, as a novel quantum computation model, has been em...

  • Article
  • Open Access
458 Views
19 Pages

This paper proposes a lightweight adaptive knowledge graph tutoring system for discrete mathematics, addressing the challenges of knowledge fragmentation, homogenized pedagogical paradigms, and insufficient practical support in traditional instructio...

  • Article
  • Open Access
21 Citations
4,665 Views
20 Pages

11 May 2020

Hyperspectral image (HSI) classification plays an important role in the automatic interpretation of the remotely sensed data. However, it is a non-trivial task to classify HSI accurately and rapidly due to its characteristics of having a large amount...

  • Article
  • Open Access
15 Citations
5,565 Views
13 Pages

Survival prediction models play a key role in patient prognosis and personalized treatment. However, their accuracy can be improved by incorporating patient similarity networks, which uncover complex data patterns. Our study uses Graph Neural Network...

(This article belongs to the Special Issue Biomedical Application of Big Data and Artificial Intelligence)
  • Article
  • Open Access
1 Citations
2,586 Views
10 Pages

3 July 2023

Reducing the number of crossings on graph edges can be useful in various applications, including network visualization, circuit design, graph theory, cartography or social choice theory. This paper aims to determine the crossing number of the join pr...

(This article belongs to the Section B: Geometry and Topology)
  • Article
  • Open Access
1,034 Views
12 Pages

14 July 2026

This paper investigates crossing numbers of join products involving all non-isomorphic graphs of order five and the graph families Dn, Pn, and Cn. By systematically examining all 34 graphs of order five, we establish a unified classification of 102 c...

(This article belongs to the Section B: Geometry and Topology)
  • Feature Paper
  • Article
  • Open Access
1,986 Views
15 Pages

21 May 2025

The significance of searching for edge crossings in graph theory lies inter alia in enhancing the clarity and readability of graph representations, which is essential for various applications such as network visualization, circuit design, and data re...

(This article belongs to the Special Issue Advances in Mathematics: Equations, Algebra, and Discrete Mathematics)
  • Article
  • Open Access
2,385 Views
19 Pages

31 March 2023

For a vertex and edge weighted (VEW) graph G with a vertex weight function fG let Wα,β(G)=∑{u,v}⊆V(G)[αfG(u)×fG(v)+β(fG(u)+fG(v))]dG(u,v) where, α,β∈ℝ ...

(This article belongs to the Special Issue Advances in Graph Theory: Algorithms and Applications)
  • Article
  • Open Access
6 Citations
3,285 Views
12 Pages

9 January 2020

In the paper, we extend known results concerning crossing numbers of join products of small graphs of order six with discrete graphs. The crossing number of the join product G ∗ + D n for the graph G ∗ on six vertice...

(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
  • Article
  • Open Access
4 Citations
4,335 Views
13 Pages

1 June 2023

Graph-structured data, operating as an abstraction of data containing nodes and interactions between nodes, is pervasive in the real world. There are numerous ways dedicated to extract graph structure information explicitly or implicitly, but whether...

(This article belongs to the Special Issue Spectral Graph Theory, Topological Indices of Graph, and Entropy)
  • Article
  • Open Access
2 Citations
3,523 Views
22 Pages

Discrete Geodesic Distribution-Based Graph Kernel for 3D Point Clouds

  • Mehmet Ali Balcı,
  • Ömer Akgüller,
  • Larissa M. Batrancea and
  • Lucian Gaban

21 February 2023

In the structural analysis of discrete geometric data, graph kernels have a great track record of performance. Using graph kernel functions provides two significant advantages. First, a graph kernel is capable of preserving the graph’s topologi...

(This article belongs to the Special Issue Intelligent Point Cloud Processing, Sensing and Understanding)
  • Article
  • Open Access
3 Citations
1,711 Views
19 Pages

23 October 2025

Various types of anomalies can arise in cyber–physical production systems, caused by either faulty devices or incorrect processes. Anomalies within individual devices can often be detected by applying machine learning techniques to the respecti...

(This article belongs to the Special Issue AI-Based Machinery Health Monitoring)
  • Article
  • Open Access
6 Citations
2,933 Views
18 Pages

Verification of Current-State Opacity in Discrete Event Systems by Using Basis Coverability Graphs

  • Haoming Zhu,
  • Ahmed M. El-Sherbeeny,
  • Mohammed A. El-Meligy,
  • Amir M. Fathollahi-Fard and
  • Zhiwu Li

10 April 2023

A new approach to the verification of current-state opacity for discrete event systems is proposed in this paper, which is modeled with unbounded Petri nets. The concept of opacity verification is first extended from bounded Petri nets to unbounded P...

(This article belongs to the Section E2: Control Theory and Mechanics)
  • Article
  • Open Access
14 Citations
3,916 Views
9 Pages

22 January 2019

The main aim of the paper is to give the crossing number of the join product G + D n for the disconnected graph G of order five consisting of one isolated vertex and of one vertex incident with some vertex of the three-cycle, and D n ...

(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
  • Article
  • Open Access
2 Citations
3,543 Views
13 Pages

21 December 2017

This paper clarifies the hierarchical structure of the sharp constants for the discrete Sobolev inequality on a weighted complete graph. To this end, we introduce a generalized-graph Laplacian ...

  • Article
  • Open Access
687 Views
18 Pages

19 February 2026

Graph-based clustering is a fundamental task in unsupervised machine learning and has been extensively applied to complex data mining scenarios, such as pattern recognition and data classification. However, most existing graph clustering algorithms s...

(This article belongs to the Special Issue Advanced Neural Network and Machine Learning Algorithms, Models and Architectures in Data Mining)
  • Article
  • Open Access
11 Citations
4,836 Views
35 Pages

Robot Localization in Tunnels: Combining Discrete Features in a Pose Graph Framework

  • Teresa Seco,
  • María T. Lázaro,
  • Jesús Espelosín,
  • Luis Montano and
  • José L. Villarroel

11 February 2022

Robot localization inside tunnels is a challenging task due to the special conditions of these environments. The GPS-denied nature of these scenarios, coupled with the low visibility, slippery and irregular surfaces, and lack of distinguishable visua...

(This article belongs to the Section Sensors and Robotics)
  • Article
  • Open Access
1,380 Views
14 Pages

21 November 2023

A class of graphs is defined in which each vertex of a discrete torus is replaced by a Boolean hypercube in such a way that vertices in a fixed subset of each replacement cube are adjacent to corresponding vertices of a neighboring replacement cube....

(This article belongs to the Special Issue Discrete Mathematics, Graph Theory and Applications)
  • Article
  • Open Access
2 Citations
913 Views
23 Pages

18 May 2026

LiDAR point clouds provide accurate and direct representations of spatial locations and geometric structures of objects in 3D space, making them essential for applications such as target recognition in autonomous driving and 3D reconstruction in smar...

(This article belongs to the Special Issue 3D Urban Reconstruction from Point Clouds and Optical Imagery: Modeling and Applications)
  • Feature Paper
  • Article
  • Open Access
23 Citations
7,540 Views
16 Pages

Undergraduate Students’ Solutions of Modeling Problems in Algorithmic Graph Theory

  • Janka Medová,
  • Kitti Páleníková,
  • Ľubomír Rybanský and
  • Zuzana Naštická

26 June 2019

Graphs can be considered as useful mathematical models. Graph algorithms are a common part of undergraduate courses in discrete mathematics. Even though they have been successfully implemented in secondary curricula, little research has been dedicate...

(This article belongs to the Special Issue Mathematical Modeling and Simulation in Science and Engineering Education)
  • Feature Paper
  • Article
  • Open Access
2 Citations
4,474 Views
14 Pages

25 June 2024

The crossing number of a graph is a significant measure that indicates the complexity of the graph and the difficulty of visualizing it. In this paper, we examine the crossing numbers of join products involving the complete graph K5 with discrete gra...

(This article belongs to the Special Issue Advances in Graph Theory and Combinatorial Optimization)
  • Article
  • Open Access
29 Citations
6,628 Views
21 Pages

6 March 2014

The problem of correctly defining geometric objects, such as the curvature, is a hard one in discrete geometry. In 2009, Ollivier defined a notion of curvature applicable to a wide category of measured metric spaces, in particular to graphs. He named...

(This article belongs to the Special Issue Discrete Differential Geometry and Its Applications to Imaging and Graphics)
  • Article
  • Open Access
52 Citations
3,839 Views
18 Pages

Existence, Uniqueness and Exponential Stability of Periodic Solution for Discrete-Time Delayed BAM Neural Networks Based on Coincidence Degree Theory and Graph Theoretic Method

  • Manickam Iswarya,
  • Ramachandran Raja,
  • Grienggrai Rajchakit,
  • Jinde Cao and ,
  • Jehad Alzabut and
  • Chuangxia Huang
  • + 1 author+ 0 author

4 November 2019

In this work, a general class of discrete time bidirectional associative memory (BAM) neural networks (NNs) is investigated. In this model, discrete and continuously distributed time delays are taken into account. By utilizing this novel method, whic...

(This article belongs to the Special Issue Impulsive Control Systems and Complexity)
  • Article
  • Open Access
22 Citations
9,734 Views
18 Pages

Performance Evaluation of Discrete Event Systems with GPenSIM

  • Reggie Davidrajuh,
  • Bozena Skolud and
  • Damian Krenczyk

Petri nets are a useful tool for the modeling and performance evaluation of discrete event systems. Literature reveals that the Petri Net models of real-world discrete event systems are most frequently event graphs (a subclass of Petri nets). Literat...

  • Article
  • Open Access
3 Citations
2,076 Views
21 Pages

14 November 2024

This research focuses on improving the modelling of highly automated centralized traffic management. Authors use a binary integer modelling for traffic flow optimization. One of the main results of the research is the integration of alternative graph...

(This article belongs to the Section Transportation and Future Mobility)
  • Article
  • Open Access
205 Views
25 Pages

21 October 2026

Anchor graphs are widely recognized for their capability to reduce the computational complexity of clustering. When regression techniques are applied to anchor graphs, existing regression-based methods mainly focus on directly learning sample labels,...

(This article belongs to the Special Issue Optimization Models and Algorithms in Data Science, 2nd Edition)
  • Article
  • Open Access
6 Citations
3,187 Views
21 Pages

14 September 2019

In this article, we analyze the spectrum of discrete magnetic Laplacians (DML) on an infinite covering graph G ˜ → G = G ˜ / Γ with (Abelian) lattice group Γ and periodic magnetic potential β &t...

(This article belongs to the Section C: Physics)
  • Article
  • Open Access
1 Citations
523 Views
29 Pages

26 June 2026

High-penetration integration of Renewable Energy Sources (RESs) and Battery Energy Storage Systems (BESSs) has transformed Distribution Network Reconfiguration (DNR) from a static topology optimization task into a complex combinatorial problem with s...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
21 Citations
3,782 Views
18 Pages

Face Recognition with Triangular Fuzzy Set-Based Local Cross Patterns in Wavelet Domain

  • Turker Tuncer,
  • Sengul Dogan,
  • Moloud Abdar,
  • Mohammad Ehsan Basiri and
  • Paweł Pławiak

13 June 2019

In this study, a new face recognition architecture is proposed using fuzzy-based Discrete Wavelet Transform (DWT) and fuzzy with two novel local graph descriptors. These graph descriptors are called Local Cross Pattern (LCP). The proposed fuzzy wavel...

  • Article
  • Open Access
1 Citations
2,249 Views
24 Pages

12 November 2024

This work addresses the analysis and characterization of deadlocks in discrete-event systems modeled by labeled Petri nets (LPNs) with undistinguishable and unobservable transitions. To provide a solution for the notorious problem, it is essential to...

(This article belongs to the Special Issue Discrete Event Dynamic Systems and Applications)
  • Article
  • Open Access
315 Views
27 Pages

3 June 2026

This paper develops a finite-state mathematical framework for structural stability and regime classification in discrete-time state–event–response systems whose effective transition structure is generated endogenously by state-dependent r...

  • Article
  • Open Access
1 Citations
1,157 Views
35 Pages

Temporal reasoning is an important part of the field of time geography and spatio-temporal data science. Recent advances in qualitative temporal reasoning have developed a set of 74 relations that apply between discretized time intervals of at least...

(This article belongs to the Special Issue Spatial Data Science and Knowledge Discovery)
  • Feature Paper
  • Article
  • Open Access
673 Views
41 Pages

We introduce a notion of curvature based on informational holonomy. Let (M,g) be a smooth Riemannian manifold and let π:P→M be a bundle of state spaces equipped fibrewise with a smooth divergence Dx inducing an information metric gPx. Assumin...

  • Article
  • Open Access
550 Views
43 Pages

A Collaborative Scheduling Approach for Sheet Metal Workshops in Printing Equipment Ovens Based on Graph Attention Reinforcement Learning

  • Zhenjie Gao,
  • Shanhui Liu,
  • Gan Shi,
  • Yafeng Sun and ,
  • Xinrui Ge and
  • Yifan Wang
  • + 1 author+ 0 author

30 July 2026

To address the collaborative optimization problem caused by the strong coupling between 2D sheet metal nesting and flexible shop floor scheduling in the sheet metal manufacturing process for color-separation ovens of satellite-type flexographic print...

(This article belongs to the Section A: Computer Science)
  • Article
  • Open Access
216 Views
19 Pages

8 October 2026

A single correlation coefficient computed directly from an undecomposed power time series may obscure coupling patterns associated with short-term fluctuations, stage-wise variations, and long-term trends among heterogeneous source and load nodes. To...

(This article belongs to the Section Electrical, Electronics and Communications Engineering)
  • Article
  • Open Access
1 Citations
2,218 Views
15 Pages

Calculation and Analysis of Petri Net Reachability Graphs by a Think-Globally-Act-Locally Method

  • Chengzong Li,
  • Fubao Jin,
  • Yufeng Chen,
  • Zhiwu Li and ,
  • Murat Uzam and
  • Huimin Ma
  • + 1 author+ 0 author

27 February 2025

A think-globally-act-locally (TGAL) technique is proven to be an effective method to address the state explosion issue for complex discrete event systems modeled with Petri nets. This paper introduces a TGAL-based method for computing and analyzing t...

(This article belongs to the Special Issue Discrete Event Dynamic Systems and Applications)
  • Article
  • Open Access
2 Citations
4,531 Views
23 Pages

In this article, the fast algorithms for the discrete Tchebichef transform (DTT) are proposed for input sequences of lengths in the range from 3 to 8. At present, DTT is widely applied in signal processing, image compression, and video coding. The re...

  • Article
  • Open Access
13 Citations
2,828 Views
22 Pages

Embedded, Real-Time, and Distributed Traveling Wave Fault Location Method Using Graph Convolutional Neural Networks

  • Miguel Jiménez-Aparicio,
  • Javier Hernández-Alvidrez,
  • Armando Y. Montoya and
  • Matthew J. Reno

20 October 2022

This work proposes and develops an implementation of a fault location method to provide a fast and resilient protection scheme for power distribution systems. The method analyzes the transient dynamics of traveling waves (TWs) to generate features us...

  • Article
  • Open Access
11 Views
22 Pages

15 November 2026

When the discrete element method (DEM) models a sequence of snow-removal machines, it is unclear which parts of the final particle state of one stage must be passed to the next and whether a stage can be replaced by a learned surrogate acceptable to...

(This article belongs to the Section Computing and Artificial Intelligence)
  • Article
  • Open Access
8 Citations
2,181 Views
21 Pages

Detection of Cyber-Attacks in a Discrete Event System Based on Deep Learning

  • Sichen Ding,
  • Gaiyun Liu,
  • Li Yin,
  • Jianzhou Wang and
  • Zhiwu Li

25 August 2024

This paper addresses the problem of cyber-attack detection in a discrete event system by proposing a novel model. The model utilizes graph convolutional networks to extract spatial features from event sequences. Subsequently, it employs gated recurre...

(This article belongs to the Special Issue Discrete Event Dynamic Systems and Applications)
  • Article
  • Open Access
2,674 Views
29 Pages

2 December 2022

Description of interacting spin systems relies on understanding the spectral properties of the corresponding spin Hamiltonians. However, the eigenvalue problems arising here lead to algebraic problems too complex to be analytically tractable. This is...

(This article belongs to the Section Physical Chemistry and Chemical Physics)
  • Article
  • Open Access
1,949 Views
13 Pages

24 September 2022

We use the finite dimensional monotonicity methods in order to investigate problems connected with the discrete sx,·-Laplacian on simple, connected, undirected, weighted, and finite graphs with nonlinearities given in a non-potential form. Pos...

(This article belongs to the Section Complexity)
  • Article
  • Open Access
17 Citations
4,613 Views
23 Pages

3 October 2021

Spatial autocorrelation, of which Geary’s c has traditionally been a popular measure, is fundamental to spatial science. This paper provides a new perspective on Geary’s c. We discuss this using concepts from spectral graph theory/linear algebraic gr...

(This article belongs to the Section D1: Probability and Statistics)
  • Article
  • Open Access
5 Citations
2,830 Views
30 Pages

10 November 2020

We propose a novel linear time algorithm which, given any directed weighted graphs a and b with vertex degrees 1 or 2, constructs a sequence of operations transforming a into b. The total cost of operations in this sequence is minimal among all possi...

(This article belongs to the Special Issue Mathematical Logic and Its Applications 2020)
  • Article
  • Open Access
2 Citations
2,893 Views
19 Pages

14 October 2021

For any weighted directed path-cycle graphs, a and b (referred to as structures), and any equal costs of operations (intermergings and duplication), we obtain an algorithm which, by successively applying these operations to a, outputs b if the first...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
1 Citations
2,980 Views
39 Pages

24 April 2023

The paper solves the problem of constructing an evolutionary tree and the evolution of structures along it. This problem has long been posed and extensively researched; it is formulated and discussed below. As a result, we construct an exact cubic-ti...

(This article belongs to the Special Issue Mathematical Logic, Algorithms and Applications)
  • Article
  • Open Access
4 Citations
3,254 Views
10 Pages

On the Study of Rainbow Antimagic Connection Number of Comb Product of Friendship Graph and Tree

  • Brian Juned Septory,
  • Liliek Susilowati,
  • Dafik Dafik and
  • Veerabhadraiah Lokesha

21 December 2022

Given a graph G with vertex set V(G) and edge set E(G), for the bijective function f(V(G))→{1,2,⋯,|V(G)|}, the associated weight of an edge xy∈E(G) under f is w(xy)=f(x)+f(y). If all edges have pairwise distinct weights, the function...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
1,722 Views
7 Pages

15 March 2023

In this note, we will focus on the relationships between the growth rates of several functions that describe the topological shape at infinity of discrete groups. In particular, we will consider, in detail, the notion of the rate of vanishing of the...

(This article belongs to the Section B: Geometry and Topology)

of 10