基于对象Petri网的离散事件系统建模仿真环境(OPMSE)

首先论述了Ｐｅｔｒｉ网和高级Ｐｅｔｒｉ网发展状况,提出了一种高级Ｐｅｔｒｉ网,即对象Ｐｅｔｒｉ网。然后介绍了基于对象Ｐｅｔｒｉ网的离散事件系统建模仿真环境ＯＰＭＳＥ。文中详细介绍了ＯＰＭＳＥ的特点与组成,并对ＯＰＭＳＥ的核心－对象Ｐｅｔｒｉ网（ＯＰＮ）的语法描述进行了重点介绍。     

基于Petri网模型的主动对象研究

本文分析了Ｐｅｔｒｉ网及其动态行为特性，扩充了事件、条件、动作等成份的内涵，引入了基于Ｐｅｔｒｉ网事件驱动的主动对象模型，并分析了该主动对象的性质，介绍了主动对象的实现     

基于Petri网的超媒体模型HPN

本文提出了一个基于Ｐｅｔｒｉ网的超媒体形式化模型ＨＰＮ。它采用层次组织,各层由一个扩展Ｐｅｔｒｉ网、若干对象以及Ｐｅｔｒｉ网与对象之间的映射表示,通过Ｐｅｔｒｉ网结构和执行语义说明超媒体的连接机制、浏览和媒体表现,具有刻画超媒体主要性质的能力。文中给出了ＨＰＮ模型的模式化定义并举说明其用途。     

模糊Petri网的反馈控制研究

本文首先将模拟技术应用于Ｐｅｔｒｉ网中，得到模糊Ｐｅｔｒｉ网模型，然后基于Ｐｅｔｒｉ网中的库所湾量的概念，在普通Ｐｅｔｒｉ网的反馈控制基础上提出了一种模型Ｐｅｔｒｉ网的反馈控制方法。该方法使得对复杂系统的模糊Ｐｅｔｒｉ多控制器的系统设计成为可能。     

模糊Petri网及知识表示

在建造专家系统中虽然有很多种知识表示方法，但都有不尽人意的地方，本文试图用一种新的方法－Ｐｅｔｒｉ网模型来表示知识。本文给出了Ｆｕｚｚｚｙ Ｐｅｔｒｉ网和广义Ｆｕｚｚｙ Ｐｅｔｒｉ网两种模型，并给出了相应的推理算法，一旦专家知识用Ｐｅｔｒｉ网表示后，根据Ｐｅｔｒｉ网固有的特性，我们就能处理专家系统中并行推理、无回溯推理，反向推理等问题。     

时序逻辑电路的Petri网分析方法

本文应用带抑止弧的增广Ｐｅｔｒｉ网，建立了基本门电路和常用触发器的Ｐｅｔｒｉ网模型，讨论了运用该模型描述同步和异步时序逻辑电路，给出了增广Ｐｅｔｒｉ网的矩阵描述和状态转移方程，在此基础上提出了同步和异步时序逻辑电路统一分析的Ｐｅｔｒｉ网方法。     

资源循环共享的Petri网的形式化设计方法

资源共享是子Ｐｅｔｒｉ网耦合为总网的一种途径，其中对资源循环共享是其重要方式之一。为了研究Ｐｅｔｒｉ网的形式化方法，必须首先研究基于Ｐｅｔｒｉ网的设计，而后研究了Ｐｅｔｒｉ网的耦合，以往的研究多集中于竞争共享资源的方式上，很少涉及循环共享，本文在以往工作的基础上，提出了资源循环共享的Ｐｅｔｒｉ网设计的形式化方法，并给出了两个实例，举例说明了上述形式化设计方法。     

Pumping引理的Petri网描述—Petri网语言属型的一组判定条件

本文通过Ｐｕｍｐｉｎｇ引理在Ｐｅｔｒｉ网的变迁节引发序列中的反映，揭示了对应的Ｐｅｔｒｉ网结构内涵，从而给出判定一个标准Ｐｅｔｒｉ网产生的语言分别为正规语言或上下文无关语言的充要条件，这样，就可以从网的结构直接判断其语言属型。     

逻辑推理中的Petri网应用

本文讨论利用Ｐｅｔｒｉ网实现逻辑问题的推理，首先介绍了逻辑问题的Ｐｅｔｒｉ网模型描述方法，并举例说明了利用矩阵演算实现推理的算法。Ｐｅｔｒｉ网的研究与利用对开发逻辑程序并行性，提高推理效率很有意义。     

使用Petri网T－不变量求解子句的逻辑推论

本文研究了子句逻辑规则的Ｐｅｔｒｉ网模型的表示及使用Ｐｅｔｒｉ网分析方法进行逻辑推论．基于四值逻辑和冲突变迁的概念，表示了非Ｈｏｒｎ子句Ｐｅｔｒｉ网模型的构造，并使用Ｔ－不变量方法解决于句推论问题．另外，本文还显示了向前推论和向后推论在子句Ｐｅｔｒｉ网模型中的应用．     

Iterative inflow-implicit outflow-explicit finite volume scheme for level-set equations on polyhedron meshes

In this paper, we propose a cell-centered finite volume method for advective and normal flows on polyhedron meshes which is second-order accurate in space and time for smooth solutions. In order to overcome a time restriction caused by CFL condition, an implicit time discretization of inflow fluxes and an explicit time discretization of outflow fluxes are used in an iterative procedure. For an efficient computation, an 1-ring face neighborhood structure is introduced. Since it is limited to access unknown variables in an 1-ring face neighborhood structure, an iterative procedure is proposed to resolve the limitation of assembled linear system. Two types of gradient approximations, an inflow-based gradient and an average-based gradient, are studied and compared from the point of numerical accuracy. Numerical schemes are tested for an advective and a normal flow of level-set functions illustrating a behavior of the proposed method for an implicit tracking of a smooth and a piecewise smooth interface.     

The XML Tree Model – toward an XML conceptual schema reversed from XML Schema Definition

XML Schema Definition (XSD) is the logical schemas of an XML model, but there is no standard format for the conceptual schema of an XML model. Therefore, we propose an XML Tree Model (XTM) as an XML conceptual schema for representing data semantics in a diagram, and also as an XML data model validator for confirming the data semantics required by users. An XTM consists of hierarchical nodes representing all the elements, and the data relationships among elements within the XSD. A rule-based algorithm and an information capacity with pre- and post-conditions are developed as the methodology for reverse engineering. The proposed algorithm consists of two rules: General Information Transformation and Data Semantic Recovering to construct an XTM. Users can draw an XTM with data relationships among elements as a result of the reverse engineering.     

房地产评估决策的面向对象模型

建立房地产评估决策支持系统对于科学决策项目，提高项目的经济效益和社会效益至关重要，确定了一个面向对象的房地产开发评估决策模型，以投资酒店项目的决策为例，提出了评估决策知识的面向对象表示法，知识库的组织机制以及主估决策知识的维护机制和推理机制。     

Efficient access control labeling scheme for secure XML query processing

We propose an efficient access control labeling scheme for secure query processing under dynamic Extensible Markup Language (XML) data streams. In recent years, XML has become an active research area. In particular, the needs for an efficient and secure query processing method for dynamic XML data in a ubiquitous data stream environment has become very important. The proposed access control labeling scheme supports the efficient processing of dynamic XML data, eliminating the need for re-labeling and secure query processing. Our proposal has the advantage of having an adaptable access control scheme for an existing XML labeling method.     

Selective disassembly for virtual prototyping as applied to de-manufacturing

Selective disassembly involves separating a selected set of components from an assembly. Applications for selective disassembly include de-manufacturing (maintenance and recycling), and assembling. This paper presents a new methodology for performing design for selective disassembly analysis on the CAD model of an assembly. The methodology involves the following three steps: (i) identifying the components to be selectively disassembled for de-manufacturing by a software program or designer, (ii) determining an optimal (e.g. minimal cost) disassembly sequence for the selected components that involves a computationally efficient two-level reduction procedure: (a) the determination of a set of sequences with an objective of minimal component removals via a wave propagation approach that topologically order components in an assembly for selective disassembly, and (b) the evaluation of resulting sequences based on an objective function (e.g. minimal cost) to identify an optimal sequence, and (iii) Performing disassembly design decisions based on the evaluated optimal sequence. Preliminary implementation results of the selective disassembly methodology in sequencing and disassembly cost evaluation, and application of the selective disassembly technique for de-manufacturing assessment are presented.     

An Interval Hermite-Obreschkoff Method for Computing Rigorous Bounds on the Solution of an Initial Value Problem for an Ordinary Differential Equation

To date, the only effective approach for computing guaranteed bounds on the solution of an initial value problem (IVP) for an ordinary differential equation (ODE) has been interval methods based on Taylor series. This paper derives a new approach, an interval Hermite-Obreschkoff (IHO) method, for computing such enclosures. Compared to interval Taylor series (ITS) methods, for the same stepsize and order, our IHO scheme has a smaller truncation error, better stability, and requires fewer Taylor coefficients and high-order Jacobians.The stability properties of the ITS and IHO methods are investigated. We show as an important by-product of this analysis that the stability of an interval method is determined not only by the stability function of the underlying formula, as in a standard method for an IVP for an ODE, but also by the associated formula for the truncation error.     

构建信息系统的综合防御体系

在为信息系统构建安全体系时,人们往往将注意力放在网络安全和数据安全方面,而软件管理、物理安全等问题却容易被忽视。文章以空军某部综合管理信息系统为例,阐述如何从网络安全、物理安全、软件系统安全、数据安全等多个方面构建信息系统的综合防御体系。     

A successive estimation scheme of an occupation probability†

This paper treats of an estimation problem of an occupation probability of some targets in a Tegion M by an infra-red detector followed by a threshold device in a satellite.

First, a successive estimation scheme is proposed for an estimation problem of an occurrence probability of signal 1 of the 1,0 type binary signal sequence disturbed by some noise. The estimate obtained by this scheme is shown to converge to the true value with probability one and in the mean square. Then, as an application of this scheme for the occurrence probability, an estimation scheme for an occupation probability is proposed. Two examples illustrating the scheme for an occupation probability are presented.     

Fast and simple algorithms to count the number of vertex covers in an interval graph

This study provides the following fast and simple algorithms for an interval graph: (1) an algorithm for counting the number of vertex covers, and (2) an algorithm for counting the number of minimal vertex covers.     

ON MODELING UNCERTAINTY WITH INTERVAL STRUCTURES

In this paper, we introduce the notion of interval structures in an attempt to establish a unified framework for representing uncertain information. Two views are suggested for the interpretation of an interval structure. A typical example using the compatibility view is the rough set model in which the lower and upper approximations form an interval structure. Incidence calculus adopts the allocation view in which an interval structure is defined by the tightest lower and upper incidence bounds. The relationship between interval structures and interval-based numeric belief and plausibility functions is also examined. As an application of the proposed model, an algorithm is developed for computing the tightest incidence bounds.