Bimonthly    Since 1986
ISSN 1000-9000(Print)
CN 11-2296/TP
Indexed in:
Publication Details
Edited by: Editorial Board of Journal Of Computer Science and Technology
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
Other Countries: Springer
  • Table of Content
      10 October 1994, Volume 9 Issue 4 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    Generating Conformance Tests for Nondeterministic Protocol Machines
    Luo Gang;
    Journal of Computer Science and Technology, 1994, 9 (4): 289-301. 
    Abstract   PDF(323KB) ( 1380 )   Chinese Summary
    We present a method of generating test cases from the software specifications which are modeled by nondeterministic finite state machines. It is applicable to both nondeterministic and deterministic finite state machines. When applied to deterministic machines, this method yields usually smaller test suites with full fault coverage than the existing methods that also assure full fault coverage. In particular, the proposed mehod can be used to test the control portion of software specified in the formal…
    References | Related Articles | Metrics
    Compiling CIL Rewriting Language for Multiprocessors
    Tian Xinmin; Wang Dingxing; Zheng Weimin; Shen Meiming; Li Cheng;
    Journal of Computer Science and Technology, 1994, 9 (4): 302-310. 
    Abstract   PDF(416KB) ( 1302 )   Chinese Summary
    The highlevel Compiler Intermediate Language CIL is a generalpurpose descripotion language of parallel graph rewriting computational model intended for parallelimplementatioll of declarative languages on multiprocessor systems. In this paper, wefirst outline a new Hybrid Execution Model(HEM) and corresponding parallel abstract machine PAM/TGR based on Extended parallel Graph Rewriting ComputationalModel EGRCM for implementing CIL language on distributed memory multiprocessorsystems. Then we focus on the com…
    References | Related Articles | Metrics
    Research on Decompiling Technology
    Liu Zongtian; Chen Fuan;
    Journal of Computer Science and Technology, 1994, 9 (4): 311-319. 
    Abstract   PDF(373KB) ( 1270 )   Chinese Summary
    Decompiling, as a means of analysing and understanding software, has great practical value. This paper presents a kind of decompiling method offered by the authors,in which the techniques of library-function pattern recognition, intermediate language,symbolic execution, rule-based 4ata type recovery program transformation, and knowledge engineering are separately aPPlied to diIfernt phases of decompiling. Then it is discussed that the techulques of developing expert systems are adopted to build a decompilin…
    References | Related Articles | Metrics
    The Learning Convergence of CMAC in Cyclic Learning
    Yao Shu; Zhang Bo;
    Journal of Computer Science and Technology, 1994, 9 (4): 320-328. 
    Abstract   PDF(383KB) ( 1281 )   Chinese Summary
    In this paper we discuss the learning convergence of the cerebellar model articulation controller (CMAC) in cyclic learning. We prove the following results. First, if the training samples are noiseless, the training algorithm converges if and only if the learning rate is chosen from (0, 2). Second, when the training samples have noises, the learning algorithm will converge with a probability of one if the learning rate is dynandcally decreased. Third, in the case with noises, with a small but fixed learnin…
    References | Related Articles | Metrics
    Building Case-Based Preliminary Design Systems: A Hopfield Network Approach
    Wu Wei; Zhong Wanxie; Sheng Zhijin;
    Journal of Computer Science and Technology, 1994, 9 (4): 329-341. 
    Abstract   PDF(288KB) ( 1311 )   Chinese Summary
    This paPer addresses the issue of building a case-based preliminary design system by using Hopfield networks. one limitation of Hopfield networks is that it cannot be tralned, i.e. the weights between two neurons must be set in advance. A pattern stored in Hopfield networks cannot be recalled if the pattern is not a local minimum.Two concepts are proposed to deal with this problem. They are the multiple training encoding method and the puppet encoding method. The multiple training encoding method, which gua…
    References | Related Articles | Metrics
    GUIDS: A Graphical User Interface Development System in UniECAD
    Xu Jianguo; Wei Wenxin;
    Journal of Computer Science and Technology, 1994, 9 (4): 342-348. 
    Abstract   PDF(295KB) ( 1355 )   Chinese Summary
    UniECAD is an integrated electronic CAD system, the user interfaCe develotwent system is the key of the integration of UniECAD. This paper presents the architecture of GUIDS, a graphical user interface development system in UniECAD, and then discusses a series of new techniques and methods in the design and the implementation of this system around the following aspects: the editing environment of interface elements, the implementation of dialogue control and the automatic generation of interface code. As an…
    References | Related Articles | Metrics
    An Automatic Hierarchical Delay Analysis Tool
    Farid Mheir-ELSaadi; Bozena Kaminska;
    Journal of Computer Science and Technology, 1994, 9 (4): 349-364. 
    Abstract   PDF(369KB) ( 1376 )   Chinese Summary
    The performance analysis of VLSI integrated circuits (ICs) with llat tools is slow and even sometimes impossible to complete. Some hierarchical tools have been developed to speed up the analysis of these large ICs. However, these hierarchical tools suffe from a poor interaction with the CAD database and poorly automatized operations. We introduce a general hierarchical framework for performance analysis to solve these problems. The circuit analysis is automatic under the proposed framework. Information that…
    References | Related Articles | Metrics
    Adaptive Memory Coherence Algorithms in DSVM
    Zhou Jianqiang; Xie Li; Dai Fei; Sun Zhongxiu;
    Journal of Computer Science and Technology, 1994, 9 (4): 365-372. 
    Abstract   PDF(345KB) ( 1300 )   Chinese Summary
    Based on the characteristics of distrubuted system and the behavior of parallelprograms, this paper presents the fixed and randofored competitive memory coherence algorithms for distributed shared virtual memory These algorithms exploit parallel programs' locality of reference and dribit good competitive property Our simulation shows that the fixed and randomized algorithms achieve better performance and higher stability than other strategies such as write-invalldate and write-update.
    References | Related Articles | Metrics
    Full Or-Parallemism and Restricted And-Parallelism in BTM
    Zheng Yuhua; Xie Li; Sun Zliongxiu;
    Journal of Computer Science and Technology, 1994, 9 (4): 373-381. 
    Abstract   PDF(203KB) ( 1190 )   Chinese Summary
    BTM is a new And/Or parallel execution model for logic programs which exploits both full orparallelism and restricted Andparallelism. The advantages of high parallelism and low rtm time cost make BTJ, an exPerhoental execution system of BTM implemented on a nonsharedmemory multiprocessor system, achieve significant speedup for both And-parallel and Or-parallel logic Programs.
    References | Related Articles | Metrics
  Journal Online
Just Accepted
Top Cited Papers
Top 30 Most Read
Paper Lists of Areas
Special Issues
   ScholarOne Manuscripts
   Log In

User ID:


  Forgot your password?

Enter your e-mail address to receive your account information.

ISSN 1000-9000(Print)

CN 11-2296/TP

Editorial Board
Author Guidelines
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: jcst@ict.ac.cn
  Copyright ©2015 JCST, All Rights Reserved