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 July 1986, Volume 1 Issue 3   
    For Selected: View Abstracts Toggle Thumbnails
    Vector Computer 757
    Gao Qingshi; Zhang Xiang; Yang Shufan; Chen Shuqing;
    Journal of Data Acquisition and Processing, 1986, 1 (3): 1-14. 
    Abstract   PDF(878KB) ( 1068 )  
    This paper describes briefly the first large-scale vector computer system designed and produced in China——vector computer 757. The design philosophy, architecture, hardware implementation, software and performance of this computer are presented.
    A Modified Version of Chordal Ring
    Jin Lan; Yang Yuanyuan;
    Journal of Data Acquisition and Processing, 1986, 1 (3): 15-32. 
    Abstract   PDF(791KB) ( 1186 )  
    Topological design of intereonnection network is a key factor of developing parallel/distributed processing systems composed of a large number of microcomputer modules. For this purpose a double-chordal ring intereonnection network was proposed. The most attractive of its advantages is that for an optimally designed network with N modules its diameter can he reduced to O(N~(1/3)) compared with O(N~(1/2)) for a simple chordal ring. The essential properties of double-chordal ring network arc presented, and fo…
    A Routing Algorithm with Candidate Shortest Path
    Pan Qijing;
    Journal of Data Acquisition and Processing, 1986, 1 (3): 33-52. 
    Abstract   PDF(863KB) ( 1044 )  
    An improved algorithm based on the next node routing principle is proposed in this paper. In this algorithm there is a column added to the classical routing table, in which the candidate shortest distance to the destination node is the entry. When a link fails, the new shortest path in the nodes connected directly with the failure link can be found immediately (it is just the candidate shortest path before failure). For all other nodes in which routing tables should be changed, the required number of contro...
    A Graphics System Distributed across a Local Area Network
    Wu Enhua;
    Journal of Data Acquisition and Processing, 1986, 1 (3): 53-64. 
    Abstract   PDF(316KB) ( 1326 )  
    Design of a general purpose graphics system in a computer network environment requires that the architectural design of the graphics system be suited to such an environment and the advantages of the network environment be taken for distributed graphics processing and the sharing of resources. An architectural model is designed to meet these requirements. The model is characterised by the distribution on the machines in the network of graphics facilities provided by several graphics subsystems with various c…
    Kernel Language KLND
    Zhang Cui; Zhao Qinping; Xu Jiafu;
    Journal of Data Acquisition and Processing, 1986, 1 (3): 65-79. 
    Abstract   PDF(667KB) ( 1057 )  
    This paper presents a kernel language KLND on the basis of analysing the kernel language requirements of new generation computer systems. These requirements are: the ability of know-ledge processing, the parallelism, the elegant mathematical properties of the comput- ation model which is appropriate for working as the basis of the novel architecture design, and the suitability for writing large scale softwares. The main features of KLND are as follows: 1. several new language concepts. 2. the modularity,…
    AGDL: A Definition Language for Attribute Grammars
    Qu Yanwen;
    Journal of Data Acquisition and Processing, 1986, 1 (3): 80-91. 
    Abstract   PDF(500KB) ( 1199 )  
    AGDL is a definition language for attribute grammars. It is a specification language used to generate a compiler automatically. AGDL, whose rules are easy to read, is an applicative language with abstract data types, and it will be used as an important tool language to develop compiler generators by NCI.
    On the Structure of (Weak) Inverses of an (Weakly) Invertible Finite Automaton
    Chen Shihua;
    Journal of Data Acquisition and Processing, 1986, 1 (3): 92-100. 
    Abstract   PDF(324KB) ( 1082 )  
    In this paper, we first give a method by which, for any weakly invertible finite automaton M with delay τ, the set of all weak inverse finite automata of M with delay τ can be constructed. We then give a method by which, for any invertible one, all its inverses with delay τ can also be constructed.
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