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 November 1995, Volume 10 Issue 6 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    Articles
    Trace Software Pipelining
    Wang Jian; Andreas Krall; M.Anton Ertl;
    Journal of Computer Science and Technology, 1995, 10 (6): 481-490. 
    Abstract   PDF(425KB) ( 1297 )   Chinese Summary
    Global software pipelining is a complex but efficient compilation technique to exploit instruction-level parallelism for loops with branches. This paper presents a novel global software pipelining technique, called Thace Software Pipelining,targeted to the instruction-level parallel processors such as Very Long Instruc-tion Word (VLIW) and superscalar machines. Thace software pipelining applies a global code scheduling technique to compact the original loop body. The re-sulting loop is called a trace softwa…
    References | Related Articles | Metrics
    A New Approach to Fully Automatic Mesh Generation
    Min Weidong; Tang Zesheng; Zhang Zhengming; Zhou Yu; Wang Minzhi;
    Journal of Computer Science and Technology, 1995, 10 (6): 491-508. 
    Abstract   PDF(425KB) ( 1244 )   Chinese Summary
    Automatic mesh generation is one of the most important parts in CIMS (Computer Integrated Manufacturing System). A method based on mesh grad-ing propagation which automatically produces a triangular mesh in a multiply connected planar region is presented in this paper. The method decomposes the planar region into convex subregions, using algorithms which run in linear time. For every subregion, an algorithm is used to generate shrinking polygons according to boundary gradings and form Delaunay triangulation…
    References | Related Articles | Metrics
    Net Operations (Ⅱ)-The Iterated Addition Operation of Petri Nets
    Jiang Chanaiun;
    Journal of Computer Science and Technology, 1995, 10 (6): 509-517. 
    Abstract   PDF(376KB) ( 1360 )   Chinese Summary
    This paper presents the iterated addition operation of Petri nets and dis-cusses its application in analysis and synthesis of cycle type systems and star type systems. A group of necessary and sufficient conditions for analysis of structural properties is obtained. In addition sufficient conditions for general systems are obtained.
    References | Related Articles | Metrics
    General Algorithms for Barnett s Structure in Evidential Reasoning
    Guan Jiwen; D.A.Bell;
    Journal of Computer Science and Technology, 1995, 10 (6): 518-535. 
    Abstract   PDF(693KB) ( 1297 )   Chinese Summary
    A major problem encountered when applications of the Dempster-Shafer ev-idence handling methods are contemplated is the computational complekity of the basic operations. Barnett has proposed a linear-time computational tech-nique for use in evidential reasoning. However, it is restricted to the entire orthogonal sum of dichotomous evidential functions. This means that there has to be a piece of evidence for each contender for the choice being made. This paper presents more general algorithms for combining d…
    References | Related Articles | Metrics
    A Fault-Tolerant and Heuristic Routing Algorithm for Faulty Hypercubes
    Min Youli; Min Yinghua;
    Journal of Computer Science and Technology, 1995, 10 (6): 536-544. 
    Abstract   PDF(192KB) ( 1300 )   Chinese Summary
    A fault-tolerant and heuristic routing algorithm for faulty hypercube sys-tems is described. To improve the efficiency, the algorithm adopts a heuristic backtracking strategy and each node has an array to record its all neighbors'faulty link information to avoid unnecessary searching for the known faulty links. Furthermore, the faulty link information is dynamically accumulated and the technique of heuristically searching for optimal link is used. The algo rithm routes messages through the minimum feasible …
    References | Related Articles | Metrics
    A Necessary Condition about the Optimum Partition on a Finite Set of Samples and Its Application to Clustering Analysis
    Ye Shiwei; Shi Zhongzhi;
    Journal of Computer Science and Technology, 1995, 10 (6): 545-556. 
    Abstract   PDF(512KB) ( 1359 )   Chinese Summary
    This paper presents another necessary condition about the optimum parti-tion on a finite set of samples. From this condition, a corresponding generalized sequential hao f k-means (GSHKM) clustering algorithm is built and many well-known clustering algorithms are found to be included in it. Under some assumptions the well-known MacQueen's SHKM (Sequential Hard K-Means)algorithm, FSCL (Frequency Sensitive Competitive Learning) algorithm and RPCL (Rival Penalized Competitive Learning) algorithm are derived. It…
    References | Related Articles | Metrics
    Simulation and Improvement of the Processing Subsystem of the Manchester Dataflow Computer
    Lai Zhiyong; Zheng Shouqi;
    Journal of Computer Science and Technology, 1995, 10 (6): 557-563. 
    Abstract   PDF(294KB) ( 1416 )   Chinese Summary
    The Manchester dataflow computer is a famous dynamic dataflow computer.It is centralized in architecture and simple in organization. Its overhead for communication and scheduling is very small. Its efficiency comes down, when processing elements in the processing subsystem increaJse. Several articles eval uated its performance and presented improved methods. The authors studied its processing subsystem and carried out the simulation. The simulation rer sults show that the efficiency of the processing subsys…
    References | Related Articles | Metrics
    Design of Multivalued Circuits Based on an Algebra for Current-Mode CMOS Multivalued Circuits
    Chen Xiexiong;
    Journal of Computer Science and Technology, 1995, 10 (6): 564-568. 
    Abstract   PDF(205KB) ( 1381 )   Chinese Summary
    An algebra proposed for current-mode CMOS multivalued circuits is briefly reviewed. This paper discusses its application in the design of multivalued circults. Several current-mode CMOS quaternary and quinary circuits are de-signed by algebraic means. The design method based on this algebra may offer a design simpler than the previously knowll ones.
    References | Related Articles | Metrics
    A New Method of Solving Kernels in Algebraic Decomposition for the Synthesis of Logic Cell Array
    Ma Guangsheng; Zhang Zhongwei; and Huang Shaobin;
    Journal of Computer Science and Technology, 1995, 10 (6): 569-573. 
    Abstract   PDF(220KB) ( 1350 )   Chinese Summary
    In this paper, an improvement has been made on the algorithm of solving the kernels of new functions which are generated after a common divisor appearing in the original functions is replaced by a new intermediate variable. And an efficient method based on kernel heritage is presented. This method has been successfully used in synthesis of LCA (Logic Cell Array).
    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