The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In recent years, digital maps are used more and more widely, it plays a significant role in the national economy and defense construction, illegal duplication and distribution or forgery of the maps is also easy. Digital watermarking algorithms for vector data are an efficient method to counter such abuses of the maps. Considering the characteristic of vector geo-spatial data for digital watermarking,...
Currently, to improve the accuracy and efficiency of fault diagnosis using intelligent information technology has become the development trend of fault diagnosis technology. The fault diagnosis technology character of current complex devices was analyzed firstly in the paper. Then, aim at the uncertain reasoning problem in the fault diagnosis, a weighted fuzzy logic reasoning algorithm that is more...
Particle swarm optimization (PSO) is a good optimization algorithm, but it always premature convergence to local optimization, especially in some complex issues like optimization of high-dimensional function. In this paper, a particle swarm optimization based on chaotic neighborhood search (PSOCNS) is proposed. When the sign of premature convergence is arise, search each small area which is defined...
Path planning for robots with many degrees of freedom (dof) receives continuous interest in both robotics and computer graphics communities. A variety of random sampling-based methods have been proposed to solve the path planning problems in high-dimensional configuration space, including Probabilistic Roadmap Method (PRM) and Rapidly-exploring Random Trees (RRTs). However, the efficiency will be...
This paper considers a continuous capacitated facility location problem without a priori knowledge of the desired number of facilities. The demand locations and volume are known to the decision maker. A new hybrid evolutionary algorithm combining variable-length GA (genetic algorithm) and PSO (particle swarm optimization) together is proposed to solve the problem. For variable-length GA, the chromosome...
The technology of spectrum signal tracking and demodulation not only involves the designs of complex high-speed digital circuits, but also includes the designs of tracking algorithm. In the traditional design, the designers usually adopt the design methods based on FPGA&DSP to achieve all the above contents, which means that the carrier-DCO, code-DCO, the circuits of correlation and integral can...
The excellent maintainability is the significant characteristic of the aero-engine, which ensures the maintenance high quality, high efficiency and low cost, but values of one attribution of aero-engine fault are more than one. In this paper, we consider a multi-valued test sequencing (MVTS) problem, in which a test may have an arbitrary number of possible outcomes denoting different behaviors. The...
Corner detection is an important step in the image processing of machine vision. An improved algorithm is proposed in this paper following the analysis on the existing corner detection algorithms and on the localization precision and computation efficiency in the Harris corner detection algorithm. In this algorithm, a large number of irrelevant points are rejected by statistical analyzing the pixel...
By analyzing the topological relationships between network elements, this paper extends a turn-based algorithm for the network loading of logit type, which has a structure similar to Dial's algorithm. Based on the conservation of flows on links, the algorithm computes directly the link flow and turn flow pattern that not only agrees with the logit path-choice process but also takes into account the...
Object recognition in stereo sequences is a simulation of human visual systems on how to analyze and understand various scenes. A pair of stereo sequences is a type of complicated information with huge amount of raw data and features associated with different parameter spaces. Therefore the automatic object recognition in stereo sequences is a difficult and unsolved task challenging many researchers...
Traffic accidents usually induce non-recurrent congestions in the urban transportation network. In order to avoid the congestion deterioration, the paper presented a method to make traffic dispersion plans. The method considered and harmonized multi-objective, such as the change in total travel time, restrictions of traffic volumes on the links, and changes in traffic volumes on the links. Firstly,...
Bot nicknames within one IRC-based botnet must have uniform structure, because they are generated by the same bot fixedly. In this paper, the similarity of nicknames in the same channel is defined by the term dasiachannel distancepsila. And a novel algorithm based on channel distance is proposed to detect IRC-based botnets. The most significant contribution of this algorithm is that it can detect...
In order to improve dynamic performance to load variation of PFC circuit, a digital PFC algorithm with fast dynamic response is proposed in bridgeless boost PFC. The proposed algorithm improves dynamic response by increasing voltage loop bandwidth, and uses vector rotation scheme to generate compensating harmonic signal which counteracts second order harmonic resulted from increased voltage loop bandwidth...
Many multiple attribute decision analysis (MADA) problems are characterized by both quantitative and qualitative attributes with various types of uncertainties. Incompleteness (or ignorance) and vagueness (or fuzziness) are among the most common uncertainties in decision analysis. The evidential reasoning (ER) and the interval grade ER (IER) approaches have been developed in recent years to support...
This paper analyses the advantages and disadvantages of the K-means algorithm and the DENCLUE algorithm. In order to realise the automation of clustering analysis and eliminate human factors, both partitioning and density-based methods were adopted, resulting in a new algorithm - Clustering Algorithm based on object Density and Direction (CADD). This paper discusses the theory and algorithm design...
Association analysis arises in many important applications such as bioinformatics and business intelligence. Given a large collection of measurements over a set of samples, association analysis aims to find dependencies of target variables to subsets of measurements. Most previous algorithms adopt a two-stage approach; they first group samples based on the similarity in the subset of measurements,...
As the security of software is deeply valued while its complexity and size are increasing, automated verification is highly desirable. On the other hand, verification of pointer programs remains a major challenge. In our previous work pointer logic has been proposed to verify basic safety properties of pointer programs, and in this work, we developed efficient algorithms and techniques to implement...
The traditional text clustering algorithm often uses the unsupervised feature selection method to select the feature. In this paper we propose a new text clustering algorithm SFFCM which use the supervised feature selection method to select the feature. The SFFCM is based on the EM algorithm. In the E-step, to calculate the expectation, we use the supervised feature selection algorithm to calculate...
In traditional FCM clustering algorithm each feature is supposed to have equal importance. Considering different feature with different importance, this paper presented an improved FCM algorithm with adaptive weight for features of each cluster, named AWFCM. In the iterative AWFCM process, to identify the importance of features of each cluster, the weight for feature is computed dynamically based...
Many networks, including social and biological networks, are naturally divided into communities. Community detection is an important task for the discovering underlying structure in networks. GN algorithm is one of the most influential detection algorithms based on betweenness scores of edges, but it is computationally costly, as all betweenness scores should be repeatedly computed once an edge is...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.