Minimizing makespan for hybrid flowshops with batch, discrete processing machines and arbitrary job sizes

This research aims at a study of the hybrid flow shop problem which has parallel batch-processing machines in one stage and discrete-processing machines in other stages to process jobs of arbitrary sizes. The objective is to minimize the makespan for a set of jobs. The problem is denoted as: FF: batch1,sj:Cmax. The problem is formulated as a mixed-integer linear program. The commercial solver, AMPL/CPLEX, is used to solve problem instances to their optimality. Experimental results show that AMPL/CPLEX requires considerable time to find the optimal solution for even a small size problem, i.e., a 6-job instance requires 2 hours in average. A bottleneck-first-decomposition heuristic (BFD) is proposed in this study to overcome the computational (time) problem encountered while using the commercial solver. The proposed BFD heuristic is inspired by the shifting bottleneck heuristic. It decomposes the entire problem into three sub-problems, and schedules the sub-problems one by one. The proposed BFD heuristic consists of four major steps: formulating sub-problems, prioritizing sub-problems, solving sub-problems and re-scheduling. For solving the sub-problems, two heuristic algorithms are proposed; one for scheduling a hybrid flow shop with discrete processing machines, and the other for scheduling parallel batching machines (single stage). Both consider job arrival and delivery times. An experiment design is conducted to evaluate the effectiveness of the proposed BFD, which is further evaluated against a set of common heuristics including a randomized greedy heuristic and five dispatching rules. The results show that the proposed BFD heuristic outperforms all these algorithms. To evaluate the quality of the heuristic solution, a procedure is developed to calculate a lower bound of makespan for the problem under study. The lower bound obtained is tighter than other bounds developed for related problems in literature. A meta-search approach based on the Genetic Algorithm concept is developed to evaluate the significance of further improving the solution obtained from the proposed BFD heuristic. The experiment indicates that it reduces the makespan by 1.93 % in average within a negligible time when problem size is less than 50 jobs.

Large area uniform nanostructures fabricated by direct femtosecond laser ablation

An approach for fabricating large area uniform nanostructures by direct femtosecond (fs) laser ablation is presented. By the simple scanning technique with appropriate irradiation conditions, arbitrary size of uniform, complanate nano-grating, nano-particle, and nano-square structures can be produced on wide bandgap materials as well as graphite. The feature sizes of the formed nanostructures, which can be tuned in a wide range by varying the irradiation wavelength, is about 200 nm with 800 nm fs laser irradiation. The physical properties of the nano-structured surfaces are changed greatly, especially the optical property, which is demonstrated by the extraordinary enhancement of light transmission of the treated area. This technique is efficient, universal, and environmentally friendly, which exhibits great potential for applications in photoelectron devices. (C) 2008 Optical Society of America

Vortices in superconductors with a columnar defect: Finite size effects

In the present work we investigate the behavior of a vortex in a long superconducting cylinder near to a columnar defect at the center. The derivations of the local magnetic field distribution and the Gibbs free energy will be carried out for a cylinder and a cavity of arbitrary sizes. From the general expressions, it is considered two particular limits: one in which the radius of the cavity is very small but the radius of the superconducting cylinder is kept finite; and one in which the radius of the superconducting cylinder is taken very large (infinite) but the radius of the cavity is kept finite. In both cases the maximum number of vortices which are allowed in the cavity is determined. In addition, the surface barrier field for flux entrance into the cavity is calculated. (c) 2005 Elsevier B.V. All rights reserved.

Automated design of self-stabilization

Self-stabilization is a property of a distributed system such that, regardless of the legitimacy of its current state, the system behavior shall eventually reach a legitimate state and shall remain legitimate thereafter. The elegance of self-stabilization stems from the fact that it distinguishes distributed systems by a strong fault tolerance property against arbitrary state perturbations. The difficulty of designing and reasoning about self-stabilization has been witnessed by many researchers; most of the existing techniques for the verification and design of self-stabilization are either brute-force, or adopt manual approaches non-amenable to automation. In this dissertation, we first investigate the possibility of automatically designing self-stabilization through global state space exploration. In particular, we develop a set of heuristics for automating the addition of recovery actions to distributed protocols on various network topologies. Our heuristics equally exploit the computational power of a single workstation and the available parallelism on computer clusters. We obtain existing and new stabilizing solutions for classical protocols like maximal matching, ring coloring, mutual exclusion, leader election and agreement. Second, we consider a foundation for local reasoning about self-stabilization; i.e., study the global behavior of the distributed system by exploring the state space of just one of its components. It turns out that local reasoning about deadlocks and livelocks is possible for an interesting class of protocols whose proof of stabilization is otherwise complex. In particular, we provide necessary and sufficient conditions – verifiable in the local state space of every process – for global deadlock- and livelock-freedom of protocols on ring topologies. Local reasoning potentially circumvents two fundamental problems that complicate the automated design and verification of distributed protocols: (1) state explosion and (2) partial state information. Moreover, local proofs of convergence are independent of the number of processes in the network, thereby enabling our assertions about deadlocks and livelocks to apply on rings of arbitrary sizes without worrying about state explosion.

Extending the advanced forensic format to accommodate multiple data sources, logical evidence, arbitrary information and forensic workflow

Forensic analysis requires the acquisition and management of many different types of evidence, including individual disk drives, RAID sets, network packets, memory images, and extracted files. Often the same evidence is reviewed by several different tools or examiners in different locations. We propose a backwards-compatible redesign of the Advanced Forensic Formatdan open, extensible file format for storing and sharing of evidence, arbitrary case related information and analysis results among different tools. The new specification, termed AFF4, is designed to be simple to implement, built upon the well supported ZIP file format specification. Furthermore, the AFF4 implementation has downward comparability with existing AFF files.

Discovering characteristics of stochastic collections of process models

Process models in organizational collections are typically modeled by the same team and using the same conventions. As such, these models share many characteristic features like size range, type and frequency of errors. In most cases merely small samples of these collections are available due to e.g. the sensitive information they contain. Because of their sizes, these samples may not provide an accurate representation of the characteristics of the originating collection. This paper deals with the problem of constructing collections of process models, in the form of Petri nets, from small samples of a collection for accurate estimations of the characteristics of this collection. Given a small sample of process models drawn from a real-life collection, we mine a set of generation parameters that we use to generate arbitrary-large collections that feature the same characteristics of the original collection. In this way we can estimate the characteristics of the original collection on the generated collections.We extensively evaluate the quality of our technique on various sample datasets drawn from both research and industry.

Models of collective cell motion for cell populations with different aspect ratio : diffusion, proliferation and travelling waves

Continuum, partial differential equation models are often used to describe the collective motion of cell populations, with various types of motility represented by the choice of diffusion coefficient, and cell proliferation captured by the source terms. Previously, the choice of diffusion coefficient has been largely arbitrary, with the decision to choose a particular linear or nonlinear form generally based on calibration arguments rather than making any physical connection with the underlying individual-level properties of the cell motility mechanism. In this work we provide a new link between individual-level models, which account for important cell properties such as varying cell shape and volume exclusion, and population-level partial differential equation models. We work in an exclusion process framework, considering aligned, elongated cells that may occupy more than one lattice site, in order to represent populations of agents with different sizes. Three different idealizations of the individual-level mechanism are proposed, and these are connected to three different partial differential equations, each with a different diffusion coefficient; one linear, one nonlinear and degenerate and one nonlinear and nondegenerate. We test the ability of these three models to predict the population level response of a cell spreading problem for both proliferative and nonproliferative cases. We also explore the potential of our models to predict long time travelling wave invasion rates and extend our results to two dimensional spreading and invasion. Our results show that each model can accurately predict density data for nonproliferative systems, but that only one does so for proliferative systems. Hence great care must be taken to predict density data for with varying cell shape.

Kaolinite particle sizes in the <2 µM range using laser scattering

The Clay Minerals Society Source Clay kaolinites, Georgia KGa-1 and KGa-2, have been subjected to particle size determinations by 1) conventional sedimentation methods, 2) electron microscopy and image analysis, and 3) laser scattering using improved algorithms for the interaction of light with small particles. Particle shape, size distribution, and crystallinity vary considerably for each kaolinite. Replicate analyses of separated size fractions showed that in the <2 µm range, the sedimentation/centrifugation method of Tanner and Jackson (1947) is reproducible for different kaolinite types and that the calculated size ranges are in reasonable agreement with the size bins estimated from laser scattering. Particle sizes determined by laser scattering must be calculated using Mie theory when the dominant particle size is less than ∼5 µm. Based on this study of two well-known and structurally different kaolinites, laser scattering, with improved data reduction algorithms that include Mie theory, should be considered an internally consistent and rapid technique for clay particle sizing.

Comparison of PCR, nested PCR, and random amplified polymorphic DNA PCR for detection and typing of Ureaplasma urealyticum in specimens from pregnant women

A PCR assay, using three primer pairs, was developed for the detection of Ureaplasma urealyticum, parvo biovar, mba types 1, 3, and 6, in cultured clinical specimens. The primer pairs were designed by using the polymorphic base positions within a 310- to 311-bp fragment of the 5* end and upstream control region of the mba gene. The specificity of the assay was confirmed with reference serovars 1, 3, 6, and 14 and by the amplified-fragment sizes (81 bp for mba 1, 262 bp for mba 3, and 193 bp for mba 6). A more sensitive nested PCR was also developed. This involved a first-step PCR, using the primers UMS-125 and UMA226, followed by the nested mba-type PCR described above. This nested PCR enabled the detection and typing of small numbers of U. urealyticum cells, including mixtures, directly in original clinical specimens. By using random amplified polymorphic DNA (RAPD) PCR with seven arbitrary primers, we were also able to differentiate the two biovars of U. urealyticum and to identify 13 RAPD-PCR subtypes. By applying these subtyping techniques to clinical samples collected from pregnant women, we established that (i) U. urealyticum is often a persistent colonizer of the lower genital tract from early midtrimester until the third trimester of pregnancy, (ii) mba type 6 was isolated significantly more often (P 5 0.048) from women who delivered preterm than from women who delivered at term, (iii) no particular ureaplasma subtype(s) was associated with placental infections and/or adverse pregnancy outcomes, and (iv) the ureaplasma subtypes most frequently isolated from women were the same subtypes most often isolated from infected placentas.

Free-surface flow past arbitrary topography and an inverse approach for wave-free solutions

An efficient numerical method to compute nonlinear solutions for two-dimensional steady free-surface flow over an arbitrary channel bottom topography is presented. The approach is based on a boundary integral equation technique which is similar to that of Vanden-Broeck's (1996, J. Fluid Mech., 330, 339-347). The typical approach for this problem is to prescribe the shape of the channel bottom topography, with the free-surface being provided as part of the solution. Here we take an inverse approach and prescribe the shape of the free-surface a priori while solving for the corresponding bottom topography. We show how this inverse approach is particularly useful when studying topographies that give rise to wave-free solutions, allowing us to easily classify eleven basic flow types. Finally, the inverse approach is also adapted to calculate a distribution of pressure on the free-surface, given the free-surface shape itself.

Analysis and prediction of the critical current density across [001]-tilt YBa2Cu3O7- grain boundaries of arbitrary misorientation angles

A qualitative analysis of the expected dilatation strain field in the vicinity of an array of grain-boundary (GB) dislocations is presented. The analysis provides a basis for the prediction of the critical current densities (jc) across low-angle YBa2Cu3O7- (YBCO) GBs as a function of their energy. The introduction of the GB energy allows the extension of the analysis to high-angle GBs using established models which predict the GB energy as a function of misorientation angle. The results are compared to published data for jc across [001]-tilt YBCO GBs for the full range of misorientations, showing a good fit. Since the GB energy is directly related to the GB structure, the analysis may allow a generalization of the scaling behavior of jc with the GB energy. © 1995 The American Physical Society.