Bimonthly    Since 1986
ISSN 1004-9037
Indexed in:
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
Distributed by:
China: All Local Post Offices
  • Table of Content
      10 March 1996, Volume 11 Issue 2   
    For Selected: View Abstracts Toggle Thumbnails
    An Operational Approach to Belief Revision
    Zhang Yuping; Li Wei;
    Journal of Data Acquisition and Processing, 1996, 11 (2): 97-107. 
    Abstract   PDF(480KB) ( 1430 )  
    A deduction system, called RE-proof system, is constructed for generating the revisions of first order belief sets. When a belief set is rejected by a given fact, all maximal subsets of the belief set consistent with the fact can be deduced from the proof system. The soundness and completeness of the RE-proof system are proved, which imply that there exists a resolution method to decide whether a revision retains a mtalmal subset of a belief set.
    Belief Revision by Sets of Sentences
    Zhang Dongmo;
    Journal of Data Acquisition and Processing, 1996, 11 (2): 108-125. 
    Abstract   PDF(778KB) ( 1368 )  
    The aim of this paper is to extend the system of belief revision developed by Alchourron, Gardenfors and Makinson (AGM) to a more general framework.This extension enables a treatment of revision not only by single sentences but also by any sets of sentences, especially by infinite sets. The extended revision and contraction operators will be called general ones, respectively. A group of postulates for each operator is provided in such a way that it coincides with AGM's in the limit case. A notion of the nic…
    Some Undecidable Problems on Approximability of NP Optimization Problems
    Jiamg Xiong;
    Journal of Data Acquisition and Processing, 1996, 11 (2): 126-132. 
    Abstract   PDF(313KB) ( 1395 )  
    In this paper some undecidable problems on approximability of NP op-timization problems are investigated. In particular, the following problems are all undecidable: (1) Given an NP optimization problem, is it approal-mable in polynomial time? (2) For any polynomialtime computable function r(n), given a polynomial time approkimable NP optimization problem, has it a polynomialtime approximation algorithm with approkimation performance ratio r(n) (r(n)-approkimable)? (3) For any polynomial-time computable func…
    NNF and NNPrF—Fuzzy Petri Nets Based on Neural Network for Knowledge Representation, Reasoning and Learning
    Zhou Yi; Wu ShiLin;
    Journal of Data Acquisition and Processing, 1996, 11 (2): 133-149. 
    Abstract   PDF(735KB) ( 1355 )  
    This paper proposes NNF - a fuzzy Petri Net system based on neural network for proposition logic representation, and gives the formal definition of NNF. For the NNF model, forward reasoning algorithm, backward reason-ing algorithm and knowledge learning algorithm are discussed based on weight training algorithm of neural network - Back Propagation algorithm. Thus NNF is endowed with the ability of learning a rule. The paper concludes with a discussion on extending NNF to predicate logic, forming NNPrF, and …
    Synchronization-Oriented Placement and Retrieval Strategies for Delay-Sensitive Media Streams
    Zhao Yu; Shi Jiaoying; He Zhijun;
    Journal of Data Acquisition and Processing, 1996, 11 (2): 150-160. 
    Abstract   PDF(467KB) ( 1381 )  
    Multimedia data include text, image, audio and video, etc. Recent deve-lopments and advances in the areas of mass storage technology and high speed networks make it feasible for multimedia computing systems to offer services such as multimedia e-mail, teleconferencing and various vivid games. The stor-age and retrieval of multimedia data are two of the most important technologies in the future multimedia systems. This paper analyzes the synchronization re-quirements of the delay-sensitive media streams, cla…
    Class Based Contextual Logic for DOOD
    Jose K- Raphel; Siu Cheung Hui; Angela Goh;
    Journal of Data Acquisition and Processing, 1996, 11 (2): 161-170. 
    Abstract   PDF(428KB) ( 1312 )  
    Contextual logic provides a mechanism to reason about modules. In this paper, this theory of modules is extended to a context theory of classes where class is in the true spirit of object-oriented databases. The logic, referred to as CLOG,is class-based. CLOG supports class, object identity, multiple role of object,monotonic and non-monotonic inheritance of data a-nd method, method factor-ing, views, derived and query classes. Views and derived classes are queries in themselves- Objects are pure data terms …
    Necessary Conditions of Two-Level Uncertainty Reasoning Model (URM) and the Improvement on It
    Liu Dayou; Zhong Shaochun;
    Journal of Data Acquisition and Processing, 1996, 11 (2): 171-180. 
    Abstract   PDF(219KB) ( 1264 )  
    Based on the previous work, some necessary conditions of the two-level Uncertainty Reasoning Model (URM) are proposed and an improvement on the twcalevel Uan is made that can describe and process the deviation. In addition, the paper presents two theorems for specifying the correctness about the improvement. Finally, the application of the twrvlevel URM is discussed.
    Design Technique of I~2L Circuits Based on Multi-Valued Logic
    Wu Xunwei; Hang Guoqiang;
    Journal of Data Acquisition and Processing, 1996, 11 (2): 181-187. 
    Abstract   PDF(293KB) ( 1414 )  
    This paper proposes the use of the current signal to express logic values and establishes the theory of grounded current switches suitable for I2L circuits.Based on the advantage that current signals are easy to be added, the design technique of I2L circuits by means of the multi-valued current signal is proposed.It is shown that simpler structure of I2L circuits can be obtained with this technique.
    A New Method for Reasoning about Action
    Tang Jie;
    Journal of Data Acquisition and Processing, 1996, 11 (2): 188-192. 
    Abstract   PDF(119KB) ( 1256 )  
    Reasoning about action is an important aspect of common sense reasoning and planning. It gives rise to three classical problems: the frame problem,the qualification problem and the ramification problem. Ekisting approaches cannot deal with these problems efficiently. This paper presents a new method which uses the stratified ATMS for reasoning about action to overcome the limitations of these approaches.
SCImago Journal & Country Rank

ISSN 1004-9037


Editorial Board
Author Guidelines
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