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 March 2000, Volume 15 Issue 2 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    A Formal Framework of Multi-Agent Systems with Requirement/Service Cooperative Style
    WANG Huaimin; WU Quanyuan;
    Journal of Computer Science and Technology, 2000, 15 (2): 106-115. 
    Abstract   PDF(454KB) ( 1513 )   Chinese Summary
    Adopting three kinds of speech acts: request, promise, and inform, this paper analyses the interaction among agents in a kind of multi-agent systems with requirements /services cooperation style (MAS_(r-s)). The paper gives the objective model the theoretic satisfaction conditions of three kinds of speech acts in MAS_(r-s)The formal definition of MAS(r-s) has been presented. To evaluate concrete implementation architecture and mechanism of the variant MAS_(r-s), including client/server computing architect…
    References | Related Articles | Metrics
    Efficient Minimum Spanning Tree Algorithms on the Reconfigurable Mesh
    WAN Yingyu; XU Yinlong; GU Xiaodong; CHEN Guoliang;
    Journal of Computer Science and Technology, 2000, 15 (2): 116-125. 
    Abstract   PDF(290KB) ( 1428 )   Chinese Summary
    The reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors. Recently, this model has attracted a lot of attention. In this paper, two efficient algorithms are proposed for computing the minimum spanning tree of an n-vertex undirected graph. One runs on an n×n reconfigurable mesh with time complexity of O(log~2 n). The other runs with time complexity of O(log …
    References | Related Articles | Metrics
    The Faster Higher-Order Cellular Automaton for Hyper-Parallel Undistorted Data Compression
    GU Jing; SHUAI Dianxun;
    Journal of Computer Science and Technology, 2000, 15 (2): 126-135. 
    Abstract   PDF(269KB) ( 1382 )   Chinese Summary
    This paper defines second-order and third-order permutation global functions and presents the corresponding higher-order cellular automaton approach to the hyper-parallel undistorted data compression. The genetic algorithm is successfully devoted to finding out all the correct local compression rules for the higher-order cellular automaton. The correctness of the higher-order compression rules, the time complexity, and the systolic hardware implementation issue are discussed. In comparison with the first-…
    References | Related Articles | Metrics
    An Architectural Model for Intelligent Network Management
    LUO Junzhou; GU Guanqun; FEI Xiang;
    Journal of Computer Science and Technology, 2000, 15 (2): 136-143. 
    Abstract   PDF(373KB) ( 1402 )   Chinese Summary
    Traditional network management approach involves the management of each vendor's equipment and network segment in isolation through its own proprietary element management system. It is necessary to set up a new network management architecture that calls for operation consolidation across vendor and technology boundaries. In this paper,an architectural model for Intelligent Network Management (INM) is presented. The INM system includes a manager system, which controls all subsystems and coordinates differen…
    References | Related Articles | Metrics
    Fuzzy Neural Network Based Traffic Prediction and Congestion Control in High-Speed Networks
    FEI Xiang; HE Xiaoyan; LUO Junzhou; WU Jieyi; GU Guanqun;
    Journal of Computer Science and Technology, 2000, 15 (2): 144-149. 
    Abstract   PDF(284KB) ( 1353 )   Chinese Summary
    Congestion control is one of the key problems in high-speed networks, such as ATM. In this paper, a kind of traffic prediction and preventive congestion control scheme is proposed using neural network approach. Traditional predictor using BP neural network has suffered from long convergence time and dissatisfying error. Fuzzy neural network developed in this paper can solve these problems satisfactorily. Simulations show the comparison among no-feedback control scheme, reactive control scheme and neural …
    References | Related Articles | Metrics
    Information Service Model with Mobile Agent Supported
    ZOU Tao; WANG Jicheng; ZHANG Fuyan;
    Journal of Computer Science and Technology, 2000, 15 (2): 150-157. 
    Abstract   PDF(376KB) ( 1280 )   Chinese Summary
    Mobile Agent is a kind of novel agent technology characterized by mobile, intelligent, parallel and asynchronous computing. In this paper, a new information service model that adopts mobile agent technology is introduced first, and then an experimental system DOLTRIA system that is implemented based on the model is described. The DOLTRIA system implemented by WWW framework and Java can search for relevant HTML documents on a set of Web servers. The result of experiments shows that performance implemented ca…
    References | Related Articles | Metrics
    Multicast Protocol for Uni-Directional Networks
    HUANG Hao; CHEN Guihai; XIE Li; SUN Zhongxiu;
    Journal of Computer Science and Technology, 2000, 15 (2): 158-168. 
    Abstract   PDF(285KB) ( 1246 )   Chinese Summary
    A very inexpensive receive-only satellite receiver can receive high bandwidth traffic from a feeder. Therefore the connection between the feeder and the receiver is uni-directional. The existing routing protocols, such as Link-State and Distance-Vector, are designed on the premise that any links are bidirectional and they cannot handle the uni-directional links. In this paper,a dynamic multicast routing protocol is proposed, which can handle uni-directional networks. This protocol can also adapt to the dyna…
    References | Related Articles | Metrics
    SFT: A Consistent Checkpointing Algorithm with Short Freezing Time
    WEI Xiaohui; JU Jiubin;
    Journal of Computer Science and Technology, 2000, 15 (2): 169-175. 
    Abstract   PDF(185KB) ( 1576 )   Chinese Summary
    A consistent checkpointing algorithm with short freezing time (SFT) is presented in this paper. It supports fault-tolerance in distributed systems. The algorithm has shorter freezing time, lower overhead, and simplicity of recovery. To make checkpoint time shorter, a special control message (Munblock) is used to ensure that a process can respond the checkpoint event quickly at any given time. Moreover, main memory algorithm is used to improve the concurrency of checkpointing. By using SFT, the freezing tim…
    References | Related Articles | Metrics
    A Semantics-Based Approach for Achieving Self Fault-Tolerance of Protocols
    LI Layuan; LI Chunlin;
    Journal of Computer Science and Technology, 2000, 15 (2): 176-183. 
    Abstract   PDF(191KB) ( 1405 )   Chinese Summary
    The cooperation of different processes may be lost by mistake when a protocol is executed. The protocol cannot be normally operated under this condition. In this paper,the self fault-tolerance of protocols is discussed, and a semanticsbased approach for achieving self fault-tolerance of protocols is presented. Some main characteristics of self fault-tolerance of protocols concerning liveness, nontermination and infinity are also presented. Meanwhile, the sufficient and necessary conditions for achieving s…
    References | Related Articles | Metrics
    A New Speaker Verification Method with Global Speaker Model and Likelihood Score Normalization
    ZHANG Yiying; ZHU Xiaoyan; ZHANG Bo;
    Journal of Computer Science and Technology, 2000, 15 (2): 184-193. 
    Abstract   PDF(458KB) ( 1455 )   Chinese Summary
    In this paper a new text-independent speaker verification method GSMSV is proposed based on likelihood score normalization. In this novel method a global speaker model is established to represent the universal features of speech and normalize the likelihood score. Statistical analysis demonstrates that this normaliza- tion method can remove common factors of speech and bring the differences between speakers into prominence. As a result the equal error rate is decreased significantly, verification procedure …
    References | Related Articles | Metrics
    A Note on Closeness between NP-Hard Sets and C=P
    LIU Tian;
    Journal of Computer Science and Technology, 2000, 15 (2): 194-195. 
    Abstract   PDF(88KB) ( 1471 )   Chinese Summary
    Two sets are close if their symmetric difference is a sparse set. It is shown that NP-hard sets are not C=P-close unless NP C=C=P. This improves the previous result and has implication in quantum compulation.
    References | Related Articles | Metrics
    An Action Analysis for Combining Partial Evaluation
    LIAO Husheng;
    Journal of Computer Science and Technology, 2000, 15 (2): 196-201. 
    Abstract   PDF(271KB) ( 1335 )   Chinese Summary
    This paper proposes an action analysis for implementing combining partial evaluation efficiently. By analyzing the results of binding time analysis, on erations, which should be used in the combining partial evaluation, are determined in advance, so that the computation in the combination of specialized programs is reduced effectively.
    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