Interactions in compatible polymer systems

Summary Dynamic mechanical measurements on polystyrene — poly(vinylmethylether) blends are demonstrating that the relaxation processes in the blends are mainly connected with the motions of the poly(vinylmethylether) chain.Concerning the effect of mixing on topological properties of the blends, an increase of the polydispersity of the relaxation processes is detected in blends with high molecular weight polystyrene while low molecular weight polystyrene exerts an effect of dilution upon the relaxation of the high molecular poly(vinylmethylether) chains.From these measurements as well as from thermoanalytical data it results that the energetic interaction is more pronounced in the blends with oligomeric than with high molecular weight polystyrene. The glass transition temperature shows a larger deviation from additivity for blends with high molecular polystyrene than for those with oligomeric polystyrene.Herrn Prof. Dr. M. Kryszewski zum 60. Geburtstag herzlichst gewidmet     

Foaming of nonionic surfactant solutions: Effect of surfactant concentration and temperature

Foaming of solutions of the nonionic surfactant, octoxynol 9, was investigated in the concentration range of 0.010 to 5.00% and in the temperature range of 7–37 C, well below the cloud point of 65 C, by measuring the height and stability of foams generated by pouring thin streams of surfactant solutions into a glass column. All foams were fast-thinning. Their height increased monotonically with surfactant concentration. The rate of change of foam height with log surfactant concentration underwent no change at the CMC of 0.018%, but was four times lower above 0.146% than below 0.146%. Foams at lower temperatures generally thinned somewhat more slowly and were stronger or more cohesive and more stable than foams generated at higher temperatures by surfactant solutions of comparable concentrations. Oxidative degradation reduced foam height somewhat. Octoxynol 9 and sodium lauryl sulfate, rated as a good foamer, produced foams of comparable volume and stability.     

Effect of electrolytes on foaming of nonionic surfactant solutions

The effect of electrolytes and other additives on the foaming of solutions of the nonionic surfactant octoxynol 9 (Triton X-100) was investigated and correlated with their effect on the cloud point. Foams were generated by pouring solutions as a thin stream into a vertical tube. The height of the generally fast-draining foam columns was measured as a function of time, and their stability was rated according to the damage sustained within 13 min. The surfactant concentrations used, 0.050, 0.100 and 2.00%, were above the critical micelle concentration. Increasing concentrations increased foam height but not foam stability. The electrolytes NaCl and Na₂SO₄ salted the surfactant out. They reduced its cloud point in proportion to their concentration. They also reduced the foam height, albeit to a lesser extent than the cloud point, but hardly reduced the foam stability below the cloud point.     

A NUMERICAL SOLUTION OF THE FLOW AROUND A SPHERE IN A CIRCULAR CYLINDER

A numerical solution of the Navier-Stokes equations is presented for Poiseuille flow around an axially placed, fixed sphere in a circular cylinder. Streamlines and isovorticity lines are calculated from the governing equations for the strearnfunction and the vorticity. Isobars are calculated from a Poisson equation, derived from the Navier-Stokes equations. The pressure and vorticity distribution on the surface of the sphere, the additional pressure drop and the drag coefficients are presented. Solutions are obtained for Reynolds numbers up to 150 (based on cylinder diameter and mean velocity). The wall effects are examined by comparison with results of previous investigations for an unbounded flow around a sphere.     

Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method

Recently, it was shown how the convergence of a class of multigrid methods for computing the stationary distribution of sparse, irreducible Markov chains can be accelerated by the addition of an outer iteration based on iterant recombination. The acceleration was performed by selecting a linear combination of previous fine-level iterates with probability constraints to minimize the two-norm of the residual using a quadratic programming method. In this paper we investigate the alternative of minimizing the one-norm of the residual. This gives rise to a nonlinear convex program which must be solved at each acceleration step. To solve this minimization problem we propose to use a deep-cuts ellipsoid method for nonlinear convex programs. The main purpose of this paper is to investigate whether an iterant recombination approach can be obtained in this way that is competitive in terms of execution time and robustness. We derive formulas for subgradients of the one-norm objective function and the constraint functions, and show how an initial ellipsoid can be constructed that is guaranteed to contain the exact solution and give conditions for its existence. We also investigate using the ellipsoid method to minimize the two-norm. Numerical tests show that the one-norm and two-norm acceleration procedures yield a similar reduction in the number of multigrid cycles. The tests also indicate that one-norm ellipsoid acceleration is competitive with two-norm quadratic programming acceleration in terms of running time with improved robustness.     

Modeling Instrumental Rationality, Land Tenure and Conflict Resolution

Full instrumental rationality and perfect institutions are two cornerstoneassumptions underlying neoclassical models. However, in the real world, thesetwo assumptions never hold, especially not in developing countries. In thispaper, we develop a game theoretical model to investigate if relaxations inthe full instrumental rationality and perfect institutions premise can explainthe conflicts that have been occurring between the various principals in theNarok district in Kenya with regard to land tenure and use.     

Constructive Membership Predicates as Index Types

In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we motivate and explore this idea in the concrete setting of lists and trees. We show that the inhabitants of membership predicates are precisely the inhabitants of a generic shape type. We show that membership of x (of type T) in structure S, (x_TS) can not, in general, index all parts of a structure S and we generalize to a form ρS where ρ is a predicate over S. Under this scheme, (λx.True)S is the set of all indexes into S, but we show that not all subsets of indexes are expressible by strictly local predicates. Accordingly, we extend our membership predicates to predicates that retain state “from above” as well as allow “looking below”. Predicates of this form are complete in the sense that they can express every subset of indexes in S. These ideas are motivated by experience programming in Nuprl's constructive type theory and examining the constructive content of mechanically checked formal proofs involving membership predicates.     

Sequential architecture models for Prolog: A performance comparison

In this paper we investigate the relation between architectural support for Prolog and performance. We will show that partial support for tags does perform as well as full support, but it only reduces the execution time by approximately 10%. With respect to special addressing modes, auto address modification (post/pre increment, decrement on loads and stores) only yields a cycle reduction of approximately 6% and the introduction of a single shadow register set yields around 8%. Combining these optimizations, a performance gain of 20 to 25% can be achieved, depending on the memory system. Usingvliw techniques, which exploit instruction-level parallelism, the performance can be doubled, using three processing elements. Two processing elements already provide a significant speedup, but the use of four processing elements is not justified if we compare the gain in performance with the cost of the extra hardware. In general we observe only a small performance improvement (around 20%) when moving fromrisc to special-purposerisc architectures, an improvement which can also be achieved by applying advanced compiler technology, such as compiler optimization, optimizations forwam, and optimal scheduling techniques forvliw architectures. Unfortunately these hardware and software effects do not add up, as a better compiler reduces the effect of hardware support. Finally, the cycle time is essential for comparing the performance of different (micro)-architectures, but it is not always clear what the effects of the different tradeoffs are on the maximum achievable cycle time.     

Worm algorithms for the 3-state Potts model with magnetic field and chemical potential

We discuss worm algorithms for the 3-state Potts model with external field and chemical potential. The complex phase problem of this system can be overcome by using a flux representation where the new degrees of freedom are dimer and monomer variables. Working with this representation we discuss two different generalizations of the conventional Prokof’ev–Svistunov algorithm suitable for Monte Carlo simulations of the model at arbitrary chemical potential and evaluate their performance.