Drop formation and breakup of low viscosity elastic fluids: Effects of molecular weight and concentration

The dynamics of drop formation and pinch-off have been investigated for a series of low viscosity elastic fluids possessing similar shear viscosities, but differing substantially in elastic properties. On initial approach to the pinch region, the viscoelastic fluids all exhibit the same global necking behavior that is observed for a Newtonian fluid of equivalent shear viscosity. For these low viscosity dilute polymer solutions, inertial and capillary forces form the dominant balance in this potential flow regime, with the viscous force being negligible. The approach to the pinch point, which corresponds to the point of rupture for a Newtonian fluid, is extremely rapid in such solutions, with the sudden increase in curvature producing very large extension rates at this location. In this region the polymer molecules are significantly extended, causing a localized increase in the elastic stresses, which grow to balance the capillary pressure. This prevents the necked fluid from breaking off, as would occur in the equivalent Newtonian fluid. Alternatively, a cylindrical filament forms in which elastic stresses and capillary pressure balance, and the radius decreases exponentially with time. A (0+1)-dimensional finitely extensible nonlinear elastic dumbbell theory incorporating inertial, capillary, and elastic stresses is able to capture the basic features of the experimental observations. Before the critical "pinch time" t(p), an inertial-capillary balance leads to the expected 2/3-power scaling of the minimum radius with time: R-min similar to(t(p)-t)(2/3). However, the diverging deformation rate results in large molecular deformations and rapid crossover to an elastocapillary balance for times t>t(p). In this region, the filament radius decreases exponentially with time R-min similar to exp[(t(p)-t)/lambda(1)], where lambda(1) is the characteristic time constant of the polymer molecules. Measurements of the relaxation times of polyethylene oxide solutions of varying concentrations and molecular weights obtained from high speed imaging of the rate of change of filament radius are significantly higher than the relaxation times estimated from Rouse-Zimm theory, even though the solutions are within the dilute concentration region as determined using intrinsic viscosity measurements. The effective relaxation times exhibit the expected scaling with molecular weight but with an additional dependence on the concentration of the polymer in solution. This is consistent with the expectation that the polymer molecules are in fact highly extended during the approach to the pinch region (i.e., prior to the elastocapillary filament thinning regime) and subsequently as the filament is formed they are further extended by filament stretching at a constant rate until full extension of the polymer coil is achieved. In this highly extended state, intermolecular interactions become significant, producing relaxation times far above theoretical predictions for dilute polymer solutions under equilibrium conditions. (C) 2006 American Institute of Physics

Space efficient quantile summary for constrained sliding windows on a data stream

In many online applications, we need to maintain quantile statistics for a sliding window on a data stream. The sliding windows in natural form are defined as the most recent N data items. In this paper, we study the problem of estimating quantiles over other types of sliding windows. We present a uniform framework to process quantile queries for time constrained and filter based sliding windows. Our algorithm makes one pass on the data stream and maintains an E-approximate summary. It uses O((1)/(epsilon2) log(2) epsilonN) space where N is the number of data items in the window. We extend this framework to further process generalized constrained sliding window queries and proved that our technique is applicable for flexible window settings. Our performance study indicates that the space required in practice is much less than the given theoretical bound and the algorithm supports high speed data streams.

Examining TCP parallelization related methods for various packet losses

The diversity of the networks (wired/wireless) prefers a TCP solution robust across a wide range of networks rather than fine-tuned for a particular one at the cost of another. TCP parallelization uses multiple virtual TCP connections to transfer data for an application process and opens a way to improve TCP performance across a wide range of environments - high bandwidth-delay product (BDP), wireless as well as conventional networks. In particular, it can significantly benefit the emerging high-speed wireless networks. Despite its potential to work well over a wide range of networks, it is not fully understood how TCP parallelization performs when experiencing various packet losses in the heterogeneous environment. This paper examines the current TCP parallelization related methods under various packet losses and shows how to improve the performance of TCP parallelization.

Distance measurement using the change in junction voltage across a laser diode due to the self-mixing effect

Conventional detection scheme for self-mixing sensors uses an integrated photodiode within the laser package to monitor the self mixing signal. This arrangement can be simplified by directly obtaining the self-mixing signals across the laser diode itself and omitting the photodiode. This work reports on a Vertical-Cavity Surface-Emitting Laser (VCSEL) based selfmixing sensor using the laser junction voltage to obtain the selfmixing signal. We show that the same information can be obtained with only minor changes to the extraction circuitry leading to potential cost saving with reductions in component costs and complexity and significant increase in bandwidth favoring high speed modulation. Experiments using both photo current and voltage detection were carried out and the results obtained show good agreement with the theory.

Test strategies on functionally partitioned module-based programmable architecture for base-band processing

A specialised reconfigurable architecture for telecommunication base-band processing is augmented with testing resources. The routing network is linked via virtual wire hardware modules to reduce the area occupied by connecting buses. The number of switches within the routing matrices is also minimised, which increases throughput without sacrificing flexibility. The testing algorithm was developed to systematically search for faults in the processing modules and the flexible high-speed routing network within the architecture. The testing algorithm starts by scanning the externally addressable memory space and testing the master controller. The controller then tests every switch in the route-through switch matrix by making loops from the shared memory to each of the switches. The local switch matrix is also tested in the same way. Next the local memory is scanned. Finally, pre-defined test vectors are loaded into local memory to check the processing modules. This algorithm scans all possible paths within the interconnection network exhaustively and reports all faults. Strategies can be inserted to bypass minor faults