Search

With the development of computer technology, automatic test paper generation systems have gradually become an effective tool for detecting and maintaining national machine security and protecting the rights and interests of workers. This article achieved multi-level oral scores for different types of questions through online scoring using artificial neural networks in recent years. Based on its specific situation and evaluation index requirements, an analysis module that is reasonable, efficient, and in line with the hierarchical structure and module requirements of national conditions has been designed to complete the research on automatic test paper generation technology, in order to help better manage and allocate human resources and improve production efficiency. Afterwards, this article conducted functional testing on the technical module. The test results showed that the scalability of the system was over 82%. [ABSTRACT FROM AUTHOR]

Differentiation/ranking of authors in the scientific sphere is carried out according to their influence on the particular field(s) of science. The impact of the contribution is measured by the impact a text has on the development of the field/issue. It can be measured by the usage of ideas from other researchers works given as citations. Nowadays, citations are tracked by specific algorithms and citation management systems that have access to various databases, catalogues and bibliography systems through metadata. In the presented article, I discuss problematic issues that authors are facing while writing texts in different languages (other than the English language) and publishing them in periodicals. The most popular (often indicative) texts/authors still fail to be captured/cached by the algorithms, therefore creating an imbalance between the actual number of citations performed by other scholars and cached h-index displayed by the algorithm. The paper discusses the causes of the problem and suggests solutions for both authors and publishers. [ABSTRACT FROM AUTHOR]

Digital automation in reconstruction of apictorial hand torn paper document increases efficacy and reduces human effort. Reconstruction of torn document has importance in various fields like archaeology, art conservation and forensic sciences. The devised novel technique for hand torn paper document, consists of pre-processing, feature extraction and reconstruction phase. Torn fragment's boundaries are simplified as polygons using douglas peucker polyline simplification algorithm. Features such as Euclidean distance and number of sudden changes in contour orientation are extracted. Our matching criteria identify the matching counterparts. Proposed features curtail ambiguity and enriches efficacy in reconstruction. Reconstructed results of hand torn paper document favour the proposed methodology. [ABSTRACT FROM AUTHOR]

This article explores the application of DNA computing in recyclable waste paper sorting. The primary challenge in paper recycling is to obtain raw materials with the highest purity. In recycling, waste papers are segregated according to their various grades, and these are subjected to different recycling processes. Highly sorted paper streams facilitate high quality end products, while saving on processing chemicals and energy. In the industry, different sensors are used in paper sorting systems, namely, ultrasonic, lignin, gloss, stiffness, infra-red, mid-infra red, and color sensors. Different mechanical and optical paper sorting systems have been developed based on the different sensors. However, due to inadequate throughput and some major drawbacks related to mechanical paper sorting systems, the popularity of optical paper sorting systems has increased. The automated paper sorting systems offer significant advantages over the manual systems in terms of human fatigue, throughput, speed, and accuracy. This research has two objectives: (1) to use a web camera as an image sensor for the vision system in lieu of different sensors; and (2) to develop a new DNA computing algorithm based on the theme of template matching techniques for segregating recyclable waste papers according to paper grades. Using the concepts of replication and massive parallelism operations, the DNA computing algorithm can efficiently reduce the computational time of the template matching method. This is the main strength of the DNA computing algorithm in actual inspections. The algorithm is implemented by using a silicon-based computer to verify the success rate in paper grade identification. [ABSTRACT FROM AUTHOR]

Electrocardiogram (ECG) paper records are used commonly for diagnosing heart abnormalities. The stored ECG paper records are recorded on thermal paper and may face ink evaporation problem over the time. Generally, to overcome this problem ECG paper record is scanned and stored as an image. However, the addition of noise during scanning such as low resolution scan, blurring, folding of paper, nonuniform lighting, orientation etc. can create difficulty in information retrieval. Current work robustly handles various degradation problems encountered in ECG paper scanning using modified k-fill algorithm. The proposed algorithm is tested with 836 ECG paper recordings with different types of degradations like aging effect, folding effect, ink evaporation effect, blurring effect and low resolution effect. We extracted clinically important parameters such as heart rate etc. with accuracy of 97.33% and abnormalities such as bradycardia, tachycardia, and atrial flutter from the ECG paper records using perceptual spectral centroid method. Overall accuracy of our prediction algorithm was found out to be 98.6%. We assume our work would be low cost, preliminary expert mechanism at rural places in the absence of expert cardiologist. [ABSTRACT FROM AUTHOR]

The 5G technology will become a truly integrated technology. It's becoming the most famous technology because of its optimal system computing complex and transforming a group of individual network components. Adequate resources must be provided for the various devices that are typically on the same network. The various functions in the data system also require resource allocation to suit its needs. This will ensure that the various devices on that network perform different types of work effectively. It also represents the various device functionalites to ensure the estimated resources onetime manner. Only then will it be convenient to carry out a variety of jobs depending on their speed and selection. And its various data requirements vary according to the functionality of the various devices featured in this series segment dynamic configuration. In this paper a smart resource utilization scheme was proposed. Its main purpose is to better manage the off-the-shelf resources available here. And provide it where it is needed and streamline data delivery to users on the network. This ensures that all data goes to the users in the correct manner. The proposed method getting 49% energy consumption, 90% resource utilization, 92% resource reservation and 91% Quality of services. [ABSTRACT FROM AUTHOR]

Abstract: There are a number of issues which are involved with organizing a conference. Among these issues, assigning conference-papers to reviewers is one of the most difficult tasks. Assigning conference-papers to reviewers is automatically the most crucial part. In this paper, we address this issue of paper-to-reviewer assignment, and we propose a method to model the reviewers, based on the matching degree between the reviewers and the papers by combining a preference-based approach and a topic-based approach. We explain the assignment algorithm and show the evaluation results in comparison with the Hungarian algorithm. [Copyright &y& Elsevier]

Abstract: Recommendation algorithms have been researched extensively to help people deal with abundance of information. In recent years, the incorporation of multiple relevance criteria has attracted increased interest. Such multi-criteria recommendation approaches are researched as a paradigm for building intelligent systems that can be tailored to multiple interest indicators of end-users – such as combinations of implicit and explicit interest indicators in the form of ratings or ratings on multiple relevance dimensions. Nevertheless, evaluation of these recommendation techniques in the context of real-life applications still remains rather limited. Previous studies dealing with the evaluation of recommender systems have outlined that the performance of such algorithms is often dependent on the dataset – and indicate the importance of carrying out careful testing and parameterization. Especially when looking at large scale datasets, it becomes very difficult to deploy evaluation methods that may help in assessing the effect that different system components have to the overall design. In this paper, we study how layered evaluation can be applied for the case of a multi-criteria recommendation service that we plan to deploy for paper recommendation using the Mendeley dataset. The paper introduces layered evaluation and suggests two experiments that may help assess the components of the envisaged system separately. [Copyright &y& Elsevier]

Abstract: A new approach of paper defect recognition is proposed. To implement this method, computer is used to acquire paper image and the subtraction algorithm is used to determine if the image contains defect at first. For the image with paper defect, wavelet packet decomposition is applied to extracting the feature vector of the defect. A BP neural network is designed for recognizing the defect type according to the feature vector. This approach provides a unified detection algorithm for different types of paper defects. The experiment data prove this method is valid and can be applied in modern paper defect inspection system. [Copyright &y& Elsevier]

Abstract: The paper describes a system for executable papers for publishers enabling them to reuse content and to generate further advances of science and engineering. The executable algorithmic descriptions within a paper are presented in natural language sentences and basic code, thereby making long term compatibility absolute. Authors are required to use publicly numerical libraries on the Internet or references to publications with executable papers. As used by authors the system automatically creates a web of algorithmic knowledge on the Internet. Novelty of new algorithms in publications can be evaluated by automated tools available to authors, reviewers and readers of scientific papers published. [Copyright &y& Elsevier]

Technical terms are vital elements for understanding the techniques used in academic research papers, and in this paper, we use focused technical terms to explore technical trends in the research literature. The major purpose of this work is to understand the relationship between techniques and research topics to better explore technical trends. We define this new text mining issue and apply machine learning algorithms for solving this problem by (1) recognizing focused technical terms from research papers; (2) classifying these terms into predefined technology categories; (3) analyzing the evolution of technical trends. The dataset consists of 656 papers collected from well-known conferences on ACM. The experimental results indicate that our proposed methods can effectively explore interesting evolutionary technical trends in various research topics. [ABSTRACT FROM AUTHOR]

Abstract: A lot of work has been done in the field of multi-valued model checking home and abroad. But some research works are not perfect. Some problems in the semantic definitions of temporal operators and corresponding model checking algorithms are found in the paper “Model Checking Using Partial Kripke Structure with 3-Valued Temporal Logic”. Some counterexamples are given to show these errors. On the basis of the discussion, some sound semantic definitions of temporal operators and correct algorithms of model checking for some temporal operators are given. [Copyright &y& Elsevier]

Abstract: Combining previous image mosaicing algorithms, this paper puts forward a kind of damaged text restore image processing algorithm. The algorithm can restore the shredder pieces tape. A series of tapes which are obtained by scanner are treated through image processing such as binary, segmentation, denoising and enhancement and so on, Then we can get the ideal original text image from some leaflet tapes image. Experimental results show that such algorithm has certain effectiveness. [Copyright &y& Elsevier]

Electric bicycle datasets for lift control have played a crucial role in the development of electric bicycle lift entry detection algorithms. However, existing datasets often encounter issues, including a small dataset size, a high false detection rate, and the absence of a publicly available benchmark dataset. This paper addresses these challenges by constructing a new electric bicycle detection dataset for lift control based on the research demands of the electric bicycle detection task for lift control. XHNet_EB, a car scene image dataset covering various types of electric bicycles, was constructed based on images taken by a camera from above. Segmented annotation was employed, framing the front and rear of the electric bicycle independently. This approach effectively addressed the problems of many irrelevant features and a high false detection rate caused by the use of whole-electric-bicycle annotations in mainstream datasets. AP_50, AP_75, the mAP, and the number of false detections in the images were used for quantitative analysis of the dataset. The experimental results indicated that the object detection accuracy of the XHNet_EB dataset was excellent. Quantitative analysis and evaluation of the number of false detections in images were conducted using four mainstream lightweight detection model algorithms. The results demonstrated that segmented annotation reduced the false detection rate more effectively than entire electric bicycle annotation. This study identified drawbacks in existing datasets. The dataset proposed in this paper overcomes the shortcomings of existing commercial data and solves problems such as the high false detection rate caused by the inclusion of many irrelevant features caused by the "whole-electric-bicycle annotation" method, which could help with the development of electric bicycle detection applications in lifts. [ABSTRACT FROM AUTHOR]

Achieving a balance between convergence and diversity and their mutual enhancement is a complex task in the process of algorithm improvement. This is crucial because it is directly related to the effectiveness of the algorithm in obtaining accurate and uniformly distributed Pareto frontiers. Although significant progress has been made in particle swarm algorithms, exploring new approaches is necessary. In this paper, we construct a projection plane (projection line in 2D) based on the extreme values of the non-dominated solutions, select a set of uniform reference points on the projection plane, and then project the non-dominated solutions onto the constructed projection plane to form projection points. The reference points and projection points on the projection plane are thus utilized to guide the updating of the population as well as the maintenance of the external archive, a strategy that enhances the algorithm's global exploration and local exploitation capabilities. Secondly, we aggregate the target values of particles into a single scalar value and combine the idea of particle fusion to design a scheme for the particle selection of individual optimal particles. This paper further improves the algorithm's overall performance by using the information between populations to select individual optimal particles. Lastly, it is evaluated against a number of multi-objective algorithms that are currently in use and perform well on 22 test problems. The findings demonstrate that the algorithm this paper proposes performs better when solving multi-objective problems. [ABSTRACT FROM AUTHOR]

Aiming at the problem of traditional methods which lead to low detection accuracy owing to limited sample size and imbalanced sample, this paper proposes a novel insulator self-explosion detection algorithm based on mixed samples and transfer learning. Firstly, the segmentation of insulator and background region is realized by using template matching and grabcut algorithm. Secondly, the segmented insulator image is merged with the new background image at pixel level to generate the insulator artificial sample with distinct texture. Thirdly, this paper introduces an improved Faster R-CNN model that utilizes ResNet50 for feature extraction, replacing the traditional VGG16 network. This modification significantly improves the ability of the network to extract insulator texture features. By introducing the focal loss function to address the imbalance between positive and negative samples, the detection accuracy of the network is further improved. Finally, the introduction of depthwise separable convolution helps reduce model complexity, resulting in a more lightweight architecture. The model is trained by a dataset that includes both synthetic and real samples. The real insulators are then employed for evaluation. The experimental results show that even with a reduced number of artificial samples, the algorithm proposed in this study achieves a mean average precision of 95.26%. Additionally, the average detection time is 2.31s. These results show that compared with the original Faster R-CNN method, the proposed method has improved the detection accuracy and speed. [ABSTRACT FROM AUTHOR]

Academic research is crucial to the development of science and technology and is an important factor that affects national strength. When writing an academic research paper, a rhetorical structure is typically used to present the paper's ideas, but this task is quite difficult for junior researchers. To solve this problem, some studies have adopted text mining to assist with the writing, but the existing methods still require human intervention to generate sentences. Recently, due to the increasing maturity of deep learning technology and the ability to address the problem of automatic text generation, progress has been made in this area. The highly complex deep learning operations can correctly generate sequences and find correlations between sequences. When a user provides a few keywords and key sentences, the proposed algorithm can generate an introduction section for the user. The results show that the generated introduction is more coherent, clearer, and more fluent than existing summarization methods. In addition, the method proposed in this study improves the accuracy compared with traditional text extraction methods. The manuscript produced by this study has been evaluated to show that the study can produce a comprehensive introduction compared with previous studies. • The proposed framework can generate a comprehensive introduction based on users' brief inputs. • This paper demonstrates a three-testing-threshold approach to check the content quality. • The introduction generated through this method has less than 3% similarity to the original text by comparison. [ABSTRACT FROM AUTHOR]

The smart car collects the signal through the infrared sensor, and obtains the gray map in front of the car, according to the gray map, the tracking is judged.Due to the complexity of the environment, many gray-scale maps are difficult to trace, and even cannot be judged, which brings great uncertainty to the operation of the smart car.The paper designs a method to improve the infrared tracking accuracy of smart cars.First, determine the level of contrast in this graph.By improving the brightness in the grayscale image, the gray signal around the tracking line is eliminated, and then the tracking line is highlighted by increasing the contrast.Therefore, it effectively overcomes the shortcomings of poor practicality of smart cars and improves the infrared tracking accuracy of smart cars. [ABSTRACT FROM AUTHOR]

The existing forensics systems are developing in a more and more perfect direction in terms of forensic steps, legal constraints, audit supervision, etc., but they are still not fully applicable to legal forensics. A general legal forensics system must have a complete forensics process to ensure the smooth progress of the forensics work. One of the purposes of legal forensics is to use legal means to bring criminals to justice. Only by ensuring the legality of the evidence can it be accurately identified case, and therefore also to ensure the legality of the evidence collection process. In order to design a more powerful legal forensics system, this paper introduces a data mining algorithm to extract valuable information from massive data through association rules to improve the efficiency of forensics. At the same time, this paper also proposes three coding schemes for the integrity of the evidence object, and compares the forensic effects of the three schemes. [ABSTRACT FROM AUTHOR]

With the development of artificial intelligence technology, it has become convenient for people to work, study and travel and face recognition is widely used in many fields, but also brings a lot of hidden dangers to security. Aiming at the problem of reduced accuracy of face detection algorithm caused by local occlusion factors, The paper proposes a partial occlusion face recognition method based on DCGAN face repair combined with ResNet. The experimental results show that the algorithm proposed in the paper has better face recognition effect when there is partial occlusion in the face. [ABSTRACT FROM AUTHOR]

In this paper, we construct an enterprise economic management sharing platform based on the feature recognition grid system, firstly, we use the fuzzy matching recognition algorithm to extract the grid features of economic management and map them into the fuzzy set of affiliation features, and then we extract the feature vectors from each grid to get the feature matrix, and finally, according to the similarity degree of the feature sequences, we set a threshold to give the recognition result. The results show that the recognition rate of the platform constructed in this paper reaches more than 99%, the classification accuracy is about 90% on average, and the optimization time is only about 19 s. It is verified that the method of this paper improves the accuracy of enterprise economic management, and has a positive role in promoting the healthy development of enterprises. [ABSTRACT FROM AUTHOR]

The large deformation of soft rock tunnel is an important problem to be solved urgently with the development of engineering technology. In order to improve the application effect of prestressed anchor cable adaptive active support system, this paper puts forward an optimization method based on adaptive genetic algorithm, reviews the research status of prestressed anchor support in soft rock tunnel, and analyzes and evaluates the existing methods. This paper introduces the construction process of AGA model, establishes the problem description model and genetic optimization algorithm selection model, and constructs the adaptive active support model of prestressed anchor cable. The model adopts an optimization algorithm with a total of 100 iterations. The Simple Genetic Algorithm and Parallel Genetic Algorithm are selected to evaluate the anchoring force, the control effect of surrounding rock displacement, the erosion of supporting structure and the construction time by comparative test. The test results show that AGA has a good effect on the anchoring force, the minimum anchoring force is 457 kN, and the displacement of surrounding rock is controlled within 1.21-1.59mm, which has a good influence on the quality of supporting structure and the construction completion time. Finally, the application of AGA model in parameter optimization of prestressed anchor cable in soft rock tunnel is summarized, and the future research direction is put forward. [ABSTRACT FROM AUTHOR]

The unstoppable trend of globalization has made the integration of voice recognition with science and technology increasingly close, and has called for the emergence of more powerful oral voice recognition systems. At present, most speech recognition research uses Hidden Markov Model-Gaussian Mixture Modell (HMM-GMM) and onnectionist Temporal Classification (CTC) end-to-end method, which has obvious limitations. Therefore, based on neural network, this paper introduces deep neural network posterior probability algorithm into speech recognition system, and constructs the spoken speech recognition system based on deep neural network posterior probability algorithm. The design principle of the constructed speech system is discussed and the performance analysis and effectiveness evaluation are carried out. The experimental results show that the performance of the neural network-based speech recognition system constructed in this paper has made a breakthrough compared with the traditional technology, and the Character Error Rate (CER) is only 4.6%, and the End-to-End Latency and Equal Error Rate (EER) have reached a low level. This study points out the future development direction of speech recognition and provides the impetus to promote its further development [ABSTRACT FROM AUTHOR]

As a crucial development direction for the sixth generation of mobile communication networks (6G), Low Earth Orbit (LEO) satellite networks exhibit characteristics such as low latency, seamless coverage, and high bandwidth. However, the frequent changes in the topology of LEO satellite networks complicate communication between satellites, and satellite power resources are limited. To fully utilize resources on satellites, it is essential to determine the association between satellites before power allocation. To effectively address the satellite association problem in LEO satellite networks, this paper proposes a satellite associationbased resource allocation algorithm. The algorithm comprehensively considers the throughput of the satellite network and the fairness associated with satellite correlation. It formulates an objective function with logarithmic utility by taking the logarithm and summing the satellite channel capacities. This aims to maximize the sum of logarithmic utility while promoting the selection of fewer associated satellites for forwarding satellites, thereby enhancing the fairness of satellite association. The problems of satellite association and power allocation are solved under constraints on resources and transmission rates, maximizing the logarithmic utility function. The paper employs an improved Kuhn-Munkres (KM) algorithm to solve the satellite association problem and determine the correlation between satellites. Based on the satellite association results, the paper uses the Lagrangian dual method to solve the power allocation problem. Simulation results demonstrate that the proposed algorithm enhances the fairness of satellite association, optimizes resource utilization, and effectively improves the throughput of LEO satellite networks. [ABSTRACT FROM AUTHOR]

The article focuses on the research flaws in the study "The Harmful Effects of Algorithms in Grades 1-4," by Constance Kamii and Ann Dominick. The research explained the benefits of "no algorithms" experience in mastering arithmetic, where the authors theorized that the approach improved the ability of children to master mental math techniques and disadvantages of standard addition algorithm. The flaws proved that standard algorithms are essential in solving arithmetic problems in simple ways.

In recent years, distributed optimization problem have a wide range of applications in various fields. This paper considers the prescribed-time distributed optimization problem with/without constraints. Firstly, we assume the state of each agent is constrained, and the prescribed-time distributed optimization algorithm with constraints is designed on the basis of gradient projection algorithm and consensus algorithm. Secondly, the constrained distributed optimization problem is transformed into the unconstrained distributed optimization problem, and according to the gradient descent algorithm and consensus algorithm, we also propose the prescribed-time distributed optimization algorithm without constraints. By designing the appropriate objective functions, we prove the multi-agent system can converge to the optimal solution within any prescribed-time, and the convergence time is fully independent of the initial conditions and system parameters. Finally, three simulation examples are provided to verify the validity of the designed algorithms. • For distributed optimization problem with convex constraints, we design an effective prescribed-time distributed algorithm which can guarantee the multi-agent system converge to the optimal solution. • The designed algorithm in this paper can achieve convergence within any prescribed-time, and the convergence time is fully independent of the initial conditions and system parameters. • In this paper, we not only consider the condition that the agents' states are constrained, but also ensure that the multi-agent system can reach the optimal solution within any prescribed-time, which is more practical. [ABSTRACT FROM AUTHOR]

Multiple criteria evolutionary algorithms, being essentially parallel in their character, are a natural instrument of finding a representation of entire Pareto set (set of solutions and outcomes non-dominated in criteria space) for vector optimisation problems. However, it is well known that Pareto sets for problems with more than two criteria might become complicated and their representation very time-consuming. Thus, the application of such algorithms is essentially limited to bi-criteria problems or to vector optimisation problems with more criteria but of simple structure. Even in such cases, there are problems related to various important aspects of vector optimisation, such as the uniformity of representation of Pareto set, stopping tests or the accuracy of representing Pareto set, that are not fully covered by the broad literature on evolutionary algorithms in vector optimisation. These problems and related computational tests and experience are discussed in the paper. In order to apply evolutionary algorithms for decision support, it would be helpful to use them in an interactive mode. However, evolutionary algorithms are in their essence global and of batch type. Nevertheless, it is possible to introduce interactive aspects to evolutionary algorithms by focusing them on a part of Pareto set. The results of experimental tests of such modifications of evolutionary algorithms for vector optimisation are presented in the paper. Another issue related to vector optimisation problems with more than two criteria is the computational difficulty of estimating nadir points of Pareto set. The paper describes the use of diverse variants of evolutionary algorithms to the estimation of nadir points, together with experimental evidence. [ABSTRACT FROM AUTHOR]

A critical aspect of software engineering is Software fault prediction which aims to identify and prevent errors in software systems before their release which can cause failures or issues for its users. Various techniques and tools have been developed to detect software faults, including static code analysis, dynamic testing, and machine learning-based approaches. In past few years, the world has seen a growing interest in the use of ML models for predicting software faults, as they can effectively analyse high dimensional datasets and detect complex patterns which are difficult for human experts to detect. However, developing accurate and reliable software fault detection models requires careful selection of data, feature engineering, and model evaluation. This purpose of this paper is to present a comprehensive analysis of potential applications and future research directions in the field of software fault detection. The study emphasizes the importance of identifying and addressing software faults to ensure the reliability and efficiency of software systems. Additionally, the paper outlines various approaches and techniques that can be employed for effective software fault detection. [ABSTRACT FROM AUTHOR]

Global Nash equilibrium is an optimal solution for each player in a graphical game. This paper proposes an iterative adaptive dynamic programming-based algorithm to solve the global Nash equilibrium solution for optimal containment control problem with robustness analysis to the iterative error. The containment control problem is transferred into the graphical game formulation. Sufficient conditions are given to decouple the Hamilton–Jacobi equations, which guarantee the solvability of the global Nash equilibrium solution. The iterative algorithm is designed to obtain the solution without any knowledge of system dynamics. Conditions of iterative error for global stability are given with rigorous proof. Compared with existing works, the design procedures of control gain and coupling strength are separated, which avoids trivial cases in the design procedure. The robustness analysis exactly quantifies the effect of the iterative error caused by various sources in engineering practice. The theoretical results are validated by two numerical examples with marginally stable and unstable dynamics of the leader. [ABSTRACT FROM AUTHOR]

This paper presents a novel hierarchical control scheme for solving the data-driven optimal cooperative tracking control problem of heterogeneous multi-agent systems. Considering that followers cannot communicate with the leader, a prescribed-time fully distributed observer is devised to estimate the leader's state for each follower. Then, the data-driven decentralized controller is designed to ensure that the follower's output can track the leader's one. Compared with the existing results, the advantages of the designed distributed observer are that the prescribed convergence time is completely predetermined by the designer, and the design of the observer gain is independent of the global topology information. Besides, the advantages of the designed decentralized controller are that neither the follower's system model nor a known initial stabilizing control policy is required. Finally, simulation results exemplify the advantage of the proposed method. • Compared with the existing methods, the advantage of our proposed prescribed-time fully distributed observer is that the leader's state can be accurately estimated within the designer's predetermined time; • Unlike the existing RL-based algorithms that rely on the initial stabilizing control policy associated with the accurate system matrices, the proposed new RL-based algorithm not only does not require a known initial stabilizing control policy, but also ensures the optimal tracking control in a data-driven manner. • Different from the homotopy-based policy iteration algorithm, an improved counterpart is presented, where the design parameter can be directly designed in the data-driven manner. [ABSTRACT FROM AUTHOR]

The predicted Bridge Condition Index (BCI) is a guiding indicator for formulating preventive maintenance strategies for bridges and is hardly available even if using the most advanced neural network prediction model, owing to the few measured BCIs and neural network model defects. In this paper, an improved Back-Propagation Neural Network (BPNN) model named CPSO-BP-MC is proposed to predict BCI, which has a BPNN as its core, combined with the Coordinated Particle Swarm Optimization (CPSO) algorithm aims to faster convergence and avoid local optimal solution even with less training sample, and the Markov Chain (MC) algorithm aims to further revise the fluctuation of CPSO-BP prediction output due to maintenance and reinforcement. A case study is presented to demonstrate the efficiency of CPSO-BP-MC predicting BCI with fewer training samples. Comparing the predicted BCI of CPSO-BP-MC with the measured BCI and other models, the results show that CPSO-BP-MC converges faster than other models, and can predict the BCI more stably and accurately, and the error between prediction and measured BCI is less than 3 %. [ABSTRACT FROM AUTHOR]

With the continuous advancements in malicious code polymorphism and obfuscation techniques, the performance of traditional machine learning-based detection methods for malware variant detection has gradually declined. Additionally, conventional pre-trained models could adequately capture the contextual semantic information of malicious code and appropriately represent polysemous words. To enhance the efficiency of malware variant detection, this paper proposes the MalEXLNet intelligent semantic analysis and detection architecture for malware. This architecture leverages malware API call sequences and employs an improved pre-training model for semantic vector representation, effectively utilizing the semantic information of API call sequences. It constructs a hybrid deep learning model, CBAM+AttentionBiLSTM, for training and classification prediction. Furthermore, incorporating the KMeansSMOTE algorithm achieves balanced processing of small sample data, ensuring the model maintains robust performance in detecting malicious variants from rare malware families. Comparative experiments on generalized datasets, Ember and Catak, the results show that the proposed MalEXLNet architecture achieves excellent performance in malware classification and detection tasks, with accuracies of 98.85% and 94.46% in the two datasets, and macro-averaged and micro-averaged metrics exceeding 98% and 92%, respectively. [ABSTRACT FROM AUTHOR]

The particle swarm optimization (PSO) path planning algorithm often suffers from low population diversity and rapid early convergence, which can lead to the algorithm easily falling into local optima and affecting its stability. This paper proposes an improved PSO algorithm with two key enhancements: (1) the introduction of a particle reactivation module during the iteration process, and (2) the incorporation of the Simulated Annealing (SA) concept during the global optimal solution update phase. These improvements enhance the diversity of the particle population, slow down the early convergence rate of the algorithm, reduce the probability of the algorithm getting trapped in local optima, and increase its overall stability. Experiments were conducted to compare the proposed algorithm with the standard PSO algorithm, genetic algorithms, and other improved PSO path planning algorithms. The results indicate that the improved algorithm shows superior performance in both average path length and algorithm stability. [ABSTRACT FROM AUTHOR]

Siamese-based segmentation and tracking algorithms improve accuracy and stability for video object segmentation and tracking tasks simultaneously. Although effective, variability in target appearance and background clutter can still affect segmentation accuracy and further influence the performance of tracking. In this paper, we present a memory propagation-based target- aware and mask-attention decision network for robust object segmentation and tracking. Firstly, a mask propagation-based attention module (MPAM) is constructed to explore the inherent correlation among image frames, which can mine mask information of the historical frames. By retrieving a memory bank (MB) that stores features and binary masks of historical frames, target attention maps are generated to highlight the target region on backbone features, thus suppressing the adverse effects of background clutter. Secondly, an attention refinement pathway (ARP) is designed to further refine the segmentation profile in the process of mask generation. A lightweight attention mechanism is introduced to calculate the weight of low- level features, paying more attention to low-level features sensitive to edge detail so as to obtain segmentation results. Finally, a mask fusion mechanism (MFM) is proposed to enhance the accuracy of the mask. By utilizing a mask quality assessment decision network, the corresponding quality scores of the “initial mask” and the “previous mask” can be obtained adaptively, thus achieving the assignment of weights and the fusion of masks. Therefore, the final mask enjoys higher accuracy and stability. Experimental results on multiple benchmarks demonstrate that our algorithm performs outstanding performance in a variety of challenging tracking tasks. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is facing growing security challenges due to its vulnerability. It is imperative to address the security issues using lightweight and efficient encryption schemes in resource-limited IoT. In this paper, we propose an enhanced message authentication encryption (MAE) scheme based on physical-layer key generation (PKG), which uses the random nature of wireless channels to generate and negotiate keys, and simultaneously encrypts the messages and authenticates the source. The proposed enhanced MAE scheme can greatly improve the security performance via dynamic keyed primitives construction while consuming very few resources. The enhanced MAE scheme is an efficient and lightweight secure communication solution, which is very suitable for resource-limited IoT. Theoretical analysis and simulations are carried out to confirm the security of the enhanced MAE scheme and evaluate its performance. A one-bit flipping in the session key or plain texts will result in a 50%-bit change in the ciphertext or message authentication code. The numerical results demonstrate the good performance of the proposed scheme in terms of diffusion and confusion. With respect to the typical advanced encryption standard (AES)- based scheme, the performance of the proposed scheme improves by 80.5% in terms of algorithm execution efficiency. [ABSTRACT FROM AUTHOR]

Existing sea surface small target detection methods typically rely on intricate feature extraction techniques on transformed radar returns. However, these approaches suffer from issues of high computational complexity and low real-time performance. Temporal Convolutional Network (TCN) can enable direct processing of radar time-series echo data without the need for elaborate feature extraction, thus substantially improving computational efficiency. Building upon this, this paper presents a novel target detection algorithm based on Multi-layer Attention Temporal Convolutional Network (MA-TCN). The proposed algorithm processes the amplitude information in the original echo signals, and comprehensively extracts sequence feature information through the construction of stacked residual modules. Additionally, it integrates multi-layer attention mechanisms to adaptively adjust the output weights of each residual module, thereby further enhancing detection accuracy. Experimental results demonstrate that the proposed approach achieves significant improvements in both detection performance and efficiency compared to existing methods. [ABSTRACT FROM AUTHOR]

The detection algorithms of small objects in remote sensing images is often challenging due to the complex background and limited pixels. This can lead to reduced accuracy in detection and an increased number of missed small objects. So this paper introduces YOLOFNC, an enhanced network based on YOLOv7. To improve the model's ability to capture features of small objects, an enhanced C3-Faster module based on the C3 module is designed and integrated into the YOLOv7 network. This module helps extract more features related to small objects. Additionally, we employ Normalized Wasserstein Distance (NWD) fusion GIoU as a novel loss function to refine the accuracy of network optimization weights and the small object regression framework. Furthermore, a coordinated attention (CA) mechanism is incorporated at strategic locations in the model to reduce redundant information in the feature layer and prevent the loss of important small object features. we conduct comparison experiments between YOLO-FNC and other commonly used object detection algorithms on DIOR, AITOD, and VisDrone datasets. The experimental results show that YOLO-FNC achieves 84.4% mAP on the DIOR dataset, 35.9% mAP on the AI-TOD dataset, and 52.6% mAP on the VisDrone dataset. Compared to YOLOv7 and other remote sensing object detection models, YOLO-FNC demonstrates better performance in object detection. [ABSTRACT FROM AUTHOR]

The paper discusses the possibility of increasing the effectiveness of strategic management of research and development activities in higher education institutions. To achieve this goal, the authors proposed an algorithm for selecting competencies, which allows for the distribution of university employees and students among research and development teams in accordance with their individual competencies for carrying out research and development work. The paper covers the problem statement of competence selection, an overview of natural language processing methods for algorithm development, problematic areas of the algorithm, and prospects for its implementation in university management. [ABSTRACT FROM AUTHOR]

In order to improve the effect of intelligent fusion recommendation under the background of social network, this paper combines the fuzzy perception algorithm to research the intelligent fusion recommendation algorithm of social network. Moreover, this paper proposes a task offloading scheme that relies on V2V communication to utilize idle computing resources in a "resource pool". In addition, this paper formulates the computational task execution time as a min-max problem to reduce the storage overhead to optimize the total task execution time. Numerical results show that the proposed scheme greatly reduces the task execution time. The introduced particle swarm optimization algorithm also proves the convergence speed and accuracy of the optimization problem. The research verifies that the intelligent fusion recommendation algorithm for social network based on fuzzy perception has good social network data fusion effect and can effectively improve the effect of intelligent fusion recommendation. [ABSTRACT FROM AUTHOR]

Federated learning is a distributed machine learning framework that solves data security and data island problems faced by artificial intelligence. However, federated learning frameworks are not always secure, and attackers can attack customer privacy information by analyzing parameters in the training process of federated learning models. To solve the problems of data security and availability during federated learning training, this paper proposes an Efficient Differential Privacy Federated Learning Algorithm based on early stopping mechanism (EfficientDP-FL). This method inherits the advantages of differential privacy and federated learning and improves the performance of model training while protecting the parameter information uploaded by the client during the training process. Specifically, in the federated learning framework, this article uses an adaptive DP-FL method for gradient descent training, which makes the model converge faster than traditional stochastic gradient descent. In addition, due to model convergence, noise should be reduced accordingly. This paper introduces an early stopping mechanism to improve data availability. This paper demonstrates the performance improvement of the Efficient DP-FL algorithm through simulation experiments on real MNIST and Fashion-MNIST datasets. Experimental showthat the efficient DP-FL algorithm is significantly superior to other algorithms. [ABSTRACT FROM AUTHOR]

Multi-objective reinforcement learning (MORL) extends traditional RL by seeking policies making different compromises among conflicting objectives. The recent surge of interest in MORL has led to diverse studies and solving methods, often drawing from existing knowledge in multi-objective optimization based on decomposition (MOO/D). Yet, a clear categorization based on both RL and MOO/D is lacking in the existing literature. Consequently, MORL researchers face difficulties when trying to classify contributions within a broader context due to the absence of a standardized taxonomy. To tackle such an issue, this paper introduces multi-objective reinforcement learning based on decomposition (MORL/D), a novel methodology bridging the literature of RL and MOO. A comprehensive taxonomy for MORL/D is presented, providing a structured foundation for categorizing existing and potential MORL works. The introduced taxonomy is then used to scrutinize MORL research, enhancing clarity and conciseness through well-defined categorization. Moreover, a flexible framework derived from the taxonomy is introduced. This framework accommodates diverse instantiations using tools from both RL and MOO/D. Its versatility is demonstrated by implementing it in different configurations and assessing it on contrasting benchmark problems. Results indicate MORL/D instantiations achieve comparable performance to current state-of-the-art approaches on the studied problems. By presenting the taxonomy and framework, this paper offers a comprehensive perspective and a unified vocabulary for MORL. This not only facilitates the identification of algorithmic contributions but also lays the groundwork for novel research avenues in MORL. [ABSTRACT FROM AUTHOR]

In this paper, a pipeline leakage detection algorithm based on information fusion of pressure and flow is proposed, and its core work is the construction of BPA based on discount factors. The wavelet packet decomposition is carried out for the original signals, and the processed signals are used to train different SVM classifiers to achieve the first identification results. For the samples whose initial classification results are not completely consistent, BPA is calculated according to the confusion matrixes of the initial SVM classifiers. In this paper, static discount factors and dynamic discount factors are constructed using different methods, and dynamic discount factors are modified when decisions fail. Then comprehensive discount factors are constructed based on the combination of different static discount factors and dynamic discount factors. The Shafer discount rule is used to modify BPA. Finally, D-S evidence theory is used to fuse the BPA results of all classifiers under different discount combinations. Experiments show that this algorithm can effectively use the correlation of evidences to reasonably fuse the decision results of multiple sensors, overcome the problem that the accuracy of a single sensor is not high enough for leakage identification, and improve the identification accuracy of pipeline leakage. [ABSTRACT FROM AUTHOR]

As urbanization progresses, urban road congestion has intensified, highlighting the need for effective vehicle and pedestrian detection as a cornerstone of public safety transportation. This area holds significant relevance in video surveillance and public safety domains. Despite its importance, achieving precise vehicle and pedestrian detection in complex road environments remains challenging. This paper presents a vehicle-pedestrian detection algorithm based on the improved YOLOv5. Key modifications include the integration of a small target detection layer and alterations to the feature pyramid using the feature fusion technique inherent to the weighted Bidirectional Feature Pyramid Network (BIFPN). This ensures efficient multi-scale feature fusion. A coordinated attention mechanism is introduced to preserve accurate target location data. Furthermore, the paper incorporates the SIOU metric to refine the localization loss function, bolstering both speed and edge regression accuracy. Experimental outcomes indicate that our improved YOLOv5 algorithm augments detection accuracy by 1.9% and achieves a detection speed of 67 FPS, which surpasses many competing target detection algorithms. [ABSTRACT FROM AUTHOR]

The substantial surge in users has adversely impacted the performance of the present IP-based Internet. Named data networking (NDN) emerges as a future alternative, given its distributed content caching system, where data can be cached in multiple routers and retrieved from the closest one instead of the original producer, enhancing content availability, reducing latency, and minimizing data loss. This paper introduces the less popular content eviction (LPCE) policy, a novel cache replacement scheme designed to enhance the caching performance of the conventional LFU (least frequently used) policy in NDN routers, thereby improving overall network efficiency. The proposed method subsumes LFU and FIFO (first in first out) policies and employs an additional list controlled by the LRU (least recently used) policy. Utilizing the ccnSim simulator, we conduct a comparison of LPCE’s performance with that of the LFU technique and other competing caching techniques, considering variations in several simulation parameters. Experimental results reveal that the proposed LPCE algorithm excels over others across a majority of performance metrics, such as cache hit ratio, content delivery delay, upstream hop count, network traffic, and producers’ load. Besides, the findings indicate that LPCE outperforms LFU, with an increase in cache hit ratio ranging from 1.32% to 5.75%. [ABSTRACT FROM AUTHOR]

Graph Neural Network (GNN) directly inherits the captured collaborative information and there is no determination of whether the captured collaborative information benefits user preferences. Therefore, this paper propose the RCGCN model to solve that issue. First, we detect the level of interaction between a specific neighbor of the target node and other neighbors by the common interaction ratio (CIR), and the experimental results show that the collaboration information propagated by neighbors with higher CIR is more favorable to user preferences. Second, we introduce structural neighborhood contrastive learning to mine the association between users and items by comparing them with their structural neighbors. Finally, we use a joint training approach to optimize the learning objectives. The experimental results indicated that the RCGCN model is superior than the current benchmark models in both Recall@20 and NDCG@20 evaluation metrics. [ABSTRACT FROM AUTHOR]

The paper proposes a modification of the existing distributed forward-backward algorithm for finding strongly connected components in directed graphs. The modification aims at improving the parallelism of the algorithm by increasing the branching factor while dividing the workload. Instead of randomly picking the pivot vertex, a heuristic technique is used which allows more sub-tasks to be generated, on average, for the subsequent step of the algorithm. The work describes suitable algorithm modifications and presents empirical results, proving suitability of the approach in question. [ABSTRACT FROM AUTHOR]

There are many instances of intellectual property rights violations due to the common usage of digital data on the Internet, including unauthorised use, copying, and theft of digital content. Intellectual property rights of digital photos must be upheld, as they are very valuable materials. Digital watermarking is a more modern method to do this. By using a watermark (WM), the owner's information is included into the content, which may then be shared or saved. When required, this technology will retrieve the encoded WM information to prove ownership. Different technologies have been investigated and created on the basis of existing technologies, fields of use, etc. This paper proposes a novel approach to digital watermarking based on a neural network. First, the trigger data set and noise data set are generated from the binary encoding and random cutting of the original training samples. Then, the pattern with higher watermark trigger accuracy is obtained from the trigger set. Simulation results show that the proposed algorithm performs better in terms of accuracy and computing time cost compared to existing algorithms. [ABSTRACT FROM AUTHOR]

This paper explains the construction of a novel augmented hunger games search algorithm using a logarithmic spiral opposition-based learning technique. The proposed algorithm (LsOBL-HGS) is used as an efficient tool for both function optimization and controller design. To assess the performance of the algorithm for function optimization, benchmark functions from the CEC2017 test suite were employed and comparisons were made with available and good performing algorithms. In terms of controller design, the proposed LsOBL-HGS algorithm was utilized to design a FOPID controlled magnetic ball suspension system. Comparative assessments were also performed for FOPID controller design, as well using other state-of-the-art methods reported for the magnetic ball suspension system. The results showed that the proposed LsOBL-HGS algorithm has good capability for FOPID controller design employed in a magnetic ball suspension system as it provided an improvement of more than 13 % in terms of the transient response-related parameters and more than 34 % in terms of bandwidth compared to the best-reported approach used for comparisons. [ABSTRACT FROM AUTHOR]

In elastic optical networks (EONs), the slicing-and-stitching technique has emerged as a promising solution to reduce spectrum fragmentation by breaking the subcarrier consecutiveness constraint. This physical layer technology enables all-optical slicing of requests, allowing them to be accommodated in multiple lion-consecutive spectral slots within an EON. In this paper, we investigate the survivable routing problem in EONs with slicers. Specifically, we consider the dedicated path protection (DPP) scheme to address single edge failures. For each connection request, we aim to find a pair of link-disjoint lightpaths to route the request. Additionally, we propose four heuristic algorithms to determine the routing paths based on two different slicing schemes, namely source and L-shape. Through extensive simulations, we evaluate the performance of the proposed algorithms and demonstrate their effectiveness in achieving satisfactory results. [ABSTRACT FROM AUTHOR]

At present, the threats to network security are also increasing, among which abnormal traffic detection is the key link to ensure network security. Traditional detection methods based on signature or threshold are often difficult to adapt to the increasingly complex network environment and new attack methods. Therefore, this paper optimizes and improves the data processing technology, proposes a network ATD method based on particle swarm optimization (PSO) algorithm, and explores in detail the traffic data collection and pre-processing, the feature recognition of abnormal traffic, the application of PSO algorithm, real-time monitoring and response mechanism. The results of two sets of simulation experiments are as follows: compared with the traditional model, the accuracy rate of ATD of the improved algorithm is increased by 7.2% on average, and the detection time is reduced by 7.35s on average. This method not only enhances the adaptability of the model to new attacks, but also improves the degree of automation of detection. [ABSTRACT FROM AUTHOR]