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 1997, Volume 12 Issue 6 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    Articles
    Knowledge Representation in KDD Based on Linguistic Atoms
    Li Deyi;
    Journal of Computer Science and Technology, 1997, 12 (6): 481-496. 
    Abstract   PDF(668KB) ( 1193 )   Chinese Summary
    An important issue in Knowledge Discovery in Databases is to allow the discovered knowledge to be as close as possible to natural languages to satisfy user needs with tractability on one hand, and to offer KDD systems robustness on the other hand. At this junction, this paper describes a new concept of linguistic atoms with three digital characteristics: expected value Ex, entropy En, and deviation D. The mathematical description has effectively illtegrated the fuzziness and randomness of linguistic terms i…
    References | Related Articles | Metrics
    Counting and Topological Order
    Chen Yangjun;
    Journal of Computer Science and Technology, 1997, 12 (6): 497-509. 
    Abstract   PDF(566KB) ( 1210 )   Chinese Summary
    The counting method is a simple and efficient method for processing linear recursive datalog queries. Its time complexity is bounded by O(n.e), where n and e denote the numbers of nodes and edges, respectively, in the graph representing the input relations. In this paper, the concepts of heritage appearance function and heritage selection function are introduced, and an evaluation algorithm based on the computation of such functions in topological order is developed. This new algorithm requires only linear …
    References | Related Articles | Metrics
    On the Expressive Power of F-Logic Language
    Tian Zengping; Wang Yujun; Qu Yunyao; Shi Baile;
    Journal of Computer Science and Technology, 1997, 12 (6): 510-519. 
    Abstract   PDF(456KB) ( 1463 )   Chinese Summary
    F-logic language is a logic database language based on frame logic. It is powerful in expressing object-oriented features. However, there was littIe work discussing its capability of manipulating complex objects. In this paper, the authors compare the capability of F-logic with that of logic database languages represented by COL. Through two pairs of semantic-preserving transformations, F-logic programs and their Herbrand interpretations can be transformed into COL programs and their corresponding Herbrand …
    References | Related Articles | Metrics
    Techniques of Integrating Datalog with PROLOG
    Zhu Yangyong; Guo Depei; Shi Baile;
    Journal of Computer Science and Technology, 1997, 12 (6): 520-531. 
    Abstract   PDF(526KB) ( 1351 )   Chinese Summary
    Since extending DATALOG to a general-purpose programming language seems very difficult, many projects have embedded a DATALOG-based query language into a procedural host language, such as CORAL, Glue-Nail, etc.Although DATALOG can be considered as function-free PROLOG, they are very different in many aspects. For instance, DATALOG is declarative while PROLOG isn't, DATALoG takes "a-set-at-atime" mode of evaluation but PROLOG takes "a-tuple-at-a-time" one, DATALOG is only a query language whereas PROLOG is a…
    References | Related Articles | Metrics
    Hyper-Distributed Hyper-Parallel Implementation of Heuristic Search of Implicit AND/OR Graph
    Shuai Dianxun;
    Journal of Computer Science and Technology, 1997, 12 (6): 532-542. 
    Abstract   PDF(494KB) ( 1311 )   Chinese Summary
    This paper presents the hierarchic chaotic cellular networks for the hardware implementation of hyper-distributed hyper-parallel intelligent problem solving based on competitive wave propagation. By using the bifurcation and the synchronization of distributed chaotic dynamic systems, and by improving the Chua's circuit, the mechanism and the algorithms of heuristic search of an implicit AND/OR graph are realized in a hyper-distributed hyper-parallel environment. This paper's approach has many advantages in …
    References | Related Articles | Metrics
    Concurrent Competitive Wave Approach to Hyper-Distributed Hyper-Parallel AI Processing
    Shuai Dianxun;
    Journal of Computer Science and Technology, 1997, 12 (6): 543-554. 
    Abstract   PDF(561KB) ( 1409 )   Chinese Summary
    This paper preseflts a new approach of the synchronous homogeneous concurrent propagation of competitive waves for the purpose of hyper-distributed hyper-parallel heuristic problem-solving. The concurrent algorithm, mechanism and their properties are given. In comparison with the traditional AI algorithms, the approach is featured by the knowledge-based problem-solving in the distributed parallel environment, the feasibility for hardware implementation and the various applications.
    References | Related Articles | Metrics
    The Expansion Postponement in Pure Type Systems
    Song Fangmin;
    Journal of Computer Science and Technology, 1997, 12 (6): 555-563. 
    Abstract   PDF(393KB) ( 1321 )   Chinese Summary
    The expansion postponement problem in Pure Type Systems is an open problem raised by R. Pollack in 1992. In this paper, the author presents a set of necessary and sufficient conditions for this problem and a set of sufficient conditions for it. The author also gives some properties for pure type systems without the expansion rule.
    References | Related Articles | Metrics
    Contour Matching Using Wavelet Transform and Multigrid Methods
    Jiang Tianzi; Ma Songde;
    Journal of Computer Science and Technology, 1997, 12 (6): 564-570. 
    Abstract   PDF(292KB) ( 1415 )   Chinese Summary
    In this paper, wavelet transform and multigrid method are combined to make the method more practical. It is known that Gaussian filtering causes shrinkage of data. To overcome this disadvantage, Gaussian filtering is replaced with wavelet transform. This method introduces no curve shrinkage. Then, the linearized form of objective equation is proposed. This makes contour matching easier to implement. Finally, the multigrid method is used to speed up the convergence.
    References | Related Articles | Metrics
    Minimum QOS Parameter Set in Transport Layer
    Wang Yun; Gu Guanqun;
    Journal of Computer Science and Technology, 1997, 12 (6): 571-573. 
    Abstract   PDF(136KB) ( 1319 )   Chinese Summary
    QOS (Quality of Service) parameter definitions are the basis of further QOS control.But QOS parameters defined by orgallizations such as ISO and ITU are incoherent and incompatible. It leads to the inefficiency of QOS controls. Based on the analysis of QOS parameters defined by ISO and ITU, this paper first promotes Minimum QOS Parameter Set in transport layer. It demonstrates that the parameters defined by ISO and ITU can be represented by parameters or a combination of parameters of the Set. The paper als…
    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