Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments

We study bicriteria problems of minimizing maximum tardiness and total due date assignment cost in various scheduling environments. We assume that each job can be assigned a different due date without any restriction, and that each due date assignment cost is a non-decreasing function of the quoted due date. We settle the complexity of most of the problems studied by either proving that they are NP-hard or finding a polynomial time solution for them. We also include approximation and non-approximability results for several parallel-machine problems.     

Preliminary investigations of ultrasound induced acoustic streaming using particle image velocimetry

Particle image velocimetry was used to investigate ultrasound-induced acoustic streaming in a system for the enhanced uptake of substances from the aquatic medium into fish. Four distinct regions of the induced streaming in the system were observed and measured. One of the regions was identified as an preferential site for substance uptake, where the highest velocities in proximity to the fish surface were measured. A positive linear relationship was found between the ultrasound intensity and the maximum streaming velocity, where a unitless geometric factor, specific to the system, was calculated for correcting the numerical relationship between the two parameters. The results are part of a comprehensive study aimed at improving mass transdermal administrations of substances (e.g. vaccines, hormones) into fish from the aquatic medium.     

Electrospinning of ultrahigh‐molecular‐weight polyethylene nanofibers

The electrospinning method has been employed to fabricate ultrafine nanofibers of ultrahigh‐molecular‐weight polyethylene for the first time with a mixture of solvents of different dielectric constants and conductivities. The possibility of producing highly oriented nanofibers from ultrahigh‐molecular‐weight polymers suggests new ways of fabricating ultrastrong, porous, and single‐component nanocomposite fibers with improved properties. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 766–773, 2007     

Drying of porous oil shales

Rate processes including change of phase are modelled analytically for a half-space porous substance exposed to a jump in external temperature. The model predicts, in a closed form, the pressure build-up and the rate of evaporation of volatiles from a porous matrix. It assumes two distinct regions separated by a moving interface where the change of phase takes place. One region maintains its initial concentration of volatiles while the second is devoid of volatiles. Different thermophysical properties are considered for the two regions. The model was applied for the evaporation of moisture from oil-shale. Results are given in a parametric form     

Intensity Capping: a simple method to improve cross-correlation PIV results

A common source of error in particle image velocimetry (PIV) is the presence of bright spots within the images. These bright spots are characterized by grayscale intensities much greater than the mean intensity of the image and are typically generated by intense scattering from seed particles. The displacement of bright spots can dominate the cross-correlation calculation within an interrogation window, and may thereby bias the resulting velocity vector. An efficient and easy-to-implement image-enhancement procedure is described to improve PIV results when bright spots are present. The procedure, called Intensity Capping, imposes a user-specified upper limit to the grayscale intensity of the images. The displacement calculation then better represents the displacement of all particles in an interrogation window and the bias due to bright spots is reduced. Four PIV codes and a large set of experimental and simulated images were used to evaluate the performance of Intensity Capping. The results indicate that Intensity Capping can significantly increase the number of valid vectors from experimental image pairs and reduce displacement error in the analysis of simulated images. A comparison with other PIV image-enhancement techniques shows that Intensity Capping offers competitive performance, low computational cost, ease of implementation, and minimal modification to the images.     

Enhanced light‐vapor interactions and all optical switching in a chip scale micro‐ring resonator coupled with atomic vapor

The coupling of atomic and photonic resonances serves as an important tool for enhancing light‐matter interactions and enables the observation of multitude of fascinating and fundamental phenomena. Here, by exploiting the platform of atomic‐cladding wave guides, the resonant coupling of rubidium vapor and an atomic cladding micro ring resonator is experimentally demonstrated. Specifically, cavity‐atom coupling in the form of Fano resonances having a distinct dependency on the relative frequency detuning between the photonic and the atomic resonances is observed. Moreover, significant enhancement of the efficiency of all optical switching in the V‐type pump‐probe scheme is demonstrated. The coupled system of micro‐ring resonator and atomic vapor is a promising building block for a variety of light vapor experiments, as it offers a very small footprint, high degree of integration and extremely strong confinement of light and vapor. As such it may be used for important applications, such as all optical switching, dispersion engineering (e.g. slow and fast light) and metrology, as well as for the observation of important effects such as strong coupling, and Purcell enhancement.

     

Scheduling for a processor sharing system with linear slowdown

We consider the problem of scheduling arrivals to a congestion system with a finite number of users having identical deterministic demand sizes. The congestion is of the processor sharing type in the sense that all users in the system at any given time are served simultaneously. However, in contrast to classical processor sharing congestion models, the processing slowdown is proportional to the number of users in the system at any time. That is, the rate of service experienced by all users is linearly decreasing with the number of users. For each user there is an ideal departure time (due date). A centralized scheduling goal is then to select arrival times so as to minimize the total penalty due to deviations from ideal times weighted with sojourn times. Each deviation penalty is assumed quadratic, or more generally convex. But due to the dynamics of the system, the scheduling objective function is non-convex. Specifically, the system objective function is a non-smooth piecewise convex function. Nevertheless, we are able to leverage the structure of the problem to derive an algorithm that finds the global optimum in a (large but) finite number of steps, each involving the solution of a constrained convex program. Further, we put forward several heuristics. The first is the traversal of neighbouring constrained convex programming problems, that is guaranteed to reach a local minimum of the centralized problem. This is a form of a “local search”, where we use the problem structure in a novel manner. The second is a one-coordinate “global search”, used in coordinate pivot iteration. We then merge these two heuristics into a unified “local–global” heuristic, and numerically illustrate the effectiveness of this heuristic.     

Lowest priority waiting time distribution in an accumulating priority Lévy queue

We derive the waiting time distribution of the lowest class in an accumulating priority (AP) queue with positive Lévy input. The priority of an infinitesimal customer (particle) is a function of their class and waiting time in the system, and the particles with the highest AP are the next to be processed. To this end we introduce a new method that relies on the construction of a workload overtaking process and solving a first-passage problem using an appropriate stopping time.