Design of Feedback Shift Register of Against Power Analysis Attack

Stream ciphers based on linear feedback shift register (LFSR) are suitable for constrained environments, such as satellite communications, radio frequency identification devices tag, sensor networks and Internet of Things, due to its simple hardware structures, high speed encryption and lower power consumption. LFSR, as a cryptographic primitive, has been used to generate a maximum period sequence. Because the switching of the status bits is regular, the power consumption of the LFSR is correlated in a linear way. As a result, the power consumption characteristics of stream cipher based on LFSR are vulnerable to leaking initialization vectors under the power attacks. In this paper, a new design of LFSR against power attacks is proposed. The power consumption characteristics of LFSR can be masked by using an additional LFSR and confused by adding a new filter Boolean function and a flip-flop. The design method has been implemented easily by circuits in this new design in comparison with the others.     

成品油长输管道泄漏事故树风险分析

分析了某在建成品油长输管道投运后可能导致泄漏事故的诸因素,建立了泄漏事故树模型。通过泄漏事故树的最小径集以及基本事件的结构重要度对泄漏事件做了定性分析,识别引起管道泄漏的主要因素,提出了安全防范措施,为更好地实施长输管道安全管理提供重要依据。     

Computer generation of detailed reaction networks in hydrocracking of Fischer-Tropsch wax

Fischer-Tropsch synthesis (FTS) wax is a mixture of linear hydrocarbons with carbon number from C7 to C70+.Converting FTS wax into high-quality diesel (no sulfur and nitrogen contents) by hydrocracking technology is attractive in economy and practicability.Kinetic study of the hydrocracking of FTS wax in elementary step level is very challenging because of the huge amounts of reactions and species involved.Generation of reaction networks for hydrocracking of FTS wax in which the chain length goes up to C70 is described on the basis of Boolean adjacency matrixes.Each of the species (including paraffins,olefins and carbenium ions) involved in the elementary steps is represented digitally by using a(N + 3) × N matrix,in which a group of standardized numbering rules are designed to guarantee the unique identity of the species.Subsequently,the elementary steps are expressed by computer-aided matrix transformations in terms of proposed reaction rules.Dynamic memory allocation is used in spe-cies storage and a characteristic vector with nine elements is designed to store the key information of a(N + 3) × N matrix,which obviously reduces computer memory consumption and improves computing efficiency.The detailed reaction networks of FTS wax hydrocracking can be generated smoothly and accu-rately by the current method.The work is the basis of advanced elementary-step-level kinetic modeling.     

基于配用电数据关联的中压配电网断线故障诊断方法

基于配用电信息系统数据和关联规则算法,提出一种诊断中压配电网分支线断线不接地故障的方法。通过分析相互关联的配用电信息系统数据,提出基于数据特征选择的关联规则挖掘方法,并通过卡方分裂算法将连续型特征量转换为布尔型特征量,同时采用MSApriori算法解决故障信息中的稀有项问题,然后在此基础上应用kulc准则消除冗余规则以形成约简的代表规则家族。以华东某地区配用电信息系统中的历史数据为依据进行实际算例分析,结果说明所提出的方法能够大量减少无效挖掘,显著提高效率和准确度,适用于中压配电网断线故障的在线诊断。     

云服务平台多层网络协同控制模型

面向制造业产业链上中下游大规模多类型企业群,针对产业链协同云计算服务平台的访问控制问题,提出多类型协同的多层级体系控制机制。基于SaaS/PaaS的云服务模式,从云服务平台产业链的业务协作与访问控制协同出发,给出多层次、分体系的平台访问控制方案。利用各体系层次的关联关系,构建了多维关系布尔矩阵。利用语义关系将布尔关系矩阵转化为多层级体系复杂网络控制模型,并对网络模型进行了仿真实现,给出了模型的实际应用方案及效果。该网络模型改进了传统的基于角色的访问控制静态控制模式,且具有较好的稳定性与扩展性,为解决大规模企业群在角色层次授权多样化、权限体系动态变化过程中的云服务平台访问控制问题,提供了较好的理论支撑。     

Generating effective test cases based on satisfiability modulo theory solvers for service‐oriented workflow applications

Web Service Business Process Execution Language (WS‐BPEL) is one of the most popular service‐oriented workflow applications. The unique features (e.g. dead path elimination semantics and correlation mechanism) of WS‐BPEL applications have raised enormous problems to its test case generation, especially in unit testing. Existing studies mainly assume that each path in the control flow graphs that correspond to WS‐BPEL applications is feasible, which always yields imprecise test cases or complicates testing results. The current study tackles this problem based on satisfiability modulo theory solvers. First, a new coverage criterion is proposed to measure the quality of test sets for testing WS‐BPEL applications. Second, decomposition algorithms are presented to obtain test paths that meet the proposed coverage criterion. Finally, this paper symbolically encodes each test path with several constraints by capturing the unique features of WS‐BPEL. These constraints are solved and the test cases (test paths and test data) are obtained with the help of satisfiability modulo theory solvers to test WS‐BPEL applications effectively. Experiments are conducted using our approach and other typical approaches (e.g. message‐sequence generation‐based approach and concurrent path analysis approach) with 10 WS‐BPEL applications. Experimental results demonstrate that the test cases generated by our approach can avoid instantiating idle instance and expose more faults. Copyright © 2015 John Wiley & Sons, Ltd.     

基于可满足性计数的(≠,=)约束工作流鲁棒性验证

工作流将业务过程分解为有序的步骤并分配人力资源加以执行.资源分配受访问控制约束及资源异常干扰,存在可满足性和鲁棒性问题.而其鲁棒性验证又依赖于其可满足性判定,目前通过求可满足性的一个解来完成.本文提出另一种途径,通过统计解的个数来完成判定.特别地,通过多项式计数归约为有求解器可用的#SAT问题,给出了互斥和绑定约束下的可满足性计数算法.实验表明,相对目前时间复杂度最低的可满足性求解算法,该可满足性计数算法显著提高了实际判定效率和适用规模.     

临界布尔网络的函数泛化问题研究

布尔网络是研究基因调控网络的一种非常重要的模型,通过时序数据推理基因之间的调控关系是研究网络动态行为和干预策略的基础.现有的预测研究主要集中在基因之间的调控关系,而对调控基因与目标基因之间的布尔函数的作用方式研究甚少.由于基因调控网络是一种处于有序和无序之间的临界网络,本文研究了众数规则、基于偏斜和基于互信息的三种泛化方法对临界布尔网络的稳态分布距离和灵敏度误差的影响.结果表明合理的泛化能够明显提高预测网络的稳态分布距离和灵敏度误差指标.三种泛化方法中,基于互信息的泛化方法的总体性能最好.