A Chinese Web page clustering algorithm based on the suffix tree

In this paper, an improved algorithm, named STC-I. is proposed for Chinese Web page clustering based on Chinese language characteristics, which adopts a new unit choice principle and a novel suffix tree construction policy. The experimental results show that the new algorithm keeps advantages of STC, and is better than STC in precision and speed when they are used to cluster Chinese Web page.     

Fast dating of Yongzheng copper coins in tsing empire by SEM-EDS

Twenty Yongzheng copper coins were fast dat-ing by X-ray energy dispersive spectrometer with scanning electron microscope (SEM-EDS) according to official ingredient. The 20 coins were classified in two groups according to the results. Group 1 represents the coins minted before AD 1 728 and group 2 represents the coins minted after AD 1 728. At concentration range (0.00%-5.13%), the distribution of lead is not homogeneous in the coins, and the largest diameter of lead inclusion is less than 15 μm. The official fineness degrade is supported.     

New Parallel Interference Cancellation Scheme for DS／CDMA Systems

This paper proposes a new multi-stage parallel interference cancellation scheme by modifying the conventional multi-stage parallel interference canceller (PIC). At each stage, it first converts the interference-cancelled outputs from previous stage into the a prior information, in terms of which the bit mean values are computed and the multi-access interferenee (MAI) for each user is evaluated, and then an interferenee cancellation is performed to obtain further interference suppression. To reduce the implementation complexity, wegive an approximation expression for bit mean value. The performance over AWGN channel is analyzed and compared to the conventional PIC. The user number K= 7 and spreading factor N= 13 are chosen as simulation parameters. The computer simulation results show that the proposed PIC has better performance than the conventional PIC both with 2 interference cancellation (IC) stages, at bit error rate of 10^-3 , for example, about 3 dB performance gain is obtained by using the proposed PIC. It is also shown that our proposed PIC with 1-stage is superior to the conventional PIC with 2-stage in performance, which is of practical value because PIC with fewer stages can bring about shorter processing delay.     

Optimization of short-pulse GPR transmit antenna

By analyzing the current distribution of Bow-Tie amerma used in short-pulse ground penetrating radar, the methods of antenna load and driving are presented in this paper to reduce strength of reflective wave both at antenna end and excitation point. The numerical simulation results show the strength oi reflective wave is smaller than -55dB comparing with the driving wave when the methods are adopted.     

A detection strategy of multi-pose face in compressed domain

In this paper, we present a strategy to implement multi pose face detection in compressed domain. The strategy extracts firstly feature vectors from DCT domain, and then uses a boosting algorithm to build classifiers to distinguish faces and non-faces. Moreover. to get more accurate results of the face detection, we present a kernel function and a linear combination to build incrementally the strong classifiers based on the weak classifiers. Through comparing and analyzing results of some experiments on the synthetic data and the natural data, we can get more satisfied results by the strong classifiers than by the weak classifies.     

Application and realization of hierarchical network planning based on Web

Making use of Microsoft Visual Studio. NET platform, hierarchical network planning is realized in working procedure time-optimization of the construction by TBM. and hierarchical network graph of the construction by TBM is drawn based on browser. Then the theory of system realization is discussed, six components of system that can be reused are explained emphatically. The realization of hierarchical network panning in Internet provides available guarantee for controlling rate of progress in large-scale or middle-sized projects.     

Query through heterogeneous ontologies using association matrix

This paper introduces the definition and calculation of the association matrix between ontologies, h uses the association matrix to describe the relations between concepls ill different ontologics and uses concept vectors to represent queries; then computes the vectors with the association matrix in order to rewrite queries, This paper proposes a simple method of querying through heterogeneous Ontology using association matrix. This method is based on the correctness of approximate information filtering theory; and it is simple to be implemented and expected to run quite fast.     

Constructing three-dimension space graph for outlier detection algorithms in data mining

Outlier detection has very important applied value in data mining literature. Different outlier detection algorithms based on distinct theories have different definitions and mining processes. The three-dimensional space graph for constructing applied algorithms and an improved GridOf algorithm were proposed in terms of analyzing the existing outlier detection algorithms from criterion and theory.     

CFSBC： Clustering in High-Dimensional Space Based on Closed Frequent Item Set

Clustering in high-dimensional space is an important domain in data mining. It is the process of discovering groups in a high-dimensional dataset, in such way, that the similarity between the elements of the same cluster is maximum and between different clusters is minimal. Many clustering algorithms are not applicable to high dimensional space for its sparseness and decline properties. Dimensionality reduction is an effective method to solve this problem. The paper proposes a novel clustering algorithm CFSBC based onclosed frequent hemsets derived from association rule mining. which can get the clustering attributes with high efficiency. The algorithm has several advantages. First, it deals effectively with the problem of dimensionality reduction. Second, it is applicable to different kinds of attributes, Third, it is suitable for very large data sets. Experiment shows that the proposed algorithm is effective and efficient     

Integrated semantic similarity model based on ontology

To solve the problem of the inadequacy of semantic processing in the intelligent question answering system. an integrated semantic similarity model which calculates the semantic similarity using the geometric distance and informarion content is presented in this paper. With the help of interrelationship between concepts, the information content ofconcepts and the strength of the edges in the ontology network. we can calculate the semantic similarity between two concepts and provide information for the further calculation of the semantic similarity between user‘s question and answers in knowlegdge base. The results of the experiments on the prototype have shown that the semantic problem in natural language processing can also be solved with the help of the knowledge and the abundant semantic information in ontology. More than 90% accuracy with less than 50 ms average searching time in the intelligent question answering prototype system based on ontology has been reached. The result is vety satisfied.