Table of Content

01 June 2008, Volume 28 Issue 6

Previous Issue    Next Issue

Information security

Dynamic authorization scheme based on delegation in distributed system

Run-lian ZHANG Xiao-nian WU Xiao-she DONG

2008, 28(6):  1365-1368. 

Asbtract ( )   PDF (691KB) ( )  

Related Articles | Metrics

Concerning the authority in distributed environment for collaboration, a dynamic authorization scheme was presented based on delegation and RBAC model. The scheme supports partial role delegation, by expanding element sets of RBAC model, enlarging static authorization operations, and allowing the delegator to create temporary delegation roles and assign others (the delegatee) to the particular roles. The scheme was implemented by three-level frameworks, and the operating process about how to authorize dynamically in delegation model was described. The application shows that the scheme can adapt to distributed and dynamic environment, and follow the least privilege principle.

Multi-designated verifiers signature based on multilinear forms

Ke-li WU Xiang-he WEI Hong ZHANG Feng-yu LIU

2008, 28(6):  1369-1371. 

Asbtract ( )   PDF (454KB) ( )  

Related Articles | Metrics

The multi-designated verifiers signature is a special digital signature that the signature could only be checked by several designated verifiers. A multi-designated verified signature scheme and an identity based multi-designated verified signature scheme were proposed based on the technique of multilinear forms. The security analysis of the schemes shows that they have the property of unforgeability, source hiding and privacy of signer's identity.

Design and implementation of network firewall system based on Godson CPU

Qing LI Shao-xiao WU Chong QIAO Gang SHI Jin-gang LIU

2008, 28(6):  1372-1375. 

Asbtract ( )   PDF (562KB) ( )  

Related Articles | Metrics

A network firewall system based on Godson2E CPU was designed. This solution used Godson processor as the CPU and a self-designed north bridge. The key technologies of the design such as firewall software strategy, hardware architecture design, signal integrity and the solution of testing the network packet passed ratio and delay were discussed and the corresponding solutions were given too. In order to solve the signal integrity problem, a layout mechanism of restriction in advance and simulation subsequently was put forward, which improved the design reliability of the motherboard with high-speed signals. A testing and computing solution for the network packet passed ratio and delay was also given, which was the key performance parameters of the network firewall computer system. Theoretical and experimental results show that this solution is an all-purpose, secure and reliable firewall system design.

Bidirectional monitoring threat and simulation in IP Multimedia Subsystem

Xiao-lei WANG Yun-fei GUO Tao YANG

2008, 28(6):  1376-1378. 

Asbtract ( )   PDF (554KB) ( )  

Related Articles | Metrics

Started with the IP Multimedia Subsystem (IMS) security mechanism, the flow of register and authentication in IMS were introduced; then combined with the ordinary threat in SIP protocol, the possibility of attack using the leak of SIP in IMS was analyzed. Based on this, adopting the theory of registration hijacking and server impersonating, a new threat named bidirectional monitoring was proposed. Function of CSCF in IMS was realized using Open SER. A network simulation environment was built to simulate the possibility of bidirectional monitoring. The result of the simulation proves that the threat of bidirectional monitoring is existent.

Location privacy protection routing for wireless sensor network

Jian-bo YAO Guang-jun WEN

2008, 28(6):  1379-1381. 

Asbtract ( )   PDF (416KB) ( )  

Related Articles | Metrics

When Wireless Sensor Network (WSN) is used to monitor sensitive objects, the location privacy of monitored objects becomes a key issue. When a sensor node reports a monitored object to base station by sending a series of messages through multiple hops, an adversary may trace back the source location. Flooding-based phantom routing has a problem that safety period becomes smaller and energy costs become higher for protecting source-location privacy. In this paper, directed-random-walk-based phantom routing was proposed to make it difficult for an adversary to backtrack hop-by-hop to the origin of the sensor communication. In directed-random-walk-based phantom routing, every message experiences two phases: the first, the same as flooding-based phantom, is a random walk or directed walk, and a subsequent directed-random-walk to deliver the message to the base station. Compared to flooding-based phantom, directed-random-walk-based phantom routing has clearly larger safety period and lower energy costs.

Credit-based dynamic authentication mechanism crossing heterogeneous domains

Li-chun PEI Xing-yuan CHEN Ting WANG Bin ZHANG Zhen XU

2008, 28(6):  1382-1384. 

Asbtract ( )   PDF (478KB) ( )  

Related Articles | Metrics

Since the authentication methods used in domains are always different and the trust relationship changes frequently, a dynamic cross-domain authentication method based on credit was proposed. The value of credit was calculated and the trust relationship was dynamically formed. Based on this relationship, cross-domain authentication could be realized. Analysis of the application instance shows that the proposed method can solve the problem of establishing trust relationship between heterogeneous domains.

Distributed secret share distribution scheme based on threshold warrant certificates

He HUANG Ya-di WANG Ji-hong WANG Heng-jun WANG

2008, 28(6):  1385-1387. 

Asbtract ( )   PDF (588KB) ( )  

Related Articles | Metrics

Ad Hoc network often supplies reliable authentication service for nodes by distributed certificate authority authentication model due to its dynamic topology and other characteristics; however, the problem of secure auditing is not solved by existing schemes. Therefore, a distributed secret share distribution scheme was put forward based on threshold warrant certificates, which carried out strict auditing towards the nodes that applied for secret shares, and could effectively withstand several malicious nodes working together to recover the secret key of system, and make sure that only the credible and high-quality-service nodes were able to gain the secret shares. In the end, the security and success probability of the scheme were analyzed in theory, and its effectiveness was confirmed by simulations.

Improved scheme based on random key predistribution for wireless sensor network

Feng TIAN Jiao-feng WANG Chuan-yun WANG Zhuo-jin PAN Xiao-ping WANG

2008, 28(6):  1388-1391. 

Asbtract ( )   PDF (629KB) ( )  

Related Articles | Metrics

Due to the limitation of the nodes energy and the limitation of memory resources and computation ability in the Wireless Sensor Network (WSN), the traditional network security is challenged. Fully considering the characteristics of WSN, a key distribution scheme was proposed based on pre-shared key and random key distribution scheme, in which only ID-number of key in key pool was saved so as to save memory resources of sensor nodes. Furthermore, in view of the characteristics of resource limitation of sensor nodes, the working load of nodes was reduced through decreasing conversation steps and simplifying computation approach under the premise of satisfying the encryption needed. Thus in the scheme, the memory resource of the nodes and the correspondence cost are extremely small, and the working efficiency of the sensor network is improved greatly.

Controllable anonymous authentication protocol in wireless communications

Cheng XIE Hong-yun XU Jing LIU

2008, 28(6):  1392-1394. 

Asbtract ( )   PDF (490KB) ( )  

Related Articles | Metrics

An anonymous authentication protocol was proposed to improve the anonymity and to control anonymity abuse in wireless communications. The protocol implemented the anonymity of Home Location Register (HLR) using Visitor Location Registers (VLRs) which had been employed to forward the authentication message by Mobile Station (MS). Through checking the authentication token, this protocol could control anonymity abuse. The probability statistics were adopted to analyze the security and anonymity of this protocol. The analysis results show that this protocol not only improves the anonymity of HLR but also defends anonymity abuse effectively.

Certificateless public key signature scheme without pairing

Hui-ge WANG Cai-fen WANG Yong-bin LI Xiao-dong YANG

2008, 28(6):  1395-1397. 

Asbtract ( )   PDF (523KB) ( )  

Related Articles | Metrics

The existing certificateless public key signature schemes are based on elliptic curve or Tate pairing. The proposed scheme was certificateless public signature scheme without pairing. New scheme was proved to be unforgery under random oracle model. New scheme avoids the using of certificate in certificate-based public key signature scheme, removes key escrow in ID-based signature scheme, needs simpler algorithm, and is convenient to practical application.

Application of fuzzy window Markov chain in IDS

Wen-gang ZHAO Le-hai ZHONG Ya ZHANG Jin YANG Hai-yang ZOU

2008, 28(6):  1398-1400. 

Asbtract ( )   PDF (608KB) ( )  

Related Articles | Metrics

The traditional static Markov model is based on such premise of assumptions as transition probability distribution of system mode of t+1 moment is only interrelated with the state at time t but not with that before time t, which brings big error. Therefore, a new window Markov chain was put forward, and fuzzy measure was introduced into it. The experiment confirms that this model has a good discrimination to the normal behavior and the unusual behavior, and has a faster calculation speed, and it is suitable for the on-line detection.

Design and implementation of H.323-based VoIP interception model

Yi-min ZOU Jiang DU

2008, 28(6):  1401-1403. 

Asbtract ( )   PDF (483KB) ( )  

Related Articles | Metrics

With the wide application of VoIP, how to implement lawful interception rapidly and effectively has become the focus of present research. The characteristics of H.323 network and its protocol were analyzed, and the traffic identification methodology based on H.323，the algorithm of extracting the dynamic conversation and the flow of network interception were expounded in detail. And on such basis, a design of interception model based on H.323 was put forward.

Watermarking in binary image based on Arnold transformation

Fang LIU Cheng JIA Zheng YUAN

2008, 28(6):  1404-1406. 

Asbtract ( )   PDF (603KB) ( )  

Related Articles | Metrics

In view of the particularity of binary image, a digital watermarking algorithm was proposed for binary image. Watermark was put into an original image by using Arnold transformation and flipping the pixels which met the visual constraints. Experimental results show that the algorithm not only improves the unobtrusiveness and embedding capacity of watermark, but also realizes the blind watermarking.

Analysis and countermeasure of the hole in an intrusion detection modeling from immunology

Jing YU Feng WANG

2008, 28(6):  1407-1410. 

Asbtract ( )   PDF (630KB) ( )  

Related Articles | Metrics

Inspired by the structures and ideas of natural immune system, a new instruction detection modeling was proposed to improve the capability of detection system. There may be some nonself strings that were not detected by any detector in the modeling, so named as "holes", which would lead to performance decline and increase the ratio of leak. After analyzing the formation reason and characteristics of the holes, some methods were presented to eliminate holes. It is proved by simulation experiments that different kinds of detectors can repair hole effectively, thereby false negative rate decreases.

Database Technology

Projection-pursuit-based dimension reduction for visualization of text features

Mao-ting Gao Peng Lu

2008, 28(6):  1411-1413. 

Asbtract ( )   PDF (610KB) ( )  

Related Articles | Metrics

Using genetic algorithm to search for the optimal projecting direction, projection pursuit model was used to project text feature data from high-dimensional space into low-dimensional space (2 or 3 dimensions ), and the linear and non-linear structures and features of the high-dimensional data were shown by its projecting feature value in the low dimensional space, therefore dimensionality was reduced and visualization for high-dimensional text feature data was realized. This method is not only cutting down the computing complexity in the process of text mining, but also helping to determine the number of initial center point for K-means algorithm, and improving the accuracy of the algorithm. Experiments demonstrate the efficiency of this method for text feature dimension reduction.

Optimal algorithm of data streams clustering on sliding window model

Yu HU Qiao-mei YAN

2008, 28(6):  1414-1416. 

Asbtract ( )   PDF (430KB) ( )  

Related Articles | Metrics

Streaming data clustering algorithm was improved based on sliding window model with the purpose of high cluster quality and efficiency. The new algorithm adopted cluster feature histograms as the data supporting structure. Compared with traditional cluster algorithms, the complexity and clustering effect of new algorithm was further improved. In addition, the algorithm is of better efficiency, less memory overhead and fast data processing capabilities, and the application of data streaming mining technologies is expanded.

Multi-mode classification with application in customer retention

Zhi-ping CHEN

2008, 28(6):  1417-1419. 

Asbtract ( )   PDF (600KB) ( )  

Related Articles | Metrics

With diversification analyses of lost customers in applications, a multi-mode classification algorithm was presented. It applied clustering algorithm to segment the lost customers into many subgroups, then used classification algorithm to build the classifying models on each subgroup. Meanwhile, it filtered the low-precision class models to ensure the precision improvement of forecast lists. Compared with Logistic, decision tree and neural network, the experimental results show that the new classification algorithm has better performance.

Generalization rough set theory and real-valued attributes reduction

Di XIAO Jun-feng ZHANG

2008, 28(6):  1420-1423. 

Asbtract ( )   PDF (604KB) ( )  

Related Articles | Metrics

Considering that the classical rough set theory can only process the discrete data, the degree of general importance of an attribute and attribute subsets was presented. And then a generalization rough set theory was proposed based on the general near neighborhood relation. The theory partitioned the universe into the tolerant modules and formed lower approximation and upper approximation of the set under general near neighborhood relationship which avoided the discretization in Pawlak's rough set. Furthermore, the definition of attribute reduction in generalization rough set and its greedy algorithm were proposed. Finally, results of some examples show the correctness and validity of this method.

Study on research field diffusion based on author publication track record

Jin-long WANG Xue-yu GENG

2008, 28(6):  1424-1426. 

Asbtract ( )   PDF (638KB) ( )  

Related Articles | Metrics

With the development of digital library technology, many digital literatures have come into being. It is very important to mine these sources for providing convenience for the user, and it is paramount to analyze these texts to help user understand topic evolution and development. Dynamic Bayesian network model was used to investigate the research field diffusion, and experiments on real data sets indicate that the proposed method can help researchers get a better insight into research field diffusion for various research fields.

Automatic semantic Web services composition based on complete backward tree

Rui-ning LI Zhu-rong ZHOU

2008, 28(6):  1427-1430. 

Asbtract ( )   PDF (651KB) ( )  

Related Articles | Metrics

Compared to the traditional ways of composing Web services, semantic-based ways of composing Web services automatically are more effective and automatic. An approach based on complete backward tree to compose semantic Web services automatically was proposed. It not only added the semantics to Web services, but also had a smaller search space limited to the complete backward tree. Experimental results show that this method improves both the efficiency and the successful ratio of Web services composition.

Approach for effective fractal-based similarity search of stochastic non-stationary time series

Mei-yu SUN Jian-an FANG Xue-bo JIANG Dong-mei YU Yu-ping ZHOU

2008, 28(6):  1431-1434. 

Asbtract ( )   PDF (692KB) ( )  

Related Articles | Metrics

Traditional dimension reduction methods about similarity query introduce the smoothness to data series in some degree that the important features of time series about non-linearity and fractal are destroyed. A high-precision random non-stationary time series method named FSPA was proposed based on fractal theory and R/S analysis, which retained a non-linear time series and important fractal characteristics, and realized the reduction of the dimensions. The experiments have been performed on synthetic, as well as real data sequences to evaluate the proposed method, and the results indicate that the method has higher accuracy and requires less storage space.

Algorithm of finding the best reduction based on reduction significance

Jing-zhi JIANG

2008, 28(6):  1435-1437. 

Asbtract ( )   PDF (422KB) ( )  

Related Articles | Metrics

To solve the problem of choosing a best reduction from several reductions of one decision table, after thinking about the average significance of attributes in reduction and the number of attributes, a new definition named attribute significance was proposed and proved in detail. Then the algorithm of finding the best reduction was presented based on this new definition. Finally, examples demonstrate the usefulness of the algorithm.

Anomaly detection method by clustering normal data

Na-na LI Zheng ZHAO Bo-ying LIU Jun-hua GU

2008, 28(6):  1438-1440. 

Asbtract ( )   PDF (634KB) ( )  

Related Articles | Metrics

A new anomaly detection method was proposed based on positive selection. The method learned the characteristic of "self" space by clustering, and then selected typical samples from every cluster to construct detectors. And positive selection was used to detect anomalies. The new algorithm is not only effective in certain application with large number of "self" samples, but also avoids the shortcoming by randomly selecting sample in VDetector. Experimental results on Ring data and biomedical data show that the new method is more effective in anomaly detection.

Affinity propagation clustering for symbolic interval data based on mutual distances

Xin-xi XIE Shi-tong WANG

2008, 28(6):  1441-1443. 

Asbtract ( )   PDF (628KB) ( )  

Related Articles | Metrics

Clustering for symbolic data is an important extension of conventional clustering, and interval representation for symbolic data is often used. The symmetrical measures in conventional clustering algorithms are sometimes not fit to interval data and the initialization is another severe problem that can affect the clustering algorithms. One metric called mutual distances for interval data was proposed; based on the metric, a new clustering method named affinity propagation clustering that could solve the problem initialization was used. Then, affinity propagation clustering for symbolic interval data based on mutual distance was given. Theoretical explanation and experiments indicate that the proposed algorithm outperforms K-means based on Euclidean distances for the interval symbolic data.

Named entity relation extraction based on SVM training by positive and negative cases

Lu LIU Bi-cheng LI Xian-fei ZHANG

2008, 28(6):  1444-1446. 

Asbtract ( )   PDF (632KB) ( )  

Related Articles | Metrics

Based on the characteristics of the Chinese named entity relation extraction, features were selected and feature vectors were constructed in terms of Chinese morphological, grammar and semantics. Then potential named entity pairs in accordance with the specific entity relation template were extracted and divided into positive and negative cases. Support Vector Machine (SVM) classifier was trained by the positive and negative cases and used to judge the relation of the potential named entity pairs. Experimental results prove that this new method can effectively improve the accuracy of Chinese named entity relation extraction.

Rough-set based approach to solve the inference conflict in qualitative probabilistic network

Shuang-xian LIU Wei-yi LIU Yue-kun YUE

2008, 28(6):  1447-1449. 

Asbtract ( )   PDF (593KB) ( )  

Related Articles | Metrics

Qualitative Probabilistic Networks (QPNs) are the qualitative abstraction of Bayesian networks by substituting the conditional probabilistic parameters by qualitative influences on directed edges. Efficient algorithms have been developed for QPN reasoning. Due to the high abstraction, unresolved trade-offs (i.e., conflicts) during inferences with qualitative probabilistic networks may be produced. Motivated by avoiding the conflicts of QPN reasoning, a rough-set-theory based approach was proposed. The attribute association degrees between node peers were calculated based on the rough-set-theory while the QPNs were constructed. The association degrees were adopted as the weights to solve the conflicts during QPN inferences. Accordingly, the algorithm of QPN reasoning was improved by incorporating the attribute association degrees. By applying this method, the efficiency of QPNs inferences can be preserved, and the inference conflict can be well addressed at the same time.

XML-based mining algorithm of complete frequent query pattern

Chao-xiang CHEN Shi-ping YE Cheng HUA Lin-qiao JIN

2008, 28(6):  1450-1453. 

Asbtract ( )   PDF (590KB) ( )  

Related Articles | Metrics

To study XML query with tree structure modeling, a query and detection method based on tree isomorphism was proposed, systematically enumerating the same root subtree of query pattern tree with the most right branch expansion. In the enumeration process, the Diffset data structure was used to record the query item logo of item set, and the DiffFRSTMiner mining algorithm was proposed. This item set includes the same root subtree. The experimental results prove that the algorithm is efficient, and can reduce definite memory overhead.

Efficient CBIR retrieval method for image database

Min TANG Ai-min YANG

2008, 28(6):  1454-1456. 

Asbtract ( )   PDF (626KB) ( )  

Related Articles | Metrics

How to retrieve similar images from large images database efficiently is a great challenge for content-based image retrieval system. A modified K-means algorithm was proposed to form the hierarchy of the indexing structure. A* search algorithm, triangle inequality principle and N-near neighbours were applied to achieve an optimal search in order to retrieve efficiently for the large image database. Experiments on Corel database show that the proposed algorithm achieves efficient logarithm retrieval.

Reduction tree algorithm based on discernibility matrix

Zhi-guo HUANG Wei SUN Hai-tao WU

2008, 28(6):  1457-1459. 

Asbtract ( )   PDF (456KB) ( )  

Related Articles | Metrics

Aiming at the problem of equivalent conversion from conjunctive normal form to disjunctive normal form, an effective algorithm was proposed to construct reduction tree based on discernibility matrix. The discernibility set was acquired by improving discernibility matrix, and then reduction tree was designed to describe concrete process of getting reductions, finally each path from root to leaf was set to a reduction. This method decreases overhead in forming and storing discernibility matrix, and simplifies the process of acquiring all reductions of decision system.

Text term weighting approach based on latent semantic indexing

Yuan-yuan LI Yong-qiang MA

2008, 28(6):  1460-1462. 

Asbtract ( )   PDF (676KB) ( )  

Related Articles | Metrics

Latent Semantic Indexing (LSI) is a new document retrieval model that has been developed during the last ten years. It is easy to compute and requires less human intervention. Term weighting, which is a difficult problem and of great importance in LSI, was studied in detail. In view of the most popular term weighting algorithms, TF-IDF, which is unreasonable to make use of linear and unable to emphasize the significance of key terms which contribute mainly to the content of a text, a new weighting design based on Sigmiod function and location factor was proposed. The new method highlights the importance of the different terms in documents and is in more favor of constructing the latent semantic space. It was tested in the experimental platform named "Chinese LSI Retrieval Analysis System", and the results show that the new method enhances the performance of LSI information retrieve.

Algorithm of frequent-patterns mining in data stream

Qiong ZHU Rong-hua SHI

2008, 28(6):  1463-1466. 

Asbtract ( )   PDF (610KB) ( )  

Related Articles | Metrics

The limitlessness, mobility, and irregularity of time series data stream make the traditional frequent-pattern mining algorithms difficult to extend to the mining problem of time series data stream. According to the characteristics of time series data stream, a new algorithm for mining the frequent-pattern from a kind of special irregular data stream was proposed, in which, time series data stream was partitioned firstly, and then the local frequent items were mined step by step. Finally, the global frequent items could be mined efficiently based on these local frequent items. After applying the new algorithm in the revenue assurance project of telecommunication field, the results show that the new algorithm has good performance, and can mine frequent-patterns effectively from the irregular data stream of telecommunication field.

Mining frequent closed patterns over data stream

Wen-liang RONG Yan YANG

2008, 28(6):  1467-1470. 

Asbtract ( )   PDF (636KB) ( )  

Related Articles | Metrics

Recently, frequent closed patterns mining has been an important method to replace the frequent patterns mining. According to the features of data stream, a new algorithm called DSFC_Mine was proposed to solve the problem of mining the frequent closed patterns from sliding window. The basic window of a sliding window was served as an updating unit in this algorithm. And all potential frequent closed patterns of every basic window were mined by the improved CHARM algorithm. Those patterns were stored in a new data structure. And the frequent closed patterns in a sliding window could be rapidly found based on the new data structure. The experimental result shows the feasibility and effectiveness of the algorithm.

Network and communications

Formal description and test cases generation of protocols based on input/output sequence

Xiang GU Jian-lin QIU Yan YAN

2008, 28(6):  1471-1474. 

Asbtract ( )   PDF (608KB) ( )  

Related Articles | Metrics

How to use RAISE Specification Language (RSL) to describe protocols was discussed. Description model was input/output sequence based, in which protocols actions were divided into input actions and output actions. All those actions would be elements of describtion. The core of description was central process. A new method to generate testing cases based on formal description using RSL was also discussed. The method was a kind of recursion procedure. Testing cases produced by the method were sound and exhaustive. The research provides a new direction for the protocol formal description and testing.

Stochastic sleeping protocol based on energy and neighbor message in wireless sensor network

Kang-sheng He Ji-shun Kuang Zhuo-shan Yao

2008, 28(6):  1475-1477. 

Asbtract ( )   PDF (478KB) ( )  

Related Articles | Metrics

Scheduling the nodes to work alternately can prolong the network lifetime efficiently. At first, a stochastic sleeping protocol based on energy and neighbor length was introduced. The sensor node gave a sleep probability related to its own energy and neighbor message, so those nodes with less energy and more working neighbors would get a large sleep probability. Furthermore, analysis and simulation were provided with other two protocols. The results show that the protocol can reduce the number of working nodes and guarantee a high coverage rate.

HCache：An efficient hybrid P2P Web caching system

Tian-liang LI Lei SHI

2008, 28(6):  1478-1480. 

Asbtract ( )   PDF (585KB) ( )  

Related Articles | Metrics

Current P2P Web caching system caches too many duplicates in the system. To solve the problem, an enforced hybrid caching system named HCache was proposed. HCache can reduce the duplicates, by choosing which objects should be cached due to the user's access characteristic and Web priority. The popularity of the Web object was used to improve the LRU replacement (called ELRU), which enhanced the ratio of the P2P Web caching system. In the trace-driven simulation, the result shows that HCache achieves better hit ratio and performance.

Algorithm of mobility anchor point selection in hierarchical mobile IPv6

Wei-xin CHEN Lin LIN Guo-dong HAN

2008, 28(6):  1481-1485. 

Asbtract ( )   PDF (713KB) ( )  

Related Articles | Metrics

To improve the performance of Mobility Anchor Point (MAP) selection algorithm for Hierarchical Mobile IPv6 (HMIPv6), a novel algorithm supporting load sharing was proposed. The algorithm utilized MAP's preference value to characterize the load on that MAP, introduced sharing threshold to judge whether the MAP called "quasi-MAP" had overloaded, and adjusted the selection policy dynamically by the judgment. It is easy to implement. Simulation results indicate that the proposed algorithm reduces protocol cost greatly and has a good effect on load sharing.

Behavior-based coverage optimization approach in wireless sensor network

Jing CHEN

2008, 28(6):  1486-1489. 

Asbtract ( )   PDF (645KB) ( )  

Related Articles | Metrics

For hybrid wireless sensor networks with mobile nodes, to optimize the coverage performance, based on the subsumption architecture, a kind of behavior-based control strategy for mobile nodes was proposed. Five basic behaviors were designed, i.e., Stop, Wander, Avoid_Static_Node, Avoid_Mobile_Node and Move_To_Coverage_Hole. And the competition and suppression mechanism for choice of behavior were used. Simulation results show the validity of the algorithm.

Design and implementation of ASN.1 module in DSRC

Bo TANG Neng WANG

2008, 28(6):  1490-1493. 

Asbtract ( )   PDF (646KB) ( )  

Related Articles | Metrics

Based on the study of the application layer of Dedicated Short Range Communication (DSRC) protocol stack, as for the ASN.1 PER encoding and decoding module, a framework for encoding and decoding was designed and implemented, which included ASN.1 mapping rules, a general procedure for encoding and decoding, and a memory management method specifically designed for small devices. The framework is of good generality because of well-organized modules. The test results show that the framework has good performance, and it meets the real-time requirement of the protocol.

Research of the sleep mode based on IEEE 802.16e

2008, 28(6):  1494-1497. 

Asbtract ( )   PDF (537KB) ( )  

Related Articles | Metrics

The IEEE802.16e standard introduces two types of sleep modes for energy-efficient operations: Sleep Mode Ⅰ based on binary-increasing sleep cycle size and Sleep Mode Ⅱ using constant sleep cycle size. Firstly an analysis of energy consumption and delay performance about two modes was given. Then a sleep mode selection algorithm to meet the requirement of energy consumption and delay performance by using Markov decision processes was made. The trade-offs between energy consumption and delay performance among different operational modes was met. Through the simulation the performance of this selection algorithm can be seen.

ICMP-based method for logical network topology discovery and analysis

Jie LIU Qing-xian WANG Jun-yong LUO

2008, 28(6):  1498-1500. 

Asbtract ( )   PDF (535KB) ( )  

Related Articles | Metrics

The faults of SNMP-based method for network topology discovery were analyzed. Then an ICMP-based method for logical network discovery and analysis was presented, which included the discovery and analysis of router topology and the analysis of subnet topology. Path probing and alias probing technologies were used in router topology discovery. The IP addresses of router aliases and the relationship of aliases not in identical subnet were used as basis in subnet topology analysis, and a solution was given to the problem of subnet overlapping.

Graphics and image processing

Two-phase video shot boundary detection approach with various step-length

Yong-ping CHEN Qing-sheng ZHU Yao GE

2008, 28(6):  1501-1503. 

Asbtract ( )   PDF (613KB) ( )  

Related Articles | Metrics

Histogram approach often leads to many false detections and missing detections in shot boundary detection, while edge feature-based approach suffers high computation cost. An improved detection approach that took advantage of the two approaches was proposed, namely, first the shot boundary was detected using histograms, and then based on previous results the second detection was applied with edge feature and various step length. The experimental results show that the new method increases recall and precision without increasing computation cost.

Efficient adaptive motion estimation search algorithm

Min SHI Qing－ming YI

2008, 28(6):  1504-1506. 

Asbtract ( )  

Related Articles | Metrics

A novel fast motion estimation algorithm called M-DAHS based on motion vector field, adaptive direction and half-pixel search was proposed. According to center-bias property and spatial-temporal correlation of the vector field, the threshold was applied to stop the stationary block from searching. The initial search point and strategy were adaptively selected based on motion type for non-stationary block. The search template has strong direction adaptability. The line-diamond search was used for the blocks with low motion activity, and the hexagon-diamond search for that with middle or high motion. After searching all the pixels, a cross priority search pattern was utilized for half-pixel search. Experimental results show that the proposed algorithm has good performance with high search speed and high precision, while the distortion is almost the same as full search algorithm.

Adaptive image denoising based on modified orthonormal finite ridgelet transform

Ping XIA Xue-jun XIANG Jun-li WAN Li-hua DENG

2008, 28(6):  1507-1509. 

Asbtract ( )   PDF (482KB) ( )  

Related Articles | Metrics

One kind of Modified Orthonormal Finite Ridgelet Transform (MOFRIT) was brought forward. The information Radon coefficient wrap-around of the line on a finite field was caused by the modular arithmetic so that the Radon coefficient information in the periodic oscillations direction was processed with discrete cosine transformation, and other direction information was processed with wavelet analysis in order to reduce the wrap-around of rebuilding information. At the same time, according to the characteristic of the noise, one kind of denoising threshold selection plan was proposed. Experimental results show that the details of the signal with above algorithm are more effectively retained and the denoising image PSNR value is higher than the value of OFRIT+Wiener and 2D-DWT.

Curves interpolating on adjustable surface

Yao-lin GU Ti-wei ZHEN

2008, 28(6):  1510-1513. 

Asbtract ( )   PDF (621KB) ( )  

Related Articles | Metrics

An algorithm with multi-features for curves interpolation on adjustable surface was proposed. Similarity parameter of the result surfaces was introduced and the control mesh was modified topologically so as to meet the requirement of curves interpolation and maintain the different similarities between result surface and initial control networks at the same time. Two-side adjustable parameters were introduced. It used the predefined curvature to adjust the bended degree of the curves and created the curvature control formula. The result shows it is available to the curve interpolating adjustable surfaces and the extremely surfaces are diverse.

Automatic multi-view point cloud merging algorithm used in structure light measure system

Xiang-qian CHE Can ZHAO Xiang-lin MENG Jun-yan CHEN Guo-quan WANG

2008, 28(6):  1514-1516. 

Asbtract ( )   PDF (663KB) ( )  

Related Articles | Metrics

An automatic multi-view point cloud merging algorithm for structure light measure system was presented. Firstly, an improved region identification integrated with least-squares algorithm was used to compute the center of the reference point accurately, and the 3D coordinate of the reference point was ascertained through the theory of machine vision. Then, based on the invariability of spatial character, a rapid reference point matching algorithm was put forward to acquire the corresponding relationship between the reference points with different visual angles. Lastly, the rotation matrix and translation matrix were computed by quaternion decompose algorithm to carry out the automatic multi-view point cloud merging algorithm. The result of the experiments shows the validity and great practicability of the algorithm.

Image denoising based on Contourlet transform and total variation

Wei-yan SHEN Zhi-hui WEI Qiu-feng DUAN

2008, 28(6):  1517-1519. 

Asbtract ( )   PDF (485KB) ( )  

Related Articles | Metrics

In order to overcome the oscillation phenomenon and preserve more details in image denoising, a recently proposed Contourlet transform was used, which was an efficient directional multi-resolution image representation and behaved much better than the wavelet transform in capturing fine details, e.g., the edge and the texture. Unlike most conventional Total Variation (TV) minimization techniques in image processing, the TV regularity in this paper was directly imposed on the Contourlet domain. The proposed method performs efficient image denoising with fewer artifacts, and achieves a better compromise between noise removal and edge preservation.

New image restoration model for PDE based on LIP

Wei JIANG Xue-gang HU

2008, 28(6):  1520-1522. 

Asbtract ( )   PDF (605KB) ( )  

Related Articles | Metrics

On the basis of Logarithmic Image Processing (LIP) mathematic model, and combined with Total Variation (TV) image restoration method, a new image restoration model was proposed, named LIP_TV. The model compensated the disadvantage of classical restoration methods, and it was also consistent with some characteristics of human brightness perception. The simulation shows that the new model can better restore image and maintain the edge texture characteristic of the image nicely.

Method for unsupervised text location based on brightness grading and direction density

Qiong LIU Hui-can ZHOU Yao-nan WANG

2008, 28(6):  1523-1526. 

Asbtract ( )   PDF (693KB) ( )  

Related Articles | Metrics

A method for unsupervised text location based on brightness grading and direction density was proposed, which was according to the fact that text in scenes generally has strong contrast with local background. Brightness grading was made in R, G, B color layers separately to decrease the complexity of the background. After that, by using the characteristic of obvious directionality of text strokes, a rough text location was carried out according to direction density. And then, precise discrimination was implemented with a SVM multi-class classifier. The mentioned method overcame the difficulty to choose color clustering number in common unsupervised ways, and constrained the types of candidate areas. Hence the difficulty of training SVM classifier was reduced. Those made the new method had higher accuracy and robustness.

Watershed segmentation algorithm for medical image based on anisotropic diffusion filtering

Jia-xin CHEN Ying WU Wei LI

2008, 28(6):  1527-1529. 

Asbtract ( )   PDF (715KB) ( )  

Related Articles | Metrics

Although watershed transformation is a powerful tool for image segmentation, it might give rise to over-segmentation. A novel medical image segmentation algorithm based on anisotropic diffusion filtering using watershed transformation was proposed. First, input image was got through adaptive anisotropic diffusion filter, and then, a multi-scale morphological grads image was obtained as the input of watershed so as to give prominence to the contours of the image and smooth the areas with even luminance. Experiments show that the algorithm can restrain the over-segmentation phenomena effectively, thus obtaining good segmentation results.

Improved algorithm of fractal image coding based on neighbour-searching

Zi TENG Hui-wen DENG Jiu-jun YANG

2008, 28(6):  1530-1532. 

Asbtract ( )   PDF (613KB) ( )  

Related Articles | Metrics

Fractal image coding has high compression ratio, but the traditional fractal compression encoding method has the disadvantage of long processing time, because they need a lot of searching and matching for each range block to find a suitable domain block. This study shows that the domain block matching most of the range block is in the vicinity of the range block. According to this conclusion, an improved algorithm of fractal coding based on matching in range block's neighbourhood searching was presented, and the scope of the search was reduced by the information entropy difference of image block. In addition, the error image was coded as a supplement to improve the quality of the decoded image. Experimental results show that the coding time can be reduced greatly while the quality of reconstructed image is not much influenced.

Intelligence perception

Application of pitch synchronization dynamic frame-length features in English lexical stress detection

Nan CHEN Qian-hua HE Wei-ning WANG Rong-yan CHEN

2008, 28(6):  1533-1536. 

Asbtract ( )   PDF (645KB) ( )  

Related Articles | Metrics

Lexical stress is an important prosodic feature, especially for stress-timed language such as English. To overcome the defects of fixed frame-length features, pitch synchronization feature analysis method was proposed while Pitch Synchronization Energy (PSE) and Pitch Synchronization Peak (PSP) features were defined and extracted. Their contributions, along with traditional features and their combinations, to English lexical stress detection were evaluated with ISLE database. Experimental results show that the combination of new feature and traditional features demonstrates a 6.65% error rate reduction compared with using traditional ones.

Scene classification based on block latent semantic

Pu ZENG Ling-da WU Jun WEN

2008, 28(6):  1537-1539. 

Asbtract ( )   PDF (683KB) ( )  

Related Articles | Metrics

A novel scene classification method was presented based on block latent semantic. The image blocks were first extracted on a regular grid and the visual words in blocks were used to describe every block, and then block latent semantic models were achieved by using Probabilistic Latent Semantic Analysis (PLSA). The latent semantic model was used to find the latent semantic in image block and their spatial distribute in image. Finally, this feature was used to construct a SVM model to classify scene. Experimental results show that this method has satisfactory classification performances on a large set of 13 categories of complex scenes.

Chessboard grid corners detection based on geometric symmetry

Xiao-jun TAN Zhi-hao GUO Zhi JIANG

2008, 28(6):  1540-1542. 

Asbtract ( )   PDF (488KB) ( )  

Related Articles | Metrics

A new algorithm was proposed based on the geometric symmetry to detect grid corners. The method can be utilized in camera calibration where chessboard-like patterns were often used. Based on the observation of the geometric symmetry of such patterns, the new algorithm could be regarded as a coarse-to-fine process. Coarse detection defined the corner candidates and then precise extraction was used based on symmetry analysis. Experimental results show that the algorithm assures an efficient and accurate detection and the procedure can be carried out automatically.

Infrared moving object tracking based on particle filter

Yong YU Lei GUO

2008, 28(6):  1543-1545. 

Asbtract ( )   PDF (485KB) ( )  

Related Articles | Metrics

A novel infrared moving object tracking method based on particle filter and Mean Shift algorithm was presented. Firstly, it utilized the intensity distribution to represent infrared object, and constructed the observation probability model by statistical histogram. Then, Mean Shift algorithm was incorporated into the propagating process of particle filter, which induced particles distributing within the local area of observation. Compared to the conventional particle filter, the proposed method used much fewer particles to maintain the multi-mode distribution, and overcame the degeneration problem effectively. Experimental results on sequential images show that our method can track steadily when the object moves fast or is occluded, the overall performance of the proposed method is better than traditional particle filter algorithm.Experimental results on sequential images show that our method can track steadily when the object move fast or be occluded, the overall performance of the proposed method is better than traditional particle filter algorithm.

Speaker recognition based on hybrid particle swarm optimization algorithm

Xun-xi XU Fang CHENG

2008, 28(6):  1546-1548. 

Asbtract ( )   PDF (467KB) ( )  

Related Articles | Metrics

The traditional training methods of Gaussian Mixture Model (GMM) are sensitive to the initial model parameters, which often leads to a local optimal parameter in practice. To resolve this problem, a new GMM optimization method was proposed based on Particle Swarm Optimization (PSO). It utilized Maximum Likelihood (ML) algorithm in the PSO iteration and provided a new architecture of hybrid algorithm. Because of the global optimization characteristic of the particle swarm optimizer method and the strong local searching capacity of ML, it can obtain model parameters with high precision. Experiment for text-independent speaker identification shows that this method can obtain more optimum GMM parameters and better results than the traditional method.

Face recognition based on fuzzy chaotic neural network

Chun-jiang PANG Wan-qing GAO

2008, 28(6):  1549-1551. 

Asbtract ( )   PDF (632KB) ( )  

Related Articles | Metrics

For its sensitive dependence with the Initial value, chaos can be applied to the pattern recognition of the ones with extremely small difference. An algorithm based on chaotic neural network was proposed and used for face recognition. For introducing chaotic noise, the network obtains a better anti-jamming. It can avoid being affected by the factors such as illumination and gesture. And many complex feature extractions can be avoided. Experimental results based on ORL face database show that the precision of the chaotic neural network algorithm is higher and the iteration steps are fewer and the speed of convergence is quicker. Chaotic neural network used for face recognition is effective and it can enhance recognition rate.

Joint algorithm for permutation problem in frequency-domain blind speech source separation

Jian-jian ZHU Hu-xiong LI

2008, 28(6):  1552-1554. 

Asbtract ( )   PDF (627KB) ( )  

Related Articles | Metrics

A new method for solving the permutation problem in the frequency-domain Blind Source Separation (BSS) was presented. This new method divided the whole frequency-domain into three sections and applied different permutation algorithms to different sections. The neighboring frequency correlation and harmonic frequency correlation coefficient of signal amplitudes were used together for the low-frequency section, the direction of arrival estimation for speech sources for the mid-frequency section, and the combination of correlation coefficient comparison and direction estimation for the high-frequency section, respectively. Experimental results show that the new method provides a more robust and precise solution to the permutation problem than the algorithm only with interfrequency correlation coefficient of signal amplitudes or only with direction of arrival estimation for sources.

Artificial intelligence

Universal approximation of fuzzy functions by polygonal fuzzy neural networks

Chun-mei HE You-pei YE Wei-hong XU

2008, 28(6):  1555-1558. 

Asbtract ( )   PDF (524KB) ( )  

Related Articles | Metrics

A new fuzzy neural network model was presented based on the fuzzy arithmetic of polygonal fuzzy numbers and a new extension principle. When the inputs are negative, the relevant feed-forward three-layer polygonal fuzzy neural networks were proved to be universal approximators of continuous fuzzy functions. The equivalent condition under which the fuzzy function universal approximated by the polygonal FNN should be satisfied was given. A simulation example was introduced in the end.

PSO algorithm connected with neural network for solving a class of 0/1 optimization problems

Yu-hong DUAN Yue-lin GAO

2008, 28(6):  1559-1562. 

Asbtract ( )   PDF (534KB) ( )  

Related Articles | Metrics

A hybrid PSO algorithm was proposed, where the Hopfield manpower neural network with better local searching ability was combined with PSO for solving a class of 0/1 knapsack problem. The current global optimum chromosome activated the neural network and obtained a local optimum state that was used to replace the current global optimum chromosome in this algorithm. Local optimization ability of the algorithm was strengthened. Numerical test shows that this algorithm is effective.

Improved concept similarity computing approach in Ontology mapping

Gui-hua NIE Xiu-ran ZUO Dong-lin CHEN

2008, 28(6):  1563-1565. 

Asbtract ( )   PDF (464KB) ( )  

Related Articles | Metrics

Ontology mapping is a preliminary work to realize the communication between different Ontologies. The current studies on ontology mapping approaches mainly focus on fulfilling mapping process automatically or semi-automatically and enhancing the precision of concept similarity. The key of ontology mapping is to compute the concept similarity, single concept similarity computing approach is not in favor of improving precision of the result. In view of the above shortcomings, an improved concept similarity computing approach was proposed and described in detail. The property semantic similarity of this approach improved the existing approaches to the similarities of both data type property and object type property. It is proved that this approach is effective and has high precision.

FLPI: An optimal algorithm for document indexing based on LPI

Jian-wen TAO

2008, 28(6):  1566-1569. 

Asbtract ( )   PDF (682KB) ( )  

Related Articles | Metrics

LPI is optimal in the sense of local manifold structure. However, LPI is not efficient in time and memory, which makes it difficult to be applied to very large data set. Therefore, an optimal algorithm called FLPI was proposed. FLPI decomposed the LPI problem into a graph embedding problem plus a regularized least squares problem. Such modification avoids eigen decomposition of dense matrices and can significantly reduce both time and memory cost in computation. Moreover, with a specifically designed graph in supervised situation, LPI only needs to solve the regularized least squares problem which is a further saving of time and memory. Experimental results on real data show that FLPI obtains similar or better results compared to LPI and it is significantly faster.

Multi-objective evolutionary algorithm based on neighborhood

Mi-qing LI Jin-hua ZHENG Biao LUO Jun WU Shi-hua WEN

2008, 28(6):  1570-1574. 

Asbtract ( )   PDF (684KB) ( )  

Related Articles | Metrics

Population maintenance is an important issue in multi-objective evolutionary algorithms. For the deficiency that the maintenance methods of good distribution usually have a high time complexity, a multi-objective evolutionary algorithm based on neighborhood (named NMOEA) was proposed. This measure defined a criterion-neighborhood containing relation, which represented the close degree of individuals. And it was used to assign diversity fitness in a dynamic method that maintained the population rapidly. By examining three performance metrics on seven test problems, the new algorithm can approach the true Pareto front fast, and has good distribution.

Chinese question answering pattern learning based on self-training mechanism and Web

Zhi-sheng LI Yue-heng SUN Pi-lian HE Yue-xian HOU

2008, 28(6):  1575-1577. 

Asbtract ( )   PDF (585KB) ( )  

Related Articles | Metrics

In the past, the learning for QA pattern relies on the labeled data, and the definition of pattern and the scoring method for the candidate answers are over simplified. The verb and noun sequence was extracted as the skeleton pattern to expand definition of QA pattern. In the learning process, a learning mechanism was established based on self-training. At first, the initial study was completed on a labeled QA pair, then the system would automatically select the reliable data for self training through searching in the Web while the system was running. The scoring method of the candidate answers was also improved by applying several heuristic rules. The experimental results show that the performance of Chinese QA system based on our method is improved significantly.

Semantic-based service matching algorithm in pervasive computing environments

Qing-cong LV Qi-ying CAO

2008, 28(6):  1578-1581. 

Asbtract ( )   PDF (592KB) ( )  

Related Articles | Metrics

The use of semantic descriptions of services helps automated service discovery in pervasive computing environment. A semantic-based flexible service matchmaking approach was presented. This approach matched services based on the aggregated similarities of service type, input/output parameters and QoS parameters, and used service type, input/output parameters filtering to prune out incompatible services. At last, it may select services according to the similar function. Experimental results prove that this approach has good performance to be used in pervasive computing environment.

Fault diagnosis based on fuzzy inference graph

Hai-ying ZHOU Su-rong DONG

2008, 28(6):  1582-1584. 

Asbtract ( )   PDF (408KB) ( )  

Related Articles | Metrics

A fuzzy fault diagnosis inference graph was built according to the architecture of the system modules. The minimization of fault diagnosis was realized by simplifying fuzzy inference graph and employing fuzzy operations. Based on feature criteria of observation positions, a diagnosis matrix was formed to carry out successive inference through cause-effect. As a result, a fuzzy diagnosis rank was obtained, which optimized the diagnosis detection.

Grid resource selection optimizing based on QoS parameters integrated model

Man-fu MA Jun YAO Xiao-niu WANG

2008, 28(6):  1585-1587. 

Asbtract ( )   PDF (503KB) ( )  

Related Articles | Metrics

QoS is a key requirement for applications to ensure tasks running in grid, but the processing of QoS parameters is too complicated currently. A new grid QoS model that optimized the QoS process was proposed. As to the model requirement, QoS infrastructure was presented, and scheduling optimizing algorithm was described based on the model. The experiments show that the scheduling optimizing algorithm is efficient on task completion time and improves the resource utilization ratio within grid computing economy environments.

Grid resource distribution based on fuzzy multi-objective decision making

Jian-hong FENG Ying LIU Ying LUO Wen-guang CHEN

2008, 28(6):  1588-1590. 

Asbtract ( )   PDF (601KB) ( )  

Related Articles | Metrics

A new strategy of resources distribution based on fuzzy decision making was provided, and a model of multi-objective fuzzy decision making was built to solve the resources distribution problems in grid computing. Also implementation of the strategy was described. Analysis proves that this model not only provides the best resources to tasks, but also enhances the success of matching resources and the efficiency of using resources.

Binary tree data structure based on sequential storage model in DNA computer

Ya-li ZHU Ken-li LI

2008, 28(6):  1591-1594. 

Asbtract ( )   PDF (602KB) ( )  

Related Articles | Metrics

Design of data structure is valuable to the concrete realization of DNA computer. Therefore, a method of designing a binary tree based on sequential storage model in DNA computer was proposed, which utilized the biological characteristics of DNA molecules and restriction endonucleases to complete sequential storage structure and basic operations of the binary tree. All the biological technology mentioned here could be practically implemented in the laboratory. To prove the feasibility of this method, an actual binary tree with detailed nucleotide encodings and an instance of algorithm were given. The process of an algorithm implemented on this binary tree was demonstrated.

Similarity measures between Vague sets based on (tx, fx) expansion and its application

Xiao-fang FU Fu-jin ZHANG Hong-xu WANG

2008, 28(6):  1595-1597. 

Asbtract ( )   PDF (423KB) ( )  

Related Articles | Metrics

Three series of similarity measures formulas between Vague sets based on three-dimensional representation and (tx, fx) expansion and fuzzy set operations were presented. The thoughts and an example of applying the similarity measures between Vague sets to the network information filtered problem were given. This example shows that the new formulas are practicable.

Tasks mapping in grid computing environment based on ACO algorithm

Yi-ming TAN Miao ZHANG De-xian ZHANG

2008, 28(6):  1598-1600. 

Asbtract ( )   PDF (453KB) ( )  

Related Articles | Metrics

In order to optimize the tasks mapping in grid, a grid tasks mapping algorithm based on Ant Colony Optimization (named ACO-GTM) was proposed. The algorithm generated initial solutions through these artificial ants traversed on the construction graph and optimized these initial solutions by using the Best-improvement 2-opt local search algorithm. It combined the global and local pheromone updates. The experiments show that the proposed algorithm for the mapping problem has better performance than other algorithms on optimum makespan and load-balancing.

Typical applications

Approach to collaborative filtering recommendation based on HMM

Guang-qiu HUANG Yong-mei ZHAO

2008, 28(6):  1601-1604. 

Asbtract ( )   PDF (613KB) ( )  

Related Articles | Metrics

Considering that browse route, browse time, browse times and so on are the important factors to influence the accuracy of commendation, a dynamic collaboration filtering recommendation method based on Hidden Markov Model (HMM) was proposed. First, it simulated users' behaviors while a user was browsing Web pages, and set up the nearest-neighbor set according to his behaviors. Because the data it used was not users' rating but users' browse route, the problem of data sparseness and initial rating was resolved. When HMM was used to replace the similitude model to measure users' similarity, the accuracy of nearest-neighbor commendation was improved greatly. And it settled the on-time recommendation problem and the extensible data space problem. Then the concept of fancy degree was set up, which made the recommendation become more suitable. Finally, the fancy degree was applied to establish the prediction model of dynamic collaboration filtering recommendation. A case study shows the excellent performance of this model.

Byte access method for wide data bus memory based on FPGA

Xiao-xi REN Ke-huan ZHANG Ren-fa LI

2008, 28(6):  1605-1607. 

Asbtract ( )   PDF (448KB) ( )  

Related Articles | Metrics

It is a widely accepted approach to use wide data bus to increase the data accessing speed. However, this method causes the inconvenience on reading and writing data in bytes. The common operation mechanism of current mainstream SDRAM memory chip was analyzed, and a new byte alignment method was proposed for the SDRAM controller. Based on the given byte-address and input data, the new method could generate correct address and byte control signals, also aligned the bytes to the corresponding positions. The architecture and processing flow were illustrated in detail, as well as the implementation on Field Programmable Gate Array (FPGA) chips. Compared with other schemes based on memory cache and twice-memory-access, this method costs fewer hardware resources and memory bandwidth.

Scheduling approach for non real-time applications in open real-time system based on two-level scheduling scheme

Yong-xian JIN Jing-zhou HUANG Jian-guo WANG

2008, 28(6):  1608-1611. 

Asbtract ( )   PDF (728KB) ( )  

Related Articles | Metrics

In an open real-time system, the coexistence of different kinds of real-time and non real-time applications makes the system scheduling mechanism face new requirements and challenges. One scheduling mechanism of the open systems was introduced, and that the nonpreemptable sections may influence system schedulability in non real-time applications scheduling was pointed out. And then, a scheme which can remedy the limitations about the previous scheduling scheme was presented and the two-level scheduling scheme of open real-time system was improved. Ultimately, the schedulability of hard real-time applications, soft real-time applications and non real-time applications was guaranteed.

Methodology of feature change detection and matching in data updating

Jiang-hua WU Zhong-liang FU

2008, 28(6):  1612-1615. 

Asbtract ( )   PDF (651KB) ( )  

Related Articles | Metrics

In the case of lack of correlation between identical entities in feature classes, the identical entity for the current feature and their change information was automatically identified by spatial analysis. When searching candidate matching collection for the current feature, a spatial query based on self-definition spatial topological relationship was designed, which narrowed the search scope, reduced the query time, and increased spatial analysis efficiency. When confirming the identical entity for the current feature, a weight-based similarity computing model was presented, and this effectively matched features in the circumstances of complex spatial relationships and improved the accuracy of matching.

Integrating WSN into EPCglobal: the environment-aware supply chain supervision

Lei PENG Hai YUAN Lei WU Jia-zhi ZENG

2008, 28(6):  1616-1619. 

Asbtract ( )   PDF (820KB) ( )  

Related Articles | Metrics

The Supply Chain Management (SCM) would not be a private work to one specific enterprise since the open and multi-partners joint mode is born with the development of EPCglobal, the booming architecture of global SCM. Through the Electric Product Code (EPC) tag on objects and the distributed information system, EPCglobal provides the circulating goods with a corresponding information chain, through which users can trace the supply chain back to the origin. Considering the essentials and development trends of SCM, the more directly SCM communicates with the circumstances, the more effective the supervision on SCM is. Therefore, a framework that integrated WSN into EPCglobal was proposed, and the information of EPC tag and environment-aware data was bound seamlessly. The integration scheme could power the EPCglobal's ability to acquire and process the data in producing and storing. Also a unified interface was provided to help users access the combined data simply. To integrate WSN and EPCglobal not only is another try to combine two heterogeneous networks skillfully, but also broaden and deepen the information management of supply chain.

Modeling and analyzing of simulation based on non-cooperative games for multiple emergency locations in resources scheduling

Ji-jun YANG Sheng-wei XU Wu-jun HUANG Qi-di WU

2008, 28(6):  1620-1623. 

Asbtract ( )   PDF (621KB) ( )  

Related Articles | Metrics

As emergency happens, the scheduling of rescue resources to multiple emergency locations is a realistic and intricate problem, especially when the available resources are limited. After analyzing the competition requirements of multiple emergency locations, a non-cooperative games model and algorithm for scheduling of rescue resources was presented. In the model, the players corresponded to various emergency locations, strategies to all resources scheduling and the payoff of each emergency location to the reciprocal of its scheduling cost. Thus, the optimal scheduling results were determined by the Nash equilibrium point of this game. Then the iterative algorithm was introduced to seek out the Nash equilibrium point. A numerical case test was given to demonstrate the feasibility and availability of the model.

Shared running cache algorithm with supporting video VCR operation

Wei-hua LUO Jian YANG Quan ZHENG Han HU

2008, 28(6):  1624-1626. 

Asbtract ( )   PDF (493KB) ( )  

Related Articles | Metrics

VCR operations are important functions of streaming media servers. Most of conventional caching algorithms implemented by media servers do not consider the impact of VCR operations. Based on the SRB algorithm and combining patching technology, a kind of shared cache algorithm named SRC-SV was proposed, which supported VCR operations. The simulation results show that the SRC-SV algorithm can be used to handle VCR operations and be effective in reducing consumption of server's load and backbone bandwidth.

High performance implementation of factoring multivariate polynomials based on NTL

Xiao-lin QIN Yong FENG Jun LI

2008, 28(6):  1627-1629. 

Asbtract ( )   PDF (433KB) ( )  

Related Articles | Metrics

Due to the difficulty of factoring multivariate polynomials, a new implementation of high performance named HPFMF was proposed based on NTL and the existence of factorization algorithms. The NTL was introduced and how to apply the library to implement the algorithms of number theory and computer algebra was discussed. The factoring multivariate polynomials was successfully designed and implemented. Experimental results show that the method is more efficient than factor in Maple 11 for multivariate polynomials.

Reliability model of component-based software

Na-qin ZHOU You-sheng ZHANG

2008, 28(6):  1630-1631. 

Asbtract ( )   PDF (407KB) ( )  

Related Articles | Metrics

Component-based software was considered as Markov process. To attach more attention to the reliability of links and become fit to different Markov process states, different state components and link use frequency computing models were proposed. Then, the calculation method for reliability of component-based software was presented, and an example was also given. Compared with traditional methods, the proposed method not only provides a more accurate analysis method for the reliability of software, but also widened the application of the model.

Recursive algorithm for generating layer patterns for strip packing

Dong-li HE Yao-dong CUI

2008, 28(6):  1632-1634. 

Asbtract ( )   PDF (456KB) ( )  

Related Articles | Metrics

The strip packing problem was studied. The algorithm divided the strip into layers with horizontal cuts. The width of a layer was equal to the strip width, and the height was the same as that of the leftmost item in the layer. The algorithm used a recursive procedure to arrange the layers on the strip, selected the leftmost item for each layer, and determined the item layout on each layer. Branch-and-bound techniques were used to shorten the searching space. The computational results indicate that the algorithm is more efficient than several recent algorithms.

Model of business programming based on service virtualization

Jia-xian ZHU Wei-hua BAI

2008, 28(6):  1635-1638. 

Asbtract ( )   PDF (644KB) ( )  

Related Articles | Metrics

To enhance the agility of the E-Business system and to reduce the IT technology requirement for personnel in system maintenance or building a new business function in the system, a service virtualization layer between the business personnel and the Web Service Management Agent (WSMA) was built to establish a business programming model. New function of the E-Business system could be built agilely by the business personnel who can do it by business programming.