智能决策支持系统平台协同式客户/服务器体系结构模型的设计与实现

智能决策支持系统（ＩＤＳＳ）开发工具要真正实用化，必须解决ＩＤＳＳ与计算机主流技术（如多媒体用户界面、网络通信、数据库等）的集成方法。本文提出在主流技术上集成ＩＤＳＳ的开发思想：将模型计算与知识推理从具体的ＩＤＳＳ中分离出来，并当成一种可共享的资源，然后建立一协同式客户／服务器计算环境（ＣｏｏｐｅｒａｔｉｖｅＣｌｉｅｎｔ／ＳｅｒｖｅｒＣｏｍｐｕｔｉｎｇＥｎｖｉｒｏｎｍｅｎｔ，ＣＣＳＥ），将模型计算与知识推理作为一种特殊的数据处理服务，统一由一组协同式服务器提供；ＣＣＳＥ支持客户使用确定的应用程序接口（ＡＰＩ），以透明的、规范的形式请求服务器提供服务；这样可以采用常规工具（如Ｃ＋＋语言）开发ＩＤＳＳ系统，也就允许ＩＤＳＳ与计算机主流技术进行集成。文章阐述了这一设计的合理性，讨论了ＣＣＳＥ的体系结构和实现技术     

面向MIS的结构化需求分析CASE环境

本文首先修正了结构化需求分析方法以适应支持该方法ＣＡＳＥ环境的开发；然后介绍了一个面向ＭＩＳ的需求分析系统（ＳＡ－ＣＡＳＥ）的系统结构和设计思想。该环境是一个支持结构化分析方法的需求分析集成工具系统，使用本系统可辅助完成需求分析工作，提高了ＭＩＳ的开发质量与自动化程度。     

青鸟Ⅱ型系统面向对象语言CASEC＋＋的设计和实现

ＣＡＳＥＣ＋＋语言是面向对象的ＣＡＳＥ环境青鸟Ⅱ型系统中设计、实现的一个与Ｃ＋＋完全兼容并支持永久对象的面向对象程序设计语言．在青鸟Ⅱ型系统中，它是对象管理系统ＯＭＳ（ｏｂｊｅｃｔｍａｎａｇｅｍｅｎｔｓｙｓｔｅｍ）的操纵语言和所有集成工具的编程语言，同时也是支持最终用户的通用的编程语言．本文首先简要介绍了ＣＡＳＥＣ＋＋的设计背景．然后，较详细地讨论了ＣＡＳＥＣ＋＋中新引入的语言成份：永久对象；类定义的共享机制；永久对象间的关系描述──链和对象的内容等．最后，给出了实现方法．     

STEP信息集成软件工具的设计和实现

ＳＴＥＰ是国际标准化组织ＩＳＯ正在组织开发的应用于计算机集成制造系统（ＣＩＭＳ）信息集成的产品数据表达与交换标准，ＳＴＥＰ不仅是一种规范，更是一种信息集成技术，本文以ＣＡＤ／ＣＡＰＰ／ＣＡＭ系统集成为背景，提出了ＳＴＥＰ信息集成支持工具ＥｘＴｒａ的设计和实现技术，该软件工具已成功且有效地应用于ＣＡＤ／ＣＡＰＰ／ＣＡＭ系统集成中。     

HIT－IIS：开放式CIM集成基础结构系统

计算机集成制造系统（ＣＩＭＳ）的集成基础结构作为企业范围的应用软件平台为ＣＩＭ系统提供了一组实现企业信息集成、功能集成所需的基本信息处理和通信公共服务集合。它是ＣＩＭ系统的基础支撑环境。本文提出了一个开放式ＣＩＭ集成基础结构样机系统ＨＩＴ－ＩＩＳ的设计方案，并提出了该系统的实现途径。     

并行工程环境中的信息资源字典系统

并行工程（ＣＥ）的信息种类繁多，结构复杂，并且数据量非常大，需要存储在异构分散的数据库中，为方便应用和各种ＣＥ工具的集成，需对它们对行统一管理。信息资源字典系统（ＩＲＤＳ）从广义的概念上支持三模式结构，是ＣＥ信息集成的有效工具。文章介绍一个ＩＲＤＳ系统的开发，它有在并概念，三模式结构及在ＣＥ信息管理中的应用。     

分布计算环境的实现技术

本文论述了分布式计算环境以及远过程调用、线程、目录服务等支持机制的概念；并以ＯＳＦ（ＯｐｅｎＳｏｆｔｗａｒｅＦｏｕｎｄａｔｉｏｎ）ＤＣＥ（ＤｉｓｔｒｉｂｕｔｅｄＣｏｍｐｕｔｉｎｇＥｎｖｉｒｏｒｍｅｎｔ）１．０为实例介绍ＤＣＥ的实现技术。ＯＳＦＤＣＥ提供了建立一个分布式应用的基础结构，随着它的逐步完善，建立在其上的分布式应用的增多，它趋向于成为分布式应用的标准平台。     

智能决策支持系统平台协同式客户／服务器体系结构模型的…

智能决策支持系统（ＩＤＳＳ）开发工具要真正实用化，必须解决ＩＤＳＳ与计算机主流技术（如多媒体用户界面、网络通信、数据库等）的集成方法。本文提出在主流技术上集成ＩＤＳＳ的开发思想；将模型计算与知识推理从具体的ＩＤＳＳ中分离出来，并当成一种可共享的资源，然后建立一协同式客户／服务器计算环境，将模型计算与知识推理作为一种特殊的数据处理服务，统一由一组协同式服务器提供；ＣＣＳＥ支持客户使用确定的应用程序接     

仓库技术

仓库技术是支持软件工程集成环境的必要手段之一，也是支持ＣＡＤ／ＣＡＭ等复杂数据处理的重要方法。本文围绕仓库的概念，发展及其实现作了一些讨论，同时，还进一步讨论层次数据库管理系统（ＨＤＢＭＳ），网状数据库管理系统（ＮＤＢＭＳ），关系数据库管理系统（ＲＤＢＭＳ），面向对象的数据库管理系统（ＯＯＤＢＭＳ），知识库管理系统（ＫＢＭＳ）在仓库技术的实现中所扮演的角色。     

青鸟II型系统面向对象语言CASE C＋＋的设计和实现

ＣＡＳＥ Ｃ＋＋语言是面向对象的ＣＡＳＥ环境青鸟Ⅱ型系统中设计、实现的一个与Ｃ＋＋完全兼容并支持永久对象的面向对象程序设计语言。在青鸟Ⅱ型系统中，它是对象管理系统ＯＭＳ的操纵语言和所有集成工具的编程语言，同时也是支持最终用户的通用的编程语言。本文首先简要介绍了ＣＡＳＥ Ｃ＋＋的设计背景。然后，较详细地讨论了ＣＡＳＥ Ｃ＋＋中新引入的语言成份：永久对象；类定义的共享机制；永久对象间的关系描述－链和对     

一种异构数据源模型转换和模式集成框架

异构数据源集成系统的主要任务是屏蔽数据源数据模型的异构性,提供对数据的统一访问。公共数据模型、模型变换和中间数据模型被广泛用来解决该问题。由于数据集成工作的工作量和任务对象日益复杂、规模日趋庞大,仅采用公共数据模型不能满足现有集成要求。异构数据源数据模型内在的关联性虽然使得面向语义集成变得更加复杂,但更利于模型转换方法在数据集成中的应用。模型转换是模式集成的基础,本文给出了异构数据源模型的形式化描述方法和基础模型转换操作形式化框架。该框架能够保证模型、实例和约束三者的相互独立,适用于大多数基础数据模型及其之间的转换和集成应用。通过该框架可简化和规范异构数据源数据模型转换和模式集成过程。     

Resolution of Semantic Heterogeneity in Database Schema Integration Using Formal Ontologies

This paper addresses the problem of handling semantic heterogeneity during database schema integration. We focus on the semantics of terms used as identifiers in schema definitions. Our solution does not rely on the names of the schema elements or the structure of the schemas. Instead, we utilize formal ontologies consisting of intensional definitions of terms represented in a logical language. The approach is based on similarity relations between intensional definitions in different ontologies. We present the definitions of similarity relations based on intensional definitions in formal ontologies. The extensional consequences of intensional relations are addressed. The paper shows how similarity relations are discovered by a reasoning system using a higher-level ontology. These similarity relations are then used to derive an integrated schema in two steps. First, we show how to use similarity relations to generate the class hierarchy of the global schema. Second, we explain how to enhance the class definitions with attributes. This approach reduces the cost of generating or re-generating global schemas for tightly-coupled federated databases.     

Semantic schema theory for genetic programming

Schema theory is the most well-known model of evolutionary algorithms. Imitating from genetic algorithms (GA), nearly all schemata defined for genetic programming (GP) refer to a set of points in the search space that share some syntactic characteristics. In GP, syntactically similar individuals do not necessarily have similar semantics. The instances of a syntactic schema do not behave similarly, hence the corresponding schema theory becomes unreliable. Therefore, these theories have been rarely used to improve the performance of GP. The main objective of this study is to propose a schema theory which could be a more realistic model for GP and could be potentially employed for improving GP in practice. To achieve this aim, the concept of semantic schema is introduced. This schema partitions the search space according to semantics of trees, regardless of their syntactic variety. We interpret the semantics of a tree in terms of the mutual information between its output and the target. The semantic schema is characterized by a set of semantic building blocks and their joint probability distribution. After introducing the semantic building blocks, an algorithm for finding them in a given population is presented. An extraction method that looks for the most significant schema of the population is provided. Moreover, an exact microscopic schema theorem is suggested that predicts the expected number of schema samples in the next generation. Experimental results demonstrate the capability of the proposed schema definition in representing the semantics of the schema instances. It is also revealed that the semantic schema theorem estimation is more realistic than previously defined schemata.     

A comprehensive database schema integration method based on the theory of formal concepts

Integrating heterogeneous database schemata is a major task in federated database design where preexisting and heterogeneous database systems need to be integrated virtually by providing a homogenization database interface. Most proposed schema integration methods suffer from very complex result schemata and insufficient handling of extensional relations, i.e. in the way how redundant data of the input systems are dealt with. Redundancy among the input systems may thus remain undetected and, hence, remains uncontrolled.Our GIM (Generic Integration Model) method is based on the elegant and mathematically founded theory of formal concept analysis (FCA). The main idea is to integrate schemata into one formal context which is a binary relation between a set of attributes and a set of base extensions (set of potential objects). From that context we apply an FCA-algorithm to semi-automatically derive a concept lattice which we interpret as an inheritance hierarchy of classes for a homogenized schema. Thus, the integration task following our method can be supported by tools.     

Semantic schema refinements for multilevel schema integration

Within the database field, schema refinements have been proved useful for documentation and maintenance purposes; moreover, schemata describing the reality of interest at different levels of abstraction are extensively used in Computer Aided Software Engineering tools and visual query languages. So, much effort has been spent in analyzing schema transformations and schema refinements. Till now, however, while the syntaxof schema transformations has been deeply investigated, the semantics has been very often neglected. In this paper we present a full formal framework, supporting both the syntax and the semantics of schema refinements. Such a formal framework is used to support a methodology able to merge a set of schemata and the top-down chains of refinement planes produced during their design. The result of this kind of integration, that we call multilevel integration, is an integrated schema plus an associated top-down chain of schemata. The integrated schema and the chain are related to the input schemata by interesting properties, giving rise to a two-dimensional structure useful for exploring the data content of complex information systems.     

Instance-based domain ontological view creation towards semantic integration

In many domains today there are very limited explicit ontologies established for implementing information systems. Traditional ontology-driven semantic integration approaches cannot be directly applied in integrating these information systems. Usually, the information systems have schemas, a type of formal information model, for their information repositories which to some extent imply the semantics of the information. Each schema actually reflects a specific view of the domain conceptualization. This paper investigates the theoretical foundation of ontologies and extends the traditional ontology concept to the ontological view concept. It proposes to use ontological views to address the challenge of semantic integration. The proposed approach adopts the schemas to create local ontological views, uses data instances of the information systems to discover semantic relationships between the concepts within the ontological views, and builds a domain ontological view based on the discovered equivalence mappings. It applies the hierarchical clustering technique on the data instances and, in the further analysis, uses the clusters to reduce the cost of processing a large amount of data. The matching of concept properties is based on the probability distribution of the data instances. The experimental results have demonstrated the effectiveness of this approach.     

Enhancing OODB semantics to support browsing in an OODB vocabulary representation

In previous work, we have modeled a vocabulary given as a semantic network by an object‐oriented database (OODB). The OODB schema thus obtained provides a compact abstract view of the vocabulary. This enables the fast traversal of the vocabulary by a user. In the semantic network vocabulary, the IS‐A relationships express the specialization hierarchy. In our OODB modeling of the vocabulary, the SUBCLASS relationship expresses the specialization hierarchy of the classes and supports the inheritance of their properties. A typical IS‐A path in the vocabulary has a corresponding shorter SUBCLASS path in the OODB schema. In this paper we expose several cases where the SUBCLASS hierarchy fails to fully correspond to the IS‐A hierarchy of the vocabulary. In these cases there exist traversal paths in the semantic network for which there are no corresponding traversal paths in the OODB schema. The reason for this failure is the existence of some IS‐A relationships between concepts of two classes, which are not connected by a SUBCLASS relationship. This phenomenon weakens the accuracy of our modeling. To rectify the situation we introduce a new OODB semantic relationship IS‐A to represent the existence of IS‐A relationships between concepts of a pair of classes which are not connected via a SUBCLASS relationship. The resulting schema contains both SUBCLASS relationships and IS‐A relationships which completely model the IS‐A hierarchy of the vocabulary. We define a mixed‐class level traversal path to contain either SUBCLASS or IS‐A relationships. Consequently, each traversal path in the semantic network has a corresponding mixed traversal path in the OODB schema. Hence the introduction of the semantic OODB IS‐A relationship improves the modeling of semantic network vocabularies by OODBs. Copyright © 2003 John Wiley & Sons, Ltd.     

A methodology for integration of heterogeneous databases

The transformation of existing local databases to meet diverse application needs at the global level is performed through a four-layered procedure that stresses total schema integration and virtual integration of local databases. The proposed methodology covers both schema integration and database integration, and uses a four-layered schema architecture (local schemata, local object schemata, global schema, and global view schemata) with each layer presenting an integrated view of the concepts that characterize the layer below. Mechanisms for accomplishing this objective are presented in theoretical terms, along with a running example. Object equivalence classes, property equivalence classes, and other related concepts are discussed in the context of logical integration of heterogeneous schemata, while object instance equivalence classes and property instance equivalence classes, and other related concepts are discussed for data integration purposes. The proposed methodology resolves naming conflicts, scaling conflicts, type conflicts, and level of abstraction, and other types of conflicts during schema integration, and data inconsistencies during data integration     

形式概念分析在本体构建中的应用

随着信息共享和数据交换的范围不断扩大,语义数据集成成为数据库技术研究中的热点。本体作为共享概念的形式化说明,用于表达数据源的语义、识别和建立概念间的语义关联、达成语义一致,提供了语义异构问题的解决途径。传统的关系数据库由于具备技术成熟、应用广泛、数据管理能力强、数据安全程度高等特点,依然是数据存储的主要手段。然而,关系数据只表达了"属性/值"二元关系,不具备语义描述的能力,如何在关系数据中直接抽取数据的语义,构建本体,提炼丰富的语义信息,弥补关系数据表的缺陷,是一个重要的研究方向。文中探讨了运用形式概念分析的技术,结合数据库模式及其数据,构建本体的方法。在研究本体构建的基本方法基础上,论述了形式概念分析方法,并结合给定的数据库模式及其数据信息,演示了运用形式概念分析的方法构建本体的过程。     

对象定向概念格的决策约简

研究了基于对象定向概念格的决策形式背景的属性约简的定义和方法。在对象幂集上引入一个等价关系,并介绍了相关性质。提出了决策形式背景的协调性的定义,进而利用等价关系给出了协调决策形式背景的属性约简定义。该定义下的属性约简集能保持由原属性集确定的所有等价类不变的最小属性子集,同时它也能保持所有对象定向概念的外延不变。利用辨识矩阵提出了一种用于计算所有属性约简集的方法。