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 January 1997, Volume 12 Issue 1 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    Optimal Algorithm for Algebraic Factoring
    Zhi Lihong;
    Journal of Computer Science and Technology, 1997, 12 (1): 1-9. 
    Abstract   PDF(385KB) ( 1116 )   Chinese Summary
    This paper presents an optimized method for factoring multivariate polynomials over algebraic extension fields defined by an irreducible ascending set.The basic idea is to convert multivariate polynomials to univariate polynomials and algebraic extension fields to algebraic number fields by suitable integer substitutions. Then factorize the univariate polynomials over the algebraic number fields. Finally, construct multivariate factors of the original polynomial by Hensel lemma and TRUEFACTOR test. Some exa…
    References | Related Articles | Metrics
    Mechanical Geometry Theorem Proving Based on Groebner Bases
    Wu Jinzhao;
    Journal of Computer Science and Technology, 1997, 12 (1): 10-16. 
    Abstract   PDF(298KB) ( 1242 )   Chinese Summary
    A new method for the mechanical elementary geometry theorem proving is presented by using Groebner bases of polynomial ideals. It has two main advantages over the approach proposed in literature: (i) It is complete and not a refutational procedure; (ii) The subcases of the geometry statements which are not generally true can be differentiated clearly.
    References | Related Articles | Metrics
    R-Calculus for ELP:An Operational Approach to Knowledge Base Maintenance
    Shen Ningchuan; Li Wei;
    Journal of Computer Science and Technology, 1997, 12 (1): 17-28. 
    Abstract   PDF(478KB) ( 1164 )   Chinese Summary
    Some concepts used in knowledge base maintenance, such as sequence, new law, user's rejection and reconstructions of a knowledge base, are first introduced, and then a framework for extended logic programming (ELP) is given,where an extended logic program is equivalent to a knowledge base. A transition system called R-calculus for ELP is provided. For a given knowledge base and a user's rejection, the Rcalculus for ELP will deduce best revisions of the base. The soundness and the completeness of the Rcalcul…
    References | Related Articles | Metrics
    Implementation of GAMMA on a Massively Parallel Computer
    Huang Linpeng; Tong Weiqin; Kam Wing Ng; Sun Yongqiang;
    Journal of Computer Science and Technology, 1997, 12 (1): 29-39. 
    Abstract   PDF(447KB) ( 1278 )   Chinese Summary
    The GAMMA paradigm is recently proposed by Banatre and M6tayer to describe the systematic construction of parallel programs without introducing artificial sequentiality. This paper presents two synchronous execution models for GAMMA and discusses how to implement them on MasPar MP-1, a massively data parallel computer. The results show that GAMMA paradigm can be implemented very naturally on data parallel machines, and very high level language, such as GAMMA in which parallelism is left implicit, is suitabl…
    References | Related Articles | Metrics
    RaRb Transformation of Compound Finite Automata over Commutative Rings
    Whng Hao;
    Journal of Computer Science and Technology, 1997, 12 (1): 40-48. 
    Abstract   PDF(387KB) ( 1276 )   Chinese Summary
    Some results on RaRb transformation of compound finite automata over finite field are generalized to the case of commutative rings. Properties of RaRb transformation are discussed and applied to the inversion problem for compound finite automata.
    References | Related Articles | Metrics
    Performance Prediction of the Hough Transform
    Hu Zhanyi; Ma Songde;
    Journal of Computer Science and Technology, 1997, 12 (1): 49-57. 
    Abstract   PDF(374KB) ( 1238 )   Chinese Summary
    Based on three different implementation schemes, this paper strongly demonstrates that the performance of the Hough transform depends crucially on its implementation scheme when it is used for line detection. Moreover, the obtained results can be used as a theoretical basis to predict the performance of the Hough transform as well as to eliminate the noise in Hough space coming from image noise.
    References | Related Articles | Metrics
    Existence and Uniqueness in Shape from Shading
    Deng Yanping; Li Jiegu;
    Journal of Computer Science and Technology, 1997, 12 (1): 58-64. 
    Abstract   PDF(287KB) ( 1310 )   Chinese Summary
    For the image of a smooth surface object fully contained within the field of view and illuminated in an arbitrary direction, this paper discusses the ekistence and uniqueness of the conditions for solving a shape-from-shading problem under the conditions that the Fourier series expansion of the image intensity contains only zero and first order terms in a polar coordinate system. Three theorems are established, one for the ekistence and two for the uniqueness of z-axis symmetric shape from shading.
    References | Related Articles | Metrics
    An Approach to User Interface Specification with Attribute Grammars
    Hua Qingyi;
    Journal of Computer Science and Technology, 1997, 12 (1): 65-75. 
    Abstract   PDF(456KB) ( 1406 )   Chinese Summary
    An approach to supporting user interfaces using an attribute grammmar combined with an event model is described. The main emphasis is how to represent a multi-thread dialogue model in direct manipulation user interfaces. It is shown that control sequence within dialogues, communication with other dialogues,and some computations for applications can be specified with a syntactic and semantic notation. The attribute grammar specification can be implemented using an attribute grammar interpreter embedded in th…
    References | Related Articles | Metrics
    Neural Network Methods for NURBS Curve and Surface Interpolation
    Qin Kaihuai;
    Journal of Computer Science and Technology, 1997, 12 (1): 76-89. 
    Abstract   PDF(574KB) ( 1410 )   Chinese Summary
    New algorithms based on artificial neural network models are presented for cubic NURBS cuxve and surface interpolation. When all the knot spans are identical, the NURBS curve interpolation procedtire degenerates into that of uniform rational B-spline curves. If all the weights of data points are identical,then the NURBS curve interpolation procedure degenerates into the integral B-spline curve interpolation.
    References | Related Articles | Metrics
    Parsing with Dynamic Rule Selection
    Zong Chengqing; Chen Zhaoxiong; Huang Heyan;
    Journal of Computer Science and Technology, 1997, 12 (1): 90-96. 
    Abstract   PDF(286KB) ( 1289 )   Chinese Summary
    Although many linguistic theories and formalisms have been developed and discussed on the problem of parsing algorithm in the past decades, the efficiency and accuracy of parsing are still serious problems in practical machine translation systems. This paper presents a parsing algorithm with dynamic rule selection and the experimental results. By describing the design and practice of the improved algorithm, the paper discusses in detail the designing method for a high speed and efficient parser.
    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