A Novel Scheme for Improving Accuracy of KNN Classification Algorithm Based on the New Weighting Technique and Stepwise Feature Selection by Saeid Sheikhi, Mohammad Taghi Kheirabadi, Amin Bazzazi

“…This weighting approach gives a higher preference to samples that have neighbors with close Euclidean distance while they are in the same category, which can effectively increase the classification accuracy of the algorithm. …”
Get full text

Packing Unequal Circles into a Minimum-Radius Circle Using r-Algorithm by Bohdan Zadorozhnyi, Tetyana Romanova, Petro Stetsyuk, Stanislav Tyvodar, Sergiy Shekhovtsov

“…It is shown that increasing the bit depth leads to decreasing the number of the r-algorithm iterations while increasing the accuracy of the objective function value. …”
Get full text

Mining privacy-preserving association rules using transaction hewer allocator and facile hash algorithm in multi-cloud environments by D. Dhinakaran, S. Gopalakrishnan, D. Selvaraj, M.S. Girija, G. Prabaharan

“…The difficulty is to secure sensitive data while delivering the insights of the data. First, this paper proposes a new multi-cloud approach to preserve privacy, which includes two main components, named the Transaction Hewer and Allocator module and the Facile Hash Algorithm (FHA), in extracting the frequent itemset. …”
Get full text

Fast forward modeling and response analysis of extra-deep azimuthal resistivity measurements in complex model by Pan Zhang, Shaogui Deng, Xiyong Yuan, Fen Liu, Weibiao Xie

“…By leveraging the symmetry of simulated signals in the spectral domain, the algorithm reduces computation time by 50%, significantly enhancing computational efficiency while preserving accuracy. …”
Get full text

Investigation, Optimization of Energy Consumption and Yield Modeling of Two Paddy Cultivars with Genetic-Artificial Bee Colony Algorithm by S. Sharifi, N. Hafezi, M. H. Aghkhani

“…An artificial bee colony (ABC) algorithm with a novel and straightforward elitism structure was utilized to enhance the fitness function of the genetic algorithm (GA). …”
Get full text

Algorithms of the Method of Statically Admissible Discontinuous Stress Fields (SADSF) – Part II: The Algorithms for Solving Limit Stress Fields Around Isolated Nodes of Stress Disc... by W. Bodaszewski

“…The algorithms are the first ones of general character, as they apply to the fundamental problems of the method. …”
Get full text

An Improved Global and Local Fusion Path-Planning Algorithm for Mobile Robots by Yongliang Shi, Shucheng Huang, Mingxing Li

“…Finally, we fuse those global and local path-planning improvements to form our fusion path-planning algorithm, which can enhance the robot’s adaptability to complex scenarios while reducing path redundancy and turning points. …”
Get full text

Research on label propagation algorithm based on modularity maximization in the social network by Jing CHEN, Yun WAN

“…A kind of community detection method based on the combination of modularity and community structure attributes was proposed.Firstly,updating the whole network after communities merging every time could result in the high time complexity,therefore,introducing propagation distance parameter and “merger going after label propagation” was utilized to reduce time complexity.Secondly,CDMM-LPA algorithm was proposed by combing label propagation with community structure.Finally,empirical analysis on data networks verified the validity of the approaches.The experimental results show that the CDMM-LPA algorithm has a high modularity value and a more stable community structure while reducing the time complexity.…”
Get full text

Evaluation of different in silico tools for the assessment of deleterious variants in acute myeloid leukemia by Wardah Qureshi, Muhammad Irfan, Ishtiaq Ahmad Khan, Muhammad Shakeel

“…The widely accepted practice of using in silico pathogenicity predictions as evidence when interpreting genetic variants is an integral part of standard variant classification guidelines. Several algorithms have been developed and evaluated to predict deleterious variants. …”
Get full text

Optimized Negative Selection Algorithm for Image Classification in Multimodal Biometric System by Monsurat Omolara Balogun, Latifat Adeola Odeniyi, Elijah Olusola Omidiora, Stephen Olatunde Olabiyisi, Adeleye Samuel Falohun

“…The Negative Selection Algorithm (NSA) is one of the major algorithms of the Artificial Immune System, inspired by the operation of the mammalian immune system for solving classification problems. …”
Get full text

Packet-loss robust scalable authentication algorithm for compressed image streaming by Xiao-wei YI, Heng-tai MA, Gang ZHENG, Chang-wen ZHENG

“…Finally, these hash values of decoding-independent packets and the digital signature of the whole bitstream are encoded with an error-correction coding algorithm. …”
Get full text

New Algorithm of Joining a Set of Segments into a Simple Polygon by JIN Hui, LIU Run-tao

“…For the problem of how to link a set of segments to a simple polygon with the shortest whole length, a sufficient condition that a given set of segments can be joined into a simple polygon is given.It is proved that the nearest point or second nearest point of the end point can be obtained in Delaunay triangulation for the end points of a set of segments S.Based on this result, the method of joining a segment into a polygon is given for getting the polygon with the shortest length.Then, a new algorithm for joining a set of segments into a simple polygon with shorter whole length is presented.The analysis is done on the time complexity for new algorithm.The correctness of new algorithm is proved.The comparison and analysis are done for the new algorithm to show that better result can be obtained with the new algorithm.…”
Get full text

A Novel UCAN Power Control Algorithm Based on the Stackelberg Game by Huaping Chen, Zhiyu Wang, Zhongyang He, Guoqiang Li

“…Secondly, in the process of multiple games between the price adopted by the primary user and the transmit power set by the secondary user, the transmit power and unit power price of the secondary user are dynamically adjusted, and the two finally reach a Nash equilibrium state, so as to maximize the revenue of the whole network. Finally, The results of Aqua-Sim simulation platform show that the system capacity of the proposed algorithm is 27.9% higher than that of the traditional power control algorithm, at the same time, the algorithm improves the communication quality of the network while effectively controlling the transmit power of the subusers to reduce the interference between nodes.…”
Get full text

Image Similarity Quantum Algorithm and Its Application in Image Retrieval Systems by Qingchuan Yang, Xianing Feng, Lianfu Wei

“…It is found that the AE-QIP algorithm achieves comparable precision to the ST-QIP algorithm while exhibiting significant reductions in qubit consumption and average processing time. …”
Get full text

Prediction Model of Late Fetal Growth Restriction with Machine Learning Algorithms by Seon Ui Lee, Sae Kyung Choi, Yun Sung Jo, Jeong Ha Wie, Jae Eun Shin, Yeon Hee Kim, Kicheol Kil, Hyun Sun Ko

“…In the prediction model for the whole cohort, the area under the curve (AUC) was 0.73 at E1 and 0.78 at T1 and the area under the precision-recall curve (AUPR) was 0.23 at E1 and 0.31 at T1 in the training set, while an AUC of 0.62 at E1 and 0.73 at T1 and an AUPR if 0.13 at E1, and 0.24 at T1 were obtained in the test set. …”
Get full text

An optimal energy-efficient resource allocation algorithm in ultra-dense network by Yueyue ZHANG, Weiwei XIA, Yaping ZHU, Feng YAN, Xuzhou ZUO, Lianfeng SHEN

“…The energy-efficient resource allocation problem was taken in an ultra-dense network(UDN) consisted of multiple femtocells.Aiming at maximizing the energy efficiency (EE) of the whole network,quality of service (QoS) constraint and interference limitation was considered.Then,the established nonconvex and nonlinear problem was relaxed relying on Cauchy inequality,and was developed into a non-cooperative game.Additionally,a distributed EE maximization algorithm was proposed satisfying the max-min fairness (MMF) criterion.Simulation results show that the proposed algorithm outperformances the existing algorithms in terms of the EE and the throughput.…”
Get full text

Guided evolutionary game algorithm of unstructured P2P network by Guohui ZHU, Chunlan LU, Rui ZHANG

“…In order to promote the cooperation among the nodes which exist in dynamic and open peer-to-peer network,G-SLACER algorithm was provided by introducing pacesetter nodes.30% of network nodes were initialized to pacesetter nodes.In the process of topology reconstruction,a guided link to the most advantage node was added.To encourage studies between nodes,the payoff of the whole network was increased.The experimental results show that the G-SLACER algorithm has good generality for different sizes of networks,and it enhances the stability of CCP.Compared with other evolutionary game algorithms,cooperation state of P2P network formed by G-SLACER algorithm appears earlier and more stable.…”
Get full text

Data Fusion Algorithm of Privacy Protection Based on Qos and Multilayers Hierarchically by Li Li, Qin Qin, Li Hua, Li Jian

“…Meanwhile, it would guarantee the accuracy of the data and reduce the probability of the whole network information exposed.…”
Get full text

Distributed energy efficient unequal clustering algorithm for wireless sensor networks by SHANG Feng-jun1, Mehran Abolhasan2, Tadeusz Wysocki3

“…A distributed energy-efficient unequal clustering （DEEUC） algorithm was proposed for wireless sensor net-works by research current routing algorithms. …”
Get full text

Novel virtual topology configuration algorithm for IP over WDM network by LE Zi-chun, FU Ming-lei

“…The load balancing for the whole network was chosen as the optimal objective and a novel virtual topology configuration algorithm was proposed.In the proposed algorithm,the load distribution variance was chosen as a key criterion for judging the load balancing.And the definition and the computing method of the load distribution variance were introduced.In addition,the blocking probability was chosen as the main performance parameter for comparing with other algorithms.In the optical layer,the algorithm proposed was compared with the routing with load balancing heuristics（RLBH） algorithm.Similarly,in IP layer,the algorithm was compared with the fixed-path least-congestion（FPLC） algorithm.Moreover,the numerical results of the algorithm comparison were shown and discussed.The simulation results show that the performance of the algorithm is better than RLBH algorithm and FPLC algorithm on the blocking probability.…”
Get full text