Program Perspectives: A Relational Representation of Measurement Data

This paper concems the representation and processing of data resulting from the measurement of programs written in high-level programming languages. The value of various "perspectives" of measurement results, especially in languages having many levels of activity, is illustrated. A representation of measurement data based on ideas from relational data bases is presented, in which perspectives can be represented as hierarchically-organized permuted projections of measurement data. Applications described include measurement of Snobol4 and Fortran programs.     

Symbolic Representation of Abstract Concepts

Symbolic representation of two abstract concepts used in road signs, type of message and prohibition, was investigated. The use of two coding variables, colour and shape, was found to be unnecessary in most cases—the shape of the sign alone proved sufficient to convey these concepts. In the case of the concept of prohibition, the two signs used were found to differ in the degree of prohibitivcness which they conveyed. The concrete version, which included an interdictory stroke through concrete symbols, elicited the most explicitly prohibitive interpretations.     

A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars

This paper solves a natural but still open question: can abstract categorial grammars (ACGs) respresent usual categorial grammars? Despite their name and their claim to be a unifying framework, up to now there was no faithful representation of usual categorial grammars in ACGs. This paper shows that Non-Associative Lambek grammars as well as their derivations can be defined using ACGs of order two. To conclude, the outcome of such a representation are discussed.     

Abstract Data Type Specification in the Affirm System

This paper describes the data type definition facilities of the AFFIRM system for program specification and verification. Following an overview of the system, we review the rewrite rule concepts that form the theoretical basis for its data type facilities. The main emphasis is on methods of ensuring convergence (finite and unique termination) of sets of rewrite rules and on the relation of this property to the equational and inductive proof theories of data types.     

Relational Analysis and Precision via Probabilistic Abstract Interpretation

Within the context of a quantitative generalisation of the well established framework of Abstract Interpretation – i.e. Probabilistic Abstract Interpretation – we investigate a quantitative notion of precision which allows us to compare analyses on the basis of their expected exactness for a given program. We illustrate this approach by considering various types of numerical abstractions of the values of variables for independent analysis as well as weakly and fully relational analysis. We utilise for this a linear operator semantics of a simple imperative programming language. In this setting, fully relational dependencies are realised via the tensor product. Independent analyses and weakly relational analyses are realised as abstractions of the fully relational analysis.     

Software Design Representation Using Abstract Process Networks

An approach to software design representation which is consistent with the concept of engineering blueprints is presented. The main criteria for software engineering blueprints are defined and a network scheme of graphical representation is considered through an overview of Petri net techniques. The concept of an abstract process (AP) is introduced as the basic element of system representation. An abstract process network schema of software design representation is developed and supported by an algebraic system of notation. Methods of AP-net construction are presented and illustrated by examples. The advantages of using the proposed approach in different phases of software engineering are pointed out and the main directions for further research have been identified.     

用扩充的面向对象模型表达抽象概念的方法

给出了抽象函数类的面向对象表示方法,用引入自由变量的概念扩充面向对象的建模方法,同时讨论了面向对象的模型中自由变量的性质,并介绍了模糊对象建模中有关抽象函数类的构造方法。     

System R: A Relational Data Base Management System

A relational approach makes this experimental data base management system unusually easy to install and use. Some of the decisions made in System R design in order to enhance usability also offer major bonuses in other areas.     

A System of Relational Syllogistic Incorporating Full Boolean Reasoning

We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: $$\begin{array}{ll}\mathbf{Some}\, a \,{\rm are} \,R-{\rm related}\, {\rm to}\, \mathbf{some} \,b;\\ \mathbf{Some}\, a \,{\rm are}\,R-{\rm related}\, {\rm to}\, \mathbf{all}\, b;\\ \mathbf{All}\, a\, {\rm are}\,R-{\rm related}\, {\rm to}\, \mathbf{some}\, b;\\ \mathbf{All}\, a\, {\rm are}\,R-{\rm related}\, {\rm to}\, \mathbf{all} \,b.\end{array}$$ Such primitives formalize sentences from natural language like ‘All students read some textbooks’. Here a, b denote arbitrary sets (of objects), and R denotes an arbitrary binary relation between objects. The language of the logic contains only variables denoting sets, determining the class of set terms, and variables denoting binary relations between objects, determining the class of relational terms. Both classes of terms are closed under the standard Boolean operations. The set of relational terms is also closed under taking the converse of a relation. The results of the paper are the completeness theorem with respect to the intended semantics and the computational complexity of the satisfiability problem.     

决策支持系统相关技术综述

决策支持系统是现代化管理的重要手段,数据挖掘、数据仓库、在线分析又是它的三个主要技术,主要从特点、应用现状、涉及到的问题、技术基础等方面对其采用的三个技术作了详细介绍。     

鱼病诊断专家系统中知识表示的研究

根据建造鱼病诊断专家系统的要求,论文提出了系统的鱼病知识表示策略:首先将鱼病诊断知识抽象为概念化、形式化模型,然后将概念化、形式化模型转化为基于关系数据库的鱼病知识表示模型,该策略对构造鱼病诊断专家系统具有重要的理论与实践指导意义。     

Granularity in Relational Formalisms—With Application to Time and Space Representation

Temporal and spatial phenomena can be seen at a more or less precise granularity, depending on the kind of perceivable details. As a consequence, the relationship between two objects may differ depending on the granularity considered. When merging representations of different granularity, this may raise problems. This paper presents general rules of granularity conversion in relation algebras. Granularity is considered independently of the specific relation algebra, by investigating operators for converting a representation from one granularity to another and presenting six constraints that they must satisfy. The constraints are shown to be independent and consistent and general results about the existence of such operators are provided. The constraints are used to generate the unique pairs of operators for converting qualitative temporal relationships (upward and downward) from one granularity to another. Then two fundamental constructors (product and weakening) are presented: they permit the generation of new qualitative systems (e.g. space algebra) from existing ones. They are shown to preserve most of the properties of granularity conversion operators.     

A GENERAL APPROACH TO THE STUDY OF SPATIAL SYSTEMS;I. The Relational Representation of Measurable Attributes

In this, the First part of a two part work, a general model of spatial organization is introduced. Following a brief synopsis of some of Spinoza's and Leibniz's views regarding natural structure, an extension of the Spinozian model is presented in which the attribute spatial extension is portrayed as a relational system that implicitly underlies the differentiation of sensible space into “modifications” (“natural systems”) and the latter's subdifferentiation into “modes” On the basis of this model, all instances of modal differentiation are understood to take place in a manner explained by this relational structure, the existence (but not the specific characteristics) of which is initially assumed. The nature of the structure is then deduced according to a “most-probable-state” kind of logic; next, it is demonstrated via simulation that the resulting aspatial model of internal relations has a corresponding spatial interpretation (and therefore, in theory, that sensible space structures can be supported by the particular rational ordering posed). The matter of how to apply the model to the study of real world systems is taken up last; discussion focuses on related aspects of the treatment of equilibrium and nonequilibrium systems and the recognition and measurement of modal structures.     

HiSQL: A Front-end Query System for Historical Relational Databases

The paper describes a prototype system called HiSQL (Historical SQL) which extends the functionality of SQL in manipulating historical data, by providing functions for spatial and temporal processing. Conceptually the paper is divided into three parts: the first part deals with the design and architecture of the system; the second part introduces a case study (the defters); and the third part describes specific functions for spatial and temporal processing of serial documents. The paper concludes with a comparison between HiSQL and SQL and suggestions for further work. This revised version was published online in August 2006 with corrections to the Cover Date.     

HiSQL: A Front-end Query System for Historical Relational Databases

The paper describes a prototype system called HiSQL (Historical SQL) which extends the functionality of SQL in manipulating historical data, by providing functions for spatial and temporal processing. Conceptually the paper is divided into three parts: the first part deals with the design and architecture of the system; the second part introduces a case study (the defters); and the third part describes specific functions for spatial and temporal processing of serial documents. The paper concludes with a comparison between HiSQL and SQL and suggestions for further work. This revised version was published online in August 2006 with corrections to the Cover Date.     

智能组卷系统中专家知识的表示与实现

该文对组卷问题进行了深入的研究,确定了组卷问题中一类专家知识,并给出了相应的表现形式和实现途径。实验表明,将这类专家知识应用到组卷系统中使系统能很好地模拟人的思维,实现智能组卷。     

一种用于文章推荐系统中的用户模型表示方法

分析了现有文章推荐系统中基于关键词向量的用户模型表示方法存在的不足，提出了基于聚类兴趣点的用户模型表示方法。该方法可通过文章聚类形成兴趣点。由于传统的基于划分的聚类算法存在的不足，提出了基于复杂网络特征的文章聚类算法。实验结果表明该用户模型的表示方法较好地反映了用户多方面的兴趣，提高了文章推荐系统的性能。     

一种用于文章推荐系统中的用户模型表示方法

分析了现有文章推荐系统中基于关键词向量的用户模型表示方法存在的不足,提出了基于聚类兴趣点的用户模型表示方法。该方法可通过文章聚类形成兴趣点。由于传统的基于划分的聚类算法存在的不足,提出了基于复杂网络特征的文章聚类算法。实验结果表明该用户模型的表示方法较好地反映了用户多方面的兴趣,提高了文章推荐系统的性能。