7,321 results
Search Results
252. A relation based algorithm for solving direct current circuit problems.
- Author
-
He, Bin, Yu, Xinguo, Jian, Pengpeng, and Zhang, Ting
- Subjects
DIRECT current circuits ,PROBLEM solving ,ALGORITHMS - Abstract
This paper addresses the challenging problem of developing the automatic algorithm for solving direct current circuit problem. Leveraging on the innovated methods it proposes a high-performance relation based algorithm, called RaDCC. The challenges of the problem lie in relation acquisition and relation inference presentation after adopting the newly-established relation principle of solving problems. A high-performance procedure is developed for the challenging task of relation acquisition by leveraging on three innovated methods. Three methods are an enhanced schematics understanding method that can understand complicated structures of schematics, an extended syntax-semantics model method and a unit-theorem inference method to acquire schematic relations, explicit text relations and implicit text relations, respectively. To address another challenging problem of readable solution generation an action-schema presentation method is proposed to convert relation inference actions into relation inference presentations. The experimental results show that the proposed algorithm is high-performance since it achieves an accuracy of over 83.2% for solving problems from textbooks and 70.6% for solving problems from examination papers on a dataset that contains 1012 direct current circuit problems collected from the authority sources, much higher than the performance of the baseline algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
253. Human Action Recognition Algorithm Based on Improved ResNet and Skeletal Keypoints in Single Image.
- Author
-
Lin, Yixue, Chi, Wanda, Sun, Wenxue, Liu, Shicai, and Fan, Di
- Subjects
HUMAN activity recognition ,HUMAN behavior ,HUMAN mechanics ,PROBLEM solving ,ALGORITHMS - Abstract
Human action recognition is an important part for computers to understand the behavior of people in pictures or videos. In a single image, there is no context information for recognition, so its accuracy still needs to be greatly improved. In this paper, a single-image human action recognition method based on improved ResNet and skeletal keypoints is proposed, and the accuracy is improved by several methods. We improved the backbone network ResNet-50 and CPN to a certain extent and constructed a multitask network to suit the human action recognition task, which not only improves the accuracy but also balances the total number of parameters and solves the problem of large network and slow operation. In this paper, the improvement methods of ResNet-50, CPN, and whole network are tested, respectively. The results show that the single-image human action recognition based on improved ResNet and skeletal keypoints can accurately identify human action in the case of different human movements, different background light, and occlusion. Compared with the original network and the main human action recognition algorithms, the accuracy of our method has its certain advantages. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
254. Applying successive improvement transformations for intelligent problem solving
- Author
-
Lee, Edward T. and Lee, Madonna E.
- Published
- 1999
- Full Text
- View/download PDF
255. Signal Recognition for English Speech Translation Based on Improved Wavelet Denoising Method.
- Author
-
Chen, Zhuo
- Subjects
SIGNAL denoising ,AUTOMATIC speech recognition ,SPEECH perception ,STANDARD deviations ,PROBLEM solving ,ALGORITHMS - Abstract
The signal corresponding to English speech contains a lot of redundant information and environmental interference information, which will produce a lot of distortion in the process of English speech translation signal recognition. Based on this, a large number of studies focus on encoding and processing English speech, so as to achieve high-precision speech recognition. The traditional wavelet denoising algorithm plays an obvious role in the recognition of English speech translation signals, which mainly depends on the excellent local time-frequency domain characteristics of the wavelet signal algorithm, but the traditional wavelet signal algorithm is still difficult to select the recognition threshold, and the recognition accuracy is easy to be affected. Based on this, this paper will improve the traditional wavelet denoising algorithm, abandon the single-threshold judgment of the original traditional algorithm, innovatively adopt the combination of soft threshold and hard threshold, further solve the distortion problem of the denoising algorithm in the process of English speech translation signal recognition, improve the signal-to-noise ratio of English speech recognition, and further reduce the root mean square error of the signal. Good noise reduction effect is realized, and the accuracy of speech recognition is improved. In the experiment, the algorithm is compared with the traditional algorithm based on MATLAB simulation software. The simulation results are consistent with the actual theoretical results. At the same time, the algorithm proposed in this paper has obvious advantages in the recognition accuracy of English speech translation signals, which reflects the superiority and practical value of the algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
256. A path planning method based on the particle swarm optimization trained fuzzy neural network algorithm.
- Author
-
Liu, Xiao-huan, Zhang, Degan, Zhang, Jie, Zhang, Ting, and Zhu, Haoli
- Subjects
PARTICLE swarm optimization ,FUZZY neural networks ,ALGORITHMS ,PROBLEM solving - Abstract
The basic fuzzy neural network algorithm has slow convergence and large amount of calculation, so this paper designed a particle swarm optimization trained fuzzy neural network algorithm to solve this problem. Traditional particle swarm optimization is easy to fall into local extremes and has low efficiency, this paper designed new update rules for inertia weight and learning factors to overcome these problems. We also designed training rules for the improved particle swarm optimization to train fuzzy neural network, and the hybrid algorithm is applied to solve the path planning problem of intelligent driving vehicles. The efficiency and practicability of the algorithm are proved by experiments. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
257. Applications of Deep Learning in News Text Classification.
- Author
-
Zhang, Menghan
- Subjects
DEEP learning ,PROBLEM solving ,FEATURE extraction ,CLASSIFICATION ,ALGORITHMS - Abstract
The advancement in technology is taking place with an accelerating pace across the globe. With the increasing expansion and technological advancement, a vast volume of text data are generated everyday, in the form of social media platform, websites, company data, healthcare data, and news. Indeed, it is a difficult task to extract intriguing patterns from the text data, such as opinions, summaries, and facts, having varying length. Because of the problems of the length of text data and the difficulty of feature value extraction in news, this paper proposes a news text classification method based on the combination of deep learning (DL) algorithms. In order to classify the text data, the earlier approaches use a single word vector to express text information and only the information of the relationship between words were considered, but the relationship between words and categories was ignored which indeed is an important factor for the classification of news text. This paper follows the idea of a customized algorithm which is the combination of DL algorithms such as CNN, LSTM, and MLP and proposes a customized DCLSTM-MLP model for the classification of news text data. The proposed model is expressed in parallel with word vector and word dispersion. The relationship among words is represented by the word vector as an input of the CNN module, and the relationship between words and categories is represented by a discrete vector as an input of the MLP module in order to realize comprehensive learning of spatial feature information, time-series feature information, and relationship between words and categories of news text. To check the stability and performance of the proposed method, multiple experiments were performed. The experimental results showed that the proposed method solves the problems of text length, difficulty of feature extraction in the news text, and classification of news text in an effective way and attained better accuracy, recall rate, and comprehensive value as compared to the other models. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
258. ALGORITHM FOR THE COUNTERCLOCKWISE ORDERING OF VERTEXES OF SLANTED SURFACES TOWARDS THE GENERATION OF SEMANTIC GBXML MODELS.
- Author
-
Otero, R., Lagüela, S., and Arias, P.
- Subjects
ALGORITHMS ,GREEN roofs ,SYSTEMS development ,PROBLEM solving - Abstract
This paper presents an algorithm developed to solve a problem during the development of a system to estimate de 3D model of buildings roofs and its incorporation into a BIM. The chosen schema for the BIM is gbXML and one of its condition is that the vertexes that describe the model surfaces must be counterclockwise ordered. Due to the variability in the orientation of the analysed surfaces, the algorithm must be able to work with any surface regardless its orientation. Also, this paper includes the testing of the algorithm. This test is based on the application of the developed algorithm among three different real-world scenarios. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
259. Genetic algorithms in the design of complex distribution networks
- Author
-
Berry, L.M., Murtagh, B.A., McMahon, G.B., Sugden, S.J., and Welling, L.D.
- Published
- 1998
- Full Text
- View/download PDF
260. Research on path planning algorithm of mobile robot based on reinforcement learning.
- Author
-
Pan, Guoqian, Xiang, Yong, Wang, Xiaorui, Yu, Zhongquan, and Zhou, Xinzhi
- Subjects
MOBILE robots ,REINFORCEMENT learning ,MOBILE learning ,ALGORITHMS ,MACHINE learning ,PROBLEM solving - Abstract
In order to solve the problems of low learning efficiency and slow convergence speed when mobile robot uses reinforcement learning method for path planning in complex environment, a reinforcement learning method based on each round path planning result is proposed. Firstly, the algorithm adds obstacle learning matrix to improve the success rate of path planning; and introduces heuristic reward to speed up the learning process by reducing the search space; then proposes a method of dynamically adjusting the exploration factor to balance the exploration and utilization in path planning, so as to further improve the performance of the algorithm. Finally, the simulation experiment in grid environment shows that compared with Q-learning algorithm, the improved algorithm not only shortens the average path length of the robot to reach the target position, but also speeds up the learning efficiency of the algorithm, so that the robot can find the optimal path more quickly. The code of EPRQL algorithm proposed in this paper has been published to GitHub: https://github.com/panpanpanguoguoqian/mypaper1.git. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
261. UAV Localization Algorithm Based on Factor Graph Optimization in Complex Scenes.
- Author
-
Dai, Jun, Liu, Songlin, Hao, Xiangyang, Ren, Zongbin, and Yang, Xiao
- Subjects
KALMAN filtering ,GRAPH algorithms ,ALGORITHMS ,AERONAUTICAL navigation ,LOCALIZATION (Mathematics) ,MATHEMATICAL optimization ,PROBLEM solving - Abstract
With the increasingly widespread application of UAV intelligence, the need for autonomous navigation and positioning is becoming more and more important. To solve the problem that UAV cannot perform localization in complex scenes, a new multi-source fusion framework factor graph optimization algorithm is used for UAV localization state estimation in this paper, which is based on IMU/GNSS/VO multi-source sensors. Based on the factor graph model and the iSAM incremental inference algorithm, a multi-source fusion model of IMU/GNSS/VO is established, including the IMU pre-integration factor, IMU bias factor, GNSS factor, and VO factor. Mathematical simulations and validations on the EuRoC dataset show that, when the selected sliding window size is 30, the factor graph optimization (FGO) algorithm can not only meet the requirements of real time and accuracy at the same time, but it also achieves a plug-and-play function in the event of local sensor failures. Finally, compared with the traditional federated Kalman algorithm and the adaptive federated Kalman algorithm, the positioning accuracy of the FGO algorithm in this paper is improved by 1.5–2-fold, and can effectively improve autonomous navigation system robustness and flexibility in complex scenarios. Moreover, the multi-source fusion framework in this paper is a general algorithm framework that can satisfy other scenarios and other types of sensor combinations. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
262. Threshold Segmentation and Length Measurement Algorithms for Irregular Curves in Complex Backgrounds.
- Author
-
Ruan, Xusheng, Deng, Honggui, Xu, Qiguo, Liu, Yang, and He, Jun
- Subjects
LENGTH measurement ,CURVES ,ALGORITHMS ,PROBLEM solving ,SKELETON - Abstract
It is an urgent problem to know how to quickly and accurately measure the length of irregular curves in complex background images. To solve the problem, we first proposed a quasi-bimodal threshold segmentation (QBTS) algorithm, which transforms the multimodal histogram into a quasi-bimodal histogram to achieve a faster and more accurate segmentation of the target curve. Then, we proposed a single-pixel skeleton length measurement (SPSLM) algorithm based on the 8-neighborhood model, which used the 8-neighborhood feature to measure the length for the first time, and achieved a more accurate measurement of the curve length. Finally, the two algorithms were tested and analyzed in terms of accuracy and speed on the two original datasets of this paper. The experimental results show that the algorithms proposed in this paper can quickly and accurately segment the target curve from the neon design rendering with complex background interference and measure its length. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
263. Multi-Source Data High-Performance Indoor Positioning considering Genetic Optimization Neural Network Algorithm.
- Author
-
Chu, Peng, Zhang, He, Chen, Yarong, Zhu, Rui, and Wang, Feng
- Subjects
LOCATION problems (Programming) ,GENETIC algorithms ,ALGORITHMS ,PROCESS optimization ,PROBLEM solving - Abstract
In order to effectively solve the problem of relatively large errors in individual positioning strategies in indoor environments, this paper applies the genetic optimization neural network algorithm to indoor location based on multi-source information fusion. The range of the geomagnetic fitness is constrained based on the results obtained by using the wireless WiFi positioning for combination and matching, which can reduce the value of the matching error effectively. Subsequently, the global optimal value of the indoor network is calculated based on the genetic algorithm, which can optimize the initial value and threshold of the neural network after genetic optimization so as to improve the accuracy of the network to the greatest extent possible while accelerating the convergence speed at the same time. After the optimization processing is completed, fusion training can be performed on the coordinates of the actual positions based on the obtained combination positioning situation and the predicted positioning result in the indoor network. Finally, the optimal positioning result can be obtained accordingly. Through the analysis of practical cases, it can be known that the mean square error predicted based on the genetic optimization neural network calculated by using the genetic algorithm can be effectively reduced by 76%, and the accuracy of the fusion positioning can be increased by 48% on average compared with the accuracy of a single positioning strategy. Hence, the method put forward in this paper has effectively improved the positioning accuracy, which suggests that its positioning performance is superior. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
264. Multi-image encryption algorithm based on wavelet transform and 3D shuffling scrambling.
- Author
-
Zhong, Huiyan and Li, Guodong
- Subjects
IMAGE encryption ,RUNNING speed ,ALGORITHMS ,WAVELET transforms ,CUBES ,PROBLEM solving - Abstract
To solve the problems of low efficiency and poor resistance to attack, this paper proposes the multi-image encryption algorithm based on Haar wavelet transform and 3D shuffling scrambling. Taking advantage of the high computational efficiency of low-dimensional chaotic maps, this paper designs the dynamic pseudo-random sequence generator based on a dynamic chaotic library with three one-dimension chaotic maps and the roulette algorithm, which is highly associated with the plaintext image. To better scramble the image cube, this paper proposes a 3D shuffling scrambling algorithm, which divides the cube into one-dimensional vectors and scrambles the order of the one-dimensional vectors, then reorganizes the cube. To encrypt multiple images, first, reconstruct the images into an image cube and perform wavelet transformation on each layer of the cube. Then, use the 3D shuffling algorithm to scramble the low-frequency coefficient and reconstruct the cube with the scrambled low-frequency coefficient and high-frequency parts. Last, the chaotic matrix is XOR with each layer of the image cube. The algorithm can encrypt grayscale or color images of any size, which is flexible. In the simulation experiments, the algorithm has ideal ciphertext statistical characteristics, high running speed, and the ability of anti-attack, which is better than encryption algorithm in other references. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
265. Handover Management in Multi-Hop Cluster based Vehicular Ad-hoc Networks.
- Author
-
Thakur, Poonam and Ganpati, Anita
- Subjects
VEHICULAR ad hoc networks ,HOPS ,PROBLEM solving ,ALGORITHMS - Abstract
Handover management is one of the emerging trends in VANETs as it provides seamless connectivity throughout the communication process. No doubt handover management is a highly explored topic in the domain of VANETs but handover management in cluster based VANETs has not been given much attention. So, there is a need to focus on the issue of handover management in cluster based VANETs. In this paper, we have introduced an Enhanced Multi-hop Cluster based Algorithm (EMhCA) for providing smooth handover management in cluster based VANETs. This EMhCA is the improved multi-hop clustering algorithm which uses the concept of a cluster subordinate node that helps in solving handover problem in overlapping zone found in the cluster based VANET. The paper below presents a detailed description of the proposed algorithm. To analyse and validate the perfor)mance of proposed EMhCA, ns-3 and SUMO were used. From the simulation results it may be concluded that EMhCA has improved performance in terms of cluster stability and handover management as compared to the other cluster algorithms reported in the literature i.e. VMaSC, VMaSC-LTE and MhCA. [ABSTRACT FROM AUTHOR]
- Published
- 2022
266. Improved FunkSVD Algorithm Based on RMSProp.
- Author
-
Yue, Xiaochen and Liu, Qicheng
- Subjects
ALGORITHMS ,DEEP learning ,MACHINE learning ,MATHEMATICAL optimization ,PROBLEM solving - Abstract
To solve the problem of low accuracy in the traditional FunkSVD recommendation algorithm, an improved FunkSVD algorithm (RM-FS) is proposed. RM-FS is an improvement of the traditional FunkSVD algorithm, using RMSProp, a deep learning optimization algorithm. The RM-FS algorithm can not only solve the problem of reduced accuracy of the traditional FunkSVD algorithm because of iterative oscillations but also alleviate the impact of data sparseness on the accuracy of the algorithm, achieving the effect of improving the accuracy of the traditional algorithm. The experimental results show that the RM-FS algorithm proposed in this paper effectively improves the accuracy of the recommendation algorithm, which is better than the traditional FunkSVD recommendation algorithm and other improved FunkSVD algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
267. Human Detection Algorithm Based on Improved YOLO v4.
- Author
-
Xuan Zhou, Jianping Yi, Guokun Xie, Yajuan Jia, Genqi Xu, and Min Sun
- Subjects
HUMAN behavior ,ALGORITHMS ,URINARY tract infections ,HUMAN beings ,PROBLEM solving ,TRACKING algorithms - Abstract
The human behavior datasets have the characteristics of complex background, diverse poses, partial occlusion, and diverse sizes. Firstly, this paper adopts YOLO v3 and YOLO v4 algorithms to detect human objects in videos, and qualitatively analyzes and compares the detection performance of two algorithms on UTI, UCF101, HMDB51, and CASIA datasets. Then, this paper proposed an improved YOLO v4 algorithm since the vanilla YOLO v4 has incomplete human detection in specific video frames. Specifically, the improved YOLO v4 introduces the Ghost module in the CBM module, aiming to further reduce the number of parameters. Lateral connection is added in the CSP module to improve the feature representation capability of the network. Furthermore, we also substitute MaxPool with SoftPool in the primary SPP module, which not only avoids the feature loss but also provides a regularization effect for the network, thus improving the generalization ability of the network. Finally, this paper qualitatively compares the detection effects of the improved YOLO v4 and primary YOLO v4 algorithm on specific datasets. The experimental results show that the improved YOLO v4 can effectively solve the problem of complex targets in human detection tasks and improve detection speed. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
268. Selection of optimal parameters in gas‐assisted injection moulding using a neural network model and the Taguchi method
- Author
-
Chiu, Chih‐Chou, Su, Chao‐Ton, Yang, Gong‐Shung, Huang, Jeng‐Sheng, Chen, Shia‐Chung, and Cheng, Nien‐Tien
- Published
- 1997
- Full Text
- View/download PDF
269. A two-stage robust hub location problem with accelerated Benders decomposition algorithm.
- Author
-
Rahmati, Reza, Bashiri, Mahdi, Nikzad, Erfaneh, and Siadat, Ali
- Subjects
LOCATION problems (Programming) ,ALGORITHMS ,NUMERICAL analysis ,PROBLEM solving ,UNCERTAIN systems - Abstract
In this paper, a two-stage robust optimisation is presented for an uncapacitated hub location problem in which demand is uncertain and the level of conservatism is controlled by an uncertainty budget. In the first stage, locations for establishing hub facilities were determined, and allocation decisions were made in the second stage. An accelerated Benders decomposition algorithm was used to solve the problem. Computational experiments showed better results in terms of number of iterations and computation time for Benders decomposition with Pareto-optimal cuts in comparison with the classical Benders decomposition algorithm. According to numerical analysis, it was concluded that increasing the uncertainty budget also increased total costs for more established hubs. To determine the uncertainty budget in an appropriate manner, a new expected aggregate function was introduced. The numerical studies demonstrated the usefulness of the proposed method in defining the appropriate uncertainty budget in the presence of uncertainty. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
270. School enterprise cooperation mechanism based on improved decision tree algorithm.
- Author
-
Bian, Fei, Wang, Xuansheng, Satapathy, Suresh Chandra, Agrawal, Rashmi, and García Díaz, Vicente
- Subjects
ALGORITHMS ,DECISION trees ,PROBLEM solving ,COOPERATION ,SCHOOL integration ,CLOUD computing - Abstract
School enterprise cooperation is of great strategic significance to China's manufacturing industry. The Party Central Committee has repeatedly proposed to strengthen the integration of industry and education and deepen the cooperation between schools and enterprises. In recent years, experts and scholars at home and abroad have been from different perspectives, although they have achieved fruitful results, there are also problems such as insufficient attention to theoretical research, relatively backward research, narrow research scope, and so on. In view of this phenomenon, this paper will study a new school-enterprise cooperation mechanism based on the improved decision tree algorithm. The research of this paper is divided into three parts. First, after analyzing the advantages and disadvantages of the algorithm, the algorithm of the decision tree is improved, which makes the improved algorithm more suitable for the field of school-enterprise cooperation. Then, based on cloud computing and intelligence, this paper establishes a new model of school-enterprise cooperation platform, which solves some problems of data management and information exchange in school-enterprise cooperation. Finally, in order to make the cooperation mechanism of this paper better used in practice, this paper builds an online and offline hybrid training base, hoping to make the cooperation between schools and enterprises closer through the training base. In order to test the effect of the cooperation model, this paper takes school as the experimental model. After investigation and research, it is believed that thanks to the school-enterprise cooperation mechanism in this paper, the cooperative enterprise of school has been greatly improved in the past three years, and the willingness of enterprises to cooperate has become more and more strong. No matter students, teachers, or enterprises are reaping huge benefits under this cooperation mechanism, it is a suit for extensive promotion The school-enterprise cooperation mechanism of Guangyun. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
271. PROBLEM SOLVING WITH GENERAL SEMANTICS
- Author
-
Hewson, David
- Published
- 1996
272. Algorithms for the Reconstruction of Genomic Structures with Proofs of Their Low Polynomial Complexity and High Exactness.
- Author
-
Gorbunov, Konstantin and Lyubetsky, Vassily
- Subjects
DIRECTED graphs ,POLYNOMIALS ,ALGORITHMS ,COMPUTATIONAL complexity ,MATHEMATICAL optimization ,PROBLEM solving ,PATHS & cycles in graph theory ,BIPARTITE graphs - Abstract
The mathematical side of applied problems in multiple subject areas (biology, pattern recognition, etc.) is reduced to the problem of discrete optimization in the following mathematical method. We were provided a network and graphs in its leaves, for which we needed to find a rearrangement of graphs by non-leaf nodes, in which the given functional reached its minimum. Such a problem, even in the simplest case, is NP-hard, which means unavoidable restrictions on the network, on graphs, or on the functional. In this publication, this problem is addressed in the case of all graphs being so-called "structures", meaning directed-loaded graphs consisting of paths and cycles, and the functional as the sum (over all edges in the network) of distances between structures at the endpoints of every edge. The distance itself is equal to the minimal length of sequence from the fixed list of operations, the composition of which transforms the structure at one endpoint of the edge into the structure at its other endpoint. The list of operations (and their costs) on such a graph is fixed. Under these conditions, the given discrete optimization problem is called the reconstruction problem. This paper presents novel algorithms for solving the reconstruction problem, along with full proofs of their low error and low polynomial complexity. For example, for the network, the problem is solved with a zero error algorithm that has a linear polynomial computational complexity; and for the tree the problem is solved using an algorithm with a multiplicative error of at most two, which has a second order polynomial computational complexity. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
273. VSSB-Raft: A Secure and Efficient Zero Trust Consensus Algorithm for Blockchain.
- Author
-
Tian, Siben, Bai, Fenhua, Shen, Tao, Zhang, Chi, and Gong, Bei
- Subjects
ALGORITHMS ,FAULT tolerance (Engineering) ,BLOCKCHAINS ,PROBLEM solving ,FORGERY - Abstract
To solve the problems of vote forgery and malicious election of candidate nodes in the Raft consensus algorithm, we combine zero trust with the Raft consensus algorithm and propose a secure and efficient consensus algorithm -Verifiable Secret Sharing Byzantine Fault Tolerance Raft Consensus Algorithm (VSSB-Raft). The VSSB-Raft consensus algorithm realizes zero trust through the supervisor node and secret sharing algorithm without the invisible trust between nodes required by the algorithm. Meanwhile, the VSSB-Raft consensus algorithm uses the SM2 signature algorithm to realize the characteristics of zero trust requiring authentication before data use. In addition, by introducing the NDN network, we redesign the communication between nodes and guarantee the communication quality among nodes. The VSSB-Raft consensus algorithm proposed in this paper can make the algorithm Byzantine fault tolerant by setting a threshold for secret sharing while maintaining the algorithm's complexity to be O(n). Experiments show that the VSSB-Raft consensus algorithm is secure and efficient with high throughput and low consensus latency. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
274. MULTI-STEP-LENGTH GRADIENT ITERATIVE METHOD FOR SEPARABLE NONLINEAR LEAST SQUARES PROBLEMS.
- Author
-
HAI-RONG CUI, JING LIN, and JIAN-NAN SU
- Subjects
IMAGE reconstruction ,SYSTEM identification ,NONLINEAR equations ,PROBLEM solving ,ALGORITHMS ,IMAGE recognition (Computer vision) - Abstract
Separable nonlinear least squares (SNLLS) problems are critical in various research and application fields, such as image restoration, machine learning, and system identification. Solving such problems presents a challenge due to their nonlinearity. The traditional gradient iterative algorithm often zigzags towards the optimal solution and is sensitive to the initial guesses of unknown parameters. In this paper, we improve the convergence rate of the traditional gradient method by implementing a multi-step-length gradient iterative algorithm. Moreover, we incorporate the variable projection (VP) strategy, taking advantage of the separable structure observed in SNLLS problems. We propose a multi-step-length gradient iterative-based VP (Mul-GI-VP) method to solve such nonlinear optimization problems. Our simulation results verify the feasibility and high efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
275. An Algorithm for Solving the Problem of Phase Unwrapping in Remote Sensing Radars and Its Implementation on Multicore Processors.
- Author
-
Martyshko, Petr S., Akimova, Elena N., Sosnovsky, Andrey V., and Kobernichenko, Victor G.
- Subjects
REMOTE sensing by radar ,REMOTE sensing ,PROBLEM solving ,MULTICORE processors ,PARALLEL algorithms ,SURFACE of the earth ,ALGORITHMS - Abstract
The problem of the interferometric phase unwrapping in radar remote sensing of Earth systems is considered. Such interferograms are widely used in the problems of creating and updating maps of the relief of the Earth's surface in geodesy, cartography, environmental monitoring, geological, hydrological and glaciological studies, and for monitoring transport communications. Modern radar systems have ultra-high spatial resolution and a wide band, which leads to the need to unwrap large interferograms from several tens of millions of elements. The implementation of calculations by these methods requires a processing time of several days. In this paper, an effective method for equalizing the inverse vortex field for phase unwrapping is proposed, which allows solving a problem with quasi-linear computational complexity depending on the interferogram size and the number of singular points on it. To implement the method, a parallel algorithm for solving the problem on a multi-core processor using OpenMP technology was developed. Numerical experiments on radar data models were carried out to investigate the effectiveness of the algorithm depending on the size of the source data, the density of singular points and the number of processor cores. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
276. Dynamic bipolar fuzzy aggregation operators: A novel approach for emerging technology selection in enterprise integration.
- Author
-
Alghazzawi, Dilshad, Abbas, Sajida, Alolaiyan, Hanan, Khalifa, Hamiden Abd El-Wahed, Alburaikan, Alhanouf, Xin, Qin, and Razaq, Abdul
- Subjects
EXPERT systems ,INNOVATION adoption ,PROBLEM solving ,FUZZY sets - Abstract
Emerging technology selection is crucial for enterprise integration, driving innovation, competitiveness, and streamlining operations across diverse sectors like finance and healthcare. However, the decision-making process for technology adoption is often complex and fraught with uncertainties. Bipolar fuzzy sets offer a nuanced representation of uncertainty, allowing for simultaneous positive and negative membership degrees, making them valuable in decision-making and expert systems. In this paper, we introduce dynamic averaging and dynamic geometric operators under bipolar fuzzy environment. We also establish some of the fundamental crucial features of these operators. Moreover, we present a step by step mechanism to solve MADM problem under bipolar fuzzy dynamic aggregation operators. In addition, these new techniques are successfully applied for the selection of the most promising emerging technology for enterprise integration. Finally, a comparative study is conducted to show the validity and practicability of the proposed techniques in comparison to existing methods. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
277. High-Dimensional Ensemble Learning Classification: An Ensemble Learning Classification Algorithm Based on High-Dimensional Feature Space Reconstruction.
- Author
-
Zhao, Miao and Ye, Ning
- Subjects
MACHINE learning ,CLASSIFICATION algorithms ,FEATURE selection ,NAIVE Bayes classification ,HIGH-dimensional model representation ,CLASSIFICATION ,ALGORITHMS ,PROBLEM solving - Abstract
When performing classification tasks on high-dimensional data, traditional machine learning algorithms often fail to filter out valid information in the features adequately, leading to low levels of classification accuracy. Therefore, this paper explores the high-dimensional data from both the data feature dimension and the model ensemble dimension. We propose a high-dimensional ensemble learning classification algorithm focusing on feature space reconstruction and classifier ensemble, called the HDELC algorithm. First, the algorithm considers feature space reconstruction and then generates a feature space reconstruction matrix. It effectively achieves feature selection and reconstruction for high-dimensional data. An optimal feature space is generated for the subsequent ensemble of the classifier, which enhances the representativeness of the feature space. Second, we recursively determine the number of classifiers and the number of feature subspaces in the ensemble model. Different classifiers in the ensemble system are assigned mutually exclusive non-intersecting feature subspaces for model training. The experimental results show that the HDELC algorithm has advantages compared with most high-dimensional datasets due to its more efficient feature space ensemble capability and relatively reliable ensemble operation performance. The HDELC algorithm makes it possible to solve the classification problem for high-dimensional data effectively and has vital research and application value. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
278. A polynomial algorithm for some instances of NP-complete problems.
- Author
-
Costandin, Marius and Gavrea, Bogdan
- Subjects
NP-complete problems ,ALGORITHMS ,EUCLIDEAN distance ,POLYNOMIALS ,POINT set theory ,PROBLEM solving - Abstract
In this paper, given a fixed reference point and a fixed intersection of finitely many equal radii balls, we consider the problem of finding a point in the said set which is the most distant, under Euclidean distance, to the said reference point. This proble is NP-complete in the general setting. We give sufficient conditions for the existence of an algorithm of polynomial complexity which can solve the problem, in a particular setting. Our algorithm requires that any point in the said intersection to be no closer to the given reference point than the radius of the intersecting balls. Checking this requirement is a convex optimization problem hence one can decide if running the proposed algorithm enjoys the presented theoretical guarantees. We also consider the problem where a fixed initial reference point and a fixed polytope are given and we want to find the farthest point in the polytope to the given reference point. For this problem we give sufficient conditions in which the solution can be found by solving a linear program. Both these problems are known to be NP-complete in the general setup, i.e the existence of an algorithm which solves any of the above problem without restrictions on the given reference point and search set is undecided so far. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
279. Dendritic Growth Optimization: A Novel Nature-Inspired Algorithm for Real-World Optimization Problems.
- Author
-
Priyadarshini, Ishaani
- Subjects
OPTIMIZATION algorithms ,BIOLOGICALLY inspired computing ,DEEP learning ,MACHINE learning ,METAHEURISTIC algorithms ,PROBLEM solving ,ALGORITHMS - Abstract
In numerous scientific disciplines and practical applications, addressing optimization challenges is a common imperative. Nature-inspired optimization algorithms represent a highly valuable and pragmatic approach to tackling these complexities. This paper introduces Dendritic Growth Optimization (DGO), a novel algorithm inspired by natural branching patterns. DGO offers a novel solution for intricate optimization problems and demonstrates its efficiency in exploring diverse solution spaces. The algorithm has been extensively tested with a suite of machine learning algorithms, deep learning algorithms, and metaheuristic algorithms, and the results, both before and after optimization, unequivocally support the proposed algorithm's feasibility, effectiveness, and generalizability. Through empirical validation using established datasets like diabetes and breast cancer, the algorithm consistently enhances model performance across various domains. Beyond its working and experimental analysis, DGO's wide-ranging applications in machine learning, logistics, and engineering for solving real-world problems have been highlighted. The study also considers the challenges and practical implications of implementing DGO in multiple scenarios. As optimization remains crucial in research and industry, DGO emerges as a promising avenue for innovation and problem solving. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
280. Real power loss reduction by Protist and Otocyon megalotis optimization algorithms.
- Author
-
Kanagasabai, Lenin
- Subjects
- *
OPTIMIZATION algorithms , *RELIEF models , *TEST systems , *PROBLEM solving , *ALGORITHMS - Abstract
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]
- Published
- 2024
- Full Text
- View/download PDF
281. LRPL-VIO: A Lightweight and Robust Visual–Inertial Odometry with Point and Line Features.
- Author
-
Zheng, Feixiang, Zhou, Lu, Lin, Wanbiao, Liu, Jingyang, and Sun, Lei
- Subjects
PROBLEM solving ,OBJECT tracking (Computer vision) ,INFORMATION design ,FEATURE selection ,ALGORITHMS - Abstract
Visual-inertial odometry (VIO) algorithms, fusing various features such as points and lines, are able to improve their performance in challenging scenes while the running time severely increases. In this paper, we propose a novel lightweight point–line visual–inertial odometry algorithm to solve this problem, called LRPL-VIO. Firstly, a fast line matching method is proposed based on the assumption that the photometric values of endpoints and midpoints are invariant between consecutive frames, which greatly reduces the time consumption of the front end. Then, an efficient filter-based state estimation framework is designed to finish information fusion (point, line, and inertial). Fresh measurements of line features with good tracking quality are selected for state estimation using a unique feature selection scheme, which improves the efficiency of the proposed algorithm. Finally, validation experiments are conducted on public datasets and in real-world tests to evaluate the performance of LRPL-VIO and the results show that we outperform other state-of-the-art algorithms especially in terms of speed and robustness. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
282. PA-YOLO-Based Multifault Defect Detection Algorithm for PV Panels.
- Author
-
Yin, Wang, Jingyong, Zhao, Gang, Xie, Zhicheng, Zhao, and Xiao, Hu
- Subjects
ALGORITHMS ,SOCIAL networks ,PROBLEM solving ,SPINE - Abstract
In recent years, solar photovoltaic (PV) energy, as a clean energy source, has received widespread attention and experienced rapid growth worldwide. However, the rapid growth of PV power deployment also brings important challenges to the maintenance of PV panels, and in order to solve this problem, this paper proposes an innovative algorithm based on PA-YOLO. First, we propose to use PA-YOLO's asymptotic feature pyramid network (AFPN) instead of YOLOv7's backbone network to support direct interactions of nonadjacent layers and avoid large semantic gaps between nonadjacent layers. For the occlusion problem of dense targets in the dataset, we introduce a repulsive loss function, which successfully reduces the occurrence of false detection situations. Finally, we propose a customized convolutional block equipped with an EMA mechanism to enhance the perceptual and expressive capabilities of the model. Experimental results on the dataset show that our proposed model achieves excellent performance with an average accuracy (mAP) of 94.5%, which is 6.8% higher than YOLOv7. In addition, our algorithm also succeeds in drastically reducing the model size from 71.3 MB to 48.4 MB, which well demonstrates the effectiveness of the model. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
283. Enhanced Aquila optimizer based on tent chaotic mapping and new rules.
- Author
-
Fu, Youfa, Liu, Dan, Fu, Shengwei, Chen, Jiadui, and He, Ling
- Subjects
METAHEURISTIC algorithms ,IMAGE encryption ,ALGORITHMS ,PROBLEM solving - Abstract
Metaheuristic algorithms, widely applied across various domains due to their simplicity and strong optimization capabilities, play a crucial role in problem-solving. While the Aquila Optimizer is recognized for its effectiveness, it often exhibits slow convergence rates and susceptibility to local optima in certain scenarios. To address these concerns, this paper introduces an enhanced version, termed Tent-enhanced Aquila Optimizer (TEAO). TEAO incorporates the Tent chaotic map to initialize the Aquila population, promoting a more uniform distribution within the solution space. To balance exploration and exploitation, novel formulas are proposed, accelerating convergence while ensuring precision. The effectiveness of the TEAO algorithm is validated through a comprehensive comparison with 14 state-of-the-art algorithms using 23 classical benchmark test functions. Additionally, to assess the practical feasibility of the approach, TEAO is applied to six constrained engineering problems and benchmarked against the performance of the same 14 algorithms. All experimental results consistently demonstrate that TEAO outperforms other advanced algorithms in terms of solution quality and stability, establishing it as a more competitive choice for optimization tasks. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
284. Branch-and-price-and-cut algorithm for the capacitated single allocation hub location routeing problem.
- Author
-
Wu, Yuehui, Qureshi, Ali Gul, Yamada, Tadashi, and Yu, Shanchuan
- Subjects
ALGORITHMS ,PROBLEM solving ,PRICES - Abstract
The paper focuses on a variant of hub location routeing problem arising in the design of intra-city express service networks, named as capacitated single allocation hub location routeing problem, in which each non-hub node should be served by exactly one hub, and both hub capacity and vehicle capacity are considered. A new mixed-integer programming formulation for the problem is provided, and a solution algorithm is developed on the basis of the column generation scheme to exactly solve the problem for the first time. The pricing subproblem is solved by a bidirectional labelling algorithm, and the master problem is strengthened by valid inequalities. Numerical experiments are conducted on the instances generated from the Australian Post dataset to test the performance of the model and the developed algorithm. Computational results prove that the algorithm outperforms the CPLEX and is able to provide optimal solutions for instances with up to 35 non-hub nodes and high-quality solutions for instances with 40 non-hub nodes within reasonable computational time, which indicates the feasibility and efficiency of the model and algorithm proposed. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
285. A Multi-Objective Sine Cosine Algorithm Based on a Competitive Mechanism and Its Application in Engineering Design Problems.
- Author
-
Liu, Nengxian, Pan, Jeng-Shyang, Liu, Genggeng, Fu, Mingjian, Kong, Yanyan, and Hu, Pei
- Subjects
ENGINEERING design ,EVOLUTIONARY algorithms ,ALGORITHMS ,PROBLEM solving - Abstract
There are a lot of multi-objective optimization problems (MOPs) in the real world, and many multi-objective evolutionary algorithms (MOEAs) have been presented to solve MOPs. However, obtaining non-dominated solutions that trade off convergence and diversity remains a major challenge for a MOEA. To solve this problem, this paper designs an efficient multi-objective sine cosine algorithm based on a competitive mechanism (CMOSCA). In the CMOSCA, the ranking relies on non-dominated sorting, and the crowding distance rank is utilized to choose the outstanding agents, which are employed to guide the evolution of the SCA. Furthermore, a competitive mechanism stemming from the shift-based density estimation approach is adopted to devise a new position updating operator for creating offspring agents. In each competition, two agents are randomly selected from the outstanding agents, and the winner of the competition is integrated into the position update scheme of the SCA. The performance of our proposed CMOSCA was first verified on three benchmark suites (i.e., DTLZ, WFG, and ZDT) with diversity characteristics and compared with several MOEAs. The experimental results indicated that the CMOSCA can obtain a Pareto-optimal front with better convergence and diversity. Finally, the CMOSCA was applied to deal with several engineering design problems taken from the literature, and the statistical results demonstrated that the CMOSCA is an efficient and effective approach for engineering design problems. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
286. Image stitching based on human visual system and SIFT algorithm.
- Author
-
Zhang, Jindong and Xiu, Ying
- Subjects
DYNAMIC programming ,ALGORITHMS ,PROBLEM solving ,IMAGE fusion ,HUMAN beings ,HUMAN fingerprints - Abstract
The image stitching process often produces many undesirable effects. Solving problems such as discontinuity and dislocation of pictures has always been the focus of people's research. From the perspective of human vision, this dislocation situation can be easily perceived and found. In this paper, we propose a stitching strategy based on the human visual system (HVS) and scale-invariant feature transform (SIFT) algorithm. We preprocess the brightness difference and contrast of the stitched images, combining SIFT algorithm and HVS to divide the overlapping areas of the stitched images and establish an attribute relationship model. We use dynamic programming to find the optimal seamline according to the attribute relationship model, and the final result makes the optimal seamline almost invisible under the discriminative vision of human eyes. The experimental results show that our method has more advantages in the HVS. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
287. A PATH-BASED APPROACH TO CONSTRAINED SPARSE OPTIMIZATION.
- Author
-
Hallak, Nadav
- Subjects
CONCAVE functions ,DIFFERENTIABLE functions ,PROBLEM solving ,CONSTRAINED optimization ,ALGORITHMS - Abstract
This paper proposes a path-based approach for the minimization of a continuously differentiable function over sparse symmetric sets, which is a hard problem that exhibits a restrictiveness-hierarchy of necessary optimality conditions. To achieve the more restrictive conditions in the hierarchy, state-of-the-art algorithms require a support optimization oracle that must exactly solve the problem in smaller dimensions. The path-based approach developed in this study produces a path-based optimality condition, which is placed well in the restrictiveness-hierarchy, and a method to achieve it that does not require a support optimization oracle and, moreover, is projection-free. In the development process, new results are derived for the regularized linear minimization problem over sparse symmetric sets, which give additional means to identify optimal solutions for convex and concave objective functions. We complement our results with numerical examples. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
288. HYBRID ALGORITHMS FOR FINDING A D-STATIONARY POINT OF A CLASS OF STRUCTURED NONSMOOTH DC MINIMIZATION.
- Author
-
ZHE SUN and LEI WU
- Subjects
SMOOTHNESS of functions ,ALGORITHMS ,PROBLEM solving ,NONSMOOTH optimization ,CONVEX functions - Abstract
In this paper, we consider a class of structured nonsmooth difference-of-convex (DC) minimization in which the first convex component is the sum of a smooth and a nonsmooth function, while the second convex component is the supremum of finitely many convex smooth functions. The existing methods for this problem usually have weak convergence guarantees or need to solve lots of subproblems per iteration. Due to this, we propose hybrid algorithms for solving this problem in which we first compute approximate critical points and then check whether these points are approximate D-stationary points. Under suitable conditions, we prove that there exists a subsequence of iterates of which every accumulation point is a D-stationary point. Some preliminary numerical experiments are conducted to demonstrate the efficiency of the proposed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
289. An Active Equalization Method of Battery Pack Based on Event-Triggered Consensus Algorithm.
- Author
-
Yu, Longjie, Zhang, Yao, Huang, Na, and Zhang, Fan
- Subjects
ALGORITHMS ,MULTIAGENT systems ,HARDWARE-in-the-loop simulation ,THEMATIC mapper satellite ,PROBLEM solving ,TYPHOONS ,ELECTRIC vehicle charging stations ,LITHIUM-ion batteries - Abstract
In this paper, a control strategy of a cell-based multi-agent system is proposed to solve the problem of inconsistency of series lithium-ion battery packs. The bidirectional Cuk converter is utilized as an equalizing circuit serving for balancing adjacent cells in a pack. A SOC-based consensus control with a time-triggered mechanism (TTM) is proposed. In order to reduce the actuator updates, the control method is ameliorated by altering TTM to an event-triggered mechanism (ETM). Adjustable balancing currents are designed in both TTM and ETM methods for the acceleration of the equalization process. The cases in dynamic environments under externally imposed charging/discharging currents by adopting TTM and ETM methods are investigated in detail. By comparison, the simulations and hardware-in-the-loop (HIL) experiments with a Typhoon real-time simulator are illustrated to show that, both in standby or external charging/discharging conditions, the proposed ETM algorithms are superior to TTM's in terms of equalization time and adaptability to the external environment. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
290. Improved strategies of the Equality Set Projection (ESP) algorithm for computing polytope projection.
- Author
-
Pei, Binbin, Xu, Wenfeng, and Li, Yinghui
- Subjects
ORTHOGRAPHIC projection ,LINEAR programming ,PROBLEM solving ,POLYTOPES ,ALGORITHMS - Abstract
This paper proposes an optimization method for the Equality Set Projection algorithm to compute the orthogonal projection of polytopes. However, its computational burden significantly increases for the case of dual degeneracy, which limits the application of the algorithm. Two improvements have been proposed to solve this problem for the Equality Set Projection algorithm: first, a new criterion that does not require a discussion of the uniqueness of the solution in linear programming, which simplifies the algorithm process and reduces the computational cost; and second, an improved method that abandons the calculation of a ridge's equality set to reduce the computational burden in the case of high-dimensional dual degeneracy. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
291. Design of Interactive Vocal Guidance and Artistic Psychological Intervention System Based on Emotion Recognition.
- Author
-
Mo, Wenwen and Yuan, Yuan
- Subjects
COMPUTER software ,STATISTICS ,PROBLEM solving ,MACHINE learning ,FACE perception ,BIOFEEDBACK training ,MUSIC therapy ,DATABASE management ,PEARSON correlation (Statistics) ,SIGNAL processing ,ART therapy ,COMMUNICATION ,QUESTIONNAIRES ,EMOTIONS ,MUSIC ,RECEIVER operating characteristic curves ,DATA analysis software ,PSYCHOTHERAPY ,ALGORITHMS ,VIDEO recording - Abstract
The research on artistic psychological intervention to judge emotional fluctuations by extracting emotional features from interactive vocal signals has become a research topic with great potential for development. Based on the interactive vocal music instruction theory of emotion recognition, this paper studies the design of artistic psychological intervention system. This paper uses the vocal music emotion recognition algorithm to first train the interactive recognition network, in which the input is a row vector composed of different vocal music characteristics, and finally recognizes the vocal music of different emotional categories, which solves the problem of low data coupling in the artistic psychological intervention system. Among them, the vocal music emotion recognition experiment based on the interactive recognition network is mainly carried out from six aspects: the number of iterative training, the vocal music instruction rate, the number of emotion recognition signal nodes in the artistic psychological intervention layer, the number of sample sets, different feature combinations, and the number of emotion types. The input data of the system is a training class learning video, and actions and expressions need to be recognized before scoring. In the simulation process, before the completion of the sample indicators is unbalanced, the R language statistical analysis tool is used to balance the existing unbalanced data based on the artificial data synthesis method, and 279 uniformly classified samples are obtained. The 279 ∗ 7 dataset was used for statistical identification of the participants. The experimental results show that under the guidance of four different interactive vocal music, the vocal emotion recognition rate is between 65.85%-91.00%, which promotes the intervention of music therapy on artistic psychological intervention. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
292. Application of SVM and its Improved Model in Image Segmentation.
- Author
-
Yang, Aimin, Bai, Yunjie, Liu, Huixiang, Jin, Kangkang, Xue, Tao, and Ma, Weining
- Subjects
IMAGE segmentation ,COLOR image processing ,PROBLEM solving ,ALGORITHMS - Abstract
In the research and application of images, people are often only interested in the foreground or specific area of the image, so it is necessary to extract the specific area from the image, and image segmentation technology is the key to solving this problem. Aiming at the complex background and the color image with unclear target contour as the target image to be segmented, this paper first uses the texture and color of the image as the feature vector, and proposes an image segmentation algorithm based on SVM. The experimental results show that the segmentation accuracy is 91.23%. Secondly, in order to improve the accuracy of segmentation, the SVM algorithm is improved. The improved SVM algorithm is based on the grid search method to optimize the parameters C and g in the SVM. At the same time, the HIS color channel is added to the feature vector to obtain more Excellent SVM image segmentation model. Finally, the color image segmentation is verified and compared with the standard SVM algorithm. The experimental results show that the accuracy rate of the improved SVM algorithm reaches 97.263%, which improves the segmentation efficiency. It is verified that the improved model proposed in this paper can effectively segment complex color images. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
293. MFNet algorithm based on indoor scene segmentation.
- Author
-
Cao, Rui, Jiang, Feng, Wu, Zhao, and Ren, Jia
- Subjects
COMPUTER performance ,FEATURE extraction ,IMAGE processing ,DEEP learning ,ALGORITHMS ,PROBLEM solving - Abstract
With the advancement of computer performance, deep learning is playing a vital role on hardware platforms. Indoor scene segmentation is a challenging deep learning task because indoor objects tend to obscure each other, and the dense layout increases the difficulty of segmentation. Still, current networks pursue accuracy improvement, sacrifice speed, and augment memory resource usage. To solve this problem, achieve a compromise between accuracy, speed, and model size. This paper proposes Multichannel Fusion Network (MFNet) for indoor scene segmentation, which mainly consists of Dense Residual Module(DRM) and Multi-scale Feature Extraction Module(MFEM). MFEM uses depthwise separable convolution to cut the number of parameters, matches different sizes of convolution kernels and dilation rates to achieve optimal receptive field; DRM fuses feature maps at several levels of resolution to optimize segmentation details. Experimental results on the NYU V2 dataset show that the proposed method achieves very competitive results compared with other advanced algorithms, with a segmentation speed of 38.47 fps, nearly twice that of Deeplab v3+, but only 1/5 of the number of parameters of Deeplab v3 +. Its segmentation results were close to those of advanced segmentation networks, making it beneficial for the real-time processing of images. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
294. A spacecraft attitude manoeuvre planning algorithm based on improved policy gradient reinforcement learning.
- Author
-
Hua, Bing, Sun, Shenggang, Wu, Yunhua, and Chen, Zhiming
- Subjects
ARTIFICIAL satellite attitude control systems ,SPACE vehicles ,ALGORITHMS ,PROBLEM solving - Abstract
To solve the problem of spacecraft attitude manoeuvre planning under dynamic multiple mandatory pointing constraints and prohibited pointing constraints, a systematic attitude manoeuvre planning approach is proposed that is based on improved policy gradient reinforcement learning. This paper presents a succinct model of dynamic multiple constraints that is similar to a real situation faced by an in-orbit spacecraft. By introducing return baseline and adaptive policy exploration methods, the proposed method overcomes issues such as large variances and slow convergence rates. Concurrently, the required computation time of the proposed method is markedly reduced. Using the proposed method, the near optimal path of the attitude manoeuvre can be determined, making the method suitable for the control of micro spacecraft. Simulation results demonstrate that the planning results fully satisfy all constraints, including six prohibited pointing constraints and two mandatory pointing constraints. The spacecraft also maintains high orientation accuracy to the Earth and Sun during all attitude manoeuvres. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
295. A Fusion Algorithm of Object Detection and Tracking for Unmanned Surface Vehicles.
- Author
-
Zhou, Zhiguo, Hu, Xinxin, Li, Zeming, Jing, Zhao, and Qu, Chong
- Subjects
OBJECT recognition (Computer vision) ,AUTONOMOUS vehicles ,TRACKING algorithms ,REMOTELY piloted vehicles ,ALGORITHMS ,PROBLEM solving - Abstract
To provide reliable input for obstacle avoidance and decision-making, unmanned surface vehicles (USV) need to have the function of sensing the position of other USV targets in the process of cooperation and confrontation. Due to the small size of the target and the interference of the water and sky background, the current algorithms are prone to missed detection and drift problems when detecting and tracking USV. Therefore, in this paper, we propose a fusion algorithm of detection and tracking for USV targets. To solve the problem of vague features in the single-frame image, high-resolution and deep semantic information are obtained through a cross-stage partial network, and the anchor and convolution structure in the network has been improved given the characteristics of USV; besides, to meet the real-time requirements, the detected target is quickly tracked through correlation filtering, and the correlation characteristics of multi-frame images are obtained; then, the correlation characteristics are used to significantly reduce missed detection, and the tracking drift problems are corrected, combined with high-resolution semantic features of a single frame. Finally, the fusion algorithm is designed. In this paper, we constructed a picture dataset and a video dataset to test the effect of detection, tracking, and fusion algorithm separately, which proves the superiority of the fusion algorithm in this paper. The results show that, compared with a single detection algorithm and tracking algorithm, the fusion one can increase the success rate by more than 10%. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
296. An Active Disturbance Rejection Control of Large Wind Turbine Pitch Angle Based on Extremum-Seeking Algorithm.
- Author
-
Zou, Yarong, Tan, Wen, Jin, Xingkang, and Wang, Zijian
- Subjects
WIND turbines ,ANGLES ,TURBINE generators ,ALGORITHMS ,TRANSFER functions ,PROBLEM solving - Abstract
This paper proposes the analysis and design of the linear active disturbance rejection controller (LADRC) for the pitch angle model of a large wind turbine generator (WTG). Since the transfer function of the pitch control system exhibits nonminimum-phase characteristics, the parameters of LADRC are difficult to tune using the conventional bandwidth method. On the basis of PI controller parameters to first-order LADRC parameters, an optimization problem is proposed in this paper to find the parameters of an LADRC for the pitch control system under the constraint of robustness measure, and the extremum-seeking (ES) algorithm is used to solve the problem. Simulation results show that LADRC can achieve better tracking and disturbance rejection performance than traditional PI control without loss of robustness against time delay. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
297. Industrial equipment detection algorithm under complex working conditions based on ROMS R-CNN.
- Author
-
Wu, Junpeng, Tang, Shaobo, Li, Xianglei, and Zhou, Yibo
- Subjects
DEEP learning ,K-means clustering ,INDUSTRIAL equipment ,ALGORITHMS ,PROBLEM solving ,ROTATIONAL motion - Abstract
In the paper, we proposed a deep learning-based industrial equipment detection algorithm ROMS R-CNN (Rotation Occlusion Multi-Scale Region-CNN). It can solve the problem of inaccurate detection of industrial equipment under complex working conditions such as multi-scale ratio, rotation tilt, occlusion and overlap. The method proposed in this paper first is to construct the MobileNetV2 as the feature pyramid network, and then to combine high semantic information with high resolution information solved industrial equipment detection of different scales. Secondly, a specific rotation anchor scheme is proposed, and the data set is clustered through the k-means algorithm to obtain a specific aspect ratio. Combined with the rotation angle, a rotation anchor of any direction and size is generated to solve the problem of easy tilting of industrial equipment. Finally, a Non-Maximum Suppression algorithm with penalty factors is introduced to solve the overlapping in industrial equipment detection. The experimental results in common industrial equipment detection show that this method is better than other algorithms, significantly improves the missed detection and false detection, and the mAP reaches 0.939. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
298. Deep-Learning Based Algorithm for Detecting Targets in Infrared Images.
- Author
-
Yang, Lifeng, Liu, Shengzong, and Zhao, Yiqi
- Subjects
INFRARED imaging ,DEEP learning ,COMPUTER vision ,ALGORITHMS ,PROBLEM solving - Abstract
Infrared image target detection technology has been one of the essential research topics in computer vision, which has promoted the development of automatic driving, infrared guidance, infrared surveillance, and other fields. However, traditional target detection algorithms for infrared images have difficulty adapting to the target's multiscale characteristics. In addition, the accuracy of the detection algorithm is significantly reduced when the target is occluded. The corresponding solutions are proposed in this paper to solve these two problems. The final experiments show that this paper's infrared image target detection model improves significantly. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
299. Novel randomization and iterative based algorithms for the transactions assignment in blockchain problem.
- Author
-
Bajahzar, Abdullah
- Subjects
ALGORITHMS ,POLYNOMIAL time algorithms ,NP-hard problems ,ASSIGNMENT problems (Programming) ,BLOCKCHAINS ,PROBLEM solving ,BIG data - Abstract
This study focuses on the load balancing of the transactions in the blockchain. The problem is how to assign these transactions to the blocks. The objective is to guarantee a load balancing of the workload in the time of blocks. The proposed problem is an NP-hard one. To face the hardness of the studied problem, the challenge is to develop algorithms that solve the problem approximately. Finding an approximate solution is a real challenge. In this paper, nine algorithms are proposed. These algorithms are based on the dispatching-rules method, randomization approach, clustering algorithms, and iterative method. The proposed algorithms return approximate solutions in a remarkable time. In addition, in this paper, a novel architecture composed of blocks is proposed. This architecture adds the component "Balancer". This component is responsible to call the best-proposed algorithm and solve the scheduling problem in a polynomial time. In addition, the proposed work helps users to solve the problem of big data concurrency. These algorithms are coded and compared. The performance of these algorithms is tested over three classes of instances. These classes are generated based on uniform distribution. The total number of instances tested is 1350. The average gap, execution time, and the percentage of the best-reached value are used as metrics to measure the performance of the proposed algorithms. Experimental results show the performance of these algorithms and a comparison between them is discussed. The experimental results show that the best algorithm is best-mi-transactions iterative multi-choice with 93.9% in an average running time of 0.003 s. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
300. 基于人像检测的实时图像智能裁剪.
- Author
-
吴宇航, 林珊玲, 林志贤, and 郭太良
- Subjects
IMAGE enhancement (Imaging systems) ,DATA integrity ,COMPUTER vision ,PROBLEM solving ,ALGORITHMS ,INTELLIGENT transportation systems ,PETRI nets - Abstract
Copyright of Chinese Journal of Liquid Crystal & Displays is the property of Chinese Journal of Liquid Crystal & Displays and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
- Published
- 2023
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.