Table of Content

01 June 2007, Volume 27 Issue 6

Previous Issue    Next Issue

Network and communications

Scheduling algorithms of forward link for CDMA2000 1xEV-DO system

2007, 27(6):  1293-1297. 

Asbtract ( )   PDF (1068KB) ( )  

Related Articles | Metrics

As the evolution of CDMA2000 that is one of the third generation mobile communication technologies, the CDMA2000 1xEV-DO mainly offers high-speed data service. It achieves great improvement of data throughput in the forward link through time-division multiplexing and opportunistic scheduling. This paper introduced the basic theory of the system and the model of forward link scheduling, then deeply analyzed various proposed scheduling algorithms on forward link in the past few years, and pointed out their respective advantages and disadvantages, finally outlined the further research emphasis of forward link scheduling.

Dynamically symmetrical area broadcast algorithm in Ad hoc network

2007, 27(6):  1298-1300. 

Asbtract ( )   PDF (526KB) ( )  

Related Articles | Metrics

Ad hoc network is of no stationary infrastructure, and the node acting as terminal and router can move freely. The dynamically symmetrical area algorithm was based on the probabilistic algorithm and the counter-based algorithm. According to the relative location between the neighboring node and the symmetrical point around the forwarding host and the distribution density of nodes in Ad Hoc network, we dynamically adjusted the rebroadcast probability. The simulation results under NS-2 were presented in the paper. The simulation results show that the algorithm gets higher saved rebroadcast and reachability than the probabilistic algorithm and the counter-based algorithm.

Research on an adaptive control algorithm with quality of service

2007, 27(6):  1301-1303. 

Asbtract ( )   PDF (614KB) ( )  

Related Articles | Metrics

A control algorithm of streaming video delivery with adaptive end-to-end Quality of Service （QoS） based on multiple object strategy was introduced. It adaptively adjusted video transmission rate and code rate according to simple multi-level Explicit Congestion Notification（ECN）-based mechanism to obtain a feedback from the network as well as end-users specific network bandwidth and device constraints. Simulation results demonstrate that the new algorithm has a good adaptation capacity against available bandwidth fluctuation.

Method for measuring end-to-end minimum packet delay based on simulation analysis

2007, 27(6):  1304-1305. 

Asbtract ( )   PDF (580KB) ( )  

Related Articles | Metrics

The end-to-end minimum packet delay is a basic metric that reflects the topology characteristic of an end-to-end path, and has been widely used in many network applications. However, there is less work on how to measure it. By means of network simulation, this paper quantitatively analyzed the measurability of end-to-end minimum packet delay under different path lengths; and a linear equation, which described the relation between probe packets number and the path length, was also built in this paper. Finally, a method for measuring minimum packet delay was proposed. Experiments on the Internet show that the method can get more accurate results with smaller measuring cost.

Capacity of a backbone wireless mesh network using directional antennas

Li-Ying HUANG Gang WEI Sheng-Ming JIANG

2007, 27(6):  1306-1309. 

Asbtract ( )   PDF (657KB) ( )  

Related Articles | Metrics

Directional antennas can improve spatial reuse of Wireless Mesh Setworks (WMNs) and affect the capacity of WMNs. Although some medium access control schemes, routing protocols and topology control methods of directional antennas have been recently proposed to improve the performance of WMN, it is still a need to analyze the capacity of WMNs deployed with directional antennas. This paper studied the capacity of a large backbone WMN using directional antennas by asymptotic analysis methods, investigated the effect of directional antennas on capacity and derived the upper bound of the per-router throughput. The results show that when the number of access points increases to some threshold, using directional antennas will improve the capacity of WMNs.

Improved scheduling algorithm for real-time uplink services in IEEE802.16e

2007, 27(6):  1310-1313. 

Asbtract ( )   PDF (801KB) ( )  

Related Articles | Metrics

In IEEE802.16e, Scheduling services represent the data handling mechanisms supported by the MAC scheduler for data transport on a connection. Each connection is associated with a single scheduling service. A scheduling service is determined by a set of QoS parameters that quantify its behaviors. Taking three types of scheduling services into consideration, UGS (Unsolicited Granted Scheduling), rtPS (real-time Polling Scheduling) and ertPS (extended real-time Polling Scheduling), this paper proposed a real-time uplink scheduling service algorithm irtPS (improved real-time Polling Scheduling). The proposed algorithm maximized the usage of uplink access resource and guaranteed data rate and delay requirement. Mathematical modeling and analysis results show that the throughput performance of the proposed algorithm is better than the algorithms in IEEE802.16e on the precondition of guaranteed delay performance.

Study of virtual private network based on layer two tunneling protocol

Shu ZHOU Wei PAN

2007, 27(6):  1314-1316. 

Asbtract ( )   PDF (734KB) ( )  

Related Articles | Metrics

We analyzed the layer two tunneling protocol (L2TP) and the virtual private network (VPN) based on the protocol, as well as the four modeling types of the VPN. In this article, we gave a general designing plan of VPN packet, and proposed an implementation of this VPN. Compared with other layer two VPNs, L2TP VPN can provide convenient and flexible applications.

Design and implementation of interception model in SIP network

2007, 27(6):  1317-1319. 

Asbtract ( )   PDF (657KB) ( )  

Related Articles | Metrics

According to the SIP network and its protocols characteristic, this article placed emphasis on how to implement interception work rapidly and effectively in Session Initiation Protocol （SIP） network. And on such basis, a design of network interception model was put forward as well as the implementation flow aiming at the target UAs communication. Both the design and the implementation above are exploratory. They are not only more flexible but also more convenient than the existing interception interfaces.

Research of SIP signaling compression algorithm based on LZSS in IMS

2007, 27(6):  1320-1322. 

Asbtract ( )   PDF (558KB) ( )  

Related Articles | Metrics

IMS was introduced into R5 core network by 3GPP, and 3GPP chose Session Initiation Protocol （SIP） as the call/session control Signa1ing. However, under the wireless circumstances, large SIP message becomes a bottleneck when SIP is used in IMS. Based on the SigComp, this paper compared various compression algorithms and chose LZSS as the basic algorithm to compress SIP according to the characteristics of messages. To further improve the compression ratio, the authors brought forward a new algorithm based on LZSS and Huffman combination and make simulation analysis of the results of several compression algorithms.

Sigmoid function-based layered multicast with intra-layer rate adjustment

2007, 27(6):  1323-1325. 

Asbtract ( )   PDF (766KB) ( )  

Related Articles | Metrics

Instead of re-layering and re-allocating sending rates, multi-rate multicast with intra-layer rate adjustment distributes layers sending rate into fixed intervals and adjusts the actual layers sending rate within its interval according to the selected delegate of the layer group. The synthesized probability formula based on sigmoid function was proposed for delegate selection. Two factors determine whether the current feedback receiver can be selected or not. One is the relative difference between feedback rate and current layer sending rate, the other is the approximate rate distribution of receivers within this layer group. Simulation results show that SFBLM can meet most of receivers demand within a layer group, and it is TCP friendly.

Study of passive communication based on time reversal

2007, 27(6):  1326-1329. 

Asbtract ( )   PDF (710KB) ( )  

Related Articles | Metrics

Time reversal is an unique self-focusing technique for spatial and temporal focusing of sound in unknown environments.Ocean is a complicated and changeable channel which may distort the signal and degrade the performance of communication system.Time reversal principle and its application to passive communication is introduced. The simulation result shows that this technology can reconstruct signal and erase intersymbol interference, so that the performance of communication system is improved.

Analysis of a self-organized network model based on two-dimensional cellular automaton

Zhengqiu He Jianmin He Yelin He

2007, 27(6):  1330-1333. 

Asbtract ( )   PDF (832KB) ( )  

Related Articles | Metrics

A self-organized network model based on two-dimensional cellular automaton was presented. We studied the critical characteristic and long-range dependence in the networks. Every cell in the model comprises one router and random number of hosts, and it can regulate the rate of packet release of the hosts according to the congestion state perceived by the cell. It is shown that under the control of the congestion-control-mechanism, the network is poised at critical state, although heterogeneity exists obviously in the nodes, the queue length of the nodes also exhibits strong spatial and temporal correlation.

Design and implementation of low-cost embedded interconnected system

2007, 27(6):  1334-1336. 

Asbtract ( )   PDF (603KB) ( )  

Related Articles | Metrics

To transform control system based on fieldbus to distributed control system based on Ethernet without changing the current network architecture, a low-cost embedded CAN-Ethernet Gateway was designed. The device was based on an ARM architecture microcontroller STR912FW44. STR912FW44, ARM966E-STM core, integrated Ethernet and CAN bus controller. Embedded TCP/IP protocol was used to implement the communication between STR912FW44 and devices in Ethernet. It can make the computer network based on TCP/IP protocol communicate with the field network based on the CAN Bus protocol. Test results show that the device, featuring with redundant capability, can complete the communication between nodes in the fieldbus and transmit data between fieldbus and Ethernet.

Articles

Pixel-level image modification authentication algorithm

2007, 27(6):  1337-1338. 

Asbtract ( )   PDF (684KB) ( )  

Related Articles | Metrics

A fragile watermarking algorithm used to authenticate the pixel-level modification to the image content was proposed, which can distinguish pixel points modified in image and tolerate transmission errors of individual authentication information bit in the process of image transmission. In this algorithm, authentication information was produced by extending more and more pixel points toward both left-right and up-down, which ensured the accurate location of individual juggled pixels resulting from some algorithms based on image uncertainty by combining surrounding pixels to determine the embedded watermarking bits. Authentication information was embedded after encryption to avoid most problems of security bugs caused by most pixel-based authentication algorithms.

Application of Online SVM in real-time intrusion detection

2007, 27(6):  1339-1342. 

Asbtract ( )   PDF (824KB) ( )  

Related Articles | Metrics

As a new classification method, Online Support Vector Machines (Online SVM) can offer superior classification performance for anomaly intrusion detection. The conventional SVM, Robust SVM and one-class SVM have been modified respectively based on the idea from Online SVM in this paper, and their performances have been compared with that of the original algorithms. After elaborate theoretical analysis, concrete experiments with 1999 DARPA data set collected at MITs Lincoln Labs were carried out. These experiments verify that the modified SVMs can be trained online and the results outperform the original ones with fewer Support Vectors (SVs) and less training time without decreasing detection accuracy in the presence of noise.

Authentication and key agreement protocol in mobile communication system

2007, 27(6):  1343-1344. 

Asbtract ( )   PDF (681KB) ( )  

Related Articles | Metrics

This paper proposes a new authentication and key agreement protocol which can realize mutual authentication and generate a secure session key agreed by both sides of communication. The protocol combines the symmetric with non-symmetric cryptography. Non-symmetric cryptography adopts Elliptic Curve Cryptosystem provided greater security with shorter keys. Performance analysis shows this protocol is more secure and efficient. Therefore, it is suitable for mobile communication system.

Information disguising for DEM data Via EMD

He Mi Luo Yong Cheng Lizhi Li Shengguo

2007, 27(6):  1345-1348. 

Asbtract ( )   PDF (905KB) ( )  

Related Articles | Metrics

A new information disguising method based on empirical mode decomposition was proposed in this paper. The pseudorandom sequence controlled by seeds of the SHA-256 one-way hash function was generated, and Digital Elevation Model （DEM） data for disguising was achieved by decomposing the expanded pseudorandom sequence via EMD. The high vision fraudulence was obtained for disguised DEM data. Furthermore, the concept of the generalized histogram for DEM data was also proposed and the watermarking was reversibly embedded in the disguised DEM data by modifying its generalized histogram. The disguised DEM data could be completely reconstructed without any distortion from the marked data after the watermark had been extracted. The secret DEM data could be recovered via the seed. The proposed algorithm is of high security.

Design and analysis of C2C-oriented and reputation-based trust model

2007, 27(6):  1349-1352. 

Asbtract ( )   PDF (992KB) ( )  

Related Articles | Metrics

Current trust models either use trust chain which cannot make the best of the recommendation information on the Web, or lack of analysis on the credibility of the recommendation information which can not deal with the hype and gossip in trust. Based on the models in existence we developed a new trust model that takes recommendation information by both long-term analysis and short-term analysis. It takes full advantage of the recommendation information and can effectively stand against the hype and gossip in trust. This model can help the users of C2C e-business system make better decision.

Distributed network intrusion detection system based on Netfilter

2007, 27(6):  1353-1355. 

Asbtract ( )   PDF (626KB) ( )  

Related Articles | Metrics

The processing speed of Network Intrusion Detection systems (NIDS) is still low compared with the speed of networks. As a result, few NIDS are applicable in a high-speed network. A distributed NIDS for high-speed networks was presented in this paper. The overall traffic was divided into small slices based on Netfilter, and the algorithm of load balancing was given to ensure that a single slice contained all the necessary evidence to detect a specific attack. The results of experiments show that the packets are almost equally scattered to all NIDS, and the percentage of missed rate declined to 1/4 of single NIDS.

Fine-grained protection domain model in a process and its implementation

hao huang

2007, 27(6):  1356-1359. 

Asbtract ( )   PDF (837KB) ( )  

Related Articles | Metrics

A fine-grained protection domains method was proposed to address the problem of dynamically changing a process’s capabilities. According to a process’s different access mode of its address space and system resources in its different executing phases, this model partitions it into multiple protection domains. Then it sets up access mode of address space for each of them, which makes it feasible to resist code injection attacks. Meanwhile, it integrates Mandatory Access Control (MAC) framework into it to provide the access control of system resources, which meets the security requirement of the system.

Research of intrusion detection based on fuzzy window hidden Markov model

2007, 27(6):  1360-1362. 

Asbtract ( )   PDF (489KB) ( )  

Related Articles | Metrics

To improve detection accuracy, a new intrusion detection method with high efficiency was presented, which was based on Fuzzy Window Hidden Markov Model （FWHMM）. The method improves detection accuracy by setting window of dependence between states and increases the self-adjustability and becomes lustier by changing the probability into the fuzzy random variable value. Experimental results show that the proposed method improves the detection accuracy more than the traditional HMM based method.

Intrusion detection based on neural network ensemble

2007, 27(6):  1363-1364. 

Asbtract ( )   PDF (552KB) ( )  

Related Articles | Metrics

This paper put forward a new intrusion detection method based on neural network ensemble. First, we trained neural network by using different methods to deal with different data, to elevate the ability of detecting small intrusion and prevent neural network degeneration during training; then, the improved Genetic Algorithm was used to optimize neural network ensemble weight. Theory and experiment show that this method has better ability in intrusion detection.

Fingerprint image watermarking algorithm using the quantization of parity based on Contourlet transform

Jing Xie Wu Yi-quan

2007, 27(6):  1365-1367. 

Asbtract ( )   PDF (625KB) ( )  

Related Articles | Metrics

A fingerprint image watermarking algorithm was proposed based on Contourlet transform and the quantization of parity. After Contourlet transform, original image was decomposed into a series of multi scale, local, and directional subimages. The original binary watermark was firstly scrambled by two-dimensional Arnold transform, and then embedded into the Contourlet transform low frequency sub-band. Then the coefficients of low frequency sub-band were modified by using the quantization of parity. The retrieving watermark algorithm is a blind detecting process, and it does not need original image. The experimental result shows that, this algorithm can resist attacks, such as crop, JPEG compression, and overlaid noise. The watermarking is invisible and robust, and it improves the reliability of fingerprint recognition.

Research of K-means algorithm based on particle swarm optimization in network intrusion detection

2007, 27(6):  1368-1370. 

Asbtract ( )   PDF (591KB) ( )  

Related Articles | Metrics

Based on the k-means algorithm, we proposed the PSO-k-means algorithm combining the k-means with PSO. Then KDD cup 99 dataset was applied to both algorithms. The experiment indicates that the PSO-k-means algorithm can avoid the inherent shortcomings of the k-means algorithm, and has higher detection performance with detection rate rising and false alarm rate falling.

Design and implementation of malicious code detection system based on AEC

2007, 27(6):  1371-1373. 

Asbtract ( )   PDF (828KB) ( )  

Related Articles | Metrics

In order to deal with the deficiency of current malicious code detection methods, an efficient detection method AEC for Multi-stage attack was proposed, and a new detection system based on AEC was designed and implemented. This system combined the misuse detection with anomaly detection methods, classified the single event in the network based on Active Event Correlation (AEC), and correlatively analysed each sort of events. Meanwhile, statistical model was used for further analysis. At last, it can effectively recognize multi-stage attacks, stop incomplete attack stages, and give network administrators meaningful and concise alerts.

Gradual gray-watermark embedding algorithm in the wavelet domain

2007, 27(6):  1374-1377. 

Asbtract ( )   PDF (894KB) ( )  

Related Articles | Metrics

A gradual gray-watermarking embedding scheme based on the wavelet transform was proposed in this paper. It made full use of the invisibility of the Human Vision System (HVS) in the algorithm. The watermarking digitals were divided into bits plane. Every bits plane were permuted and converted into 1-D array. As the value gradually decreased by half from layer to layer in the wavelet domain, all important coefficients of each layer were randomly searched, the 1-D array watermark compared by the bit plane was embedded into the corresponding layer’s importance coefficients according to the watermark's importance. The same coefficient can be embedded by watermark repeatedly, so as to enlarge the embedding capacity. The watermark picture can be reconstructed gradually. When achieving certain degree of similarity, we can stop withdrawing watermark from the picture which was embedded by watermarking at any time. Experimental results show that this algorithm is of good invisibility and robustness.

Database Technology

Mapping transform of query plan model in grid database based on Petri net

2007, 27(6):  1378-1381. 

Asbtract ( )   PDF (966KB) ( )  

Related Articles | Metrics

In Grid Database, the schedule policy of query plan based on Directer Acyclicgraph （DAG） is mainly adopted, which overlooks the data relation between subquery and nodes. This paper described the deficiency of schedule policy based on DAG, promised a new model NSN based on Petri Net, which can describe the relation of subquery and node, and gave transformation rules and schedule arithmetic from DAG to NSN, and finally carried out experiments to prove the advantage of NSN over DAG in assigning subquery to node.

Using SVM-based LLSI for text classification

2007, 27(6):  1382-1384. 

Asbtract ( )   PDF (561KB) ( )  

Related Articles | Metrics

Latent Semantic Indexing (LSI) uses Singular Value Decomposition (SVD) to obtain latent semantic structure of original term-document matrix, and problems of polysemy and synonymy can be dealt with to some extent. However, the present available methods of applying LSI to text classification are not satisfying, since they do not take full account of classification information. To solve the problem, an improved Local LSI (LLSI) method was proposed, using Support Vector Machine (SVM) to produce the local region. Experimental results suggest that the proposed method is effective.

A data packing method of statistic judge based on rough sets in incomplete information system

ZhongLin Zhang

2007, 27(6):  1385-1387. 

Asbtract ( )   PDF (551KB) ( )  

Related Articles | Metrics

This paper brought forward a data packing method of incomplete information system based on rough sets and grey system theory. This method takes advantage of the lower approximation in rough sets to do the first data packing, and then, according to the value-taking probability of the attribute value, finds the result to do the second packing, thus accomplishes the completion of incomplete information system. This method can adequately reflect the rules and avoid the conflict in information system. When the data in information system and the lost data are evenly distributed, the packing data can reflect the true situation of information system.

Data fragment algorithm based on granular computing

2007, 27(6):  1388-1391. 

Asbtract ( )   PDF (718KB) ( )  

Related Articles | Metrics

The paper presented a data fragment model and its algorithm based on granular computing. This algorithm gave the data localization a suitable priority and dynamically adjusted the global relation partition’s coarse and fine, and obtained a rational state for the data fragments. Meanwhile it will reduce the network flow, decrease the system cost, control the number of data fragments and decrease the data joint workload, thus improving the system efficiency.

Study on recommendation algorithm based on multi-level association rules

2007, 27(6):  1392-1393. 

Asbtract ( )   PDF (598KB) ( )  

Related Articles | Metrics

A model-based recommendation algorithm was proposed, which uses Multi-level Association Rules (MAR) to alleviate those problems about data sparseness and scalability of the recent recommendation algorithm. In this algorithm, a model for preference prediction was built by using multi-level association rule mining, which is used to compute preferences for items. The experimental results show that performance of the algorithm is superior to other methods.

Study on general extracting method of Web topic text

2007, 27(6):  1394-1396. 

Asbtract ( )   PDF (556KB) ( )  

Related Articles | Metrics

A simple and efficient method of generally extracting Chinese topic text from Web pages was proposed in this paper in order to build a large Chinese text corpus. This method just utilizes length of Chinese texts and series of punctuations, along with a few rules of discrimination, to extract needed text from Web pages accurately without analyzing HTML tags. The experiment shows the extraction is so fast and accurate that it can achieve the requirement of constructing a large Chinese text corpus.

Online self-maintenance of materialized view based on source view increment

2007, 27(6):  1397-1399. 

Asbtract ( )   PDF (592KB) ( )  

Related Articles | Metrics

View maintenance is an important field in the research of dataware house. This paper got idea from the strobe algorithm and provided an online view self-maintenance method based on source view’s increment to keep the materialized view consistent with the data sources. This method does not require querying back to data source; it can accelerate view maintenance and decrease the burden of communication between dataware house and data sources.

New clustering method based on hybrid of SOM and PAM

2007, 27(6):  1400-1402. 

Asbtract ( )   PDF (604KB) ( )  

Related Articles | Metrics

A new hybrid clustering method was presented combining the Self Organization Map （SOM） and Partitioning Around Medoid （PAM） approach in this paper. Firstly the data set was clustered by means of SOM algorithm, and then the clustering result was used to initialize the class number in the PAM algorithm. The experimental result shows that the hybrid clustering method can improve the clustering performance.

Application of an incremental updating algorithm in data mining

2007, 27(6):  1403-1406. 

Asbtract ( )   PDF (830KB) ( )  

Related Articles | Metrics

The extended discernibility matrices and extended decision matrices have been introduced, new attribute reduction algorithm and incremental updating algorithm (namely, attribute reduction algorithm based on extended discernibility matrix and incremental rule acquisition algorithm based on extended decision matrix) have been presented, and incremental updating algorithm of rules has been discussed and researched. Incremental updating algorithm and parallel processing technology were used to raise the efficiency of data mining and reduce the time complexity. Our experimental results show that the algorithm is feasible and effective.

Regression change-points detection based on fuzzy point data

2007, 27(6):  1407-1410. 

Asbtract ( )   PDF (759KB) ( )  

Related Articles | Metrics

Traditional change-points detection is based on exact data set which cannot reflect prior information of data. This paper introduced a regression-class mixture decomposition method for fuzzy point data. In the method, different regression classes were mined sequentially in fuzzy point data set, and then the regression change points can be determined. So the number of change points which can be gotten automatically, need not prespecifying. Experiments prove that the proposed method is very robust, and by using fuzzy point data we introduced the prior information of the analysis data into the process of mining regression classes, which made the change-point we got in fuzzy point data be more practical than we got in exact data set.

Software process technology

Chaos optimization design for a fuzzy-neural network structure

2007, 27(6):  1411-1414. 

Asbtract ( )   PDF (675KB) ( )  

Related Articles | Metrics

An optimization design method was proposed for a Fuzzy-Neural Network (FNN) structure based on chaotic variables. Chaotic variables were applied to the search of FNN structure and all parameters, which made fuzzy rule numbers and all parameters be in chaotic state. All FNN structure was variable, a FNN was found according to minimum performance standard. The defuzzification part right parameters of FNN were adjusted by the least square method on line. Simulation results show FNN by using the method has simpler structure and higher control precision.

Improved multiple patterns string matching algorithm

2007, 27(6):  1415-1417. 

Asbtract ( )   PDF (504KB) ( )  

Related Articles | Metrics

Combined with the advantage of the Boyer-Moore-Hoospool (BMH) algorithm, a faster algorithm for performing multiple patterns matching in a string was proposed on the basis of Aho-Corasick (AC) algorithm. In general, it does not need to inspect every character of the string. It skips as many characters as possible to decrease pattern match operations before matching patterns. The proposed algorithm achieves excellent performance in the cases of both short patterns and long patterns. Experimental results show that in case of short patterns the time it takes for the proposed algorithm to search a string is only 50%～30% that of the AC algorithm, while in case of long patterns the ratio is 26.7%～15.2%.

LS-SVM parameters selection based on genetic algorithm and its application in economic forecasting

2007, 27(6):  1418-1419. 

Asbtract ( )   PDF (504KB) ( )  

Related Articles | Metrics

It was proposed that genetic algorithm was used to optimize parameters of Least Squares Support Vector Machine (LS-SVM) and LS-SVM was well trained by using population data in an economic system. Then, the well trained LS-SVM was used to forecast population in a city. Finally, LS-SVM and BP network were compared in prediction and the result shows that the genetic algorithm for optimizing parameters of Least Squares Support Vector Machine proposed in this paper is feasible and effective.

Development and representation method of business ontology

2007, 27(6):  1423-1425. 

Asbtract ( )   PDF (578KB) ( )  

Related Articles | Metrics

Business ontology is formal representation of business conceptual model and it has significant value in developing reusable business model. This paper analyzed the limitation of exiting ontology development and representation method, and then put forward the activity-oriented business ontology development method and expatiated the business ontology representation method based on UML-OCL.

Genetic and tabu search algorithm for the optimization of neural network structure

2007, 27(6):  1426-1429. 

Asbtract ( )   PDF (644KB) ( )  

Related Articles | Metrics

A conventional Neural Network often optimizes the weights through invariable network structure, which has limited the extensive use of the Neural Network. The crossover operator based on direction and Tabu search mutation operator was introduced. This paper put forward Genetic and Tabu search algorithm to train the neural networks, combining the merits of genetic algorithm and that of Tabu search algorithm, which makes weights and structure of artificial neural networks be optimized together. The result shows that the neural network optimized by using the presented algorithm has the advantages of quicker convergence rate and higher precision, compared with genetic algorithm and Tabu search algorithm, and that the processing ability of networks is also raised.

MIM-based extended model measure the software maintainability

2007, 27(6):  1430-1433. 

Asbtract ( )   PDF (722KB) ( )  

Related Articles | Metrics

The article studied Practical Software Measurement （PSM）, especially Measurement Information Model (MIM), and pointed out some disadvantages of these models. After analyzing these models, an improved model based on MIM was proposed. The article also formalized some descriptions about the new model and showed the modeling procedure. Software maintainability is an important software quality character. In measuring the software maintainability, the improved model is very effective. Application proves the feasibility and practicability of the model.

Title amino acid sequence alognment algorithm based on ant colony optimization genetic algorithm

2007, 27(6):  1434-1437. 

Asbtract ( )   PDF (768KB) ( )  

Related Articles | Metrics

Based on ant colony optimization algorithm, Ant Colony Optimization Genetic Algorithm (ACOGA) is an improved algorithm by optimizing ant colony optimization algorithm’s parameters. In this paper, ACOGA was applied to amino acid Sequence Alignment (SA) in bioinformatics and the ACOGA based sequence alignment algorithm (ACOGA SA) was derived. The experimental results indicate that the proposed ACOGA SA is very effective.

Articles

Approach for Web Services composition supporting the integration of heterogeneous data sources

2007, 27(6):  1438-1441. 

Asbtract ( )   PDF (715KB) ( )  

Related Articles | Metrics

In this paper, we developed a model of data integration in Web Service environments based on "mediator" data integration framework. In our method, data query processing in network environments was taken as the elementary Web Service, and relational databases and XML were regarded as typical representatives of heterogeneous data sources. We adopted the existing query processing and XML data binding technology. By defining the basic operation of the model (services), the graph structure was adopted to describe the process of services composition. We proposed the approach for Web Services composition supporting the integration of heterogeneous data sources, as well as the corresponding optimization strategies.

Remote sensing data acquisition and monitor system based on FPGA

2007, 27(6):  1442-1444. 

Asbtract ( )   PDF (656KB) ( )  

Related Articles | Metrics

A design of a remote sensing data acquisition and monitor system based on Field Programmable Gate Array （FPGA）was offered in this paper, which makes logic design simpler and user-friendly during its application. The important technologies, bus-sharing technology and memory-mapped files technology, were also adopted in order to acquire, monitor and store data simultaneously at high speed.

Research of STEP-based RMS information model and its implementation

2007, 27(6):  1445-1447. 

Asbtract ( )   PDF (743KB) ( )  

Related Articles | Metrics

Digital Collaborative product development mode brings forward new requirements to RMS data’s share and exchange. According to the full characteristic， ‘full phase’ and ‘full system’ of RMS engineering, a STEP-based RMS information model was developed. Furthermore, an implementation method based on PDM was presented. At last, the application mode and the case study applied in enterprise information integration were given.

Study on workflow model checking

2007, 27(6):  1448-1451. 

Asbtract ( )   PDF (770KB) ( )  

Related Articles | Metrics

A method to verify the correctness of workflow model described by WPDL was introduced. We used CTL* to describe the correctness properties of workflow model and the algorithm of Nonemptiness games to verify the correctness. This method has f strong ability in describing the correctness properties, and it is both time and space efficient.

Graphics and image processing

New compression algorithm of image sequence coding based on 3-D wavelet transform

Chun-yan You Peng Zheng

2007, 27(6):  1452-1454. 

Asbtract ( )   PDF (1088KB) ( )  

Related Articles | Metrics

To compress image sequence, a coder structure, which combines the standard 3-D wavelet transform with motion compensation, was introduced. For image sequence with slow motion, according to the characteristic of the wavelet transformed data, a new coding algorithm, which integrated the improved EZW (Embedded Zerotree Wavelets Encoding) and pixel coding, was presented. Computer simulation shows that through the method not only the computational complexity is reduced but also even when the compress ratio gets 400:1, the recovered image quality still can gain more than 29dB.

Research and implementation of granule separation based on H-dome reconstruction

2007, 27(6):  1458-1459. 

Asbtract ( )   PDF (690KB) ( )  

Related Articles | Metrics

While implementing the separation of the adhered granules, this paper firstly integrated distance transform and H-Dome area reconstruction to label the granules, and then used watershed algorithm to find the border of adhered granules, and finally separated the adhered granules. This method can solve the problem that cannot get the exact label of the adhered granules. This algorithm achieves fine results in practice.

Effective de-blocking algorithm for block-DCT images

2007, 27(6):  1460-1462. 

Asbtract ( )   PDF (763KB) ( )  

Related Articles | Metrics

The block-Based Discrete Cosine Transform （BDCT） suffers from visible blocking artifacts between adjacent image blocks at low bit rates, which reduces the image visual quality. This paper proposed a blocking artifacts reduction algorithm based on feature analysis in wavelet domain in order to reduce blocking artifacts while preserving edge and texture information. The blocking artifacts in space domain display horizontal line-shape effect, vertical line-shape effect and grid-shape effect in high frequency sub-bands of wavelet domain. The proposed algorithm used adaptive operators for every sub-band to suppress these energy-concentrated coefficients on the block boundary to reduce blocking artifacts in space domain. The simulation result shows that it has good performance in reducing blocking effects at different bit rates for different kinds of images and the calculation speed is very fast.

Image classification based on transductive support vector machines

2007, 27(6):  1463-1464. 

Asbtract ( )   PDF (614KB) ( )  

Related Articles | Metrics

Transductive Support Vector Machines （TSVM） take advantage of the test sets as well as the train sets and inherit most properties of inductive SVMs. They are more efficient than inductive SVMs, especially for very small training sets and large test sets. But they still have disadvantages, such as high time complexity and the requirement of "num+". The improved algorithm substantially reduces the time complexity with little influence on the performance.

MRI image denoising based on improved wavelet thresholding

向东 Chen haoyang Xing

2007, 27(6):  1465-1467. 

Asbtract ( )   PDF (714KB) ( )  

Related Articles | Metrics

A scheme based on the improved wavelet threshold for the noise removal in Magnetic Resonance Image （MRI） images was presented. In this paper, the wavelet threshold method was improved according to the characteristics of MRI images and according to neighboring threshold of wavelet coefficients, conquering the limitation of using traditional wavelet transform. The experimental result indicates that the algorithm can maintain the details of the MRI images while removing the noise, in favor of doctors’ diagnosis.

Gait contour extraction based on improved snake model

2007, 27(6):  1468-1471. 

Asbtract ( )   PDF (906KB) ( )  

Related Articles | Metrics

A gait contour extraction method based on Snake model was proposed, which can search the contour not only correctly but also rapidly. The experiments tested on the CMU database prove that the gait contour can be completely and closely extracted by the proposed method, and recognition rate is also increased effectively.

Improvement of real-time planar shadow algorithm and its implementation

2007, 27(6):  1472-1474. 

Asbtract ( )   PDF (548KB) ( )  

Related Articles | Metrics

Shadows are important to improving the reality sensation of an image. This paper discussed planar shadows algorithm and its improvements. The stencil function controlled whether a fragment of shadows was discarded or not by the stencil test with the Stencil Buffer of OpenGL. A 3-D projective transformation of a pyramid to a box was used to remove the antishadow and the false shadow. The soft shadow was realized with the accumulation buffer of OpenGL. The improved algorithm presented here is optimized for real-time applications with OpenGL, and the computation efficiency, the reality sensation of graphics and the visual quality of the image are improved efficiently.

Improved image registration based on second-order mutual information

2007, 27(6):  1475-1478. 

Asbtract ( )   PDF (846KB) ( )  

Related Articles | Metrics

In this paper, we studied the influence of grey levels and neighborhood information on the technology of image registration based on second-order MI from some experiments, getting the best grey levels and neighborhood information to improve this technology. At last, we analyzed the effects of noise on second-order MI to explain the conclusions in our paper.

Visual and quick method of smoothing interpolation curve

2007, 27(6):  1479-1481. 

Asbtract ( )   PDF (514KB) ( )  

Related Articles | Metrics

An easy parametric uniform interpolation was presented and its characteristics were analyzed in this paper. A method of its smoothing connection was presented and this method was visual, easily controlled, effective and practicable. The experimental result shows that the parametric curve of uniform interpolation in less than 6 rank is better in performance.

Algorithm of accurate eye detection of frontal facial images

2007, 27(6):  1482-1484. 

Asbtract ( )   PDF (1231KB) ( )  

Related Articles | Metrics

Using the scatter matrix that is related to the gray-level of irises, the algorithm first extracted intensity valleys as the candidates for the irises. Next, for each pair of candidates, the algorithm computed a cost using Hough transform and separability filter to measure the fit of the pair of candidates to the image. Experiments were carried out by using all faces without spectacles in the face database of the SJTUFace and BioID, the success rates of the proposed algorithm were 96.5% and 91.36% respectively.

Intelligence perception

Study on recognition for parasite ovum images based on new method of feature extraction

2007, 27(6):  1485-1487. 

Asbtract ( )   PDF (594KB) ( )  

Related Articles | Metrics

Several learning strategies about multi-class classification by using Support Vector Machine （SVM） being discussed in this paper, we proposed a new kind of method for images feature extraction, so as to realize recognition and classification automatically for the nine kinds of parasites ovum images such as Trichuris trichiura, etc. The average recognition rate is superior to that of traditional neural network and reaches 93.9%, providing a new method for parasites ovum’s images recognition.

Line type identification method based on least trimmed squares

2007, 27(6):  1488-1489. 

Asbtract ( )   PDF (580KB) ( )  

Related Articles | Metrics

After the positions of road centerlines were acquired, according to the road line types, we first processed the grouping of coordinate data of road centerlines by extracting straight lines algorithm and detecting circle algorithm based on Rough transform, and then carried out adjustment by method for selecting weight Iteration with Least Trimmed Squares （LTS） initial value. Therefore, we reached the goal of road line identification after getting the road line type parameters. At last we adjusted all parameters of line type by using the theory of condition adjustment so that they satisfied a series of objective requirements. This method of road line type identification in this paper has proved its availability by Visual C++ programming finally.

Iris recognition based on the analysis of local regions

2007, 27(6):  1490-1492. 

Asbtract ( )   PDF (620KB) ( )  

Related Articles | Metrics

In this paper, we proposed a new iris recognition method based on the analysis of local regions. By means of using some Gabor filters, the original images were transformed into some filtered images, in which the coefficients can describe the similarity between the local regions and filters. The iris feature was extracted by getting the weighted average of the coefficients of each point in these local regions. The iris feature matching was based on the Euclidean distance between the corresponding feature points. The experimental results illustrate that the proposed method is effective.

Optimal node density control algorithm based on cooperation in WSNs

2007, 27(6):  1493-1496. 

Asbtract ( )   PDF (740KB) ( )  

Related Articles | Metrics

An Energy Efficient Cooperative Density Control Algorithm （EECDC） was proposed. EECDC is based on a new sensing model-Cooperative Sensing Model (CSM). According to CSM, serials of nonlinear constrained programming models were developed to find the optimal conditions for full coverage with minimal sensor nodes. Based on the findings, EECDC had been devised to select sensor nodes as close to optimal locations as possible to be the working nodes. Simulations show that EECDC outperforms OGDC algorithm in term of number of working nodes needed, and achieves almost the same coverage. As a result, it achieves higher energy efficiency and longer network lifetime.

Blood cell’s classification based on single-output artificial neural network

2007, 27(6):  1497-1499. 

Asbtract ( )   PDF (809KB) ( )  

Related Articles | Metrics

The blood cell’s characteristic parameters that have been obtained previously were processed with both BP Neural Network and Single-output Neural Network in order to classify the blood cells automatically. Compared with the BP Neural Network, the Single-output Neural Network is affirmed with more effective result due to a few advantages such as simpler design, faster convergence speed, higher accuracy of recognition and better robustness.

Extraction of the stroke plane for the handwritten Chinese character recognition based on elastic stroke length and recognition

2007, 27(6):  1500-1501. 

Asbtract ( )   PDF (415KB) ( )  

Related Articles | Metrics

According to the feature extraction of the handwritten Chinese character recognition, an improved extracting stroke plane method was proposed. First, to nonlinearly normalize the Chinese character image; then, to extract the four stroke plane by making use of the elastic stroke length, according to the four strokes of heng, shu, pie, na; last, to cut each stroke plane into the S×S small meshing, and count the stroke crossing numbers in each meshing，then get a 4S2 character vector forms. The experiment adopted the minimal-distance classifier to classify the Chinese character set that includes 7600 characters, and achieved better recognition results.

Tracking video object based on regional-centroid and vector-direction

2007, 27(6):  1502-1504. 

Asbtract ( )   PDF (942KB) ( )  

Related Articles | Metrics

An algorithm was proposed to track moving objects based on centroid and vector in this paper. After segmenting video objects, video objects were divided into several regions by region-growing method. Then with the help of centroid and direction of vector of each region in two successive frames of a video sequence, it is able to track multi-nonrigid moving objects fast, effectively and automatically. The experimental results show that the presented method is robust to deal with the problems in multi-targets tracking such as new target entering, target leaving, scaling and deforming of nonrigid objects.

Feature extraction and recognition of iris based on ICA-MJE and SVM

2007, 27(6):  1505-1507. 

Asbtract ( )   PDF (591KB) ( )  

Related Articles | Metrics

A new method for iris feature extraction and recognition was proposed in this paper. Feature was extracted with independent component analysis by maximizing J-divergence entropy (ICA-MJE), and then Support Vector Machine (SVM) was used to match two iris codes. Compared with that of Gabor wavelet method, the size of an iris code and the processing time of the feature extraction were significantly reduced. Experimental results show that the developed system with high iris recognition rate could be used for a personal identification system in a more efficient and effective manner.

Typical applications

Adaptive control of time-varying delay system based on generalize predictive control

2007, 27(6):  1508-1509. 

Asbtract ( )   PDF (501KB) ( )  

Related Articles | Metrics

In this paper, the algorithm of Implicit Generalized Predictive Control (IGPC) was studied and applied to the industry process with time-varying delay. In order to overcome the disadvantage of the traditional GPC: complexity, the algorithm of IGPC can identify the controller parameters directly by the system input-output data and compute the optimal control signal increment faster than traditional GPC. The simulation results show that the IGPC controller can rapidly adapt to the change of setting value even without any prior information of the controlled system, and give a better control performance for the system with time-varying parameters. The controller proposed in this paper is suitable for the time-varying delay system control.

New method for estimation of DOA based on fast independent component analysis

2007, 27(6):  1510-1512. 

Asbtract ( )   PDF (519KB) ( )  

Related Articles | Metrics

Independent Component Analysis (ICA) is a novel blind source separation method. As a new technique of signal processing, ICA has become more and more important and has been widely used in communication, processing of radar signals, image processing of biological medicine, pattern recognition and so on. In this paper, the fundamental theory and algorithm of ICA were presented. And a new method—fastICA was used for DOA estimation. A simple estimation method of DOA can be obtained. Experimental results have verified its feasibility and effectiveness.

IBidi——bidirectional algorithm oriented to information processing

2007, 27(6):  1513-1517. 

Asbtract ( )   PDF (758KB) ( )  

Related Articles | Metrics

According to the existing problems in bidirectional text recognition, a new bidirectional algorithm—IBidi was put forward to process bidirectional text and it had the ability of self-description and was oriented to information processing. Firstly, IBidi preprocessed the text stream and tagged the digits. Then it analyzed the text stream and tagged the string with predefined marks to describe the characteristic of strings. Finally, a sorting algorithm was used to sort text stream for display. The experimental result on a typical test set shows that the precision of IBidi is up to 96.7%, while that of Unicode’s bidirectional algorithm is only 80%. Additionally, the experimental result on random test also shows that the precision of IBidi is 5% higher than that of Unicode’s bidirectional algorithm.

Fast reconstruction system of medical images based on VTK

DU Jun-Li GUO Qing-Yu

2007, 27(6):  1518-1520. 

Asbtract ( )   PDF (791KB) ( )  

Related Articles | Metrics

In this paper, a 3D reconstruction system was developed with VTK and MC. The problem of time and memory is the key to real-time system. The methods of merging vertexes and hashing map can improve speed and reduce memory. This system provides a basis for development and implementation of a complete medical visualization system.

Particle swarm optimization based degree reduction of rational Bézier curves

2007, 27(6):  1524-1526. 

Asbtract ( )   PDF (679KB) ( )  

Related Articles | Metrics

By means of optimization methods, degree reduction of rational Bézier curves has been transformed to an optimization problem. Based on Particle Swarm Optimization (PSO) algorithm, a new method was proposed to solve the problem of degree reduction of rational Bézier curves. By using this method, the rational Bézier curves can be reduced many times and the reduced B zier curves can be represented explicitly. The PSO algorithm was compared with genetic algorithm, and the experimental results show that PSO algorithm is more effective.

New and effective JPEG steganographic content detecting system

2007, 27(6):  1527-1530. 

Asbtract ( )   PDF (707KB) ( )  

Related Articles | Metrics

A blind detecting JPEG Steganographic Content system was designed and developed whose class is based on the characteristics of DCT coefficients energy and 3-layer forward neural network .The whole system was developed in VC++6.0，using the multi-thread, XML , SQL Server database and the JPEG library of Thomas G. Lane, and a blind detecting JPEG Steganographic Content system was realized which can store detecting information and create reports. This system has detected more than 3000 pictures and the average detecting rate of various Steganographic methods is 90.085%, including jpeg pictures with low stega rate and cover pictures which are smoothened, sharpened, shirked, cuted or re-compressed.

Multiple description coding scheme for P2P VOD system

2007, 27(6):  1531-1533. 

Asbtract ( )   PDF (815KB) ( )  

Related Articles | Metrics

In order to reduce the delay and rejection rates of P2P VOD, a new Multiple Description Coding scheme was proposed, and two concepts, the largest number of lost descriptions and the expected probability, were introduced. In conjunction with any source coder that is scalable, this scheme can be regarded as a better choice to distribute the video data for P2P VOD system. Theory and simulation results justify that the scheme is about twice as fast as the algorithm in reference [5], and can be easily implemented with the same quality.

Hierarchy security model for networked storage

2007, 27(6):  1534-1538. 

Asbtract ( )   PDF (1019KB) ( )  

Related Articles | Metrics

This paper analyzed the security threat in networked storage first, and then presented the hierarchy security model for networked storage. After that, this paper analyzed the current research of security networked storages, discussed the algorithms and strategies of them and pointed out the hot issue and research direction.

Improved proxy blind signature scheme

2007, 27(6):  1539-1541. 

Asbtract ( )   PDF (485KB) ( )  

Related Articles | Metrics

In this paper, we analyzed the proxy blind signature scheme proposed by Lal and Awasthi. We pointed out the insecurity of the L-A scheme. It is of the untraceability property. An adversary can republish the proxy public key and claim that he is the original signer. It needs a secure channel in the L-A scheme, and the original signer can forge the blind signature of the proxy signer. Then we proposed a new proxy blind signature scheme to overcome the pointed out drawback in L-A scheme. We proved that the new scheme is more secure and useful. As an instance, application of the new scheme in electronic cash was described.

Design and implementation of smart home system based on OSGi home gateway and Web Service

2007, 27(6):  1542-1544. 

Asbtract ( )   PDF (595KB) ( )  

Related Articles | Metrics

The Open Service Gateway Initiative （OSGi） Home Gateway can provide mobile users with various services, including smart home management, remote control, etc. Meanwhile, Web Service makes it possible for any application system to access dynamically all kinds of services anywhere. However, current solutions for smart home are mostly based on home gateway, without taking Web Service into account. Therefore, this paper proposed a new design and implementation for smart home combining OSGi Home Gateway with Web Service technology. Based on the detailed design of the system modules, this paper also gave the result of accessing the OSGi Web Service by PDA to supervise the status of home appliances.

Attack prediction model based on dynamic bayesian games

2007, 27(6):  1545-1547. 

Asbtract ( )   PDF (683KB) ( )  

Related Articles | Metrics

This paper described an attack prediction model based on dynamic bayesian games. According to the historical behaviors of the attacker, this model reasonably updates the probability of malicious nodes existing in the network by using bayesian law, with which it can predict the probability of attacks or defenses that rationale attacker or defender will take in the next stage of the game, in order to maximize their payoff. Thus the result can be used to assist security administrators to configure the network system. It may change the passive detection to the active protection for the defender. This paper also presented the process of experiment and analysis result for validity of the model.

Fizz network structure mining based on nave bayes classification

Bing Xu Shao-zhong GUO Yong-zhong HUANG

2007, 27(6):  1548-1550. 

Asbtract ( )   PDF (530KB) ( )  

Related Articles | Metrics

In this paper, we studied the algorithm of E-mail classification using nave Bayes classification. The concepts of Fizz Network and Fizz Degree were proposed. We presented the algorithm to depict the communication network of criminous orgnization, and the algorithm for structure mining. Finally, the experiments prove the good performance of the proposed algorithm.

Multitask real-time measurement and control system based on RTX and LabVIEW

2007, 27(6):  1551-1552. 

Asbtract ( )   PDF (598KB) ( )  

Related Articles | Metrics

This paper presented a new kind of real-time measure and control system that is based on Real Time extension for Windows （RTX） and Laboratory Virtual Instrument Engineering Workbench （LabVIEW）. In this system RTX was used to enhance the real-time property of Windows. The tasks were divided into two parts: real-time task and non real-time task. The real-time tasks are running under RTSS, which is a real-time subsystem. At the same time, the non real-time tasks are running on Windows. The two parts communicate with each other through shared memory. The Human-Compute-Interface is designed by LabVIEW. At last it is verified that this system is feasible.

An identity-based signcryption scheme with public verifiability

2007, 27(6):  1553-1555. 

Asbtract ( )   PDF (528KB) ( )  

Related Articles | Metrics

Signcryption is a new cryptographic primitive, which can sign and encrypt message at the same time and reduce much communication and computation costs. A new efficient identity-based signcryption scheme was proposed, in which some characteristics of bilinear map were taken into account. In this scheme, anyone can identify the source of the ciphertext, but only the receiver can recover the plaintext. What's more, this scheme can satisfy the confidentiality, unforgeability and nonrepudiation required by signcryption. This scheme is also very efficient regarding the computation costs and the communication overheads after analyzing and being compared with other schemes.

Real-time hair animation of virtual characters

2007, 27(6):  1556-1558. 

Asbtract ( )   PDF (647KB) ( )  

Related Articles | Metrics

We introduced an efficient lattice mechanical deformation approach. The lattice was deformed as a particle system using advanced numerical methods, and the hairs were animated using quadratic B-Spline interpolation. We dealt with the collisions between the hair and the body surface with metaball model. The mechanical model of the hairstyle which can simulate any kind of complex hairstyles is sufficiently fast for real-time performance and sufficient versatility. The model can reach the optimal compromise between accuracy and computation speed in any rendering context.