基于代理随机数的低成本RFID安全协议

针对低成本电子标签安全隐私保护能力和防跟踪能力较弱的问题,采用读写器代理生成随机数的方法,提出一种面向大容量被动型标签的新型无线射频识别(RFID)安全认证协议。理论分析证明,该协议具有前向安全性,能够防止位置隐私攻击、窃听攻击,保障数据的保密性、可靠性和一致性,且硬件复杂度较低,适用于低成本电子标签。     

A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity

This paper proposes a two-stage stochastic programming model for the parallel machine scheduling problem where the objective is to determine the machines' capacities that maximize the expected net profit of on-time jobs when the due dates are uncertain. The stochastic model decomposes the problem into two stages: The first (FS) determines the optimal capacities of the machines whereas the second (SS) computes an estimate of the expected profit of the on-time jobs for given machines' capacities. For a given sample of due dates, SS reduces to the deterministic parallel weighted number of on-time jobs problem which can be solved using the efficient branch and bound of M’Hallah and Bulfin [16]. FS is tackled using a sample average approximation (SAA) sampling approach which iteratively solves the problem for a number of random samples of due dates. SAA converges to the optimum in the expected sense as the sample size increases. In this implementation, SAA applies a ranking and selection procedure to obtain a good estimate of the expected profit with a reduced number of random samples. Extensive computational experiments show the efficacy of the stochastic model.     

The (strong) rainbow connection numbers of Cayley graphs on Abelian groups

A path in an edge-colored graph G, whose adjacent edges may have the same color, is called a rainbow path if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the minimum integer i for which there exists an i-edge-coloring of G such that every two distinct vertices of G are connected by a rainbow path. The strong rainbow connection number src(G) of G is the minimum integer i for which there exists an i-edge-coloring of G such that every two distinct vertices u and v of G are connected by a rainbow path of length d(u,v). In this paper, we give upper and lower bounds of the (strong) rainbow connection numbers of Cayley graphs on Abelian groups. Moreover, we determine the (strong) rainbow connection numbers of some special cases.     

一种求解Ramsey数的DNA计算机算法

Ramsey理论是组合数学中一个庞大而又丰富的领域,在集合论、逻辑学、分析以及代数学上具有极重要的应用.Ramsey数的求解是非常困难的,迄今为止只求出9个Ramsey数的准确值.探讨了DNA生物分子超级计算在求解这一困难数学问题的可能性.将Adleman-Lipton模型生物操作与粘贴模型解空间相结合的DNA计算模型...     

基于模糊层次分析法的计算机网络安全评价

根据计算机网络的特点及网络安全涉及的因素,建立计算机网络安全评价的层次结构模型,运用基于三角模糊数的模糊层次分析法实现对网络安全的综合量化评价。实例的计算结果表明模糊层次分析法适用于定性判断的量化综合,它为计算机网络安全评价提供了一种探索性方法。     

Perturbation analysis and condition numbers of symmetric algebraic Riccati equations

This paper is devoted to the perturbation analysis of symmetric algebraic Riccati equations. Based on our perturbation analysis, the upper bounds for the normwise, mixed and componentwise condition numbers are presented. The results are demonstrated by our preliminary numerical experiments.     

Compensation of unknown sinusoidal disturbances in linear plants of arbitrary relative degree

A new algorithm is proposed for compensating parametrically uncertain harmonic disturbances. In contrast to the known results, the compensation is carried out in the situation where only the output variable and the control signal are measured, and the relative degree of the plant is arbitrary.     

Optimality conditions of sliding modes and the maximum principle for control problems with the scalar argument

Various types of optimality criteria and conditions, which define the set of admissible solution, are brought to the canonical form. For the problem set in this form, the optimality conditions of sliding modes are stated. It is shown that the optimality conditions emerge from these conditions in the form of the maximum principle for problems with a scalar argument and an arbitrary combination of the optimality criterion and constraints.     

On calculation of the power indices with allowance for the agent preferences

In the general case, complexity of the algorithm to calculate the power indices grows exponentially with the number of voting agents. Yet the volume of calculations may be reduced dramatically if many coalitions have equal numbers of votes. The well-known algorithm for calculation of the Banzhaf and Shapley-Shubik indices was generalized, which enables fast calculation of the power indices where entry of the voting agent into a coalition depends on its preferences over the set of the rest of agents.     

Robust control of composite beams

The structure uncertainty effect is considered on actively controllable composite beam that is a part of the structure of a civil building in a seismodangerous zone. The solution of the problem for active control of vibrations of the composite beam is based on the introduction of a simplified model of sensors and an actuator, which are implemented in the form of piezoelectric plates pasted on two opposite planes of the beam. A suggestion is made of the practical approach that affords the robust control of the composite beam and is founded on the modern H ₂- and H _∞-methods of the theory of control. The effectiveness of the suggested approach for the suppression of vibrations of the composite beam under consideration is illustrated by the examples of numerical modeling.