Making polyurethane foams from microemulsions

A remarkable correlation exists between the degree of expansion of polyurethane foams and the structure of the reacting premixes. Polyurethane foams obtained from reacting premixes containing microemulsions are highly expanded. The expansion rate is proportional to the volume fraction of microemulsion in the premix. The stability of premixes with and without microemulsion is completely different suggesting distinct creaming mechanisms. We apply this idea to synthesize polyurethane foams from microemulsions successfully. This approach can be used to rationalize the design of polyurethane formulations leading to highly expanded foams.     

Jitter in ATM networks and its impact on peak rate enforcement

Cells arriving to an ATM network experience random delays due to queueing in upstream multiplexing stages, notably in customer premises. This is the phenomenon of jitter and the aim of the present paper is to study its influence on peak rate enforcement. We first introduce some general characterizations of jitter and then, describe two models of jittered flows based on simple queueing systems. We discuss the objectives of peak rate enforcement and study the impact of jitter on the dimensioning of jumping window and leaky bucket mechanisms. A useful synthetic characterization of jitter appears to be a remote quantile of the cell delay distribution expressed in units of the initial inter-cell interval.     

Shear mode coupling and tilted grain growth of A1N thin films in BAW resonators.

Polycrystalline A1N thin films were deposited by RF reactive magnetron sputtering on Pt(111)/Ti electrode films. The substrates were tilted by an angle ranging from 40 degrees to 70 degrees with respect to the target normal. A low deposition temperature and a high sputter gas pressure were found ideal for tilted growth. The resulting grain tilt angle amounts to about half the substrate tilt angle. For coupling evaluation, 5 GHz solidly mounted resonator structures have been realized. The tilted grain A1N films exhibited a permittivity in the 9.5-10.5 range and loss tangent of 0.3%. Two shear modes as well as the longitudinal mode could be clearly identified. The coupling coefficient k2(eff) of the fundamental thickness shear mode (TS0) was found to be about 0.5%, which is compatible with a c-axis tilt of about 6 degrees.     

Fabrication of a biocompatible flexible electroosmosis micropump

In in-vivo microsystems, one of the components is a biocompatible micropump in order to produce the necessary force to deliver the fluid from the inlet to the outlet. In this contribution, a flexible micropump is fabricated which is aimed to be suitable in drug delivery applications. It provides high degree of biocompatibility, since the only employed materials are implantation grade polydimethylsiloxane elastomer and gold for the electrical interconnects. The working principle of the micropump is based on transverse DC electroosmosis which is a new variant of conventionally applied high voltage DC electroosmosis. This new technique is based on topography irregularities introduced in the channel resulting in a non-uniform charge distribution. The advantage is to drive the micropump using a relatively low DC voltage of 10 V while getting an effective flow speed of 60 μm/s. In order to characterize the flow speed, dyed 3 μm beads are dispersed in the working fluid and their speed is measured by the line scanning technique using a confocal microscope. It is also observed that the flow has a helical profile which is an attractive feature for an efficient micro-mixer in active microfluidics and μ-TAS applications.     

Path‐space Motion Estimation and Decomposition for Robust Animation Filtering

Renderings of animation sequences with physics‐based Monte Carlo light transport simulations are exceedingly costly to generate frame‐by‐frame, yet much of this computation is highly redundant due to the strong coherence in space, time and among samples. A promising approach pursued in prior work entails subsampling the sequence in space, time, and number of samples, followed by image‐based spatio‐temporal upsampling and denoising. These methods can provide significant performance gains, though major issues remain: firstly, in a multiple scattering simulation, the final pixel color is the composite of many different light transport phenomena, and this conflicting information causes artifacts in image‐based methods. Secondly, motion vectors are needed to establish correspondence between the pixels in different frames, but it is unclear how to obtain them for most kinds of light paths (e.g. an object seen through a curved glass panel). To reduce these ambiguities, we propose a general decomposition framework, where the final pixel color is separated into components corresponding to disjoint subsets of the space of light paths. Each component is accompanied by motion vectors and other auxiliary features such as reflectance and surface normals. The motion vectors of specular paths are computed using a temporal extension of manifold exploration and the remaining components use a specialized variant of optical flow. Our experiments show that this decomposition leads to significant improvements in three image‐based applications: denoising, spatial upsampling, and temporal interpolation.     

Efficient product sampling using hierarchical thresholding

We present an efficient method for importance sampling the product of multiple functions. Our algorithm computes a quick approximation of the product on the fly, based on hierarchical representations of the local maxima and averages of the individual terms. Samples are generated by exploiting the hierarchical properties of many low-discrepancy sequences, and thresholded against the estimated product. We evaluate direct illumination by sampling the triple product of environment map lighting, surface reflectance, and a visibility function estimated per pixel. Our results show considerable noise reduction compared to existing state-of-the-art methods using only the product of lighting and BRDF.     

Effect of thickness stretching and porosity on mechanical response of a functionally graded beams resting on elastic foundations

The novelty of this paper is the use of an efficient beam theory for bending, free vibration and buckling analysis of functionally graded material (FGM) beams on two-parameter elastic foundation. The present theory accounts for both shear deformation and thickness stretching effects by a parabolic variation of all displacements across the thickness, and satisfies the stress-free boundary conditions on the upper and lower surfaces of the beam without requiring any shear correction factor. Due to porosities, possibly occurring inside FGMs during fabrication, it is therefore necessary to consider the vibration, bending and buckling behaviors of beams having porosities in this work. The equation of motion for FGM beams is obtained through Hamilton’s principle. The closed form solutions are obtained by using Navier technique, and then fundamental frequencies are found by solving the results of eigenvalue problems. The validity of the present theory is investigated by comparing some of the present in literature. It can be concluded that the proposed theory is accurate and simple in solving the bending, free vibration and buckling behaviors of FGM sandwich beams.     

Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment

This paper studies a generalization of the order acceptance and scheduling problem in a single-machine environment where a pool consisting of firm planned orders as well as potential orders is available from which an over-demanded company can select. The capacity available for processing the accepted orders is limited and each order is characterized by a known processing time, delivery date, revenue and a weight representing a penalty per unit-time delay beyond the delivery date. We prove that the existence of a constant-factor approximation algorithm for this problem is unlikely. We propose two linear formulations that are solved using an IP solver and we devise two exact branch-and-bound procedures able to solve instances with up to 50 jobs within reasonable CPU times. We compare the efficiency and quality of the results obtained using the different solution approaches.