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 May 1997, Volume 12 Issue 3 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    Articles
    Hierarchical Geometric Constraint Model for Parametric Feature Based Modeling
    Gao Shuming; Peng Qunsheng;
    Journal of Computer Science and Technology, 1997, 12 (3): 193-201. 
    Abstract   PDF(379KB) ( 1578 )   Chinese Summary
    A new geometric constraint model is described, which is hierarchical and suitable for parametric feature based modeling. In this model, different levels of geometric information are represented to support various stages of a design process. An efficient approach to parametric featu-re based modeling is also presented, adopting the high level geometric constraint model. The low level geometric model such as B-reps can be derived automatically from the high level geometric constraint model, enabling designers to perform their task of detailed design.
    References | Related Articles | Metrics
    Dynamic Fractal Transform with Applications to Image Data Compression
    Wang Zhou; Yu Yinglin;
    Journal of Computer Science and Technology, 1997, 12 (3): 202-209. 
    Abstract   PDF(404KB) ( 1236 )   Chinese Summary
    A recent trend in computer graphics and image processing is to use Iterated Function System (IFS) to generate and describe both man-made graphics and natural images. Jacquin was the first to propose a fully automatic gray scale image compression algorithm which is referred to as a typical static fractal transform based algorithm in this paper. By using this algorithm, an image can be condensely described as a fractal transform operator which is the combination of a set of fractal mappings. When the fractal transform operator is iteratedly applied to any initial image, a unique attractor (reconstructed image) can be achieved. In this paper) a dynamic fractal transform is presented which is a modification of the static transform. Instead of being fixed, the dynamic transform operator varies in each decoder iteration, thus differs from static transform operators. The new transform has advantages in improving coding efficiency and shows better convergence for the decoder.
    References | Related Articles | Metrics
    Representing Quadric Surfaces Using NURBS Surfaces
    Qin Kaihuai;
    Journal of Computer Science and Technology, 1997, 12 (3): 210-216. 
    Abstract   PDF(300KB) ( 1281 )   Chinese Summary
    A method for representing quadric surfaces using NURBS is presented. By means of the necessary and sufficient conditions for NURBS cu-rves to precisely represent circular arcs and other conics, quadric surfaces can be represented by NURBS surfaces with fewer control vertices. The method can be used not only for NURBS surface representation of quadric surfaces, but also for rounding polyhedrons. Many examples are given in the paper.
    References | Related Articles | Metrics
    Three-Dimensional Volume Datafield Reconstruction from Physical Model
    Dong Feng; Cai Wenli; Chen Tianzhou; Shi Jiaoying;
    Journal of Computer Science and Technology, 1997, 12 (3): 217-230. 
    Abstract   PDF(1053KB) ( 1604 )   Chinese Summary
    This paper focuses on entirety ioterpretation, representation and reconstruction of three-dimensional volume data sets based on the physical model of the data. The data model is represented by thIee-dimensional geometric model.The surfaces inside the datafield are extracted and matched to the model stirfaces in order to reconstruct the new datafield based on the model. A conclusion is drawn that physical modeling provides a good basis and approach to interpret and represellt the data sets. This paPer also presents a subdivision algorithm to fast traJce B-spline curve and the colltrary algorithm is adopted to extract the geometry feature of the curve.
    References | Related Articles | Metrics
    A Higher-Order Unification Algorithm for Inductive Types and Dependent Types
    Tan Qingping;
    Journal of Computer Science and Technology, 1997, 12 (3): 231-243. 
    Abstract   PDF(329KB) ( 1280 )   Chinese Summary
    This paper presents a method to define a set of mutuaJly recursive inductive types, and develops a higherorder unilication algorithm for Anz extended with inductive types. The algorithm is an extension of Eiliott's algoritbJn for λ∑.The notation of normal forms plays a vital role in higher-order unification.The weak head normal forms in the extended troe theory is defined to reveal the ultimate "top level structures" of the fully normalized terms and types. Unification transformation rules are designed to deal with inductive types, a recursive operator and its reduction rule. The algoritlun can construct recuxsive functions automatically.
    References | Related Articles | Metrics
    Nondeterministic Temporal Relations in Multimedia Data
    Li Minglu; Sun Yongqiang; Sheng Huany;
    Journal of Computer Science and Technology, 1997, 12 (3): 244-251. 
    Abstract   PDF(189KB) ( 1307 )   Chinese Summary
    Synchronization is an important issue in multimedia systems which integrate a variety of temporally related media objects. One part of synchronization is the representation of temporal information. With the emerging illteractive multimedia, deterministic temporal models are replaced by nondeterministic ones with more expressiveness. This paper classifies temporal models by their expressiveness, and evaluates relevant nondeterministic temporal relations in multimedia data. Additionally, an intervalbased nondeterndnistic model based on a complete temporal operator set is proposed providing highlevel abstractions and a high degree of expressiveness for interactive multimedia systems.
    References | Related Articles | Metrics
    A Logical Design Method for Relational Databases Based on Generalization and Aggregation Semantics
    Liu Weiyi; Yao Hong;
    Journal of Computer Science and Technology, 1997, 12 (3): 252-262. 
    Abstract   PDF(277KB) ( 1267 )   Chinese Summary
    In this paper, a series of design methods for relational databases based on generalization and aggregation sematics is set up. The relationship between a class and its subclass is considered as a scheme constraint. The concept of inheritance dependencies, which describes the multiple inheritance among schemes,is presented in the paper. It is shown that the inference rules for inheritance dependencies are sound and complete. Furthermore, a series of results about the closure of inheritance dependencies and the minimal set of inheritance dependencies, which are analogues to functional dependencies, is obtained. In order to describe the aggregation semalltics, the concept of aggregation dependencies is given. It is easy to implement these constraints under relational database management systems.
    References | Related Articles | Metrics
    Fuzzy Logic Control ASIC Chip
    Shen Li;
    Journal of Computer Science and Technology, 1997, 12 (3): 263-270. 
    Abstract   PDF(331KB) ( 1412 )   Chinese Summary
    A fuzzy logic colltrol VLSI chip, F100, for industry process real-time colltrol has been designed and fabricated with 0.8pm CMOS technology. The chip has the features of simplicity flealbility and generality. This paper presents the fuzzy control inference method of the chip, its VLSI implementation, and testing design consideration.
    References | Related Articles | Metrics
    Path Sensitization
    Zhao Zhuxing; Min Yinghua; Li Zhongcheng;
    Journal of Computer Science and Technology, 1997, 12 (3): 271-282. 
    Abstract   PDF(251KB) ( 1292 )   Chinese Summary
    For different delay models, the concept of sensitization can be very different.Thaditional concepts of sensitization cannot precisely describe circult behavior when the input vectors change very fast. Using Boolean process approach, this paper presents a new definition of sensitization for arbitrary input waveforms.By this new concept it is found that if the inputs of a combinational circult can change at any time, and each gate's delay varies witliln an interval (bounded gate delay model), then every path, which is not necessarily a single topological path, is sensitizable. fum the experimental results it can be seen that, all nonsensitizable paths for traditional concepts actually can propagate transitions along them for some input wavforms. However, specilied time between input transitions (STBIT) and nilnimum perndssible pulse width (E) are two major factors to make some paths non-sensitizable.
    References | Related Articles | Metrics
    Hanzix and Chinese Open System Platform
    Sun Yufang;
    Journal of Computer Science and Technology, 1997, 12 (3): 283-288. 
    Abstract   PDF(248KB) ( 1484 )   Chinese Summary
    International use of the UNIX system in recent years provokes a need to expand its functionality. Extensions are needed to process data in various languages as the market requirement dictate[1,2]. With the advent of open systems and interfaces, the method of internationalization (I18N) has become standardized. Hanzix Association was founded by the fortitute of Software, The Chinese Academy of Sciences (ISAS, Beijing), Institute of Information Industry (III, Taipei) and Chinese University of Hong Kong (CUHK, Hong Kong), and its aim is to promote an open system standard for Chinese character (Hanzi) processing. This paper presents Hanzix, an open system environment to support Hanzi processing, including enhancemed recommended for Hanzi API,input method mechedsm, codeset conversion and armuncement, and reviews the current work.
    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