(Semi-)Automatically Parsing Private Protocols for In-Vehicle ECU Communications

In-vehicle electronic control unit (ECU) communications generally count on private protocols (defined by the manufacturers) under controller area network (CAN) specifications. Parsing the private protocols for a particular vehicle model would be of great significance in testing the vehicle’s resistance to various attacks, as well as in designing efficient intrusion detection and prevention systems (IDPS) for the vehicle. This paper proposes a suite of methods for parsing ECU private protocols on in-vehicle CAN network. These methods include an algorithm for parsing discrete variables (encoded in a discrete manner, e.g., gear state), an algorithm for parsing continuous variables (encoded in a continuous manner, e.g., vehicle speed), and a parsing method based on upper-layer protocols (e.g., OBD and UDS). Extensive verifications have been performed on five different brands of automobiles (including an electric vehicle) to demonstrate the universality and the correctness of these parsing algorithms. Some parsing tips and experiences are also presented. Our continuous-variables parsing algorithm could run in a semi-automatic manner and the parsing algorithm from upper-layer protocols could execute in a completely automatic manner. One might view the results obtained by our parsing algorithms as an important indicator of penetration testing on in-vehicle CAN network.     

中小私营企业信用行为演化研究

运用演化经济学理论,通过建立中小私营企业信用行为演化博弈模型,研究中小私营企业信用行为演化规律,并用计算机仿真技术展示信用行为的演化方向。研究发现:如果中小私营企业追求短期利益、缺乏第三方公正的惩罚及失信后资产损失小,会造成中小私营企业信用行为演化成不良“锁定”状态。     

民办高校给水排水专业物理化学课教学研究

物理化学是给水排水专业学生一门重要的专业基础课。介绍了作者在民办高校对这门课程教学研究的5点体会：把握课程的主要脉络;理解一个重要的过程--可逆过程; 紧密结合给水排水专业的知识需求授课;讲课尽力做到通俗易懂;适度地表扬和激励学生。     

一种无密钥托管的移动IPv6网络匿名密钥分发协议

针对基于身份的密码体制IBE中固有的密钥托管问题,本文提出了一个移动IPv6网络环境中的无密钥托管匿名密钥生成机制与分发协议.该机制将节点身份认证和密钥生成与分发这两个过程分离,利用不可区分性匿名密文安全性在PKG不知道节点地址的情况下分发私钥给经过身份认证的节点,使得私钥生成中心或认证中心即使被单独攻破,攻击者也无法实现身份碰撞.可将身份认证中心部署于家乡服务器,而将PKG离线部署.经安全性分析,协议有效解决了移动IPv6网络中基于身份密码体制的密钥托管问题.     

Cryptanalysis and Improvement of Quantum Private Comparison Protocol Based on Bell Entangled States

Recently, Liu et al. [Commun. Theor. Phys. 57(2012) 583] proposed a quantum private comparison protocol based on entanglement swapping of Bell states, which aims to securely compare the equality of two participants' information with the help of a semi-honest third party(TP). However, the present study points out there is a fatal loophole in Liu et al.'s protocol, and TP can make Bell-basis measurement to know all the participants' secret inputs without being detected. To fix the problem, a simple solution, which uses one-time eavesdropper checking with decoy photons instead of twice eavesdropper checking with Bell states, is demonstrated. Compared with the original protocol,it not only reduces the Bell states consumption but also simplifies the protocol steps.     

指令驱动市场中的组合下单策略研究

已有研究一般直接假设指令驱动市场中的知情交易者总是选择市价单进行交易，本文则基于现实交易状况．建立了一个理论模型．分析拥有私有信息的知情交易者组合使用限价委托单和市价委托单的决策问题．具体给出了不同私有信息状态下知情交易者的组合下单选择。     

Comments on purification in continuum games

It is pointed out that Corollary 1 in a recent paper by Khan et al. (Int J Game Theory 34:91–104, 2006), presented there as an extension of the Dvoretzky–Wald–Wolfowitz theorem, is a special case of Lyapunov’s theorem for Young measures (Balder in Rend Instit Mat Univ Trieste 31 Suppl. 1:1–69) It is also pointed out that Theorems 1–4 in Khan et al. (Int J Game Theory 34:91–104, 2006) follow from a single strong purification per se result that is already contained, as an implementation of that Lyapunov theorem for Young measures, in the proof of Theorem 2.2.1 in Balder (J Econ Theory 102:437–470, 2002).     

Parallel computer architectures: state of the art and trends

Summary An increasing number of parallel architectures is becoming available for numerically intensive applications. Many chemical problems need intensive calculations due to the complexity of the underlying physical models. Very often these applications show an intrinsic parallelism and therefore can be easily adapted to parallel machines. In the future, in addition to the classical numerically intensive applications, the use of these machines will be extended to a more general purpose use (e.g. data base machines, advanced graphics, AI and expert systems applications, etc.). The principal aim of this paper is to show the state of the art of the commercially available parallel architectures and related trends. A comparison of the main features of shared and distributed memory systems will be presented. The characteristics of coarse and fine grained architectures will be discussed. The analysis will include not only the large-scale machines (usually called supercomputers), but also smaller machines (e.g. minisuper and multicomputers) having a very favourable price/performance ratio.     

基于MAS的智能诊断技术集成方法研究

对于复杂分布式故障诊断的特点,集成多种智能方法求解是一种有效的途径.但如何确定这些诊断方法的相对诊断能力是基于多代理技术的故障诊断系统中的一个关键问题.文章基于问题求解的粒度理论,在对设备故障域进行分解的基础上,提出了基于多代理技术的三层评估模型,不仅能对诊断专家的诊断能力进行评估,而且也能对多诊断专家的协调诊断能力进行评估.该方法简化了问题求解的难度,提高了多专家评价的精度.可广泛应用于多诊断专家代理联盟的创建和诊断结论的融合中.     

Restricted domains,arrow-social welfare functions and noncorruptible and non-manipulable social choice correspondences: The case of private alternatives

An n-person social choice problem is considered in which the alternatives are n dimensional vectors, with the ith component of such a vector being the part of the alternatives affecting individual i alone. Assuming that individuals are selfish (individual i must be indifferent between any two alternatives with the same components), that they may be indifferent among alternatives and that each individual may choose his preferences out of a different set of permissible preferences, we prove that any set of restricted domains of preferences admits an n person non-dictatorial Arrow-type social welfare function if and only if it admits a two-person Arrow-type social welfare function: we characterize all the sets of restricted domains of preferences which admit two-person Arrow-type social welfare functions (and therefore also admit n-person Arrow-type social welfare functions) and then we prove that we also characterized all the sets of restricted domains of preferences which admit nondictatorial, nonmanipulable, noncorruptible and rational social choice correspondences.