Synthesis of Control Algorithm for Position of Six–Axis Manipulator by Maxym Vihuro, Andriy Malyar

“…This algorithm was implemented in the Matlab environment. …”
Get full text

Low complexity uplink multiuser MIMO detecting algorithm by HEI Yong-qiang1, LI Xiao-hui1, YI Ke-chu1, YANG Hong2

“…Aiming at the uplink multiuser MIMO system,a new space-time detecting algorithm was proposed,in which a linear recombination strategy was imposed on the received signal first,and then the matched filter vectors orthogonal to each users’ interference sets were used to eliminate the interference among users.Finally the signal of each user was line-arly space-time decoded by means of the orthogonal equivalent channel.The design of the algorithm under imperfect channel scenario was also provided.Theory analysis and simulation results reveal that the proposed algorithm has the advantages of low complexity and good robustness,and is superior to other detecting algorithms.…”
Get full text

ELECTRICITY QUALITY INDICATION IMPROVING ALGORITHM IN INDUSTRIAL ENTERPRISES by R. K. Gereykhanov

Subjects: Get full text

Efficient heuristic algorithm for the mobile sink routing problem by YUAN yuan1, PENG Yu-xing1, LI Shan-shan2, TANG Wen-sheng3

“…In large-scale monitoring region,randomly deployed wireless sensor networks may not be fully connected with high probability.Using mobile sink for data collection is one of the feasible solutions.Mobile sink shortest routing prob-lem can be regarded as a special case of TSP with neighborhoods（TSPN） problem,since the neighborhoods are the radio ranges of the sensor nodes,which can be modeled as possibly overlapped disks with diverse sizes.This kind of TSPN problem has no polynomial algorithms so far.To handle it,a novel approximation algorithm was proposed,which first forms a "racetrack" by utilizing the non-intersecting loop property of TSP routes,and then through the inner lane heuris-tic,the bend heuristic and the shortcut searching,the algorithm can find an approximation solution within O（n2） computa-tion time.The formal proofs and the large-scale simulations all verify that our algorithm can achieve a good approxima-tion ratio and can be more efficient than the related algorithms.…”
Get full text

Genetic Algorithm Application for Synthesis and Analysis of Electromechanical Systems by Bohdan Kopchak, Lidiya Kasha

Subjects: Get full text

Provident garbage collection algorithm for SSD storage system by Xuezhen TU, Zhenjiang Huang, Zhengguang CHEN

“…A predictive based proactive garbage collection algorithm was proposed.Firstly,the data was separated according to different heat factors,then the upper and lower predictions were performed on the number of different types of page allocation requests (PAR) that would be reached in the future.While satisfying the page allocation request lower prediction,the PAR upper prediction requirement was maximally satisfied,the WA problem was optimized,and invalid effective data migration was reduced,thereby maximizing the garbage collection utility.A mathematical model was defined for this problem,and an algorithm for obtaining the approximate optimal solution was given.The applicable scenario of the model was analyzed.The practical results show that the algorithm can obtain the maximum benefit and can significantly improve the performance of SSD and reduce the cost.…”
Get full text

A multistrategy improved hunger games search algorithm by Qiu Yihui, Zhang Xinqiang, Li Ruoyu, Li Dongyi, Xia Feihan

Subjects: Get full text

Survey on vertical federated learning: algorithm, privacy and security by Jinyin CHEN, Rongchang LI, Guohan HUANG, Tao LIU, Haibin ZHENG, Yao CHENG

Get full text

SWARM ALGORITHM OF SYNTHESIS TUTORIALS BASED ON ONTOLOGICAL APPROACH by Boris K. Lebedev, Oleg B. Lebedev

Subjects: “…the synthesis of textbooks. swarm algorithm…”
Get full text

CMA-PSO Algorithm for Fuzzy Cloud Resource Scheduling by LI Cheng-yan, SONG Yue, MA Jin-tao

Subjects: Get full text

Efficient Genetic Algorithms for Arabic Handwritten Characters Recognition by Laheeb Ibrahim

Subjects: Get full text

Illustration Design Model with Clustering Optimization Genetic Algorithm by Jing Liu, Qixing Chen, Xiaoying Tian

“…This paper proposes an illustration art design model based on operator and clustering optimization genetic algorithm. First, during the operation of the genetic algorithm, the values of the crossover probability and the mutation probability are dynamically adjusted according to the characteristics of the population to improve the search efficiency of the algorithm, then the k-medoids algorithm is introduced to optimize the clustering of the genetic algorithm, and a cost function is used to carry out and evaluate the quality of clustering to optimize the complexity of the original algorithm. …”
Get full text

Application of Genetic Algorithm to Hexagon-Based Motion Estimation by Chih-Ming Kung, Wan-Shu Cheng, Jyh-Horng Jeng

“…The character would help the proposed scheme to search the mean square error closer to the algorithm of full search than those fast algorithms. …”
Get full text

New Insights into Fuzzy Genetic Algorithms for Optimization Problems by Oleksandr Syzonov, Stefania Tomasiello, Nicola Capuano

“…Algorithms…”
Get full text

Android malware detection using random forest algorithm by Samson Isaac, Abdullahi Tanimu, Mohammed Shamsuddeen Tukur, Jacob Isaac, Amina Bala Ja'afaru

“…Specifically, the research investigates the performance of various ML algorithms, with a focus on Random Forest, in detecting malware on the android platform. …”
Get full text

K-Medoid Algorithm in Clustering Student Scholarship Applicants by Sofi Defiyanti, Mohamad Jajuli, Nurul Rohmawati

“…Grouping into 3 groups is useful to make it easier to determine the scholarship recipients fuel. K-Medoids algorithm is an algorithm of clustering techniques based partitions. …”
Get full text

A Recommendation Algorithm Based on Restricted Boltzmann Machine by WANG Weibing, ZHANG Lichao, XU Qian

Subjects: “…recommendation algorithm…”
Get full text

Minimum energy broadcasting algorithm in wireless sensor networks by TANG Yong, ZHOU Ming-tian

“…In order to adjust the transmission power of nodes for minimizing total energy consumption in wireless sensor networks,a new distributed algorithm called ERBOP（enhanced relative neighborhood graph broadcast oriented protocol） was proposed which was an improvement upon RBOP（relative neighborhood graph broadcast oriented protocol） pre-sented by Cartigny et al.In ERBOP,a sub-graph of relative neighborhood graph,which was a sparse connected graph and contains minimum spanning tree,was locally constructed by eliminating long edges.Moreover,1-dominating connected dominating set was constructed basing on the sub-graph,and only the dominating nodes participated in the broadcasting.The simulation results show that ERBOP conserves energy efficiently.…”
Get full text

Fractal Art Pattern Generation Based on Genetic Algorithm by Huabai Liu

“…In order to solve the problem in the application and optimization method of fractal art pattern generation, on the basis of the integration of the fractal theory and genetic algorithm, a generation method based on genetic algorithm and composition generation was proposed. …”
Get full text

The functional voxel algorithm for iterative composition of complex contours by A. A. Sycheva, A. M. Plaksin

Get full text