Local Extrema of Periodic Function＇s Wavelet Transform

The theory of detecling ridges in the modulus of the continuous wavelet transform is presented as well as reconstructing signal by using information on ridges,To periodic signal we suppose Morlet wavelet as basic wavelet, and research the local extreme point and extrema of the wavelet transform on periodic function for the collection of signal＇ s instantaneous amplitude and period.     

Singularity detecting with the second generation wavelet

Adopting the lifting scheme, introduced by Sweldens, a new wavelet is constructed. It overcomes the shortcoming of the classical wavelets that has no flexibility in the number of vanishing moment. Two examples are given to prove the second-generation wavelets‘s potentialities in the singularity detection of signal: a wavelet with vanishing moment and symmetry can be constructed according to the problem.     

The Real-Time Image Processing Technique Based on DSP

This paper proposes a novel real time image processing technique based on digital singnal processor （DSP）. At the aspect of wavelet transform（WT） algorithm, the technique uses algorithm of second generation wavelet transform lifting scheme WT that has low calculation complexity property for the 2 D image data processing. Since the processing effect of lifting scheme WT for I D data is better than the effect of it for 2 D data obviously, this paper proposes a reformative processing method： Transform 2-D image data to 1 D data sequence by linearization method, then process the 1 D data sequence by algorithm of lifting scheme WT. The method changes the image convolution mode, which based on the cross filtering of rows and columns. At the aspect of hardware realization, the technique optimizes the program structure of DSP to exert the operation power with the iwchip memorizer of DSP. The experiment results show that the real time image processing techniquc proposed in this paper can meet the real-time requirement of videoimage transmitting in the video surveillance system of electric power. So the technique is a feasible and efficient DSP solution.     

A Novel Digital Audio Watermarking Scheme in the Wavelet Domain

We present a novel quantization-based digital audio watermarking scheme in wavelet domain. By quantizing a host audio‘s wavelet coefficients (Integer Lifting Wavelet Transform ) and utilizing the characteristics of human auditory system ( HAS), the gray image is embedded using our watermarking method. Experimental results show that the proposed watermarking scheme is inaudible and robust against various signal processing such as noising adding, lossy compression, low pass filtering, re-sampling, and re-quantifying.     

Time-Based Dynamic Trust Model Using Ant Colony Algorithm

The trust in distributed environment is uncertain, which is variation for various factors. This paper introduces TDTM, a model for time-based dynamic trust. Every entity in the distribute environment is endowed with a trust-vector, which figures the trust intensity between this entity and the others. The trust intensity is dynamic due to the time and the inter-operation between two entities, a method is proposed to quantify this change based on the mind of ant colony algorithm and then an algorithm for the transfer of trust relation is also proposed. Furthermore, this paper analyses the influence to the trust intensity among all entities that is aroused by the change of trust intensity between the two entities, and presents an algorithm to resolve the problem. Finally, we show the process of the trusts＇ change that is aroused by the time＇s lapse and the inter-operation through an instance.     

Implementation of texture based image retrieval using<Emphasis Type="Italic">M</Emphasis>-band wavelet transform

Wavelet transform has attracted attention because it is a very useful tool for signal analyzing. As a fundamental characteristic of an image, texture traits play an important role in the human vision system for recognition and interpretation of images. The paper presents an approach to implement texture-based image retrieval usingM-band wavelet transform. Firstly the traditional 2-band wavelet is extended toM-band wavelet transform. Then the wavelet moments are computed byM-band wavelet coefficients in the wavelet domain. The set of wavelet moments forms the feature vector related to the texture distribution of each wavelet images. The distances between the feature vectors describe the similarities of different images. The experimental result shows that theM-band wavelet moment features of the images are effective for image indexing. The retrieval method has lower computational complexity, yet it is capable of giving better retrieval performance for a given medical image database. Foundation item: Supported by the National Natural Science Foundation of China (69983005) Biography: Liao Ya-li(1979-), female, Master candidate, research direction: distributed network communication and multimedia information processing.     

Applying evolutionary algorithm to public key cryptosystems

A best algorithm generated scheme is proposed in the paper by making use of the thought of evolutionary algorithm, which can generate dynamically the best algorithm of generating primes in RSA cryptography under different conditions. Taking into account the factors of time, space and security integrated, this scheme possessed strong practicability. The paper also proposed a model of multi-degree parallel evolutionary algorithm to evaluate synthetically the efficiency and security of the public key cryptography. The model contributes to designing public key cryptography system too. Foundation item: Supported by the Hi-Tech Research and Development Foundation item: Supported by the Hi-Tech Research and Development Biography; Tu Hang (1975-), male, Ph. D candidate, research directions: Biography; Tu Hang (1975-), male, Ph. D candidate, research directions:     

基于遗传算法的最优小波滤波器构造

本文基于遗传算法对小波滤波器的构造方法进行了研究 ,重点在于解决对图象进行压缩处理所需要的最优小波滤波器的构造 .有效的染色体编码方案和适应值函数以及遗传算法的全局寻优性能 ,使得该方法在处理图象压缩优化问题上有其独特的优点     

A two-level subspace evolutionary algorithm for solving multi-modal function optimization problems

In this paper, a new algorithm for solving multimodal function optimization problems-two-level subspace evolutionary algorithm is proposed. In the first level, the improved GT algorithm is used to do global recombination search so that the whole population can be separated into several niches according to the position of solutions; then, in the second level, the niche evolutionary strategy is used for local search in the subspaces gotten in the first level till solutions of the problem are found. The new algorithm has been tested on some hard problems and some good results are obtained. Foundation item: Supported by the National Natural Science Foundation of China (70071042, 60073043, 60133010). Biography: Li Yan( 1974-), female, Ph. D candidate, research interest: evolutionary computation.     

Parallel implementations of modeling

First, an asynchronous distributed parallel evolutionary modeling algorithm (PEMA) for building the model of system of ordinary differential equations for dynamical systems is proposed in this paper. Then a series of parallel experiments have been conducted to systematically test the influence of some important parallel control parameters on the performance of the algorithm. A lot of experimental results are obtained and we make some analysis and explanations to them. Foundation item: Supported by the National Natural Science Foundation of China (60133010, 70071042, 60073043) Biography: Cao Hong-qing ( 1972-), female, Associate professor, research direction; evolutionary computing, parallel computing.     

A new algorithm for routing in ad-hoc network

In this paper, we propose a new algorithm for wireless mobile and ad-hoc network, which establishes dynamic cluster of nodes. The proposed algorithm, namely, the Mobility Sensitive Routing Protocol (MSRP), consists of routing in cluster and routing between clusters. Ad-hoc network can utilize MSRP to reduce information exchange and communication bandwidth, to shorten route acquisition delay, and to accommodate more nodes. Foundation item: Supported by the National Natural Science Foundation of China (60133010,60073043,70071042). Biography: Zhang Jian (1976-), male, Ph. D candidate. Lecturer, research direction: computer network, network optimization.     

A Fast Interactive Sequential Pattern Mining Algorithm

In order to reduce the computational and spatial complexity in rerunning algorithm of sequential patterns query, this paper proposes sequential patterns based and projection database based algorithm for fast interactive sequential patterns mining algorithm （FISP）, in which the number of frequent items of the projection databases constructed by the correct mining which based on the previously mined sequences has been reduced. Furthermore, the algorithm＇s iterative running times are reduced greatly by using global-threshold. The results of experiments testify that FISP outperforms PrefixSpan in interactive mining     

基于小波域相干边沿检测器的脉冲序列检测与定位算法 

摘要：
利用小波变换技术研究了雷达 通信共存系统中脉冲信号的有效检测与定位方法.基于小波变换的能量集中特性和脉冲边沿的小波变换系数在小波滤波器支撑集中高度相关的特性,提出了小波域相干边沿检测器,其判决统计量为小波变换系数在不同时延上的自相关值之和.导出了该判决统计量的统计特性与最优求和长度,并提出了基于小波域相干边沿检测器的脉冲信号的有效检测与定位方法.仿真结果表明了基于小波域相干边沿检测的脉冲信号检测与定位方法优于已有方法.     

Stable initialization scheme for K -means clustering

Though K-means is very popular for general clustering, its performance which generally converges to numerous local minima depends highly on initial cluster centers. In this paper a novel initialization scheme to select initial cluster centers for K-means clustering is proposed. This algorithm is based on reverse nearest neighbor (RNN) search which retrieves all points in a given data set whose nearest neighbor is a given query point. The initial cluster centers computed using this methodology are found to be very close to the desired cluster centers for iterative clustering algorithms. This procedure is applicable to clustering algorithms for continuous data. The application of proposed algorithm to K-means clustering algorithm is demonstrated. Experiment is carried out on several popular datasets and the results show the advantages of the proposed method. Foundation item: Supported by the National Natural Science Foundation of China (60503020, 60503033, 60703086), the Natural Science Foundation of Jiangsu Province (BK2006094), the Opening Foundation of Jiangsu Key Laboratory of Computer Information Processing Technology in Soochow University (KJS0714) and the Research Foundation of Nanjing University of Posts and Telecommunications (NY207052, NY207082)     

Public Key Cryptography Based on Ergodic Matrices over Finite Field

A new public key encryption scheme is proposed in this paper, which is based on a hard problem over ergodic matrices. The security of this scheme is equal to the MQ-problem： multivariate quadratic equations over finite fields. This problem has been shown to be NP-complete and can＇t be solved with polynomial time algorithm.     

Verifiable （ t, n） Threshold Signature Scheme Based on Elliptic Curve

Based on the difficulty of solving the ECDLP (elliptic curve discrete logarithm problem) on the finite field, we present a (t, n) threshold signature scheme and a verifiable key agreement scheme without trusted party. Applying a modified elliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA (ellipticcurve digital signature algorithm) from the computability and security view. Our scheme has a shorter key, faster computation, and better security.     

]Modeling dynamic systems by using the nonlinear difference equations based on genetic programming

When acquaintances of a model are little or the model is too complicate to build by using traditional time series methods, it is convenient for us to take advantage of genetic programming (GP) to build the model. Considering the complexity of nonlinear dynamic systems, this paper proposes modeling dynamic systems by using the nonlinear difference equation based on GP technique. First it gives the method, criteria and evaluation of modeling. Then it describes the modeling algorithm using GP. Finally two typical examples of time series are used to perform the numerical experiments. The result shows that this algorithm can successfully establish the difference equation model of dynamic systems and its predictive result is also satisfactory. Foundation item: Supported by Foundation for University Key Teacher by the Ministry of Education of China Biography: Liu Min ( 1978-), female, Master candidate, research derection: application mathematics.     

Incremental Web Usage Mining Based on Active Ant Colony Clustering

To alleviate the scalability problem caused by the increasing Web using and changing users＇ interests, this paper presents a novel Web Usage Mining algorithm-Incremental Web Usage Mining algorithm based on Active Ant Colony Clustering. Firstly, an active movement strategy about direction selection and speed, different with the positive strategy employed by other Ant Colony Clustering algorithms, is proposed to construct an Active Ant Colony Clustering algorithm, which avoid the idle and ＂flying over the plane＂ moving phenomenon, effectively improve the quality and speed of clustering on large dataset. Then a mechanism of decomposing clusters based on above methods is introduced to form new clusters when users＇ interests change. Empirical studies on a real Web dataset show the active ant colony clustering algorithm has better performance than the previous algorithms, and the incremental approach based on the proposed mechanism can efficiently implement incremental Web usage mining.     

A Fast Distributed Algorithm for Association Rule Mining Based on Binary Coding Mapping Relation

Association rule mining is an important issue in data mining. The paper proposed an binary system based method to generate candidate frequent itemsets and corresponding supporting counts efficiently, which needs only some operations such as ＂and＂, ＂or＂ and ＂xor＂. Applying this idea in the existed distributed association rule mining al gorithm FDM, the improved algorithm BFDM is proposed. The theoretical analysis and experiment testify that BFDM is effective and efficient.     

Solving a kind of high complexity multi-objective problems by a fast algorithm

A fast algorithm is proposed to solve a kind of high complexity multi-objective problems in this paper. It takes advantages of both the orthogonal design method to search evenly, and the statistical optimal method to speed up the computation. It is very suitable for solving high complexity problems, and quickly yields solutions which converge to the Pareto-optimal set with high precision and uniform distribution. Some complicated multi-objective problems are solved by the algorithm and the results show that the algorithm is not only fast but also superior to other MOGAS and MOEAs, such as the currently efficient algorithm SPEA, in terms of the precision, quantity and distribution of solutions. Foundation item: Supported by the National Natural Science Foundation of China (60204001, 70071042, 60073043, 60133010) and Youth Chengguang Project of Science and Technology of Wuhan City (20025001002). Biography: Zeng San-you ( 1963-), male, Associate professor, research direction: evolutionary computing, parallel computing