离散事件系统状态反馈控制的几何理论的进一步拓广

本文研究了定义在状态-事件序列上的谓词的离散事件系统的状态反馈控制问题。离散事件系统的数学模型是自动机。状态反馈与闭环过程的关系及许多基本的几何性质得到了详细的阐明;在这些几何背景下,解决了离散事件系统状态反馈控制的拓广问题,包括关于简单谓词与一般谓词的问题。     

公式分层的谓词模态逻辑

由于必然模态词□的引入,谓词模态逻辑的公式在一个可能世界中的真假值可能依赖于其可达的可能世界.在谓词模态逻辑中存在个体跨可能世界相等问题.针对这一问题,Lewis提出了对应物理论,并且在对应物理论中用对应物关系来表示个体跨可能世界相等.但是,当一个对象具有一个以上的对应物时,谓词模态逻辑中的跨可能世界相等关系无法与对应物关系建立一一对应.通过限制谓词模态逻辑中全称量词∀的范围,给出了一种公式分层的谓词模态逻辑.它是谓词模态逻辑的一个子逻辑,并且其语言与谓词模态逻辑的语言是相同的.但其公式是分层定义的,使得∀可以出现在□的范围内,并且□不能出现在∀的范围内.由于任意形如∀x□φ（x）的表达式都不是该逻辑的公式,以量词开头的公式在一个可能世界w中的真假值只依赖于w,该逻辑避免了个体跨可能世界相等问题.给出了该逻辑的语言、语法和语义,并证明了该逻辑是可靠的和完备的.     

一阶谓词逻辑的图形推理法

针对已有一阶谓词逻辑推理方法中存在的推理效率低等问题,研究一种基于谓词/变迁系统的图形推理法。定义了描述谓词间与/或关系的谓词-与/或图,借助谓词-与/或图表示谓词/变迁系统,提出一种实现反向推理的目标制导的图形推理法。该方法推理效率高,较已有的推理方法具有一定的优越性。     

发布订阅系统中Carzaniga匹配算法优化

基于内容的发布订阅系统中应用广泛的Carzaniga算法只支持订阅覆盖,未考虑多个谓词间可能存在的覆盖关系,从而引发事件与订阅较严重重复匹配,降低系统匹配效率,导致系统性能低。针对该问题,该文提出一种改进算法,结合计数法和搜索树匹配策略,利用谓词间的覆盖关系减少重复匹配,划分并行谓词集匹配树加速匹配。实验表明,其进一步减少重复匹配,匹配效率得到一定提高,也提高系统性能和可扩展性,更适用于大规模的发布订阅系统。     

A secure and privacy-preserving word vector training scheme based on functional encryption with inner-product predicates

With the extensive applications of machine learning, it has been witnessed that machine learning has been applied in various fields such as e-commerce, mobile data processing, health analytics and behavioral analytics etc. Word vector training is usually deployed in machine learning to provide a model architecture and optimization, for example, to learn word embeddings from a large amount of datasets. Training word vector in machine learning needs a lot of datasets to train and then outputs a model, however, some of which might contain private and sensitive information, and the training phase will lead to the exposure of the trained model and user datasets. In order to offer utilizable, plausible, and personalized alternatives to users, this process usually also entails a breach of their privacy. For instance, the user data might contain of face,irirs and personal identities etc. This will release serious problem in the machine learning. In this article, we investigate the problem of training high-quality word vectors on encrypted datasets by using privacy-preserving learning algorithms. Firstly, we use a pseudo-random function to generate a statistical token for each word to help build the vocabulary of the word vector. Then we employ functional inner-product encryption to calculate the activation function to obtain the inner product, securely. Finally, we use BGN cryptosystem to encrypt and hide the sensitive datasets, and complete the homomorphic operation over the ciphertexts to perform the training procedure. In order to implement the privacy preservation of word vector training, we propose four privacy-preserving machine learning schemes to provide the privacy protection in our scheme. We analyze the security and efficiency of our protocols and give the numerical experiments. Compared with the existing solutions, it indicates that our scheme can provide a higher efficiency and less communication overhead.     

基于谓词的无线传感器网络水质达标采样算法

水质达标检测是水资源优化利用的基础。利用无线传感器对水质进行采样,通过无线传感器网络将达标结果发送给基站进行融合处理,数据服务器在接收到采样数据后实施应用决策。在无线传感器网络、基站和数据服务器三层结构的基础上讨论基于谓词的水质达标采样算法,对算法进行分析、设计和仿真。实验结果表明,该算法实用且高效。     

基于关键谓词的程序错误定位方法

将程序切片技术应用于程序错误定位可以大量减少需要测试的语句数。提出一种基于关键谓词的程序错误定位方法,从程序中找出能影响输出结果的关键谓词,对该谓词和错误输出语句进行数据切片,并引入代码优先技术。该方法考虑了数据依赖和控制依赖,能实现准确快速的错误定位。     

对加密电子医疗记录有效的连接关键词的搜索

随着云计算的发展,医院或医疗组织为了节省存储资源将加密的电子医疗记录的存储和管理外包给云服务器.尽管加密有助于保护用户数据的机密性,但是对加密的数据执行安全而有效的搜索是一个挑战性的问题.在这篇论文中,我们首先构造了被称为MCKS_I的简单的多域连接关键词搜索（MCKS）方案,该方案仅支持连接相等查询.为了实现更加灵活而复杂的多域关键词连接查询,例如子集查询和范围查询,我们又提出了被称为MCKS_II的提高方案.该方案利用了分层属性的矢量表示方法.这两个方案被证明能抵抗已知明文攻击.大量的分析和实验数据证明我们的方案是很实用的.     

Detecting global predicates in distributed systems with clocks

Summary. This paper proposes a framework for detecting global state predicates in systems of processes with approximately-synchronized real-time clocks. Timestamps from these clocks are used to define two orderings on events: “definitely occurred before” and “possibly occurred before”. These orderings lead naturally to definitions of 3 distinct detection modalities, i.e., 3 meanings of “predicate held during a computation”, namely: (“ possibly held”), (“ definitely held”), and (“ definitely held in a specific global state”). This paper defines these modalities and gives efficient algorithms for detecting them. The algorithms are based on algorithms of Garg and Waldecker, Alagar and Venkatesan, Cooper and Marzullo, and Fromentin and Raynal. Complexity analysis shows that under reasonable assumptions, these real-time-clock-based detection algorithms are less expensive than detection algorithms based on Lamport's happened-before ordering. Sample applications are given to illustrate the benefits of this approach. Received: January 1999 / Accepted: November 1999