Segmented polymer networks containing amino‐dendrimers

Polymer networks in which poly(propylene imine) dendrimers (Astramol?) are connected to each other by linear polytetrahydrofuran (polyTHF) segments, were prepared by two methods. The first method was a one‐step procedure in which bifunctionally living polyTHF, obtained by initiation of the THF polymerization with trifluoromethane sulfonic anhydride (triflic anhydride), was reacted with an amino‐dendrimer. This reaction was very fast but did not allow formation of the end products. The second method was a two‐step procedure. In a first step, living polyTHF, prepared with acryloyloxybutyl triflate as initiator, was grafted on an amino‐dendrimer, to form a star‐like, acrylate‐terminated polyTHF multi‐macromonomer with the dendrimer as core. In a second step, networks were obtained by Michael addition between the acrylate end‐groups and unreacted amino‐groups of the dendrimer. This cross‐linking reaction occurred spontaneously upon heating of the solution of the multi‐macromonomer with gelation times varying from a few minutes to a few hours, depending on the temperature and the composition of the prepolymers. With this method it was possible to prepare networks in the form of coatings or films. © 2003 Society of Chemical Industry     

Completeness for nondeterministic complexity classes

We demonstrate differences between reducibilities and corresponding completeness notions for nondeterministic time and space classes. For time classes the studied completeness notions under polynomial-time bounded (even logarithmic-space bounded) reducibilities turn out to be different for any class containingNE. For space classes the completeness notions under logspace reducibilities can be separated for any class properly containingLOGSPACE. Key observation in obtaining the separations is the honesty property of reductions, which was recently observed to hold for the time classes and can be shown to hold for space classes.The work of S. Homer was supported in part by National Science Foundation Grants MIP-8608137 and CCR-8814339 and a Fulbright-Hays Research Fellowship. Some of this research was done while he was a Guest Professor at the Mathematics Institute of Heidelberg University.     

Investigation of bounds on particle packing in pebble-bed high temperature reactors

Models and methods are presented for determining practical limits of the packing density of TRISO particles in fuel pebbles for a pebble-bed reactor (PBR). These models are devised for designing and interpreting fuel testing experiments. Two processes for particle failure are accounted for: failure of touching particles at the pressing stage in the pebble manufacturing process and failure due to inner pressure buildup during irradiation. The second process gains importance with increasing fuel temperature, which limits the particle packing density and the corresponding fuel enrichment. Suggestions for improvements to the models are presented.     

Experimental validation of FE predicted fracture behaviour in thermally sprayed coatings

The fracture behaviour of a brittle coating on a substrate is not only governed by its intrinsic fracture strength, but also by a range of other parameters. In order to be able to understand (and thus predict) the fracture response, it is very important to accurately determine the key coating properties such as elastic modulus, residual stresses and fracture strength. In the present work, the fracture behaviour of three different high velocity oxy-fuel (HVOF) sprayed WC–17% Co coatings on Ti–6Al–4V substrates was studied using four-point bending with the acoustic emission technique. The key coating properties were determined experimentally and finite element (FE) models incorporating these experimentally measured properties were used to predict the cracking behaviour. It was found that the FE model was able to predict the differences in the fracture responses of the three coating types based upon differences in their mechanical properties, which in turn enabled the properties which dominate the fracture response to be identified. Moreover, the ability to predict the fracture behaviour of the coatings provided validation of the physical basis of the FE model.     

Detection of optic disc changes with Glaucoma-Scope probability maps

Before use of cardiovascular surgical techniques and procedures in humans, many experiments, e.g., hypothermic circulatory arrest and cardiopulmonary bypass using the heart-lung machine, have been performed in the dog. As a consequence experimental canine cardiovascular surgery is highly developed. This has not resulted in the routine performance of open heart surgery in veterinary medicine, probably because of the high costs. Cardiovascular surgery in the dog is generally limited to interventions not depending on hypothermic circulatory arrest or cardiopulmonary bypass. The clinical cardiovascular surgery in dogs can be divided into routine and more specialized interventions. The first category includes correction of peritoneopericardial diaphragmatic hernia, pericardial fenestration in dogs with pericardial effusion, treatment of persistent right aortic arch, and patent ductus closure. The specialized interventions include dilation of pulmonic and aortic stenoses and pacemaker implantation. The diagnosis and surgical treatment of such diseases is described. New developments in cardiovascular surgical treatment that can be expected include catheter techniques for occlusion of shunts and dilations using balloons, because the financial costs of these procedures are not prohibitive.     

Bridging the gap between formal semantics and implementation of triple graph grammars

The correctness of model transformations is a crucial element for model-driven engineering of high-quality software. A prerequisite to verify model transformations at the level of the model transformation specification is that an unambiguous formal semantics exists and that the implementation of the model transformation language adheres to this semantics. However, for existing relational model transformation approaches, it is usually not really clear under which constraints particular implementations really conform to the formal semantics. In this paper, we will bridge this gap for the formal semantics of triple graph grammars (TGG) and an existing efficient implementation. While the formal semantics assumes backtracking and ignores non-determinism, practical implementations do not support backtracking, require rule sets that ensure determinism, and include further optimizations. Therefore, we capture how the considered TGG implementation realizes the transformation by means of operational rules, define required criteria, and show conformance to the formal semantics if these criteria are fulfilled. We further outline how static and runtime checks can be employed to guarantee these criteria.     

Stochastic facility location with general long-run costs and convex short-run costs

This paper addresses the problem of minimizing the expected cost of locating a number of single product facilities and allocating uncertain customer demand to these facilities. The total costs consist of two components: firstly linear transportation cost and secondly the costs of investing in a facility as well as maintaining and operating it. These facility costs are general and non-linear in shape and could express both changing economies of scale and diseconomies of scale. We formulate the problem as a two-stage stochastic programming model where both demand and short-run costs may be uncertain at the investment time. We use a solution method based on Lagrangean relaxation, and show computational results for a slaughterhouse location case from the Norwegian meat industry.     

A graph-based framework for model-driven optimization facilitating impact analysis of mutation operator properties

Optimization problems in software engineering typically deal with structures as they occur in the design and maintenance of software systems. In model-driven optimization (MDO), domain-specific models are used to represent these structures while evolutionary algorithms are often used to solve optimization problems. However, designing appropriate models and evolutionary algorithms to represent and evolve structures is not always straightforward. Domain experts often need deep knowledge of how to configure an evolutionary algorithm. This makes the use of model-driven meta-heuristic search difficult and expensive. We present a graph-based framework for MDO that identifies and clarifies core concepts and relies on mutation operators to specify evolutionary change. This framework is intended to help domain experts develop and study evolutionary algorithms based on domain-specific models and operators. In addition, it can help in clarifying the critical factors for conducting reproducible experiments in MDO. Based on the framework, we are able to take a first step toward identifying and studying important properties of evolutionary operators in the context of MDO. As a showcase, we investigate the impact of soundness and completeness at the level of mutation operator sets on the effectiveness and efficiency of evolutionary algorithms.

     

On-Line Dial-a-Ride Problems Under a Restricted Information Model

In on-line dial-a-ride problems servers are traveling in some metric space to serve requests for rides which are presented over time. Each ride is characterized by two points in the metric space, a source, the starting point of the ride, and a destination, the endpoint of the ride. Usually it is assumed that at the release of a request, complete information about the ride is known. We diverge from this by assuming that at the release of a ride, only information about the source is given. At visiting the source, the information about the destination will be made available to the servers. For many practical problems, our model is closer to reality. However, we feel that the lack of information is often a choice, rather than inherent to the problem: additional information can be obtained, but this requires investments in information systems. In this paper we give mathematical evidence that for the problem under study it pays to invest.