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.
The objective of this work is the detection of object classes. An improved method is used for object detection and segmentation in real-world multiple-object scenes. It has two stages. In the first stage this method develops a novel technique to extract class-discriminative boundary fragments and the texture features near the boundary, and then boosting is used to select discriminative boundary fragments...
How to deal with the very large database in decision-making applications is a very important issue, which sometimes can be addressed using SVMs. This paper presents a new sample reduction algorithm as a sampling preprocessing for SVM training to improve the scalability. We develop a novel top-down kernel clustering approach which tends to fast produce balanced clusters of similar sizes in the kernel...
Aggregation plays a central role in human thought. There is a need to develop better data aggregation mechanisms in various real-life applications involving intelligent systems. Application of fuzzy measures and fuzzy integrals is a significant development in this pursuit. However, there are certain issues associated with practical implementation of fuzzy measures. This work proposes an approach to...
We propose a new similarity measure for comparing maximal frequent itemset (MFI), which takes into account not only non-numeric attributes but also numeric attributes of each item while computing similarity between MFIs. This provides more reliable soundness for clustering results interpretation. Traditional approaches consider just one side and are apt to lead to unintelligible clustering results...
Attributions including the type of minutiae, the curvature of ridge, the length ratio of 2 line segments of ridge and the relative topological relationship among minutiae and ridges were used in partial and/or nonlinear distorted fingerprint matching. Three kinds of criterions were defined to describe the pattern of fingerprint. Fingerprint was matched in steps according to the criterions consist...
The vehicle routing problem with multi-type and multi-cost is studied in this paper. The fact of different vehicle types associated with different capacities and costs are considered. An optimal model minimized the total cost and restricted the operation process is achieved. A heuristic procedure applied to genetic algorithm was also proposed. Finally, the developed model and algorithm were successfully...
Reverse nearest neighbor (RNN) query now is one of the important queries in spatial database and data mining. Reverse k nearest neighbor(RkNN) is the extendibility of RNN. Given a set V of objects and a query object q, an RkNN query returns a subset of V such that each element of the subset has q as its kNN member according to a certain similarity metric. Early methods pre-compute NN of each data...
The aggregation of fuzzy opinions is an important component of group decision analysis with fuzzy information. This paper proposes two new approaches for the assessment of the weights to be associated with fuzzy opinions. These approaches involve, respectively, the minimization of the sum of squared differences between the individual weighted fuzzy opinion and the weighted mean value of all fuzzy...
Steganography is a method for hidden exchange of information by hiding data in a cover media such as image or sound. Text Steganography is one of the most difficult methods because a text file is not a proper media to hide data in it. In this paper we propose a new text Steganography method. In this method, we hide data in TeX documents. This method hides the data in places where there is a ligature...
The reliable extraction of characteristic gait features from image sequences is an important issue in gait recognition. In this paper we propose a simple, but efficient approach to extract gait feature. In view of the spatio-temporal motion characteristic of gait, we adopt the shape variation information between successive frames to denote gait information, called interframe variation vector- IVV...
A large number of multi-objective optimization evolutionary algorithms(MOEAs) have been developed in the past two decades. To compare these methods rigorously, or to measure the performance of a particular MOEA quantitatively, a variety of performance measures have been proposed. In this paper, some existing widely-used performance measures are briefly reviewed and compared according different properties...
This paper provides a methodology to rank competing entities in terms of their overall performance. Similarities of the entities are used for ranking. The methodology is composed of three stages. Initially, the data is standardized. Secondly, hierarchical cluster analysis is conducted to capture the similarities among the entities. Then a linear programming model is run for final rankings. Furthermore...
This paper presents a new model of measuring semantic similarity in the taxonomy of WordNet. The model takes the path length between two concepts and IC value of each concept as its metric, furthermore, the weight of two metrics can be adapted artificially. In order to evaluate our model, traditional and widely used datasets are used. Firstly, coefficients of correlation between human ratings of similarity...
For wireless sensor networks in LEACH algorithm inter-cluster single-hop communication can not meet the requirements of network expansion of the problem, a multi-hop communication routing algorithm called CMRA is proposed. The algorithm uses the node communication energy consumption model derived network optimal cluster number per round under multi-hop communication; by analyzing the network total...
With the development of the storage technology and the increase of the storage capacity, many large-scale corpuses have been built up. But the corpuses include much redundant information. It leads to the low translation efficiency and speed. In order to get a highly accurate result and high translation speed, it??s necessary to reduce the redundant information by extracting template. This paper proposes...
This article mainly talks about the application of particle filter orientation based on visual noise in the RoboCup emulational group. Agent update the world models of maintain interiorly make use of this means, provide the better world model for the upper level decision.
Knowledge sharing in VCs heavily relies on members?? interaction, which takes participants?? time and effort to collaborate, and the costs of and benefits from interactions in knowledge sharing vary with different collaborator selection. To achieve efficient and effective knowledge sharing, strategic interactions are needed. In this paper, we tried to tackle the strategic interaction support problem...
In the construction of support vector machines (SVM) an important step is to select the optimal kernel parameters. This letter proposes using the distance between two classes (DBTC) in the feature space to help choose kernel parameters. Based on the proposed method, the DBTC function is approximated accurately with sigmoid function. The computation complexity decreases significantly since training...
The capacitated location-routing problem (CLRP) belongs to the field of logistics of transportation. The CLRP appears as a combination of two difficult problems: the facility location problem (FLP) and the vehicle routing problem (VRP).It is an NP-hard problem. In order to solve practical large scale capacitated LRP, We propose a hybrid ant colony algorithm to solve the CLRP. To compare the proposed...
In this paper, we present a novel evolutionary algorithm for dynamic risk grading of major hazards, which can be called DRGEA for short. And we detail the construction theory of DRGEA from many aspects such as individual encoding, evolutionary operators, fitness function and so forth. In the numerical experiment, DRGEA is used to solve a practical problem about dynamic risk grading of major hazards...
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.