Loading...
Bimonthly    Since 1986
ISSN 1004-9037
/
Indexed in:
SCIE, Ei, INSPEC, JST, AJ, MR, CA, DBLP, etc.
Publication Details
Edited by: Editorial Board of Journal of Data Acquisition and Processing
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
 
  • Table of Content
      10 March 1995, Volume 10 Issue 2   
    For Selected: View Abstracts Toggle Thumbnails
    Articles
    A Maximum Time Difference Pipelined Arithmetic Unit Based on CMOS Gate Array
    Tang Zhimin; Xia Peisu;
    Journal of Data Acquisition and Processing, 1995, 10 (2): 97-103. 
    Abstract   PDF(298KB) ( 1355 )  
    This paper describes a maximum time difference pipelined arithmetic chip,the 36-bit adder and subtractor based on 1.5 μm CMOS gate array The chipcan operate at 60MHz, and consumes less than 0.5Wat. The results are alsostudied, and a more precise model of delay time dmerence is proposed.
    The Generation of a Sort of Fractal Graphs
    Zhang Bo; Zhang Ling; Chen Gang;
    Journal of Data Acquisition and Processing, 1995, 10 (2): 104-111. 
    Abstract   PDF(331KB) ( 1308 )  
    We present an approach for generating a sort of fractal graphs by a simpleprobabilistic logic neuron network and show that the graphs can be representedby a set of compressed codings. An algorithm for quickly finding the codings,i.e., recognizing the corresponding graphs, is given. The codings are shown tobe optimal. The results above possibly give us the clue for studying imagecompression and pattern recognition.
    Research and Design of a Fuzzy Neural Expert System
    Wang Shijun; Wang Shulin;
    Journal of Data Acquisition and Processing, 1995, 10 (2): 112-123. 
    Abstract   PDF(239KB) ( 1320 )  
    We have developed a fuzzy neural expert system that has the precisionand learning ability of a neural network. Knowledge is acquired from domainexperts as fuzzy rules and membership functions. Then, they are convertedinto a neural network which implements fuzzy inference without rule matching.The neural network is applied to problem-solving and learns from the dataobtained during operation to enhance the accuracy The learning ability of theneural network makes it easy to modify the membership functions defi…
    High-Order Two-Dimension Cluster Competitive Activation Mechanisms Used for Performing Symbolic Logic Algorithms of Problem Solving
    Shuai Dianxun;
    Journal of Data Acquisition and Processing, 1995, 10 (2): 124-133. 
    Abstract   PDF(444KB) ( 1375 )  
    This paper presents a neural network approach, based on high-order two-dimension temporal and dynamically clustering competitive activation mecha-nisms, to implement parallel searching algorithm and many other symbolic logicalgorithms. This approach is superior in many respects to both the commonsequential algorithms of symbolic logic and the common neura.l network usedfor optimization problems. Simulations of problem solving examples prove theeffectiveness of the approach.
    Query Optimization for Deductive Databases
    Zhou Aoying; Shi Baile;
    Journal of Data Acquisition and Processing, 1995, 10 (2): 134-148. 
    Abstract   PDF(306KB) ( 1924 )  
    A systematic, efficient compilation method for query evaluation of DeductiveDatabases (DeDB) is proposed in this paper. In order to eliminate redundancyand to minimize the potentially relevant facts, which are two key issues to theefficiency of a DeDB, the compilation process is decomposed into two phases.The first is the pre-compilation phase, which is responsible for the minimiza-tion of the potentially relevant facts. The second, which we refer to as thegeneral compilation phase, is responsible for the e…
    Optimization of Multi-Join Queries in Shared-Nothing Systems
    Kian-Lee Tan;
    Journal of Data Acquisition and Processing, 1995, 10 (2): 149-162. 
    Abstract   PDF(622KB) ( 1140 )  
    This paper proposes a semi-greedy framework for optimizing multi-joinqueries in shared-nothing systems. The plan generated by the framework com-prises several pipelines, each performing several joins. The framework deter-mines the "optimal" number of joins to be performed in each pipeline. Thedecisions are made based on the cost estimation of the entire processing plan.Two ekisting optimization algorithms are extended under the framework. Ananalytical model is presented and used to compare the quality of pl…
    The Modelling of Temporal Data in the Relational Database Environment
    Sun Yuan;
    Journal of Data Acquisition and Processing, 1995, 10 (2): 163-174. 
    Abstract   PDF(498KB) ( 1350 )  
    This research takes the view that the modelling of temporal data is a fundamental step towards the solution of capturing semantics of time. The problemsinhereat in the mod6iling of time are not unique to datahase processing. Therepresentation of temporal knowledge and temporal reasoning arises in a widerange of other disciplines. ln this paper an account is given of a techniquefor modelling the semantics of temporal data and its associated normalizationmcthod. It discusses the techniques of processing tempo…
    Translational Semantics for a Conceptual Level Query Language
    Hock C. Chan;
    Journal of Data Acquisition and Processing, 1995, 10 (2): 175-187. 
    Abstract   PDF(297KB) ( 1210 )  
    A conceptual level database language for the entity relationship (ER) modelimplicitly contains integrities basic to ER concepts and special retrieval seman-tics for inheritances of attributes and relationships. Prolog, which belongs tothe logical and physical level, cannot be used as a foundation to directly definethe database language. It is shown how Prolog can be enhanced to under-stand the concepts of entities, relationships, attributes and is-a relationships.The enhanced Prolog is then used as a founda…
    Rendezvous Facilities in a Distributed Computer System
    Liao Xianzhi; Jin Lan;
    Journal of Data Acquisition and Processing, 1995, 10 (2): 188-192. 
    Abstract   PDF(215KB) ( 1463 )  
    The distributed computer system described in this paper is a set of computernodes interconnected in an interconnection network via packet-switching interfaces.The nodes communicate with each other by means of message-passing protocols. Thispaper presents the implementation of rendezvous facilities as highlevel prhoitives provided by a parallel programming language to support interprocess cornmunication andsynchronisation.
SCImago Journal & Country Rank
 

ISSN 1004-9037

         

Home
Editorial Board
Author Guidelines
Subscription
Journal of Data Acquisition and Processing
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China

E-mail: info@sjcjycl.cn
 
  Copyright ©2015 JCST, All Rights Reserved