Commitment-based device-pairing protocol with synchronized drawings and comparison metrics

This article presents a new method for pairing devices securely. The commitment-based authentication uses a fuzzy secret that the devices only know approximately. Its novel feature is time-based opening of commitments in a single round. We also introduce a new source for the fuzzy secret: synchronized drawing with two fingers of the same hand on two touch screens or surfaces. The drawings are encoded as strings and compared with an edit-distance metric. A prototype implementation of this surprisingly simple and natural pairing mechanism shows that it accurately differentiates between true positives and man-in-the-middle attackers.     

基于多尺度双线性卷积神经网络的多角度下车型精细识别

针对多角度下车辆出现一定的尺度变化和形变导致很难被准确识别的问题，提出基于多尺度双线性卷积神经网络（MS-B-CNN）的车型精细识别模型。首先，对双线性卷积神经网络（B-CNN）算法进行改进，提出MS-B-CNN算法对不同卷积层的特征进行了多尺度融合，以提高特征表达能力；此外，还采用基于中心损失函数与Softmax损失函数联合学习的策略，在Softmax损失函数基础上分别对训练集每个类别在特征空间维护一个类中心，在训练过程中新增加样本时，网络会约束样本的分类中心距离，以提高多角度情况下的车型识别的能力。实验结果显示，该车型识别模型在CompCars数据集上的正确率达到了93.63%，验证了模型在多角度情况下的准确性和鲁棒性。     

Robust Control of Permanent Magnet Synchronous Motors

In this paper, permanent magnet synchronous motors (PMSMs) are investigated. According to the feature of PMSMs, a novel state equation of PMSMs is obtained by choosing suitable state variables. Based on the state equation, robust controllers are designed via interval matrix and PI control idea. In terms of bilinear matrix inequations, sufficient conditions for the existence of the robust controller are derived. In order to reduce the conservation and the dependence on parameter, the control inputs of PMSMs are divided into two parts, a feedforward control input and a feedback control input, and relevant sufficient conditions for the existence of the controller are obtained. Because of the suitable choice of state variables, the proposed control strategies can cope with the load uncertainty and have robustness for disturbance. Finally, simulations are carried out via Matlab/Simulink soft to verify the effectiveness of the proposed control strategies. The performance of the proposed control strategies are demonstrated by the simulation results.      

On the relationship between squared pairings and plain pairings

In this paper, we investigate the relationship between the squared Weil/Tate pairing and the plain Weil/Tate pairing. Along these lines, we first show that the squared pairing for an arbitrary chosen point can be transformed into the plain pairing for a trace zero point which has a special form to compute them more efficiently. Then the optimizations made for computing squared pairings are combined with the computation of pairings on these trace zero points, to achieve even better performance for the computation of the 4th powered Weil pairing.     

Nonlinear discrete-time models: state-space vs. I/O representations

This paper compares state-space and input–output realizations for nonlinear discrete-time dynamic models. For linear models, these two realizations are essentially equivalent and their structures are closely related, but these statements do not hold for nonlinear models. We illustrate this point with simple, realistic examples for which only one of the two realizations exists or for which both exist but their structures are profoundly different. Overall, the main point of this paper is the importance of the choice of realization in the development of nonlinear dynamic models.     

ID-based threshold decryption secure against adaptive chosen-ciphertext attack

This paper proposes an identity-based threshold decryption scheme IB-ThDec and reduces its security to the Bilinear Diffie-Hellman problem. Compared with previous work, this conceals two pairing computations in the ciphertext validity verification procedure. The formal proof of security of this scheme is provided in the random oracle model. Additionally, we show that IB-ThDec can be applied to the threshold key escrow and the mediated cryptosystems.     

A remark on bilinear systems and moduli spaces of instantons

Explicit equations are given for the moduli space of framed instantons as a quasi-affine variety, based on the representation theory of noncommutative power series, or equivalently, the minimal realization theory of bilinear systems.     

一种基于EPID的安全OA系统

文章对OA系统中存在的安全问题进行了讨论,引人了一种新的基于远程匿名身份认证EPID模式,它能通过保存设备拥有者私密信息的硬件设施进行身份鉴定。一个嵌入EPID私密的硬件设备可以向远程机构证实它的有效性,而不必暴露自己的身份和其他私密信息。可以撤消一个签名的EPID私钥,即使不知道密钥的身份。同时,把EPID和其它的一些方法进行了对比。     

Stability analysis of bilinear systems under aperiodic sampled-data control

This note considers the problem of local stability of bilinear systems with aperiodic sampled-data linear state feedback control. The sampling intervals are time-varying and upper bounded. It is shown that the feasibility of some linear matrix inequalities (LMIs), implies the local asymptotic stability of the sampled-data system in an ellipsoidal region containing the equilibrium. The method is based on the analysis of contractive invariant sets, and it is inspired by the dissipativity theory. The results are illustrated by means of numerical examples.     

基于环境选择和配对选择的多目标粒子群算法

为了使多目标粒子群算法中种群粒子能够快速地收敛于怕累托最优边界,针对标准多目标粒子群算法中缺乏粒子评价标准以及种群个体历史最优值位置和全局最优值位置选择问题,提出了一种基于环境选择和配对选择策略的多目标粒子群算法.该算法在每次迭代时,采用SPEA2中的环境选择和配对选择策略及适应度值计算方法,以此来提高种群粒子之间的信息交换力度,减少标准多目标粒子群算法中大量的随机性,使种群粒子能够更快速地收敛于怕累托最优边界.经典测试函数的仿真实验结果表明,在标准多目标粒子群算法中运用SPEA2的环境选择、配对选择策略和适应度值计算方法,能够使种群粒子更快速地收敛于帕累托最优边界,验证了算法改进的可行性和有效性.