Loading...

Table of Content

    01 May 2008, Volume 28 Issue 5
    Network and communications
    Fault diagnosis for Web service composition based on Bayesian network
    Xiao-dong FU Ping Zou Zhen-Hong SHANG Ying JIANG
    2008, 28(5):  1095-1097. 
    Asbtract ( )   PDF (1296KB) ( )  
    Related Articles | Metrics
    A fault diagnosis model based on Bayesian network to identify the most likely problematic services in a Web service composition process was proposed. The Bayesian network topology construction method and the parameters configuration method were specified respectively in detail. A fault diagnosis algorithm based on the Bayesian network was proposed and the algorithm was analyzed. The experimental simulation show that the model can rule out the root cause of the problems in the Web service composition process effectively and efficiently.
    Research of parallel recommendation algorithm based on idiotypic artificial immune network
    2008, 28(5):  1098-1100. 
    Asbtract ( )   PDF (1048KB) ( )  
    Related Articles | Metrics
    This paper analyzed the problem of recommendation quality degradation resulting from the lack of the nearest neighborhood users set's diversity in Collaborated Filtering Algorithm, and then proposed the Parallel Immune Network Recommendation algorithm (PINR). The algorithm achieves improvement in the real-time response speed while maintaining the maximum diversity of neighborhood users set. The preliminary experiment shows the feasibility, correctness and the advantage in parallel computing of this algorithm.
    Optimal path algorithm with multi-constrained condition
    yong-gui zou lai wei
    2008, 28(5):  1101-1103. 
    Asbtract ( )   PDF (800KB) ( )  
    Related Articles | Metrics
    Traditional heuristic algorithm converts the NP-complete problem to a simpler one that can be solved in polynomial time. However, it cannot guarantee a solution all the time. In this paper, the Lagrange relaxation was applied to traditional heuristic algorithm to improve the successful rate of finding an optimal path and to reduce the time complexity. Finally, the correctness and effectiveness of this algorithm are proved through experiment and analysis.
    Ad Hoc energy constrained routing protocol
    2008, 28(5):  1104-1106. 
    Asbtract ( )   PDF (909KB) ( )  
    Related Articles | Metrics
    The Ad Hoc network is an energy constrained system with the portable devices. Whether it has a longer lifecycle of the network or not is an important routing protocol standard. Based on the mobile network node energy level and using the different forward tactics, this paper presented an Energy Constrained Routing Protocol (ECRP). The routing protocol not only made the system energy consumption low but also prolonged the lifecycle of the system and improved the delay characteristic. In this paper, the proof of correctness and complexity analysis of ECRP were given. The simulation result shows that ECRP has a better delay performance, a lower energy consumption and longer lifecycle of the network than the other two and provides an available approach to Ad Hoc networks routing.
    Traffic control based on IXP2400
    Xie Xi 谢希
    2008, 28(5):  1107-1110. 
    Asbtract ( )   PDF (1115KB) ( )  
    Related Articles | Metrics
    Network Traffic Control (TC) is to satisfy the needs of Different Services in network .With the premise of providing business reliability, delay, delay jitter, throughput, packet loss rate, it takes full use of scheduling mechanism to control the states of all the business flows. Based on the Intel IXP2400 platform, this paper achieved better network traffic control through changing and judging the Type of Service(ToS) field of IPv4 header.
    Research of adaptive receivers for TH-UWB systems
    2008, 28(5):  1111-1113. 
    Asbtract ( )   PDF (1090KB) ( )  
    Related Articles | Metrics
    In this paper, a new RAKE receiver was proposed for Ultra-Wide-Band (UWB) wireless communication systems. The receiver was composed of modified recursive least square (RLS) filters, which used the gradient-based variable forgetting factor to track time-varying channels and hence provided better channel estimation than the typical RLS and Maximum Likelihood (ML) algorithms. The results show that the proposed receiver has better performance in tracking time-varying fading channels and it also helps obtain lower Bit Error Rate (BER) for UWB systems.
    Efficiency bottlenecks analysis and solution of Web crawler
    Jiang YIN Zhi Ben YIN Hong HUANG
    2008, 28(5):  1114-1116. 
    Asbtract ( )   PDF (960KB) ( )  
    Related Articles | Metrics
    The efficiency of a web crawler determines the quality of services a web searching system offers to its users. How to design a more efficient and faster web crawler is becoming a hot issue in the research of web crawler. In order to raise the crawling efficiency of a web crawler, the crawling strategy needs to be reformed. Besides, the design of the web crawler system has to be optimized and its structure also needs to be improved to eliminate bottlenecks. In this paper, an improved scheme of designing a general web crawler was presented through analyzing crawler's structure, application environment and user requirement, and the preferable testing result has proven better efficiency it has.
    A Novel Energy and Distance Based Network Protocol for WSN
    2008, 28(5):  1117-1119. 
    Asbtract ( )   PDF (701KB) ( )  
    Related Articles | Metrics
    Energy-efficient is very important to Wireless Sensor Network (WSN). Based on the extensive analysis of typical routing protocols, such as Low-Energy Adaptive Clustering Hierachy (LEACH), a novel clustering algorithm according to energy and distance was presented in this paper, and a modified multi-hop approaches was also introduced to the communication between clusterhead and BS, called Energy and Distance Based Clustering Multihop Algorithm (EDBCM). Simulation results show that EDBCM protocol increases the amount of total data received by BS and improves system lifetime.
    Design and research of 4over6 extended mechanism
    Mian Huang
    2008, 28(5):  1120-1122. 
    Asbtract ( )   PDF (833KB) ( )  
    Related Articles | Metrics
    In this paper, we analyzed the limitations of the 4over6 mechanism and proposed a new extension mechanism. The new mechanism, except for its inherited advantages from the 4over6, allows the pure IPv4 applications in the IPv6 host to transparently communicate with the IPv4 nodes via IPv6 backbone networks.
    Determination of computer automatic control network structure with test method
    2008, 28(5):  1123-1124. 
    Asbtract ( )   PDF (817KB) ( )  
    Related Articles | Metrics
    The establishment of computer automatic control network is different with the Internet and the local area network. In the computer automatic control network structure, the lower level equipment might be the computer or the intelligent module. How to enable these equipments to constitute a whole in this kind of network project? The network test of process effective before the network construction is the only correct method, in which the congruence of the major components and the communication is the key.
    Information security
    Formal analysis of IEEE 802.11i
    Cheng XU
    2008, 28(5):  1125-1127. 
    Asbtract ( )   PDF (713KB) ( )  
    Related Articles | Metrics
    As one of the most representative theorem proving techniques used to analyze security protocols, the strand spaces theory has been successfully applied to prove a plenty of typical protocols. Based on the related document, we improved the Strand Space Model (SSM) of IEEE 802.11i protocols, and verified the security and authentication property. The result of the analysis proves the correctness of the IEEE 802.11i protocols in the present penetrator model.
    Improved identity-based key-insulation signature scheme
    Jian-Xin ZHU Cheng-Hua LI Xin-Fang ZHANG
    2008, 28(5):  1128-1129. 
    Asbtract ( )   PDF (785KB) ( )  
    Related Articles | Metrics
    A new identity-based strong key-insulated signature scheme without key escrow was proposed. Our proposed scheme not only solved the problem of key update but also the problem of key escrow that was ignored in the proposed scheme by Weng et al. The computational cost of this scheme during the "Verify" phase was also lower.
    Blind intrusion detection algorithm based on digital whiff
    Nie Xiao Wen Lu Xian Liang Wang Zheng
    2008, 28(5):  1130-1132. 
    Asbtract ( )   PDF (629KB) ( )  
    Related Articles | Metrics
    In order to deal with coordinated attacks in Peer to Peer (P2P) systems, a blind intrusion detection algorithm was given based on digital whiff. Through "digital whiff" technology, the algorithm can find blood intrusion behaviors. Then it protects the systems from intrusion by cutting the multi-access and so on. Performance analysis and simulation results show the algorithm has better veracity and lower cost.
    Improved blind signature schemes based on XTR system
    DING Xiu-Huan Zhi-Guo FU Shu-Gong ZHANG
    2008, 28(5):  1133-1135. 
    Asbtract ( )   PDF (752KB) ( )  
    Related Articles | Metrics
    Chen Xiao-feng, Gao Hu-ming and Wang Yu-ming presented two blind signature schemes based on XTR system, namely XTR-Blind-Nyberg-Rueppel and XTR-Blind-Schnorr signature schemes. The improved blind signature schemes both of which consider the "smallest" condition in the XTR key recovery algorithm were proposed. The improved schemes are more efficient than the original blind signature schemes in both communication and computation without compromising security.
    Intrusion detection system with hybrid detector
    2008, 28(5):  1136-1139. 
    Asbtract ( )   PDF (842KB) ( )  
    Related Articles | Metrics
    The low-level (binary) detector that the traditional artificial-immunity-based network intrusion detection systems adopt prevents the extraction of meaningful domain knowledge, and leads to incomplete cover of Nonself space. In this paper, the method of constructing binary self set and generating valid detector were improved. Real-valued negative selection algorithm was studied and the real-valued detectors were added to construct the hybrid detector congregation to detect abnormal behavior of both packets and sessions at detection stage. The ROC curves of experimental results show that it has higher detection rate and lower false alarm rate.
    Prediction calculation and self-adaptive algorithm for matching threshold in negative selection algorithm
    2008, 28(5):  1140-1143. 
    Asbtract ( )   PDF (893KB) ( )  
    Related Articles | Metrics
    Based on Negative Selection Algorithm (NSA), a prediction calculation strategy of matching threshold was put forward in this paper. Optimum value of matching threshold was achieved through general formula defined in this paper and simulation results prove that true positive was improved. The application scale of prediction strategy in matching rules was discussed. Since static matching threshold cannot meet the demand of dynamic network, self-adaptive matching threshold based on Genetic Algorithm (GA) was brought up for changeable network intrusion, which improved true positive and reduced false positive, and detectors were matured in dynamic under condition of changeable self set.
    Cryptanalysis of proxy blind signature scheme
    2008, 28(5):  1144-1145. 
    Asbtract ( )   PDF (354KB) ( )  
    Related Articles | Metrics
    A new proxy blind signature scheme was proposed by Zhao et al. recently. Based on this scheme, all possible parameters to be chosen in signature equations were considered and a general method to construct proxy blind signature was obtained. They also proposed eight equations to generate secure proxy signing key. However, their scheme was insecure. A forgery attack on their proxy blind signature scheme was proposed in this paper. Using the forgery attack, a dishonest original signer can forge the proxy signing key and produce valid proxy blind signatures. Among the eight equations of producing proxy signing key, half of them can not resist this kind of attack.
    Research on unified authentication system in digital campus
    2008, 28(5):  1146-1148. 
    Asbtract ( )   PDF (802KB) ( )  
    Related Articles | Metrics
    Campus authentication system is a key part of digital campus. After analyzing the demands of authentication system, a campus unified authentication system based on IEEE 802.1X protocol and Diameter protocol was proposed. By extending EAP-PEAP protocol and introducing message routing mechanism in Diameter protocol, this authentication system can provide cross-domain authentication and authentication ticket distribution, thus solving the roaming authentication and single sing-on problems in campus network authentication system. At last, some means of attack were analyzed, and corresponding solutions were proposed.
    Framework of biometric authentication applied in open network
    Quan Feng 菲 苏 继伟 位
    2008, 28(5):  1149-1151. 
    Asbtract ( )   PDF (588KB) ( )  
    Related Articles | Metrics
    A framework of biometric authentication applied in the open network was proposed. In the framework, after identity authentication is carried out with the cooperation of Biometric Process Unit (BPU) distributed at different locations, the instances comprising BPU certificate, BPU function report and result were generated respectively by each BPU and sent to the identity verifier. The verifier retrieved responding authentication policy from Biometric Policy Certificate (BPC) according to the privilege recorded in the user's Attribute Certificate (AC) and checked if these BPUs met the requirements. If so, the verifier accepted this authentication result.
    Research and defence of new vulnerability exploiting method
    Kai-Jian WANG Xiao-Bo Luo
    2008, 28(5):  1152-1155. 
    Asbtract ( )   PDF (949KB) ( )  
    Related Articles | Metrics
    Based on the technology of Windows Heap Managing, a new vulnerability exploiting method made a programme exception become an exploitable vulnerability. This paper began with analyzing the programme exception, systemly disscussed the whole exploiting processs and the reasons. Then according to the specific IE vulnerability, the exploiting method and its danger were analyzed. At last, some defences of the vulnerability were dicussed.
    ElGamal public-key cryptosystem based on integral quaternions
    WANG Li XING Wei
    2008, 28(5):  1156-1157. 
    Asbtract ( )   PDF (364KB) ( )  
    Related Articles | Metrics
    This paper introduced the definition of congruence class and some basic property of integral quaternions, and proposed ElGamal Public-Key Cryptosystem (PKC) based on integral quaternions. Its security was based on the difficulty of large integer factorization and discrete logarithms problem. Simulation and realization were carried out in computer, furthermore the security of it was discussed and analysed.
    Token ring-based secret share update scheme
    2008, 28(5):  1158-1160. 
    Asbtract ( )   PDF (881KB) ( )  
    Related Articles | Metrics
    This paper analyzed the advantages and disadvantages of existing secret share update schemes in Ad Hoc network, presented a token-ring based secret share update scheme. ,This scheme was established according to Ad Hoc network architecture. It included threshold update phase and update group spread phase. Threshold update phase, initiated by cluster head, can effectively avoid the conflict of more than one node initiating secret share update at the same update period. The second phase finished the secret share update of other Certification Authorities (CA) nodes by the update group, which reduced the probability of network storm. In addition, the scheme also put forward a method to tackle the conflict arising from different period secret shares; finally, simulations confirmed the effectiveness of our design.
    Research of hierarchical identity-based encryption for grid
    Sheng Huang
    2008, 28(5):  1161-1163. 
    Asbtract ( )   PDF (662KB) ( )  
    Related Articles | Metrics
    The current grid security development was researched, and the Identity Based Encryption (IBE) and the Public Key encryption (PKE) were analyzed. Concerning the grid characteristics and development, a hierarchical ID-based Encryption for Grid scheme was proposed, and its safety and efficiency were analyzed.
    A key management scheme of Wireless Sensor Networks
    Zhang Zhi-Ming
    2008, 28(5):  1164-1166. 
    Asbtract ( )   PDF (950KB) ( )  
    Related Articles | Metrics
    Many applications of wireless sensor networks are based upon a group communication model. How to establish a group key for encrypting group communication is therefore becoming an important concern to prevent an attacker from eavesdropping communications in wireless sensor networks. To support secure group communications in resource constrained wireless sensor networks, We propose an efficient and scalable key management scheme which only uses symmetric cryptographic algorithms and hashing function. This scheme can achieve forward and backward security. This scheme provides better efficiency and is more suitable than previous group key management schemes for wireless sensor networks.
    New dynamic password authentication based on smart card and fingerprint
    Tsai Jia-Lun Jong-Eao Lee
    2008, 28(5):  1167-1169. 
    Asbtract ( )   PDF (681KB) ( )  
    Related Articles | Metrics
    In 2005, Zhang et al. proposed a dynamic password authentication based on smart card and fingerprint. This paper found that Zhang et al.'s authentication scheme was vulnerable to a server spoofing attack. Any adversary can masquerade as a legal server by sending two fixed parameters. Therefore, an improved scheme was proposed. This proposed scheme encrypted individual information and protected a parameter sent from the server by using one-way hash function. It also protected the random number sent from the server by using the shared information.
    Database Technology
    Research of ontology uncertainty reasoning based on Bayesian network
    2008, 28(5):  1170-1172. 
    Asbtract ( )   PDF (668KB) ( )  
    Related Articles | Metrics
    This paper adopted OWL to extend the uncertainty representation in domain ontology and support uncertainty reasoning by Bayesian network. The experiment shows that Bayesian network together with ontology can preserve the advantages of both, for ontology has power of knowledge presenting and Bayesian network provides ability of reasoning. It can obtain knowledge from partial probabilistic-described information and instruct practice.
    Application of evolutionary substructure discovery in study on regional economy
    Xin-gong CHANG Ji-song Kou Ming-qiang Li
    2008, 28(5):  1173-1176. 
    Asbtract ( )   PDF (703KB) ( )  
    Related Articles | Metrics
    An evolutionary substructure discovery algorithm incorporated with hill-climbing was proposed and applied to the study on regional economy. The algorithm can overcome the problem of local optima effectively and achieve better solutions. The application results show some current economic development trends and existing problems in our country.
    Extended fuzzy grouping queries in relational databases and derivation rules
    Chen Yi-Fei Ying-Chao ZHANG Xiao-Ling YE
    2008, 28(5):  1177-1179. 
    Asbtract ( )   PDF (676KB) ( )  
    Related Articles | Metrics
    There are few researches on fuzzy queries of relational databases involving the fuzzy conditions or relative linguistic quantifiers in "having" clause. Methods based on fuzzy set theory to these queries were presented here. The fuzzy conditions in "having" clause were translated to general SQL queries on the basis of-cut of membership function. Therefore, the tuples can be filtered by the RDBMS, which improves the efficiency of fuzzy queries. Nonfuzzy cardinality of fuzzy set was used to evaluate the quantified "having" clause, so the computation and the result became simple.
    Core and attribute reduction algorithms based on database system for decision table
    Guo-Shun HUANG
    2008, 28(5):  1180-1182. 
    Asbtract ( )   PDF (790KB) ( )  
    Related Articles | Metrics
    A simple judgement method of algebraic core for decision table was presented. It simplified the calculation by comparing the cardinality of two positive regions instead of the two regions. A new algorithm based on database system was proposed to explore attribute core. Since conditional attribute set has been an algebraic consistent set, it can guarantee to obtain a reduction by top-bottom strategy to eliminate reducible attributes. Theoretical analysis and experimental results show that they are efficient in large data sets.
    Track methodology model for ontology building
    2008, 28(5):  1183-1185. 
    Asbtract ( )   PDF (1042KB) ( )  
    Related Articles | Metrics
    In order to utilize methodology for ontology building more effectively, the Track Methodology Model (TMM) was created. The elements in TMM were defined and described, which included ontology (Top-level Ontology, Domain Ontology and Application Ontology) and five stages in the process of ontology building (analysis, design, development, deployment and evaluation). The qualitative analysis was explored based on the elements. Hence, three methodologies (driving wheel methodology for top-level, domain and application ontology) were imported, while their characteristics and relationships of three methodologies were researched and established. Through the application of building knowledge ontology in university based on TMM, effective methodology for building ontology can be selected to instruct the process of ontology building.
    Trusted objects in trusted operating system
    2008, 28(5):  1186-1189. 
    Asbtract ( )   PDF (998KB) ( )  
    Related Articles | Metrics
    The object types in the operating system, which were sorted into the static object and the dynamic object, were analyzed, and some deficiencies in accessing the object in the security operating system were pointed out. Then, the concepts of the trusted static object, the trusted dynamic object and the trusted object were put forward, and the characteristics of the trusted object, the relationship between the secure object and the trusted object was addressed. Finally, some requirements for the trusted object, which needed to be resolved in the trusted operating system, were presented and discussed. All of these are the foundation for our future works.
    Highly effective fuzzy clustering algorithm based on improved network
    2008, 28(5):  1190-1193. 
    Asbtract ( )   PDF (816KB) ( )  
    Related Articles | Metrics
    In order to solve the problems in fuzzy clustering by using Self-Organizing Feature Map (SOFM) network, this paper introduced an improved structural self-organizing feature map network and adopted self-adapting initial condition. It can handle the clustering problem of high dimensional data and the clusters with arbitrary shapes. Compared with other algorithms with the same clustering effect, it has lower clustering time complexity. Experiments indicate this algorithm has better clustering effect compared to single SOFM network and other kin algorithms.
    Improved particle swarm optimization for class of nonlinear min-max problems
    jiankeZhang Li li-feng
    2008, 28(5):  1194-1196. 
    Asbtract ( )   PDF (857KB) ( )  
    Related Articles | Metrics
    Concerning the fact that the unsmoothness objective function of a class of nonlinear minimax problem caused difficult solution, a new algorithm was proposed. This algorithm used improved Particle Swarm Optimization combined with maximum entropy function method. Firstly, the maximum entropy function was used to transform the unconstrained and constrained minimax problems into a smooth function of unconstrained optimization problems; this smooth function was used as Particle Swarm Optimization's fitness function. Then a new position update equation was proposed by using the strategy of extrapolation in Mathematics. Thus, a new class of Particle Swarm Optimization was given. The new algorithm was applied to solving the minimax problems. The numerical results show that the algorithm converges faster and has numerical stability, and it is an effective algorithm for nonlinear minimax problems.
    Fuzzy clustering algorithm based on genetic algorithm and its application
    Jiao SONG
    2008, 28(5):  1197-1199. 
    Asbtract ( )   PDF (947KB) ( )  
    Related Articles | Metrics
    A fuzzy clustering arithmetic based on Genetic Algorithm (GA) was proposed. Genetic algorithms instructed to choose the initial cluster centers firstly, and clustering was processed by Fuzzy C-Mean Clustering (FCM).It not only overcomes the sensitivity to initial centers as FCM, but also solves the problem of approximate solution as Genetic Algorithm. This method was applied to constellation clustering and modulation recognition. The simulation results show that the method is feasible to PSK and QAM signal even when timing error exists.
    Optimal control of traffic flow based on rough theory and fractal theory
    2008, 28(5):  1200-1203. 
    Asbtract ( )   PDF (769KB) ( )  
    Related Articles | Metrics
    Accurate and timely prediction of the traffic flow in city is a key factor for traffic control and traffic-induced system. To solve the global optimal controlling problem in traffic flow prediction, we constructed a rule-simplized data-cleaning model by analyzing the real traffic flow based on rough theory, presented a traffic-flow forecasting model according to comparability in fractal theory and designed the corresponding traffic flow net topology and the running mechanism of traffic flow optimal control system. The simulation result shows that the technique is effective.
    Classifier ensemble based on fuzzy clustering
    FAN Ying Hua JI Hua-xiang ZHANG
    2008, 28(5):  1204-1207. 
    Asbtract ( )   PDF (799KB) ( )  
    Related Articles | Metrics
    A novel algorithm for the creation of classifier ensemble based on fuzzy clustering was introduced. The algorithm got the distribution characteristics of the training sets by fuzzy clustering and sampled different training dataset to train different individual classifiers. Then the algorithm adjusted every sample's weight to get more classifiers through evaluating the quality of the classifier until certain termination condition was satisfied. The algorithm was tested on the UCI benchmark data sets and compared with two other classical algorithms: AdaBoost and Bagging. Results show that the new algorithm is more robust and has higher accuracy.
    Graphics and image processing
    Blind source separation in noisy mixtures based on curvelet transform and independent component analysis
    ZHANG Chao-zhu ZHANG Jian-pei SUN Xiao-dong
    2008, 28(5):  1208-1210. 
    Asbtract ( )   PDF (1544KB) ( )  
    Related Articles | Metrics
    Independent Component Analysis (ICA) is a method for blind source separation based on higher-order statistics. It is hard to deal with the signal in the environment of Gaussian noise, because the higher-order cumulant of Gaussian signal is zero. A noisy image separation algorithm based on Curvelet threshold de-noising processing and FastICA was proposed. The results of simulation in Gaussian noise show that it can solve the problem of performance deterioration of ICA algorithms while processing noisy mixtures. Curvelet transform used in noisy images separation can improve the quality of Signal-to Noise Ratio (SNR) and the performance of separation compared with ICA that has been de-noised by wavelet.
    Watermarking algorithm of large capacity halftone image
    2008, 28(5):  1211-1213. 
    Asbtract ( )   PDF (1023KB) ( )  
    Related Articles | Metrics
    Hiding information in a halftone image is an effective method to solve copyright of presswork, source authentication, forgery prevention and so on. A hiding information scheme was proposed, in which large capacity information can be embedded in a halftone image. The hidden information was regarded as error signal first, and then Error Diffusion Algorithm was used to embed it into several pixels around a position. Moreover, information embedding and halftone processing were completed simultaneously. Experiment shows that binary watermarking image embedded may be the same as halftone image in capacity. Furthermore, under conditions of noise disturbance, dirt and rotation, watermarking image can still be extracted from the embedding watermarking image. This scheme is available for forgery prevention of general documents.
    Automatic breakline extraction from LIDAR point clouds
    Jing-Zhong XU You-chuan WAN Sheng-wang ZHANG
    2008, 28(5):  1214-1216. 
    Asbtract ( )   PDF (1029KB) ( )  
    Related Articles | Metrics
    For producing high quality Digital Terrain Model (DTM) based on Light Detection And Ranging (LIDAR) point clouds, breaklines must be explicitly stored and represented within the data structure. Having analyzed traditional methods' deficiencies in breakline extraction, the paper proposed an automatic extraction method. To accomplish breakline extraction, the method processed LIDAR point clouds in three steps. The first step, a mesh surface was reconstructed to establish explicit topological relation among the discrete points; the second, normal-based edge detection was applied on the irregular mesh to extract sharp borders with curvature discontinuity; finally, breaklines were traced with "direction priority" strategy and smoothed by "iterative interpolation" algorithm. The result shows that it is robust and has potential application in topographic analysis and mapping.
    Face recognition based on ASM and line Hausdorff distance
    2008, 28(5):  1217-1220. 
    Asbtract ( )   PDF (1059KB) ( )  
    Related Articles | Metrics
    The Active Shape Model (ASM) was an efficient method for facial features localization. In this paper, Modular ASM (MASM) was proposed which made improvements in three aspects which were initialization, model construction and search strategy. Experiments show the propsed method improves the accuracy of facial features localization than the old method. Besides, the result of MASM for facial features localization is finally used in the extraction procedure of line edge map. Then Line Hausdorff Distance (LHD) is calculated as the features of face image. The recognition rate of the proposed method is high based on the CVL face database.
    Adaptive image enhancement algorithm based on Bandelet transform
    2008, 28(5):  1221-1224. 
    Asbtract ( )   PDF (1659KB) ( )  
    Related Articles | Metrics
    A novel algorithm based on the Bandelet transform field for adaptive image enhancement was proposed. The algorithm reaches effective balance between noise limiting and detail enhancing with Bandelet transform's superiority in presenting the linear singularity and the surface singularity of planar image. First, the geometrical direction in each dyadic square was found according to the principle of the minimal approximation error, then the small dyadic squares were combined, which was based on the principle of Minimum Mean Square Error (MMSE), finally, the directions of image enhancement were determined. And according to the directions, the Bandelet blocks were classified into two sorts: the Bandelet blocks with geometrical directions and the Bandelet blocks without geometrical directions, and the different characteristics of the two sorts of Bandelet blocks were analyzed in order to distinguish the noise and signal, and the weak contrast features and the strong contrast features. Image enhancement was realized by a new strategy that can emphasize features with low contrast and protect the strong contrast features from distortions while restraining noise. Results of experiments show that this method offers significant improved performance in restraining noise and emphasizing features with low contrast over the conventional image enhancement algorithms.
    Mesh simplification algorithm based on screen resolution of mobile devices
    2008, 28(5):  1225-1228. 
    Asbtract ( )   PDF (1248KB) ( )  
    Related Articles | Metrics
    According to the feature that the mobile user's perception to 3D scene is considerably related to the screen resolution of the mobile devices, we put forward a mesh simplification algorithm based on screen resolution of the mobile devices. The new algorithm defined the Benchmark of View (BoV) when the model was displayed on the target screen.The resolution threshold ε can be determined by the resolution of the target screen. And then the new metirics can be obtained by weighting the Quadric Error Metrics (QEM) with the resolution factor which is principally made up of the resolution threshold ε and distance from the 3D object to the view point. Redundancy of the model that did not match the resolution of the target screen was removed. The proposed algorithm is suitable for the applications of graphics for the mobile devices. The algorithm is tested on various data sets through experiments and results show its availability.
    Multilevel spectral clustering with ascertainable clustering number
    2008, 28(5):  1229-1231. 
    Asbtract ( )   PDF (846KB) ( )  
    Related Articles | Metrics
    Ascertainable clustering number and large training sets are vital problems of spectral clustering. This paper proposed a multilevel algorithm based on spectral clustering of ascertainable clustering number, which can cope with large training sets. The core thought of the algorithm was to merge the nodes of large datasets level by level according to its intrinsic relevance into small groups. Then the small groups of last level were clustered using ascertainable clustering number algorithm. Finally, the data was uncoarsened level by level, and at each level, the clustering from the previous level was refined using the refinement. The multilevel algorithm terminated after refinement was performed on the original data. Experimental results prove the effectiveness of the algorithm.
    GPU acceleration for octree volume rendering
    Su Chao-shi Zhao Ming-chang Zhang Xiang-wen
    2008, 28(5):  1232-1235. 
    Asbtract ( )   PDF (2427KB) ( )  
    Related Articles | Metrics
    We presented a novel approach for empty space skipping for object-order volume rendering. A two-staged space skipping was introduced: the first stage applied bricking on a regular grid, and the second stage used octree to reach a finer granularity. The approach further took into account that rendered volume may exceed the available texture memory and allow fast runtime changes of transfer function. For the bottleneck that heavy workload was assigned to CPU in our approach, a novel algorithm was proposed. The algorithm efficiently computed slicing for texture based volume render in Graphic Processing Unit (GPU); balanced the workload between CPU and GPU. Combining the two approaches above, we can render large volume data efficiently without compromising the image quality.
    Research of CT image edge detection based on improved ant colony algorithm
    Jingh-Hu ZHANG Min GUO
    2008, 28(5):  1236-1239. 
    Asbtract ( )   PDF (1030KB) ( )  
    Related Articles | Metrics
    Ant Colony Algorithm(ACA) was applied in CT image edge detection and a new method of CT image edge detection based on ant colony algorithm was proposed. In order to improve the efficiency of algorithm, detection accuracy and adaptability to various CT images, the basic ant colony algorithm was modified by applying different transfer principles and pheromone updating rules in accordance with different contents of CT image. The computer experiments demonstrate the effectiveness of the proposed algorithm, which satisfies the demand of 3D reconstruction of CT image.
    Image segmentation based on improved Ant-Tree algorithm
    Wei-Dong Zhao
    2008, 28(5):  1240-1243. 
    Asbtract ( )   PDF (1106KB) ( )  
    Related Articles | Metrics
    Image segmentation can be seen as the process of clustering the pixels with different characteristics. Considering the gray value, gratitude and neighborhood of the pixels synthetically, the Ant-Tree algorithm was introduced into image segmentation. As the resulting tree of Ant-Tree algorithm contains redundant information, an improved tree model was proposed in this paper. Besides, in order to optimize the process of clustering, a new initialization method was presented, and the method of K-means was also employed to modify the clustering center dynamically. Experiments and comparisons show that the Ant-Tree based clustering algorithm is an effective and efficient approach in image segmentation.
    Improved algorithm on fast multi-resolution motion estimation
    Su-Wen Zhang Fu-Sen Yang Li-Li Wang
    2008, 28(5):  1244-1246. 
    Asbtract ( )   PDF (1062KB) ( )  
    Related Articles | Metrics
    In this paper, an improved algorithm on fast multi-resolution motion estimation was proposed, which made use of the multi-resolution property and wavelet matching error characteristic. Based on Partial Distortion Elimination (PDE) algorithm, we improved the speed of motion estimation by improving searching order, matching order and comparison interval. Experimental results show that the proposed algorithm can achieve the same estimate accuracy as Full Search Algorithm (FSA), while the computation complexity is reduced extremely.
    Color digital watermark based on amplitude modulation and SVR
    lin beiyi qin yande xia lianghong qiu like
    2008, 28(5):  1247-1250. 
    Asbtract ( )   PDF (1937KB) ( )  
    Related Articles | Metrics
    A color image watermarking method with blind detection based on amplitude modulation and support vector regression was presented in this paper. On the basis of the visual masking of human visual system, the embedded positions were chosen adaptively. Basically, the watermark was embedded by modifying the pixel values in the blue channel of an image, while the watermark retrieval was achieved by using a prediction technique based on support vector regression model. The model was trained by learning the relationship between the selected pixel and statistical feature of neighboring area. The technique of Gaussian weighting marks by averaging the luminance of its own pixel and its neighboring pixels was used as an additional scaling factor to tune the strength of embedding watermark. Experimental results show that the presented scheme is invisible and robust against various processing such as cropping, compression, filtering, noise adding, image enhancement and geometrical attacks.
    Intelligence perception
    Neural networks based 3D posture reconstruction from orthogonal images of human performer
    Zhong-Ze Chen Guo-yu Huang
    2008, 28(5):  1251-1254. 
    Asbtract ( )   PDF (1094KB) ( )  
    Related Articles | Metrics
    A novel method for reconstructing 3D motion of human avatar from real-time orthogonal images by using artificial neural network techniques was proposed. The input vector to the network was constructed by using the extracted coordinates of the feature points, while the output one indicated the 3D coordinates of the representative points and joints of the real human. The fitting process of the neural network was based on some proper neural network learning techniques with a set of sample data pairs that were obtained by using a motion capture system ReActor. The proposed method was implemented on a personal computer and ran in real-time applications. And experimental results confirm both the feasibility and the effectiveness of the proposed method for estimating 3D human motion (reconstruction error in MSE is less than 5%).
    Face Recognition Basde on Curvelet and PCA
    Xiaoe Qu Yang Zhao Zhenghao Shi
    2008, 28(5):  1255-1256. 
    Asbtract ( )   PDF (865KB) ( )  
    Related Articles | Metrics
    A new method combining curvelet transform and principal components analysis (PCA) is presented for face recognition. Considering the disadvantage of wavelet, say, it is only optimal in representing point singularities, we use curvelet transform to extract facial features. The facial features being mostly curves, curvelet transform directly takes edges for representation, resulting in a more powerful feature extraction. PCA is then used to map the feature into more meaningful subspace, hence we get higher recognition rate. The experiments demonstrate the effectiveness of the proposed method.
    Research of target recognition algorithm from image with complex background
    2008, 28(5):  1257-1260. 
    Asbtract ( )   PDF (1318KB) ( )  
    Related Articles | Metrics
    This paper proposed a new algorithm of recognizing military target from image captured by outdoor firing training system with very complex background. Firstly the color feature of target was utilized to do a coarse segmentation. The steps include converting from RGB color space to HIS color space, thresholding in S channel, combining I channel information, thresholding in combined image and postprocessing using mathematical morphology. Then a classifier based on AdaBoost learning algorithm was designed to separate target region from others and get the final recognition result.
    Application of DNA algorithm to face recognition
    Pu-ying Tang
    2008, 28(5):  1261-1262. 
    Asbtract ( )   PDF (603KB) ( )  
    Related Articles | Metrics
    This paper proposed a new method of face recognition, which used DNA algorithm mixed with Singular Value Decomposition (SVD). It aimed to quickly reduce the recognition targets of large scale face database, and make the next recognition process use regular methods possible. The experiment was carried out on standard ORL face database. The result indicates this method avails and DNA algorithm realizes its application on face recognition.
    Novel face recognition method based on KPCA plus KDA
    ZHOU Xiao-Yan ZHENG Wen-ming
    2008, 28(5):  1263-1266. 
    Asbtract ( )   PDF (674KB) ( )  
    Related Articles | Metrics
    Kernel Discriminant Anlaysis (KDA) and Kernel Principal Component Analysis (KPCA) are the nonlinear extensions of Linear Discriminant Analysis (LDA) and Principal Component Analysis (PCA) respectively. In this paper, we presented a feature extraction algorithm by combing KDA and KPCA to extract reliable and robust features for recognition. Furthermore, a generalized nearest feature line (GNFL) method was also presented for constructing powerful classifier. The performance of the proposed method was demonstrated through real data.
    Adaptively weighted 2DPCA based on local feature for face recognition
    2008, 28(5):  1267. 
    Asbtract ( )   PDF (642KB) ( )  
    Related Articles | Metrics
    Two Dimensional Principal Component Analysis (2DPCA) extracts the global feature of human face, but the local feature is very important to face recognition. In this paper, adaptively weighted 2DPCA based on local feature was proposed. Firstly, the face image was separated into three independent sub-blocks according to the local features. Secondly, 2DPCA was applied to the sub-blocks independently. Then the method can adaptively compute the contributions made by each sub-block and endow them to the classification in order to improve the recognition performance. The experiments on the ORL and Yale face databases demonstrate the proposed method's effectiveness and feasibility.
    Detection of human movement state based on power spectral density
    2008, 28(5):  1269-1271. 
    Asbtract ( )   PDF (657KB) ( )  
    Related Articles | Metrics
    A new method of human movement state detection in image sequence of video was put forward. Aiming at the complexity of data used by tradition method, the new method firstly extracted key points-unstructured data of position and scale stabilization from circum-rectangle area of human body,computed power spectral density of key point; Then obtained distribution of power spectral density of key point; finally judged human movement state form its distribution characteristic. Experiment shows its efficiency, feasibility and simplicity.
    Multi-party and multi-attribute negotiation support system based on preference representation of artificial psychology
    Hong-Li Wang
    2008, 28(5):  1272-1275. 
    Asbtract ( )   PDF (1249KB) ( )  
    Related Articles | Metrics
    In order to resolve the key problem of preference representation of negotiator in multi-party and multi-attribute Negotiation Support System (NSS), a multi-party and multi-attribute negotiation support system based on preference representation of artificial psychology was proposed. Firstly, a model of artificial psychology based on cloud model was proposed. The fuzziness and randomcity were reflected fully in the model. Besides, its process of negotiation and suggested resolution of negotiation by means of media were also given. Lastly, the prototype of system and test were provided. The result of test in negotiation support system can predict the preference of negotiator.
    Illumination invariant face recognition algorithm based on local qualitative representation
    2008, 28(5):  1276-1279. 
    Asbtract ( )   PDF (1373KB) ( )  
    Related Articles | Metrics
    An illumination invariant face recognition algorithm based on local qualitative representation called Local order mapping was proposed. This representation encoded the order rank of the central pixel among its neighbors, and represented the relative configuration of the image's local regions. Therefore, the local order mapping was very insensitive to the large intensity variations caused by the illumination changes. Meanwhile, a new logic distance measurement for ordinal qualitative features was applied in the nearest neighbor classification for recognition. The experimental results on Extended YaleB face dataset show the illumination robustness of the proposed representation and the validity of the logic distance measurement.
    Model of minimum cost heterogeneous sensor network
    2008, 28(5):  1280-1282. 
    Asbtract ( )   PDF (926KB) ( )  
    Related Articles | Metrics
    This paper proposed a minimum cost model for the base station to gather data from local area in the heterogeneous sensor network within a square unit. The amount and energy parameters of two node types were acquired under the conditions of coverage and connectivity and sharp cutoff. It was proved that the energy consumption per unit period of cluster nodes in the annular region increased as the width of the annular region increased when the width of the annular region was not longer than the radius of the center circle. At the same time, the quantity of additional nodes needed in the center circle was also calculated. In experiments, the parameters of approximate and exact solutions were compared, and they tallied well.
    Software process technology
    Design and implementation of TinyOS integrated developing environment
    Wen-Sheng GUO Kui-An LIU
    2008, 28(5):  1283-1286. 
    Asbtract ( )   PDF (954KB) ( )  
    Related Articles | Metrics
    TinyOS is an open-source component-based operating system, which is designed for sensor networks nodes that have very limiting resources. TinyOS is implemented in component-developing language nesC. Benefiting from the Component-based Software Engineering (CBSE), TinyOS itself is a library of components, making application-developing work much more simple, but currently lack of mature Integrated Development Environment (IDE). Through analyzing nesC and the process of TinyOS development, this paper designed an IDE for TinyOS development. Results demonstrate the IDE makes the developing work much more efficient.
    Research of process model supporting for software requirements verification
    Hui-Gui RONG Wei LI Wei-Feng GUO
    2008, 28(5):  1287-1290. 
    Asbtract ( )   PDF (1028KB) ( )  
    Related Articles | Metrics
    Requirements verification is an important procedure for software requirements, and requirements having not being verified will bring larger risk for the success of project. A Requirements Verification Process Model (RVPM) was proposed from the principles and operability of requirements verification, with reference to the former research of requirements analysis. Several key procedures and strategies of requirements verification were provided, and the corresponding formal description was given. Applying this model to guiding requirements verification was analyzed by a real example. Theoretical and experimental analyses show that this model can effectively overcome the complexity and experiential operation of requirements verification process and greatly reduce the risk of project requirements.
    Study on communications between MIs in migrating workflow system
    2008, 28(5):  1291-1294. 
    Asbtract ( )   PDF (806KB) ( )  
    Related Articles | Metrics
    A new message communications mechanism between MIs was brought forward. The communications mechanism can simplify the address searching procedure and solve the invalidation of the mails to keep the accuracy of the mails so that the MIs can move on their own without being limitted at the communications phase.It also can keep the sequence of the MIs' mails, and based on the mailboxes' separation the mails can be dealt with while the MIs are moving. Furthermore, the inaccurate mails can be sent again through verifying the accuracy and integrality of the mails.
    Formal semantics of XPDL specification in CSP process
    2008, 28(5):  1295-1299. 
    Asbtract ( )   PDF (1101KB) ( )  
    Related Articles | Metrics
    Aiming at that the notation specification of XPDL widely supported in practical workflow systems does not include a formal semantics, an approach of transforming XPDL to Communicating Sequential Process (CSP) process was proposed to enhance the formal semantic analysis of workflow process by the rigorous CSP theory. The effectiveness of the approach was verified through a case study.
    Approach of concurrent object-oriented program slicing based on LTL property
    2008, 28(5):  1300-1302. 
    Asbtract ( )   PDF (736KB) ( )  
    Related Articles | Metrics
    An approach for slicing concurrent object-oriented programs is presented to reduce the state space in the process of program verification. The dependencies between statements in the given program are defined, and the method of extracting the slicing criterion from linear temporal logic property is introduced. The satisfaction of the verified LTL property is guaranteed for both programs before and after slicing, and the number of states in the state transition graph is decreased.
    Research and application of predictable CER-real time Java developing model
    2008, 28(5):  1303-1306. 
    Asbtract ( )   PDF (871KB) ( )  
    Related Articles | Metrics
    Based on the analysis of the limitations of existing Real Time Specification for Java (RTSJ) and developing models, we designed a CER-Java developing model, which can be used to develop embedded high-reliability real-time systems. The model adopted a three-layer developing architecture, including Creation Layer, Execution Layer and Recycle Layer. The Creation Layer created and started various groups of threads and objects. The Execution Layer executed threads that had been started. The Recycle Layer recovered the memory that was no longer in use. The practice shows that the mechanisms, such as the three-layer developing architecture, creating various groups of threads and the periodic garbage collection, etc, not only guarantee the predictability of a system, but also reduce memory usage and simplify the complexity of model.
    Research of QoS-driven dynamic web services pricing model
    2008, 28(5):  1307-1309. 
    Asbtract ( )   PDF (884KB) ( )  
    Related Articles | Metrics
    Considering quality of service and user experience, a QoS-driven dynamic Web Services pricing model was proposed in the paper, which made services price vary dynamicly with several factors. And then its pricing process and corresponding algorithms were given. Experiments on its simple implementation show that the Web Services pricing model is more reasonable and precise.
    Method of image quality assessment based on region of interest
    2008, 28(5):  1310-1312. 
    Asbtract ( )   PDF (669KB) ( )  
    Related Articles | Metrics
    Image quality assessment proposed in this article was weights-taxed combination of regions of interest and backgrounds. A gradient-based structural similarity model was used among regions of interest, while the classical Structure Similarity (SS) model was followed in other regions. Experimental results show that our model considers more about the importance of regions of interest and is more consistent with perceived image quality.
    Study on event correlation detecting mechanism based on time Petri nets
    2008, 28(5):  1313-1315. 
    Asbtract ( )   PDF (784KB) ( )  
    Related Articles | Metrics
    Network events correlation detecting is a key issue of network management to solve. The event correlation detecting mechanism based on Time Petri nets was brought forward on the basis of the event correlation detecting mechanism based on Petri nets in this paper. This mechanism considers the beginning and the size of the time window in the event correlation sufficiently and improves the accuracy of the correlated events.
    Typical applications
    Model of cluster service manager based on mass data
    2008, 28(5):  1316-1318. 
    Asbtract ( )   PDF (739KB) ( )  
    Related Articles | Metrics
    The problem of data management in the web parallel based on mass data was explored in this paper. The model of cluster service manager was introduced. The architecture and management process of Cluster Service Model (CSM) were analyzed and discussed in detail. The result of testing was compare with non-CSM. Finally, it is conclude that the model of CSM can not only manage the data base well but also maintain the system without increasing the system cost or reducing the response time.
    Expressing genes without expression trees construction
    Chuan LI Changjie TANG
    2008, 28(5):  1319-1321. 
    Asbtract ( )   PDF (1044KB) ( )  
    Related Articles | Metrics
    Traditional Gene Expression Programming (GEP) needs to dynamically generate and release a large amount of Expression Trees (ET) when conducting gene expression, which becomes a performance bottleneck. This paper proposed Scale-based GEP to solve the problem. Scale is a restricted linear table that is initialized once and can be used permanently without further maintenance. Genes are expressed into a scale without dynamically generating and releasing expression trees. Experiments show in most cases scale-based expression is 6~10 times faster than ET-based expression.
    Research and implementation of trace capture technique based on aspect-oriented programming
    ZHANG Zhu-Xi WANG Huai-Min
    2008, 28(5):  1322-1324. 
    Asbtract ( )   PDF (802KB) ( )  
    Related Articles | Metrics
    Because the traditional software development method does not provide the mechanism that separates the trace capture concern and other business concerns, the implementation codes of all the concerns tangle seriously. To solve this problem, we applied Aspect-Oriented Programming (AOP) in the research of software trace capture and studied a technique of trace capture that can wave the monitor requirement into the system without changing the source code. This technique can improve the modularity of software effectively. Base on it, we implemented a monitor tool named Software Runtime Tracer (SRT), which can be used to analyze system manner and find program bugs and enhance the trustworthiness of software as well.
    Variance minimization model for optimization decision-making of loan portfolio under chance constraints
    Yu-Fu Ning Wan-Sheng Tang Wei-Zhen Yan
    2008, 28(5):  1325-1327. 
    Asbtract ( )   PDF (647KB) ( )  
    Related Articles | Metrics
    Variance minimization model for optimization decision-making of loan portfolio under chance constraints was proposed by characterizing loan return rates as fuzzy variables. For the case where the loan return rates were special triangular fuzzy variables, the crisp equivalents of the models were given and could be solved with the traditional methods. The hybrid optimization algorithm was employed to solve the models where the membership functions of loan return rates were complex. The algorithm integrated fuzzy simulation, neural network, genetic algorithm and simultaneous perturbation stochastic approximation algorithm. Numerical examples illustrate the effectiveness of the models and the algorithm.
    Algorithm of stable state spaces in reinforcement learning
    2008, 28(5):  1328-1330. 
    Asbtract ( )   PDF (1871KB) ( )  
    Related Articles | Metrics
    Reinforcement leaning often suffers from the fact that the number of trials grows exponentially as the state spaces expand. This paper proposed an algorithm of stable state spaces in reinforcement learning to overcome this problem. The algorithm aimed for optimal actions in stable state spaces and focused exploration areas on stable state spaces instead of the whole state spaces. As stable state spaces is only a small fraction of the whole state spaces, the number of trials in our algorithm does not grow exponentially as the state spaces expand.
    Study of self-adaptable fault tolerance in storage network
    De-Zhi HAN
    2008, 28(5):  1331-1334. 
    Asbtract ( )   PDF (1325KB) ( )  
    Related Articles | Metrics
    With the popularity of varied networks, storage networks of high availability are needed urgently by enterprises. In this paper, a Recovery-Oriented self-Adaptable Replication Protocol (ROARP), superior to the existing ones and fit for varied complex storage networks, was introduced based on the study of the high availability of complex storage networks.
    Electronic voting scheme based on OT protocol
    2008, 28(5):  1335-1337. 
    Asbtract ( )   PDF (778KB) ( )  
    Related Articles | Metrics
    OT protocol well satisfies the requirements of anonymity and multi-selection in election. This paper applied OT protocol to electronic voting and presented a new electronic voting scheme, which made it available to have such a voting with the characteristic of multi-selection. Meanwhile, the scheme has its basic characteristic of safe electronic voting scheme with efficiency, which can be used in large-scale election, thus improving and consummating the electronic voting scheme. Also, the electronic voting scheme broadens the application of OT protocol and plays an active part in promoting a further study on OT protocol.
    Control parameter tuning of magnetic bearing PID based on Matlab-Simulink-SISO and SRO
    2008, 28(5):  1338-1340. 
    Asbtract ( )   PDF (448KB) ( )  
    Related Articles | Metrics
    The improved neuron intelligent PID controller for magnetic bearing was described in this paper which combined Artificial Neural Networks (ANNs) technique with traditional PID controller and adjusted PID parameters automatically to reach adaptive effect according to its improved learning rules. The application of the controller in a real magnetic bearing system confirmed that the controller can overcome its significant drawback such as high nonlinearity and inherent instability. Simulation results by M-file in Matlab show that improved neuron PID controller can achieve better performance and show a number of advantages over traditional PID controller.
    Application of hybrid genetic algorithm in object-oriented software integration testing
    wang zhengshan
    2008, 28(5):  1341-1343. 
    Asbtract ( )   PDF (1002KB) ( )  
    Related Articles | Metrics
    A hybrid algorithm was presented to determine inter-class test order for integration testing of object-oriented software. It added local search into simple genetic algorithm to increase local search ability and used buffer pool to decrease running time. Experimental results show that its performance outperforms the other techniques.
    Human motion data analysis and retrieval based on 3D feature extraction
    Jian XIANG HongLi ZHU
    2008, 28(5):  1344-1346. 
    Asbtract ( )   PDF (530KB) ( )  
    Related Articles | Metrics
    Based on 3D features for time and space relationship of each human joint,a kind of temporal-spatial features was proposed in this paper, which can process local temporal-spatial features of each joints. 3D features can represent a part of the whole motion independently and avoid contacting with original motion data and eliminate "curse of dimensionality". Experimental results show that the approaches are effective for motion data analysis, which can be used in intelligent analysis for motion semantics.
    Establishment of self-adaptation system based upon Bayesian network
    Jian-Qiong XIAO
    2008, 28(5):  1347-1349. 
    Asbtract ( )   PDF (587KB) ( )  
    Related Articles | Metrics
    According to cognitive learning theory, learners model was established by applying Bayesian Networks.A self-adaptive algorithm was introduced, which enabled the presentation of the learning contents to fit the cognitive level and individual characteristics of the learners, and thereby realized an intellectual and individualized self-adaptive system and an advanced approach for network learning.
    CAVLC coding algorithm and FPGA realization of a high-speed entropy encoder
    Xiao-Ming LIU Xu-Ying ZHANG Fang LI
    2008, 28(5):  1350-1354. 
    Asbtract ( )   PDF (1137KB) ( )  
    Related Articles | Metrics
    Context-Based Adaptive Variable-Length Coding (CAVLC) algorithm was adopted as an entropy coding method in baseline and extended profile of H.264/AVC standard, but the detailed syntax on which was not explicitly stipulated. A profound analysis on the CAVLC coding algorithm of H.264 standard was performed based on the principle of CALVC decoding method. A high-speed and low power-consumption CAVLC coder for H.264/AVC standard was presented according to the former analysis, in which multi-clock domain processing and parallel processing techniques were adopted to improve the performance of the system, and arithmetic were used to replace some static code table to reduce memory consumption. The detailed design and FPGA realization method on each sub-blocks are also concerned. Finally, FPGA verification and realization indicates that the maximum coding system clock can up to 107.97MHz, and the coding delay is less than 36 clock cycles, which can adequately meet the needs of some high-definition and real-time applications.
    Research on self-adaptive reconfigurable multi-DSP system in PXI platform
    Jia Jie Qin Yongyuan
    2008, 28(5):  1355-1358. 
    Asbtract ( )   PDF (1554KB) ( )  
    Related Articles | Metrics
    In this work, a new run-time reconfiguration multi-DSP system architecture was given. In this system, combining the characteristic of the multi-processor parallel computation and worm arithmetic, a mixed architecture that can be adaptively expanded based on shared bus and linkports was constructed. And the system was designed and discussed from the point of measurability. Self-Adaptive operating system, a feasible project was proposed for the high speed Self-Adaptive signal processing platform. The hardware debugging, system testing and the software loading methods were introduced. These works may offer some meaningful reference and guide for some similar systems developed in the future.
    Official document classification using stochastic keyword generation
    Ying liu
    2008, 28(5):  1359-1361. 
    Asbtract ( )   PDF (859KB) ( )  
    Related Articles | Metrics
    Design and implementation of a government official document classification system with topic phrase were presented. This system fully considered the value of topic phrase in the classification preprocessing, and made feature space transformation and dimension reduction by the stochastic keyword generation and the Bootstrapping. It differed from the traditional text classification preprocessing, and the performance of the official document classification system was improved. Official document classification using stochastic keyword generation outperforms other methods.
    Design and implementation of creation system for test paper based on genetic algorithm
    Lian Xiao
    2008, 28(5):  1362-1664. 
    Asbtract ( )   PDF (601KB) ( )  
    Related Articles | Metrics
    The education measurement theory was the basis of the system and the constraint conditions of generating test paper were analyzed. It used binomial distribution of discrete type random variable in the difficulty-fraction correspondence relational model and adopted adaptive genetic algorithm to generate and optimize test paper. It used a plug-in card of WebEditor and simulated the Word environment to realize the operations on questions and test papers, thus making the proposition environment more traditional. It used Hibernate on the mapping between object and relation, improving database accessing efficiency. It implemented the system using Java language, which showed better transplantation and stability.
2024 Vol.44 No.3

Current Issue
Archive
Honorary Editor-in-Chief: ZHANG Jingzhong
Editor-in-Chief: XU Zongben
Associate Editor: SHEN Hengtao XIA Zhaohui
Domestic Post Distribution Code: 62-110
Foreign Distribution Code: M4616
Address:
No. 9, 4th Section of South Renmin Road, Chengdu 610041, China
Tel: 028-85224283-803
  028-85222239-803
Website: www.joca.cn
E-mail: bjb@joca.cn
WeChat
Join CCF