一种新的密码本原:棘轮密钥交换的定义、模型及构造

在传统密码学应用中,人们总假定终端是安全的,并且敌手只存在于通信信道上。然而,主流的恶意软件和系统漏洞给终端安全带来了严重和直接的威胁和挑战,例如容易遭受存储内容被病毒破坏、随机数发生器被腐化等各种攻击。更糟糕的是,协议会话通常有较长的生存期,因此需要在较长的时间内存储与会话相关的秘密信息。在这种情况下,有必要设计高强度的安全协议,以对抗可以暴露存储内容和中间计算结果(包括随机数)的敌手。棘轮密钥交换是解决这一问题的一个基本工具。文中综述了密码本原——棘轮密钥交换,包括单向、半双向和双向等棘轮密钥交换的定义、模型及构造,并展望了棘轮密钥交换的未来发展趋势。     

适用于无线体域网的动态口令认证协议

无线体域网中传输的是与生命高度相关的敏感数据，身份认证是信息安全保护的第一道防线。现有的基于人体生物信息的身份认证方案存在信息难提取、偶然性大和误差性大的问题，基于传统密码学的认证方案需较大计算资源和能量消耗，并不适用于无线体域网环境。为此，在动态口令和非对称加密机制基础上，提出一种适用于无线体域网的动态口令双向认证轻量协议，并对其进行形式化分析。通过理论证明、SVO逻辑推理及SPIN模型检测得出：该协议满足双向认证，且能够抵御重放攻击、伪装攻击、拒绝服务器攻击和口令离线攻击，具有较高安全性。     

基于混合蚁群算法的异质车队低碳VRP研究

针对货运车辆在配送调度过程中产生大量碳排放的问题，建立模型将多种影响碳排放量的因素协同优化。模型中考虑了不同载重量的异质车队，两个节点之间有多条道路的柔性路径，以及车辆重量随卸货而减少的动态负载等因素，以碳排放量、行驶时间和行驶路程为优化目标，并加入了节点需求时间窗、根据速度变化划分路段、交接和卸货时间的约束。提出了一种混合蚁群算法，利用蚁群算法信息素强度更新方式保持群体记忆性，利用粒子群算法的快速收敛特性增加计算效率。通过随机数值算例的仿真优化与对比分析，验证了算法和模型的有效性。     

Mathematical formulation and heuristic algorithms for optimisation of auto-part milk-run logistics network considering forward and reverse flow of pallets

The operational planning of distribution network for automotive industry is complex with many conditions to consider, including heterogeneous fleet, enforcing the feasibility of 3D-packing of pallets into vehicles to address the vehicle's capacity in terms of weight and volume, compatibility of orders in a vehicle, returning empty pallets from assembly-plants backwards to suppliers, and delivery time windows. A mathematical model (MILP) is proposed that takes account of these conditions to minimise total transportation costs. The network structure can be a combination of direct shipment and milk-run for both forward and reverse flow of pallets. The model is solved optimally for small-size problems. For solving larger problems, a heuristic algorithm (in two versions) is proposed that uses a similarity measure to generate a reasonable list of orders. Best/first-fit strategies are employed to generate a feasible solution with the aid of a relaxed version of the proposed MILP. Improvement heuristics are also designed. Unlike most of existing constructive heuristics, our aim for developing the heuristic approach is to force routing decision, with all of its considerations, being made optimal. We also use the proposed best-fit strategy in the body of grouping evolution strategy (GES) algorithm to attain an effective meta-heuristic approach. The effectiveness of heuristics is tested on generated instances which demonstrates they are optimal for small-size problems. They are also tested on the data of daily auto-parts shipments gathered from the largest Iranian automobile company. Results demonstrate there exists a significant potential for cost saving through milk-run strategy compared with the direct shipping strategy.     

Airline planning and scheduling: Models and solution methodologies

The airline industry is a representative industry with high cost and low profitability. Therefore, airlines should carefully plan their schedules to ensure that overall profit is maximized. We review the literature on airline planning and scheduling and focus on mathematical formulations and solution methodologies. Our research framework is anchored on three major problems in the airline scheduling, namely, fleet assignment, aircraft routing, and crew scheduling. General formulation, widely used solution approaches, and important extensions are presented for each problem and integrated problems. We conclude the review by identifying promising areas for further research.     

一维—二维耦合的水库下游地区洪水演进数学模型及应用

针对水库下游地区河道洪水与漫堤洪水模拟需求,建立了一维—二维耦合的洪水演进数学模型。一维模型采用Pressimann格式离散求解,二维模型采用能够适应复杂几何形状和多种流态的Osher格式求解,一维—二维连接处采用堰流公式实现水流交互。应用该模型模拟白溪流域2015年"苏迪罗"台风实际洪水,可得到洪水在计算区域的演进过程和淹没情况。对比模拟结果与实际情况可知,该模型计算合理、准确,计算结果可为防汛部门防洪预案制定、防汛调度决策提供技术支撑。     

基于英飞凌TC275的整车控制器CCP协议底层驱动开发

针对以英飞凌TC275单片机为平台的整车控制器,进行控制器局域网络标定协议(controller area network calibration protocol,CCP)底层驱动程序的开发。依据CCP的需求开发了英飞凌TC275的控制器局域网络(controller area network,CAN)模块、系统定时器(system timer,STM)模块和FLASH模块的底层驱动程序,实现CCP标定系统的通信连接、数据上传、数据下载、数据存储等功能。为验证系统的性能,进行整车控制器的实际测试,测试结果表明:所开发的基于TC275单片机的CCP底层驱动程序能够实现CCP的功能要求。     

Effective sampling strategy to detect food and feed contamination: Herbs and spices case

Sampling plans for food safety hazards are aimed to be used to determine whether a lot of food is contaminated (with microbiological or chemical hazards) or not. One of the components of sampling plans is the sampling strategy. The aim of this study was to compare the performance of three different sampling strategies, being simple random sampling (SRS), stratified random sampling (STRS), and systematic sampling (SS), with each other for their probability of detecting a heterogeneously distributed contamination in a lot of herbs or spices (i.e., a dry food product). To this end, a simulation model was developed, and applied to different scenarios for contamination level and numbers of samples collected. In addition, as a case study, the sampling plan of a company processing herbs and spices was evaluated using the simulation model. Results showed that the effectiveness of the sampling plan is influenced by the sampling strategy. With expected low contamination levels the SS strategy performs better than the two other strategies. At higher expected contaminated levels, the STRS strategy is preferred.     

Beta-Binomial删除信道中的喷泉码文件传输协议

由于命名数据网络(NDN,Named-Data Networking)无环路、逐包、逐跳转发的特点,使得数据包回传成功率降低,而传统的TCP/IP协议中的ARQ和ACK机制对于多播会话不再适用.由于NDN中的传输信道可以等效为二进制删除信道,因此可以通过应用层编码来实现文件的可靠传输.传统的信道编码技术如卷积码、级联码和RS码等复杂度较高,而将NDN与低复杂度的喷泉码的结合可以实现分布式的存储架构,因而可通过喷泉编码在应用层协议中实现可靠的纠删机制,保证整体文件的传输可靠性.以往的研究一般是基于确定的删除概率信道模型,但是由于网络的异构性和信道噪声等因素影响,可能会造成信道丢包概率呈随机性分布.因此,本文在Beta-Binomial分布模型的前提下,根据贝叶斯统计的先验信息和中心极限定理,对随机概率下的纠删信道的文件可靠传输协议进行了数学建模和理论推导.仿真结果显示此模型更具有普适性,此传输协议可在信道状况未知的前提下从理论上求出最小发包数,减少冗余编码包,提高文件整体的投递成功率,在保证传输可靠性的同时有效提升协议传输效率.