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 2000, Volume 15 Issue 1 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    Articles
    Computing Bisimulations for Finite-Controlπ-Calculus
    LIN Huimin;
    Journal of Computer Science and Technology, 2000, 15 (1): 1-9. 
    Abstract   PDF(413KB) ( 1342 )   Chinese Summary
    Symbolic bisimulation avoids the infinite branching problem causedby instantiating input names with all names in the standard definition of bisimulation in л-calculus. However, it does not automatically lead to an efficient algorithm,because symbolic bisimulation is indexed by conditions on names,and directly manipulating such conditions can be computationally costly. In this paper a new notionof bisimulation is introduced, in which the manipulation of maximally consistent conditions is replaced with a syst…
    References | Related Articles | Metrics
    Constructing Finite Automata with Invertibility by transformation Method
    TAO Renji; CHEN Shihua;
    Journal of Computer Science and Technology, 2000, 15 (1): 10-26. 
    Abstract   PDF(398KB) ( 1262 )   Chinese Summary
    Ra, Rb transformations were successfully applied to establish invertibility theory for linear and quasi-linear finite automata over finite fields. In aprevious paper, the authors generalized R., Rb transformations to deal with nonlinear memory finite automata, and gave sufficient conditions for weak inverse andfor weakly invertible memory finite automata and inversion processes concerned;methods by transformation to generate a kind of nonlinear memory finite automatasatisfying one of these sufficient condit…
    References | Related Articles | Metrics
    Multi-Volume CAD Modeling for Heterogeneous Object Design and Fabrication
    SUN Wei;
    Journal of Computer Science and Technology, 2000, 15 (1): 27-36. 
    Abstract   PDF(448KB) ( 1352 )   Chinese Summary
    The current computer-aided technologies in design and product development, the evolution of CAD modeling, and a framework of multi-volume CADmodeling system for heterogeneous object design and fabrication are presented inthis paper. The multi-volume CAD modeling system is presented based on nonmanifold topological elements. Material identifications are defined as design attributes introduced along with geometric and topological information at the designstage. Extended Euler operation and reasoning Boolean o…
    References | Related Articles | Metrics
    Volumetric Virtual Environments
    HE Taosong;
    Journal of Computer Science and Technology, 2000, 15 (1): 37-46. 
    Abstract   PDF(791KB) ( 1274 )   Chinese Summary
    Driven by fast development of both virtual reality and volume visualization, we discuss some critical techniques towards building a volumetric VRsystem, specifically the modeling, rendering, and manipulations of a volumetric scene.Techniques such as voxel-based object simplification, accelerated volume rendering,fast stereo volume rendering, and volumetric "collision detection" are introduced andimproved, with the idea of demonstrating the possibilities and potential benefits ofincorporating volumetric mode…
    References | Related Articles | Metrics
    An Accelerated Incremental Radiosity Algorithm
    XING Changyu; SUN Jizhou;
    Journal of Computer Science and Technology, 2000, 15 (1): 47-55. 
    Abstract   PDF(267KB) ( 1138 )   Chinese Summary
    The incremental radiosity method has been shown to be an efficienttechnique for providing global illumination in dynamic environments as it exploitstemporal coherence in object space. This paper presents an accelerated incremental radiosity algorithm, which is based on a dynamically followed partial matrix.This not only reduces the computation cost in determining incremental form-factorswhen the geometrical relationships between objects are constantly changing, but alsosimplifies the management of user inte…
    References | Related Articles | Metrics
    Constraint-Based Virtual Solid Modeling
    GAO Shuming; WAN Huagen; PENG Qunsheng;
    Journal of Computer Science and Technology, 2000, 15 (1): 56-63. 
    Abstract   PDF(288KB) ( 1298 )   Chinese Summary
    Constraint-based solid modeling is the kernel part of current CADsystems. It has been widely used in supporting detailed design and variational design. However, it cannot support early stage design and is not easy-to--use becauseit demands fully detailed input description of a design. To solve these problems,researchers attempt to incorporate virtual reality techniques into geometric modeling systems. This paper presents a novel approach for interactive constraint-basedsolid modeling in a virtual reality en…
    References | Related Articles | Metrics
    Extraction of Spatial-Temporal Features for Vision-Based Gesture Recognition
    HUANG YU; XU Guangyou; ZHU Yuanxin;
    Journal of Computer Science and Technology, 2000, 15 (1): 64-72. 
    Abstract   PDF(281KB) ( 1162 )   Chinese Summary
    One of the key problems in a vision-based gesture recognition system is the extraction of spatial-temporal features of gesturing. In this paper anapproach of motion-based segmentation is proposed to realize this task. The directmethod cooperated with the robust M-estimator to estimate the affine parametersof gesturing motion is used, and based on the dominant motion model the gesturingregion is extracted, i.e., the dominant object. So the spatial-temporal features ofgestures can be extracted. Finally, the d…
    References | Related Articles | Metrics
    Using Confidence interval to Summarize the Evaluating Results of DSM Systems
    SHI Weisong; TANG Zhimin; SHI Jinsong;
    Journal of Computer Science and Technology, 2000, 15 (1): 73-83. 
    Abstract   PDF(489KB) ( 1300 )   Chinese Summary
    Distributed Shared Memory (DSM) systems have gained popularacceptance by combining the scalability and low cost of distributed system with theease of use of single address space. Many new hardware DSM and software DSMsystems have been proposed in recent years. In general, benchmarking is widely usedto demonstrate the performance advantages of new systems. However, the commonmethod used to summarize the measured results is the arithmetic mean of ratios,which is incorrect in some cases. Furthermore, many publ…
    References | Related Articles | Metrics
    Timing-Sequence Testing of Parallel Programs
    LING Yu; LI Shu; ZHANG Hui; HAN Chengde;
    Journal of Computer Science and Technology, 2000, 15 (1): 84-95. 
    Abstract   PDF(533KB) ( 1262 )   Chinese Summary
    Testing of parallel programs involves two parts-testing of controlflow within the processes and testing of timing-sequence. This paper focuses on thelatter, particularly on the timing-sequence of message-passing paradigms. Firstlythe coarse-grained SYN-sequence model is built up to describe the execution of distributed programs. All of the topics discussed in this paper are based on it. Themost direct way to test a program is to run it. A fault-free parallel program shouldbe of both correct computing result…
    References | Related Articles | Metrics
    A Practical Algorithm for the Minimum Rectilinear Steiner Tree
    MA Jun; YANG Bo; MA Shaohan;
    Journal of Computer Science and Technology, 2000, 15 (1): 96-99. 
    Abstract   PDF(180KB) ( 1363 )   Chinese Summary
    An O(n2) time approximation algorithm for the minimum rectilinear Steiner tree is proposed. The approximation ratio of the algorithm is strictlyless than 1.5. The computing performances show the costs of the spanning treesproduced by the algorithm are only 0.8% away from the optimal ones.
    References | Related Articles | Metrics
    Direct 3D Painting with a Metaball-Based Paint brush
    WAN Huagen; JIN Xiaogang; BAO Hujun;
    Journal of Computer Science and Technology, 2000, 15 (1): 100-104. 
    Abstract   PDF(374KB) ( 1326 )   Chinese Summary
    This paper presents a direct 3D painting algorithm for polygonalmodels in 3D object-space with a metaball-based paintbrush in virtual environment.The user is allowed to directly manipulate the parameters used to shade the surfaceof the 3D shape by applying the pigment to its surface with direct 3D manipulationthrough a 3D flying mouse.
    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