TL;DR: The Logistic mapping is integrated into the fruit fly algorithm to do global search for the optimal parameter, and it uses the value as the center to do tiny fluctuations to obtain initial value of quadratic optimization, and improve the initial value selection method of fruitFly algorithm.
Abstract: In the optimization process of the fruit fly algorithm,the convergence accuracy is unstable because of the initial value choosing suitable or not.In order to solve this problem,this paper proposes a new mixed fruit fly algorithm.The Logistic mapping is integrated into the fruit fly algorithm to do global search for the optimal parameter.It uses the value as the center to do tiny fluctuations to obtain initial value of quadratic optimization,and improve the initial value selection method of fruit fly algorithm.In the function optimization simulation process,compared with the original fruit fly algorithm and Particle Swarm Optimization(PSO) algorithm etc.,the convergence accuracy of this mixed fruit fly algorithm has obvious advantages.
TL;DR: In this article, an information hiding algorithm based on pitch prediction for low bit-rate speech coding is presented, which not only has better steganography performance,but also has lower computational complexity.
Abstract: Information hiding algorithm based on pitch prediction for low bit-rate speech coding is presented.In the pitch prediction coding process,the searching range of adaptive codebook in the closed-loop pitch search is used to realize the secret information embedding.Information hiding and speech coding are synchronously implemented.The algorithm not only has better steganography performance,but also has lower computational complexity.In G.729a,the statistical average embedding bit-rate of secret information is up to 374.636 bit/s,the deterioration of Perceptual Evaluation of Speech Quality(PESQ) is less than 10.4% and testing accuracy is less than 66%.
TL;DR: Simulation experimental result shows that the correct recognition rate of this fault diagnosis method of high speed train bogie based on Ensemble Empirical Mode Decomposition can achieve more than 95%.
Abstract: Mechanical fault of bogie seriously affects the security and comfort of the high speed train.Vibration signal of bogie and car body change with the fault occurrence,therefore,this paper proposes a fault diagnosis method of high speed train bogie based on Ensemble Empirical Mode Decomposition(EEMD).There are four typical working conditions in simulation experiment,such as air spring fault,yaw damper fault,lateral damper fault and normal condition.Vibration signal becomes several intrinsic mode functions after ensemble empirical mode decomposition.Energy moment feature is extracted to reflect the time distribution rule of energy.The 2nd to 6th energy moment are chosen to constitute 5-dimension eigenvector.In speed of 200 km/h,the Support Vector Machine(SVM) gets recognition rate.Simulation experimental result shows that the correct recognition rate of this method can achieve more than 95%.
TL;DR: A remote access and control system is implemented based on Android system and its application-specification, is implemented through the Java language, followed with the RFB protocol, and touch screen, soft keyboard, multi-point touch are implemented in this system.
Abstract: Remote control system can be used by people to access the non-native systems, such as the various hardware and software resources provided in another platform. In order to implement the remote control service on a mobile platform, a remote access and control system is implemented based on Android system and its application-specification, is implemented through the Java language, followed with the RFB protocol. Also, touch screen, soft keyboard, multi-point touch are implemented in this system by using the system resources of Android system. It can be run on the mobile-phone with Android system and is able to communicate with the VNC software family servers which support RFB protocol.
TL;DR: A new kind of cotton image segmentation algorithm based on Support Vector Machine (SVM) is proposed that can segment cotton image with the complex background, and the accuracy and stability are better than threshold segmentation method.
Abstract: A new kind of cotton image segmentation algorithm based on Support Vector Machine(SVM) is proposed.The cotton image is classified into the target and the background.The sample pixel value is extracted from the two categories under OHTA color space.These samples are trained with category information by SVM.Otsu method is used to deal with the image.SVM classifier is trained to segment the cotton image after pretreatment,and the noise is removed by region label.Experimental results show that this method can segment cotton image with the complex background,and the accuracy of segmentation cotton images is as high as 92.3%.Its classify speed is better than directly using SVM to segment the image.The accuracy and stability are better than threshold segmentation method.
TL;DR: The results of estimation show that the quality level of FC domain ontology is medium according to the maximum membership degree principle, and shows that it is necessary to improve the quality of developing techniques and structure display.
Abstract: Aiming at the problem of software-intensive degree incrementing tendency of Avionics Electronics(AE) and the ambiguity and incompleteness of AE software requirements engineering,this paper constructs AE system software requirement knowledge ontology and its knowledge frameworkIt constructs the AE generalized ontology and chooses the Flying Control(FC) to construct the FC domain ontologyIt estimates the quality of FC domain ontologyThe results of estimation show that the quality level of FC domain ontology is medium according to the maximum membership degree principleThis result shows that it is necessary to improve the quality of developing techniques and structure display
TL;DR: A seamless image stitching method based on Affine-SIFT(ASIFT) algoithm is proposed in this paper and experimental results demonstrate that this method has better performance than the methodbased on SIFT.
Abstract: A seamless image stitching method based on Affine-SIFT(ASIFT) algoithm is proposed in this paper.It implements automatically and makes up the disadvantages of traditional image registration methods under greatly different scale,parallax and illumination conditions.It adopts ASIFT algorithm for the detection of feature points,which is robust to the case of strong affine.Then it does the extraction and matching of feature points.With Random Sample Consensus(RANSAC) algorithm,it finds the accurate initial transform matrix through iteration,and accomplishes the unity of coordinate transformation between two images.The seamless image stitching is completed with smoothing algorithm.Experimental results demonstrate that this method has better performance than the method based on SIFT.
TL;DR: Experimental results show that the new collaborative learning FOA based on the best and the worst individual has the advantages of better global search ability, speeder convergence and more precise convergence.
Abstract: Considering the premature convergence problem of Fruit fly Optimization Algorithm(FOA), a new collaborative learning FOA based on the best and the worst individual is presented. The evolutionary equation is optimized by adding learning the worst individual to it.The ability of the algorithm to break away from the local optimum and to find the global optimum is greatly enhanced. Experimental results show that the new algorithm has the advantages of better global search ability, speeder convergence and more precise convergence.
TL;DR: Results show that the new algorithm can exactly recover original signal at the noisy condition and owns the characteristics of sparsity adaption.
Abstract: Compressive sensing reconstruction algorithm needs to predict sparse degree of the signal,however the sparse degree is always impossible to obtain in the practical application.In order to improve the sparsity adaptive problem of the CoSaMP algorithm,a new algorithm is proposed for the signal reconstruction.It initially estimates the sparse degree,combined with the idea of SAMP algorithm,the sparse degree gradually increases under the framework of CoSaMP algorithm.With the comparison of residual value for termination condition,it can exactly recover original signal after few recursive operations.Results show that the new algorithm can exactly recover original signal at the noisy condition and owns the characteristics of sparsity adaption.
TL;DR: This paper uses RGB images and 3D images produced by Kinect to get the realtime peripheral dynamic dynamic information of mobile robot, and uses the fuzzy logic and information fusion technology to realize realtime path plan for the robot in dynamic environment.
Abstract: ()Traditional path planning method exists the problem that the calculation is complex, efficiency is low, and has high error. In order to solve this problem, this paper proposes a realtime local path planning method for mobile robot based on Kinect. This paper uses RGB images and 3D images produced by Kinect to get the realtime peripheral dynamic en vironmental information of mobile robot, uses the fuzzy logic and information fusion technology to realize realtime path plan ning for the robot in dynamic environment, so as to solve the problem of robot target tracking and navigation. Experimental results show that this method has good stability and realtime. (Key words ) )) )Kinect sensor; fuzzy theory; path planning; mobile robot; environment perception; vision sensing
TL;DR: A vehicle detection algorithm based on brightness cumulative histogram is proposed, which detects from the front vehicles via the highlight feature of the taillights, and demonstrates the effectiveness and robustness of the approach on vehicle detection at night.
Abstract: In order to improve the vehicle detection accuracy in the nighttime environment,a vehicle detection algorithm based on brightness cumulative histogram is proposed,which detects from the front vehicles via the highlight feature of the taillights.The initial threshold of Otsu method is obtained from a number of taillights statistical information.The bright objects are extracted from images,based on the improved Otsu method in brightness cumulative histogram.The characteristics such as the shape,position and color of taillights are combined to select and pair them.The front vehicles can be detected by the paired taillights.Experimental results demonstrate the accuracy of the proposed approach on taillights segmentation,and demonstrate the effectiveness and robustness of the approach on vehicle detection at night.
TL;DR: Experimental results show that this algorithm can gain edge clear scaling image, the complexity of the algorithm is low, and the Peak Signal to Noise Ratio of image is 40.76 dB.
Abstract: In order to achieve high speed and high quality image scaling in Field Programmable Gate Array(FPGA),this paper proposes an edge adaptive image scaling algorithm based on FPGA.This algorithm uses bilinear interpolation algorithm out of the edge area,uses directional three interpolation algorithm in the edge area,designs the hardware structure and operation logic structure,uses Verilog language to describe,and gives the object code.Experimental results show that this algorithm can gain edge clear scaling image,the complexity of the algorithm is low,after magnifing 2.5 times,the Peak Signal to Noise Ratio(PSNR) of image is 40.76 dB.
TL;DR: An improved projection segmentation method is put forward for the text in the print Uighur character recognition system, and results prove that it makes the piece paragraph segmentation of the correct rate further improved.
Abstract: For the text in the print Uighur character recognition system,especially for the difficult issue of conjoined section letter segmentation,an improved projection segmentation method is put forward.The index value of the baseline region pixels set to white(set the pixel index value to 255) is adopted,and its vertical projection is made.The projector to a value of 0’s gap is taken as a candidate tangent position.The threshold value is combined with the line height and width ratio of the blank gap statistics data’ average value is set to eliminate false segmentation.Experimental results prove that the method makes the piece paragraph segmentation of the correct rate further improved.
TL;DR: This paper improves DV-Distance(IDV-Distance) algorithm and proposes a node positioning algorithm which is suitable for ribbon Wireless Sensor Network (WSN), which gets the cumulative hop distance measured by RSSI method, and corrects it based on the ribbon WSN topology characteristics.
Abstract: ———————————— 0� Abstract0� The deviation of the DV-Distance positioning algorithm in perimeter intrusion detection is too large. Aiming at this problem, this paper improves DV-Distance(IDV-Distance) algorithm and proposes a node positioning algorithm which is suitable for ribbon Wireless Sensor Network(WSN). This algorithm gets the cumulative hop distance measured by RSSI method, and corrects it based on the ribbon WSN topology characteristics. It preliminary estimates node position using the maximum likelihood method, and improves the node positioning accuracy by steepest descent algorithm. Experimental results show that, compared with the classical DV-Distance algorithm and two kinds of improved DV-Distance algorithms in ribbon WSN, this algorithm has higher accuracy. 0� Key words0� Wireless Sensor Network(WSN); regional intrusion detection; IDV-distance self-positioning algorithm; accumulated hop distance correction; maximum likelihood method; steepest descent algorithm
TL;DR: A collaborative filtering algorithm CoTrustWalker is proposed that combines item-based collaborative filtering and trust-based recommendation, which improves TrustWalker algorithm in similarity calculation, and enhances the stability of recommendation results by selecting the most similar polymerization results of some items.
Abstract: To solve recommendation problem for cold-start users,this paper proposes a collaborative filtering algorithm CoTrustWalker that combines item-based collaborative filtering and trust-based recommendation,which improves TrustWalker algorithm in similarity calculation,the possibility of item selection and prediction score.CoTrustWalker algorithm adopts the cloud model similarity method to compute the item similarities,so as to enhance the stability of recommendation results by selecting the most similar polymerization results of some items.Experimental results show that CoTrustWalker algorithm improves the quality of recommendation and the speed compared with TrustWalker algorithm.
TL;DR: Experimental results indicate that GSF2LA can effectively improve convergence speed and precision in optimization problem of single peak function and multi-peak function in respectively fixing the condition of global evolution times and convergence precision, and it improves the optimization performance of SFLA.
Abstract: To solve the problem of slow convergence speed and low optimization precision of Shuffled Frog Leaping Algorithm(SFLA)in later stage of evolution, the optimization SFLAs are proposed in this paper. By introducing the sharing factor, it is divided into global sharing factor and local sharing factor. The idea of three algorithms by adopting two types of sharing factor to SFLA is introduced, and the optimization performance of Shuffled Frog Leaping Algorithm Based on Global Sharing Factor(GSF2LA) is analyzed. Algorithm steps are given and its efficiency is analysed. Experimental results indicate that GSF2LA can effectively improve convergence speed and precision in optimization problem of single peak function and multi-peak function in respectively fixing the condition of global evolution times and convergence precision, and it improves the optimization performance of SFLA.
TL;DR: Experimental results show that this proposed algorithm evaluates the importance of each node more precisely than node deletion algorithm.
Abstract: In order to judge the importance of nodes in communication networks more effectively,a multi-parameter optimization algorithm based on node deletion algorithm for communication network nodes importance evaluation is proposed in this paper.This algorithm gives the Node Importance Index(NII),and can evaluate the importance of a node by comparing this index,as well as reflects the extent of the effect to the whole communications network after deleting it.Experimental results show that this proposed algorithm evaluates the importance of each node more precisely than node deletion algorithm.
TL;DR: Analysis results show that this protocol can not only prevent fack, track, play attacks, but also protect against physical clonable attacks, compared with the randomized Hash-Lock, a lightweight authentication protocol etc..
Abstract: Traditional encryption-based Radio Frequency Identification(RFID) authentication protocols require a large amount of computation in the application of Internet of Thing(IOT),therefore it can not be adopted to the resource-limited devices.In order to solve this problem,this paper proposes a RFID mutual authentication protocol based on Physical Unclonable Function(PUF).This paper analyzes the security requirements of the RFID system protocol.According to the PUF,it designs a lightweight two-way security authentication protocol,and uses formal language to prove the security of the protocol.Analysis results show that this protocol can not only prevent fack,track,replay attacks,but also protect against physical clonable attacks,compared with the randomized Hash-Lock,a lightweight authentication protocol etc..
TL;DR: Experimental results show that this method resolves face location and recognition effectively in the complex background and has more fast and effective practicability than other means, over 90% correct recognition rate.
Abstract: This paper proposes a fast face detection and recognition algorithm based on face image in the complex background.The process includes complexion model and OpenCV integrated method to solve face detection and location,re-save image,pretreatment,and illumination influence will be conquered effectively,eliminates the disadvantage factor disturbance of complex background.Afterward,it adopts Two-dimensional Principle Component Analysis(2DPCA) algorithms to collect face image of different expression which comes from the same human and distill character,and classifies the similar face image.By ORL database and outfield face image test,experimental results show that this method resolves face location and recognition effectively in the complex background and has more fast and effective practicability than other means,over 90% correct recognition rate.
TL;DR: A task schedule algorithm based on improved particle swarm is proposed in this paper, which uses indirect encoding to encode the resources of each subtask takes, and gives decoding way, and considers the fitness function about the time and the cost.
Abstract: Existing task schedule algorithms for cloud computing are not well to take into account the cost of all the tasks for the pursuit of the shortest completion time.To solve this problem,a task schedule algorithm based on improved particle swarm is proposed in this paper,which uses indirect encoding to encode the resources of each subtask takes,gives decoding way,considers the fitness function about the time and the cost,and establishes the particle position and velocity updating method.Experimental results show that the general assignment finished time and cost of this algorithm are lower than the traditional Particle Swarm Optimization(PSO) algorithm.
TL;DR: Experimental results indicate that the improved LEACH algorithm can save and balance the node energy consumption effectively, delay the first node's death time, and extend the lifetime of network.
Abstract: Classical clustering communication protocol of Low Energy Adaptive Clustering Hierarchy(LEACH) in Wireless Sensor Network(WSN) is analyzedIn order to extend the lifetime of network in LEACH,this paper proposes an improved cluster-head election algorithmIf the residual energy of each cluster-head is lower than the given threshold,cluster-head election is done in the whole networkThis paper introduces a new strategy based on the relative density of nodes,the selection method of the threshold for electing cluster-head is optimizedIf not,the election is done in the cluster,the protocol chooses new cluster-head nodes based on the node's residual energy,position and dense gradeExperimental results indicate that the improved LEACH algorithm can save and balance the node energy consumption effectively,delay the first node's death time,and extend the lifetime of network
TL;DR: The fading in communication link is discussed with the character of train running environment, and the result shows that the multipath propagation and Doppler effect lead to serious signal fading.
Abstract: The trains in the railway section communicate with each other by track circuit or base station indirectly,which has too many nodes and low reliability,also brings safety risk.In order to realize direct communication of train-to-train and the need of railway collision avoidance system,the train-to-train direct communication scheme is proposed,the ultrashort wave band,the maximum communication distance between trains and the structure of transceiver are selected for railway application requirements,also the feasibility of this technology is described.The link of the direct train-to-train communication is analyzed,the budget model of path loss of station and section are given,the calculated results under different conditions of the receiver power also with simulation are illustrated.Analysis result shows that the proposed technology can be realized.The fading in communication link is discussed with the character of train running environment,the result shows that the multipath propagation and Doppler effect lead to serious signal fading.
TL;DR: It is proved that when the running time goes infinity, the Simulated Harmonic Oscillator with keeping excellent answer can keep the best global solution convergent.
Abstract: This paper introduces the Simulated Harmonic Oscillator(SHO) algorithm,and analyses the global convergence of it.Process of SHO is divided into three basic operations,such as generating new solution,amending current solution,composing new solution sets,and mapping these changes of state into three stochastic matrixs.Using limited Markov chain theoretics to analyse the matrix of state changing,it is proved that when the running time goes infinity,SHO with keeping excellent answer can keep the best global solution convergent.
TL;DR: The simulation requirement in wireless networks, based on multi-interface multi-channel(MIMC), for lower layer protocols and physical layers protocols is introduced and the basic methods and principles for MIMC extensions to NS-2 are elaborated.
Abstract: Based on the wide support of 802.11x series standards to orthogonal mutli-channel technology,this paper introduces the simulation requirement in wireless networks,based on multi-interface multi-channel(MIMC),for lower layer(data link and physical layers) protocols.The simulation shortage for MIMC model support in NS-2 is summarized.Then the basic methods and principles for MIMC extensions to NS-2 are elaborated based on some existing schemes.The classification and analyses of extensions are illustrated and some contrastive analyses about MIMC models are given at length.
TL;DR: A comprehensive item similarity measurement algorithm based on weighted Jaccard index is proposed, and prefills the rating matrix by the comprehensive item Similarity Index.
Abstract: When the magnitudes of users and commodities grow rapidly,the rating matrix becomes extremely sparse.In the condition,algorithms based on traditional similarity computing have poor performance.In order to overcome this problem,this paper proposes a comprehensive item similarity measurement algorithm based on weighted Jaccard index,and prefills the rating matrix by the comprehensive item similarity.Experimental results show that the algorithm is more accurate compared with traditional algorithms.
TL;DR: A design for Android-based on industrial control mobile monitoring software is proposed in this paper, which combines the Android NDK development, multi-level page table mapping and asynchronous network transmission to enhance the tags data transmission speed to ensure real-time.
Abstract: A design for Android-based on industrial control mobile monitoring software is proposed.By using the object-oriented and hierarchical method,it developes a monitoring software with industrial flow chart,alarm pushing and login authentication functions.To ensure the system compatibility,mobile terminal severs is erected on the basis of factory original network topology.Combining the Android NDK development,multi-level page table mapping and asynchronous network transmission,the software enhances the tags data transmission speed to ensure real-time.Test results show that the software has a good practicality,it can bring convenience for field operators.
TL;DR: Simulation experimental results show that the mechanism can meet loose coupling and high real-time demands, and improve the efficiency of communication.
Abstract: Aiming at the problem of high real-time data demands for ship information systems,this paper applies Data Distribution Service(DDS) for ship information systems,combining with the characteristics of the ship information system,the paper proposes a communication mechanism based on interest filtering.The mechanism can express the interest of subscription more fine-grained to improve communication rate.Simulation experimental results show that the mechanism can meet loose coupling and high real-time demands,and improve the efficiency of communication.
TL;DR: Experimental results show that this method can provide more than two times of robustness when the detection accuracy declined about 6%compared with the classical correlation coefficient.
Abstract: To improve the accuracy of the hardware trojan detection,a method based on the correlation analysis is presented.After a power modeling of the trojan,the feasibility and defect of the detection method by using the classical correlation coefficient are analyzed,the detection coefficient is optimized according to the characteristics of trojan detection,and the detection method depended on the region overlap ratio is presented.Experimental results show that this method can provide more than two times of robustness when the detection accuracy declined about 6%compared with the classical correlation coefficient.
TL;DR: Experimental results show that the management system fuses dimension model, it has personalized features, strong interactivity and user sensitivity, and a KMS based on the dimension model.
Abstract: According to the trend of the development of Knowledge Management(KM),this paper proposes a new dimension model-based Knowledge Management System(KMS).By researching the general characteristics of knowledge,it puts forward a knowledge model based on knowledge dimension,discusses knowledge organization mode and management method based on the dimension model,and designs a KMS based on the dimension model.In this system,knowledge service and search engines based on the dimension model are introduced to deal with the knowledge dimension and its relevant information.Experimental results show that the management system fuses dimension model,it has personalized features,strong interactivity and user sensitivity.
TL;DR: A strong forward secure signature scheme, which is based on Guillou-Quisquater signature and Rabin cryptosystem is proposed, which shows that it is correct and secure, and has the property of strong forward security.
Abstract: Aiming at the problem of key disclose in existed digital signature schemes,a strong forward secure signature scheme,which is based on Guillou-Quisquater signature and Rabin cryptosystem is proposed.In this new scheme,the signer can produce one signature key by the traditional forward technology,and then generate another key with reverse thinking.The use of the two keys makes attackers can not forge the signer's previous and subsequent periods of valid signatures even if they get the signer's keys of the current period.Analysis result shows that it is correct and secure,moreover,it has the property of strong forward security.It is also less time-consuming than existing shcemes.