Loading...




Bimonthly    Since 1986
ISSN 1000-9000(Print)
/1860-4749(Online)
CN 11-2296/TP
Indexed in:
SCIE, Ei, INSPEC, JST, AJ, MR, CA, DBLP, etc.
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
Published by: SCIENCE PRESS, BEIJING, CHINA
Distributed by:
China: All Local Post Offices
Other Countries: Springer
 
ip访问总数:
ip当日访问总数:
当前在线人数:
  • Table of Content
      10 January 1990, Volume 5 Issue 1 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    Articles
    Motion Planning for Robots with Topological Dimension Reduction Method
    Zhang Bo; Zhang Tian; Zhang Jianwei; Zhang Ling;
    Journal of Computer Science and Technology, 1990, 5 (1): 1-16. 
    Abstract   PDF(755KB) ( 1205 )   Chinese Summary
    This paper explores the realization of robotic motion planning, especially Findpath problem, which is a basic motion planning problem that arises in the development of robotics. Findpath means: Give the initial and desired final configurations of a robotic arm in 3-dimensionnl space, and give descriptions of the obstacles in the space, determine whether there is a continuous collision-free motion of the robotic arm from one configure- tion to the other and find such a motion if it exists. There are several …
    References | Related Articles | Metrics
    Denote CSP with Temporal Formulas
    Zhou Chaochen; Liu Xinxin;
    Journal of Computer Science and Technology, 1990, 5 (1): 17-23. 
    Abstract   PDF(296KB) ( 1089 )   Chinese Summary
    This is a sequel of [1] to give a temporal semantics to a full version of CSP, including hiding operator and nested parallelism. The semantic definition is of denotational style, and employs set of temporal formulas as denotations. The continuity is proved, when the hiding operator is restricted to channels only with finite possible messages.
    References | Related Articles | Metrics
    Aliasing Errors in Parallel Signature Analyzers
    Min Yinghua; Yashwant K. Malaiya; Jin Boping;
    Journal of Computer Science and Technology, 1990, 5 (1): 24-40. 
    Abstract   PDF(697KB) ( 1100 )   Chinese Summary
    A Linear Feedback Shift Register (LFSR)can be used to compress test response data as a Signature Analyzer(SA). Parallel Signature Analyzers (PSAs) implemented as multiple input LFSRs are faster and re- quire less hardware overhead than Serial Signature Analyzers (SSAs)for compacting test response data for Built-In Serf-Test (BIST)in IC or hoard-testing environments. However, the SAs are prone to aliasing errors because of some specific types of error patterns. An alias is a faulty output signature that is i…
    References | Related Articles | Metrics
    Algorithms for the Determination of Cutsets in a Hypergraph
    Yao Rong; Kang Tai; Chen Tinghuai;
    Journal of Computer Science and Technology, 1990, 5 (1): 41-46. 
    Abstract   PDF(270KB) ( 1151 )   Chinese Summary
    Given a hypergraph, this paper provides three algorithms for finding all its minimal cutsets, minimal link cutsets and the least cutsets. The result not only set up a new studying field on cutsets of hypergraph, but also lay a foundation of analyzing the performance of multibus systems. The algorithm for determining all the least cutsets in a hypergraph is polynomial complex and more efficient than that in [2].
    References | Related Articles | Metrics
    A Message-Based Distributed Kernel for a Full Heterogeneous Environment
    Xue Xing; Sun Zhongxiu; Zhou Jianqiang; Xu Xihao;
    Journal of Computer Science and Technology, 1990, 5 (1): 47-56. 
    Abstract   PDF(471KB) ( 1163 )   Chinese Summary
    This paper presents the design and implementation of a message-based distributed operating system kernel NDOS. The main purpose of the kernel is to support a distributed data processing system and a distributed DBMS. It uses the abstraction of communication between processes as basic mechanism. In NDOS, services and facilities such as message passing and process synchronization, which are related to IPC and may cause the change of the state of a process, are integrated into a single concept, an event. The i…
    References | Related Articles | Metrics
    A Parallel Algorithm for Finding Roots of a Complex Polynomial
    Cheng Jinsong;
    Journal of Computer Science and Technology, 1990, 5 (1): 71-81. 
    Abstract   PDF(230KB) ( 1055 )   Chinese Summary
    A distribution theory of the roots of a polynomial and a parallel algorithm for finding roots of a complex polynomial based on that theory are developed in this paper. With high parallelism, the algorithm is an im- provement over the Wilf algorithm.
    References | Related Articles | Metrics
    Two Congruent Semantics for Prolog with CUT
    Zhu Mingyuan;
    Journal of Computer Science and Technology, 1990, 5 (1): 82-91. 
    Abstract   PDF(198KB) ( 1234 )   Chinese Summary
    The development of a formal semantics for a given programming language can proceed in several stages. At each stage we give an alternative semantic definition of the language, and each definition embodies successively more and more implementation details. Then we formulate and prove at each stage the congruence conditions between successive definitions in the sequence. This paper presents two formal semantics for Prolog with “cut” and shows the congruence condition between them.
    References | Related Articles | Metrics
    A Fuzzy Proof Theory
    Liu Dongbo; Li Deyi;
    Journal of Computer Science and Technology, 1990, 5 (1): 92-96. 
    Abstract   PDF(208KB) ( 1211 )   Chinese Summary
    Based on the first order predicate logic, in this paper, we present a new approach to generalizing the syn- tax of ordinary Horn clause rules to establish a fuzzy proof theory. First of all, each Horn clause rule is associ- ated with a numerical implication strength f. Therefore we obtain f-Horn clause rules. Secondly, Herbrand in- terpretations can be generalized to fuzzy subsets of the Herbrand base in the sense of Zadeh. As a result the proof theory for Horn clause rules can be developed in much the same…
    References | Related Articles | Metrics
  Journal Online
Just Accepted
Archive
Top Cited Papers
Top 30 Most Read
Paper Lists of Areas
Surveys
Special Issues
  Download
   ScholarOne Manuscripts
   Log In

User ID:

Password:

  Forgot your password?

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

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

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