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
      10 April 1986, Volume 1 Issue 2   
    For Selected: View Abstracts Toggle Thumbnails
    A High Resolution Chinese Character Generator
    Wang Xuan; Lü Zhimin; Tang Yuhai; Xiang Yang;
    Journal of Data Acquisition and Processing, 1986, 1 (2): 1-14. 
    Abstract   PDF(594KB) ( 1213 )  
    Font storage requirement is a crucial problem in developing Chinese typesetting system.A unique data compression technique is adopted in the system.The representation of regular strokes and irregular strokes of Chinese characters and the method for transforming the compressed representation into dot matrix are described in the paper.The result is satisfactory,and the cost performance ratio of the typesetting system is significantly improved by the …
    A Chinese Information Processing System
    C.Y.Chung; H.R.Hwa;
    Journal of Data Acquisition and Processing, 1986, 1 (2): 15-24. 
    Abstract   PDF(441KB) ( 1185 )  
    The Chinese information processing system(CIPS)introduced in this paper can produce graphs,tables,flowcharts,mathematical equations,forms and also provides typesetting facilities.The system can process not only Chinese text but also English text or a mixture of them.It is written in C language and runs on VAX Ⅱ/780 under Unix operating system.The CIPS system is very easy to use and provides user-defined macro which allows abbreviations of commonly used Chinese phrases and reduce the complexity of Chinese ch…
    DMODULA:A Distributed Programming Language
    Sun Zhongxiu; Shang Lujun;
    Journal of Data Acquisition and Processing, 1986, 1 (2): 25-31. 
    Abstract   PDF(285KB) ( 1187 )  
    This paper presents an overview of a distributed programming language called DMODULA,which is intended for the programming in a distributed environment. DMODULA develops module concepts of its ancestor,MODULA-2,and provides features of generic and remote procedure calls.DMODULA has been implemented on the ZOZ system,a distributed microcomputer system consisting of several LSI-11 microcomputers,which was designed and implemented at Nanjing University in 1982.
    A Recovery Technique for Distributed Communicating Process Systems
    Zhou Di;
    Journal of Data Acquisition and Processing, 1986, 1 (2): 34-43. 
    Abstract   PDF(252KB) ( 1268 )  
    This paper presents a recovery technique for distributed communicating process systems.It handles both hardware faults and software faults uniformly.Differing from other recovery techniques,it brings an extremely small amount of execution overhead to nonfailing processes and can be implemented easily.It can be applied to a programming procedure to mask the software design errors or imbeded into an operating system to enhance the reliability of the whole system.The theoretical work is carried out first,then ...
    A Structural Operational Semantics for an Edison Like Language(2)
    Li Wei;
    Journal of Data Acquisition and Processing, 1986, 1 (2): 42-53. 
    Abstract   PDF(265KB) ( 1330 )  
    3.Operational SemanticsIn this section we give an operational semantics for Edison.1.In contrast to the staticsemantics,the operational semantics is sometimes called dynamic semantics.Successful research in the denotational approach tells us that to construct asemantics for a language including declarations of entities such as variables,proceduresand modules,it is necessary to:Ⅰ.Distinguish the denotable values(locations,procedure and module abstractions)from the storable values(truth values,natural num…
    On the Structure of Finite Automata of Which M Is an(Weak)Inverse with Delay τ
    Chen Shihua;
    Journal of Data Acquisition and Processing, 1986, 1 (2): 54-59. 
    Abstract   PDF(339KB) ( 1011 )  
    In this paper,we first give a method that for any inverse finite automaton M with delay τ,all inver tible finite automata with delay τ,of which M is an inverse with delay τ,can be constructed;and a universal nondeterministic finite automaton,for all finite automata of which M is an inverse with delay τ,can also be constructed.We then give a method that for any weak inverse finite automaton M with delay τ,all weakly invertible finite automata with delay τ of which M is a weak inverse with delay,can be c…
    Almost Optimal Dynamic 2-3 Trees
    Li Wanxue;
    Journal of Data Acquisition and Processing, 1986, 1 (2): 60-71. 
    Abstract   PDF(502KB) ( 1200 )  
    This paper presents a principle to create Almost Optimal Dynamical 2-3 trees based on the theory of Miller et al.,and gives a searching algorithm,an insertion algorithm and a deletion algorithm for these 2-3 trees.Experimental result given in this paper indicates that these 2-3 trees have very good performance at node-visit cost.We discuss asymptotic property of the 2-3 trees as N→∞,and evaluate its approximate height,h =log_(2.45)(N+1),where N is the number of nodes of a 2-3 tree.Finally,this paper analyse...
    Recursive Implementation of VLSI Circuits
    Feng Yulin;
    Journal of Data Acquisition and Processing, 1986, 1 (2): 72-82. 
    Abstract   PDF(457KB) ( 1338 )  
    This is an introduction for Escher——the geometrical layout system.An Escher circuit description is a hierarchical structure composed of cells,wires,connectors between wires,and pins that connect wires to cells.Cells may correspond to primitive circuit elements,or they may be defined in terms of lower level subcells.Unlike other geometrical layout systems,a subcell may be instance of the cell being defined.When such a recursive cell definition is instantiated,the recursion is unwound in a manner reminiscent …
    Some Covering Problems and Their Solutions in Automatic Logic Synthesis Systems
    Liu Mingye; Hong Enyu;
    Journal of Data Acquisition and Processing, 1986, 1 (2): 83-92. 
    Abstract   PDF(458KB) ( 1375 )  
    This paper describes the partitioning of the set of the Boolean equations generated by the hardware logic translator and the conversion of the subsets into cube arrays. Subsequent to this,it is aimed:(1)to find out the minimal sets of input variables;(2)to finish the logic minimization;and(3)to decompose a large logic array into smaller ones to meet the design constraints if necessary. These three problems cart all be reduced to solving the corresponding covering problems,which may have considerable scales....
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