Search

Sample selection can speed up the training of Fuzzy Support Vector Machine(SVM). However, it is difficult to select effective sample and the selection ratio is very high. This paper proposes a new sample selection method for Fuzzy SVM based on shadowed sets. We divide the fuzzy sets into three subsets, i.e. trustable data sets, trustless data sets and uncertain data sets. The samples are only selected in trustable data sets and uncertain data sets by using the subspace selection algorithm and the border vector extraction method respectively. Experimental results show that the training time and selection ratio is significantly reduced without any decrease in generalization ability by using the samples chosen by the proposed method. Furthermore, it improves the prediction performance of the classifiers when the data sets contain noises. [ABSTRACT FROM AUTHOR]

To deal with the problems such as high complexity and low accuracy of redundancy detection, a model of redundancy detection based on control structure analysis is proposed and implemented. This paper predigests the complexity of control structure by establishing a compound node table for tokens, which reduces the complexity of redundancy detection, and then detects the idempotent operations, dead code and redundant assignment. Experimental results of the open source code of Linux show that this model can find redundant code accurately and also has a low time-complexity. With this model, it is very convenient for developers to detect and correct these kinds of defects, and thereby to further guarantee the software quality. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we investigate the multi-attribute group decision making (MAGDM) problem with incomplete attribute weight information under interval-valued intuitionistic fuzzy (IVIF) environment. Firstly, we propose a new axiomatic definition of the entropy on interval-valued intuitionistic fuzzy sets (IVIFSs) and a method to construct a set of entropies on IVIFSs. Secondly, we construct a decision making model based on aggregation operator and distance measures to solve the MAGDM problem under IVIF environment. In this model, we propose a method based on linear programming methodology using an accuracy function to choose the attribute weights for the decision making problem with partially known attribute weight information, and a method based on IVIF entropy to choose the attribute weights for the decision making problem with unknown attribute weight information. Finally, two numerical examples are given to demonstrate the feasibility and validity of the newly proposed MAGDM method by comparing it with other fuzzy MAGDM methods. [Copyright &y& Elsevier]

To solve the problem of track association in dense target environment, a new track association algorithm based on K-Medoids clustering is presented. The algorithm makes the sensor tracks associate with the system tracks and selects the system tracks as Medoids, which greatly reduce the number of track pairs needed to associate, avoid the inherent defects of K-Medoids clustering, and improve the efficiency of the algorithm. In addition, the approximate distance between the two tracks is acquired by calculating the distance at a sampling point with the method of infinite norm, and then the track pair with minimum distance is selected as the associated tracks. The consideration of the historical and current track improves the probability of correct association. Finally, the algorithm is implemented in the multi-sensor and multi-target environment and the simulation results prove the effectiveness and superiority of the algorithm. The algorithm has a strong robustness in the presence of noise and outliers, and is suitable for the dense target environments. [ABSTRACT FROM AUTHOR]

There are many requirements for the multilanguage static information retrieval, and it is wasteful and complex to build specific front end for each language. So to meet the need and conquer the weakness we present a method based on GCC source code change to provide a uniform interface for retrieval. According to the static information type and the GCC inside mechanism, this method integrates the specific hook point with the GCC's internal functions to gather the needed. The details to be collected include: the type and function declaration, the statements traverse and the uniform multilanguage middle-representation. The reusability of this method reduces the duplicated cost of the construction for each language. The comparison experiments shows that this method can efficiently and robustly parse multilanguage and be directly applied to large -- scale open source code to retrieve the static information. [ABSTRACT FROM AUTHOR]

For solving the problem that the current clone and related bug detection tools cannot analyze largescale code and detect modified code clones, a model of clone and identifier inconsistency bugs detection based on the improved model of clone detection via sequential pattern mining is proposed. This model improves the existing submodel of identifier forgotten renaming bug detection, and introduces a new submodel of identifier mistaken renaming bug detection. Identifier renaming inconsistency bugs are detected by computing identifier unchanged ratio (UnchangedRatio). Experiment results indicate that this model can detect clone related bugs on the basis of code clone detection, reduce false-negative rate and false-positive rate, and is effective in detecting two kinds of identifier inconsistency bugs. [ABSTRACT FROM AUTHOR]

To evaluate the reliability of Multiagent system accurately, a synthetic evaluation approach considering communication reliability, unit reliability and system topology is proposed. Multiagent system structures are summarized; the influence of communication reliability and unit reliability to the reliability of centralized, distributed and federated Multiagent system is analyzed based on Markov process; and system reliability models are given. The simulation results show that this method can simplify the problem of complex system reliability, for the entire system reliability can be obtained after the reliability of every part is achieved. [ABSTRACT FROM AUTHOR]

In order to correctly analyze the control dependence and data dependence relations of C program, and then can out the program slicing, code redundancy and code duplication detection, a method to extract the static information of C program from GCC AST text was put forward. Firstly, the GCC AST text was standardized and the nodes unrelated to control dependence and data dependence analysis were eliminated. Secondly, control dependence subgraph was constructed. If data flow analysis was necessary, control flow graph was constructed based on control dependence subgraph and data dependence subgraph was constructed based on control flow graph. At last, by the introduction of inter-process analysis, system dependence graph was improved. It is indicated that the research can correctly analyze the control dependence and data dependence relations. [ABSTRACT FROM AUTHOR]

To solve the problem of peak clustering in Hough transform for track initiation of dim targets, an improved track initiation algorithm based on subtractive clustering is proposed. First, Hough transform is used to obtain the votes whose value exceeds the threshold in parametric space, and then a subtractive clustering method is applied to get the final result corresponding to the obtained parameters. Experimental results show that the proposed approach can achieve significant improvement in reducing the peak clustering, and has strong robustness to clutter, especially in complex environment. [ABSTRACT FROM AUTHOR]

Aiming at the problem of huge virtual memory caused by high-dimensional input, tiny quantization space and too many samples, an improved conceptual mapping method for B-spline CMAC based on multi-dimensional memory is proposed. This method can avoid the address collision without Hash mapping from virtual memory to physical memory. Compared with the conventional conceptual mapping method, the proposed method needs less virtual memory address space for mapping only a few regular address in quantization space. It has greatly improved the learning precision and generalization capability under the condition of limited physical memory. Simulation results show that B-spline CMAC with the new conceptual mapping method has a higher learning precision, faster learning speed and better generalization capability than conventional CMAC. Meanwhile, the new conceptual mapping method is better than others in the integrated performance of memory, learning and generalization capability for B-spline CMAC with the same structure. [ABSTRACT FROM AUTHOR]

A 3D reconstruction method adapted to regular objects was proposed. Firstly, sufficient feature points were obtained through feature extracting and cross matching process of some photos at different angles taken from an object. In order to delete some mis-matehed points generated in matching process, a distribution matching strategy was used based on similarity measurement of covariance. Then the space point reconstruction and surface reconstruction method were used to reconstruct a 3D model of the object. At the same time, the realistic texture was extracted from some images; the 2D images were triangularized and then mapped into 3D space. Finally, the texture was added to the 3D model and a realistic exterior model was obtained. The correctness and validity of this modeling method was confirmed through practical application. [ABSTRACT FROM AUTHOR]

In order to facilitate program analysis, a standardization method is proposed to remove variations in programs implemented with pointers. Firstly, a program is represented by a system dependence graph (SDG) , and the alias information is analyzed. Then standardization rules for eliminating variations caused by pointers are proposed, and the SDG is transformed according to these roles, so that syntactically different but semantically equivalent codes can be transformed into identical SDGs. Therefore, code variations are removed. The proposed method has been applied to an automatic grading system of C programming language, and the results were compared with those of both manua! and strictly precise grading systems to validate the effectiveness of our method. [ABSTRACT FROM AUTHOR]

In order to improve the efficiency of AOI in the process of collecting images, the location and field of image taking must be optimized, The existing methods in common are low efficient, so a new path planning method based on the hybrid genetic algorithm is proposed to optimize the path and raise the efficiency of detection. The simulation results show the effectiveness of the algorithm. Under the same conditions, the application of this method can save time, thus improves the efficiency of detection and overcomes the shortcomings of traditional methods such as image taking in order, meantime, the board for off-line path planning will not affect the time of actual on-line image taking. The path planning method based on the hybrid genetic algorithm is an effective solution to the key issues of path planning in AOI, and is of great significance for efficiency improvement in industrial production. [ABSTRACT FROM AUTHOR]

To solve the problem of identifying similar questions in examination database, an algorithm for question similarity identification is proposed in this paper. By introducing domain words to the improvement of the word similarity model in HowNet, a model for question similarity identification is proposed to make the same or similar questions be identified and cut off automatically. This method improves the accuracy of identification compared with other methods. By combining merits of the random selection with those of the backtracking method, a new algorithm of generating papers automatically based on question similarity identification is proposed. It can guarantee the quality of papers. Test results show that the accuracy of question similarity identification of this method is 96% , which approaches to that of manual identification. This method can cut off similar questions not only of the same type, but also of different types. Finally, this method has been applied to the on-line examination of C programming language. [ABSTRACT FROM AUTHOR]