Bimonthly    Since 1986
ISSN 1004-9037
Indexed in:
Publication Details
Edited by: Editorial Board of Journal of Data Acquisition and Processing
P.O. Box 2704, Beijing 100190, P.R. China
Sponsored by: Institute of Computing Technology, CAS & China Computer Federation
Undertaken by: Institute of Computing Technology, CAS
Distributed by:
China: All Local Post Offices
  • Table of Content
      15 March 2001, Volume 16 Issue 2   
    For Selected: View Abstracts Toggle Thumbnails
    Robot Self-Location by Line Correspondence
    HU Zhanyi(胡占义),LEI Cheng(雷成)and TSUI Hung Tat(徐孔达)
    Journal of Data Acquisition and Processing, 2001, 16 (2): 0-0. 
    Abstract   PDF(416KB) ( 1328 )  
    This paper thoroughly investigates the problem of robot self-location by line correspondences. The original contributions are three-fold: (1) Obtain the necessary and sufficient condition to determine linearly the robot's pose by two line correspondences. (2) Show that if the space lines are vertical ones, it is impossible to determine linearly the robot's pose no matter how many line correspondences we have, and the minimum number of line correspondences is 3 to determine uniquely (but non-linearly) the robot's pose. (3) Show that if the space lines are horizontal ones, the minimum number of line correspondences is 3 for linear determination and 2 for non-linear determination of the robot's pose.
    Leaf Movement Simulation
    FENG Jinhui(冯金辉),CHEN Yanyun(陈彦云),YAN Tao(严涛)and WU Enhua(吴恩华)
    Journal of Data Acquisition and Processing, 2001, 16 (2): 0-0. 
    Abstract   PDF(242KB) ( 2037 )  
    This paper presents a method for the animation of leaf movement. Leaves are classified into two classes: moveable and non-moveable. For moveable leaves, their movements consist of two parts: leafstalk rotation and leaf surface rotation. For each rotation, a movement model was constructed and the movement was computed based on each model, respectively. The final leaf movements were obtained by superposition of these two rotations. The method's principle is simple and easy to use.
    AHBP:An Efficient Broadcast Protocol for Mobile Ad Hoc Networks
    PENG Wei(彭伟)and LU Xicheng(卢锡城)
    Journal of Data Acquisition and Processing, 2001, 16 (2): 0-0. 
    Abstract   PDF(334KB) ( 4841 )  
    Broadcast is an important operation in many network protocols. It is utilized to discover routes to unknown nodes in mobile ad hoc networks (MANETs) and is the key factor in scaling on-demand routing protocols to large networks. This paper presents the Ad Hoc Broadcast Protocol (AHBP) and its performance is discussed. In the protocol, messages are only rebroadcast by broadcast relay gateways that constitute a connected dominating set of the network. AHBP can efficiently reduce the redundant messages which make flooding-like protocols perform badly in large dense networks. Simulations are conducted to determine the performance characteristics of the protocol. The simulation results have shown excellent reduction of broadcast redundancy with AHBP. It also contributes to a reduced level of broadcast collision and congestion.
    Optimal Selection of Reference Set for the Nearest Neighbor Classification by Tabu Search
    ZHANG Hongbin(张鸿宾)and SUN Guangyu(孙广煜)
    Journal of Data Acquisition and Processing, 2001, 16 (2): 0-0. 
    Abstract   PDF(331KB) ( 1315 )  
    In this paper, a new approach is presented to find the reference set for the nearest neighbor classifier. The optimal reference set, which has minimum sample size and satisfies a certain error rate threshold, is obtained through a Tabu search algorithm. When the error rate threshold is set to zero, the algorithm obtains a near minimal consistent subset of a given training set. While the threshold is set to a small appropriate value, the obtained reference set may compensate the bias of the nearest neighbor estimate. An aspiration criterion for Tabu search is introduced, which aims to prevent the search process from the inefficient wandering between the feasible and infeasible regions in the search space and speed up the convergence. Experimental results based on a number of typical data sets are presented and analyzed to illustrate the benefits of the proposed method. Compared to conventional methods, such as CNN and Dasarathy's algorithm, the size of the reduced reference sets is much smaller, and the nearest neighbor classification performance is better, especially when the error rate thresholds are set to appropriate nonzero values. The experimental results also illustrate that the MCS (minimal consistent set) of Dasarathy's algorithm is not minimal, and its candidate consistent set is not always ensured to reduce monotonically. A counter example is also given to confirm this claim.
    An Intuitive Formal Proof for Deadline Driven Scheduler
    ZHAN Naijun(詹乃军)
    Journal of Data Acquisition and Processing, 2001, 16 (2): 0-0. 
    Abstract   PDF(302KB) ( 1288 )  
    This paper presents another formal proof for the correctness of the Deadline Driven Scheduler (DDS). This proof is given in terms of Duration Calculus which provides abstraction for random preemption of processor. Compared with other approaches, this proof relies on many intuitive facts. Therefore this proof is more intuitive, while it is still formal.
    Pattern Matching Compilation of Function Defined in Context-Free Languages
    CHEN Haiming(陈海明)and DONG Yunmei(董韫美)
    Journal of Data Acquisition and Processing, 2001, 16 (2): 0-0. 
    Abstract   PDF(301KB) ( 1376 )  
    LFC is a functional language based on recursive functions defined in context-free languages. In this paper, a new pattern matching algorithm for LFC is presented, which can represent a sequence of patterns as an integer by an encoding method. It is a rather simple method and produces efficient case-expressions for pattern matching definitions of LFC. The algorithm can also be used for other functional languages, but for nested patterns it may become complicated and further studies are needed.
    Evolving Information Filtering for Personalized Information Service
    TIAN Fanjiang(田范江),LI Congrong(李丛蓉)and WANG Dingxing(王鼎兴)
    Journal of Data Acquisition and Processing, 2001, 16 (2): 0-0. 
    Abstract   PDF(281KB) ( 1294 )  
    Information filtering (IF) systems are important for personalized information service. However, most current IF systems suffer from low quality and long training time. In this paper, a refined evolving information filtering method is presented. This method describes user's information need from multi-aspects and improves filtering quality through a process like natural selection. Experimental result shows this method can shorten training time, improve filtering quality, and reduce the relevance between filtering results and training sequence.
    Two Online Algorithms for the Ambulance Systems
    SUI Yuefei(眭跃飞)
    Journal of Data Acquisition and Processing, 2001, 16 (2): 0-0. 
    Abstract   PDF(250KB) ( 1479 )  
    An ambulance system consists of a collection S={S1,……Sm} of emergency centers in a metric space M. Each emergency center Si has a positive integral capacity Ci to denote, for example, the number of ambulances at the center. There are n=sum{I=1}^m ci patients requiring ambulances at different times Tj and every patient is associated with a number Bj, the longest time during which the patient can wait for ambulance. An online algorithm A will decide which emergency center sends an ambulance to serve a request for ambulance from a patient at some time. If algorithm A sends an ambulance in Si to serve a patient Rj, then it must be observed that d{I,j}/v
    Efficient Mining of Association Rules by Reducing the Number of Passes over the Database
    LI Qingzhong(李庆忠),WANG Haiyang(王海洋),YAN Zhongmin(闫中敏)and MA Shaohan(马绍汉)
    Journal of Data Acquisition and Processing, 2001, 16 (2): 0-0. 
    Abstract   PDF(281KB) ( 1396 )  
    This paper introduces a new algorithm of mining association rules. The algorithm RP counts the itemsets with different sizes in the same pass of scanning over the database by dividing the database into m partitions. The total number of passes over the database is only (k+2m-2)/m, where k is the longest size in the itemsets. It is much less than k.
    Semantics of Constructions(Ⅱ) — The Initial Algebraic Approach
    FU Yuxi(傅育熙)
    Journal of Data Acquisition and Processing, 2001, 16 (2): 0-0. 
    Abstract   PDF(363KB) ( 1278 )  
    Inductive types can be formulated by incorporating the idea of initial T-algebra. The interpretation of an inductive type of this kind boils down to finding out the initial T-algebra defined by the inductive type. In this paper the issue in the semantic domain of omega sets is examined. Based on the semantic results, a new class of inductive types, that of local inductive types, is proposed.
SCImago Journal & Country Rank

ISSN 1004-9037


Editorial Board
Author Guidelines
Journal of Data Acquisition and Processing
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China

E-mail: info@sjcjycl.cn
  Copyright ©2015 JCST, All Rights Reserved