Skip to Content

852 Results Found

  • Article
  • Open Access
3,093 Views
11 Pages

7 December 2021

It is impossible to effectively modify a string in order to increase its Kolmogorov complexity. However, is it possible to construct a few strings, no longer than the input string, so that most of them have larger complexity? We show that the answer...

(This article belongs to the Special Issue In Memoriam, Solomon Marcus)
  • Article
  • Open Access
3 Citations
2,091 Views
18 Pages

Multithreading-Based Algorithm for High-Performance Tchebichef Polynomials with Higher Orders

  • Ahlam Hanoon Al-sudani,
  • Basheera M. Mahmmod,
  • Firas A. Sabir,
  • Sadiq H. Abdulhussain and ,
  • Muntadher Alsabah and
  • Wameedh Nazar Flayyih
  • + 1 author+ 0 author

27 August 2024

Tchebichef polynomials (TPs) play a crucial role in various fields of mathematics and applied sciences, including numerical analysis, image and signal processing, and computer vision. This is due to the unique properties of the TPs and their remarkab...

  • Article
  • Open Access
6 Citations
3,873 Views
18 Pages

4 April 2017

This paper describes a multiple time interval (“multi-interval”) parameter estimation method. The multi-interval parameter estimation method estimates a parameter from a new multi-interval prediction error polynomial that can simultaneously consider...

(This article belongs to the Section F: Electrical Engineering)
  • Article
  • Open Access
12 Citations
3,289 Views
8 Pages

26 July 2019

In this paper, we study two scheduling problems on a single machine with rejection and an operator non-availability interval. In the operator non-availability interval, no job can be started or be completed. However, a crossover job is allowed such t...

(This article belongs to the Special Issue Advances and Novel Approaches in Discrete Optimization)
  • Article
  • Open Access
19 Citations
2,755 Views
14 Pages

30 November 2021

This paper considers a single-machine scheduling problem with past-sequence-dependent delivery times and the truncated sum-of-processing-times-based learning effect. The goal is to minimize the total costs that comprise the number of early jobs, the...

(This article belongs to the Special Issue Applied Computing and Artificial Intelligence)
  • Article
  • Open Access
363 Views
26 Pages

Performance and Overflow Analysis of Polynomial Multiplication with Lazy Reduction in LightSaber

  • Suchart Khummanee,
  • Chanwit Suwannapong,
  • Sarutte Atsawaraungsuk,
  • Chalida Sanemueang and ,
  • Thipwimon Chompookham and
  • Kritsanapong Somsuk
  • + 1 author+ 0 author

15 August 2026

Polynomial multiplication is the main operation in lattice-based cryptography. Modular reduction is required to maintain the correctness within finite rings. In this study, the application of lazy reduction is chosen to reduce the frequency of modula...

  • Article
  • Open Access
4 Citations
2,632 Views
9 Pages

18 September 2020

In this paper we present an algorithm which counts the number of fixed point orbits of an AND-OR dynamical system. We further extend the algorithm in order to list all its fixed point orbits (FPOs) in polynomial time on the number of FPOs of the system.

(This article belongs to the Special Issue Boolean Networks Models in Science and Engineering)
  • Article
  • Open Access
8 Citations
4,947 Views
21 Pages

A Polynomial Multiplication Accelerator for Faster Lattice Cipher Algorithm in Security Chip

  • Changbao Xu,
  • Hongzhou Yu,
  • Wei Xi,
  • Jianyang Zhu and ,
  • Chen Chen and
  • Xiaowen Jiang
  • + 1 author+ 0 author

14 February 2023

Polynomial multiplication is the most computationally expensive part of the lattice-based cryptography algorithm. However, the existing acceleration schemes have problems, such as low performance and high hardware resource overhead. Based on the poly...

(This article belongs to the Topic Cyber Security and Critical Infrastructures)
  • Article
  • Open Access
5 Citations
1,122 Views
20 Pages

5 September 2025

This study is devoted to solving the nonlinear inhomogeneous time-fractional FitzHugh–Nagumo differential problem (TFFNDP) using the spectral modified collocation method. The proposed algorithm uses non-symmetric polynomials, namely shifted Leg...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
10 Citations
3,560 Views
14 Pages

In this study, an efficacious method for solving viscoelastic dynamic plates in the time domain is proposed for the first time. The differential operator matrices of different orders of Bernstein polynomials algorithm are adopted to approximate the t...

(This article belongs to the Special Issue Applications of Fractional Operator in Image Processing and Stability of Control Systems)
  • Article
  • Open Access
1 Citations
2,421 Views
16 Pages

23 June 2020

The max-Łukasiewicz algebra describes fuzzy systems working in discrete time which are based on two binary operations: the maximum and the Łukasiewicz triangular norm. The behavior of such a system in time depends on the solvability of the correspond...

(This article belongs to the Special Issue Fuzzy Sets, Fuzzy Logic and Their Applications 2020)
  • Article
  • Open Access
85 Citations
5,863 Views
18 Pages

Kinematics Model Optimization Algorithm for Six Degrees of Freedom Parallel Platform

  • Mingzhe Liu,
  • Qiuxiang Gu,
  • Bo Yang,
  • Zhengtong Yin and ,
  • Shan Liu,
  • Lirong Yin and
  • Wenfeng Zheng
  • + 2 authors+ 0 author

27 February 2023

The attitude closed-loop control of the parallel platform in the working space needs to determine the relationship between the pose of the top moving platform and the length of each mechanical arm, that is, the kinematics problem of the parallel plat...

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

Compact and Low-Latency FPGA-Based Number Theoretic Transform Architecture for CRYSTALS Kyber Postquantum Cryptography Scheme

  • Binh Kieu-Do-Nguyen,
  • Nguyen The Binh,
  • Cuong Pham-Quoc,
  • Huynh Phuc Nghi and ,
  • Ngoc-Thinh Tran,
  • Trong-Thuc Hoang and
  • Cong-Kha Pham
  • + 2 authors+ 0 author

11 July 2024

In the modern era of the Internet of Things (IoT), especially with the rapid development of quantum computers, the implementation of postquantum cryptography algorithms in numerous terminals allows them to defend against potential future quantum atta...

(This article belongs to the Section Information Systems)
  • Article
  • Open Access
75 Views
46 Pages

4 November 2026

Cooperative games with transferable utility are a standard framework for modeling collaboration, fair division, cost sharing, and coalition formation. Computing central solution concepts such as the Shapley value, the core, the least core, and the nu...

  • Article
  • Open Access
4 Citations
4,914 Views
27 Pages

19 December 2019

We present a detailed survey of results and two new results on graphical models of uncertainty and associated optimization problems. We focus on two well-studied models, namely, the Random Failure (RF) model and the Linear Reliability Ordering (LRO)...

(This article belongs to the Special Issue New Frontiers in Parameterized Complexity and Algorithms)
  • Article
  • Open Access
7 Citations
2,924 Views
17 Pages

9 November 2022

To obtain high-precision for focal length fitting and improve the visible-light camera autofocusing speed, simultaneously, the backlash caused by gear gaps is eliminated. We propose an improved RBF (Radical Basis Function) adaptive neural network (AN...

(This article belongs to the Section Physical Sensors)
  • Article
  • Open Access
2 Citations
3,431 Views
16 Pages

27 December 2023

The minimum-cost arborescence problem is a well-studied problem. Polynomial-time algorithms for solving it exist. Recently, a new variation of the problem called the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times was pres...

(This article belongs to the Special Issue 2022 and 2023 Selected Papers from Algorithms Editorial Board Members)
  • Article
  • Open Access
4 Citations
380 Views
22 Pages

Highly Accurate Galerkin Approach for Modified Anomalous Time-Fractional Sub-Diffusion Equations Based on Fibonacci Coefficient Polynomials

  • Mohamed Adel,
  • Waleed Mohamed Abd-Elhameed,
  • Naher Mohammed A. Alsafri,
  • Mohamed Abbas El-Naggar and
  • Ahmed Gamal Atta

A spectral Galerkin algorithm is developed for the numerical treatment of modified anomalous time-fractional sub-diffusion equations (MATFSDEs). The algorithm is constructed using Fibonacci coefficient polynomials, from which two space–time tri...

(This article belongs to the Special Issue Numerical Analysis and Iterative Methods for Fractional Differential Equations)
  • Article
  • Open Access
6 Citations
1,721 Views
21 Pages

Collocation Method for the Time-Fractional Generalized Kawahara Equation Using a Certain Lucas Polynomial Sequence

  • Waleed Mohamed Abd-Elhameed,
  • Abdulrahman Khalid Al-Harbi,
  • Omar Mazen Alqubori,
  • Mohammed H. Alharbi and
  • Ahmed Gamal Atta

1 February 2025

This paper proposes a numerical technique to solve the time-fractional generalized Kawahara differential equation (TFGKDE). Certain shifted Lucas polynomials are utilized as basis functions. We first establish some new formulas concerned with the int...

(This article belongs to the Special Issue Advances in Differential Equations and Its Applications)
  • Feature Paper
  • Article
  • Open Access
2 Citations
691 Views
24 Pages

28 February 2026

We analyze the power of the recently proposed Lorentz quantum computer (LQC), a theoretical model leveraging hyperbolic bits (hybits) governed by complex Lorentz transformations. We define the complexity class BLQP (bounded-error Lorentz quantum poly...

(This article belongs to the Special Issue Quantum Computation, Quantum AI, and Quantum Information)
  • Article
  • Open Access
10 Citations
6,557 Views
23 Pages

16 May 2022

In engineering applications, where we demand more and more precision, the modeling of systems with hysteretic nonlinearity has received considerable attention. The classical Preisach model (CPM) is currently the most popular for characterizing system...

(This article belongs to the Special Issue Numerical Simulation and Control of Mechanical and Mechatronic Systems)
  • Article
  • Open Access
9 Citations
3,167 Views
23 Pages

Solving and Numerical Simulations of Fractional-Order Governing Equation for Micro-Beams

  • Aimin Yang,
  • Qunwei Zhang,
  • Jingguo Qu,
  • Yuhuan Cui and
  • Yiming Chen

This paper applies a recently proposed numerical algorithm to discuss the deflection of viscoelastic micro-beams in the time domain with direct access. A nonlinear-fractional order model for viscoelastic micro-beams is constructed. Before solving the...

(This article belongs to the Special Issue Application of Fractional Calculus as an Interdisciplinary Modeling Framework)
  • Article
  • Open Access
5 Citations
1,380 Views
22 Pages

Studying the Dynamics Response of Viscoelastic Orthotropic Plates Based on Fractional-Order Derivatives and Shifted Legendre Polynomials

  • Qianqian Fan,
  • Qiumei Liu,
  • Yiming Chen,
  • Yuhuan Cui and ,
  • Jingguo Qu and
  • Lei Wang
  • + 1 author+ 0 author

14 February 2025

This paper primarily investigates the dynamics response of viscoelastic orthotropic plates under a fractional-order derivative model, which is efficiently simulated numerically using the FKV (Fractional Kelvin–Voigt) model and the shifted Legen...

  • Feature Paper
  • Article
  • Open Access
4 Citations
2,821 Views
21 Pages

1 December 2021

The growing interest in intensified process units that improve efficiency by combining several phenomena into one unit, has led to a loss in degrees of freedom when addressing the control scheme of these units. Previous work demonstrated that a novel...

(This article belongs to the Special Issue Redesign Processes in the Age of the Fourth Industrial Revolution)
  • Feature Paper
  • Article
  • Open Access
8 Citations
3,398 Views
42 Pages

14 November 2019

Scheduling jobs with release and due dates on a single machine is a classical strongly NP-hard combination optimization problem. It has not only immediate real-life applications but also it is effectively used for the solution of more complex multipr...

(This article belongs to the Special Issue Advances and Novel Approaches in Discrete Optimization)
  • Article
  • Open Access
15 Citations
3,871 Views
12 Pages

This paper applies a numerical method of polynomial function approximation to the numerical analysis of variable fractional order viscoelastic rotating beam. First, the governing equation of the viscoelastic rotating beam is established based on the...

(This article belongs to the Special Issue 2020 Selected Papers from Fractal Fract’s Editorial Board Members)
  • Article
  • Open Access
5 Citations
4,845 Views
37 Pages

In the geometric data model for spatio-temporal data, introduced by Chomicki and Revesz [1], spatio-temporal data are modelled as a finite collection of triangles that are transformed by time-dependent affinities of the plane. To facilitate querying...

  • Article
  • Open Access
11 Citations
2,658 Views
19 Pages

15 March 2023

This paper investigates single-machine scheduling with a deteriorating maintenance activity, where the processing time of a job depends on whether it is handled before or after the maintenance activity. Under common and slack due date assignments, th...

(This article belongs to the Special Issue Simplifying the Complex: Modeling and Analysis for System Design and Management)
  • Article
  • Open Access
6 Citations
4,264 Views
22 Pages

Timing-Attack-Resistant Acceleration of NTRU Round 3 Encryption on Resource-Constrained Embedded Systems

  • Eros Camacho-Ruiz,
  • Macarena C. Martínez-Rodríguez,
  • Santiago Sánchez-Solano and
  • Piedad Brox

The advent of quantum computing with high processing capabilities will enable brute force attacks in short periods of time, threatening current secure communication channels. To mitigate this situation, post-quantum cryptography (PQC) algorithms have...

(This article belongs to the Special Issue Feature Papers in Hardware Security II)
  • Article
  • Open Access
9 Citations
2,155 Views
15 Pages

18 August 2022

This paper studies a single-machine problem with resource allocation (RA) and deteriorating effect (DE). Under group technology (GT) and limited resource availability, our goal is to determine the schedules of groups and jobs within each group such t...

(This article belongs to the Special Issue Mathematical Methods and Operation Research in Logistics, Project Planning, and Scheduling)
  • Article
  • Open Access
1 Citations
9,132 Views
23 Pages

Optimized AKS Primality Testing: A Fluctuation Theory Perspective

  • Bhupendra Nath Tiwari,
  • Jude Kibinde Kuipo,
  • Joshua M. Adeegbe and
  • Ninoslav Marina

The AKS algorithm is an important breakthrough in showing that primality testing of an integer can be done in polynomial time. In this paper, we study the optimization of its runtime. Namely, given a finite cardinality set of alphabets of a determini...

  • Article
  • Open Access
975 Views
23 Pages

Fast Discrete Krawtchouk Transform Algorithms for Short-Length Input Sequences

  • Marina Polyakova,
  • Aleksandr Cariow and
  • Janusz P. Papliński

8 October 2025

This paper presents new fast discrete Krawtchouk transform (DKT) algorithms for input sequences of length 3 to 8. Small-sized DKT algorithms can be utilized in image processing applications to extract local image features formed by a sliding spatial...

(This article belongs to the Section Circuit and Signal Processing)
  • Article
  • Open Access
2 Citations
3,908 Views
16 Pages

19 January 2020

Zero-one quadratic programming is a classical combinatorial optimization problem that has many real-world applications. However, it is well known that zero-one quadratic programming is non-deterministic polynomial-hard (NP-hard) in general. On one ha...

(This article belongs to the Special Issue Optimization for Decision Making II)
  • Article
  • Open Access
863 Views
32 Pages

9 June 2026

With the development of large-scale quantum computers, classical cryptographic algorithms such as RSA or ECC can easily be broken by Shor’s algorithm. Consequently, the cryptography community is shifting its focus toward Post-Quantum Cryptograp...

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

We propose a framework for fitting multivariable fractional polynomial models as special cases of Bayesian generalized nonlinear models, applying an adapted version of the genetically modified mode jumping Markov chain Monte Carlo algorithm. The univ...

(This article belongs to the Section Probability and Statistics)
  • Article
  • Open Access
8 Citations
3,616 Views
28 Pages

An efficient method for detecting the end of a count of a linear feedback shift register (LFSR) is presented. We show how this detector can be used to extend a maximum-length LFSR sequence by a number of states up to one less than the degree of the p...

(This article belongs to the Special Issue CMOS Integrated Circuits Design)
  • Article
  • Open Access
17 Citations
2,766 Views
17 Pages

20 November 2020

We investigate the Pareto-scheduling problem with two competing agents on a single machine to minimize the total weighted completion time of agent A’s jobs and the total weighted late work of agent B’s jobs, the B-jobs having a common due...

(This article belongs to the Special Issue Theoretical and Computational Research in Various Scheduling Models)
  • Article
  • Open Access
7 Citations
4,908 Views
15 Pages

Adding Edges for Maximizing Weighted Reachability

  • Federico Corò,
  • Gianlorenzo D'Angelo and
  • Cristina M. Pinotti

18 March 2020

In this paper, we consider the problem of improving the reachability of a graph. We approach the problem from a graph augmentation perspective, in which a limited set size of edges is added to the graph to increase the overall number of reachable nod...

  • Article
  • Open Access
16 Citations
4,860 Views
12 Pages

12 June 2022

The paper announces a family of exact solutions to Navier–Stokes equations describing gradient inhomogeneous unidirectional fluid motions (nonuniform Poiseuille flows). The structure of the fluid motion equations is such that the incompressibil...

  • Article
  • Open Access
19 Citations
3,605 Views
19 Pages

Industrial Robot Trajectory Optimization Based on Improved Sparrow Search Algorithm

  • Fei Ma,
  • Weiwei Sun,
  • Zhouxiang Jiang,
  • Shuangfu Suo and ,
  • Xiao Wang and
  • Yue Liu
  • + 1 author+ 0 author

20 July 2024

This paper proposes an enhanced multi-strategy sparrow search algorithm to optimize the trajectory of a six-axis industrial robot, addressing issues of low efficiency and high vibration impact on joints during operation. Initially, the improved D-H p...

(This article belongs to the Special Issue Industry 4.0: Intelligent Robots in Smart Manufacturing)
  • Article
  • Open Access
2 Citations
2,741 Views
16 Pages

26 March 2022

This paper proposes a new fast time-delay estimation (TDE) method based on polynomial inversion which addresses the challenges arising from the requirements for high-precision, low-computational-complexity synchronization error estimation in wideband...

(This article belongs to the Section Computing and Artificial Intelligence)
  • Article
  • Open Access
3 Citations
2,865 Views
13 Pages

12 June 2022

Fast determination of satellite visibility with respect to a target area is important for satellite navigation and positioning. In this paper, we propose an adaptive interpolation algorithm based on vertex protection to solve the satellite visibility...

(This article belongs to the Section Remote Sensors)
  • Article
  • Open Access
11 Citations
2,921 Views
22 Pages

Novel Approach by Shifted Fibonacci Polynomials for Solving the Fractional Burgers Equation

  • Mohammed H. Alharbi,
  • Abdullah F. Abu Sunayh,
  • Ahmed Gamal Atta and
  • Waleed Mohamed Abd-Elhameed

This paper analyzes a novel use of the shifted Fibonacci polynomials (SFPs) to treat the time-fractional Burgers equation (TFBE). We first develop the fundamental formulas of these polynomials, which include their power series representation and the...

(This article belongs to the Special Issue Advances in Boundary Value Problems for Fractional Differential Equations, 2nd Edition)
  • Article
  • Open Access
17 Citations
3,690 Views
11 Pages

16 January 2020

In this paper, we consider the single machine scheduling problem with release dates and nonmonotone submodular rejection penalty. We are given a single machine and multiple jobs with probably different release dates and processing times. For each job...

  • Article
  • Open Access
9 Citations
2,987 Views
19 Pages

19 February 2021

As an important application of wireless sensor networks (WSNs), deployment of mobile sensors to periodically monitor (sweep cover) a set of points of interest (PoIs) arises in various applications, such as environmental monitoring and data collection...

(This article belongs to the Section Physical Sensors)
  • Article
  • Open Access
1 Citations
699 Views
20 Pages

6 December 2025

In resource-constrained wireless sensor networks, efficient link scheduling is a well-studied challenge. This problem is NP-hard, indicating that NP (Nondeterministic Polynomial Time) refers to problems whose solutions can be verified in polynomial t...

(This article belongs to the Special Issue Data-Driven or AI-Driven Optimization Algorithms and Their Applications)
  • Article
  • Open Access
575 Views
28 Pages

High-Performance Multithreaded Acceleration of High-Order Discrete Racah Polynomials on Multi-Core Architectures

  • Raafat Salih Muhammad,
  • Hayder S. Radeaf,
  • Hala J. Mohammed,
  • Ahlam Hanoon Al-sudani and ,
  • Basheera M. Mahmmod,
  • Mazin S. AlHakeem,
  • Muntadher Alsabah and
  • Sadiq H. Abdulhussain
  • + 3 authors+ 0 author

26 July 2026

Discrete Racah polynomials (DRPs) are considered essential for several applications such as approximation theory, quantum physics, and digital signal processing. However, the computation of high-order DRPs presents significant numerical and computati...

  • Article
  • Open Access
3 Citations
3,469 Views
28 Pages

29 September 2022

The min-wait foremost, min-hop foremost and min-cost foremost paths and walks problems in interval temporal graphs are considered. We prove that finding min-wait foremost and min-cost foremost walks and paths in interval temporal graphs is NP-hard. W...

(This article belongs to the Collection Feature Papers in Combinatorial Optimization, Graph, and Network Algorithms)
  • Article
  • Open Access
8 Citations
2,933 Views
17 Pages

Motion Planning of an Inchworm Robot Based on Improved Adaptive PSO

  • Binrui Wang,
  • Jianxin Wang,
  • Zhenhai Huang,
  • Weiyi Zhou and ,
  • Xiaofei Zheng and
  • Shunan Qi
  • + 1 author+ 0 author

23 August 2022

Focusing on the motion energy consumption of a self-developed inchworm robot’s peristaltic gait, based on the “error tracking” of cubic polynomial programming in Cartesian space and seventh polynomial programming in joint space, we...

(This article belongs to the Special Issue Intelligent Techniques Used for Robotics)
  • Article
  • Open Access
10 Citations
5,711 Views
19 Pages

A Task-Centric Cooperative Sensing Scheme for Mobile Crowdsourcing Systems

  • Ziwei Liu,
  • Xiaoguang Niu,
  • Xu Lin,
  • Ting Huang and ,
  • Yunlong Wu and
  • Hui Li
  • + 1 author+ 0 author

23 May 2016

In a densely distributed mobile crowdsourcing system, data collected by neighboring participants often exhibit strong spatial correlations. By exploiting this property, one may employ a portion of the users as active participants and set the other us...

(This article belongs to the Special Issue Identification, Information & Knowledge in the Internet of Things)

of 18