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 September 1999, Volume 14 Issue 5 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    Recent Advances in Automated Theorem Proving on Inequalities
    YANG Lu;
    Journal of Computer Science and Technology, 1999, 14 (5): 434-446. 
    Abstract   PDF(573KB) ( 1303 )   Chinese Summary
    Automated theorem proving on inequalities is always considered asa difficult topic in the area of automated reasoning. The relevallt algorithms dependfundamentally on real algebra and real geometry, and the computational complexityincreases very quickly with the dimension, that is, the number of parameters. Somewell-known algorithms are complete theoretically but inefficient in practice, whichcannot verify non-trivial propositions in batches. A dimension- decreasing algorit hmpresellted here can treat radic…
    References | Related Articles | Metrics
    Orthogonal Drawings of Graphs for the Automation of VLSI Circuit Design
    LIU Thnpei;
    Journal of Computer Science and Technology, 1999, 14 (5): 447-459. 
    Abstract   PDF(323KB) ( 1397 )   Chinese Summary
    This article shows the recent developments on orthogonal draw-ings of graphs which have applications for the automation of VLSI circuit design.Meanwhile, a number of problems are posed for further research.
    References | Related Articles | Metrics
    Automated Generation of Kempe Linkageand Its Complexity
    GAO Xiaoshan; ZHU Changcai;
    Journal of Computer Science and Technology, 1999, 14 (5): 460-467. 
    Abstract   PDF(347KB) ( 1331 )   Chinese Summary
    It is a famous result of Kempe that a lillkage can be designed togenerate any given plane algebraic curve. In this paper, Kempe's result is improvedto give a precise algorithm for generating Kempe linkage. We proved that for analgebraic plane curve of degree n, Kempe linkage uses at most O(n4) links. Effortsto implement a program which may generate Kempe linkage and simulation of thegeneration process of the plane curves are presellted in the paper.
    References | Related Articles | Metrics
    Solving SAT by Algorithm Transform of Wu s Method
    HE Simin; ZHANG Bo;
    Journal of Computer Science and Technology, 1999, 14 (5): 468-480. 
    Abstract   PDF(316KB) ( 1342 )   Chinese Summary
    Recently algorithms for solving propositional satisfiability problem,or SAT, have aroused great illterest, and more attention has been paid to trans-formation problem solving. The commonly used transformation is representationtransform, but since its ifltermediate computing procedure is a black box from theviewpoint of the original problem, this aPproach has many limitations. In this paper, a new approach called algorithm transform is proposed and applied to solvingSAT by Wu's method, a general algorithm fo…
    References | Related Articles | Metrics
    Fast Theorem-Proving and Wu s Method
    LI Lian; WANG Jimin;
    Journal of Computer Science and Technology, 1999, 14 (5): 481-486. 
    Abstract   PDF(260KB) ( 1179 )   Chinese Summary
    In this paper, the possibility of fast algorithm is discussed for me-chanical theorem proving, where the degeneracy condition are considered in designingof these algorithms. It is found that all of the methods depend seriously on some prin-ciples appearing in Wu's Method. In other words, some principles in Wu's Methodare the instinctive properties in these new fast algorithms of theorem proving.
    References | Related Articles | Metrics
    Object-oriented Analysis of ELIMINO
    LIN Dongdai; LIU Zhuojun;
    Journal of Computer Science and Technology, 1999, 14 (5): 487-494. 
    Abstract   PDF(332KB) ( 1389 )   Chinese Summary
    ELIMINO is a mathematical research system developed for theimplementation of Wu's method, a powerful method for polynomial equation systemsolving and geometric theorem proving. The aim of ELIMINO is to provide usera programmable interpreting environment to use Wu's method in scientific researchand engineering computation. In this paper, the development of ELIMINo systemis outlined and the techniques adopted are discussed, then some details about theobject-oriented analysis of ELIMINO are presented.
    References | Related Articles | Metrics
    The Intelligent CAI System for Chemistry Based on Automated Reasoning
    WANG Xiaojing; ZHANG Jingzhong;
    Journal of Computer Science and Technology, 1999, 14 (5): 495-509. 
    Abstract   PDF(372KB) ( 1499 )   Chinese Summary
    A new type of intelligent CAI system for chemistry is developed inthis paPer based on automated reaJsoning with chemistry knowledge. The systemhas shown its ability to solve chemistry problems, to assist students and teachersin studies and instruction with the automated reasoning functions. Its open modeof the knowledge base and its unique style of the illterface between the system andhuman provide more opportunities for the users to acquire living knowledge throughactive participation. The automated reason…
    References | Related Articles | Metrics
    The Multiplicity of Zeros of Algebraic System in Eigenvalue Method
    ZHANG Shugong; LIU Ying; FENG Guochen;
    Journal of Computer Science and Technology, 1999, 14 (5): 510-517. 
    Abstract   PDF(349KB) ( 1346 )   Chinese Summary
    This article deals with the structure relations between solutions toalgebraic system and matrices in eigenvalue method for solving the algebraic system-The authors first discuss the condition on the ideal generated by the given systemunder which the eigenspace of matrix has dimension 1 since in this case the zerocan be easily found. Then they study the relations between the multiplicity of zerosof the given system and orders of Jordan blocks of matrices formed in eigenvaluemethod.
    References | Related Articles | Metrics
    Hyperfinite Interpolation, Wu s Method and Blendingof Implicit Algebraic Surfaces
    ZHANG Shugong; REN Honaiu;
    Journal of Computer Science and Technology, 1999, 14 (5): 518-529. 
    Abstract   PDF(802KB) ( 1497 )   Chinese Summary
    one of the central questions in CAGD[1] is blending surfaces whichprovides the theoretical baJsis for the design technology of space surfaces. We willdiscuss the general theories and algorithms for multivariate hyperfinite interpolationand their aPplication to the blending of implicit algebraic surfaces, and investigate theexistence conditions of hyperfinite interpolation. Based on Wu's theory on blendingimplicit algebraic surfaces, the problem of blending two quadric surfaces is studied.The conditions for …
    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