利用有限域上的向量空间构作一种新的A~2-码

利用有限域上的向量空间的子空间作了一个A~2-码,并计算了该码的参数.在假定发方编码规则和收方解码规则按等概率分布选取时,计算了各种攻击成功的概率.     

数据库中布尔型及广义模糊加权关联规则的挖掘

引入布尔型加权关联规则和广义模糊加权关联规则的概念,并分别给出挖掘这些规则的计算方法．     

总体协差阵为单位阵的最小距离判别

本引进最小距离域定义,得到了确定最小距离域的计算方法。在马氏距离判别定理的基础上,确定了最小距离判别规则,得到了利用该规则的判别方法。     

利用辛几何构作两类Cartesian认证码

本文利用辛几何构作了两类 Cartesian认证码 ,计算了码的参数 .当编码规则按等概率分布选取时 ,计算出敌方成功的模仿攻击概率和成功的替换攻击概率     

基于直觉模糊决策粗糙集的三支决策

基于决策粗糙集的三支决策是解决风险决策问题的一种经典方法,利用贝叶斯决策理论生成决策规则。决策规则具有正域、边界域、负域三个区域特征,对应的决策分别为接受决策、延迟决策和拒绝决策。本文将决策粗糙集模型对象之间的等价关系转变为具有自反性和对称性的直觉模糊关系,通过直觉模糊事件概率度量,定义了贝叶斯决策理论中对象状态与对象描述之间的条件概率。将决策损失与直觉模糊数相结合计算对象分类的预期损失,进而由贝叶斯决策理论引导的最小风险决策规则推导出相应的正域、负域、边界域的决策规则。当决策损失满足一定大小关系时将决策规则进行化简,计算出简化决策规则中的阈值与决策损失之间的关系,并且由简化决策规则定义了直觉模糊决策粗糙集的上、下近似。最后将构造的直觉模糊决策粗糙集的三支决策模型应用到直觉模糊概率决策系统,在已知的决策损失下得到相应的决策规则。     

利用辛对合矩阵构造Cartesian认证码

利用辛对合矩阵构作了一个C artesian认证码,并且计算了其参数.假设编码规则是按均匀概率分布选取时,计算了模仿攻击成功的概率PI和替换攻击成功的概率PS.     

利用辛几何构作两类Cartesian认真码

本利用辛几何构作了两类Carteisan认证码,计算了码的参数,当编码规则按等概率分布选取时,计算出敌方成功的模仿攻击概率和成功的替掀攻击概率。     

全方位搜索的亚基迭代算法

文章改进了单纯形算法中的进基规则和迭代方式,与原始单纯形算法相比,能够有效地减少迭代次数,提高计算速度     

区间值信息系统上决策规则的获取与优化

以区间值信息系统上的变精度相容关系所确定的极大变精度相容类作为的基本知识,在相似水平不变的情形下,提出了极大变精度相容类的属性描述、相对约简、决策规则及相对最优决策规则等概念.最后,针对极大变精度相容类,定义了一种基于区分矩阵的区分函数,并通过计算区分函数的析取范式得到获取区间值信息系统相对最优决策规则的具体操作方法.     

带仲裁的认证码的一个新构造

基于群在集合上的作用和非线性函数构造了一类新的带仲裁的认证码,计算了该码的各种参数,并在假定收方和发方编码规则服从均匀概率分布的情况下,计算了该码受到的五种攻击成功的概率.     

Computation of equivalent inherent rounding errors in the solution of a set of linear equations

Equivalent inherent rounding errors (E.I.R.E.) are defined as perturbations on the given data, such that the computed solution is the exact solution of the problem with perturbed data. Almost minimal E.I.R.E. are computed for solutions of consistent sets of linear equations (with one or more right hand sides). Non consistent sets are also treated, but their computed E.I.R.E. cannot be proven almost minimal in all cases.     

某型工程车系统可靠性分析

本应用失效树分析法,以某型工程车进行了可靠性分析,建立了该系统的失效树,在此基础上用最小割集法和系统失效树的可靠性仿真法计算了该系统的可靠性参数,并对一些结果进行了比较。     

利用有限域上酉几何构作带仲裁的认证码

利用有限域上酉几何构作一类新的带仲裁的认证码,并且计算了所构作认证码的参数以及各种攻击成功的概率.     

利用有限域上奇异伪辛几何构作具有仲裁的认证码

A construction of authentication codes with arbitration from singular pseudo-symplectic geometry over finite fields is given and the parameters of the code are computed. Under the assumption that the encoding rules of the transmitter and the receiver are chosen according to a uniform probability distribution, the probabilities of success for different types of deceptions are also computed.     

Solution of a kinetic equation for diatomic gas with the use of differential scattering cross sections computed by the method of classical trajectories

A collision integral is constructed taking into account the rotational degrees of freedom of the gas molecules. Its truncation error is shown to be second order in the rotational velocity mesh size. In the solution of the kinetic equation, the resulting collision integral is directly computed using a projection method. Preliminarily, the differential scattering cross sections of nitrogen molecules are computed by applying the method of classical trajectories. The resulting cross section values are tabulated in multimillion data arrays. The one-dimensional problems of shock wave structure and heat transfer between two plates are computed as tests, and the results are compared with experimental data. The convergence of the results with decreasing rotational velocity mesh size is analyzed.     

Construction of Cartesian Authentication Codes from Pseudo Symplectic Geometry of Even Dimension

§１．ＩｎｔｒｏｄｕｃｔｉｏｎＬｅｔＳ,ＥａｎｄＭｂｅｔｈｒｅｅｎｏｎ－ｅｍｐｔｙｆｉｎｉｔｅｓｅｔｓａｎｄｌｅｔｆ：Ｓ×Ｅ→Ｍｂｅａｍａｐ．Ｔｈｅｆｏｕｒｔｕｐｌｅ（Ｓ,Ｅ,Ｍ;ｆ）ｉｓｃａｌｅｄａｎａｕｔｈｅｎｔｉｃａｔｉｏｎｃｏｄｅ（ｓｅｅ［１...     

Discrete ill-posed least-squares problems with a solution norm constraint

Straightforward solution of discrete ill-posed least-squares problems with error-contaminated data does not, in general, give meaningful results, because propagated error destroys the computed solution. Error propagation can be reduced by imposing constraints on the computed solution. A commonly used constraint is the discrepancy principle, which bounds the norm of the computed solution when applied in conjunction with Tikhonov regularization. Another approach, which recently has received considerable attention, is to explicitly impose a constraint on the norm of the computed solution. For instance, the computed solution may be required to have the same Euclidean norm as the unknown solution of the error-free least-squares problem. We compare these approaches and discuss numerical methods for their implementation, among them a new implementation of the Arnoldi–Tikhonov method. Also solution methods which use both the discrepancy principle and a solution norm constraint are considered.     

利用有限域上反对称矩阵的标准型构作卡氏认证码

利用有限域上反对称矩阵的标准型构作了一个迪卡尔认证码并计算出该码的所有参数. 进而,假定编码规则按照统一的概率分布所选取,该码的成功伪造与成功替换的最大概率PI与PS亦被计算出来.     

利用奇、偶特征的正交几何构作的最优Cartesian认证码

利用奇、偶特征有限域上的正交几何构作出一类C artesian认证码,并且计算了它们的参数.并在假定按照等概率分布来选择编码规则下,求出了认证码的成功的模仿攻击概率和成功的替换攻击概率.作为一个推论,还得到了一些最优的C artesian认证码.