• Volume 5,Issue 6,1994 Table of Contents
    Select All
    Display Type: |
    • ADAPTIVE HIERARCHICAL VECTOR QUANTIZATION

      1994, 5(6):1-6. CSTR:

      Abstract (3227) HTML (0) PDF 377.32 K (4403) Comment (0) Favorites

      Abstract:This paper proposes an adaptive hierarchical vector quantization method for image coding. First, a basic codebook and the codes are generated adaptively. Then the codes are used to form the second layer codebook. Finally, the codes are coded by the second layer codebook and form a multilayer code sequence. This hierarchical method makes use of the structural features and correlations in larger regions and thus remove much redundance in the codes obtained by a single layer VQ method. A much lower bit rate can beachieved without causing any more distortion and more computation.

    • LEARNING FROM EXPERT ANALYTICAL CASES

      1994, 5(6):7-12. CSTR:

      Abstract (3708) HTML (0) PDF 398.97 K (4642) Comment (0) Favorites

      Abstract:A lot of useful and valuable information may be included in expert analytical cases, which is absent in ordinary cases. Based upon detailed observation and analysis analytical cases, the paper presents an algorithm which can learn five kinds of rules from them.

    • INTERVAL-GAP-BASED REPRESENTATION OF TEMPORAL KNOWLEDGE

      1994, 5(6):13-18. CSTR:

      Abstract (3621) HTML (0) PDF 389.81 K (4029) Comment (0) Favorites

      Abstract:Generally, one way to represent temporal information in a logical formalism is by associating "proposition types" with time points or time intervals. It was pointed out that time intervals are difficult to represent the common sense notion of a single event with "gaps" in [1]. However, the temporal relations of two gap -intervals defined in [1] are expressed in a matrix. The computing amount of temporal relations is so large that the method in [1] is not useful. This paper presents a interval-gap-based representation of temporal knowledge. Its temporal relations are stipulated to 20, and its computing amount is in same level to Allen's.

    • SEMANTIC RELATIONSHIP BETWEEN FUZZY SETS AND ITS APPLICATIONS

      1994, 5(6):19-24. CSTR:

      Abstract (3326) HTML (0) PDF 340.81 K (4369) Comment (0) Favorites

      Abstract:A concept of semantic relationship between fuzzy sets is presented in the paper. The concept is not only related to the membership of the fuzzy sets, but also considered releant to the similarity between elements in the domains of the fuzzy sets. So,it can be used to characterize the similarity between fuzzy sets more meticulously than it was done by the various "distance" or "nearness" previously defined in fuzzy mathematics.There fore, it would have a wide range of applications in AI and other areas, such as information retrieval and text classification. Besides, two algorithms to approximately calculate the semantic relationship are given in the paper.

    • A MATHEMATICAL THEORY FOR WORD CLASSIFICATION

      1994, 5(6):25-31. CSTR:

      Abstract (3513) HTML (0) PDF 392.81 K (4409) Comment (0) Favorites

      Abstract:Word classification is still an open issue for the linguistic research of Chinese.A fixed-point theory of word classification is proposed in this paper. According to our result,the Distributed Analysis (DA) method for word classification can be used in a process of iteration, so that the "logical circle" critique on DA method does not hold. The ideal classification, i. e., the maximal fixed-point, is computable in the limit. This paper therefore cleared out the misunderstandings on DA method among linguists, and proved the distribution criterion to be scientific.

    • NUIDSS: AN INTELLIGENT DECISION SUPPORT SYSTEM

      1994, 5(6):32-38. CSTR:

      Abstract (4397) HTML (0) PDF 415.39 K (4681) Comment (0) Favorites

      Abstract:ntelligent Decision Support Systems are developed at an increasing rate. But there exist many problems of integration of AI and DSS, on which we have done some research while developing the intelligent DSS system, NUIDSS. This paper describes its design and implementation, focusing on model description language, knowledge base and inference. A practical decision instance of emerge is also given in the end.

    • A KIND OF TRIE STRUCTURE

      1994, 5(6):39-44. CSTR:

      Abstract (3914) HTML (0) PDF 435.82 K (4426) Comment (0) Favorites

      Abstract:n this paper, a kind of Trie structure is described. The insertion and search algorithms on this kind of Trie structure are presented. The time complexity the search algorithm is O(lognK). Comparing to prior work, it is a improvement. This paper also presents the search algorithm on this kind of Trie structure stored into an one dimension array.

    • THE DESIGN AND IMPLEMENTATION OF TX──A KERNEL FOR DISTRIBUTED DATABASE SYSTEMS

      1994, 5(6):45-50. CSTR:

      Abstract (3851) HTML (0) PDF 328.35 K (4332) Comment (0) Favorites

      Abstract:This paper presents the design considerations and implementation technics of an open system TX, a kernel for distributed database systems developed by the database group of the computer science department at Tsinghua University from 1987 to 1990. TX has played important roles in their further research on distributed database system,knowledge based system, and hypertext database since it was partially implemented. The focuses of this paper are the architecture, data organization, query, processing, data dictionary, and concurrency control of TX.

    • SOFTWARE ENGINEERING METHOD OF BUILDING EXPERT SYSTEMS

      1994, 5(6):51-57. CSTR:

      Abstract (4381) HTML (0) PDF 406.28 K (4727) Comment (0) Favorites

      Abstract:his paper points out that some problems in designing and maintaining are caused with some inherent difficulties in expert system. The paper makes the suggestion of software engineering method about ES, the knowledge specification (KS) about cognitive process, and PLWF model of the process for building ES. The problems could be solved with PLWF model and KS, in the stage of building ES and in the stage of maintaining ES.

    • A ADT──BASED FUNCTIONAL LANGUAGE AND ITS OPERATIONAL SEMANTICS

      1994, 5(6):58-64. CSTR:

      Abstract (4071) HTML (0) PDF 411.14 K (4301) Comment (0) Favorites

      Abstract:This paper presents a ADT-based functional language which is the functional component of a hybrid language that the authors designed supporting both the functional programming and object -oriented programming, and describes its operational semantics model: polymorphic λ- calculus + algebraic rewriting system = polymorphic λ- rewriting system. Moreover, the Church - Rosser property and strong normalization property of this model are discussed.

Current Issue


Volume , No.

Table of Contents

Archive

Volume

Issue

联系方式
  • 《Journal of Software 》
  • 主办单位:Institute of Software, CAS, China
  • 邮编:100190
  • 电话:010-62562563
  • 电子邮箱:jos@iscas.ac.cn
  • 网址:https://www.jos.org.cn
  • 刊号:ISSN 1000-9825
  •           CN 11-2560/TP
  • 国内定价:70元
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063