Reducing radiotoxicity in the long run

Stockpiles of spent nuclear fuel and weapons material are growing worldwide. So far, the only long-term strategy seriously considered is geological repository for several hundred thousand years. Transmutation is an option significantly reducing the time during which repositories have to be sealed, simplifying the task of protecting future generations from the radioactive remnants of our civilisation. This paper gives an overview of motives and priorities, and describes the main technique suggested for transmutation of nuclear waste.     

Synthesis and characterization of poly(N‐vinyl‐2‐pyrrolidone) grafted sodium alginate hydrogel beads for the controlled release of indomethacin

Graft copolymers of sodium alginate (NaAlg) with N‐vinyl‐2‐pyrrolidone were prepared using azobisisobutyronitrile as initiator. The graft copolymers (NaAlg‐g‐PVP) were characterized with Fourier transform infrared spectroscopy, elemental analysis, and differential scanning calorimetry. Polymeric hydrogel beads of NaAlg and NaAlg‐g‐PVP were prepared by crosslinking method using glutaraldehyde (GA) as a crosslinker in the hydrochloric acid catalyst (HCl) and these beads were used to deliver anti‐inflammatory drug, indomethacin (IM). Chemical stability of the IM after encapsulation into beads was confirmed by FTIR. Preparation conditions of the NaAlg‐g‐PVP beads were optimized by considering the percentage entrapment efficiency, particle size, swelling capacity and their release data. In vitro release studies were performed in simulated gastric fluid (pH 1.2) for the initial 2 h, followed by simulated intestinal fluid (pH 7.4) for 4 h. Effects of GA concentration, exposure time to GA, drug/polymer (d/p) ratio, and concentration of HCl on the release of IM were discussed. It was observed that IM release from the beads decreased with increasing GA concentration and exposure time. IM release also decreases with increasing d/p ratio and HCl concentration. The highest IM release was obtained to be 77% for beads crosslinked with 0.027M GA. Swelling experiments were also performed to compute molecular mass between crosslinks of the beads. © 2008 Wiley Periodicals, Inc. J Appl Polym Sci, 2008     

Exergy losses in refrigerating systems. A study for performance comparisons in compressor and condenser

A study is carried out to describe irreversibilities in one stage refrigerating process for vapour compression cycle with refrigerant mixtures R-404A, R-410A, R-410B and R-507 as working fluids. They are calculated as exergy losses by an algorithm developed on the basis of thermodynamics. The proposed relationships have been derived from exergy balances on the system components. Emphasis is placed on parameters influencing the losses and the related results are presented through Grassmann diagrams (diagrams of exergy fluxes). Furthermore, detailed information on the variation of cycle's exergy efficiency with evaporating and condensing temperatures is given. Copyright © 2003 John Wiley & Sons, Ltd.     

Environment as a first class abstraction in multiagent systems

The current practice in multiagent systems typically associates the environment with resources that are external to agents and their communication infrastructure. Advanced uses of the environment include infrastructures for indirect coordination, such as digital pheromones, or support for governed interaction in electronic institutions. Yet, in general, the notion of environment is not well defined. Functionalities of the environment are often dealt with implicitly or in an ad hoc manner. This is not only poor engineering practice, it also hinders engineers to exploit the full potential of the environment in multiagent systems. In this paper, we put forward the environment as an explicit part of multiagent systems.We give a definition stating that the environment in a multiagent system is a first-class abstraction with dual roles: (1) the environment provides the surrounding conditions for agents to exist, which implies that the environment is an essential part of every multiagent system, and (2) the environment provides an exploitable design abstraction for building multiagent system applications. We discuss the responsibilities of such an environment in multiagent systems and we present a reference model for the environment that can serve as a basis for environment engineering. To illustrate the power of the environment as a design abstraction, we show how the environment is successfully exploited in a real world application. Considering the environment as a first-class abstraction in multiagent systems opens up new horizons for research and development in multiagent systems.     

A polynomial dynamic system approach to software design for attractivity requirement

Because of the widespread increasing application of Web services and autonomic computing, self-adaptive software is an area gaining increasing importance. Control theory provides a theoretical foundation for self-adaptive software. In this paper, we propose the use of the supervisory control theory of discrete event dynamic systems (DEDS) to provide a rigorous foundation for designing software for reactive systems. This paper focuses in particular on design of software with an attractivity requirement. It studies this problem using the polynomial dynamic system (PDS) model of DEDS. A necessary and sufficient condition for software existence and two algorithms for such software design are presented.     

Combustion of bulk density powder mixtures in a coflow of nitrogen gas: 3. The Ti-(Ti + 0.5C) layered system

Explored is the filtration combustion in Ti-(Ti + 0.5C) layered powder systems in a coflow of nitrogen gas. The presence/absence of nitrogen coflow through the layered system was found to drastically affect the character of wave propagation and structure/properties of product. The obtained data can be regarded as a basis for fabrication of new layered and composite materials in the mode of dynamic filtration combustion.      

Min-Max MPC based on a computationally efficient upper bound of the worst case cost

Min-Max MPC (MMMPC) controllers [P.J. Campo, M. Morari, Robust model predictive control, in: Proc. American Control Conference, June 10–12, 1987, pp. 1021–1026] suffer from a great computational burden which limits their applicability in the industry. Sometimes upper bounds of the worst possible case of a performance index have been used to reduce the computational burden. This paper proposes a computationally efficient MMMPC control strategy in which the worst case cost is approximated by an upper bound based on a diagonalization scheme. The upper bound can be computed with O(n³) operations and using only simple matrix operations. This implies that the algorithm can be coded easily even in non-mathematical oriented programming languages such as those found in industrial embedded control hardware. A simulation example is given in the paper.     

Expert identification and selection: Legal liability concerns and directions

Legal liabilities pertaining to the identification and selection of domain experts is an issue that could adversely impact expert systems developers. Problems pertaining to flawed knowledge, improperly defined expertise, and behavioural and psychological impediments are just some of the issues. This paper examines the torts of strict products liability and negligence that system developers could incur as a result of expert-related difficulties. Parallels from legal scholars and federal and state court decisions are discussed relevant to expert system projects and developers. The paper concludes with a presentation of steps that systems developers can take to minimize potential legal liability.     

Tandem queues with general blocking: A unified model and comparison results

We study tandem queues with finite intermediate buffers and develop a general blocking scheme that unifies and generalizes various blocking schemes previously studied in the literature, such as manufacturing blocking, communication blocking, kanban blocking and its variations. In the general blocking scheme, job movement and service at each stage are controlled by three parameters, which represent, respectively, the upper limits (at that stage) on work-in-process inventory, finished goods inventory, and buffer space. We derive a set of recursive equations that characterize the dynamics of the system, in terms of the job completion and departure processes, and establish comparison results for these processes in the settings of stochastic ordering, variability ordering and stochastic convexity. Free of distributional assumptions, the results provide characterization of system behavior with respect to the control parameters as well as to the arrival and service processes. We also compare system performance under two different modes of operation: make-to-order versus make-to-stock, and demonstrate the trade-off between improving service and reducing inventory. Numerical studies are also presented to illustrate the diversity of performance trade-off, including composition of inventory, offered by the general model.Supported in part by NSF under grant ECS-89-96201.