Table of Content

01 July 2006, Volume 26 Issue 7

Previous Issue    Next Issue

Articles

Integrated software quality evaluation model based on fuzzy analytic hierarchy process

2006, 26(7):  1497-1500. 

Asbtract ( )   PDF (785KB) ( )  

Related Articles | Metrics

An integrated software quality evaluation model combining software quality model with software quality evaluation model was proposed. Model transformation methods were adopted to translate this model to a Fuzzy Analytic Hierarchy Process (FAHP) model in order to gain a better evaluation result. Finally, an example was presented to prove the correctness and operability of the model.

Software management model based on negative feedback model

2006, 26(7):  1500-1502. 

Asbtract ( )   PDF (509KB) ( )  

Related Articles | Metrics

A method for modeling software process using close loop control system analysis was proposed. The model formalized the characteristics of every different phases in developing process according to key practicearea measurement value and its weight. Compared with the threshold value set before, it guided the process of software development, and ensured software quality.

Research on knowledgebased intelligent testing integration technology

2006, 26(7):  1503-1506. 

Asbtract ( )   PDF (782KB) ( )  

Related Articles | Metrics

A new testing integration technology, ITIT (Intelligent Testing Integration Technology), was introduced. ITIT, supported by related reasoning theories and many kinds of knowledge, can efficiently integrate many testing techniques into software testing process so as to improve the total testing effect and reduce defect rate.

Research on key problems in data integration system

2006, 26(7):  1507-1510. 

Asbtract ( )   PDF (1111KB) ( )  

Related Articles | Metrics

The notion of data integration was introduced and the aim of building data integration systems was presented. Some key problems in building data integration system were explained. They were building semantic relation， query rewriting， query optimizing and executing. Current researches on these problems were described in detail， and some thoughts for resolving them were proposed.

Model integration of legacy systems based on patterns reusing

ZhaoJun Yang

2006, 26(7):  1511-1513. 

Asbtract ( )   PDF (663KB) ( )  

Related Articles | Metrics

A new method of using patterns reusing to integrate models of enterprise legacy systems was proposed. The process of legacy systems integration was introduced. A case was used to explain how to use patterns. At last, some practicable solutions for existing problems in model integration of legacy systems were given.

Study of Integrity Detection for Migrating Instance Based on Biology Immune

2006, 26(7):  1514-1516. 

Asbtract ( )   PDF (802KB) ( )  

Related Articles | Metrics

The mobility of migrating instance brings more security risk to workflow management system. Aiming at the integrity problem of migrating instance, an immune entity for migrating instance based on biology immune theory was proposed. Its selfdetecting mechanism for migrating instance integrity was given. Some key techniques, such as the structure of immune entity, the detecting process, and the analysis of important parameters, were discussed.

Study of migrating workflow service model based on ontology

2006, 26(7):  1517-1519. 

Asbtract ( )   PDF (564KB) ( )  

Related Articles | Metrics

According to the sharing characteristic of the service semantic in the migrating workflow system, a migrating workflow service model based on ontology was proposed. The model provided uniform workflow service semantic for migrating instance and workstations using workflow metaontology. Then it organized migrating workflow service by service ontology to realize service discovery. The model realized the semantic sharing between migrating instance and workstations in a better way.

Multiversion twophase locking protocol based on extended compatibility locking

2006, 26(7):  1520-1522. 

Asbtract ( )   PDF (814KB) ( )  

Related Articles | Metrics

The defects of current distributed concurrency control protocol were analyzed. Then， a multiversion twophrase locking protocol was proposed based on ordered sharing, and the correctness of this protocol was proofed. The analysis results show that the protocol can enhance the concurrency of cooperative design transaction and is suitable for open cooperative design environment.

Reverse analysis of Microsoft intermediate language

2006, 26(7):  1523-1525. 

Asbtract ( )   PDF (574KB) ( )  

Related Articles | Metrics

Microsoft intermediate language(MSIL) was compared with existing assembly language. Then several algorithms that could be applied to identify building block of high level language were presented, such as variables, expressions, and statements. Analysis results are given to prove the correctness of algorithms.

Research and Implementation of CORBA/SOAP interoperation

ChunLi Mao

2006, 26(7):  1526-1528. 

Asbtract ( )   PDF (666KB) ( )  

Related Articles | Metrics

The interoperation of existing middleware technologies such as CORBA and the emerging Web services is necessary to implement new， valueadded services. Two key issues needed to be solved is how to transform IDL of CORBA object to WSDL of Web Services automatically and efficiently and how to enable Web access to services built using CORBA without changing the original programming mode. The design and implementation of the two issues were put forward.

Research on the intelligence of Web Services container based on Agent

2006, 26(7):  1529-1531. 

Asbtract ( )   PDF (540KB) ( )  

Related Articles | Metrics

An Intelligent Web Services Container(IWSC) based on agent was put forward. Its software architecture was given. Based on IWSC, a mechanism of dynamic combination of Web Services was discussed. The simulation of ordering books based on IWSC indicates that IWSC has evident advantage on the intelligent dynamic combination of Web Services compared with similar Web Services containers.

Neighborhood reservation with inband signaling system in Ad Hoc networks

2006, 26(7):  1532-1535. 

Asbtract ( )   PDF (831KB) ( )  

Related Articles | Metrics

A crosslayer neighborhood reservation mechanism with inband signaling system (called NRINSIGNIA) for Ad Hoc networks was proposed, considering the impact of channel contention at MAC layer. When a node reserved bandwidth for a QoS flow， corresponding bandwidth reservation would be reserved at all its neighboring nodes simultaneously to eliminate the negative impact on bandwidth reservation caused by channel contention. This crosslayer neighborhood reservation mechanism can provide a certain guarantee for the QoS bandwidth reservation. Compared with the original INSIGNIA without neighborhood reservation， simulation results show that NRINSIGNIA system can significantly improve the reserved packet ratio， packet delivery ratio and endtoend delay of QoS flows.

Research on the reliable data transmission mechanism for SUNA

2006, 26(7):  1536-1538. 

Asbtract ( )   PDF (618KB) ( )  

Related Articles | Metrics

Service Unit based Network Arthitecture(SUNA) uses endtoend Virtual Circuit (VC) structure to transmit data. In order to guarantee reliable data transmission for SUNA， an improved sliding window protocol was proposed. Colored Petri Net(CPN) was used to verify the dependability and maturity of this mechanism.

Scheduling algorithm for precision delay bounds

2006, 26(7):  1539-1541. 

Asbtract ( )   PDF (790KB) ( )  

Related Articles | Metrics

The scheduling algorithms based on Earliest Deadline First (EDF) have best controlcapability of delay bounds in packet switch network. Most of variants of EDF concentrate the guarantee of upper delay bounds. For the terminals with poor buffer resources, lower delay bounds also need to be provided by network. A new algorithm, PDEDF, based on some improved EDF algorithms was proposed to provide precision delay bounds. This new algorithm empowers any node to decide the buffer size for data streams independently and improves the data transmitting efficiency of node by increasing the scope of value ε.

Minimum energy node-disjoint multipath routing based on correlation factor in Ad Hoc networks

2006, 26(7):  1542-1545. 

Asbtract ( )   PDF (762KB) ( )  

Related Articles | Metrics

The energy of network nodes is supplied by battery, once exhausted can not charge up, therefore, energy management is an important aspect for Ad hoc network. Although using multipath routing can reduce energy consumption, the wireless multicast brings about serious collision problem, even if nodedisjoint multipath. A minimum energy nodedisjoint multipath routing algorithm was put forward based on correlation factor. In this algorithm, correlation factor was introduced to weigh the collision probability between nodedisjoint multipath when transmitting data simultaneously, then a upper limit for correlation factor was calculated according to service requirements, finally a minimum energy nodedisjoint multipath routing was found to satisfy the limit. The simulation results show that the algorithm can obviously reduce the packet loss rate, and doesnt add energy consumption or prolong the time of finding routing compared to pure minimum energy algorithm STPS(Source Transmit Power Selection Algorithm).

Parlaybased stateaware communication service technology and its implementation

2006, 26(7):  1546-1548. 

Asbtract ( )   PDF (634KB) ( )  

Related Articles | Metrics

Based on the development of information techniques and the requirements of integrated information services, the concept of stateaware communication service, a new NGN service, was proposed. It integrated contextaware technology with converged network communication technology. The pervasive computingbased network layer stateaware technology and the Parlay API based application layer stateaware technology were discussed. Then the Stateaware Communication System (SaCS) architecture and control flow were presented. Finally an application example was presented, which integrated the stateaware techniques at both layers.

Policy routing based on connection tracking information in NAT

2006, 26(7):  1549-1551. 

Asbtract ( )   PDF (571KB) ( )  

Related Articles | Metrics

In order to solve the multioutgoing campus networks routing problem in Network Address Translation(NAT)， a policy routing scheme based on connection tracking information was proposed. A series of tests for this scheme were carried out through twooutgoingroute testbed， and its correctness and feasibility were confirmed.

Solution for routing and wavelength assignment problems based on simulated annealing genetic algorithm

2006, 26(7):  1552-1553. 

Asbtract ( )   PDF (580KB) ( )  

Related Articles | Metrics

Static Routing and Wavelength Assignment (RWA) problems is an important issue for Wavelength Division Multiplexing (WDM) optical networks. In the present practice, such an issue is divided into two minor issues - routing and wavelength assignment. The issue can be solved by determining the light path sequence in some way firstly, then using heuristic algorithm to solve the wavelength assignment problem. The simulated annealing genetic algorithm was adopted to optimize the light path sequence, and the heuristic algorithm based on hill climbing algorithm was used to solve the static RWA problem which aimed at minimizing the number of wavelengths. By emulating five optical networks, such as ARPAnet, it indicates that the proposed algorithm uses fewer wavelengths than the reference[5] does, and obtains the optimization results in most cases.

Sensor deployment algorithm based on virtual rhomb grid

2006, 26(7):  1554-1556. 

Asbtract ( )   PDF (489KB) ( )  

Related Articles | Metrics

The sensor deployment is either deterministic or selforganizing. Analyzing the relationships between both of the deployments, a Virtual Rhomb Gridbased Sensor Deployment(VRGSD) algorithm was proposed. The algorithm integrated both deterministic and selforganizing deployments in a unified framework. It (1) can form a MCDS(minimum connected dominating set); (2) ensures that there are no "holes" in the sensor field; (3) gains an advantage over VFA (Virtual Force Algorithm) for performance and effectiveness; (4) can select different coverage degree of sensing or connectivity for different applications. The flexibility of (4) allows the network to selfconfigure for a wide range of applications.

A novel IP packet classification algorithm based on hierarchical intelligent cuttings

Lei Yu

2006, 26(7):  1557-1559. 

Asbtract ( )   PDF (718KB) ( )  

Related Articles | Metrics

Since confliction exists in rule database, non-conflict rule database is created at first. Based on Hierarchical Intelligent Cuttings algorithm and non-conflict function,　a novel IP packet classification named HICNCH( the algorithm based on Hierarchical Intelligent Cuttings and Non-Collision Hash) is proposed. Also the least square method is proposed to improve the rule of cutting tree and cutting efficiency is improved greatly. Compared with other classic algorithm, our algorithm has lower time and space cost. The comprehensive performance has been improved a lot.

Design and implementation of multilayer Ad hoc network evaluation system

2006, 26(7):  1560-1562. 

Asbtract ( )   PDF (655KB) ( )  

Related Articles | Metrics

Most of current Ad hoc platforms are based on Linux/Unix, which only support few protocols and complicated to control. A Windowsbased multilayer Ad hoc evaluation system was designed. This system supports protocols modeling and testing on several layers and has simplified controlling scheme.

Performance improvement of TCP over satellite link based on the express transport protocol

2006, 26(7):  1563-1566. 

Asbtract ( )   PDF (828KB) ( )  

Related Articles | Metrics

In the network applications over satellite communication system， the TCP performance over satellite link is poor. The splitting TCP mechanism， which is widely applied， can improve the endtoend performance of TCP. How to choose transport protocol for satellite link determines the performance of whole mechanism. The eXpress Transport Protocol (XTP)， adopted in wire network， is a high speed transport protocol. After deep research for the protocol, it was found that XTP could be applicable to satellite communication. So XTP was proposed to be adopted as transport protocol on satellite link in splitting TCP mechanism. Experiment results show that the proposal can significantly improve the TCP performance over satellite link.

Graphics and image processing

Image interpolation method based on structure tensor

2006, 26(7):  1570-1572. 

Asbtract ( )   PDF (934KB) ( )  

Related Articles | Metrics

An efficient method for image interpolation was presented， in which geometric features described by the local structure tensor were exploited to enhance the sharpness of edges without incurring any additional artifacts. Simulation results show that the proposed approach exhibited better performance than the standard linear interpolation， particularly in the edge regions. The implementation has low complexity and it is well suited for realtime applications. In addition， the relationship between the method and an interpolation scheme based on variational models presented in previous work was also discussed and further analysis shows that the latter is a special case of our algorithm.

Multi-bit-plane parallel algorithm for integer square zerotree wavelet coding

2006, 26(7):  1573-1576. 

Asbtract ( )   PDF (758KB) ( )  

Related Articles | Metrics

In order to solve the thresholdchoosing problem caused by combining integer wavelet transform with traditional Embedded Zerotree Wavelet coding(EZW), Integer Square Zerotree Wavelet coding (ISZW) algorithm was proposed. Since ISZW used successive integer squares as quantization thresholds, it shortened the distance between two consecutive thresholds, but increased coding times, thus reduced coding speed. To solve this problem, a parallel multibitplane coding algorithms for ISZW was presented, which required scanning each bitplane only once, so greatly improved the coding speed of ISZW.

A new edge extraction algorithm of active contour model for magnetic resonance imaging

2006, 26(7):  1577-1579. 

Asbtract ( )   PDF (1045KB) ( )  

Related Articles | Metrics

In order to extract the edge of the Magnetic Resonance Imaging(MRI) series, a new algorithm based on an improved active contour model was proposed. It modified some terms of the initial formula, which made the snake model not only precisely extract the edge of the protruding object in images but also approach to the concave part of the edge. It introduced exterior sanction energy, which could adaptively change its value to enlarge suction, so that control points could quickly constringe to the real contour without relying on the initial contour. Combined with pattern matching, this new method could increase the precision of transferring the result of edge extraction from one slice to another. Experiments show that this algorithm can obtain the edge of the desired object from a series of medical images faster and more accurately than before, and with only little user interaction.

A fast surface reconstruction algorithmbased on borderestimation for 3D unorganized points

2006, 26(7):  1581-1582. 

Asbtract ( )   PDF (685KB) ( )  

Related Articles | Metrics

A fast surface reconstruction algorithm based on Power Crust algorithm was proposed for 3D unorganized points. Power Crust algorithm can reconstruct good mesh but its running time is long. A nonuniform down sampling method with borderestimation was proposed to resample the input data set according to local feature before reconstruction. Some instances indicate that this algorithm greatly promots the speed of using scatter data points to finish surface reconstruction， and really reconstructs surface model.

Realtime correlation tracking algorithm based on cascade classifier

2006, 26(7):  1583-1586. 

Asbtract ( )   PDF (1255KB) ( )  

Related Articles | Metrics

A realtime correlation tracking algorithm was presented based on cascade classifier. Firstly， to improve the robustness of the method in complex background， the original input video sequence was transformed according to the color distribution of target template. Then the average differences of gray value and Harrlike features were designed to build a cascade classifier. The features in different levels represented the similarities between target template and searching window in various aspects like intensity distribution and gradient changes， so as to make full use of template information and greatly decrease the computational cost in false correlation position. Moreover， all features above were computed by integral image method. A realtime visual tracking system was developed and tested under various conditions. Extensive experiment results demonstrate that the proposed algorithm is effective， and the processing speed of the system reaches 20 fps for the image size of 320×240.

Skew detection for complex document image based on blank bar directional fitting

2006, 26(7):  1587-1589. 

Asbtract ( )   PDF (1004KB) ( )  

Related Articles | Metrics

An efficient skew detection algorithm was proposed for complex document image containing figure or form contents. The algorithm included three steps: Firstly, the text subregion was selected adaptively according to the feature that the edges contained in text regions was stronger than those in nontext regions; Secondly, the blank bars between two text lines were extracted by blank blocks searching; Thirdly, the skew angle of blank bar was calculated by directional fitting, and this skew angle was just the document skew angle. The experiment results show that this algorithm is insensitive to the circumstances such as scan background, document layout and line spacing, and the skew angle can be detected rapidly and accurately.

Multifocus image fusion based on contrast and neural network

2006, 26(7):  1590-1591. 

Asbtract ( )   PDF (775KB) ( )  

Related Articles | Metrics

A novel multifocus image fusion method using wavelet contrast and neural network was proposed. Firstly，source images were decomposed with Wavelet Transform (WT) and wavelet contrasts were obtained. Some of them were selected as samples for training feedforward neural network. Then，the wavelet coefficients of fused image though neural network were output and verified by consistency. Finally, the fused image was obtained with inverse WT. Experiment results show that the proposed method outperforms traditional WT method for multifocus image fusion.

Activity recognition method of multiple view angles from monocular videos

2006, 26(7):  1592-1594. 

Asbtract ( )   PDF (574KB) ( )  

Related Articles | Metrics

An activity recognition method of multiple view angles from monocular videos was introduced. To aim at recognition in uncalibrated videos， this method could solve the problem choosing a uniform activity characteristic sector of different view angles by utilizing 3D information included in 2D image sequence effectively and classifying human skeleton. The experiments show that it has good recognition rate for activity of different view angles from monocular videos.

Fast block matching algorithm based on subblock mean

Li Guo XingHua Sun

2006, 26(7):  1595-1597. 

Asbtract ( )   PDF (602KB) ( )  

Related Articles | Metrics

Integral image as an intermediate image representation can be used to calculate the sum of gray level in rectangle quickly. A novel partial matching error function was presented based on sub block mean. Experiments show that the matching error function based on subblock mean is superior to both the full matching error function and the matching error function based on sub sampling in terms of the motion estimation quality and speed. The matching error function based on subblock mean with the constant subblock division costs almost the same time to different matching images， which is very suitable for the realtime applications such as video compression.

Blind image deblurring with independent component analysis

2006, 26(7):  1598-1601. 

Asbtract ( )   PDF (1271KB) ( )  

Related Articles | Metrics

The relation between blind image deblurring and Independent Component Analysis (ICA) was demonstrated. Two ICA methods for image deblurring, FastICA algorithm and OnLine Stochastic Gradient (OLSG) algorithm, were compared. It was found that FastICA algorithm was less effective than OLSG algorithm for image deblurring. Experiment results show that blind image deblurring with ICA cannot depress the noise. In the end, the merits and defects of the method were concluded and the directions for further research were put forward.

Fingerprint skeletonization extraction based on improved principal graph algorithm

WenJie Fu

2006, 26(7):  1602-1604. 

Asbtract ( )   PDF (1086KB) ( )  

Related Articles | Metrics

The principal curve was used to describe and reflect the structure of fingerprint instead of the thinned fingerprint image as in the traditional fingerprint recognition system. And the principal graph algorithm was developed to get a better skeletonization of fingerprint. The experiment results show that the improved principal graph algorithm is better than the original algorithm in efficiency and quality. Compared with thinned fingerprint image, the new method is determined to be smoother, more accurate, and more antinoisy, and has more information quantity.

Color image segmentation algorithm based on mean shift

2006, 26(7):  1605-1606. 

Asbtract ( )   PDF (962KB) ( )  

Related Articles | Metrics

A color image segmentation algorithm based on mean shift was proposed. The basic principle of the mean shift algorithm under CIELUV color mode was demonstrated. The color image segmentation process methods were given. That is to select a pixel, find the mode in a given feature window and let the center of the window shift to the mode, repeat this operation until find a convergent mode, run this procedure for all the pixels and finally obtain the segmented image. Experiment results on two different color images show that the proposed algorithm can get excellent segmentation.

Rapid algorithm of template matching for face detection

2006, 26(7):  1607-1610. 

Asbtract ( )   PDF (777KB) ( )  

Related Articles | Metrics

In order to improve the speed of template matching in face detection, based on integral image, a square integral image was proposed and used to realize a rapid algorithm for calculating grayscale average and variance of image windows, and the calculating speed was independent on the windows size. With this rapid algorithm and transformation of some formulas, such as approximate formulas for computing grayscale distribution normalization, formulas for computing the correlation coefficient and average deviation, and leaving out some needless processes such as copying windows and conversion of windows grayscale value, the template matching was sped up greatly. Experiment results of face detection demonstrate the efficiency of this algorithm.

Retinex image enhancement method based on robust estimation

2006, 26(7):  1611-1613. 

Asbtract ( )   PDF (710KB) ( )  

Related Articles | Metrics

Because of failing to reconstruct piecewise constant illumination， variation Retinex method suffers from artificial halos and color distortion. A Retinex method based on robust estimation was proposed, which took shadow edges as outliers and smoothed range by range. Application of method to synthetic image and natural image proves that the improved method preserves high dynamic range compression and avoids halo effect and color distortion.

New method of contour initialization in GVF Snake model

2006, 26(7):  1614-1616. 

Asbtract ( )   PDF (856KB) ( )  

Related Articles | Metrics

A new method of contour initializaiton was proposed by analyzing the shortcomings of the huge waste of time and the failure of extracting some true contours in Gradient Vector Flow(GVF) Snake model. The multiscale edge detection based on wavelet transform could exactly distinguish all kinds of contours. The new contour initialization method based on wavelet transform could approach to the target boundaries. The experiment results show that this method reserves all the advantages of GVF Snake model and leads to the small searching range, decreased amount of GVF iteration and improvement of convergence speed.

Signal de-noising in wavelet based on new threshold function

2006, 26(7):  1617-1619. 

Asbtract ( )   PDF (515KB) ( )  

Related Articles | Metrics

A new threshold function based on the wavelet threshold denosing was presented. It overcame the shortcoming of the hard threshold with discontinuous function and solved the problem of the permanent bias in soft threshold function. At the same time, the new function didnt need to choose parameters. Simulation result indicates that the new threshold function is effective and predominant than other threshold functions.

Fast algorithm for integer 2DDCT based on polynomial transform

2006, 26(7):  1620-1622. 

Asbtract ( )   PDF (438KB) ( )  

Related Articles | Metrics

A polynomial transformbased fast algorithm for integer 2D Discrete Cosine Transform(2DDCT) was proposed. The 2DDCT was transformed to some 1DDCT and summing calculation by polynomial transform, so the computational complexity was reduced. The integer DCT was implemented by lifting matrix to promote efficiency, and the transformed signal could be reconstructed completely.

Information security

Security patch comparison techniques based on graph isomorphism theory

LiangHua Xu

2006, 26(7):  1623-1625. 

Asbtract ( )   PDF (833KB) ( )  

Related Articles | Metrics

The security patch comparison technology can effectively disclose the differences between two neighboring versions of the same source code file. First, the graphic instruction level and structural control flow level security patch comparison algorithms based on graph isomorphism theory were introduced; Then, the two security patch comparison methods were contrasted and analyzed; Finally, the technique of how to implement structural security patch comparison prototype system was presented, and the test results of prototype by using three Windows patches were given.

A new buyerseller watermarking protocol without the third party

2006, 26(7):  1626-1627. 

Asbtract ( )   PDF (570KB) ( )  

Related Articles | Metrics

A new buyerseller watermarking protocol without the third party was proposed, which used the idea of secret sharing and homomorphic public key cryptosystem. For a transaction, a piece of secret was produced by the buyer and the seller respectively, and the two pieces of secret were mixed into one secret in encrypted domain, which was embedded in a digital product as a watermark. The pirate tracing problem, the customers problem and other problems can be solved by this watermark protocol. Meanwhile, the conspiracy problem can be completely avoided because of no the third party.

Overview of Botnet

2006, 26(7):  1628-1630. 

Asbtract ( )   PDF (765KB) ( )  

Related Articles | Metrics

e attacker and are controled by it. The Botnet has become a tremendous threat of our Internet. The damage of the Botnet is very serious， because the number of PCs of the Botnet is very large. The definition，the history and the damage caused by the Botnet were described. Several methods for studying the Botnet were introduced and the measures to cope with it were given. The trends of the Botnet were analyzed briefly.

Cryptanalysis and improvement of a threshold proxy signature scheme

2006, 26(7):  1631-1633. 

Asbtract ( )   PDF (482KB) ( )  

Related Articles | Metrics

Through the cryptanalysis of a threshold proxy signature scheme based on bilinear pairings, it was found that the scheme couldnt resist forgery attack and publickey substitute attack. An improvement to mend the security leaks was proposed, which overcame the disadvantages and retained the merits of the original threshold proxy signature scheme.

Improvement of FengYuan nonrepudiable threshold proxy signature scheme

Qi Xie

2006, 26(7):  1634-1636. 

Asbtract ( )   PDF (484KB) ( )  

Related Articles | Metrics

FengYuan pointed out that Hsu et al.s threshold proxy signature scheme lacks of undeniability, and proposed an improvement scheme with nonrepudiation. A conspiracy attack on FengYuans improvement scheme shows that their scheme suffered from forgeability, unidentifiability and deniability. Furthermore, an improved scheme was presented to remedy the security weakness of FengYuans scheme.

Application of users abnormal behavior detection in security auditing system

2006, 26(7):  1637-1639. 

Asbtract ( )   PDF (835KB) ( )  

Related Articles | Metrics

A method for auditing users abnormal behavior based on data mining technology was proposed. Through preprocessing normal auditing data, some additional normal patterns were found. Then, users behavior profiles were discovered with association rules and sequence pattern mining methods. Users behavior could be further audited with these profiles. Simulation results show that this method is valid in real security auditing systems.

An anomaly intrusion detection algorithm based on semisupervised clustering

2006, 26(7):  1640-1642. 

Asbtract ( )   PDF (601KB) ( )  

Related Articles | Metrics

An anomaly intrusion detection algorithm based on semisupervised clustering along with knearest neighbor was presented. It could solve the problem of the insufficiency of training samples that the intrusion detection algorithms based on supervised learning face. The algorithm exploited minimal labeled data to improve its learning capability， and novelty detection could also be carried out. The experiment results manifest that the detection results of the algorithm precedes the one based on unsupervised learning remarkably， and approaches the one based on supervised learning while the labeled data are few.

Formal modeling of a kind of IDS and its detection technology

2006, 26(7):  1643-1645. 

Asbtract ( )   PDF (492KB) ( )  

Related Articles | Metrics

Apparently， applying formal specification to the procedure of developing an intrusion detection system can fulfill its security requirement and win the confidence of users. Taking an Distributed Denial of Service(DDoS) intrusion detection system as an example， how Z can be used to specify and model the securitycritical systems was illustrated.

A Model for Defending against DDoS Attacks based on Mobile-agent

2006, 26(7):  1646-1648. 

Asbtract ( )   PDF (622KB) ( )  

Related Articles | Metrics

The attack of Distributed Denial of Service (DDoS) has become one of the most harmful problems in network security, and much attention is given to the defense against it now. This paper proposes a model for defending against DDoS attacks based on mobile agent, using the technique of packet marking and mobile agent. This model can minimize the damage of the DDoS attacks in the ISP domain. The model also has a good anti-attack character by mobile agent’tolerant ability and the components can resist the DDoS attack too. Finally, the implement of the model is discussed.

A blind audio watermarking algorithm based on convolutional codes

2006, 26(7):  1649-1651. 

Asbtract ( )   PDF (549KB) ( )  

Related Articles | Metrics

A blind audio watermarking algorithm based on convolutional codes was proposed. The watermark was embedded in the lowmiddle frequency coefficients in lifting wavelet domain adaptively. In order to improve the ability to resist the disturbance, the watermark was processed by convolutional encoding and interleaving before embedding. In order to enhance the robustness, the watermarking detection algorithm which used Viterbi softdecision decoding was presented. The experiment results show that the performance of the proposed algorithm is good.

Study on digital image encryption algorithm based on 3D chaotic sequences

TaiYong Li

2006, 26(7):  1652-1654. 

Asbtract ( )   PDF (1045KB) ( )  

Related Articles | Metrics

Lorenz sequences were improved to be with ideal pseudorandomness. An image encryption algorithm was proposed, which scrambled the pixels and the spaces of the image with the improved Lorenz sequences. The simulation and analysis show that the algorithm has a large space of keys, good statistical characteristics, strong antinoise ability and high efficiency, and the encryption effect is greatly sensitive to the keys.

Database Technology

Optimizing strategies for computing multifeature cubes

2006, 26(7):  1655-1658. 

Asbtract ( )   PDF (1090KB) ( )  

Related Articles | Metrics

A multifeature cubes query (MFCubes) is a complex data mining query based on data cube, which aggregates on all of the 2n dependent granularities. There are some efficient algorithms proposed to solve distributive and algebraic MFCubes queries. Several strategies for holistic MFCubes queries were proposed：1) horizontal partition of data cube into smaller subcubes; 2) a new dynamic subset data selection strategy-Iceberg query; 3) classifying the aggregating functions and identifying the distributive ones, which could use the coarsefiner granularities computing property. These new strategies can simplify the computing complexity and optimize the process. Experiment results illustrate that it has the performance one time higher than the straightforward method.

Pruning based incremental construction of concept lattice

2006, 26(7):  1659-1661. 

Asbtract ( )   PDF (565KB) ( )  

Related Articles | Metrics

Concept lattice is the core data structure of formal concept analysis. However, with the sharp increasing of the data to deal with and analyze, its construction efficiency became the key problem. An incremental algorithm PCL of constructing concept lattice based on pruning was presented through eliminating the redundancy information in the construction process by pruning. It decreased the comparative amount of the intent of concept lattice and improved the efficiency of the concept lattices construction. The experiment results prove the correctness and validity of PCL by taking the celestial spectrum data as the formal context.

A directed tree based approachfor mining maximum frequent access patterns in Web logs

2006, 26(7):  1662-1665. 

Asbtract ( )   PDF (810KB) ( )  

Related Articles | Metrics

A novel Aprioribased algorithm named sTree was proposed for mining maximum frequent access patterns in Web logs. The main contributions of the novel algorithm were as follows. Firstly, the directed tree was used to represent the user session, which enabled us to mine the maximum forward reference transaction and the users preferred access path. Secondly, a novel method for counting supporting degree based on content first, which helped us to discover some more important and interesting patterns than normal methods. Thirdly, two special strategies were adopted to reduce the overhead of jointing frequent patterns. Experiment results show that the sTree algorithm is scalable, and is more efficient than previous graphbased structure pattern mining algorithms such as AGM(Aprioribased Graph Mining) and FSG(Frequent Subgraph Discovery).

Implementing algorithms of inheritance character in deductive objectoriented database SDDOOD

李素清

2006, 26(7):  1666-1668. 

Asbtract ( )   PDF (709KB) ( )  

Related Articles | Metrics

The framework of deductive objectoriented database SDDOOD system was introduced. Several inheritance methods which could be implemented in the system were presented. The algorithms of schema, instance and query relating to these methods were realized. The time complexities of these algorithms were analyzed. The experiment results show that these algorithms are feasible and efficient.

An algorithm on the data of uncompact and irregular distribution

2006, 26(7):  1669-1672. 

Asbtract ( )   PDF (746KB) ( )  

Related Articles | Metrics

Considering the difference of the use of clustering algorithms caused by the diffference of data distribution, on the base of the analysis of Kmeans algorithm, fuzzy Cmeans algorithm and genetic algorithm, a new algorithm was brought forward based on the genetic algorithm and the improved neighbor function criterion. In view of the intrinsic connection of the special and the advantage of genetic algorithms wholesearch strategy, to a certian extent, this new algorithm solve the problem about the uncompact and irregular data distribution.

Gridbased shared nearest neighbor clustering algorithm

2006, 26(7):  1673-1675. 

Asbtract ( )   PDF (739KB) ( )  

Related Articles | Metrics

A gridbased shared nearest neighbor clustering algorithm(GNN) was presented. The GNN removed some outliers or noises in the dataset by grid technique and disposed of density threshold of grid by density threshold method. The GNN clustered by the method of shared nearest neighbor and improved the efficiency by the use of the grid center. Scanning the dataset only once， the GNN can discover clusters of arbitrary shapes. The experiment results show that it can discover outliers or noises effectively and get good cluster quality.

Implementation of mobile data synchronization based on data replication technology

2006, 26(7):  1676-1678. 

Asbtract ( )   PDF (627KB) ( )  

Related Articles | Metrics

Data synchronization is becoming a new important technology in the mobile computing environment. Based on it， people can process and store data in various wireless devices or mobile devices. A mobile data synchronization system was designed and implemented. It used common synchronization protocol SyncML and was based on data replication technology.

Real-time XML data query process based on relational database

2006, 26(7):  1679-1681. 

Asbtract ( )   PDF (777KB) ( )  

Related Articles | Metrics

The more conservative approach of using traditional relational database engines was explored for processing XML documents conforming to Document Type Descriptors (DTDs). A set of data models, transform rules, and algorithm descriptions were proposed to implement a prototype system converting XML documents to relational tuples. It realized realtime query processing of XML data uniform.

Artificial intelligence

Multistage portfolio optimizationusing quantumbehaved partical swarm optimization

2006, 26(7):  1682-1685. 

Asbtract ( )   PDF (905KB) ( )  

Related Articles | Metrics

The method of decisionmaking in the field of multistage portfolio optimization using Quantumbehaved Partical Swarm Optimization(QPSO) was studied. Its objective function was to maximize ones economic utility or endofperiod wealth. How to use QPSO to find best portfolio according to objective function was introduced. By comparing the expect return and their variances that come from optimizing the allocation of cash and various stocks in the market of USA, QPSO algorithm with genetic algorithms was demonstrated superior to genetic algorithms.

Service composition model and implementation based on genetic programming

2006, 26(7):  1686-1688. 

Asbtract ( )   PDF (589KB) ( )  

Related Articles | Metrics

Based on the feature abstraction in semantic service, the elementary service can be abstracted as action rule unit (ARU). So, a services composition model based on action planning was proposed. In order to satisfy the functional and nonfunctional needs, a service matching algorithm based on genetic programming (GPSMA), was introduced by integrating with the variable and layered structure of genetic programming. The action rules among these ARU guide the planning process. Simulation results show that this algorithm exhibits some good performances such as findbest ability and efficiency in the selection space of associated service.

Parameter learning for Bayesian networks with large data set

2006, 26(7):  1689-1691. 

Asbtract ( )   PDF (561KB) ( )  

Related Articles | Metrics

The creation of Bayesian networks can be separated into two tasks， structure learning and parameter learning. Expectation Maximization（EM） algorithm is a general method for parameter learning to incomplete data. The traditional EM algorithm has some shortcomings: it cant deal with large data sets， its convergence is slow and it easily results in local maximum. To overcome these shortcomings, large data set was divided into several small blocks and optimized in the small ones. Experiment results indicate that the improved EM algorithm has more advantages than standard EM.

A new hybrid algorithm of ant colony system and genetic algorithm

2006, 26(7):  1692-1693. 

Asbtract ( )   PDF (504KB) ( )  

Related Articles | Metrics

A new hybrid algorithm combining ant colony system (ACS) with genetic algorithm (GA) was proposed. The proposed algorithm adds GA to ACS every generation. Making use of GAs advantage of whole quick convergence, ACS convergence speed was quickened. And GAs mutation mechanism improved the ability of ACS to avoid being premature. The simulation results show that the proposed algorithm finds optimum solutions effectively in time and quality.

Geneticalgorithmbased resolution on JobShop scheduling problem

2006, 26(7):  1694-1696. 

Asbtract ( )   PDF (478KB) ( )  

Related Articles | Metrics

The genetic algorithm and chromosome coding method for JobShop were discussed. The model for the genetic algorithm was constructed. The simulation result shows the effectiveness of this method.

An algorithm of load space sharing based on ant colony system

2006, 26(7):  1697-1699. 

Asbtract ( )   PDF (550KB) ( )  

Related Articles | Metrics

An improved ant colony system was presented, which aimed at the drawback of ant colony system in network load space sharing. The algorithm used multiple ant colony to tag in same network and ectohormone of different ant colony restrain each other however which of same ant colony promote. This algorithm carry out the load space sharing by decreasing the number of ant colonys ectohormone in shortest path. The feasibility of the algorithm is proved by experiment and the results are given.

A novel learning algorithm for RBF network based on Kalman filter and fuzzy control

2006, 26(7):  1700-1702. 

Asbtract ( )   PDF (695KB) ( )  

Related Articles | Metrics

A novel training algorithm for RBF(Radical Basis Function) networks was proposed based on extended Kalman filter and fuzzy control. The simulation results were presented on RBF networks as applied to the Iris classification problem. It is shown that the use of the extended Kalman filter and fuzzy control results in faster learning and higher precision of identification than conventional RBF networks.

Minimum distance classifier ensemble based on adaptive distance metric

2006, 26(7):  1703-1705. 

Asbtract ( )   PDF (544KB) ( )  

Related Articles | Metrics

A minimum distance classifier ensemble method based on adaptive distance metric was proposed. The training method of component classifier was given. Some training subsets were obtained via bootstrap technique, then the model about adaptive distance metric with the training subset was established. Each component classifier was trained independently using the model, then some component classifiers were obtained. After that, they were collected to make a decision according to the majority voting. Experiment results on UCI standard database show that the proposed ensemble method based on adaptive distance metric for minimum distance classifier is effective, and it is superior to other methods in classification performance.

Design and realization of parallel genetic algorithm based on JADE

2006, 26(7):  1706-1708. 

Asbtract ( )   PDF (699KB) ( )  

Related Articles | Metrics

For solving the problems of the traditional genetic algorithms, the excessively long runtime and the somewhat low rate of seeking the optimal results， a parallel genetic algorithm based on the cooperation of multiagents was presented， with utilization of JADE development platform. Based on simple genetic algorithms，this algorithm implemented the support for client container dynamic joining into the system to run. The experiment results show that the algorithm raises working efficiency of traditonal genetec algorithms and increases success rate to seek the optimal solution.

Data prediction in communication network using PBP predicting network

2006, 26(7):  1709-1712. 

Asbtract ( )   PDF (837KB) ( )  

Related Articles | Metrics

A data predicting model in communication network field called PBP was proposed. It was guided by time series analysis theory. BPL neural network modified from BP network was proposed to improve its generalization ability, precision and speed in data predicting applications. BPL was used as machine learning method in PBP model. PBP model could automatically leach abnormal data and get a most proper exponent. This model was tested for data predicting in CNET field and got a good result.

A twoway automatic intellectual match system model based on multiagent technology

2006, 26(7):  1713-1714. 

Asbtract ( )   PDF (636KB) ( )  

Related Articles | Metrics

The problem of twoway match of information in Internet was researched. A twoway automatic intellectual match model based on multiagent technology was given. Its framework, principle and procession were expounded, and the mechanism of cooperation among different agents and their fuzzy match of information was discussed. The towway intellectual match was realized exactly in searching information, and the future direction of its parallel researching was pointed out.

Typical applications

Design and research of flood control systembased on wireless application protocol

2006, 26(7):  1718-1720. 

Asbtract ( )   PDF (685KB) ( )  

Related Articles | Metrics

Considering the problems existed in flood control works such as information acquisition with a low speed and information acquisition limited by office condition, and the characteristics of flood control works. A flood control wireless information system based on Wireless Application Protocol(WAP) was designed and developed . It was a multiple interface system that user can access through WAP mobile phone, PDA and so on. It provided wireless information inquiry and retrieval, and realized the driving short message "push" service.

An integrated system for monitoring & scheduling power networks based on multiagent

Yong Wang

2006, 26(7):  1721-1723. 

Asbtract ( )   PDF (632KB) ( )  

Related Articles | Metrics

A monitoring and scheduling system of power networks was built based on multiagent. It monitored the realtime working statuses of huge various devices in power networks and supported to make scheduling decision according to the reliability computing. The multiagent architecture enforces the intelligent and expandable capability, and improves the monitoring efficiency and reliability of power networks.

Enterprise supply chain management model and simulation based on game

QuanMing Wang

2006, 26(7):  1724-1726. 

Asbtract ( )   PDF (512KB) ( )  

Related Articles | Metrics

An enterprise Supply Chain Management(SCM) model was designed and implemented. The design of the model and the implementation algorithm of models were described. The simulation result shows that the model can simply solve the problem of the optimum strategy in the condition of changing external demand, at this time the largest profit can be obtained, meanwhile, the state of whole SCM is optimum.

Design and implementation of bootloader based on arms3c44b0x

2006, 26(7):  1727-1729. 

Asbtract ( )   PDF (627KB) ( )  

Related Articles | Metrics

When transferring files between the different security domains, files are required to be only transferred from low security domain to high security domain. An unilateral transferring system was developed based on USB2.0 bus. It used USB2.0 interface device CY7C68013, DAULPORT RAM, and optical couplers insulation. The experiments verify that this system realizes unilateral, reliable and highspeed transmission.

Analysis and improvement of the bitflipping decoding algorithm for LDPC codes

2006, 26(7):  1730-1731. 

Asbtract ( )   PDF (623KB) ( )  

Related Articles | Metrics

According to the statistical decoding method, a new enlarged set of the low density check vectors was constructed by the linear combination among the vectors of the LDPC codes old check matrix. Combined with the analysis of the ParallelBitFlipping(PBF) decoding algorithm, such as loop detection technique, a new harddecision decoding algorithm was presented for LDPC codes. The simulation results show that our algorithm has small iterative numbers just like the PBF algorithm, and the decoding performance approaching the belief propagation algorithm.

Research and implementation of a high performance networkattached recorder server

zhenzhong huang

2006, 26(7):  1732-1734. 

Asbtract ( )   PDF (622KB) ( )  

Related Articles | Metrics

In order to meet the need of sharing network recorder， a new Networkattached Recorder Server(NRS) based on iSCSI protocol was designed. NRS combined virtual recorder technology with iSCSI protocol， realized the network transparent map of recorder， and improved the performance of the network share greatly. It adopted multithread and disc file buffer technology to share recorder of multiusers， and to short the response time of recorder. The design of NRS was described in detail， and the corresponding testing and performance analysis were carried out.

String matching algorithm research based on graphic processing unit

QingDan Zhang

2006, 26(7):  1735-1737. 

Asbtract ( )   PDF (569KB) ( )  

Related Articles | Metrics

BF algorithm is the basic algorithm in string matching field, but it is not parallel, and does not match the system architecture of the Graphic Processing Unit(GPU). Concerning the specific hardware architecture of the GPU, new method of data accessing and computing strategy of the parallel BF algorithm was designed. And by fully using the parallel capaticity of the GPU, the GPUbased algorithm can outperform the CPUbased algorithm. The bottlenecks of GPU architectures were also presented.

Components technology of reconfiguration supported ERP developing platform

2006, 26(7):  1738-1740. 

Asbtract ( )   PDF (842KB) ( )  

Related Articles | Metrics

Some important key techniques of the extraction, management, deployment and running of the components in the reconfiguration supported ERP(Enterprise Resource Planning) developing platform were studied, which including the definition of ERP components specification, classification and integrating methods. Compared with the classical J2EE architecture, the proposed method predigested and accelerated the development and application process of ERP system, implemented the reconfiguration based on components, and made the system more reliable, reusable, and transplantable.

Dynamic reconfigurable architecture based on FPGA

2006, 26(7):  1741-1743. 

Asbtract ( )   PDF (582KB) ( )  

Related Articles | Metrics

A kind of dynamic reconfigurable system architecture was put forward which was composed of a mainprocessorcoprocessor structure of the dynamic reconfigurable array coprocessor and LEON2 processor， saving and transforming data stream and configurationstream with registers and network. Experiments were made to verify the design.

Comparison of clustering methods based on Kohonen neural network in remote sensing classification

Chunping Liu

2006, 26(7):  1744-1746. 

Asbtract ( )   PDF (1143KB) ( )  

Related Articles | Metrics

Three kinds of clustering methods， including KCN (Kohonen Clustering Network)， FKCN (Fuzzy cMeans based Kohonen Clustering Network) and EPKCN (Evolutionary Programming based Kohonen Clustering Network) that were applied in the classification of remote sensing image， were discussed. Experiments show that these unsupervised learning methods had different characters in classifying land use/cover of remote sensing. To EPKCN， the vision effect of classification is best and the rate of single iteration is fastest; To FKCN， when the training process trends to convergence， the total training rate is fastest. However， taking into count the demand of land use/cover classification in remote sensing， EPKCN is the best one in these three algorithms, and can be applied in unsupervised classification of remote sensing land use/cover.

Research and implementation of long-distance medical treatment system based on P2P

2006, 26(7):  1747-1750. 

Asbtract ( )   PDF (812KB) ( )  

Related Articles | Metrics

A design scheme of longdistance medical treatment consultation system was designed and implemented on the Peer to Peer(P2P) Network. Information Exchange Protocol(IEP) was contrived to implement the audio or video session among peers based on JXTA protocol. The Content Management Service(CMS) in JXTA was used to share the files and download the content. Then longdistance medical treatment was implemented with IEP, by usage of RTP and RTCP, which transmitted the media stream.