ODP系统中的观点及观点规范语言

开放分布式处理ＯＤＰ的目标是给应用程序间提供一个一致的接口模型，以实现分布透明性、互操作性和可移植性。开放分布式参考模型ＩＳＯ ＲＭ－ＯＤＰ提供了一个分布式系统的框架，从五个不同的观点描述ＯＤＰ系统，并提出相应的规范语言的概念和构造规则以便对该观点进行描述，本文首先介绍了这五种观点及相应的规范语言的概念和构造规则，并讨论了它们之间的关系。     

开放式分布处理的参考模型

开放式分布处理的参考模型（ＲＭ－ＯＤＰ）是由国际标准化组织ＩＳＯ和ＩＴＵ－Ｔ为开放式分布处理ＯＤＰ而开发的一个协调框架，此模型描述了一个集成的支持分布式，协同工作（ｉｎｔｅｒｗｏｒｋ－ｉｎｇ）的可互操作的和可移植的体系结构，ＲＭ－ＯＤＰ框架用五个观点来定义ＯＤＰ的内容，这五个观点分别是：计划观点，信息观点，计算观点，工程观点和技术观点，本文介绍此参考模型，并且描术其观点和ＯＤＰ的有关功能，以及相应     

一种基于辅助元素的交互式参数化绘图工具

本文介绍了一种新的交互式参数化绘图工具ＯＰＤＴ（Ｏｂｊｅｃｔ－ｏｒｉｅｎｔｅｄ Ｐａｒａｍｅｔｒｉｃａｌ Ｄｒａｆｔｉｎｇ Ｔｏｏｌ）．ＯＰＤＴ通过定义基本几何元素之间的约束关系－－辅助元素来实现交互式参数化绘图。ＯＰＤＴ具有以下特点：使用ＯＰＤＴ建立的参数化模型与设计人员的意图高度一致；绘图过程符合设计人员打样习惯，绘图效率高；尺寸驱动修改图形的算法执行速度快；多个视图保持一致性。此外，ＯＰＤＴ     

基于n值关系语义的命题模态逻辑系统研究

传统的多值模态逻辑系统将关系语义中的状态及状态间的关系进行了多值化处理。然而,实际应用中状态间的关系往往是确定的,无需多值化。针对这种情况,基于?ukasiewicz代数系统提出了一种新的命题模态逻辑n值关系语义。在所提出的n值关系语义中,针对状态进行了多值化处理,同时保持了状态间关系的确定性。通过对逻辑公式的形式化定义以及可满足性和有效性的分析,证明了n值关系语义下经典命题模态逻辑系统K,T,S4和S5的正确性。进一步地,给出了极大一致集与典范模型在n值关系语义下的定义,并完成了上述经典命题模态逻辑系统的完备性证明。上述结论表明基于n值关系语义的命题模态逻辑系统能够涵盖并捕捉到经典逻辑系统中的所有有效命题。综上所述,所提出的基于?ukasiewicz代数系统的n值关系语义提供了一种在实际应用中处理多值状态及确定的状态间关系的方法。这种方法在扩展命题模态逻辑系统的形式化定义与关系语义是可行且有效的。     

ASP访问SQLServer数据库

文章介绍了ＡＳＰ技术,详细阐述了ＡＳＰ通过ＡＤＯ对象来访问ＳＱＬＳｅｒｖｅｒ数据库的方法,结合系统开发的实例对ＡＳＰ调用数据库的存储过程给予详细说明。     

信息系统需求分析的面向对象层次分析方法及应用

文章将面向对象分析（ＯＯＡ）,结构化分析（ＳＡ）和数据结构分析（ＤＳＡ）方法相结合,提出了一种信息系统需求分析的面向对象层次分析方法（ＯＯＨＡ）,给出了对象的属性和方法定义以及需求分析的形式化表示方法。使用ＯＯＨＡ方法进行需求分析,层次清晰,对象关系明确,容易实现问题空间到解空间的映射。     

参数化设计中几何特征变异图元的处理

本文提出了参数化设计块（ＰＤＢ）的概念，为解决几何特征变异的参数化设计提供了一种的途径，利用ＯＯＰ方法，探讨了ＰＤＢ的定义及生成，介绍了采用ＰＤＢ的二维参数化设计系统，并成功地应用在实用的洗衣机ＣＡＤ系统中。     

一种面向对象的多媒体概念模型

本文形式化地提出了一种适用于多媒体对象的概念模型ＯＭＣＯＭ，文中首先分析了多媒体数据模拟的特殊性，探讨了现有的多媒体数据模型的不足，从而提出了多媒体数据模拟划分为概念与表达两级模拟的思想，概念级模拟多媒体对象的内容与结构；表达级模拟其表达，包括多媒体对象之间的时态关系和空间关系，ＯＭＣＯＭ就是一种用于实现概念级模拟模型，然后根据多媒体概念模拟的需求，形式化地定义了ＯＭＣＯＭ的各个构成要素。最后根据     

利用PATHWORKS实现VAX与PC的资源共享

本文介绍了ＰＡＴＨＷＯＲＫＳ的三个主要成分－－磁盘服务、文件服务和打印服务，并阐述了如何通过这些服务来实现ＰＣ上的ＤＯＳ系统与ＶＡＸ／ＶＭＳ系统之间的资源共享。     

HOOD方法与形式化技术的集成研究

ＨＯＯＤ是由欧洲ＥＳＡ公司开发的一种面向对象软件结构设计方法,它使用图形,结构化英语和Ａｄａ伪码来描述系统的设计规约,本文首先概述了ＨＯＯＤ方法的基本概念和对它进行的改进,然后提出了一种集成ＨＯＯＤ和形式化技术的方法,借助该方法可以获得更为严格的软件设计规约,最后简要介绍了其机器支持系统。     

ODP enterprise viewpoint specification

The Open Distributed Processing (ODP) standardisation initiative has led to a framework by which distributed systems can be modelled using a number of viewpoints. These include an enterprise viewpoint, which focuses on the objectives and policies of the enterprise that the system is meant to support. Although the ODP reference model provides abstract languages of relevant concepts, it does not prescribe particular techniques that are to be used in the individual viewpoints. In particular, there is a need to develop appropriate notations for ODP enterprise specification, in order to increase the applicability of the ODP framework. In this paper, we tackle this concern and develop a specification language to support the current draft of the enterprise viewpoint. In doing so, we analyse the current definition of the ODP enterprise viewpoint language. Using the Unified Modelling Language (uml), a meta-model of the core concepts and their relationships is constructed, and we also investigate to what extent the uml can be used for enterprise viewpoint specification. We, then, focus on the expression of enterprise policies that govern the behaviour of enterprise objects. We develop a policy language, which is a combination of structured English and simple predicate logic and is built on top of the formal object-oriented specification language Object-Z, into which the complete language is translated. We illustrate the ideas in the paper with a case study that presents an enterprise specification of a library support system.     

Using Maude to write and execute ODP information viewpoint specifications

The aim of the open distributed processing (ODP) information viewpoint is to describe the semantics of the information and of the information processing in a system, from a global point of view, without having to worry about other considerations, such as how the information will be finally distributed or implemented or the technology used to achieve such implementation. Although several notations have been proposed to model this ODP viewpoint, they are not expressive enough to faithfully represent all the information concepts, or they tend to suffer from a lack of (formal) support, or both. In this paper, we explore the use of Maude as a formal notation for writing ODP information specifications. Maude is an executable rewriting logic language especially well suited for the specification of object-oriented open and distributed systems. We show how Maude offers a simple, natural, and accurate way of modeling the ODP information viewpoint concepts, allows the execution of the specifications produced, and offers good tool support for reasoning about them.     

Writing and executing ODP computational viewpoint specifications using Maude

The Reference Model of Open Distributed Processing (RM-ODP) is a joint standardization effort by ITU-T and ISO/IEC for the specification of large open distributed systems. RM-ODP is becoming increasingly relevant now because the size and complexity of large distributed systems is challenging current software engineering methods and tools, and because international standards have become key to achieve the required interoperability between the different parties and organizations involved in the design and development of complex systems. RM-ODP defines five viewpoints for decomposing the design activity into separate areas of concern. One of the RM-ODP viewpoints, the computational viewpoint, focuses on the basic functionality of the system and its environment, independently of its distribution. Although several notations have been proposed to model the ODP computational viewpoint, either they are not expressive enough to faithfully represent all its concepts, or they tend to suffer from a lack of formal support. In this paper we introduce the use of Maude as a formal notation for writing and executing ODP computational viewpoint specifications. Maude is an executable rewriting logic language specially well suited for the specification of object-oriented open and distributed systems. We show how Maude offers a simple, natural, and accurate way of modeling the ODP computational viewpoint concepts, allows the execution of the specifications produced, and offers good tool support for reasoning about them.     

Structures in systems 2: viewpoint cohomology of general systems

This paper introduces new homology and cohomology functors designed to analyze a broad range of logical systems including representations of enterprise information systems. Such systems contain nested relations and are a class of higher order logic. The homology and cohomology augment simplex constructions with ideas of type extensions to capture the logic of the system. Here logical systems, including large-scale information systems, have a class of derived objects called “scenarios” that give the connective logic of the system. Scenarios have a “secondary” logic derived from the underlying business rules of the enterprise. A “viewpoint” is a flexible classification logic which creates “proxy” variables so that the (co)homology functors can be applied to the secondary (and higher) scenario logics but with different (but functionally related) variables. These viewpoint (co)homologies can then analyze structures in emergent phenomena that reflect structures in the logic of the original system.     

煤炭物流企业协同信息平台的研究

分析了信息平台对煤炭物流企业核心竞争力的影响,提出了一种包括内部管理信息系统和外部信息协同平台的煤炭物流企业协同信息平台体系,探讨了煤炭物流企业建立协同信息平台应注意的问题,并指出可以采取分步实施的方式建立协同信息平台,即首先建立内部管理信息系统,然后建立对外的信息门户,最后再进行一体化的供应链管理,从而实现完整的协同信息平台。     

基于SoA的数据协同模型

传统的企业信息集成采用的是功能驱动的方法,主要用于解决企业数据的分布性与异构等问题,它们通常都忽略了业务逻辑而直接进入到企业业务集成的层次。然而不在数据集成的层次中响应企业业务流程的处理要求,就会直接限制系统的数据处理能力。该文基于用户的业务逻辑,通过事件驱动数据在不同组织或系统间流动来实现数据的集成。这是一种松耦合的数据集成模式,用户通过协同不同系统提供的能力来控制系统的集成行为及数据转换规则,适用于数据共享需求变更频繁的应用集成系统。     

格值模态命题逻辑及其完备性

文中以满足第一及第二无限分配律的完备格为工具,建立了格值模态命题逻辑的语义理论,并指出这种语义是经典模态命题逻辑语义理论及[0,1]值模态命题逻辑语义理论的共同推广.给出了QMR0代数的定义,并分别以Boole代数及QMR0代数为背景构建了Boole型格值模态命题逻辑系统B及QMR0型格值模态命题逻辑系统QML*,并证明了系统B及系统QML*的完备性.     

谓词模态逻辑中变量的严格指派问题

目前,命题模态逻辑已成为人工智能以及计算机科学等其他领域的有效工具,但谓词模态逻辑却不是.关于谓词模态逻辑还存在着很多的争议和问题.表面上看,在命题模态逻辑中添加相应的量词而得到谓词模态逻辑似乎是一件很简单的事情,但是这些新添加的量词却带来了许多的问题和麻烦,例如,变量的严格指派问题、不变论域与可变论域问题、跨界相等问题等.主要研究谓词模态逻辑中变量的严格指派问题.首先,介绍什么是变量的严格指派问题;其次,讨论对于该问题现有的解决办法及所存在的不足;最后,分析造成该问题的深层次原因,并简要介绍该问题的解决办法.     

一种新的类BAN逻辑模态语义模型--兼论类BAN逻辑的语法缺陷

由于类BAN逻辑缺乏明确而清晰的语义,其语法规则和推理的正确性就受到了质疑。本文定义了安全协议的计算模型,在此基础上定义了符合模态逻辑的类BAN逻辑“可能世界”语义模型,并从语义的角度证明了在该模型下的类BAN逻辑语法存在的缺陷,同时,指出了建立或改进类BAN逻辑的方向。     

Theory of （n） truth degrees of formulas in modal logic and a consistency theorem

The theory of (n) truth degrees of formulas is proposed in modal logic for the first time. A consistency theorem is obtained which says that the (n) truth degree of a modality-free formula equals the truth degree of the formula in two-valued propositional logic. Variations of (n) truth degrees of formulas w.r.t. n in temporal logic is investigated. Moreover, the theory of (n) similarity degrees among modal formulas is proposed and the (n) modal logic metric space is derived therefrom which contains the classical logic metric space as a subspace. Finally, a kind of approximate reasoning theory is proposed in modal logic. Supported by the National Natural Science Foundation of China (Grant Nos. 10331010 and 10771129), and the Foundation of 211 Construction of Shaanxi Normal University