米非司酮在依沙吖啶中期妊娠引产中的价值

目的探讨米非司酮配伍依沙吖啶用于中期妊娠引产的效果。方法依沙吖啶100mg羊膜腔注射,同时口服米非司酮50mg,每12小时1次,至胎儿娩出。单用依沙吖啶100mg羊膜腔注射为对照组。结果观察组用药至分娩时间较对照组明显缩短(P<0.05),观察组清宫率较对照组低(P<0.05)。结论米非司酮配伍依沙吖啶有协同作用,能有效促进宫颈成熟,缩短引产时间,减少胎盘、蜕膜残留,降低清宫率。     

国营二二一厂核设施退役实践

本文介绍原核工业国营二二一厂的核设施退役实践。文中概述了退役工程的前期准备,退役执行标准或限值,退役工程的组织管理和质量保证体系,退役工程的施工,去污方法,施工辐射监测,污染物处置,终态验收以及退役中的辐射防护等。退役工程经国家验收后,原二二一厂的厂房、设施和场地已经移交青海省安排使用。     

Terminability and compensatibility of cycles in business processes with a process-oriented trigger

BPTrigger is a process-oriented trigger model that provides economy of specification and efficient execution for complex business constraints. An essential part of trigger execution is detection and resolution of cycles. This paper presents an approach to determine the terminability of a cycle introduced by a BPTrigger in a business process and determine whether a cycle is allowable in terms of compensatibility. The foundation of the approach is a set of conditions for cycle termination derived from classifications of business processes by resource usage and activity types by compensation status. This paper formally presents cycle analysis procedures using the notion of cycle analysis graph. Further, a procedure is proposed which checks the terminability of multiple cycles using a composite cycle analysis graph constructed from the cycle analysis graphs of the associated cycles. The paper proves the correctness of the analysis and presents a validation example. The presented results extend some limitations of well-formed sphere which has addressed atomicity of workflow transactions.     

A new termination control method for a clothes drying process in a clothes dryer

This paper reports on a study of developing a new termination control method for a clothes dryer, using both mathematical modeling and experimental approaches. Drying models in a constant-rate drying period (CRDP) and a falling-rate drying period (FRDP) were developed, based on well-established drying theory and using a “semi-empirical” approach. Drying experiments with regard to drying of cotton fabrics in different drying environments were carried out. A new termination control method using the equilibrium moisture content in ambient environment as a termination point has been investigated. The effectiveness of this new method has been evaluated by both experimental and modelling approaches. The results of the evaluation have demonstrated that the new method is workable and can help achieve energy saving.     

Verification of Erlang Processes by Dependency Pairs

Erlang is a functional programming language developed by Ericsson Telecom, which is particularly well suited for implementing concurrent processes. In this paper we show how methods from the area of term rewriting are presently used at Ericsson. To verify properties of processes, such a property is transformed into a termination problem of a conditional term rewriting system (CTRS). Subsequently, this termination proof can be performed automatically using dependency pairs. The paper illustrates how the dependency pair technique can be applied for termination proofs of conditional TRSs. Secondly, we present three refinements of this technique, viz. narrowing, rewriting, and instantiating dependency pairs. These refinements are not only of use in the industrial applications sketched in this paper, but they are generally applicable to arbitrary (C)TRSs. Thus, in this way dependency pairs can be used to prove termination of even more (C)TRSs automatically. Received: October 6, 1999     

我国首套高温超导电缆并网运行情况

高温超导电缆具有传输容量大、损耗低、无污染、占地空间小等优点,有助于解决城市电网中日益增长的电力需求问题.近年来高温超导电缆技术在中国取得了巨大的发展,文中介绍了已于2004年5月在云南普吉变电站并网运行的我国首套高温超导电缆系统的运行情况,包括电缆系统参数、电缆本体、终端、冷却系统、监测与保护系统等.这套高温超导电缆系统的成功并网运行意味着中国的高温超导电缆技术已向工业化生产迈出了重要的一步.     

Decidability of the termination problem for completely specified protocols

Summary In this paper, we present a new class of protocols called completely specified protocols. Each protocol is represented as a system of Communicating Finite State Machines. The class of completely specified protocols is such that each message that can be received by a Finite State Machine, can also be received in every local state of the Finite State Machine. These protocols are important because they allow for modelling unbounded fifo channels and make it possible to decide the Termination Problem, that is whether the reachability tree is finite or not. An example of our techniques is given using a practical problem concerning link protocols. Alain Finkel is a Professor of Computer Science at the Ecole Normale Supérieure of Cachan. His research is concerned with the models of concurrency and the practical possibilities to verify and to validate distributed systems. He is also interested by the cognitive interfaces.     

Proving termination of GHC programs

A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed; it exploits the fact that unifications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort, merge-sort, merge, split, fair-split and append, etc., can be proved. This is a revised and extended version of Ref. 12). The work was partially supported by the NSF Indo-US grant INT-9416687 Kapur was partially supported by NSF Grant nos. CCR-8906678 and INT-9014074. M. R. K. Krishna Rao, Ph.D.: He currently works as a senior research fellow at Griffith University, Brisbane, Australia. His current interests are in the areas of logic programming, modular aspects and noncopying implementations of term rewriting, learning logic programs from examples and conuterexamples and dynamics of mental states in rational agent architectures. He received his Ph.D in computer science from Tata Institute of Fundamental Research (TIFR), Bombay in 1993 and worked at TIFR and Max Planck Institut für Informatik, Saarbrücken until January 1997. Deepak Kapur, Ph.D.: He currently works as a professor at the State University of New York at Albany. His research interests are in the areas of automated reasoning, term rewriting, constraint solving, algebraic and geometric reasoning and its applications in computer vision, symbolic computation, formal methods, specification and verification. He obtained his Ph.D. in Computer Science from MIT in 1980. He worked at General Electric Corporate Research and Development until 1987. Prof. Kapur is the editor-in-chief of the Journal of Automated Reasoning. He also serves on the editorial boards of Journal of Logic Programming, Journal on Constraints, and Journal of Applicable Algebra in Engineering, Communication and Computer Science. R. K. Shyamasundar, Ph.D.: He currently works as a professor at Tata Institute of Fundamental Research (TIFR), Bombay. His current intersts are in the areas of logic programming, reactive and real time programming, constraint solving, formal methods, specification and verification. He received his Ph.D in computer science from Indian Institute of Science, Bangalore in 1975 and has been a faculty member at Tata Institute of Fundamental Research since then. He has been a visiting/regular faculty member at Technological University of Eindhoven, University of Utrecht, IBM TJ Watson Research Centre, Pennsylvania State University, University of Illinois at Urbana-Champaign, INRIA and ENSMP, France. He has served on (and chaired) Program Committees of many International Conferences and has been on the Editorial Committees.     

Termination rate coefficients for acrylamide in the aqueous phase at low conversion

The kinetics of acrylamide (AAm) free radical polymerization at low conversion of monomer to polymer in the aqueous phase was investigated at 50 °C using γ-radiolysis relaxation, which is sensitive to radical-loss processes. The values of the termination rate coefficients for AAm ranged from 8×10⁶ to 3×10⁷ M⁻¹ s⁻¹ as the weight fraction of polymer ranged from 0.002 to 0.0035, which is significantly lower than the low-conversion values for monomers such as styrene (2×10⁸ M⁻¹ s⁻¹) and methyl methacrylate (4×10⁷ M⁻¹ s⁻¹) in organic media. These can be quantitatively explained by applying a chain-length-dependent model of free-radical polymerization kinetics [Russell GT, Gilbert RG, Napper DH. Macromolecules 1992;25:2459. [19]] in which termination kinetics are expressed in terms of a diffusion-controlled encounter of radicals which ultimately yields an expression for the chain-length-averaged termination rate coefficient, 〈k_t〉. The lower 〈k_t〉 for AAm arises due to a combination of the high k_p value, promoting rapid formation of slower terminating long chains, and the slow diffusion of short propagating chains, relative to other common monomers. The chain transfer to monomer constant for AAm in water at 50 °C, C_M, was estimated using the chain-length-distribution method with correction for band-broadening [Castro JV, van Berkel KY, Russell GT, Gilbert RG. Aust J Chem 2005;58:178. [21]] and found to be 1.2×10⁻⁴ (±10%). The diffusion characteristics for AAm were adapted from those obtained for a similar aqueous system (hydroxyethyl methacrylate) together with a 0.5 exponent for the power law dependence on penetrant degree of polymerization at zero weight fraction polymer. This provides an adequate fit to the 〈k_t〉 data. This is the first application of the chain-length-dependent model to describe experimental termination rate coefficients for an aqueous system at low conversion to polymer. The result that the experimental termination rate coefficients can be reproduced with an a priori model with physically reasonable parameters supports the physical assumptions underlying that model.