有机羧酸钠盐对PET结晶和熔融行为的影响

采用差示扫描量热仪研究了5种具有不同取代基的苯甲酸钠盐作为结晶成核剂对聚对苯二甲酸乙二醇酯（HET）结晶和熔融行为的影响，并同滑石粉进行了对比。结果表明，成核剂的加入能明显改变PET的结晶和熔融行为。苯甲酸钠、对苯二甲酸甲酯单羧酸钠和对羟基苯甲酸钠提高既汀的熔融结晶温度（Tc）分别达22．93、21．7和19．37℃，但使PET降解严重；对苯酚钠甲酸钠能够提高Tc达17．75℃且对PET相对分子质量影响很小；对苯二甲酸二钠成核作用最差。低于滑石粉。此外，成核剂的成核能力越强，PET双熔融峰中的低温峰顶温度就越高。     

Structural properties of phosphorous-doped polycrystalline silicon

The structural properties and hydrogen bonding of undoped and phosphorous doped polycrystalline silicon produced by step-by-step laser dehydrogenation and crystallization technique were investigated using Raman spectroscopy and hydrogen effusion measurements. At low laser fluences, E_L, a two-layer system is created. This is accompanied by the change in hydrogen bonding. The intensity of the Si–H vibration mode at 2000 decreases faster than the one at 2100 cm⁻¹. This is even more pronounced in phosphorous-doped specimens. The laser crystallization results in an increase of the hydrogen binding energy by approximately 0.2–0.3 eV compared to the amorphous starting materials.     

Dynamic Multicast Session Provisioning in WDM Optical Networks with Sparse Splitting Capability

In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability. The problem is to route the multicast session from each source to the members of every multicast session, and to assign an appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the current network topology as well as its residual network resource information. We formulate the per session multicast routing and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes are SaD nodes.     

A framework to integrate software behavior into dynamic probabilistic risk assessment

Software plays an increasingly important role in modern safety-critical systems. Although, research has been done to integrate software into the classical probabilistic risk assessment (PRA) framework, current PRA practice overwhelmingly neglects the contribution of software to system risk. Dynamic probabilistic risk assessment (DPRA) is considered to be the next generation of PRA techniques. DPRA is a set of methods and techniques in which simulation models that represent the behavior of the elements of a system are exercised in order to identify risks and vulnerabilities of the system. The fact remains, however, that modeling software for use in the DPRA framework is also quite complex and very little has been done to address the question directly and comprehensively. This paper develops a methodology to integrate software contributions in the DPRA environment. The framework includes a software representation, and an approach to incorporate the software representation into the DPRA environment SimPRA. The software representation is based on multi-level objects and the paper also proposes a framework to simulate the multi-level objects in the simulation-based DPRA environment. This is a new methodology to address the state explosion problem in the DPRA environment. This study is the first systematic effort to integrate software risk contributions into DPRA environments.     

Viscoelastic State for the Solutions of Spherically Symmetric Viscoelasticity Problems

The solutions of the spherically symmetric, linear, isothermal, and transient viscoelasticity problems via reciprocity theorem have been investigated for a specific material. The integral form of stress–strain relations has been used. The Laplace transform of a viscoelastic state, which is necessary for the integral equation arising as a result of reciprocity theorem, has been derived. This integral equation has been solved by Laplace transform. A sample problem has been solved to test the presented formulation. A numerical application of the analytic solution of this problem has been given.     

Mining data from intensive care patients

In this paper we describe the application of data mining methods for predicting the evolution of patients in an intensive care unit. We discuss the importance of such methods for health care and other application domains of engineering. We argue that this problem is an important but challenging one for the current state of the art data mining methods and explain what improvements on current methods would be useful. We present a promising study on a preliminary data set that demonstrates some of the possibilities in this area.     

Facility layout problems: A survey

Layout problems are found in several types of manufacturing systems. Typically, layout problems are related to the location of facilities (e.g., machines, departments) in a plant. They are known to greatly impact the system performance. Most of these problems are NP hard. Numerous research works related to facility layout have been published. A few literature reviews exist, but they are not recent or are restricted to certain specific aspects of these problems. The literature analysis given here is recent and not restricted to specific considerations about layout design.

We suggest a general framework to analyze the literature and present existing works using such criteria as: the manufacturing system features, static/dynamic considerations, continual/discrete representation, problem formulation, and resolution approach. Several research directions are pointed out and discussed in our conclusion.     

新型超微晶软磁合金FePCCuMoSi微观结构缺陷的正电子湮没研究

用正电子湮没方法研究了新型超微晶软磁合金的微观结构缺陷，样品选用的是在不同温度下退火的Ｆｅ８１Ｐ１２Ｃ３Ｃｕ１Ｍｏ０．５Ｓｉ２．５合金，结果表明，合金的微观结构构陷大小，密度随退火温度有规律地变化，这种现象可能与非晶的晶化过程有关。     

Preparation of polyimide-epoxy composites

The formation of a three dimensional network of crosslinked epoxy leads all unmodified epoxies to have inherent brittleness and relatively low degradation temperatures. Polyimides, on the other hand, are widely used for applications that require high degrees of flexibility and thermal resistance. Here, we have focused on the preparation of epoxy systems cured with polyamic acids instead of traditional amino-group-containing hardening agents. The cure behavior and potential reaction mechanisms of EPON 828 resin and polyamic acid mixtures were evaluated by DSC and TGA. Thermal analysis showed a complex reaction sequence taking place in the mixture and also determined the extent of reaction of the polyamic acid with itself and the competitive reaction of the polyamic acid with the epoxy. The compositions of the mixtures were varied to see the dependence of the cure behavior on component concentrations. Solutions of the two components did not phase separate and also phase separation was not apparent either optically or microscopically in the cured samples. This phase behavior was attributed to a unique in situ reaction. A novel solvent system for the polyamic acid precursor was also used.     

Optimal Solutions for the Temporal Precedence Problem

Abstract. In this paper we refer to the Temporal Precedence Problem on Pure Pointer Machines . This problem asks for the design of a data structure, maintaining a set of stored elements and supporting the following two operations: insert and precedes . The operation insert (a) introduces a new element a in the structure, while the operation precedes (a,b) returns true iff element a was inserted before element b temporally. In [11] a solution was provided to the problem with worst-case time complexity O (log log n ) per operation and O(n log log n) space, where n is the number of elements inserted. It was also demonstrated that the precedes operation has a lower bound of Ω (log log n ) for the Pure Pointer Machine model of computation. In this paper we present two simple solutions with linear space and worst-case constant insertion time. In addition, we describe two algorithms that can handle the precedes (a,b) operation in O (log log d ) time, where d is the temporal distance between the elements a and b .