-
2001
Semi-supervised Gaussian process classification algorithm addressing the class imbalance
Published 2013-05-01“…The traditional supervised learning is difficult to deal with real-world datasets with less labeled information when the training sets class is imbalanced.Therefore,a new semi-supervised Gaussian process classification of address-ing was proposed.The semi-supervised Gaussian process was realized by calculating the posterior probability to obtain more accurate and credible labeled data,and embarking from self-training semi-supervised methods to add class label into the unlabeled data.The algorithm makes the distribution of training samples relatively balance,so the classifier can adaptively optimized to obtain better effect of classification.According to the experimental results,when the circum-stances of training set are class imbalance and much lack of label information,The algorithm improves the accuracy by obtaining effective labeled in comparison with other related works and provides a new idea for addressing the class im-balance is demonstrated.…”
Get full text
Article -
2002
Research on performance optimizations for TCM-KNN network anomaly detection algorithm
Published 2009-01-01Subjects: Get full text
Article -
2003
Research on packet convergence sublayer classification algorithm for WiMAX system
Published 2010-01-01“…The mapping relation between the higher-layer protocol data and connection was analyzed in WiMAX system.And a packet convergence sublayer classification algorithm based on non-collision hashing and address-blocking XOR look-up was proposed,thus realized the quick look-up and classification of higher-layer protocol data.The complexity and the increase renewal function of algorithm was analyzed quantitatively.The simulation results show that the classifi-cation algorithm satisfies QoS(quality of service) requests with the performances of delay and memory,moreover time-liness is also enhanced greatly.…”
Get full text
Article -
2004
Fast copy-move forgery detection algorithm based on group SIFT
Published 2020-03-01“…Aiming at the high computational complexity of the existing copy-move image forgery detection algorithm,a copy-move forgery detection algorithm based on group scale-invariant feature transform (SIFT) was proposed.Firstly,the simple linear iterative clustering (SLIC) was utilized to divide the input image into non-overlapping and irregular blocks.Secondly,the structure tensor was introduced to classify each block as flat blocks,edge blocks and corner blocks,and then the SIFT feature points extracted from the block were taken as the block features.Finally,the forgery was located by the inter-class matching of the block features.By means of inter-class matching and feature point matching,the time complexity of the proposed copy-move forgery detection algorithm in feature matching and locating forgery region was effectively reduced while guaranteeing the detection effect.The experimental results show that the accuracy of the proposed algorithm is 97.79%,the recall rate is 90.34%,and the F score is 93.59%,the detecting time for the image with size of 1024×768 is 12.72 s,and the detecting time for the image with size of 3000×2000 was 639.93 s.Compared with the existing copy-move algorithm,the proposed algorithm can locate the forgery region quickly and accurately,and has high robustness.…”
Get full text
Article -
2005
Optimal scalable redeployment algorithm of relay nodes in wireless sensor networks
Published 2012-04-01“…A relay node redeployment algorithm was proposed to find the optimal location of redeployment relay node when an existed relay node was overloaded considering the multi-dimensional localization and bandwidth constraint.The algorithm translated the redeployment problem into the optimal location planning in a multi-dimensional Euclidean space and then gave the suitable redeployment plan through searching the intersections of transmission areas heuristically.The correctness and completeness of the algorithm were proved.Furthermore,an optimization method was proposed to reduce the complexity of the algorithm to the linear function of the number of sensor nodes.The simulation results show that the algorithm can balance the loads of the overloaded relay nodes by joining in the candidate nodes and then prolong the network lifetime.…”
Get full text
Article -
2006
An Alternate Iterative Differential Evolution Algorithm for Parameter Identification of Chaotic Systems
Published 2015-01-01“…Then through integrating two differential mutation strategies, an improved greedy selection mechanism and a population diversity balance scheme, an alternate iterative differential algorithm, called AIDE, is presented to solve the problem in this paper. …”
Get full text
Article -
2007
Characterizing Grover search algorithm on large-scale superconducting quantum computers
Published 2025-01-01Subjects: Get full text
Article -
2008
Coverage optimization algorithm based on VF-CS in mobile sensor network
Published 2018-03-01“…A random placement of large-scale sensor network in the outdoor environment often causes low coverage.An area coverage optimization algorithm of mobile sensor network (MSN) based on virtual force perturbation and Cuckoo search (VF-CS) was proposed.Firstly,the virtual force of the sensor nodes within the Thiessen polygon was analyzed based on the partitioning of Voronoi diagram of the monitoring area.Secondly,the force of polygon vertices and neighbor nodes was taken as the perturbation factor for updating the node’s location of the Cuckoo search (CS).Finally,the VF-CS guided the node to move so as to achieve the optimal coverage.The simulation results demonstrate that the proposed algorithm has higher coverage and shorter average moving distance of nodes than the Voronoi diagram based algorithms in literatures.…”
Get full text
Article -
2009
Antenna Array Synthesis and Failure Correction Using Differential Search Algorithm
Published 2014-01-01“…Differential search (DS) optimization algorithm is proposed for the synthesis of three different types of linear antenna array design examples. …”
Get full text
Article -
2010
Application of Particle Swarm Optimization Algorithm in the Heating System Planning Problem
Published 2013-01-01“…The results show that the improved particle swarm optimization (IPSO) algorithm can more preferably solve the HSP problem than PSO algorithm. …”
Get full text
Article -
2011
The High Security Mechanisms Algorithm of Similarity Metrics for Wireless and Mobile Networking
Published 2017-01-01“…To solve the security mechanisms problem and improve the efficiency, this paper proposes a new algorithm. The new algorithm scans the database only one time and the scale of data to deal with is getting smaller and smaller with the algorithm running. …”
Get full text
Article -
2012
RSS-TOA based localization algorithm in non-line-of-sight environment
Published 2019-09-01“…The existence of non-line-of-sight (NLOS) error can degrade the positioning performance in wireless sensor network localization system,especially in indoor localization.To overcome the localization error caused by NLOS propagation,a localization algorithm was proposed based on received signal strength (RSS) and time-of-arrival (TOA).Firstly,a non-convex optimization problem was established based on RSS and TOA.Then,the original non-convex optimization problem was transformed into a convex optimization problem through the second-order cone relaxation technique,therefore a sub-optimal solution to the original problem could be obtained efficiently.Finally,computer simulation results show that the proposed method can provide higher estimation accuracy and better performance.…”
Get full text
Article -
2013
A Topology Control Algorithm for Sensor Networks Based on Robust Optimization
Published 2015-01-01“…Considering the uncertainty of distance between nodes, a distributed topology control algorithm named as LRMST, which is based on the local minimum spanning tree (LMST) algorithm, is proposed by applying the 0-1 robust discrete optimization theory. …”
Get full text
Article -
2014
Distributed locating algorithm for wireless sensor networks-MDS-MAP(D)
Published 2008-01-01“…A new distributed locating algorithm MDS-MAP(D) was proposed,which attempted to improve the perform-ance of node localization in wireless sensor networks.The process of the computation about node relative coordinates and the aggregation from local network to global network are introduced explicitly.Further,the analyses to computational complexity and the simulations of the algorithm are also present.MDS-MAP(D),which is based on node clustering mechanism and uses connectivity of nodes to estimate the coordinates of nodes,reduces the complexity and energy con-sumption of node localization on the absence of distance measurement with high precision.The simulation and analysis results indicate that the complexity of node localization algorithm falls to O(Nm 2),m < N from O(N 3) and the accu-racy is improved 1%~3%.…”
Get full text
Article -
2015
Present a new method for increasing the intelligence and speed of the Firefly algorithm
Published 2022-03-01“…One of the propagation intelligence algorithms is firefly algorithm, which is bace on the exposure of luminous worms and their absorption into more light. …”
Get full text
Article -
2016
Digital watermarking algorithm in SWT domain based on robust local feature
Published 2019-11-01“…Aiming at the challenging work to design a robust digital audio watermarking algorithm against desynchronization attacks,a new second generation digital audio watermarking in stationary wavelet transform (SWT) domain based on robust local audio feature was proposed.First,the first-order smooth gradient response of the low-pass sub-band coefficient was calculated using Gaussian filter.Then,the short-term energy was utilized to adaptively determine local feature audio segments for embedding.Finally,the watermark information was embedded into local feature audio segments with spread transform dither modulation.The experimental results show that the proposed approach has not only good transparency,but also has strong robustness against common audio processing such as MP3 compression and good robustness against the desynchronization attacks such as pitch-scale modification et al.A SWT domain audio feature point extraction method based on smooth gradient is proposed,which effectively solves the drawbacks of poor stability and uneven distribution of audio feature points,and improves the resistance of digital audio watermarks to amplitude-scale modification,pitch-scale modification,random cropping,and jittering attacks.…”
Get full text
Article -
2017
Multi-scale Logo detection algorithm based on convolutional neural network
Published 2020-04-01“…Aiming at the requirements for multi-scale Logo detection in natural scene images,a multi-scale Logo detection algorithm based on convolutional neural network was proposed.The algorithm was based on the realization of two-stage object detection.By constructing feature pyramids and adopting layer-by-layer prediction,multi-scale region proposals were generated.The multi-layer feature maps in convolutional neural networks were fused to enhance the feature representation.The experimental results on the FlickrLogos-32 dataset show that compared with the baseline,the proposed algorithm can improve the recall rate of region proposals,and can improve the performance of small Logo detection while ensuring the accuracy of large and middle Logo,proving the superiority of the proposed algorithm.…”
Get full text
Article -
2018
Improved SOR signal detection algorithm in massive MIMO-TRDMA systems
Published 2021-10-01Subjects: Get full text
Article -
2019
Artificial Bee Colony Algorithm for Solving Optimal Power Flow Problem
Published 2013-01-01“…This paper proposes an artificial bee colony (ABC) algorithm for solving optimal power flow (OPF) problem. …”
Get full text
Article -
2020
Energy balanced routing algorithm for opportunistic network based on message importance
Published 2018-12-01Subjects: Get full text
Article