Service life planning and performance requirements

Service life planning comprises a model for the determination of a reasonable expected service life for buildings and components, and it establishes a routine for the assessment of design alternatives. A design option is considered reasonable when it meets or exceeds performance requirements over time that have been drawn up specifically for the specific project. Due to this assessment reference, there is a very evident link to the concept of performance-based building. Any stakeholder involved in the value chain or in the design process of the building, as well as regulators and building users, can express performance requirements. Identified requirements, both in relevance and in quality, will vary with the stakeholder and his/her perspective of interest. As building sector manufacturers develop most products with reference to standards rather than with reference to specific requirements, there is no direct link from user requirements to the product design. Instead, the building designer has the responsibility to ensure performance requirements are met by the performance of products integrated into the design. As these design decisions also have to be made at the material and component level, a performance-based building would benefit from an established rationale that enables the communication of performance requirements across the relevant system levels in the relevant design processes. A path for the connection of the established concepts of service life planning and performance-based building is presented. The aim is to identify key elements that need to be developed for the successful linkage of performance-based building with service life planning.     

堆底熔穿事故的场外后果及其对策

在压水堆核电站应急计划和应急响应中，堆底熔穿事故占有重要位置。本文用法国核电厂事故源项Ｓ３（对应于堆底熔穿事故）计算了在典型气象条件下的场外放射学的后果，根据一般防护决策原则和我国颁布的干预水平，提出了保护公众的应急防护措施的建议。     

Action semantics-directed prototyping

We present a methodology for compiler synthesis based on Mosses-Watt's action semantics. Each action in action semantics notation is assigned specific “analysis functions”, such as a typing function and a binding-time function. When a language is given an action semantics, the typing and binding-time functions for the individual actions compose into typing and binding-time analyses for the language; these are implemented as the type checker and static semantics processor, respectively, in the synthesized compiler. Other analyses can be similarly formalized and implemented. We show a sample language semantics and its synthesized compiler, and we describe the compiler synthesizer that we have developed.     

SVPWM三相电压型逆变器的仿真研究

以三相电压型逆变器为基础,根据空间矢量脉宽调制（SVPWM）基本原理详细分析研究了电压矢量作用时间和扇区分配问题,以α-β坐标为基础,建立了互差π/3的x-y-z时间坐标系,提出了不同扇区矢量作用时间长短根据期望极值判断的原则。介绍了MATLAB中M文件编程的仿真方法,建立了MATLAB程序嵌入式主要功能模块,逆变器采用数字PID控制,利用Simulink对系统进行了综合仿真分析及试验,给出了仿真及实验波形,为实现SVPWM逆变器的数字控制提供参考。     

绥高#2线线路保护2动作分析

对高岭站2009年6月15日绥高#2线线路保护动作的原因进行深入分析,介绍处理措施。     

PTN网络的二次断纤链路规划算法

在PTN（PacketTransportNetwork）网络规划建设中,需要对光纤链路留出备份带宽,以保证部分光纤断开时,受影响业务有足够的容量进行路由重组。这也是提高网络生存性的有效方法之一。文中首先遍历网络双链路的失效状态,然后断开网络中任意两条链路,通过逐次增加链路容量来保证失效业务能够重组路由;最后提出二次断纤链路容量规划算法并进行试验仿真。结果表明,该算法在节约网络带宽、降低建造成本以及故障容错方面有着良好性能,能够很好应用于传送网络的链路规划中。     

考虑多样化需求的诊疗设备维护和患者调度联合优化研究

针对诊疗设备维护和住院患者候诊难以有效协调的问题,建立了联合优化模型。首先,假设设备具有离散的劣化状态,将设备的劣化过程建模为连续时间马尔可夫链;其次,考虑到患者对诊疗设备的不同功能频率需求,以及不同劣化状态对患者治疗时间、费用的影响,以患者就诊顺序、检查策略、修复策略为决策变量建立了设备维护和患者调度模型;最后,采用改进后的非支配排序遗传算法对多目标问题进行了求解。实验结果验证了设备维护与患者调度联合优化模型的有效性。改进后的算法提高了整体和局部的搜索能力,且具有鲁棒性。     

Mathematical model and discrete artificial Bee Colony algorithm for distributed integrated process planning and scheduling

With the development of the globalization of economy and manufacturing industry, distributed manufacturing mode has become a hot topic in current production research. In the context of distributed manufacturing, one job has different process routes in different workshops because of heterogeneous manufacturing resources and manufacturing environments in each factory. Considering the heterogeneous process planning problems and shop scheduling problems simultaneously can take advantage of the characteristics of distributed factories to finish the processing task well. Thus, a novel network-based mixed-integer linear programming (MILP) model is established for distributed integrated process planning and scheduling problem (DIPPS). The paper designs a new encoding method based on the process network and its OR-nodes, and then proposes a discrete artificial bee colony algorithm (DABC) to solve the DIPPS problem. The proposed DABC can guarantee the feasibility of individuals via specially-designed mapping and switching operations, so that the process precedence constraints contained by the network graph can be satisfied in the entire procedure of the DABC algorithm. Finally, the proposed MILP model is verified and the proposed DABC is tested through some open benchmarks. By comparing with other powerful reported algorithms and obtaining new better solutions, the experiment results prove the effectiveness of the proposed model and DABC algorithm successfully.     

Decision-based process planning for wire and arc additively manufactured and machined parts

The conventional manufacturing of aircraft components is based on the machining from bulk material and the buy-to-fly ratio is high. This, in combination with the often low machinability of the materials in use, leads to high manufacturing costs. To reduce the production costs for these components, a process chain was developed, which consists of an additive manufacturing process and a machining process. To fully utilize the process chain’s capabilities, an integrated process planning approach is necessary. As a result, the work sequence can be optimized to achieve the economically most suitable sequence. In this paper, a method for a joint manufacturing cost calculation and subsequent decision-based cost minimization is proposed for the wire and arc additive manufacturing (WAAM) & milling process chain. Furthermore, the parameters’ influence on the results and the magnitude of their influence are determined. These results make it possible to design an economically optimal work sequence and to automate the process planning for this process chain.     

Heuristic collision-free path planning for an autonomous platform

In this paper, a heuristic and learning, algorithmic scheme for collision-free navigation is presented. This scheme determines an optimum collision-free navigation path of an autonomous platform by using a trial and error process, past navigation knowledge and current information extracted from the generated surrounding environment.