结合公钥加密和关键字可搜索加密的加密方案

带关键字搜索的公钥加密(PEKS)是一种有用的加密原语，它允许用户将在加密数据上搜索的功能委托给不可信的第三方服务器，而不影响原始数据的安全性和隐私性。但是，由于缺乏对于数据的加密以及解密能力，PEKS方案不能单独进行使用，必须与标准的公钥加密方案(PKE)相结合。因此，Baek等人在2006年引入了一种新的加密原语，称为结合PKE和PEKS的加密方案(PKE+PEKS)，它同时提供了PKE和PEKS的功能。目前，已有文献提出了几种PKE+PEKS方案。然而，他们都没有考虑关键字猜测攻击的问题。本文提出一个新的高效且能够抵抗关键字猜测攻击的PKE+PEKS方案，与已有方案相比，该方案在性能上有很大的提升，并且在生成关键字和数据密文时，不需要使用双线性对，极大地降低了计算和存储成本。安全性分析表明，本文中所提出的方案能够满足密文隐私安全性、陷门不可区分性和抗关键字猜测攻击的安全性。效率分析表明，本分提出的方案更加高效。     

条件概率关系数据库模型

现实世界中大量存在着的不确定性信息，关系数据库模型仅视它们为空值，有必要增强其处理这类信息的能力，文章在总结前人工作的基础上推广关系数据库模型，创建有效处理随机型不确定性信息的条件概念关系数据库模型，该模型通过在关系模式中增加一个条件概率测度属性，为每条记录指定适当的条件概率的途径，来表示不确定性信息。文中以对象码为基本工具，创建了条件概率关系结构；以特征函数为基本工具，定义了一套基于该结构的代数运算规则。条件概率的语意比概率的语意广泛，灵活，因而该模型能有效克服概率关系模型的许多不足。     

Markov analysis of qualitative dynamics1

Common sense sometimes predicts events to be likely or unlikely rather than merely possible. We extend methods of qualitative reasoning to predict the relative likelihoods of possible qualitative behaviors by viewing the dynamics of a system as a Markov chain over its transition graph. This involves adding qualitative or quantitative estimates of transition probabilities to each of the transitions and applying the standard theory of Markov chains to distinguish persistent states from transient states and to calculate recurrence times, settling times, and probabilities for ending up in each state. Much of the analysis depends solely on qualitative estimates of transition probabilities, which follow directly from theoretical considerations and which lead to qualitative predictions about entire classes of systems. Quantitative estimates for specific systems are derived empirically and lead to qualitative and quantitative conclusions, most of which are insensitive to small perturbations in the estimated transition probabilities. The algorithms are straightforward and efficient.     

Inference and learning in hybrid probabilistic network

This paper proposed a novel hybrid probabilistic network, which is a good tradeoff between the model complexity and learnability in practice. It relaxes the conditional independence assumptions of Naive Bayes while still permitting efficient inference and learning. Experimental studies on a set of natural domains prove its clear advantages with respect to the generalization ability.     

Probabilistic analysis of uncertainties in seismic hazard assessment

Sources and current methods of analysis of uncertainty from randomness, fuzziness and ignorance or incomplete knowledge in seismic hazard assessment problem are briefly discussed at beginning; understandings of the authors are then presented in the following order. All three types of uncertainty come from incomplete knowledge. Probabilistic method can be applied to all of them, objective probability for random factors and subjective probability for the other two types of uncertain factors. Discrete subjective probability mass functions for incomplete and fuzzy factors can be obtained from logic-tree and membership functions respectively. Fractile curves may be used to show the scattering of any uncertainty factor, but a unified probabilistic treatment may be applied to any combination of all three types of uncertainty.     

基于邻域统计特性的概率神经网络及其在自动目标识别中的应用

在概率神经的一种改进模型－ＦＤＯ网络的基础上，提出在设计网络收敛域时进一步考虑每一像素点周围８邻域的影响，对网络的作用函数加以修，使改进后的网络具有稳定性好且收敛速度快的优点。通过实验对改进前后网络的识别性能加以比较，证明改进后的网络特别适用于噪声图像的识别。     

Algebraic properties of cryptosystem PGM

In the late 1970s Magliveras invented a private-key cryptographic system calledPermutation Group Mappings (PGM). PGM is based on the prolific existence of certain kinds of factorization sets, calledlogarithmic signatures, for finite permutation groups. PGM is an endomorphic system with message space ℤ_|G| for a given finite permutation groupG. In this paper we prove several algebraic properties of PGM. We show that the set of PGM transformations ℐ _G is not closed under functional composition and hence not a group. This set is 2-transitive on ℤ_|G| if the underlying groupG is not hamiltonian and not abelian. Moreover, if the order ofG is not a power of 2, then the set of transformations contains an odd permutation. An important consequence of these results is that the group generated by the set of transformations is nearly always the symmetric group ℒ_|G|. Thus, allowing multiple encryption, any permutation of the message space is attainable. This property is one of the strongest security conditions that can be offered by a private-key encryption system. S. S. Magliveras was supported in part by NSF/NSA Grant Number MDA904-82-H0001, by U.S. West Communications, and by the Center for Communication and Information Science of the University of Nebraska.     

后桥壳的可靠性优化设计

该文讨论了后桥壳的可靠性优化设计问题.在基本随机变量的概率特性已知的情况下,应用随机摄动法和约束随机方向法对后桥壳进行可靠性优化设计,并编制了实用的计算机程序,可以迅速准确地得到后桥壳的可靠性设计参数.     

基于"替换法"的汉字加、解密实现技术

文章讨论的基于“替换法”的汉字信息加、解密实现技术,改变了传统的汉字加密结果,使加密后的密文仍是可以识别和再利用的汉字,发送者可以在任何可编辑汉字的通讯设备上发送和接收密文,确保中文信息传输过程中的安全性。加、解密算法实现的代码语言为VFP6.0。