虚拟企业中的知识扩散与技术创新

采用知识链方法对虚拟企业的技术和知识扩散与创新的方式和途径进行了初步探索，将虚拟企业中知识扩散方式分为传播扩散型、培养指导型和互动创造型三类模式；同时，认为信任机制是实现虚拟企业中成员企业知识特别是隐形知识的交流与共享的前提，是实现技术和知识创新的基础。     

面向对象机器翻译知识库IMT—KB的设计与实现

机器翻译知识库是机译系统的重要组成部分,针对传统机译知识库的不足之处,本文提出一种面向对象的机译知识体系结构,同时给出这种具有层次性和模块性机译知识库的存储组织和管理机制。     

对象模型及其模型化方法——一种深知识的表示模型

本文介绍了对象模型和深知识等概念,在这些概念的基础上还讨论了基于框架知识表示形式的复杂系统的模型化方法.文中给出的模型化方法是通过 ISA 关系和 PART-OF 关系的相结合而形成的.这种模型化方法可用于基于深知识的设计型、分析型以及控制型等类型的专家系统.     

ID-based non-interactive zero-knowledge proof system based on one-out-of-two non-interactive oblivious transfer

In this paper, we propose an ID-based non-interactive zero-knowledge proof system based on the 1-out-of-2 noninteractive oblivious transfer protocol. This zero-knowledge proof system is secure against a newly discovered cheating attack.     

交错群A_5的4度连通对称图的分类

一个图Г称为G-对称的(symmetric).如果其同构群Aut(r)的一个子群G在图r的有向孤集(set of ordered pairs of adjacent vertices)上的作用是传递的(transitive).本文主要结果是:设图Г是4度对称图.全自同构群Aut(r)=A_5,则图r是且仅是如下图之一:(1)Г是15个点的完全图K_5的三维覆盖(3-fold cover)图.(2)Г是完全图K_5.     

OPTIMUM-AIV: A planning and scheduling system for spacecraft AIV

This paper presents a project undertaken for the European Space Agency (ESA). The project is developing a knowledge based system for planning and scheduling of activities for spacecraft assembly, integration and verification (AIV). The system extends to the monitoring of plan execution and the plan repair phases.

The objectives of the contract are to develop an operational kernel of a planning, scheduling and plan repair tool, called OPTIMUM-AIV, and to provide facilities which will allow individual projects to customize the kernel to suit its specific needs. The kernel shall consist of a set of software functionalities for assistance in the initial specification of the AIV plan, in the verification and generation of valid plans and schedules for the AIV activities, and in interactive monitoring and execution problem recovery for the detailed AIV plans. Embedded in OPTIMUM-AIV are external interfaces which allow integration with alternative scheduling systems and project databases.

The current status of the OPTIMUM-AIV project, as of May 1991, is that the architectural design of the system has been agreed on by ESTEC/ESA and detailed design and implementation is now underway, expecting a final delivery in October of 1991.     

R－X图解法计算多级串联理想混合反应器

论述Ｒ－Ｘ图解法计算多级串联理想混合反应器的基本原理，并结合实例，对Ｒ－Ｘ法的计算步骤予以详细介绍，为多级串联反应器的设计与计算，提供一种新颖适用的图解计算方法。     

Fast Recognition of Fibonacci Cubes

Fibonacci cubes are induced subgraphs of hypercubes based on Fibonacci strings. They were introduced to represent interconnection networks as an alternative to the hypercube networks. We derive a characterization of Fibonacci cubes founded on the concept of resonance graphs. The characterization is the basis for an algorithm which recognizes these graphs in O(mlog n) time. A. Vesel supported by the Ministry of Science of Slovenia under the grant 0101-P-297.     

Longest fault-free paths in hypercubes with vertex faults

The hypercube is one of the most versatile and efficient interconnection networks (networks for short) so far discovered for parallel computation. Let f denote the number of faulty vertices in an n-cube. This study demonstrates that when f ? n − 2, the n-cube contains a fault-free path with length at least 2ⁿ − 2f − 1 (or 2ⁿ − 2f − 2) between two arbitrary vertices of odd (or even) distance. Since an n-cube is a bipartite graph with two partite sets of equal size, the path is longest in the worst-case. Furthermore, since the connectivity of an n-cube is n, the n-cube cannot tolerate n − 1 faulty vertices. Hence, our result is optimal.