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 1998, Volume 13 Issue 1 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    Articles
    An Interactive Learning Algorithm for Acquisition of Concepts Represented as CFL
    Dong Yunmei;
    Journal of Computer Science and Technology, 1998, 13 (1): 1-8. 
    Abstract   PDF(325KB) ( 1142 )   Chinese Summary
    In this paper, an interactive learning algorithm of context-free language is presented. This algorithm is designed especially for system SAQ, which is a system for formal specification acquisition and verification. As the kernel of concept acquisition subsystem (SAQ/CL) of SAQ, the algorithm has been implemented on SUN SPARC workstation. The grammar to be obtained can represent sentence structure naturally.
    References | Related Articles | Metrics
    A Hopeful CNF-SAT─Algorithm Its High Efficiency, Industrial Application and Limitation
    Huang Wenqi; Li Wei;
    Journal of Computer Science and Technology, 1998, 13 (1): 9-12. 
    Abstract   PDF(164KB) ( 1333 )   Chinese Summary
    From the SAT physical model, a physical hypothesis named PHHY is proposed. By PHHY, it is proved that there is a universally efficient algorithm for solving SAT problem. Then, by square packing problem, the authors show that there are interesting industrial NP-complete problems which can be solved through SAT algorithms, but each way of solving like this will be much worse than that of a certain direct solving.
    References | Related Articles | Metrics
    Intuitionistic Logic as the Implement of Incremental Model Construction for Natural Language
    Zhang Tong;
    Journal of Computer Science and Technology, 1998, 13 (1): 13-17. 
    Abstract   PDF(217KB) ( 1185 )   Chinese Summary
    The process of understanding natural language can be viewed as the process of model construction. This paper? employing Kripke frame for intuitionistic logic semantics as the implement of model construction for natural language, introduces a method of incremental model construction.
    References | Related Articles | Metrics
    Reduction of Cycle Unification of Type Cpg+r
    Hu Yunfa; Wolfgang Bibel;
    Journal of Computer Science and Technology, 1998, 13 (1): 18-24. 
    Abstract   PDF(321KB) ( 1095 )   Chinese Summary
    In this paper a class of cycle unification problems called type Cpg+r is studied, and an intuitive representation method, called the position supergraph, is presented to analyze or reduce the cycle problem. A typical case of Cpg+r problems is considered and an algorithm is given, which transforms the original problem of Cpg+r that is of the exponential complexity into a new one that is of the linear complexity when using SLD resolution method. These results are of importance for practice and theory.
    References | Related Articles | Metrics
    Completeness of the Accumulation Calculus
    Yu Huiqun; Song Guoxin; Sun Yongqiang;
    Journal of Computer Science and Technology, 1998, 13 (1): 25-31. 
    Abstract   PDF(185KB) ( 1267 )   Chinese Summary
    The accumulation calculus (AC for short) is an interval based temporal logic to specify and reason about hybrid real-time systems. This paper presents a formal proof system for AC, and proves that the system is complete relative to that of Interval Temporal Logic (ITL for short) on real domain.
    References | Related Articles | Metrics
    Document Analysis by Crosscount Approach
    Wang Haiqin; Dai Ruwei;
    Journal of Computer Science and Technology, 1998, 13 (1): 32-40. 
    Abstract   PDF(416KB) ( 1103 )   Chinese Summary
    In this paper a new feature called crosscount for document analysis is introduced.The feature crosscount is a function of white line segment with its start on the edgeof document images. It reflects not only the contour of image, but also the periodicity of white lines(background) and text lines in the document images. In complexprinted-page layouts, there are different blocks such as textual, graphical, tabular, andso on. of these blocks, textual ones have the most obvious periodicity with their homogeneou…
    References | Related Articles | Metrics
    Multiplicative Inhibitory Velocity Detector and Multi-Velocity Motion Detection Neural Network Model
    Wang Aiqun; Zheng Nanning;
    Journal of Computer Science and Technology, 1998, 13 (1): 41-54. 
    Abstract   PDF(606KB) ( 1219 )   Chinese Summary
    Motion perception is one of the most important aspects of the biological visual system, from which people get a lot of information of the natural world. In this paper, trying to simulate the neurons in MT (motion area in visual cortex) which respond selectively both in direction and speed, the authors propose a novel multiplicative inhibitory velocity detector (MIVD) model, whose spatiotemporal joint parameter K determines its optimal velocity. Based on the Response Amplitude Disparity (RAD) property of MIV…
    References | Related Articles | Metrics
    Segmentation of Stick Text Based on Sub Connected Area Analysis
    Gao Jingbo; Li Xinyou; Tang Zesheng;
    Journal of Computer Science and Technology, 1998, 13 (1): 55-62. 
    Abstract   PDF(209KB) ( 1305 )   Chinese Summary
    A new stick text segmentation method based on the sub connected area analysis is introduced in this paper. The foundation of this method is the sub connected area representation of text image that can represent all connected areas in an image efficiently. This method consists mainly of four steps: sub connected area classification, finding initial boundary following point, finding optimal segmentation point by boundary tracing, and text segmentation. This method is similar to boundary analysis method but …
    References | Related Articles | Metrics
    A Type of Triangular Ball Surface and its Properties
    Hu Shimin; Wang Guojin; Sun Jiaguang;
    Journal of Computer Science and Technology, 1998, 13 (1): 63-72. 
    Abstract   PDF(211KB) ( 1247 )   Chinese Summary
    A new type of bivariate generalized Ball basis function on a triangle is presented for free-form surface design. Some properties of the basis function are given, then degree elevation, recursive evaluation and some other properties of the generalized Ball surfaces are also derived. It is shown that the proposed recursive evaluation algorithm is more efficient than those of the old surfaces.
    References | Related Articles | Metrics
    Line-Art and its Mathematical Models
    Xu Yingqing; Hans Dehlinger; Qi Dongxu; Liu Shenquan;
    Journal of Computer Science and Technology, 1998, 13 (1): 73-78. 
    Abstract   PDF(271KB) ( 1165 )   Chinese Summary
    In this paper, the authors describe the principles of Straight Line Strokes illustration, present the mathematical model of the principles, and show how a great number of lines can be implemented as main part of an automated drawing system named Line-Art. Different from traditional drawing art, Line-Art generates pictures without curves, colors, ink marks, brushes, and oil paint, but only with Straight Line Strokes. Generated pictures are composed, clipped, and plotted. The paper also introduces how to use…
    References | Related Articles | Metrics
    A Formal Approach to Protocol Interoperability Testing
    Hao Ruibing; Wu Jianping;
    Journal of Computer Science and Technology, 1998, 13 (1): 79-90. 
    Abstract   PDF(536KB) ( 1220 )   Chinese Summary
    Protocol Interoperability testing is an important means to ensure the interconnection and interoperation between protocol products. In this paper, we proposed a formal approach to protocol interoperability testing based on the operational semantics of Concurrent TTCN. We define Concurrent TTCN's operational semantics by using Labeled transition System, and describe the interoperability test execution and test verdict based on Concurrent TTCN. This approach is very helpful for the formation of formal intero…
    References | Related Articles | Metrics
    A Topology Designing System for a Computer Network
    Hou Zhengfeng;
    Journal of Computer Science and Technology, 1998, 13 (1): 91-96. 
    Abstract   PDF(254KB) ( 1225 )   Chinese Summary
    In this paper, some problems on the topology design of network are discussed. An exact formula to calculate the delay of a line will be provided. In the design, the key problem is how to find some efficient heuristic algorithms. To solve this problem, a nonliner- discrete-capacity assignment heuristic and a hybrid perturbation heuristic are suggested. Then, a practical CAD system which helps design the topology of network will be introduced.
    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