A review of current research in manufacturing shop design integration

The importance of the manufacturing shop design in the successful operation of a production system is well documented and, as a result, significant work has been devoted to this area. Due to the inherent complexity of the global shop design problem, much research has focused on individual sub-problems, including the layout of manufacturing resources, the design of the shop aisle network, and the selection of the material handling equipment, rather than addressing the integrated problem directly. This paper reviews literature contributions to shop design integration, as well as partial integration schemes such as the design for operation and control of material handling systems. Furthermore, it examines the ability of models and solution approaches for individual sub-problems of shop design to support integration schemes.     

电力通信综合管理系统

针对阳泉地区深入分析了电力通信管理各方面的需求，阐述了通信系统基于现代计算机网络技术的程序管理的设计方案，给出了一个科学、实用的通信综合管理系统平台。     

基于USB的高速数据采集系统的设计

本文介绍基于ARM7控制芯片S3C44B0X、DSP芯片TMS320VC5409和USB芯片PDIUS-BD12的高速数据采集系统的设计,给出数据采集系统的硬件设计构架,并且阐述各个部分的功能.文中着重讲述系统中USB接口部分的硬件设计、软件开发流程和USB的枚举过程.文中给出USB软件设计分层图,以及USB设备初始化的软件流程图,实现了基于USB接口的高速数据采集系统.     

地区电力通信综合管理系统研究

针对目前地区电力通信系统程序化管理的需求,通过对通信设备的定义以及设备信息点定位方式的确定,阐述了通信系统电路运行管理、工作流程管理、图形管理模块以及相关数据库的设计方法,给出了一个科学、实用并基于网络化的通信综合管理平台。该系统实现了地区电力通信管理工作的程序化、网络化管理,实际应用效果良好,对探索和解决目前日趋复杂的电力通信管理工作具有重要意义。     

基于最优乘子潮流确定静态电压稳定临界点

给出了一种基于最优乘子潮流求静态电压稳定临界点的新方法.与连续潮流或直接法求解电压崩溃点不同,该方法从潮流的可行域外出发,利用潮流迭代过程中最优乘子的值和最小二乘解提供的信息,沿注入功率变化的方向逼近电压崩溃点.给出了判别和计算鞍结型和约束诱导型分岔点的方法,分析了逼近过程中的各种可能情况.对多个算例测试的结果表明:所提出的方法通过几次迭代即可收敛于静态电压稳定临界点,计算结果与应用连续潮流和直接法一致.     

基于混沌理论的交通量实时预测

分析了城市交通的混沌性，根据复杂的城市交通特点，引入了误差反馈系数，改进了混沌时间序列预测方法中的加权一阶局域法和基于最大Lyapunov指数的预测法，并将其成功应用于实时交通量预测．预测结果表明：这两种改进的方法都能较准确地预测交通量，但后者比前者更适合交通量预测，后者的预测误差一般可以控制在5％以下．     

浅析企业新产品开发中若干问题

分析了企业新产品开发活动中存在的各种问题．并对国内企业和国外成熟企业就新产品开发流程作了相应的比较。     

PID控制技术在砌块养护窑中的应用

本文介绍了一种利用S7-200型PLC的PID控制技术来实现砌块养护窑的自动控制系统，详细介绍了系统的硬件配置以及软件设计流程图，并根据模拟实验的编程经验．介绍了编程中的关键问题。     

On the secure implementation of security protocols

We consider the problem of implementing a security protocol in such a manner that secrecy of sensitive data is not jeopardized. Implementation is assumed to take place in the context of an API that provides standard cryptography and communication services. Given a dependency specification, stating how API methods can produce and consume secret information, we propose an information flow property based on the idea of invariance under perturbation, relating observable changes in output to corresponding changes in input. Besides the information flow condition itself, the main contributions of the paper are results relating the admissibility property to a direct flow property in the special case of programs which branch on secrets only in cases permitted by the dependency rules. These results are used to derive an unwinding theorem, reducing a behavioural correctness check (strong bisimulation) to an invariant.     

Coordinated scheduling of production and delivery from multiple plants

This paper deals with the scheduling of orders and vehicle assignment for production and distribution planning in a scenario of no-wait, immediate delivery to the customer site. We first describe the problem and then present an integer programming model that maximizes the weighted value of the orders served. We consider a special case of the problem which can be solved in polinomial time by a minimum cost flow algorithm. Based on this approach we develop a heuristic procedure for the general case. Comparisons with an exact graph-based method attest that our heuristic produces good-quality solutions in short running times.