Search

There is increasing focus on applying deep learning methods to electrocardiograms (ECGs), with recent studies showing that neural networks (NNs) can predict future heart failure or atrial fibrillation from the ECG alone. However, large numbers of ECGs are needed to train NNs, and many ECGs are currently only in paper format, which are not suitable for NN training. We developed a fully-automated online ECG digitisation tool to convert scanned paper ECGs into digital signals. Using automated horizontal and vertical anchor point detection, the algorithm automatically segments the ECG image into separate images for the 12 leads and a dynamical morphological algorithm is then applied to extract the signal of interest. We then validated the performance of the algorithm on 515 digital ECGs, of which 45 were printed, scanned and redigitised. The automated digitisation tool achieved 99.0% correlation between the digitised signals and the ground truth ECG (n = 515 standard 3-by-4 ECGs) after excluding ECGs with overlap of lead signals. Without exclusion, the performance of average correlation was from 90 to 97% across the leads on all 3-by-4 ECGs. There was a 97% correlation for 12-by-1 and 3-by-1 ECG formats after excluding ECGs with overlap of lead signals. Without exclusion, the average correlation of some leads in 12-by-1 ECGs was 60–70% and the average correlation of 3-by-1 ECGs achieved 80–90%. ECGs that were printed, scanned, and redigitised, our tool achieved 96% correlation with the original signals. We have developed and validated a fully-automated, user-friendly, online ECG digitisation tool. Unlike other available tools, this does not require any manual segmentation of ECG signals. Our tool can facilitate the rapid and automated digitisation of large repositories of paper ECGs to allow them to be used for deep learning projects. [ABSTRACT FROM AUTHOR]

This special issue contains six revised and extended versions of tool papers that appeared in the proceedings of TACAS 2021, the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. The issue is dedicated to the realization of algorithms in tools and the studies of the application of these tools for analysing hard- and software systems. [ABSTRACT FROM AUTHOR]

They give fixed parameter tractable algorithms for the problem parameterized by various structural parameters. The authors give a greedy loop-free algorithm for the exhaustive generation, a successor algorithm that runs in constant amortized time, among other algorithms, as well as results for the fixed spin generalization of this problem. IWOCA (International Workshop on Combinatorial Algorithms) is an annual conference series covering all aspects of combinatorial algorithms. [Extracted from the article]

In this paper, we propose a novel paper currency defect detection algorithm using quaternion uniform strength. We first build paper currency image preprocessing integration framework which includes intensity balancing, paper currency location, and geometric correction. We then propose a global–local paper currency image registration algorithm by moving key areas within certain range which can eliminate the false difference effectively. Finally, the quaternion uniform strength is calculated by using quaternion convolution edge detector. The defect degree of paper currency is determined by using the quaternion uniform color difference. The proposed algorithm is tested using different datasets from five countries: CNY, USD, EUR, VND, and RUB. The experimental results demonstrate that the proposed algorithm yields better results than the existing state-of-the-art paper currency defect detection techniques. The demo of the proposed paper currency defect detection algorithm will be publicly available. [ABSTRACT FROM AUTHOR]

This work describes the log-MAP (BCJR) algorithm implementation of a close to capacity dirty paper coding CODEC. The CODEC consists of eight deep pipeline processors. It decodes blocks of 975 bits in 26.9 ms using less than 9.7% of low-cost FPGA (and no DSP blocks). Two pipelines, for alpha and beta, calculate the values of gamma (of the BCJR) to reduce the storage requirements. The final log-likelihood ratio (LLR) is calculated together with alpha, reusing intermediate results. The number of bits used by the different signals of the processor is easily configurable. It was set to six bits to the channel measure signals and eight bits to log of probability signals like alpha, beta, and others. The CODEC clock was 100 MHz. The achieved bit rate is 36.2 Kbps per CODEC, but multiple CODECs can be fit into a single chip. The CODEC is 3.49 dB from the channel capacity. [ABSTRACT FROM AUTHOR]

Zemblys et al. (Behavior Research Methods, 51(2), 840–864, 2019) reported on a method for the classification of eye-movements ("gazeNet"). I have found three errors and two problems with that paper that are explained herein. Error 1: The gazeNet classification method was built assuming that a hand-scored dataset from Lund University was all collected at 500 Hz, but in fact, six of the 34 recording files were actually collected at 200 Hz. Of the six datasets that were used as the training set for the gazeNet algorithm, two were actually collected at 200 Hz. Problem 1 has to do with the fact that even among the 500 Hz data, the inter-timestamp intervals varied widely. Problem 2 is that there are many unusual discontinuities in the saccade trajectories from the Lund University dataset that make it a very poor choice for the construction of an automatic classification method. Error 2 The gazeNet algorithm was trained on the Lund dataset, and then compared to other methods, not trained on this dataset, in terms of performance on this dataset. This is an inherently unfair comparison, and yet nowhere in the gazeNet paper is this unfairness mentioned. Error 3 arises out of the novel event-related agreement analysis employed by the gazeNet authors. Although the authors intended to classify unmatched events as either false positives or false negatives, many are actually being classified as true negatives. True negatives are not errors, and any unmatched event misclassified as a true negative is actually driving kappa higher, whereas unmatched events should be driving kappa lower. [ABSTRACT FROM AUTHOR]

The latent block model is used to simultaneously rank the rows and columns of a matrix to reveal a block structure. The algorithms used for estimation are often time consuming. However, recent work shows that the log-likelihood ratios are equivalent under the complete and observed (with unknown labels) models and the groups posterior distribution to converge as the size of the data increases to a Dirac mass located at the actual groups configuration. Based on these observations, the algorithm Largest Gaps is proposed in this paper to perform clustering using only the marginals of the matrix, when the number of blocks is very small with respect to the size of the whole matrix in the case of binary data. In addition, a model selection method is incorporated with a proof of its consistency. Thus, this paper shows that studying simplistic configurations (few blocks compared to the size of the matrix or very contrasting blocks) with complex algorithms is useless since the marginals already give very good parameter and classification estimates. [ABSTRACT FROM AUTHOR]

Recent research has focused on applying blockchain technology to solve security-related problems in Internet of Things (IoT) networks. However, the inherent scalability issues of blockchain technology become apparent in the presence of a vast number of IoT devices and the substantial data generated by these networks. Therefore, in this paper, we use a lightweight consensus algorithm to cater to these problems. We propose a scalable blockchain-based framework for managing IoT data, catering to a large number of devices. This framework utilizes the Delegated Proof of Stake (DPoS) consensus algorithm to ensure enhanced performance and efficiency in resource-constrained IoT networks. DPoS being a lightweight consensus algorithm leverages a selected number of elected delegates to validate and confirm transactions, thus mitigating the performance and efficiency degradation in the blockchain-based IoT networks. In this paper, we implemented an Interplanetary File System (IPFS) for distributed storage, and Docker to evaluate the network performance in terms of throughput, latency, and resource utilization. We divided our analysis into four parts: Latency, throughput, resource utilization, and file upload time and speed in distributed storage evaluation. Our empirical findings demonstrate that our framework exhibits low latency, measuring less than 0.976 ms. The proposed technique outperforms Proof of Stake (PoS), representing a state-of-the-art consensus technique. We also demonstrate that the proposed approach is useful in IoT applications where low latency or resource efficiency is required. [ABSTRACT FROM AUTHOR]

In order to address the challenges of identifying, detecting, and tracking moving objects in video surveillance, this paper emphasizes image-based dynamic entity detection. It delves into the complexities of numerous moving objects, dense targets, and intricate backgrounds. Leveraging the You Only Look Once (YOLOv3) algorithm framework, this paper proposes improvements in image segmentation and data filtering to address these challenges. These enhancements form a novel multi-object detection algorithm based on an improved YOLOv3 framework, specifically designed for video applications. Experimental validation demonstrates the feasibility of this algorithm, with success rates exceeding 60% for videos such as "jogging", "subway", "video 1", and "video 2". Notably, the detection success rates for "jogging" and "video 1" consistently surpass 80%, indicating outstanding detection performance. Although the accuracy slightly decreases for "Bolt" and "Walking2", success rates still hover around 70%. Comparative analysis with other algorithms reveals that this method's tracking accuracy surpasses that of particle filters, Discriminative Scale Space Tracker (DSST), and Scale Adaptive Multiple Features (SAMF) algorithms, with an accuracy of 0.822. This indicates superior overall performance in target tracking. Therefore, the improved YOLOv3-based multi-object detection and tracking algorithm demonstrates robust filtering and detection capabilities in noise-resistant experiments, making it highly suitable for various detection tasks in practical applications. It can address inherent limitations such as missed detections, false positives, and imprecise localization. These improvements significantly enhance the efficiency and accuracy of target detection, providing valuable insights for researchers in the field of object detection, tracking, and recognition in video surveillance. [ABSTRACT FROM AUTHOR]

The problem of finding a maximum size matching in a graph (known as the maximum matching problem) is one of the most classical problems in computer science. Despite a significant body of work dedicated to the study of this problem in the data stream model, the state-of-the-art single-pass semi-streaming algorithm for it is still a simple greedy algorithm that computes a maximal matching, and this way obtains 1 / 2 -approximation. Some previous works described two/three-pass algorithms that improve over this approximation ratio by using their second and third passes to improve the above mentioned maximal matching. One contribution of this paper continues this line of work by presenting new three-pass semi-streaming algorithms that work along these lines and obtain improved approximation ratios of 0.6111 and 0.5694 for triangle-free and general graphs, respectively. Unfortunately, a recent work Konrad and Naidu (Approximation, randomization, and combinatorial optimization. Algorithms and techniques, APPROX/RANDOM 2021, August 16–18, 2021. LIPIcs, vol 207, pp 19:1–19:18, 2021. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.19) shows that the strategy of constructing a maximal matching in the first pass and then improving it in further passes has limitations. Additionally, this technique is unlikely to get us closer to single-pass semi-streaming algorithms obtaining a better than 1 / 2 -approximation. Therefore, it is interesting to come up with algorithms that do something else with their first pass (we term such algorithms non-maximal-matching-first algorithms). No such algorithms were previously known, and the main contribution of this paper is describing such algorithms that obtain approximation ratios of 0.5384 and 0.5555 in two and three passes, respectively, for general graphs. The main significance of our results is not in the numerical improvements, but in demonstrating the potential of non-maximal-matching-first algorithms. [ABSTRACT FROM AUTHOR]

In industry, the task of defect classification and defect localization is an important part of defect detection system. However, existing studies only focus on one task and it is difficult to ensure the accuracy of both tasks. This paper proposes a defect detection system based on improved Yolo_v4, which greatly improves the detection ability of minor defects. For K_Means algorithm clustering prianchors question with strong subjectivity, the paper proposes the Density Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm to determine the number of Anchors. To solve the problem of low detection rate of small targets caused by insufficient reuse rate of low-level features in CSPDarknet53 feature extraction network, this paper proposes an ECA-DenseNet-BC-121 feature extraction network to improve it. And the Dual Channel Feature Enhancement (DCFE) module is proposed to improve the local information loss and gradient propagation obstruction caused by quad chain convolution in PANet networks to improve the robustness of the model. The experimental results on the fabric surface defect detection datasets show that the mAP of the improved Yolo_v4 is 98.97%, which is 7.67% higher than SSD, 3.75% higher than Faster_RCNN, 10.82% higher than Yolo_v4 tiny, and 5.35% higher than Yolo_v4, and the detection speed reaches 39.4 fps. It can meet the real-time monitoring needs of industrial sites. [ABSTRACT FROM AUTHOR]

In this paper, we study the power and limitations of component-stable algorithms in the low-space model of massively parallel computation (MPC). Recently Ghaffari, Kuhn and Uitto (FOCS 2019) introduced the class of component-stable low-space MPC algorithms, which are, informally, those algorithms for which the outputs reported by the nodes in different connected components are required to be independent. This very natural notion was introduced to capture most (if not all) of the known efficient MPC algorithms to date, and it was the first general class of MPC algorithms for which one can show non-trivial conditional lower bounds. In this paper we enhance the framework of component-stable algorithms and investigate its effect on the complexity of randomized and deterministic low-space MPC. Our key contributions include: 1. We revise and formalize the lifting approach of Ghaffari, Kuhn and Uitto. This requires a very delicate amendment of the notion of component stability, which allows us to fill in gaps in the earlier arguments. 2. We also extend the framework to obtain conditional lower bounds for deterministic algorithms and fine-grained lower bounds that depend on the maximum degree Δ . 3. We demonstrate a collection of natural graph problems for which deterministic component-unstable algorithms break the conditional lower bound obtained for component-stable algorithms. This implies that, in the context of deterministic algorithms, component-stable algorithms are conditionally weaker than the component-unstable ones. 4. We also show that the restriction to component-stable algorithms has an impact in the randomized setting. We present a natural problem which can be solved in O(1) rounds by a component-unstable MPC algorithm, but requires Ω (log log ∗ n) rounds for any component-stable algorithm, conditioned on the connectivity conjecture. Altogether our results imply that component-stability might limit the computational power of the low-space MPC model, at least in certain contexts, paving the way for improved upper bounds that escape the conditional lower bound setting of Ghaffari, Kuhn, and Uitto. [ABSTRACT FROM AUTHOR]

This paper is about the opposite of judgement and calculation. This opposition has been a traditional anchor of critiques concerned with the rise of AI decision making over human judgement. Contrary to these approaches, it is argued that human judgement is not and cannot be replaced by calculation, but that it is human judgement that contextualises computational structures and gives them meaning and purpose. The article focuses on the epistemic structure of algorithms and artificial neural networks to find that they always depend on human judgement to be related to real life objects or purposes. By introducing the philosophical concept of judgement, it becomes clear that the property of judgement to provide meaning and purposiveness is based on the temporality of human life and the ambiguity of language, which quantitative processes lack. A juxtaposition shows that calculations and clustering can be used and referred to in more or less prejudiced and reflecting as well as opaque and transparent ways, but thereby always depend on human judgement. The paper clearly asserts that the transparency of AI is necessary for their autonomous use. This transparency requires the explicitness of the judgements that constitute these computational structures, thereby creating an awareness of the conditionality of such epistemic entities. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of computing the entire sequence of the maximum degree of minors of a block-structured symbolic matrix (a generic partitioned polynomial matrix) A = (A α β x α β t d α β ) , where A α β is a 2 × 2 matrix over a field F , x α β is an indeterminate, and d α β is an integer for α = 1 , 2 , ⋯ , μ and β = 1 , 2 , ⋯ , ν , and t is an additional indeterminate. This problem can be viewed as an algebraic generalization of the maximum weight bipartite matching problem. The main result of this paper is a combinatorial -time algorithm for computing the entire sequence of the maximum degree of minors of a (2 × 2) -type generic partitioned polynomial matrix of size 2 μ × 2 ν . We also present a minimax theorem, which can be used as a good characterization (NP ∩ co-NP characterization) for the computation of the maximum degree of minors of order k. Our results generalize the classical primal-dual algorithm (the Hungarian method) and minimax formula (Egerváry's theorem) for the maximum weight bipartite matching problem. [ABSTRACT FROM AUTHOR]

Fruit recognition and location are the premises of robot automatic picking. YOLOv3 has been used to detect different fruits in complex environment. However, for the object with definite features, the complex network structure will increase the computing time and may cause overfitting. Therefore, this paper has carried out a lightweight design for the YOLOv3. This paper proposed an improved T-Net to detect tomato images. Firstly, the T-Net reduces the residual network layers. This paper changed the number of cycles in each group of the residual unit to 1, 2, 2, 1, and 1. Second, two feature layers with different scales are selected according to the features of tomatoes. Meanwhile, the convolutional layer at the neck has been reduced by two layers. Finally, the location and approximate diameter of the ripe tomato are obtained by combining the node information of the Intel D435i camera and T-Net in the Robot Operation System. T-Net obtains mean average precision (mAP) of 99.2%, F1-score of 98.9%, precision of 99.0%, and recall of 98.8% at a detection rate of 104.2 FPS. The proposed T-Net has outperformed the YOLOv3 with 0.4%, 0.1%, and 0.2% increase in precision, mAP, and F1-score. The detection speed of T-Net is 1.8 times faster than YOLOv3. The mean errors of the center coordinates and diameter of the tomato are 8.5 mm and 2.5 mm, respectively. This model provides a method for efficient real-time detection and location of tomatoes. [ABSTRACT FROM AUTHOR]

With the rapid development of information technology, the amount of information in all walks of life has also increased sharply, and the information that people face is heterogeneous, large-scale and dynamic. This is an urgent problem to be solved in the research of data mining system based on heterogeneous cellular network algorithm, and it is also the focus of academic attention. At present, entrepreneurship has become an important way for college students to find employment. However, the risks and challenges of entrepreneurship are also increasing, so it is necessary to find an innovative way to solve these problems. This paper aims to explore the application of quantum computing based on heterogeneous cellular network algorithm in college students' entrepreneurial management, in order to provide a new solution. This paper studies the basic principle of heterogeneous cellular network algorithm and quantum computing, and puts forward the method of applying these two technologies to college students' entrepreneurial management. By using heterogeneous cellular network algorithms to manage the flow of information during the startup process, and using quantum computing to optimize the decision-making process. After experiment and analysis, this method can improve the accuracy and efficiency of entrepreneurial decision-making, while reducing risks and challenges, with high feasibility and practicability, and can help college students better cope with the challenges in the process of entrepreneurship and achieve better results. [ABSTRACT FROM AUTHOR]

In this paper two procedures are developed for the identification of the parameters contained in an orthotropic elastic-plastic-hardening model for free standing foils, particularly of paper and paperboard. The experimental data considered are provided by cruciform tests and digital image correlation. A simplified version of the constitutive model proposed by Xia et al. (Int J Solids Struct 39:4053-4071, ) is adopted. The inverse analysis is comparatively performed by the following alternative computational methodologies: (a) mathematical programming by a trust-region algorithm; (b) proper orthogonal decomposition and artificial neural network. The second procedure rests on preparatory once-for-all computations and turns out to be applicable economically and routinely in industrial environments. [ABSTRACT FROM AUTHOR]

In this paper, Protist algorithm (PA) and Otocyon megalotis optimization algorithm (OOA) are applied to solve the power loss lessening problem. Protist Algorithm (PA) is modelled based on the Protist's natural activities. Protist exists in moist places. The leading nutritious phase is Plasmodium, the energetic and vibrant phase of Protist. In this segment, the organic substance in Protist search for food in surroundings and conceals enzymes for digestion. Natural actions of Otocyon megalotis are emulated to design the OOA approach. In the projected OOA searching of regions in exploration, for foodstuff the Otocyon megalotis mark the prey in the space is indicated as a global exploration. Real power loss reduction and Voltage stability enhancement are the key objectives of the paper. To solve the problem, Protist algorithm (PA) and Otocyon megalotis optimization algorithm. In the course of the migration procedure, the anterior end outspreads and interconnected arterial system that authorize cytoplasm to stream inside. Then, mutation and cross-over probability are employed to augment the performance of the Protist algorithm (PA). With this integration engendering of the population is done. Mutation classes the population exploration agents (PN) in uphill order conferring to the agents appropriateness (fitness) cost. Consequently, the technique splits the organized agents into three fragments rendering to their fitness value. In which PN/3 denotes to the population possess pre-eminent (aptness) fitness values, subsequently with second pre-eminent and poorest aptness (fitness) values. Then, in this paper, Otocyon megalotis optimization algorithm (OOA) is applied for solving the Power loss lessening problem. In the subsequent segment, navigate during the haunt to seal prey previous to the hit was replicated as a local search. In exploration, the data obtained is shared to all the associates of the family unit for continued existence and growth. Examination of the nearby terrain is modelled with reference to the fitness of all entities. Most excellent entity has investigated the majority fascinating terrain and it will be shared with family unit of Otocyon megalotis. Primarily, Otocyon megalotis show that it not involved in hunting. Conversely, as soon as moving near to prey Otocyon megalotis will perform the attack in quick mode. This approach imitated and designed in the local search segment. Authenticity of the Protist algorithm (PA) and Otocyon megalotis optimization algorithm (OOA) is corroborated in 23 benchmark functions, IEEE 30, 57, 300 and 354 test systems. Power Loss reduction achieved with voltage stability enhancement. Real power loss reduction attained. Both the Protist algorithm (PA) and Otocyon megalotis optimization algorithm (OOA) performed well in solving the Power loss reduction problem. [ABSTRACT FROM AUTHOR]

Manual term extraction is similar to literal meaning: A translator browses text, classifies words, and prepares for translation. Terminology, as a centralized carrier of expertise, creation, popularization, and disappearance, dynamically reflects the development and evolution of an industry. The automatic extraction of terminology is a key technology for creating a professional terminology database, and it is also a key topic in the field of natural language processing. The purpose of this paper is to study how to analyse a term extraction algorithm based on machine learning and a comprehensive feature strategy. Focusing on the problems of poor generality and single statistical features of current term extraction algorithms, this paper proposes an improved domain ontology term extraction algorithm based on a comprehensive feature strategy. Moreover, automatic term extraction experiments based on a word-based maximum entropy model and a conditional random field model based on machine learning are conducted in this paper. Its word-based conditional random field model outperforms the maximum entropy model. The experimental results show that the algorithm based on the comprehensive feature strategy improves the accuracy by 8.6% compared with the TF-IDF algorithm and the C-value term extraction algorithm. This algorithm can be used to effectively extract the terms in a text and has good generality. [ABSTRACT FROM AUTHOR]

In this paper, an autonomous driving lateral control algorithm is introduced for bus rapid transit (BRT, with an articulated bus). The control algorithm includes an integration of model predictive control (MPC) for lateral control and PID control algorithms for longitudinal control considering the vehicle properties. To verify the algorithm in real-time, a model-in-the-loop system was developed using TruckSim in NI Veristand and Matlab/Simulink in Micro-AutoBox. In TruckSim, a BRT plant model was verified using vehicle tests and then applied. In addition, GPS data from a BRT route were acquired from the vehicle test and applied to a TruckSim scenario. In the Matlab/Simulink, the autonomous driving lateral control algorithm for MPC was developed. To communicate between the plant model and the control algorithm in real-time, a controller area network (CAN) protocol was defined and applied like a real vehicle. Therefore, a real-time verification environment was prepared to test the real-time autonomous driving lateral control algorithm for BRT. By using the verification environment, the control algorithm was verified using the ISO-11270 standard. Although many efforts have been made to develop an autonomous driving control algorithm, autonomous driving of BRT is expected more tangible because the BRT has its own lane and speed limitation. Therefore, this paper will introduce about study of real time feasibility, adaptation of vehicle variables, and precise prediction model for MPC algorithm. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of Chimp optimization algorithm (ChOA), which is easy to fall into local optimal value and imbalance between global exploration ability and local exploitation ability. To improve ChOA from the perspective of multi-strategy mixing, MSChimp was proposed, and the algorithm was applied to global optimization and minimum spanning tree problems. The main research work of this paper is as follows: (1) In the initialization stage of ChOA, an opposition-based learning strategy was introduced to improve the population diversity; Sine Cosine Algorithm (SCA) was introduced in the exploitation process to improve the convergence speed and accuracy of the algorithm in the later stage, so as to balance the exploration and exploitation capabilities of the algorithm. (2) The improved algorithm was compared with different types of meta-heuristic algorithms in 20 benchmark functions and CEC 2019 test sets, and was used to solve the minimum spanning tree. The experimental results show that the improved ChOA has significantly improved the ability to find the optimal value, which verifies the effectiveness and feasibility of MSChimp. Compared with other algorithms, the algorithm proposed in this paper has strong competitiveness. [ABSTRACT FROM AUTHOR]

The complex domain adaptive filtering algorithms has shown excellent performance in the field of signal processing. Among them, the well-known complex least mean square (CLMS) algorithm has been widely used in practical projects. However, the CLMS algorithm only considers the case where the output signal is disturbed by noise, ignores the input signal may also be interfered by noise. Moreover, the signal is likely to be disturbed by impulsive noise in practice. Based on the above problems, the complex total least mean M-estimation (CTLMM) adaptive algorithm based on the M-estimation function is put forward in this paper. The algorithm can well handle the case where both input and output signals are subject to complex domain noise interference, and it also shows robustness with impulsive noise. This paper also analyzes the local stability of the CTLMM algorithm and discuss the theoretical steady-state error of the algorithm. Finally, simulation results verify the advantages of CTLMM algorithm and the rightness of the theoretical analysis. [ABSTRACT FROM AUTHOR]

This letter identifies a fundamental mistake in the published paper titled "A projective general linear group-based algorithm for the construction of substitution box for block ciphers." The projective general linear group-based algorithm is designed to provide high nonlinearity, low differential uniformity, and good resistance against linear and differential attacks. The projective general linear group-based algorithm uses the linear fractional transformation defined over finite field GF 2 8 . The authors of the paper claimed that the irreducible polynomial of degree 8 is used for the construction of a finite field GF 2 8 . We have observed that the projective general linear group-based algorithm uses a reducible polynomial of degree 8. Thus, the inverse of each element does not exist in the finite field GF 2 8 . We have also shown that the values of the S-Box given in the paper are also incorrect. [ABSTRACT FROM AUTHOR]

This paper aims to propose a table tennis target detection (TD) method based on deep learning (DL) and multi-scale feature fusion (MFF) to improve the detection accuracy of the ball in table tennis competition, optimize the training process of athletes, and improve the technical level. In this paper, DL technology is used to improve the accuracy of table tennis TD through MFF guidance. Initially, based on the FAST Region-based Convolutional Neural Network (FAST R-CNN), the TD is carried out in the table tennis match. Then, through the method of MFF guidance, different levels of feature information are fused, which improves the accuracy of TD. Through the experimental verification on the test set, it is found that the mean Average Precision (mAP) value of the target detection algorithm (TDA) proposed here reaches 87.3%, which is obviously superior to other TDAs and has higher robustness. The DL TDA combined with the proposed MFF can be applied to various detection fields and can help the application of TD in real life. [ABSTRACT FROM AUTHOR]

This paper presents an improved arithmetic optimization algorithm that incorporates hybrid elite pool strategies to address the limitations of the arithmetic optimization algorithm (AOA). In AOA, the linear mathematical optimization acceleration (MOA) function cannot balance global exploitation and local exploration well. Therefore, the accuracy and convergence speed of the algorithm cannot be guaranteed. To improve the performance of AOA, this paper reconstructed a nonlinear MOA function, which is expected to balance the exploitation and the exploration of AOA. Furthermore, four hybrid elite pool strategies are integrated to enhance the ability to escape local optima. The proposed algorithm inherits the fast convergence of AOA and develops the performance of escaping local optima. Numerical experiment results on benchmark functions and engineering problems show that the proposed algorithm outperforms other compared meta-heuristic algorithms in terms of convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

With the rapid development of AI and big data mining technologies, computerized medical decision-making has become increasingly prominent. The aim of high-utility pattern mining (HUPM) is to discover meaningful patterns in medical databases that contribute to maximizing the utility from the perspective of diagnosis. However, HUPM pays less attention to the interpretability and explainability of these patterns in medical decision-making scenarios. This paper proposes a novel algorithm called the Improved fuzzy high-utility pattern mining (IF-HUPM) to address this problem. First, the paper applies a fuzzy preprocessing method to divide the fuzzy intervals of a medical quantitative data set, which enhances the fuzziness and interpretability of the data. Next, in the process of IF-HUPM, both fuzzy tree and list structures are employed to calculate fuzzy high-utility values. By combining the characteristics of the one-stage and two-stage algorithms of HUPM, an adaptive-phase Fuzzy HUPM hybrid frame is proposed. The experimental results demonstrate that the proposed IF-HUPM algorithm enhances both accuracy and efficiency and the mining process requires less time and space on average. [ABSTRACT FROM AUTHOR]

Conventional wireless sensors have difficulty solving the problem of energy limitation, especially in sensor networks in hard-to-reach extreme areas. In order to solve the problem that it is difficult to charge wireless sensors in the field using conventional energy sources, the energy harvesting wireless senor is designed to use renewable energy sources for power supply. Considering the uncertainty and unknown nature of renewable energy generation, and the need for effective energy management of the sensor. In this paper, an Node Power Control Optimization (NPCO) power allocation algorithm is proposed to adjust the power allocation problem of wireless sensor nodes within each time slot. In addition, to address the unknown and random nature of energy arrival, this paper proposes a CLSTM model based on deep learning to predict the energy arrival. The continuous autonomous energy management of wireless sensor nodes is achieved by combining the CLSTM prediction results using the NPCO algorithm. The algorithm is applicable to continuous states and is able to show good performance in the verification of real solar data. The algorithm achieves better performance in terms of long-term average net bit rate compared to the current DDPG algorithm, AC algorithm, and Lyapunov optimization algorithm. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is constantly evolving. The variety of IoT applications has caused new demands to emerge on users' part and competition between computing service providers. On the one hand, an IoT application may exhibit several important criteria, such as deadline and runtime simultaneously, and it is confronted with resource limitations and high energy consumption on the other hand. This has turned to adopting a computing environment and scheduling as a fundamental challenge. To resolve the issue, IoT applications are considered in this paper as a workflow composed of a series of interdependent tasks. The tasks in the same workflow (at the same level) are subject to priorities and deadlines for execution, making the problem far more complex and closer to the real world. In this paper, a hybrid Particle Swarm Optimization and Simulated Annealing algorithm (PSO–SA) is used for prioritizing tasks and improving fitness function. Our proposed method managed the task allocation and optimized energy consumption and makespan at the fog-cloud environment nodes. The simulation results indicated that the PSO–SA enhanced energy and makespan by 5% and 9% respectively on average compared with the baseline algorithm (IKH-EFT). [ABSTRACT FROM AUTHOR]

In this paper, an asymmetric scheme based on double image using phase retrieval algorithms in gyrator domain is reported. The double images are encrypted using QZ synthesis method based on QZ algorithm. The synthesized image is bonded with a random phase mask and undergoes a gyrator transform. The resultant image act as an input for the phase retrieval algorithm. We have tested the scheme with five different phase retrieval algorithms, namely the Gerchberg-Saxton algorithm, modified Gerchberg-Saxton algorithm, input–output algorithm, Yang-Gu mixture amplitude-phase retrieval algorithm, and improved amplitude-phase retrieval algorithm. Simulations are executed to show the performance, feasibility, and robustness of the scheme. The gyrator parameter and private keys are highly sensitive to a small change to their original value. Performance of different phase retrieval algorithms on the scheme is evaluated using multi-attribute decision-making tool: TOPSIS method. Results suggest that the Yang-Gu mixture amplitude-phase retrieval algorithm performs better among phase retrieval algorithms and has ranked 1 in TOPSIS analysis. This has been validated by the figures reported in the paper. [ABSTRACT FROM AUTHOR]

Singular value decomposition plays a prominent role in the theoretical study and numerical calculation of a quaternion matrix in applied sciences. This paper, by means of a complex representation of a quaternion matrix, studies the algorithm for the singular value decomposition of a quaternion matrix, and derives a complex structure-preserving algorithm for the singular value decomposition of a quaternion matrix. This paper also gives two examples to demonstrate the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

In the last 16 years, more than 200 research articles were published about research-paper recommender systems. We reviewed these articles and present some descriptive statistics in this paper, as well as a discussion about the major advancements and shortcomings and an overview of the most common recommendation concepts and approaches. We found that more than half of the recommendation approaches applied content-based filtering (55 %). Collaborative filtering was applied by only 18 % of the reviewed approaches, and graph-based recommendations by 16 %. Other recommendation concepts included stereotyping, item-centric recommendations, and hybrid recommendations. The content-based filtering approaches mainly utilized papers that the users had authored, tagged, browsed, or downloaded. TF-IDF was the most frequently applied weighting scheme. In addition to simple terms, n-grams, topics, and citations were utilized to model users' information needs. Our review revealed some shortcomings of the current research. First, it remains unclear which recommendation concepts and approaches are the most promising. For instance, researchers reported different results on the performance of content-based and collaborative filtering. Sometimes content-based filtering performed better than collaborative filtering and sometimes it performed worse. We identified three potential reasons for the ambiguity of the results. (A) Several evaluations had limitations. They were based on strongly pruned datasets, few participants in user studies, or did not use appropriate baselines. (B) Some authors provided little information about their algorithms, which makes it difficult to re-implement the approaches. Consequently, researchers use different implementations of the same recommendations approaches, which might lead to variations in the results. (C) We speculated that minor variations in datasets, algorithms, or user populations inevitably lead to strong variations in the performance of the approaches. Hence, finding the most promising approaches is a challenge. As a second limitation, we noted that many authors neglected to take into account factors other than accuracy, for example overall user satisfaction. In addition, most approaches (81 %) neglected the user-modeling process and did not infer information automatically but let users provide keywords, text snippets, or a single paper as input. Information on runtime was provided for 10 % of the approaches. Finally, few research papers had an impact on research-paper recommender systems in practice. We also identified a lack of authority and long-term research interest in the field: 73 % of the authors published no more than one paper on research-paper recommender systems, and there was little cooperation among different co-author groups. We concluded that several actions could improve the research landscape: developing a common evaluation framework, agreement on the information to include in research papers, a stronger focus on non-accuracy aspects and user modeling, a platform for researchers to exchange information, and an open-source framework that bundles the available recommendation approaches. [ABSTRACT FROM AUTHOR]

This paper investigates and analyzes the dynamics of the two-dimensional Duffing map. Multistability behavior has been observed from the system numerically. Such behavior, especially the coexistence of chaotic and periodic attractors, is undesirable in the applications of chaos-based cryptography. Therefore, we design and implement a Sine–Cosine chaotification technique to enhance chaos in the multi-stable regions. Furthermore, this paper proposes a new image encryption algorithm to examine the performance of the generalized Duffing map in cryptography applications. Simulation results and security analysis reveal that the proposed algorithm can effectively encrypt and decrypt several image types with a high level of security. [ABSTRACT FROM AUTHOR]

A series of recent papers raises worries about the manipulative potential of algorithmic transparency (to wit, making visible the factors that influence an algorithm’s output). But while the concern is apt and relevant, it is based on a fraught understanding of manipulation. Therefore, this paper draws attention to the ‘indifference view’ of manipulation, which explains better than the ‘vulnerability view’ why algorithmic transparency has manipulative potential. The paper also raises pertinent research questions for future studies of manipulation in the context of algorithmic transparency. [ABSTRACT FROM AUTHOR]

A k-page upward book embedding (kUBE) of a directed acyclic graph G is a book embeddings of G on k pages with the additional requirement that the vertices appear in a topological ordering along the spine of the book. The kUBE Testing problem, which asks whether a graph admits a kUBE, was introduced in 1999 by Heath, Pemmaraju, and Trenk (SIAM J Comput 28(4), 1999). In a companion paper, Heath and Pemmaraju (SIAM J Comput 28(5), 1999) proved that the problem is linear-time solvable for k = 1 and NP-complete for k = 6 . Closing this gap has been a central question in algorithmic graph theory since then. In this paper, we make a major contribution towards a definitive answer to the above question by showing that kUBE Testing is NP-complete for k ≥ 3 , even for st-graphs, i.e., acyclic directed graphs with a single source and a single sink. Indeed, our result, together with a recent work of Bekos et al. (Theor Comput Sci 946, 2023) that proves the NP-completeness of 2UBE for planar st-graphs, closes the question about the complexity of the kUBE problem for any k. Motivated by this hardness result, we then focus on the 2UBE Testing for planar st-graphs. On the algorithmic side, we present an O (f (β) · n + n 3) -time algorithm for 2UBE Testing, where β is the branchwidth of the input graph and f is a singly-exponential function on β . Since the treewidth and the branchwidth of a graph are within a constant factor from each other, this result immediately yields an FPT algorithm for st-graphs of bounded treewidth. Furthermore, we describe an O(n)-time algorithm to test whether a plane st-graph whose faces have a special structure admits a 2UBE that additionally preserves the plane embedding of the input st-graph. On the combinatorial side, we present two notable families of plane st-graphs that always admit an embedding-preserving 2 UBE. [ABSTRACT FROM AUTHOR]

Because of the unique imaging mechanism of infrared (IR) sensors, IR images commonly suffer from blurred edge details, low contrast, and poor signal-to-noise ratio. A new method is proposed in this paper to enhance IR image details so that the enhanced images can effectively inhibit image noise and improve image contrast while enhancing image details. First, for the traditional guided image filter (GIF) applied to IR image enhancement is prone to halo artifacts, this paper proposes a detail enhancement guided filter (DGIF). It mainly adds the constructed edge perception and detail regulation factors to the cost function of the GIF. Then, according to the visual characteristics of human eyes, this paper applies the detail regulation factor to the detail layer enhancement, which solves the problem of amplifying image noise using fixed gain coefficient enhancement. Finally, the enhanced detail layer is directly fused with the base layer so that the enhanced image has rich detail information. We first compare the DGIF with four guided image filters and then compare the algorithm of this paper with three traditional IR image enhancement algorithms and two IR image enhancement algorithms based on the GIF on 20 IR images. The experimental results show that the DGIF has better edge-preserving and smoothing characteristics than the four guided image filters. The mean values of quantitative evaluation of information entropy, average gradient, edge intensity, figure definition, and root-mean-square contrast of the enhanced images, respectively, achieved about 0.23%, 3.4%, 4.3%, 2.1%, and 0.17% improvement over the optimal parameter. It shows that the algorithm in this paper can effectively suppress the image noise in the detail layer while enhancing the detail information, improving the image contrast, and having a better visual effect. [ABSTRACT FROM AUTHOR]

This paper proposes a bidirectional feature fusion pyramid (B-FPN) Single Shot Multiple Frame Detector (SSD) algorithm. First, a bidirectional feature pyramid (B-FPN) structure is constructed, which realizes the bidirectional fusion of the feature layers and improves the accuracy of detection. Second, we introduce coordinate attention (CA) to focus on the important channel features while preserving their location information, thereby increasing the focus on the important information. Finally, optimizing the loss function speeds up the convergence of the model and further improves the detection accuracy of the network. The experimental results show that on the VOC2007 dataset, the mAP of the algorithm in this paper is 76.48%, which is 3.52% higher than that of the SSD algorithm. On the COCO 2017 dataset, the mAP of the proposed algorithm is 3.85% higher than that of the SSD algorithm. Compared with other mainstream target detection algorithms, the algorithm in this paper has certain advantages in detection accuracy, and can also achieve satisfactory results in detection speed. Finally, the accuracy of foreign object recognition in the special environment of iron ore transportation is 98.26%. [ABSTRACT FROM AUTHOR]

The task offloading of mobile edge computing (MEC) is to find proper edge or cloud resources for the execution tasks to efficiently utilize resources and meet different user's requirements. However, it is difficult for task offloading when the number of tasks and resources providers increases and to optimize multiple objectives while satisfying users' requirements. In this paper, a new multi-objective strategy based on the biogeography-based optimization (BBO) algorithm is proposed for MEC offloading to satisfied users' multiple requirements (the execution time, energy consumption and cost). In this strategy, a time-energy consumption model and a cost model are constructed for task offloading firstly. Based on these models, the BBO algorithm is introduced into task offloading for MEC to solve the problem of multi-objective optimization. Compared with the traditional strategies, the offloading strategy based on BBO decreases the average task completion time by an average of 25.03%, and compared with the technique for order preference by similarity to an ideal solution (TOPSIS) strategy, the BBO offloading strategy proposed in this paper reduces energy consumption 75% and cost by 36.9%. The proposed strategy can well solve the problem of multi-objective optimization in the task offloading for MEC. [ABSTRACT FROM AUTHOR]

With the rapid development of network technology, the Internet has brought significant convenience to various sectors of society, holding a prominent position. Due to the unpredictable and severe consequences resulting from malicious attacks, the detection of anomalous network traffic has garnered considerable attention from researchers over the past few decades. Accurately labeling a sufficient amount of network traffic data as a training dataset within a short period of time is a challenging task, given the rapid and massive generation of network traffic data. Furthermore, the proportion of malicious attack traffic is relatively small compared to the overall traffic data, and the distribution of traffic data across different types of malicious attacks also varies significantly. To address the aforementioned challenges, this paper presents a novel network anomaly detection algorithm based on semi-supervised learning and adaptive multiclass balancing. Building upon the assumption of consistent distribution between labeled and unlabeled data, this paper introduces the multiclass split balancing strategy and the adaptive confidence threshold function. These innovative approaches aim to tackle the issue of the multiclass imbalanced in traffic data. By leveraging the mutually beneficial relationship between semi-supervised learning and ensemble learning, this paper presents the collaborative rotation forest algorithm. This algorithm is specifically designed to enhance performance of anomaly detection in an environment with label inadequacy. Several comparative experiments conducted on the NSL-KDD, UNSW-NB15, and ToN-IoT demonstrate that the proposed algorithm achieves significant improvements in performance. Specifically, it enhances precision by 1.5–5.7%, recall by 1.5−5.7%, and F-Measure by 1.4−4.3% compared to the state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

One of the most popular techniques for changing the purpose of an image or resizing a digital image with content awareness is the seam-carving method. The performance of image resizing algorithms based on seam machining shows that these algorithms are highly dependent on the extraction of importance map techniques and the detection of salient objects. So far, various algorithms have been proposed to extract the importance map. In this paper, a new method based on Rényi entropy is proposed to extract the importance map. Also, a deep learning network has been used to detect salient objects. The simulator results showed that combining Rényi's importance map with a deep network of salient object detection performed better than classical seam-carving and other extended seam-carving algorithms based on deep learning. [ABSTRACT FROM AUTHOR]

Effective resource allocation is a crucial aspect in improving the performance of visible light communication (VLC)/hybrid WiFi networks. This study presents a dynamic resource allocation algorithm for multiuser scenarios. A fuzzy logic technique is employed to select the network resources with higher scores for communication. In this sense, to ensure fairness in the hybrid VLC-WiFi network, an enhanced proportional fairness (PF) algorithm is utilized. The algorithm considers the access delay and the distance to the access point as users move, striking a reasonable balance between fair allocation of user resources and maximizing system resource utilization. Therefore, to enhance the user experience in real-time scheduling, a compensation factor is introduced to compensate users with higher latency, increasing their priority. A thorough analysis is provided for the throughput, latency, utility value, and fairness models of the VLC-WiFi heterogeneous network system. The algorithm proposed in this paper is simulated and compared with four traditional algorithms, namely the Round-Robin algorithm, maximum carrier to interference ratio (Max C/I) algorithm, modified largest weighted delay first algorithm, and PF algorithm, under different metrics. Simulation results show that the proposed method is effective, and the improved algorithm yields better fairness and higher throughput compared to the conventional algorithm. As the number of frames increases, the fairness index of the proposed algorithm increases the fastest and gradually converges to 1. The throughput of this method is significantly greater than that of previous algorithms, reaching a stable rate of roughly 1.3 Mbps. The suggested algorithm is approximately 150% higher than the throughput achieved by conventional PF algorithms. The algorithm improves user satisfaction in different regions, and the utility value remains around 0.975. The packet loss rate is approximately 75% lower than traditional typical algorithms, and the average latency is approximately 60% lower. Simulation results show that the proposed algorithm has good application prospects in heterogeneous networks. [ABSTRACT FROM AUTHOR]

Arithmetic optimization algorithm (AOA) is a meta-heuristic optimization method based on mathematical operators proposed in recent years. Although it has good performance, it can also lead to insufficient local search ability and falling into local optima when solving complex optimization problems. In order to make up for the above shortcomings, the optimization performance of AOA is further improved. This paper proposes a hybrid algorithm based on AOA and particle swarm optimization (PSO) called HAOAPSO. Firstly, a compound opposition-based learning (COBL) strategy is introduced to broaden the scope of finding optimal solutions to help the algorithm better jump out of local optima. Secondly, PSO is combined with AOA that integrates COBL to improve the algorithm's local search ability, so as to improve the overall search efficiency of the algorithm. In addition, experiments are performed on 23 classical benchmark functions with different characteristics and five engineering design optimization problems, and the experimental results of HAOAPSO are compared with those of other well-known optimization algorithms to comprehensively evaluate the performance of the proposed algorithm. The simulation results show that HAOAPSO can provide better solutions in most cases when solving global optimization problems such as engineering, with better convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

This paper presents a massively parallel approach of the multilevel fast multipole algorithm (PMLFMA) on homegrown many-core SW26010 cluster of China, noted as (SW-PMLFMA), for 3-D electromagnetic scattering problems. In this approach, the multilevel fast multipole algorithm (MLFMA) octree is first partitioned among management processing elements (MPEs) of SW26010 processors following the ternary partitioning scheme using the message passing interface (MPI). Then, the computationally intensive parts of the PMLFMA on each MPI process, matrix filling, aggregation and disaggregation are accelerated by using all the 64 computing processing elements (CPEs) in the same core group of the MPE via the Athread parallel programming model. Different parallelization strategies are designed for many-core accelerators to ensure a high computational throughput. In coincidence with the special characteristic of local Lagrange interpolation, the compressed sparse row (CSR) and the compressed sparse column (CSC) sparse matrix storage format is used for storing interpolation and anterpolation matrices, respectively, together with a specially designed cache mechanism of hybrid dynamic and static buffers using the scratchpad memory (SPM) to improve data access efficiency. Numerical results are included to demonstrate the efficiency and versatility of the proposed method. The proposed parallel scheme is shown to have excellent speedup. [ABSTRACT FROM AUTHOR]

This research paper proposes a novel technique of asymmetric cryptosystem to secure the digital color images using the QZS algorithm and random modulus decomposition (RMD). The QZS algorithm is performed on two color channels of RGB image and gets the single channel image which is randomized later by using the scrambling scheme proposed by us. RMD is performed on it to obtain the final encrypted image. Some statistical analyses like MSE, PSNR, SSIM, histogram, entropy, differential attacks and cropping attacks are performed to test the robustness of the proposed method. The proposed method is compared with some state-of-the-art methods of digital image security. [ABSTRACT FROM AUTHOR]

A secure encryption scheme, combining multi-objective particle swarm optimization (MOPSO), optical chaos, and DNA algorithm is proposed and demonstrated. In this paper, a secure encryption and decryption architecture based on optical chaotic synchronization system with injection-locking is analyzed. We prove that a main laser (ML) can drive two-pair secondary lasers (TPSLs) to generate the synchronized optical chaos with high complexity. The system employs the XOR operation between the Hash value of the initial image and optimized value by MOPSO, which modulates the bias current of ML, thus TPSLs are driven to generate two pair synchronized chaotic sequences, which combine the Hash value of the initial image to generate two keys through a certain algorithm. Furthermore, two keys are used to scramble the pixel positions of the image and diffuse image pixels through DNA rules, and then in receiving end, two same keys are used to unscramble and reversely diffuse the encrypted image. Besides modulating the bias current of ML, the other aim of MOPSO is to optimize the entropy of the encrypted image and the correlation between the adjacent pixels. In order to ensure the recovery of real image, we compute and compare the digest-message of two pair synchronized chaotic sequences by using Hash algorithm in two ends before transmitting the encrypted image over optical fiber link. By synchronizing with the lasers at the sending end, we obtained two same keys to decrypt the ciphertext image in the receiving end. The simulation results show that this scheme can achieve secure communication of image against various attacks by analyzing and testing the security of the encrypted image. [ABSTRACT FROM AUTHOR]

It was recently shown that a large class of phylogenetic networks, the ‘labellable’ networks, is in bijection with the set of ‘expanding’ covers of finite sets. In this paper, we show how several prominent classes of phylogenetic networks can be characterised purely in terms of properties of their associated covers. These classes include the tree-based, tree-child, orchard, tree-sibling, and normal networks. In the opposite direction, we give an example of how a restriction on the set of expanding covers can define a new class of networks, which we call ‘spinal’ phylogenetic networks. [ABSTRACT FROM AUTHOR]

This paper considers Bayesian analysis of data from seemingly unrelated regression models whose errors have a distribution that is scale mixtures of normal distributions. A non-iterative Bayesian sampling algorithm is developed to obtain the posterior samples, which eliminates the convergence problems in iterative Markov Chain Monte Carlo (MCMC) approach. The performances of the proposed algorithm are illustrated through simulation studies, and the results show that it appears to outperform the MCMC approach and is time-efficient compared to the existing methods. In the case of outliers, the model selection criteria results indicate that the heavy-tailed SUR models is more robust than the normal SUR models. Also, a real data example is analyzed using the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a feasible expectation-conditional-maximization (ECM) algorithm is developed for finding the maximum likelihood estimates of parameters of the skew-normal based stochastic frontier model. The closed-form formulas for updating parameters in CM-steps are derived. The proposed methodology is illustrated with simulations and a real data example, where we find the new ECM algorithm outperforms the numerical approach adopted in the previous study. [ABSTRACT FROM AUTHOR]

This paper deals with the computation of the Lerch transcendent by means of the Gauss-Laguerre formula. An a priori estimate of the quadrature error, that allows to compute the number of quadrature nodes necessary to achieve an arbitrary precision, is derived. Exploiting the properties of the Gauss-Laguerre rule and the error estimate, a truncated approach is also considered. The algorithm used and its Matlab implementation are reported. The numerical examples confirm the reliability of this approach. [ABSTRACT FROM AUTHOR]

This paper investigates the finite-time and fixed-time bipartite consensus problem of multiple Euler–Lagrange systems (MELSs) under directed interaction topologies, considering external disturbances. Two novel distributed hierarchical control algorithms are developed to address the challenging problems. Specifically, a new distributed estimator is designed to estimate the states of agents in finite/fixed-time. Moreover, based on the obtained estimations, the finite/fixed-time controller is presented to accomplish the bipartite consensus of the MELSs in the local control layer. By utilizing Lyapunov stability and the nearest neighbor-interactions theory, sufficient conditions for achieving the designed performance of the MELSs are derived. Simulation examples are provided to illustrate the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]