Microstructure and its relationship to deformation processes in amorphous polymer glasses

The microdeformation morphology of a number of vinyl polymers with bulky side chains (type I) and arylene polymers with flexible oxygen linkages (type II) was studied by electron microscopy. The polyarylenes crazed only near the glass transition while the polyvinyls exhibited a crazing regime that extended to liquid nitrogen temperatures. In addition significantly less plastic strain was localized in type II glass crazes relative to those in type I glasses. In compatible blends of polystyrene (PS) and 2,6-dimethyl poly(phenylene oxide) (2MPPO), ca. 30% 2MPPO was sufficient to induce a transition from type I to type II crazing behavior. Small amounts of PS suppressed the low-temperature 2MPPO β relaxation but enhanced the intermediate transition of 2MPPO at higher temperatures. Blending increased the conformational energy of the 2MPPO chain and improved interchain packing. The propensity for the polymer glass to form sharp shear bands at the expense of diffuse bands was increased by a decrease in the conformation energy of the polymer chain and an improvement in the glassy state packing.     

Dimensions of the average pore,the number of pores,and the surface area of hardened Portland cement paste

In the course of their small angle x-ray scattering work, Winslow and Diamond also calculated the radius of gyration of the pores. Using its value for a paste, Diamond adopted two models for the average pore: a sphere and a cylinder of equal height and diameter. This model leads to absurd values for the surface area of the paste. Using a cylindrical model, and the radius of gyration plus the hydraulic radius, the present authors calculated for a similar paste the dimensions of the average pore and obtained the values: $\text{diameter}\text{= 47.2}\text{A}\text{?}\text{,}\text{length}\text{= 466}\text{A}\text{?}$. The number of pores per gram of paste was 2.26 × 10¹⁷. The paper also discusses the surface area of hardened paste, and points out the extremely important contributions of Winslow and Diamond to the subject.     

Quadratic approximate dynamic programming for input‐affine systems

We consider the use of quadratic approximate value functions for stochastic control problems with input‐affine dynamics and convex stage cost and constraints. Evaluating the approximate dynamic programming policy in such cases requires the solution of an explicit convex optimization problem, such as a quadratic program, which can be carried out efficiently. We describe a simple and general method for approximate value iteration that also relies on our ability to solve convex optimization problems, in this case, typically a semidefinite program. Although we have no theoretical guarantee on the performance attained using our method, we observe that very good performance can be obtained in practice.Copyright © 2012 John Wiley & Sons, Ltd.     

The allelopathic mechanisms of dominance in bracken (Pteridium aquilinum) in Southern California

Bracken,Pteridium aquilinum, exerts a strong dominance over associated plants throughout much of its worldwide range. Associated plants are often severely inhibited or even excluded from dense stands of the fern. This study investigated the various aspects of herb suppression in bracken stands and assessed the contribution of the various forms of interference between plants to the establishment and maintenance of bracken dominance. It was shown that competition for soil moisture, light, and nutrients could not account for the lack of herbs in bracken stands. Further, uniformity of soil pH, texture, water-holding capacity, and organic matter content ruled out variability in physical factors as a cause. Baiting and trapping experiments showed that the higher concentration of animal activity inside the bracken stands contributed significantly to the pattern of herb suppression, but only against select species. The maintenance of this pattern in the animal-free Santa Cruz Island stands indicates the importance of another factor, allelopathy. It was found that phytotoxins leached from the dead, standing bracken fronds with the first few rains of the wet season were largely responsible for herb suppression. These toxins were isolated in raindrip and from soil inside the fern stands. Removal of the fronds from the stand before the rains could leach them resulted in reinvasion by the herbs after several seasons, and, conversely, placing fronds over the herbs in the grassland brought about herb inhibition. A number of known allelopathic chemicals were tentatively identified from bracken leachates. The importance of the interaction of allelopathy with other factors of plant interference is illustrated by bracken.     

Monitoring the cure of a composite matrix resin with microdielectrometry

This paper presents a study of the cure of glass and graphite fiber epoxy composites using dielectric monitoring techniques. Initial results reported here deal with the neat resin and the relationship between its conductivity and corresponding changes in glass transition temperature during cure.     

Scalable digital hardware for a trapped ion quantum computer

Quantum Information Processing - Many of the challenges of scaling quantum computer hardware lie at the interface between the qubits and the classical control signals used to manipulate them....     

Approximate dynamic programming via iterated Bellman inequalities

In this paper, we introduce new methods for finding functions that lower bound the value function of a stochastic control problem, using an iterated form of the Bellman inequality. Our method is based on solving linear or semidefinite programs, and produces both a bound on the optimal objective, as well as a suboptimal policy that appears to works very well. These results extend and improve bounds obtained in a previous paper using a single Bellman inequality condition. We describe the methods in a general setting and show how they can be applied in specific cases including the finite state case, constrained linear quadratic control, switched affine control, and multi‐period portfolio investment. Copyright © 2014 John Wiley & Sons, Ltd.     

GPU-OSDDA: a bit-vector GPU-based deadlock detection algorithm for single-unit resource systems

This article presents a GPU-based single-unit deadlock detection methodology and its algorithm, GPU-OSDDA. Our GPU-based design utilizes parallel hardware of GPU to perform computations and thus is able to overcome the major limitation of prior hardware-based approaches by having the capability of handling thousands of processes and resources, whilst achieving real-world run-times. By utilizing a bit-vector technique for storing algorithm matrices and designing novel, efficient algorithmic methods, we not only reduce memory usage dramatically but also achieve two orders of magnitude speedup over CPU equivalents. Additionally, GPU-OSDDA acts as an interactive service to the CPU, because all of the aforementioned computations and matrix management techniques take place on the GPU, requiring minimal interaction with the CPU. GPU-OSDDA is implemented on three GPU cards: Tesla C2050, Tesla K20c, and Titan X. Our design shows overall speedups of 6-595X over CPU equivalents.     

Map‐based Visualizations Increase Recall Accuracy of Data

We investigate the memorability of data represented in two different visualization designs. In contrast to recent studies that examine which types of visual information make visualizations memorable, we examine the effect of different visualizations on time and accuracy of recall of the displayed data, minutes and days after interaction with the visualizations. In particular, we describe the results of an evaluation comparing the memorability of two different visualizations of the same relational data: node‐link diagrams and map‐based visualization. We find significant differences in the accuracy of the tasks performed, and these differences persist days after the original exposure to the visualizations. Specifically, participants in the study recalled the data better when exposed to map‐based visualizations as opposed to node‐link diagrams. We discuss the scope of the study and its limitations, possible implications, and future directions.