Skip to Content

852 Results Found

  • Article
  • Open Access
39 Citations
9,495 Views
20 Pages

27 February 2023

Time-optimal trajectory planning is one of the most important ways to improve work efficiency and reduce cost and plays an important role in practical application scenarios of robots. Therefore, it is necessary to optimize the running time of the tra...

(This article belongs to the Special Issue Applied Mathematical Modeling and Optimization)
  • Article
  • Open Access
1,930 Views
16 Pages

13 July 2023

The physical parameters (stiffness, damping) of time-varying (TV) systems under random excitation provide valuable information for their working condition but they are often overwhelmed by noise interference. To overcome this problem, this paper pres...

  • Article
  • Open Access
1 Citations
2,752 Views
17 Pages

21 October 2024

We develop a polynomial time algorithm for the single-source all destinations shortest paths problem for interval temporal graphs (ITGs). While a polynomial time algorithm for this problem is known for contact sequence temporal graphs (CSGs), no such...

(This article belongs to the Special Issue Algorithms for Network Analysis: Theory and Practice)
  • Article
  • Open Access
6 Citations
5,845 Views
15 Pages

12 April 2018

Dynamic Bayesian networks (DBN) are powerful probabilistic representations that model stochastic processes. They consist of a prior network, representing the distribution over the initial variables, and a set of transition networks, representing the...

(This article belongs to the Special Issue Information Theory in Machine Learning and Data Science)
  • Article
  • Open Access
17 Citations
12,726 Views
17 Pages

18 February 2013

The maximum common connected edge subgraph problem is to find a connected graph with the maximum number of edges that is isomorphic to a subgraph of each of the two input graphs, where it has applications in pattern recognition and chemistry. This pa...

(This article belongs to the Special Issue Graph Algorithms)
  • Article
  • Open Access
5 Citations
3,410 Views
20 Pages

A Polynomial-Time Algorithm for Detection of Uncovered Transitions in a Petri Net-Based Concurrent System

  • Marcin Wojnakowski,
  • Maxim Maliński,
  • Remigiusz Wiśniewski,
  • Andrzej Obuchowicz and ,
  • Zhiwu Li and
  • Dawid Konarczak
  • + 1 author+ 0 author

11 January 2025

This paper introduces a novel algorithm for the efficient verification of a Petri net-based concurrent control system. The proposed method is based on the computation of transition invariant coverage to detect possible errors in the modelled system....

  • Article
  • Open Access
2 Citations
3,343 Views
13 Pages

In this paper, a novel escape-time algorithm is proposed to calculate the connectivity’s degree of Julia sets generated from polynomial maps. The proposed algorithm contains both quantitative analysis and visual display to measure the connectivity of...

(This article belongs to the Section Numerical and Computational Methods)
  • Feature Paper
  • Article
  • Open Access
1 Citations
3,901 Views
27 Pages

10 March 2021

A transform approach based on a variable initial time (VIT) formulation is developed for discrete-time signals and linear time-varying discrete-time systems or digital filters. The VIT transform is a formal power series in z−1, which converts functio...

  • Article
  • Open Access
2 Citations
1,373 Views
18 Pages

26 November 2024

Sliding bearings are widely used in wind turbine gearboxes, and the accurate identification of coupling interface loads is critical for ensuring the reliability and performance of these systems. However, the space–time coupling nature of these...

  • Article
  • Open Access
25 Citations
2,485 Views
22 Pages

20 September 2023

Woodworking manipulators are applied in wood processing to promote automatic levels in the wood industry. However, traditional trajectory planning results in low operational stability and inefficiency. Therefore, we propose a method combining 3-5-3 p...

(This article belongs to the Topic Remote Sensing and Visualization Methods: Monitoring, Modeling, Simulations and Interaction of Forest Resource)
  • Article
  • Open Access
6 Citations
6,879 Views
24 Pages

4 November 2024

This paper studies the security issues for cyber–physical systems, aimed at countering potential malicious cyber-attacks. The main focus is on solving the problem of extracting the most vulnerable attack path in a known attack graph, where an a...

(This article belongs to the Section Algorithms for Multidisciplinary Applications)
  • Article
  • Open Access
1 Citations
3,365 Views
11 Pages

2 February 2021

The Disjoint Connecting Paths problem and its capacitated generalization, called Unsplittable Flow problem, play an important role in practical applications such as communication network design and routing. These tasks are NP-hard in general, but var...

(This article belongs to the Special Issue Networks, Communication, and Computing Vol. 2)
  • Article
  • Open Access
1 Citations
3,814 Views
18 Pages

19 March 2024

High-throughput screening systems are robotic cells that automatically scan and analyze thousands of biochemical samples and reagents in real time. The problem under consideration is to find an optimal cyclic schedule of robot moves that ensures maxi...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
3 Citations
2,908 Views
10 Pages

Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs

  • David Schaller,
  • Manuela Geiß,
  • Marc Hellmuth and
  • Peter F. Stadler

29 March 2021

Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are explained by unique least resolved tr...

(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
6 Citations
5,295 Views
19 Pages

Scheduling of Electricity Storage for Peak Shaving with Minimal Device Wear

  • Thijs Van der Klauw,
  • Johann L. Hurink and
  • Gerard J. M. Smit

17 June 2016

In this work, we investigate scheduling problems for electrical energy storage systems and formulate an algorithm that finds an optimal solution with minimal charging cycles in the case of a single device. For the considered problems, the storage sys...

  • Article
  • Open Access

17 November 2026

Modular division is an essential but time-consuming computation in elliptic curve cryptography (ECC). This paper presents evaluation results of polynomial modular division algorithms over Galois binary finite fields using open-source and reproducible...

(This article belongs to the Section Information Security and Privacy)
  • Article
  • Open Access
44 Citations
3,342 Views
23 Pages

Eighth-Kind Chebyshev Polynomials Collocation Algorithm for the Nonlinear Time-Fractional Generalized Kawahara Equation

  • Waleed Mohamed Abd-Elhameed,
  • Youssri Hassan Youssri,
  • Amr Kamel Amin and
  • Ahmed Gamal Atta

In this study, we present an innovative approach involving a spectral collocation algorithm to effectively obtain numerical solutions of the nonlinear time-fractional generalized Kawahara equation (NTFGKE). We introduce a new set of orthogonal polyno...

(This article belongs to the Special Issue Numerical Solution and Applications of Fractional Differential Equations)
  • Article
  • Open Access
13 Citations
6,085 Views
20 Pages

Optimal Algorithms for Sorting Permutations with Brooms

  • Indulekha Thekkethuruthel Sadanandan and
  • Bhadrachalam Chitturi

21 June 2022

Sorting permutations with various operations has applications in genetics and computer interconnection networks where an operation is specified by its generator set. A transposition tree T=(V,E) is a spanning tree over n vertices v1,v2,…vn. T denotes...

(This article belongs to the Collection Feature Papers in Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
4 Citations
1,976 Views
19 Pages

28 June 2024

Unmanned aerial vehicles (UAVs, drones) are not just a technological achievement based on modern ideas of artificial intelligence; they also provide a sustainable solution for green technologies in logistics, transport, and material handling. In part...

(This article belongs to the Special Issue Scheduling Theory and Algorithms for Sustainable Manufacturing)
  • Article
  • Open Access
10 Citations
4,175 Views
22 Pages

9 April 2021

This paper investigates bilevel optimization models for demand response management, and highlights the often overlooked consequences of a common modeling assumption in the field. That is, the overwhelming majority of existing research deals with the...

(This article belongs to the Section F: Electrical Engineering)
  • Article
  • Open Access
3 Citations
5,470 Views
10 Pages

8 December 2021

A classic and fundamental result, known as the Lovász Local Lemma, is a gem in the probabilistic method of combinatorics. At a high level, its core message can be described by the claim that weakly dependent events behave similarly to independ...

(This article belongs to the Special Issue Surveys in Algorithm Analysis and Complexity Theory)
  • Article
  • Open Access
2 Citations
7,778 Views
10 Pages

9 October 2008

In this paper we consider a basic clustering problem that has uses in bioinformatics. A structural fragment is a sequence of l points in a 3D space, where l is a fixed natural number. Two structural fragments f1 and f2 are equivalent if and only if f...

  • Article
  • Open Access
4 Citations
9,904 Views
12 Pages

Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists

  • Takao Inoshita,
  • Robert W. Irving,
  • Kazuo Iwama,
  • Shuichi Miyazaki and
  • Takashi Nagase

28 May 2013

In the stable marriage problem, any instance admits the so-called man-optimal stable matching, in which every man is assigned the best possible partner. However, there are instances for which all men receive low-ranked partners even in the man-optima...

(This article belongs to the Special Issue Special Issue on Matching under Preferences)
  • Article
  • Open Access
1 Citations
1,894 Views
27 Pages

In the absence of a priori knowledge about target motion characteristics, the task of tracking complex maneuvering targets remains challenging. A multi-model polynomial-based complex target tracking method is presented to address this issue. Observat...

  • Article
  • Open Access
1 Citations
842 Views
10 Pages

5 March 2026

The efficient minus domination problem (EMDP) and the efficient signed domination problem (ESDP) are domination-type problems in graphs. These problems are known to be NP-complete on chordal graphs and polynomially solvable on chain interval graphs,...

(This article belongs to the Special Issue Advances in Graph Theory with Its Applications)
  • Article
  • Open Access
292 Views
7 Pages

3 August 2026

This paper investigates the constrained two-maxian problem defined on block graphs, a special class of composite graphs containing trees and cacti as subclasses. The problem requires placing two facilities on a block graph such that the Euclidean/top...

(This article belongs to the Section D2: Operations Research and Fuzzy Decision Making)
  • Article
  • Open Access
2,596 Views
15 Pages

An Improved Coppersmith Algorithm Based on Block Preprocessing

  • Lu Zhang,
  • Baodong Qin,
  • Wen Gao and
  • Yiyuan Luo

5 January 2024

Since Coppersmith proposed the use of the LLL algorithm to solve univariate modular polynomial equations at EUROCRYPT’96, it has sparked a fervent research interest in lattice analysis among cryptographers. Despite its polynomial-time nature, t...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
7 Citations
4,057 Views
21 Pages

26 June 2022

The Rivest–Shamir–Adleman (RSA) cryptosystem is currently the most influential and commonly used algorithm in public-key cryptography. Whether the security of RSA is equivalent to the intractability of the integer factorization problem is...

(This article belongs to the Special Issue Recent Advances in Security, Privacy, and Applied Cryptography)
  • Article
  • Open Access
1 Citations
3,255 Views
21 Pages

Integration of Polynomials Times Double Step Function in Quadrilateral Domains for XFEM Analysis

  • Sebastiano Fichera,
  • Gregorio Mariggiò,
  • Mauro Corrado and
  • Giulio Ventura

4 June 2023

The numerical integration of discontinuous functions is an abiding problem addressed by various authors. This subject gained even more attention in the context of the extended finite element method (XFEM), in which the exact integration of discontinu...

(This article belongs to the Special Issue Computational Methods and Optimization for Numerical Analysis)
  • Article
  • Open Access
698 Views
26 Pages

3 May 2026

The score set of a tournament is defined as the set of its distinct out-degrees. In 1978, Reid proposed the conjecture that for any set of nonnegative integers D, there exists a tournament T with a score set D. In 1989, Yao presented an arithmetic pr...

  • Article
  • Open Access
8 Citations
1,035 Views
23 Pages

Numerical Treatment of the Time-Fractional Kuramoto–Sivashinsky Equation Using a Combined Chebyshev-Collocation Approach

  • Waleed Mohamed Abd-Elhameed,
  • Mohamed A. Abdelkawy,
  • Naher Mohammed A. Alsafri and
  • Ahmed Gamal Atta

In this paper, we present a collocation algorithm for numerically treating the time-fractional Kuramoto–Sivashinsky equation (TFKSE). Certain orthogonal polynomials, which are expressed as combinations of Chebyshev polynomials, and their shifte...

(This article belongs to the Special Issue Numerical Solution and Applications of Fractional Differential Equations, 3rd Edition)
  • Article
  • Open Access
5 Citations
1,733 Views
27 Pages

An Improved Multi-Chaotic Public Key Algorithm Based on Chebyshev Polynomials

  • Chunfu Zhang,
  • Jing Bai,
  • Yanchun Liang,
  • Adriano Tavares and ,
  • Lidong Wang,
  • Tiago Gomes and
  • Sandro Pinto
  • + 2 authors+ 0 author

2 September 2024

Due to the similar characteristics of chaotic systems and cryptography, public key encryption algorithms based on chaotic systems are worth in-depth research and have high value for the future. Chebyshev polynomials have good properties and are often...

  • Article
  • Open Access
5 Citations
3,712 Views
11 Pages

Acceleration of Wheel Factoring Techniques

  • Alaa M. Zaki,
  • M. E. Bakr,
  • Arwa M. Alsahangiti,
  • Saima Khan Khosa and
  • Khaled A. Fathy

1 March 2023

The efficiency with which an integer may be factored into its prime factors determines several public key cryptosystems’ security in use today. Although there is a quantum-based technique with a polynomial time for integer factoring, on a tradi...

  • Article
  • Open Access
5 Citations
1,454 Views
28 Pages

17 September 2025

This paper proposes a quantum algorithm, named Dicke state quantum search (DSQS), to set qubits in the Dicke state |Dkn⟩ of D states in superposition to locate the target inputs or solutions of specific patterns among 2n unstructured input ins...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
4 Citations
4,046 Views
11 Pages

High-Speed Variable Polynomial Toeplitz Hash Algorithm Based on FPGA

  • Si-Cheng Huang,
  • Shan Huang,
  • Hua-Lei Yin,
  • Qing-Li Ma and
  • Ze-Jie Yin

11 April 2023

In the Quantum Key Distribution (QKD) network, authentication protocols play a critical role in safeguarding data interactions among users. To keep pace with the rapid advancement of QKD technology, authentication protocols must be capable of process...

(This article belongs to the Special Issue Quantum Communication and Quantum Key Distribution)
  • Article
  • Open Access
2 Citations
3,281 Views
19 Pages

Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints

  • Yasuaki Kobayashi,
  • Kazuhiro Kurita,
  • Kevin Mann,
  • Yasuko Matsui and
  • Hirotaka Ono

17 February 2025

In this paper, we consider the minimal vertex cover and minimal dominating sets with capacity and/or connectivity constraint enumeration problems. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs. For the...

(This article belongs to the Special Issue Selected Algorithmic Papers from IWOCA 2024)
  • Article
  • Open Access
36 Citations
3,558 Views
24 Pages

Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials

  • Khaled A. AL-Utaibi,
  • Sadiq H. Abdulhussain,
  • Basheera M. Mahmmod,
  • Marwah Abdulrazzaq Naser and ,
  • Muntadher Alsabah and
  • Sadiq M. Sait
  • + 1 author+ 0 author

3 September 2021

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. T...

(This article belongs to the Section Signal and Data Analysis)
  • Article
  • Open Access
2 Citations
745 Views
22 Pages

Delannoy Tau-Based Numerical Procedure for the Time-Fractional Cable Model

  • Ahmed Gamal Atta,
  • Mohamed A. Abdelkawy,
  • Naher Mohammed A. Alsafri and
  • Waleed Mohamed Abd-Elhameed

8 November 2025

This study uses the spectral tau method to treat the time-fractional cable equation (TFCE). The proposed algorithm uses the shifted Delannoy polynomials, which are non-symmetric orthogonal. The orthogonality property of the non-symmetric shifted Dela...

(This article belongs to the Special Issue Symmetry in Fractional Derivatives, Fractional Equations and Fractional Order Systems)
  • Article
  • Open Access
1 Citations
3,025 Views
17 Pages

Red–Blue k-Center Clustering with Distance Constraints

  • Marzieh Eskandari,
  • Bhavika B. Khare,
  • Nirman Kumar and
  • Bahram Sadeghi Bigham

2 February 2023

We consider a variant of the k-center clustering problem in IRd, where the centers can be divided into two subsets—one, the red centers of size p, and the other, the blue centers of size q, such that p+q=k, and each red center and each blue cen...

(This article belongs to the Special Issue Advances in Discrete Applied Mathematics and Graph Theory, 2nd Edition)
  • Article
  • Open Access
3 Citations
557 Views
24 Pages

16 March 2026

This paper develops a numerical algorithm for treating the modified anomalous time-fractional sub-diffusion problems (MAFSDPs). The proposed numerical algorithm relies on the tau method. The basis functions, namely, shifted Dickson polynomials of the...

(This article belongs to the Special Issue Theory and Applications of Fractional Models)
  • Article
  • Open Access
2,103 Views
21 Pages

In this paper, we develop an exact schedulability test and sufficient infeasibility test for fixed-priority scheduling on multiprocessor platforms. We base our tests on presenting real-time systems as a Kripke model for dynamic real-time systems with...

(This article belongs to the Section Control and Systems Engineering)
  • Feature Paper
  • Article
  • Open Access
6 Citations
5,004 Views
16 Pages

5 June 2018

We study a scheduling problem in which jobs with release times and due dates are to be processed on a single machine. With the primary objective to minimize the maximum job lateness, the problem is strongly NP-hard. We describe a general algorithmic...

(This article belongs to the Special Issue Algorithms for Scheduling Problems)
  • Article
  • Open Access
8 Citations
3,477 Views
15 Pages

Trigonometric Embeddings in Polynomial Extended Mode Decomposition—Experimental Application to an Inverted Pendulum

  • Camilo Garcia-Tenorio,
  • Gilles Delansnay,
  • Eduardo Mojica-Nava and
  • Alain Vande Wouwer

15 May 2021

The extended dynamic mode decomposition algorithm is a tool for accurately approximating the point spectrum of the Koopman operator. This algorithm provides an approximate linear expansion of non-linear discrete-time systems, which can be useful for...

(This article belongs to the Special Issue Dynamical Systems and Operator Theory)
  • Communication
  • Open Access
2 Citations
2,715 Views
12 Pages

20 June 2024

In this paper, the optimal approximation algorithm is proposed to simplify non-linear functions and/or discrete data as piecewise polynomials by using the constrained least squares. In time-sensitive applications or in embedded systems with limited r...

(This article belongs to the Section Sensors and Robotics)
  • Article
  • Open Access
6 Citations
2,740 Views
22 Pages

High-Performance Krawtchouk Polynomials of High Order Based on Multithreading

  • Wameedh Nazar Flayyih,
  • Ahlam Hanoon Al-sudani,
  • Basheera M. Mahmmod,
  • Sadiq H. Abdulhussain and
  • Muntadher Alsabah

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability...

(This article belongs to the Section Computational Engineering)
  • Article
  • Open Access
40 Citations
7,770 Views
41 Pages

Bernstein Polynomial-Based Method for Solving Optimal Trajectory Generation Problems

  • Calvin Kielas-Jensen,
  • Venanzio Cichella,
  • Thomas Berry,
  • Isaac Kaminer and ,
  • Claire Walton and
  • Antonio Pascoal
  • + 1 author+ 0 author

27 February 2022

This paper presents a method for the generation of trajectories for autonomous system operations. The proposed method is based on the use of Bernstein polynomial approximations to transcribe infinite dimensional optimization problems into nonlinear p...

(This article belongs to the Special Issue Motion Optimization and Control of Single and Multiple Autonomous Aerial, Land, and Marine Robots)
  • Article
  • Open Access
3 Citations
3,502 Views
12 Pages

Fast Computation of LSP Frequencies Using the Bairstow Method

  • Yuqun Xue,
  • Zhijiu Zhu,
  • Jianhua Jiang,
  • Yi Zhan and ,
  • Zenghui Yu,
  • Xiaohua Fan and
  • Shushan Qiao
  • + 2 authors+ 0 author

Linear prediction is the kernel technology in speech processing. It has been widely applied in speech recognition, synthesis, and coding, and can efficiently and correctly represent the speech frequency spectrum with only a few parameters. Line Spect...

(This article belongs to the Section Circuit and Signal Processing)
  • Article
  • Open Access
17 Citations
2,952 Views
18 Pages

5 December 2020

Biomorphs are graphic objects with very interesting shapes resembling unicellular and microbial organisms such as bacteria. They have applications in different fields like medical science, art, painting, engineering and the textile industry. In this...

  • Article
  • Open Access
1 Citations
985 Views
27 Pages

Time-Domain Dynamics of Fractional Viscoelastic Spinning Disks via Shifted Legendre Polynomials

  • Yuxuan Ma,
  • Chunxiao Yu,
  • Yiming Chen,
  • Gang Cheng and
  • Yongxing Wang

This paper presents a novel algorithm for the dynamic analysis of fractional-order viscoelastic spinning disks in the time domain. The novelty mainly lies in the use of the shifted Legendre polynomial algorithm for the direct time-domain numerical an...

of 18