Loading...

Table of Content

    01 November 2008, Volume 28 Issue 11
    Survey on research of sentiment analysis
    Li-zhu ZHOU Yu-kai HE Jian-yong WANG
    2008, 28(11):  2725-2728. 
    Asbtract ( )   PDF (760KB) ( )  
    Related Articles | Metrics
    With the rapid growth of the Web text data, mining and analyzing these text data, especially the online review data posted by the users, can greatly help better understand the users' consuming habits and public opinions, and plays an important role in decision-making for the enterprises and the government. This survey first introduces the motivation, research problems and goals of sentiment analysis, and presents some basic technologies used in sentiment analysis. It then describes one of the major tasks in sentiment analysis, subjective sentence detection, by reviewing and analyzing some recent work in this area. Next, it focuses on another important task in sentiment analysis, opinion classification, and discusses two leading feature extraction techniques for opinion classification, sentimental word based and frequent pattern based methods. Furthermore, it also introduces several other relevant sentiment analysis problems. Finally, the paper summarizes the current status, remaining challenges, and future directions in the field of sentiment analysis.
    Database Technology
    Survey on query processing based on uncertain data
    Bing CUI Yang LU
    2008, 28(11):  2729-2731. 
    Asbtract ( )   PDF (824KB) ( )  
    Related Articles | Metrics
    Uncertain data is inherent in some important application fields, such as sensor networks and mobile object tracking. Using traditional querying methods on uncertain data will bias the answer set, and hence cannot satisfy users' needs. Therefore, query processing based on uncertain data has attracted more and more attention. Different from queries on certain data, research work on uncertain data introduce probability into data model to measure the likeness of an uncertain object as one element of the answer set. Due to different problem definitions and data models, query types differentiate from each other greatly. This survey introduced range queries, top-k queries and skyline queries based on uncertain data from the views of problem definitions, data models, pruning strategies and algorithms.
    Survey on mining kinetic intervention rule from sub-complex systems
    Chang-jie TANG Yue ZHANG Liang TANG Chuan LI Yu CHEN
    2008, 28(11):  2732-2736. 
    Asbtract ( )   PDF (1155KB) ( )  
    Related Articles | Metrics
    Intervention rule Mining from Sub-Complex system (IMSC) is a new hot spot in data mining area. The background and typical problems in IMSC were surveyed. The related concepts and terminologies in IMSC were described, such as intervention correlation, intervention type and intervention algebra, the authors' research results were briefly introduced, including nave rules mining, numerical intervention rules mining, and data stream intervention analysis based on density as well.
    Database Technology
    ProGen: Provenance database generator for large-scale data set
    Xiao ZHANG Shan WANG Na LIAN
    2008, 28(11):  2737-2740. 
    Asbtract ( )   PDF (824KB) ( )  
    Related Articles | Metrics
    It is crucially important for researchers especially scientists to judge the correctness and timeliness of data and experiments according to provenance. Regarding the technologies about view materialization and data annotation, provenance has emerged to be a new research topic. Appropriate provenance data set is the foundation for verifying the accuracy and functionality of new techniques and/or algorithms on provenance management, meanwhile, the synthetic provenance data set is also of importance for verification and improvement of algorithms before gleaning the real provenance data to some expected extent. In this paper, one novel provenance database generator, ProGen was proposed, which was able to generate a provenance database, according to the input data schema and provenance annotation, with the specific data volume. The evaluation indicates that our design and implementation is efficient and scalable.
    Trusted database-concepts, development and challenge
    Zhi-yong PENG Ao-cheng YANG Yi REN
    2008, 28(11):  2741-2744. 
    Asbtract ( )   PDF (902KB) ( )  
    Related Articles | Metrics
    The database trust has been paid more and more attention. Based on the domestic and international research results, the concept of the trusted database was proposed in this paper. The mechanisms used to ensure the database trust are surveyed. They include the access control mechanism, encrypted data query mechanism and privacy protection mechanism. The limitations of the existing mechanisms were analyzed and some difficult problems that existed in the research of the trusted database were discussed as well.
    Survey on information retrieval system based on question answering system
    Yong TANG Lu-xian LIN Ye-min LUO Yan PAN
    2008, 28(11):  2745-2748. 
    Asbtract ( )   PDF (833KB) ( )  
    Related Articles | Metrics
    Question Answering (QA) aims to find actual answers to users' questions in natural language. It has attracted more and more attention from the researchers in information retrieval and natural language research field. A typical QA system adopts a pipeline structure that contains "question analysis", "passage retrieval" and "answer selection" modules. In this paper, the research literature and the famous international conferences in QA research area were surveyed. The functions and methods of hot topics were mainly presented such as question analysis, query expansion, passage retrieval and answer selection. Furthermore, some existing problems were proposed in these studies.
    Network and communications
    Study on architecture of seamless transportation information grid
    Yong-hong LUO Te-Fang CHEN You-Sheng ZHANG
    2008, 28(11):  2749-2752. 
    Asbtract ( )   PDF (999KB) ( )  
    Related Articles | Metrics
    Because the heterogeneous information is relatively loose and independent in seamless transportation, data grid is adopted to manage the distributed heterogeneous information and realize resources share and information integration. The paper presents a architecture of seamless transportation information grid(STIG),the architecture integrates Information integration, semantic query, transportation planning, etc key technologies. At last, take combined rail and sea transport for example, the process of multimodal transportation based on STIG was described.
    Comparison research on prediction methods for WLAN traffic
    [英]Huifang Feng [中]冯慧芳 Yantai Shu 舒炎泰
    2008, 28(11):  2753-2755. 
    Asbtract ( )   PDF (595KB) ( )  
    Related Articles | Metrics
    A number of traffic prediction methods based on time series as Artificial Neural Networks (ANN) and wavelet were briefly described. Their performances were compared using three actual wireless network traffic traces. Wireless traffic with time series model, artificial neural network, and wavelet-base method were separately predicted. The experimental results show the significant advantages of the ANN technique and AutoRegression Integrated Moving Average (ARIMA) predictor performs relatively the worst.
    Design of wireless video transmission system based on dual-channel
    Jin QI Jian WANG Xiao-yong JI
    2008, 28(11):  2756-2758. 
    Asbtract ( )   PDF (814KB) ( )  
    Related Articles | Metrics
    A novel prototype system to obtain real-time and high quality video transmission in wireless environment of high packet loss rate and limited bandwidth was introduced. The wireless terminal used high performance multimedia Digital Signal Processor (DSP) as video processing and control core. Video signal was encoded by H.264 and transmitted over dual-channel of Enhanced Data rate for GSM Evolution (EDGE) to the video services. A transmission method and an error conceal method based on dual-channel buffers were proposed. The experimental results show that the system can transmit real-time video (CIF) and achieve satisfactory reconstructed video.
    Adaptive scheduling scheme to support real-time traffic in wireless local area networks
    Jing-Lian HUANG
    2008, 28(11):  2759-2762. 
    Asbtract ( )   PDF (734KB) ( )  
    Related Articles | Metrics
    To overcome the defect of IEEE 802.11e reference scheduler allocating fixed Transmission Opportunity (TXOP) duration, an adaptive scheduling scheme was proposed to support real-time traffic. The proposed scheduler dynamically allocated variable TXOP duration based on the traffic load information of the amount of buffered frames in each traffic stream queue sent by stations, to satisfy the requirements of different traffic under different load. By guaranteeing minimum delay of traffic, the scheduler tried to allocate TXOP for the new arrival traffic with proportional request reduction and linear programming. Detailed simulation results and comparison with IEEE 802.11e reference scheduler prove that the proposed scheduling scheme not only improves system throughput, but also decreases delay of real-time traffic.
    Enhanced TCP westwood algorithm based on loss differentiation over GEO satellite networks
    Jian-feng WANG Guo-ce HUANG Qiao-yan KANG
    2008, 28(11):  2763-2766. 
    Asbtract ( )   PDF (945KB) ( )  
    Related Articles | Metrics
    The advantages and disadvantages of TCP Westwood (TCPW) algorithm were analyzed, especially when it was used in Geostationary Earth Orbit (GEO) satellite networks. In order to solve the existing problems, a new improved TCPW (TCPW-N) algorithm considering loss differentiation was proposed. TCPW-N algorithm took full advantage of Vegas, Veno and the existing improved TCPW algorithm (namely LogWestwood+), and TCPW-N was suitable for GEO satellite networks. TCPW-N algorithm can judge the packet loss reason, and adjust the congestion window according to the different packet loss reasons and the estimated network bandwidth. Performance analysis and simulation results show that TCPW-N algorithm has effectively resolved the existing problems of TCPW. Compared with TCPW and its other improved algorithm, TCPW-N algorithm has better throughput performance, lower packet loss rate, and better fairness and friendliness when applied to GEO satellite networks.
    Heuristic anti-monitoring path searching algorithm in sensory field
    2008, 28(11):  2767-2770. 
    Asbtract ( )   PDF (933KB) ( )  
    Related Articles | Metrics
    Focusing on the anti-monitoring problem of mobile object in sensory fields, new concepts such as triangle gird, cross cost, SRE were proposed, a novel heuristic anti-monitoring path searching algorithm in sensory field by utilizing A* algorithm was designed. Theoretical analyses and experimental results show that, compared with conventional works, the new algorithm has better anti-monitoring performance and lower computation complexity, and can guarantee the mobile object move along the path with less risk to the destination position.
    Evolving complex network model based on Agent
    Wei Shi Zheng Zhao Gui-xiang Xue
    2008, 28(11):  2771-2773. 
    Asbtract ( )   PDF (765KB) ( )  
    Related Articles | Metrics
    In order to find connections between network structure and network action, a new dynamic evolving model based on Dynamic Agent (DA) was proposed. Every node in network was modeled as an agent that had life and evolved according to its own strategy. The experimental results show that this model possesses good properties such as small-world property, scale-free property and large clustering coefficient, which reflect the real networks very well. Furthermore, this model improves the robustness of traditional models when attacked.
    Root cause notification RFD algorithm with path exploration detection
    Xiao-Ling Mu Da-fang ZHANG Bin ZENG Xia-an BI
    2008, 28(11):  2774-2777. 
    Asbtract ( )   PDF (821KB) ( )  
    Related Articles | Metrics
    Route Flap Damping (RFD) was a mechanism that played as a key contributor for Internet routing stability. In this paper, Root Cause Notification (RCN) route flap damping algorithm produced a lot of updates because invalid path exploration were noted, so a root cause notification RFD algorithm with path exploration detection using the RCN table and the characteristics of routes generated in path exploration was proposed. The algorithm can distinguish route flap and path exploration correctly and damp the invalid routes. The simulation results indicate that the algorithm can reduce the number of updates significantly and improve performance of the RFD.
    Novel clustering protocol based on dynamic optimal number of clusters for wireless sensor network
    Guo-yuan HE Di CHEN
    2008, 28(11):  2778-2780. 
    Asbtract ( )   PDF (718KB) ( )  
    Related Articles | Metrics
    To improve the performance of Low Energy Adaptive Clustering Hierarchy (LEACH), a novel clustering protocol called Dynamic Optimal Number of Clusters (DONC) was proposed. In the set-up phase, it can determine the optimal number of clusters according to the remaining number of nodes rather than a fixed number. Furthermore, the remaining energy and the geographical position of nodes were fully considered in cluster-head selection; in the steady-state phase, a modified multi-hop algorithm between cluster-heads was adopted. Simulation shows that the new protocol can guarantee the number of clusters is always in optimal state, and ensure the cluster-heads distributed evenly in the network and effectively prolong the system lifetime.
    Self-tuning fuzzy AQM mechanism based on traffic load and queue length
    Qiao-yan KANG Kan-min YU Xiang-ru MENG Jian-feng WANG
    2008, 28(11):  2781-2783. 
    Asbtract ( )   PDF (688KB) ( )  
    Related Articles | Metrics
    The existing fuzzy Active Queue Management (AQM) mechanisms mostly consider the queue length and its change rate as fuzzy inputs, while rarely consider the effect of packet arriving rate together. In order to design a more effective AQM algorithm, a novel fuzzy AQM algorithm called FQL-AQM was proposed. FQL-AQM considered both real queue length and average traffic load factor as fuzzy inputs, and regulated packet dropping probability through a fuzzy self-tuning algorithm. This algorithm can keep the queue length stable at the reference queue length level, and keep the average load factor stable at 1. And FQL-AQM can be well applied to a variety of network environments and can improve the network robustness. Simulation results show that FQL-AQM algorithm is efficient, stable and outperforms other proposed AQM algorithms in response rate, link utilization ratio, and queue length stability.
    Unequal energy-balancing algorithm based on least-clustering in wireless sensor networks
    Juan YE Li-jun XU Ming LIU Shi-jue ZHENG
    2008, 28(11):  2784-2787. 
    Asbtract ( )   PDF (673KB) ( )  
    Related Articles | Metrics
    In wireless sensor networks, nodes closer to the base station are prone to die because of excessive flow, in which becomes a hot issue. Forming clusters can not only address this issue, but also reduce energy consumption of the whole network. However, cluster head is much more expensive. An unequal energy-balancing algorithm based on least-clustering (EBUC) was proposed in this paper, in which a least coverage model was established at first to optimize the cluster head number. On this basis, how to adjust the number of cluster member and aggregation coefficient to balance energy consumption was studied. The simulation results prove that, through varying the number of cluster members and restricting aggregation coefficient, the algorithm can efficiently prolong network lifetime.
    Improved routing algorithm for ZigBee mesh networks
    Fang WANG Qiao-lin CHAI Yan-li BAN
    2008, 28(11):  2788-2790. 
    Asbtract ( )   PDF (806KB) ( )  
    Related Articles | Metrics
    Considering the high cost of the traditional AODVjr algorithm in ZIGBEE MESH network, an improved algorithm was proposed which was based on the role differences and current energy state of the node. Some important or low-energy nodes can avoid being disabled for continuing excess energy consumption, which can cause route invalidation and even network disability. The simulation indicates that the algorithm can improve the transport reliability, reduce the energy consumption and prolong the lifetime of the network.
    ZigBee tree routing algorithm based on energy balance
    Yan-li BAN Qiao-lin CHAI Chen WANG
    2008, 28(11):  2791-2794. 
    Asbtract ( )   PDF (734KB) ( )  
    Related Articles | Metrics
    Aiming at the problems of ZigBee tree routing algorithm that the routing may be not optimal and some nodes may use up all the energy because of heavy transmissions, this paper puts forward an improved ZigBee tree routing algorithm based on energy-balanced. The improved algorithm introduces the neighbor table to make sure that the routing is local optimal by considering the routing hops. At the same time, this paper also considers the residual energy of nodes to avoid selecting some nodes with low residual energy in routing selection. The simulation results indicate that this improved algorithm can reduce the energy consumption efficiently, resolve the problem of unbalance load and maximize the lifetime of the whole network.
    Efficient encapsulation strategy of content-based XML dissemination
    Ying-ying WANG Zheng LI
    2008, 28(11):  2795-2797. 
    Asbtract ( )   PDF (791KB) ( )  
    Related Articles | Metrics
    Relevant subscriptions are stored in the routing tables in a Publish/Subscription (P/S) system. The already existing optimizations focus more on single router and didn't exploit from this. In this paper, the XPath subscription aggregation techniques were used and a 2-phase encapsulation strategy was proposed to generate a header of the XML to speed up the processing and matching of the downstream router. Traditional immediate forwarding protocol can improve the dissemination by skipping the remaining processing after first match, but it can't get entire header to be used by the downstream router. An adaptive forwarding strategy was proposed to combine the immediate forwarding and delay forwarding together to give a full exploitation on the subscriptions and matching, and the whole dissemination efficiency of the P/S was consequently improved. Our experimental results demonstrate the correctness.
    Information security
    Secure and efficient WTLS handshake protocol
    Wen XIANG Liang-sheng TAO Tong-yang WANG
    2008, 28(11):  2798-2800. 
    Asbtract ( )   PDF (575KB) ( )  
    Related Articles | Metrics
    The primary goal of Wireless Transport Layer Security (WTLS) is to provide the security of the wireless communication. An efficient WTLS handshake protocol would speed up establishing the session between the client and the server, and at the same time reduce the spending of resource on the mobile. A new WTLS handshake protocol called Light online compute WTLS (L-WTLS) was proposed. L-WTLS was much more economic since it had less computation, especially the online ones. At last, that the L-WTLS is more suitable for the low power mobile terminal is proved.
    On Sybil attack in wireless sensor networks
    Xiang-dong WANG Shao-he LV Yan-qiang SUN Xiang-xu MENG
    2008, 28(11):  2801-2803. 
    Asbtract ( )   PDF (823KB) ( )  
    Related Articles | Metrics
    A novel detection mechanism, called Cooperative RSS-based Sybil Detection (CRSD) used in static and resource-limited Wireless Sensor Networks (WSN) was proposed. CRSD took use of the Received Signal Strength (RSS) to induce the distance between two nodes and further determined the positions of the identities of interests by use of the RSS information from multiple neighbor nodes. A Sybil attack was detected when two or more different identities with almost the same position were got. The simulations and results show that, first, Sybil attack can certainly deteriorate the system performance significantly and furthermore, CRSD can detect such attack in most cases and thus facilitate the avoidance of using Sybil node to protect the overall performance effectively.
    Perceptual image hashing algorithm based on difference quantization of histogram and chaos system
    Shao-jiang DENG Fang-xiao WANG Dai-gu ZHANG Yu WANG
    2008, 28(11):  2804-2807. 
    Asbtract ( )   PDF (682KB) ( )  
    Related Articles | Metrics
    Difference Quantization of Histogram (DQH) based on image grayscale compression was studied, as well as chaos system. A new perceptual image hashing algorithm was proposed. To begin with, the image was compressed in grayscales. After that, intermediate image hash was obtained form modulation between chaos sequence and the probability sequence of every grayscale of the compressed image. At last, final image hash was generated by binarization and DQH. The experimental results show that the proposed scheme is robust against JPEG compression, low-pass filtering, scaling and rotation attacks. Additionally, the chaos system obviously enhances the security.
    Cryptanalysis and improvement of complete asymmetric public-key traitor tracing scheme
    Xue-jun ZHANG
    2008, 28(11):  2808-2810. 
    Asbtract ( )   PDF (719KB) ( )  
    Related Articles | Metrics
    A complete asymmetric public-key traitor tracing scheme was proposed by Wang Qing-long et al., which claimed that it had some advantages such as revoking unlimited traitors and higher transmission efficiency. The scheme and its obvious defect were carefully analyzed, and then a attack was given. And traitors can perform a collusion attack, but the manager can not trace the traitors by the black-box traitor tracing method. Finally, an improved scheme was proposed in which traitors still could play the above attack, but they can be traced.
    On security of efficient nonce-based remote user authentication scheme using Smart Card
    Zhong ZHANG Tao XIANG
    2008, 28(11):  2811-2813. 
    Asbtract ( )   PDF (528KB) ( )  
    Related Articles | Metrics
    Authentication is an issue of importance in computer communications, and password authentication protocols have been widely utilized due to their great convenience. Recently, Lee et al. proposed a nonce-based remote user authentication scheme using smart cards. In this paper, however, it is found that their scheme is not secure as claimed, and two attacks can be launched to break the scheme.
    Study on modeling mobile phone virus spreading
    Luo-sheng WEN Jiang ZHONG
    2008, 28(11):  2814-2816. 
    Asbtract ( )   PDF (586KB) ( )  
    Related Articles | Metrics
    The models of mobile phone virus that was transmitted by Bluetooth were studied in the paper. Based on the mobile property, the disadvantage of existing models was analyzed, and then two correctional models were presented by modifying definition of parameter in KW model and rate equation model. Theoretical results and simulations show that the correctional models better describe the virus spreading in mobile environment. The motion of phones better mixes infected phones and susceptible phones only, not increase infection rate of virus. The results in this paper clarify the effect of virus spreading on movement velocity in mobile environment.
    Efficient and resilient shared-key discovery protocol in wireless sensor networks
    Jin-bo SHEN Li XU Jian-wei CHEN
    2008, 28(11):  2817-2819. 
    Asbtract ( )   PDF (821KB) ( )  
    Related Articles | Metrics
    In security construction of Wireless Sensor Networks (WSN), key pre-distribution scheme plays an important part. However, the shared-key discovery protocol of the present key pre-distribution schemes is lowly resilient against the smart attack, at the same time, it requires high communication and computation cost. Based on analyzing all kinds of typical shared-key discovery protocols features in detail, an Efficient and Resilient Shared-key Discovery (ERSD) protocol by using privacy homomorphism and bloom filter was proposed in this paper. Both performance and simulation results prove that the proposed protocol is better resilient against the smart attack in the condition of taking up a little communication and computation cost.
    BTSR: Secure data fusion and routing algorithm based on behavior trust
    Cheng ZHU Ming-zheng ZHOU Jin-sheng XU
    2008, 28(11):  2820-2823. 
    Asbtract ( )   PDF (781KB) ( )  
    Related Articles | Metrics
    In order to treat the problem of routing security in wireless sensor network, data fusion event was both spatially and temporally correlated. Low Energy Adaptive Clustering Hierarchy (LEACH) was improved and nodes' behavior trust was taken into account, a secure data fusion and routing algorithm based on behavior trust (BTSR) was proposed. The security and reliability of the algorithm were implemented by using statistical hypothesis test for matching the reading sequence of sensors and statistical characters of the data fusion event. The simulation results show that BTSR is better than LEACH on security probability, energy consumption and fusion precision.
    Adaptive algorithm of echo hiding based on short-time energy computing
    Sheng TANG Yu-qing HOU Jing KE
    2008, 28(11):  2824-2826. 
    Asbtract ( )   PDF (539KB) ( )  
    Related Articles | Metrics
    An adaptive algorithm of echo hiding based on short-time energy computing was proposed in this paper. The original audio was first divided into segments, and the energy of each segment was computed. The decay rate of echo kernel was adaptively adjusted according to the energy of each segment. And the detection of the secret information took the advantage of a power cepstrum computing method. The experimental results show that the improved method is robust to many attack operations and a significant improvement in imperceptibility is achieved.
    Identity-based blind signature scheme based on BLS signatures
    Wei GAO Fei LI Bang-hai XU
    2008, 28(11):  2827-2828. 
    Asbtract ( )   PDF (558KB) ( )  
    Related Articles | Metrics
    Depending on BLS signing algorithm, blind signing algorithm of BLS signatures, and aggregating algorithm of BLS signatures, a new efficient identity-based blind signature scheme was proposed. First, the round complexity of this scheme was optimal, i.e. it was enough for the user and the signer to respectively transmit only one message during each blind signing process. Second, its security was based on the so-called one-more Computational Diffie-Hellman Assumption (CDH) assumption, while the security of the other similar identity-based signature scheme was based on the stronger assumption-ROS assumption. Additionally, this scheme was computationally efficient and had very short signature length. Therefore, it was very suitable for the applications such as e-cash and e-voting.
    Unknown virus detection based on Win32 API
    Liang CHEN Ning ZHENG Yan-hua GUO Ming XU Yong-tao HU
    2008, 28(11):  2829-2831. 
    Asbtract ( )   PDF (574KB) ( )  
    Related Articles | Metrics
    This paper proposed a virus detection method using behavior feature vector. Each dimension of the vector stood for a malicious behavior event represented by corresponding Win32 API calls and their certain parameters. An automatic executable behavior tracing system (Argus) was also implemented to dynamically capture the events. In the experiment, attribute reduction was applied to mutual information to decrease the number of dimension after an analysis of the sample dataset. Experimental result suggests that model after attribute reduction is still efficient in detecting unknown virus which has more than one event captured.
    Policy monitor model based on Mealy automata
    Jun PENG Xing-yuan CHEN Bei WU Xiang-dong DAI Yong-liang WANG
    2008, 28(11):  2832-2834. 
    Asbtract ( )   PDF (544KB) ( )  
    Related Articles | Metrics
    Policy monitoring is one of the most indispensable step in the implementation of the whole policy management, which can improve the reliability of the system and offer the references to the audit after some security incidents' occurrences. In this paper, the policy states were divided into several types. Also the policy states translation model based on the Mealy automata was promoted. It provided the objects for the policy monitor. At last, programs implementation of the automata and test results are given to show the timely response when events happen.
    Research of mediated identity-based encryption
    Bin YANG Xuan-dong XIONG Ke-jun SU
    2008, 28(11):  2835-2836. 
    Asbtract ( )   PDF (526KB) ( )  
    Related Articles | Metrics
    Combining mediated encryption with Certificateless Public Key Encryption(CL-PKE), a new Variant Mediated Identity-Based Encryption (V-MIBE) scheme based on computational bilinear Diffie-Hellman assumption was presented. New scheme not only solved the problem of key escrow by the idea of CL-PKE but also provided fast key revocation with mediator. New scheme can resist the attack of replacing user's public key. Compared with the existing identity-based encryption scheme, the security of new scheme improves remarkably.
    Artificial intelligence
    Study on granularity concept matching based on How-Net semantic tree
    Xi-quan YANG Shu DAI
    2008, 28(11):  2837-2839. 
    Asbtract ( )   PDF (496KB) ( )  
    Related Articles | Metrics
    In this paper, semantic trees that had accession and deletion were established based on How-Net to implement granularity concept matching. The concept semantic tree matching algorithm was presented. Efficiency of the algorithm was proved by the results of the experiment and the problem of "key word obstacle" and semantic ambiguity can be solved much better. The recall ratio was improved.
    Generalized genetic particle swarm optimization for supply chain optimization
    Gui-wu HU
    2008, 28(11):  2840-2843. 
    Asbtract ( )   PDF (716KB) ( )  
    Related Articles | Metrics
    Supply chain optimization is an important and difficult problem in supply chain management. Firstly, a novel supply chain optimization model was proposed in the paper. Secondly, the generalized Genetic Algorithm (GA) that embedded particular natural evaluative rules was built, and Generalized Genetic Particle Swarm Optimization (GGPSO) was gotten by combining GA and PSO. The novel method overcomes the local convergence of PSO and improves its global research ability. The experimental results show that GGPSO does better than branch and bound methods, traditional GA and PSO.
    Selective neural network ensemble methods based on chaos PSO
    Yu-bo TIAN Zheng-qiang LI Ren-jie ZHU
    2008, 28(11):  2844-2846. 
    Asbtract ( )   PDF (570KB) ( )  
    Related Articles | Metrics
    Selective Neural Network Ensemble (NNE) methods based on Decimal Particle Swarm Optimization (DePSO) and Binary Particle Swarm Optimization (BiPSO) were proposed in this paper. The basic idea of the methods was to optimally select Neural Networks (NNs) to construct NNE with the aid of PSO. This may maintain the diversity of NNs and decrease the effect of collinearity and noise of sample. Meanwhile, chaos mutation was adopted in order to increase the diversity of particles of PSO. The experimental results show that the chaos PSO algorithm is an effective ensemble method, and it may improve the generalization ability of NNE in comparison with the available ones.
    Classification of water quality based on intelligent total margin adaptive fuzzy support vector machine
    Hong-liang DAI Dao-qing DAI
    2008, 28(11):  2847-2849. 
    Asbtract ( )   PDF (686KB) ( )  
    Related Articles | Metrics
    In this study, Total-margin Adaptive Fuzzy Support Vector Machine (TAFSVM) of good quality was proposed. In addition, Real-valued Genetic Algorithm (RGA) optimized its parameters. Subsequently, the model of Real Genetic Algorithms Total Margin Adaptive Fuzzy Support Vector Machine (RGATAFSVM) was used to classify four kinds of data sets of water quality. The experimental results show that the proposed model can achieve higher classification accuracy and stability than standard support vector machine, BP neural networks and single factor assessment. Consequently, the RGATAFSVM model provides a promising alternative for classification in water quality.
    Solving 2-way graph partitioning problem using genetic algorithm based on uniform design sampling
    Ben-da ZHOU Ming-hua CHEN Zhe REN
    2008, 28(11):  2850-2852. 
    Asbtract ( )   PDF (612KB) ( )  
    Related Articles | Metrics
    Genetic Algorithm (GA) is a guided random search and the guiding direction always aims at the family whose ancestors have schemata with high fitness. Based on the results, the crossover operation in GA was redesigned by using the principle of random uniform design sampling and combining the locale search strategy. Then a new GA called Genetic Algorithm based on Uniform Design Sampling (UDS) was presented. The new GA was applied to solve the 2-way graph partitioning problem. Compared to simple GA and good point GA for solving this problem, the simulation results show that the new GA has superiority in terms of speed and accuracy and overcomes premature convergence.
    Multi-modal face recognition based on LBP and chain AdaBoost
    Jian-hua YE Zheng-guang LIU
    2008, 28(11):  2853-2855. 
    Asbtract ( )   PDF (857KB) ( )  
    Related Articles | Metrics
    A method combining Local Binary Pattern (LBP) descriptor with chain AdaBoost was presented for multi-modal face recognition. Thousands of Regional LBP histograms (RLBPH) were generated from grey-level and depth face images respectively. Chain AdaBoost was utilized to select most informative RLBPHs. The selected RLBPHs were concatenated to a whole histogram. Then the corresponding linear subspaces were constructed by Linear Discriminant Analysis (LDA) respectively. The cosine similarity was adopted as the similarity metric of projected vectors. Sum rule was used to fuse 2D and 3D information. The experimental results on FRGC database demonstrate that the proposed method achieves high recognition performance with very few features. The Equal Error Rate (EER) is only 1.40%.
    3D position and attitude measurement based on marking-points recognition
    Li-feng RUAN Geng WANG Huan-ye SHENG
    2008, 28(11):  2856-2858. 
    Asbtract ( )   PDF (918KB) ( )  
    Related Articles | Metrics
    A new method based on binocular visual theory to measure 3D position and attitude parameters of a moving object was described. Local coordinate system of the moving object was defined by LED marking-points. By calculating 3D position of each LED, 3D position and attitude parameters of the moving object can be calculated. At the same time, according to the particularity of environment, an algorithm called constraint of epipolar-slope match based on priority was presented. Experimental results show this method is simple and efficient, and satisfies the requirements of precision and real time.
    Research of concept cluster based ontology mapping
    Wen-tao LV Yang XIANG Bo ZHANG
    2008, 28(11):  2859-2862. 
    Asbtract ( )   PDF (817KB) ( )  
    Related Articles | Metrics
    Ontology heterogeneity is a big bottleneck of ontology application, and ontology mapping is the base for integration of heterogeneous ontology. Concept Cluster based Ontology Mapping (CCOM) used information of concepts' structure in ontology mapping, using similarity of concept cluster to replace similarity of concept for mapping rules reasoning. Experimental results show that CCOM is of very good recall and precision.
    Costs sensitive to examples learning in reduced support vector machine
    Hai-jiang HE
    2008, 28(11):  2863-2866. 
    Asbtract ( )   PDF (935KB) ( )  
    Related Articles | Metrics
    In many machine learning domains, misclassification costs are sensitive to examples. As an extension of class dependent costs, a cost-sensitive reduced Support Vector Machine (SVM) named sd2sSVM that aimed at minimizing all costs was introduced. Firstly, through the use of Generalized SVM (GSVM) framework, the optimization object was converted into unconstrained mathematical programming problems. Secondly, based on smooth piecewise polynomial function that was used to approach the plus function, the unique optimization solution can thus be gained by Newton-YUAN method. Finally, reduced kernel was employed to improve the solution of nonlinear problem. The experimental results show that sd2sSVM is comparable or choicer than traditional example dependent cost-sensitive SVM. It was also discussed that how parameter C influenced the performance of sd2sSVM.
    Optimal resource model and task scheduling algorithm based on dynamic load balancing strategy in grid
    Shao-bo ZHONG
    2008, 28(11):  2867-2870. 
    Asbtract ( )   PDF (734KB) ( )  
    Related Articles | Metrics
    Task scheduling is a NP-hard problem and also an integral part of parallel and distributed computing. It becomes more complicated especially in the grid computing environment. An optimal task scheduling model and an algorithm were brought forward, which combined the advantages of immune clonal algorithm and simulated annealing. The simulation results show that this algorithm achieves resource load balancing, and it overcomes the shortcomings of genetic algorithm, and can be applied to the optimization of task scheduling successfully.
    Adaptive particle swarm optimization algorithm based on intuitionistic fuzzy population entropy
    Yu-zhe WANG Ying-jie LEI
    2008, 28(11):  2871-2873. 
    Asbtract ( )   PDF (567KB) ( )  
    Related Articles | Metrics
    For complex multi-peaks function with high dimensions, canonical Particle Swarm Optimization Algorithm (PSOA) has big chance falling in premature convergence for the fast losing of population diversity. With the disadvantages, the intuitionistic fuzzy population entropy was presented as the estimate of the diversity of the population in this paper. By applying the intuitionistic fuzzy population entropy as parameter in velocity updated mechanism, the improved PSOA can prevent premature convergence, which can also provide the PSOA with adaptabily. The experiments show the Improved PSOA is significantly superior to canonical PSOA.
    Alternating-time temporal logic with strong and weak exceptions
    Xian-wei LAI Shan-li HU Zheng-yuan NING Xiu-li WANG
    2008, 28(11):  2874-2876. 
    Asbtract ( )   PDF (1125KB) ( )  
    Related Articles | Metrics
    Most application systems of artificial intelligence may face the problem of non-monotonic reasoning, so do multi-agent systems. Based on our former work on agent BDI logic, multi-agent cooperation logics and multi-agent cooperative problem solving process modeling, as well as the work of Baral et al. on non-monotonic temporal logics, strong and weak exceptions were introduced to Alternating-time Temporal Logic (ATL) that was the primogenitor of multi-agent cooperation logics. As a result, non-monotonic alternating-time temporal logic was developed, and its syntax and semantics were proposed. As far as we know, the work presented in this paper was the first attempt of non-monotonic extending of multi-agent cooperation logics. Non-monotonic alternating-time temporal logic can be adopted as a theoretical tool to model multi-agent mental states and their dynamic revision mechanism.
    Improved ant colony algorithm in grid model for mobile robot path planning
    Pei-dong WANG Zu-hong FENG Zhi-chang SUN
    2008, 28(11):  2877-2880. 
    Asbtract ( )   PDF (865KB) ( )  
    Related Articles | Metrics
    An improved ant colony algorithm was provided in this paper for robot path planning in a static environment. In this algorithm the model of robot's workspace was established with grid method and foldback iterating was used to search the aims by simulating the foraging behavior of ant colony. A heuristic factor based on the most pheromone in a moving direction range and a goal guiding function were used during the searching process. Furthermore, according to the features of the pheromone strewing when solving the problem by ant colony algorithm, the strewing method and updating strategy of pheromone were reconstructed. The simulation results show that these improvements make searching of the best path rapid and efficient. With this method a best path can be found rapidly even if the obstacles are exceedingly complicated.
    Graphics and image processing
    On detection of cottonseed perimeter based on self-adaptive freeman code
    Shao-jun LIU Ku WANG
    2008, 28(11):  2881-2883. 
    Asbtract ( )   PDF (587KB) ( )  
    Related Articles | Metrics
    To detect broken cottonseeds in cottonseeds real-time detection system, edge must be extracted and perimeter be calculated. Traditional methods of edge extraction such as Sobel, Robert, mathematical morphology and wavelet transformation are limited in real-time system due to their slow processing rate. Freeman code is one of the methods of edge description. The difference between Freeman code and other methods is that Freeman code gives the curvature and feature points and so on through relative techniques. Meanwhile, the curvature and feature points are essential to image compression and image restoration. The method of Freeman code in edge extraction was applied to cottonseed perimeter calculation. By comparison with Sobel and Robert, Freeman code method is single-pixel and proved to be quick and precise in calculating perimeter, especially in real time system.
    Image denoising method based on bidimensional empirical mode decomposition and mean filtering
    Xiao-yong RANG Jun-yong YE Chun-hua GUO
    2008, 28(11):  2884-2886. 
    Asbtract ( )   PDF (943KB) ( )  
    Related Articles | Metrics
    A new image-denoising method was proposed. Noised image was decomposed to a series of sub-band images by Bimensional Empirical Mode Decomposition (BEMD). High frequency sub-band images were denoised by mean filtering using different filter templates, and low frequency approximation image remained unchanged in this process. Then the denoised-image was obtained by composing the low frequency approximation images and the high frequency detailed images with mean filtering. Experimental result shows that the noise is effectively removed and the detail of the image is well preserved. This method has better denoising effect than single BEMD method and mean filtering method and the method combining wavelet transform with mean filtering.
    Directional diamond motion estimation algorithm based on parallelism and prediction
    Chang-hu WEI Zhi-ping JIA Zhi CHEN
    2008, 28(11):  2887-2889. 
    Asbtract ( )   PDF (993KB) ( )  
    Related Articles | Metrics
    The motion estimation algorithm in the MPEG-4 video encoding was studied and the potential parallelism in the algorithm was analyzed. Then the multi-core parallel computing concept was used in the directional diamond searching algorithm, and a prediction mechanism was introduced to improve the degree of parallelism. Then the directional diamond Motion estimation algorithm based on parallelism and prediction (PPDDME) was proposed. The experimental results coming from PC and the Omap5910 embedded platform show that the encoding speed is improved efficiently and the compression quality is the same as the serial algorithm.
    Fast mode decision of downscaling video transcoding for H.264 streams
    Yong-sheng XIANG Ming FU
    2008, 28(11):  2890-2892. 
    Asbtract ( )   PDF (866KB) ( )  
    Related Articles | Metrics
    The H.264 coding standard adopts some novel features such as intra prediction, and variable block size to achieve higher coding efficiency at the sacrifice of computational complexity,so the algorithm of mode decision will remarkable affect the efficiency of video transcoding based on H.264. A fast mode decision algorithm of spatial downscaling trnascoder for H.264 video stream was proposed. It utilized the local prediction direction and the gradient to reduce the number of candidate modes. The experimental results demonstrate that it can reduce the complexity of mode decision in downscaling video transcoding while keeping the quality of reconstructed video and coding efficiency.
    New edge-detecting algorithm based on LIP mathematical model
    Shun WANG Xue-gang HU
    2008, 28(11):  2893-2895. 
    Asbtract ( )   PDF (1049KB) ( )  
    Related Articles | Metrics
    A new edge-detecting algorithm based on human eyes' regulations was proposed. It deduced a new grads formula by using and improving Logarithmic Image Processing (LIP) model, and formed a new edge detecting method ultimately. The methods greatly reduced the production of non-edged noises. The method adopted a way of image lapping to detect the edges of image exactly in the end. The experimental results show that the algorithm has many advantages on edge-detection such as being more exact and less non-edged noise.
    Features and application of image sector
    La-mei CHEN Bin CHEN Jia-hui CHEN
    2008, 28(11):  2896-2899. 
    Asbtract ( )   PDF (1028KB) ( )  
    Related Articles | Metrics
    Based on Harr-like rectangle features, a new image feature-sector feature and its extraction method were proposed. With rotational invariance of circle, image was divided into different sectorial sub blocks in polar coordinates, and the sum of regional pixels was taken as sector eigenvalue. Then a normalized feature space by norming sector feature set was got. Application on real-time face detection system shows that, the sector features have better recognition performance and preferable robustness on image transforming, rotation, scaling, and noise jamming than traditional image features.
    Rock fracture skeleton extract based on ultraviolet image
    Min-xiang LIU Wei-xing WANG
    2008, 28(11):  2900-2903. 
    Asbtract ( )   PDF (1580KB) ( )  
    Related Articles | Metrics
    To extract skeleton based on ultraviolet rock fracture image using digital image processing technique, it needs to pretreat the rock fracture image first by image processing operation such as noise filtering, image segmentation, cavity filling, spur removal etc. Then an algorithm based on the structural elements of the layers thinning was proposed on the basis of the analysis of the skeleton characteristic and the skeleton of extraction algorithm. This algorithm can extract rock fractures of the skeleton very well. The experimental results show that the algorithm can extract a better skeleton of rock fracture efficiently and steadily.
    Research and application of fingerprint image quality estimation
    Yu-lan ZHAO Zeng-Guang WU Xiang-ping MENG Shu LIU
    2008, 28(11):  2904-2907. 
    Asbtract ( )   PDF (904KB) ( )  
    Related Articles | Metrics
    Fingerprint image quality estimation is an important step of Automatic Fingerprint Identify System (AFIS). The quality of fingerprint image from fingerprint machine seriously affects preprocess and identification. The exiting detailed regulations were analyzed, the influence on fingerprint quality from valid area, range of gray level, dry, wet to deflect were discussed. A new method was proposed to estimate fingerprint image quality based on information about edge-minutiaes, and qualified fingerprint images were provided. Experimental results show that it can filter unqualified fingerprint image effectively, and it is helpful to raise the efficiency of whole system.
    Adaptive multiscale based algorithm for defect segmentation in welding seam X-ray image
    Yan-chun WANG De-qun LIANG Yan WANG Yun-ting XING
    2008, 28(11):  2908-2911. 
    Asbtract ( )   PDF (1043KB) ( )  
    Related Articles | Metrics
    Defects in welding seam X-ray images include similar circular defects and similar bar defects. According to the theory of multiscale edges detection, the conclusion was drawn that in appropriate scale, circular defects are considered as roof edges in two directions that are orthogonal, while bar defects are viewed as roof edges in one direction. Wavelet scales can be confirmed by region homogeneity measure in this paper. LOG operator and filter scales of steerable filters were actively ascertained in the defect areas so that the two types of defects could be segmented. Theoretical analysis and experimental results show that this algorithm is effective.
    Research of FCM for image segmentation based on graph theory
    Ming-xia XIE Ke CHEN Jian-zhong GUO
    2008, 28(11):  2912-2914. 
    Asbtract ( )   PDF (748KB) ( )  
    Related Articles | Metrics
    Graph theory was utilized to improve image segmentation of traditional Fuzzy C-Means (FCM). The proposed algorithm used weighting of graph theory to calculate the distance of FCM, compared with Euclid distance, the proposed algorithm not only considered the distance of every sample, but also considered the Grayscale difference of every sample, and gained fuzzy membership function which was suitable for image segmentation. Based on the experimental result, probability of error and index of evaluation through comparing with image segmentation based traditional FCM and image segmentation based graph theory. The improved FCM in this paper is proved to be an appropriate method which is suitable for image segmentation.
    Software process technology
    Survey of software design for testability
    Jian-ping FU Min-yan LU
    2008, 28(11):  2915-2918. 
    Asbtract ( )   PDF (868KB) ( )  
    Related Articles | Metrics
    Methods of software design for testability can be divided into four categories: rules that must be followed in the design phase, Ad Hoc techniques of modifying the software design and/or codes to improve the software testability, structural techniques of adding testing structures in the software and testability synthesis techniques of considering software testing in the whole cycle of software development. These methods of software design for testability use many ideas of hardware design for testability for reference and can be expanded deeply in many aspects.
    Study on design method of embedded adaptive safety critical middleware
    Yi ZHANG Wan-dong CAI Yue WANG
    2008, 28(11):  2919-2921. 
    Asbtract ( )   PDF (819KB) ( )  
    Related Articles | Metrics
    Embedded Safety-Critical Systems (ESCS) are those systems whose failure could result in loss of life, significant property damage, or damage to the environment. Because of the nature of ESCS, designing the applications for ESCS is harder than that for distributed real-time embedded systems. In this paper, a multilevel embedded safety-critical middleware called Adaptive Safety-Critical Middleware (ASCM) was described. ASCM provided related services to ease the development of embedded safety-critical applications. Multi-layer end-to-end adaptive QoS management technology was also presented to satisfy the dynamic and unpredictable mission requirements of ESCS.
    Process mining algorithm to discover non-certain choice and parallel relation
    Hong-mei HUANG Yun ZHANG
    2008, 28(11):  2922-2925. 
    Asbtract ( )   PDF (709KB) ( )  
    Related Articles | Metrics
    Non-certain choice and parallel is a ubiquitous relation between tasks in the business process. Modeling this kind of relation by traditional WF_Net based method will cause duplicated tasks in the model, which brings difficulties to the process mining. Based on event logs, in this paper the non-certain choice and parallel relation was defined, and meanwhile co-operating with synchronized-manager a theorem and the γ algorithm that can determine this relation was proposed. The γ algorithm overcame the limits of current mining algorithm, and it could mine management operation actions while mining the process structure, which greatly improved the applicatory of process mining. The experimental results show that this γ algorithm is effective.
    BPEL based method for general security control module design
    Guo-feng ZHANG Jun HE Cong-fu XU
    2008, 28(11):  2926-2928. 
    Asbtract ( )   PDF (675KB) ( )  
    Related Articles | Metrics
    With the introduction of the Service Oriented Architecture (SOA), the integration and development speed of software systems will become quicker and quicker. But the security mechanism of software systems has to be rebuilt when they are developed. Moreover, security mechanism becomes more complex when the number of software systems increases rapidly. A Business Process Execution Language (BPEL)-based method for general security control module design was proposed, which reduced the development and management work. The operation mechanism of right module was exemplified by the account integration of Enterprise Resource Planning (ERP) in manufacturing with e-business system.
    Research into safety component model framework of safety requirement-oriented
    Gang YU Zhong-wei XU
    2008, 28(11):  2929-2932. 
    Asbtract ( )   PDF (950KB) ( )  
    Related Articles | Metrics
    Component theories are becoming more and more important in software engineering. The traditional component technology can't satisfy safety-critical software development requirement. A formal Safety Component (SC) model framework based on safety, which used the fault model and redundancy comparison to ensure the safety property of component, was proposed to standardize components specifications and designs to satisfy the development requirement of safety-critical software. The safety component model has been used in the simulation and testing system of CTCS-2 Train Control Center (TCC).
    Safety interface scheme for component-based safety critical software
    Ying LIU Zhong-wei XU
    2008, 28(11):  2933-2935. 
    Asbtract ( )   PDF (745KB) ( )  
    Related Articles | Metrics
    Safety is still a crucial requirement in component-based safety critical software. A safety interface scheme under multi-faults mode was introduced, and this scheme was applied to the development of railway computer interlocking software. By defining the safety interface for each component of the interlocking software, the safety of the interlocking system was guaranteed.
    Scenario-driven component behavior abnegation
    Yu-heng ZHENG Zhong-yu CHEN Wei-jie LI
    2008, 28(11):  2936-2939. 
    Asbtract ( )   PDF (747KB) ( )  
    Related Articles | Metrics
    Components with redundant functionalities, especially with undesired functionalities, can not be used by users. Therefore, the scenario-based behavior abnegation of components is an urgent problem, where the scenario specifies the user's desired behavior. An approach was proposed to abnegate the undesired behavior to get components that can be used. Annotate interface automata was used to model the behavior of components. The scenario specification was pictured by annotate Message Sequence Chart (MSC). The relevant algorithm was illustrated by an example.
    Study on group communication mechanism of migrating instances in migrating workflow management system
    2008, 28(11):  2940-2944. 
    Asbtract ( )   PDF (1013KB) ( )  
    Related Articles | Metrics
    Migrating Instance (MI) is a task executor in the migrating workflow management system, and can be cloned or derived from authorized work palaces in order to support decomposing and paralleling in business process. Migrating instance together with its clone and derivation composes a cooperative group. In this paper, a migrating instances group communication model based on service domain was proposed. Moreover the model definition and architecture were given, the reason for communication scheme choice was proved, and the key communication algorithms were depicted. The experimental results show that the model not only can ensure the message be transferred fast and reliably, but also can save the network bandwidth and computing resources of nodes dramatically, therefore the model can meet the requirements of high-efficient quality and scalability in migrating workflow system.
    Improved extraction method on logic function optimization of mass data processing
    Jing YE Lei YU Guang-yu ZENG Yan BAI
    2008, 28(11):  2945-2947. 
    Asbtract ( )   PDF (843KB) ( )  
    Related Articles | Metrics
    Extraction method is one of the classical methods that achieve the minimum coverage in two-level logic synthesis. But as the output variables and the prime implicant grow up, both the long processing time and the resource requirement become the major problems to be resolved with the extraction method. To overcome these drawbacks, a new ameliorated algorithm for the coverage minimization was presented in this thesis on the basis of the extraction method theory, which was adapted to the processing of mass data. Based on the intersection iterative and the local search algorithm theory, two major phases in this algorithm were improved, including the extremal selecting and the branches processing. As a result, by using the existing computer resources, testing shows a promising result and the improved algorithm is superior to the others multi-output logic function optimizations.
    Typical applications
    Application of laminated recursive RBF network in loss of customers
    Hua-qiu WANG Hang ZOU He YAN
    2008, 28(11):  2948-2951. 
    Asbtract ( )   PDF (895KB) ( )  
    Related Articles | Metrics
    In this paper the laminated recursive Radius Basis Function (RBF) network was applied to the loss of customers, and the solutions of the main issues involved in the loss of customers were presented to address the loss forecast model of the problem, including customer description attributes statute, the reasons for the loss prediction and control strategies. The unit laminated technology was adopted into the recursive RBF network to achieve the dynamic storage, which made the network have a dynamic data processing capability. The self-adaptive distance to optimize the kernel function bandwidth was also presented. The simulation on the temporal data from Mackey-Glass proves the effectiveness of the algorithm. Finally, the trained model was used to predict each customer's loss of possibility and generate the loss list of customers. Through the application to actual cases, the effectiveness and feasibility of the model are verified.
    Research of GPS vehicle terminal communication technology based on GPRS
    Xiao-wei HE Ai-hua WANG Yue MA
    2008, 28(11):  2952-2954. 
    Asbtract ( )   PDF (629KB) ( )  
    Related Articles | Metrics
    The software design of Global Positioning System (GPS) vehicle terminal was discussed, which was based on General Packet Radio Service (GPRS) wireless communication, including the definition of communication protocol between vehicle terminal and monitor center, the design of efficient strategy of GPS information receiving and unpacking, and GPRS communication flow design. The work provides a useful reference for developing GPRS communication equipment and GPS location equipment.
    Dynamic traffic model under emergency incident and bidirectional dynamic shortest path algorithm
    Zi-hui REN Jian WANG
    2008, 28(11):  2955-2957. 
    Asbtract ( )   PDF (716KB) ( )  
    Related Articles | Metrics
    A macroscopic dynamic traffic model for emergent incidents was presented with consideration of the number of the driveway, on-ramps and off-ramps and guidance instruction based on model METANET. And a bidirectional dynamic shortest path guidance algorithm for dealing with the emergent incidents timely and efficiently was also proposed. The weight altered dynamically with the change of the freeway and traffic jam. The shortest path from the two directions, which were timely and dynamically to strive for time in the processing of dealing with emergent incidents and succor, was searched. The simulation results show that the algorithm is feasible and effective and the efficiency of this algorithm has been improved.
    Query expansion based on user relevance feedback and ontology
    Xu-yang WANG
    2008, 28(11):  2958-2960. 
    Asbtract ( )   PDF (513KB) ( )  
    Related Articles | Metrics
    A novel method for Query Expansion (QE) was presented in this paper. The proposed method was a hybrid QE technology that combined user relevance feedback and ontology. The proposed method had two significant novelties: it combined user relevance feedback with ontology and used FirteX as the experimental platform. The proposed method was compared with cosine similarity-based QE that was a widely used query expansion technique. The experimental results show that the proposed method outperforms cosine similarity-based QE 15% and 13% in terms of average precision and average recall and has an improvement of 16% in F-measure.
    Check on consistency of tree pattern queries under DTD constraints
    Jian-mei ZHANG Shi-qun TAO
    2008, 28(11):  2961-2963. 
    Asbtract ( )   PDF (552KB) ( )  
    Related Articles | Metrics
    Tree pattern queries have been widely used in querying XML data. The check on consistence of tree pattern queries can avoid unnecessary calculation, save query processing time, and improve query efficiency. The definition of query consistency was given. Based on the concept of sub-path, an algorithm for checking consistency of tree pattern queries was proposed in presence of Document Type Definition (DTD). The analysis and comparison show that the algorithm is effective.
    Mining algorithm of distributed sequential pattern
    Peng CHANG Geng CHEN Yu-quan ZHU
    2008, 28(11):  2964-2966. 
    Asbtract ( )   PDF (786KB) ( )  
    Related Articles | Metrics
    In order to mine sequential patterns in distributed environment, Distributed Sequential Pattern Mining (DSPM) algorithm based on prefixSpan was proposed. Sample dataset was detected to balance the workload. Mining tasks were decomposed and distributed to many other computers. Pesudo-projected techniques were used to reduce the cost and the parallel was advanced by multithreading. The experimental results show that DSPM algorithm can mine global sequential patterns effectively and quickly.
    Research into simulation and modeling of material supply in emergent disaster based on DEVS/CD++
    Qi CAO Zhong-shi HE Lei YU
    2008, 28(11):  2967-2969. 
    Asbtract ( )   PDF (677KB) ( )  
    Related Articles | Metrics
    Dealing with emergent disaster is a typical discrete event system. Based on the analyses of Discrete Event System Specification (DEVS) formalism, the DEVS simulation model of material supply in the emergent disaster was made. The simulation entities were analyzed. The simulation flow was designed. The structures of coupled model and main atomic models were given. And the simulation test of this model was completed in CD++. The reasonable simulation results were obtained. It laid the foundation for the development of simulation training on the services of emergent disaster.
    New certainty degree of decision rule based on local attribute sets
    Kun SHI Yan-hui ZHAI Kai-she QU
    2008, 28(11):  2970-2971. 
    Asbtract ( )   PDF (453KB) ( )  
    Related Articles | Metrics
    In traditional rough set, certainty degree is employed to evaluate the decision performance of a decision rule. However, it is difficult to choose one from some decision rules for classification of a given object when their certainty degrees are equal. A new certainty degree of decision rule based on local attribute sets was proposed. It sufficiently reflected the difference between certainty degrees of decision rules in local attribute sets. An example illustrates that new measure is effective to evaluate the decision performance of a decision rule.
    Collaborative filtering algorithm using user background information
    Yi-fan WU Hao-ran WANG
    2008, 28(11):  2972-2974. 
    Asbtract ( )   PDF (568KB) ( )  
    Related Articles | Metrics
    Aiming at the difficulty of data sparsity in personalized recommendation systems, a new collaborative filtering algorithm using user background information was presented. The algorithm took full advantage of user data and domain knowledge in hand, modeled user similarity based on user background information and filled in the user-item rating matrix in advance before the traditional collaborative filtering. The experimental results show that the new algorithm can improve the recommendation accuracy efficiently and will not cause bottleneck on performance.
    Method research of new event detection based on news element
    Xiao-fei XUE Yong-kui ZHANG Xiao-dong REN
    2008, 28(11):  2975-2977. 
    Asbtract ( )   PDF (562KB) ( )  
    Related Articles | Metrics
    The purpose of New Event Detection (NED) is to detect the first news from one or multiple streams of news stories. Considering the impact of news basic factor in this paper, the traditional Term Frequency Inverse Document Frequency (TF-IDF) model was improved by the way of feature weighted, and time message and place message from news were extracted, then their similarity was respectively calculated and combined for NED. Experimental results show that this method is effective.
    Inverse control based on support vector machines and its stability analysis
    Lu-zhou LIU Jian XIAO
    2008, 28(11):  2978-2980. 
    Asbtract ( )   PDF (450KB) ( )  
    Related Articles | Metrics
    Support Vector Machines (SVM) is a new machine learning method on Structural Risk Minimization (SRM) with good generability. The method of constructing inverse controller using SVM was given in this paper. A pseudo-linear compound system was formed when cascading with the inverse controller before the original system. The finite-gain stability of the controller was proved under the assumption that the kernel function was local Lipschitz in this open-loop inverse control system. The sufficient condition for that Gaussian kernel function to the local Lipschitz of either variable was given. The stability of the whole system was also proved under some proper assumptions.
    Speech enhancement based on speech-presence probability and auditory masking property
    Yun-mei Gong Xiao-qun ZHAO Reng-hui SHI
    2008, 28(11):  2981-2983. 
    Asbtract ( )   PDF (850KB) ( )  
    Related Articles | Metrics
    In low Signal to Noise Ratio (SNR) environment, the trade-off among the amount of noise reduction, the level of musical residual noise and the speech distortion was the key problem of spectral subtraction speech enhancement. An improved speech enhancement algorithm for low SNR was developed in order to decrease the interference of noise on pure speech. This algorithm was based on the traditional spectral subtraction, and the subtraction parameter was self-adaptively adjusted in the light of the masking properties of human auditory. The speech-presence probability was integrated to estimate the signal and noise, which would avoid the inaccuracy of utilizing Voice Activity Detection (VAD), and increase the robustness. The experimental results demonstrate that this algorithm is effective to reduce the residual noise and the background noise, but not to distort the speech articulation compared to other modified spectral subtraction algorithms, especially for the low SNR noisy speech signal and that being degraded by non-stationary noise.
    Realization of automatic reasoning system of geometry based on point-eliminating method
    Hui-min LUO
    2008, 28(11):  2984-2986. 
    Asbtract ( )   PDF (605KB) ( )  
    Related Articles | Metrics
    In order to realize the readable proofs in geometry and improve the efficiency of reason, the design and implementation of an automatic reasoning system for structive geometry statements was introduced in the paper. Users can input the prerequisites of geometry statements by graphic-drawing method that the system provided. Most structive geometry statements in elementary geometry can be proved and resolved automatically with readable proofs, which can meet the needs of education and research on elementary or high geometry.
    Novel beamspace blind source separation method based on sub-band decomposition
    Ying-zhi WANG
    2008, 28(11):  2987-2990. 
    Asbtract ( )   PDF (842KB) ( )  
    Related Articles | Metrics
    Concerning the problems of the blind source separation algorithm that is not suitable for the broadband, complex computation, and being acute to various Signal Noise Ratio (SNR), a beamspace Blind Source Separation (BSS) method based on sub-band decomposition was proposed. The method of sub-band decomposition was used to realize the expansion of blind source separation under broadband condition, and beam transforming was used to reduce the amount of calculation. Simulation results demonstrate that the proposed method exhibits good source signal estimation capability. Even without any prior knowledge, it has the same performance as Root-Music high resolution algorithm.
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