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
      15 May 2001, Volume 16 Issue 3 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    Articles
    New Algorithms for the Perspective-Three-Point Problem
    GAO Xiaoshan(高小山)and CHEN Hangfei(陈航飞)
    Journal of Computer Science and Technology, 2001, 16 (3): 0-0. 
    Abstract   PDF(371KB) ( 3246 )   Chinese Summary
    In this paper, two approaches are used to solve the Perspective-Three-Point Problem (P3P): the symbolic computation approach and the geometric approach. In the symbolic computation approach, we use Wu-Ritt's zero decomposition algorithm to give a complete triangular decomposition for the P3P equation system. This decomposition provides the first complete analytical solution to the P3P problem. In the geometric approach, we give some pure geometric criteria for the number of real physical solutions. The complete solution classification for two special cases with three and four parameters is also given.
    Related Articles | Metrics
    A Study on Wavelet Data Compression of a Real-Time Monitoring System for Large Hydraulic Machines
    WANG Hai(王海)and ZHENG Liyuan(郑莉媛)
    Journal of Computer Science and Technology, 2001, 16 (3): 0-0. 
    Abstract   PDF(217KB) ( 1581 )   Chinese Summary
    The general concept of data compression consists in removing the redundancy existing in data to find a more compact representation. This paper is concerned with a new method of compression using the second generation wavelets based on the lifting scheme, which is a simple but powerful wavelet construction method. It has been proved by its successful application to a real-time monitoring system of large hydraulic machines that it is a promising compression method.
    Related Articles | Metrics
    From Concepts to Consistent Object Specifications:Translation of a Domain-Oriented Feature Framework into Practice
    Harald E.Otto
    Journal of Computer Science and Technology, 2001, 16 (3): 0-0. 
    Abstract   PDF(454KB) ( 1659 )   Chinese Summary
    A steady increase in consumer demands, and severe constraints from both a somewhat damaged environment and newly installed government policies, require today's product design and development to be faster and more efficient than ever before, yet utilizing even fewer resources. New holistic approaches, such as total product life cycle modeling which embraces all aspects of a product's life cycle, are current attempts to solve these problems. Within the field of product design and modeling, feature technology has proved to be one very promising solution component. Owing to the tremendous increase in information technology, to transfer from low level data processing towards knowledge modeling and information processing is about to bring a change in almost every computerized application. From this viewpoint, current problems of both feature frameworks and feature systems are analyzed in respect to static and dynamic consistency breakdowns. The analysis ranges from early stages of designing (feature) concepts to final system implementation and application. For the first time, an integrated view is given on approaches, solutions and practical experience, with feature concepts and structures, providing both a feature framework and its implementation with sufficient system architecture and computational power to master a fair number of known consistency breakdowns, while providing for robust contexts for feature semantics and integrated models. Within today's heavy use of information technology these are pre-requisites if the full potential of feature technology is to be successfully translated into practice.
    Related Articles | Metrics
    Dynamic Data Prefetching in Home-Based Software DSMs
    HU Weiwu(胡伟武),ZHANG Fuxin(张福新)and LIU Haiming(刘海明)
    Journal of Computer Science and Technology, 2001, 16 (3): 0-0. 
    Abstract   PDF(324KB) ( 1659 )   Chinese Summary
    A major overhead in software DSM (Distributed Shared Memory) is the cost of remote memory accesses necessitated by the protocol as well as induced by false sharing. This paper introduces a dynamic prefetching method implemented in the JIAJIA software DSM to reduce system overhead caused by remote accesses. The prefetching method records the interleaving string of INV (invalidation) and GETP (getting a remote page) operations for each cached page and analyzes the periodicity of the string when a page is invalidated on a lock or barrier. A prefetching request is issued after the lock or barrier if the periodicity analysis indicates that GETP will be the next operation in the string. Multiple prefetching requests are merged into the same message if they are to the same host. Performance evaluation with eight well-accepted benchmarks in a cluster of sixteen PowerPC workstations shows that the prefetching scheme can significantly reduce the page fault overhead and as a result achieves a performance increase of 15%--20% in three benchmarks and around 8%--10% in another three. The average extra traffic caused by useless prefetches is only 7%--13% in the evaluation.
    Related Articles | Metrics
    A New Approach to Pointer Analysis for Assignments
    HUANG Bo(黄波),ZANG Binyu(臧斌宇),LI Jing(李靖)and ZHU Chuanqi(朱传琪)
    Journal of Computer Science and Technology, 2001, 16 (3): 0-0. 
    Abstract   PDF(344KB) ( 1465 )   Chinese Summary
    Pointer analysis is a technique to identify at compile-time the potential values of the pointer expressions in a program, which promises significant benefits for optimizing and parallelizing compilers. In this paper, a new approach to pointer analysis for assignments is presented. In this approach, assignments are classified into three categories: pointer assignments, structure (union) assignments and normal assignments which don't affect the point-to information. Pointer analyses for these three kinds of assignments respectively make up the integrated algorithm. When analyzing a pointer assignment, a new method called expression expansion is used to calculate both the left targets and the right targets. The integration of recursive data structure analysis into pointer analysis is a significant originality of this paper, which uniforms the pointer analysis for heap variables and the pointer analysis for stack variables. This algorithm is implemented in Agassiz, an analyzing tool for C programs developed by Institute of Parallel Processing, Fudan University. Its accuracy and effectiveness are illustrated by experimental data.
    Related Articles | Metrics
    A Formal Software Development Approach Using Refinement Calculus
    WANG Yunfeng(王云峰),PANG Jun(庞军),ZHA Ming(查鸣),YANG Zhaohui(杨朝晖)and ZHENG Guoliang(郑国梁)
    Journal of Computer Science and Technology, 2001, 16 (3): 0-0. 
    Abstract   PDF(329KB) ( 1518 )   Chinese Summary
    The advantage of COOZ (Complete Object-Oriented Z) is to specify large scale software, but it does not support refinement calculus. Thus its application is confined %and it cannot be taken as a whole method for software development. Including refinement calculus into COOZ overcomes its disadvantage during design and implementation. The separation between the design and implementation for structure and notation is removed as well. Then the software can be developed smoothly in the same frame. The combination of COOZ and refinement calculus can build object-oriented frame, in which the specification in COOZ is refined stepwise to code by calculus. In this paper, the development model is established, which is based on COOZ and refinement calculus. Data refinement is harder to deal with in a refinement tool than ordinary algorithmic refinement, since data refinement usually has to be done on a large program component at once. As to the implementation technology of refinement calculus, the data refinement calculator is constructed and an approach for data refinement which is based on data refinement calculus and program window inference is offered.
    Related Articles | Metrics
    CWA Formalizations in Multi-Valued Logics
    WU Jinzhao(吴尽昭)
    Journal of Computer Science and Technology, 2001, 16 (3): 0-0. 
    Abstract   PDF(287KB) ( 1666 )   Chinese Summary
    To enhance the expressive power and the declarative ability of a deductive database, various CWA (Closed World Assumption) formalizations including the na?ve CWA, the generalized CWA and the careful CWA are extended to multi-valued logics. The basic idea is to embed logic formulas into some polynomial ring. The extensions can be applied in a uniform manner to any finitely multi-valued logics. Therefore they are also of computational significance.
    Related Articles | Metrics
    Relaxation Algorithm of Piecing-Error for Sub-Images
    LI Yueping(李跃平)and TANG Pushan(唐璞山)
    Journal of Computer Science and Technology, 2001, 16 (3): 0-0. 
    Abstract   PDF(289KB) ( 1243 )   Chinese Summary
    During the process of automatic image recognition or automatic reverse design of IC, people often encounter the problem that some sub-images must be pieced together into a whole image. In the traditional piecing algorithm for sub-images, a large accumulated error will be made. In this paper, a relaxation algorithm of piecing-error for sub-images is presented. It can eliminate the accumulated error in the traditional algorithm and greatly improve the quality of pieced image. Based on an initial pieced image, one can continuously adjust the center of every sub-image and its angle to lessen the error between the adjacent sub-images, so the quality of pieced image can be improved. The presented results indicate that the proposed algorithm can dramatically decrease the error while the quality of ultimate pieced image is still acceptable. The time complexity of this algorithm is O( n\ln n ).
    Related Articles | Metrics
    A Loop-Based Apparatus for At-Speed Self-Testing
    LI Xiaowei(李晓维)and Paul Y.S.Cheung(张英相)
    Journal of Computer Science and Technology, 2001, 16 (3): 0-0. 
    Abstract   PDF(295KB) ( 1585 )   Chinese Summary
    At-speed testing using external tester requires an expensive equipment, thus built-in self-test (BIST) is an alternative technique due to its ability to perform on-chip at-speed self-testing. The main issue in BIST for at-speed testing is to obtain high delay fault coverage with a low hardware overhead. This paper presents an improved loop-based BIST scheme, in which a configurable MISR (multiple-input signature register) is used to generate test-pair sequences. The structure and operation modes of the BIST scheme are described. The topological properties of the state-transition-graph of the proposed BIST scheme are analyzed. Based on it, an approach to design and efficiently implement the proposed BIST scheme is developed. Experimental results on academic benchmark circuits are presented to demonstrate the effectiveness of the proposed BIST scheme as well as the design approach.
    Related Articles | Metrics
    Type System in Programming Languages
    JIANG Hui(蒋慧),LIN Dong(林东),ZHANG Xingyuan(张兴元)and XIE Xiren(谢希仁)
    Journal of Computer Science and Technology, 2001, 16 (3): 0-0. 
    Abstract   PDF(286KB) ( 1526 )   Chinese Summary
    Type system provides a precise description of a programming language. This is a prerequisite for the implementation and use of language. It also conducts mechanical and transparent type-checking on programs to prevent the occurrence of execution error during the running of programs. So, it can be said that, on the one hand, type system works as a formal tool to do mathematical analysis of language; on the other hand, it is a formal method for rigorously and precisely designing and implementing language. In this paper, some basic concepts of type system are discussed first. And then, the implementation of a graph-rewriting-based functional language --- Sclean's type system is given in details. It is hoped that the proposed method of using and implementing type system is of practical usefulness.
    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