Retracted: A Risk Assessment Algorithm for College Student Entrepreneurship Based on Big Data Analysis by null Complexity

Get full text

Optimization and research on RFID anti-collision algorithm based on adaptive multi-dimension division code by Zhi-jin LI, Jie ZHOU, IAO-Jie Q, Wen-juan WU

“…Under the circumstance of many tags and many collisions,when multi-dimension division code algorithm is applied,the average number of times the reader calls each tag C(n) approximated to a limit 4/3,and the data conveyed by calling each tag tends to be a relatively small constant.However,under the circumstance of few collisions,the average number of times the reader calls each tag and the average data conveyed were relatively large.The adaptive multi-dimension division code algorithm,and the optimization of adaptive multi-dimension division code algorithm were proposed.The adaptive multi-dimension division code algorithm could adaptively decrease the MDDC dimensions according to the numbers of tags,and encode the tags again,hence greatly decrease the average number of times the reader calls each tag even under the circumstance of few tags.Therefore,in RFID system,adaptive multi-dimension division code algorithm can significantly improve the efficiency of searching for tags no matter in many collisions or in few collisions.…”
Get full text

Signal Timing Optimization for Corridors with Multiple Highway-Rail Grade Crossings Using Genetic Algorithm by Yifeng Chen, Laurence R. Rilett

“…The primary goal is to maximize safety, and the secondary goal is to minimize delay. A Genetic Algorithm (GA) was used as the optimization approach in the proposed methodology. …”
Get full text

YOLO-STOD: an industrial conveyor belt tear detection model based on Yolov5 algorithm by Wei Liu, Qing Tao, Nini Wang, Wendong Xiao, Cen Pan

Subjects: Get full text

Research on timing method for single intersection in transportation Internet of things based on improved Webster algorithm by Lin MA, Fuyang CHEN, Bin JIANG

“…Aiming at the timing signal problem of single intersection,a timing method based on the improved Webster algorithm in transportation Internet of things was proposed by combining the micro level analysis method with the macro level analysis method.In order to optimize the saturation and signal control delay,the average delay model was established.The game model and the conflict model were established with non-signal control and signal control.And the conflict analysis was carried out to illustrate that the optimal signal timing could coordinate the conflicting traffic flow.Based on the improved Webster algorithm,the shortest time required for the motor vehicle to pass the single intersection was additionally considered and a three-step optimization method for timing method at single intersection was proposed to reduce the traffic delay to ensure that the vehicle could pass effectively.The simulation results illustrate the effectiveness of the proposed solution.…”
Get full text

On the Location of Multiple Failure Slip Surfaces in Slope Stability Problems Using the Meshless SPH Algorithm by Liang Li, Ming Zhai, Xianzhang Ling, Xuesong Chu, Bin Hu, Yungming Cheng

Get full text

LEDFD: A Low Energy Consumption Distributed Fault Detection Algorithm for Wireless Sensor Networks by Xiaolong Xu, Weijian Geng, Geng Yang, Nik Bessis, Peter Norrington

“…Experimental results show that the algorithm has good performance and low energy consumption compared with current algorithms.…”
Get full text

Chaotic image encryption algorithm based on single image local scrambling and dynamic feedback diffusion by Yeqin CUI, Guochao DING

“…A novel chaotic image encryption algorithm based on single image local scrambling and dynamic feedback diffusion was presented.Firstly,a single image local scrambling algorithm was proposed.Secondly,a novel dynamic feedback diffusion strategy was proposed to change the pixel values of the scrambled image in the phase of diffusion,by which improved the results of image encryption.Finally,the simulation results and performance analysis show that the number pixels change rate（NPCR）values and unified average changing intensity（UACI）values of the proposed algorithm can be close to 99.6% and 33.4%,showing that the proposed algorithm has better resistance to differential attacks and saves time compared with the other three classic algorithms.…”
Get full text

Multi-user shortwave data link algorithm based on multi-domain orthogonal frequency selection by LI Lin, HUANG Xuexiao, PENG Xiaoyong

“…Firstly, the algorithm segments the frequency bandwidth using multi-domain orthogonal planning based on the number of users and frequency interval, and then obtains the set of available frequency points for each user based on the disabled frequency and frequency demand. …”
Get full text

A New Time-Invariant Fuzzy Time Series Forecasting Method Based on Genetic Algorithm by Erol Eğrioğlu

“…The new method determines elements of fuzzy relation matrix based on genetic algorithms. The proposed method uses first-order fuzzy time series forecasting model, and it is applied to the several data sets. …”
Get full text

Optimal Virtual Power Plant Control Algorithm Considering the Electrical Characteristics of Distributed Energy Resources by Seokwoo Hyun, Geonho Kim, Jungsung Park, Yunhyuk Choi

“…We introduce a novel sensitivity-based control algorithm for Virtual Power Plants (VPPs) that optimizes the deployment of distributed energy resources (DERs). …”
Get full text

Research on a hexagonal lattice optimal clustering routing algorithm based on hybrid CS for WSN by Can CUI, Yi SUN, Jun LU, Jian-hong HAO

“…A hexagon lattice clustering model for WSN was proposed based on hybrid CS.The relationship between data transmission times and compression ratio and clus er size was analyzed quantitatively to get optimal clustering number.Then,a hexagon lattice optimal clustering routing algorithm for WSN based on ybrid CS was proposed,to balance network communication overhead and reduce data transmission times.Simulation experiment proved that the optimal clustering model and algorithm proposed are better than traditional ones in reducing data transmis-sion times in WSN.…”
Get full text

Retracted: Decision Tree Algorithm for Visual Art Design in a Psychotherapy System for College Students by Occupational Therapy International

Get full text

Compressive Strength Prediction of Self-Compacting Concrete-A Bat Optimization Algorithm Based ANNs by Amir Andalib, Babak Aminnejad, Alireza Lork

“…Therefore, this work takes advantage of the superior predictive performance of ANNs coupled with the bat algorithm. A database of 205 SCC samples collected from the literature is used to develop the ANN model. …”
Get full text

A new approach to error inequalities: From Euler-Maclaurin bounds to cubically convergent algorithm by Miguel Vivas-Cortez, Usama Asif, Muhammad Zakria Javed, Muhammad Uzair Awan, Yahya Almalki, Omar Mutab Alsalami

“…Afterwards, we provided a comparative study between the proposed algorithm and standard methods. We also discussed the proposed algorithm's impact on the basins of attraction.…”
Get full text

Improved Genetic Algorithm for Distribution System Performance Analysis by Taking Advantage of Essential Spanning Trees by Yanzhu Ji, Zhuoqun Shi, Robert M. O’Connell

“…One such tool, the improved Fast Nondominated Sorting Genetic Algorithm (FNSGA), not only is effective in finding system configurations that are optimal with respect to voltages, currents, and losses, but also considered parametric study to determine minimum values of N and Gen. …”
Get full text

Improved SMC cardinality-balanced multi-Bernoulli forwardbackward smoothing track-before-detect algorithm by Jiazheng PEI, Yong HUANG, Yunlong DONG, Xiaolong CHEN

“…For the tracking problem of multiple maneuvering targets in radar observation,the sequential Monte-Carlo cardinality-balanced multi-Bernoulli track-before-detect (SMC-CBMeMBer-TBD) algorithm is inaccurate in the estimation of the number of targets and the precision of state estimation.An improved algorithm based on SMC-CBMeMBer forward backward smoothing track-before-detect algorithm was proposed.In the algorithm,the multi target particle swarm optimization (MOPSO) was added between the process of prediction and update,and the fitness function was set up based on the observation value to make the particle set move to the position of the larger posterior probability density distribution,and solve the particle poverty in the heavy sampling process.In the update step,the algorithm was used.Then the smoothing recursive method was added,and the arithmetic operation time was prolonged,but the number and the state estimation precision were improved.The simulation results show that compared with the CBMeMBer-TBD method,the proposed algorithm improves the accuracy of the estimation of the number of maneuvering targets and the accuracy of the target state estimation.…”
Get full text

Relay selection algorithm based on selfish behavior analysis in ultra-dense D2D by Yijun WANG, Youxu ZHANG, Dakun LIU, Guifen CHEN

“…In ultra-dense D2D communication, the current relay selection schemes mainly assume that the relay device has the initiative to participate in data forwarding, but some rational relay devices may delay or refuse to forward due to their own considerations, thus affecting the user experience.From the perspective of selfish behavior of relay devices, a method to identify selfish relay devices in D2D communication was proposed, and then an ultra-dense D2D relay selection algorithm based on selfish behavior analysis was proposed.Firstly, three relay identification attribute factors, namely joint interest degree (JID), forwarding history ratio (FHR) and relay physical state (RPS) were defined, and their weights were calculated by triangular fuzzy function to identify relay devices with selfish behavior.Secondly, based on the TOPSIS (technique for order of preference by similarity to ideal solution) method, the final relay equipment selection scheme relay was realized.Simulation results show that the proposed algorithm can identify selfish relay devices more effectively in D2D communication.Compared with other relay selection algorithms, the proposed algorithm has made significant progress in the aspects of D2D communication forwarding success rate, system average throughput and average time delay.…”
Get full text

A Collision Avoidance Method for Intelligent Ship Based on the Improved Bacterial Foraging Optimization Algorithm by Xingzhong Wang, Xinghua Kou, Jinfeng Huang, Xianchun Tan

“…To fix the above shortcomings of BFOA, an autonomous collision avoidance algorithm based on the improved bacterial foraging optimization algorithm (IBFOA) is demonstrated in this paper. …”
Get full text

Social Cognitive Optimization Algorithm for Approximate Path Generation Synthesis of Spherical 4R Linkage by Che Linxian, Huang Yonggang, Du Li

“…Combining the self-adaptive penalty function method，this study employs the social cognitive optimization (SCO) algorithm to solve the aforementioned problem. In order to enhance the convergence speed and accuracy of SCO algorithm，a novel accelerating social cognitive optimization (ASCO) algorithm is proposed in which the differential evolution (DE) operators are used to local search. …”
Get full text