Loading...
Bimonthly    Since 1986
ISSN 1004-9037
/
Indexed in:
SCIE, Ei, INSPEC, JST, AJ, MR, CA, DBLP, etc.
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
Published by: SCIENCE PRESS, BEIJING, CHINA
Distributed by:
China: All Local Post Offices
 
  • Table of Content
      10 January 1988, Volume 3 Issue 1   
    For Selected: View Abstracts Toggle Thumbnails
    Articles
    The Design and Implementation of a Very Fast Experimental Pipelining Computer
    Lin Qi; Xia Peisu;
    Journal of Data Acquisition and Processing, 1988, 3 (1): 1-6. 
    Abstract   PDF(195KB) ( 1215 )  
    The high speed potential of I.C.components can be exploited by shortening the pipeline clock period. Although there are some factors which dominate the shortening,the design of an experimental computer employs the principle of maximum time difference at the system level to determine the clock period and the integrated consideration of architecture,logic design and engineering layout to achieve a system clock period of 9.8 ns using conventional ECL chips of 2ns gate delay.The multiplier in this model,which i…
    Soundness and Completeness of Kung s Reasoning Procedure
    Li Renwei;
    Journal of Data Acquisition and Processing, 1988, 3 (1): 7-15. 
    Abstract   PDF(407KB) ( 1242 )  
    Kung s reasoning procedure is characterized by high parallelism in the sense that an unlimited number of CPUs can be used to carry out the computation in parallel.This paper presents a proof of the soundness and completeness of the reasoning procedure based on Herbrand s theorem.
    Reconvergent-Fanout-Oriented Testability Measure
    Wang Jianchao; Wei Daozheng;
    Journal of Data Acquisition and Processing, 1988, 3 (1): 16-28. 
    Abstract   PDF(393KB) ( 1228 )  
    This paper describes the theory and implementation of a testability measure program called RFOTM.It is suggested that the real difficulty in test generation should be reflected in testability measure.We analyse the behavior of fanout and reconvergent fanout which cause inconsistency in generating tests.A classification of fanouts is given and a class of fanouts which behaves like fanout-free lines is described. Based on this observation,the new measure is developed with emphasis on the influence of fanout a…
    Program Slicing:Its Improved Algorithm and Application in Verification
    Lu Qi; Zhang Fubo; Qian Jiahua;
    Journal of Data Acquisition and Processing, 1988, 3 (1): 29-39. 
    Abstract   PDF(566KB) ( 1233 )  
    Program slicing is a method for automatical program decomposition.This paper presents an improved slicing algorithm on the basis of static analysis of the control structure of loop statements.The slice obtained by the new algorithm is guaranteed to be no larger than that obtained by the previous slicing algorithm developed by Mark Weiser.Moreover,the former will be much smaller than the latter for certain kinds of programs.In addition,a brief discussion of using slicing in program verification has been give…
    Systems Programming in the Functional Language FP
    Jin Lingzi; Zhu Hong;
    Journal of Data Acquisition and Processing, 1988, 3 (1): 40-55. 
    Abstract   PDF(745KB) ( 1167 )  
    The development of systems software in functional programming language is still an open problem. This paper describes a preliminary experiment with systems programming in Backus FP systems.It consists of two systems programs.One is a self-compiler of FP,the other an interpreter of the semantics of FFP(Formal Functional Programming).Both were implemented on an FP machine——FPM2.Some discussions are made finally.
    Hierarchical Protocol Analysis by Temporal Logic
    Feng Yulin;
    Journal of Data Acquisition and Processing, 1988, 3 (1): 56-69. 
    Abstract   PDF(630KB) ( 1173 )  
    With an example,this paper describes a method of using temporal logic for stepwise analysis of protocol specifications.Each level in the specified hierarchy is a kind of incarnation from higher-levels by adding some implementation strategies,and the correctness of top-down refinements could be verified in the unified temporal framework.
    On the Condition for FSM Being a Scrambler
    Bao Feng;
    Journal of Data Acquisition and Processing, 1988, 3 (1): 70-74. 
    Abstract   PDF(117KB) ( 1108 )  
    A necessary condition for a self-synchronizing delayless invertible finite state machine(FSM)being a scrambler was conjectured in[1].A counterexample to the conjecture is given in this paper.
    The Design and Implementation of an OA System ZGL1
    Xie Li; Chen Peipei; Yang Peigen; Sun Zhongxiu;
    Journal of Data Acquisition and Processing, 1988, 3 (1): 75-80. 
    Abstract   PDF(192KB) ( 1228 )  
    ZGLI,an office automation system for municipal administration,is presented.It is a distributed microcomputer system based on OMNINET.Each node of it is an IBM PC/XT microcomputer with Chinese character facilities.The system consists of a distributed database management system,a Chinese character electronic mail system,a Chinese word processor and others.Its functions include document management, report form management,research project management,finance management and information access.
SCImago Journal & Country Rank
 

ISSN 1004-9037

         

Home
Editorial Board
Author Guidelines
Subscription
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