云荞水库面板堆石坝震后安全检测及整治研究与实践

云南省永善县云荞水库自建成蓄水以来运行良好,2008年5月12日,四川省汶川县发生8.0级地震,云荞水库震感强烈,水库内水浪约1.0m高,水库受损,面板裂缝加大;震后云荞水库工程管理局高度重视云荞水库的安全问题,特请某水利水电勘测设计研究院对面板进行健全性检测,管理局根据检查单位对大坝面板的整体性能做出的评价及提出相应的处理意见,对面板裂缝进行了化学灌浆和表面封闭处理,至今运行良好。     

Synthesis mechanism of titanium carbide nano-fiber during self-propagating high temperature synthesis

Titanium carbide nano-fiber was synthesized by self-propagating high temperature synthesis (SHS) method. The final products after the SHS reaction were titanium carbide containing excess carbon and metallic titanium, which were removed by additional leaching process. TEM observation revealed that the average diameter is about 20 nm. Neutron diffraction analysis was carried out to study non-stoichiometric number of the titanium carbide. The non-stoichiometric numbers of the titanium carbide were 0.89–0.94. The Rietveld refinement of each patterns converged to good agreement (÷2=0.49–1.34). The formation mechanism of the carbide is related to a liquid-solid reaction including the preferential diffusion process of carbon atom into liquid titanium. This article is based on a presentation made in the 2002 Korea-US symposium on the “Phase Transformations of Nano-Materials,” organized as a special program of the 2002 Annual Meeting of the Korean Institute of Metals and Materials, held at Yonsei University, Seoul, Korea on October 25–26, 2002.     

An improved practice to manufacture Al–Ti–B master alloys by reacting halide salts with molten aluminium

The well-established “halide salt” route was employed in the present work to produce Al–Ti–B grain refiner alloys with consistent, good properties. The holding step in the production cycle was revised, however, to avoid oxidation of the molten alloy which is believed to be responsible for the relatively low Ti recoveries and thus for the inadequate and inconsistent grain refining efficiency. Stirring during holding was found to degrade the grain refining properties when molten potassium aluminium fluride salt was left on the molten alloy to avoid excessive oxidation. Likewise, holding temperatures higher than 800 °C and holding times longer than 30 min both had an undesirable effect on the grain refining performance. The experimental Al–5Ti–1B grain refiner alloy produced according to the present method provided consistent and better overall grain refining performance.     

Model checking response times in Networked Automation Systems using jitter bounds

Response time (RT) of Networked Automation Systems (NAS) is affected by timing imperfections induced due to the network, computing and hardware components. Guaranteeing RT in the presence of such timing imperfections is essential for building dependable NAS, and to avoid costly upgrades after deployment in industries.This investigation proposes a methodology and work-flow that combines modelling, simulation, verification, experiments, and software tools to verify the RT of the NAS during the design, rather than after deployment. The RT evaluation work-flow has three phases: model building, modelling and verification. During the model building phase component reaction times are specified and their timing performance is measured by combining experiments with simulation. During the modelling phase, component based mathematical models that capture the network architecture and inter-connection are proposed. Composition of the component models gives the NAS model required for studying the RT performance on system level. Finally, in the verification step, the NAS formal models are abstracted as UPPAAL timed automata with their timing interfaces. To model timing interfaces, the action patterns, and their timing wrapper are proposed. The formal model of high level of abstraction is used to verify the total response time of the NAS where the reactions to be verified are specified using a subset of timed computation tree logic (TCTL) in UPPAAL model checker. The proposed approach is illustrated on an industrial steam boiler deployment.     

Flash memory efficient LTL model checking

As the capacity and speed of flash memories in form of solid state disks grow, they are becoming a practical alternative for standard magnetic drives. Currently, most solid-state disks are based on NAND technology and much faster than magnetic disks in random reads, while in random writes they are generally not.So far, large-scale LTL model checking algorithms have been designed to employ external memory optimized for magnetic disks. We propose algorithms optimized for flash memory access. In contrast to approaches relying on the delayed detection of duplicate states, in this work, we design and exploit appropriate hash functions to re-invent immediate duplicate detection.For flash memory efficient on-the-fly LTL model checking, which aims at finding any counter-example to the specified LTL property, we study hash functions adapted to the two-level hierarchy of RAM and flash memory. For flash memory efficient off-line LTL model checking, which aims at generating a minimal counterexample and scans the entire state space at least once, we analyze the effect of outsourcing a memory-based perfect hash function from RAM to flash memory.Since the characteristics of flash memories are different to magnetic hard disks, the existing I/O complexity model is no longer sufficient. Therefore, we provide an extended model for the computation of the I/O complexity adapted to flash memories that has a better fit to the observed behavior of our algorithms.     

Hardness of preorder checking for basic formalisms

We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a standard timed automaton. In both cases, we show that simulation checking is Exptime-hard, and for the case of a non-flat implementation, the result holds even if there is no synchronization between the parallel components and their alphabets of actions are pairwise disjoint. Moreover, we show that the considered problems become Pspace-complete when the specification is assumed to be deterministic. Additionally, we establish that comparing a synchronous non-flat system with no hiding and a flat system is Pspace-hard for any relation between trace containment and bisimulation equivalence, even if the flat system is assumed to be fixed.     

Distributed Symbolic Bounded Property Checking

In this paper we describe an algorithm for distributed, BDD-based bounded property checking and its implementation in the verification tool SymC. The distributed algorithm verifies larger models and returns results faster than the sequential version.The core algorithm distributes partitions of the state set to computation nodes after reaching a threshold size. The nodes proceed with image computation on the nodes asynchronously. The main scalability problem of this scheme is the overlap of state set partitions. We present static and dynamic overlap reduction techniques.     

谈谈确定"停工检测点" "质量见证点"的方法

通过制造4台我国特大型非标冶炼回转炉的实践,以详实的实例,总结性地介绍了在特大型非标设备的制造中,怎样运用技术确定“停工检测点”、“质量见证点”,完成设备制造的成功经验。