Structure and function in flow networks

Peer reviewedPublisher PD

Ground state properties of fluxlines in a disordered environment

A new numerical method to calculate exact ground states of multi-fluxline systems with quenched disorder is presented, which is based on the minimum cost flow algorithm from combinatorial optimization. We discuss several models that can be studied with this method including their specific implementations, physically relevant observables and results: 1) the N-line model with N fluxlines (or directed polymers) in a d-dimensional environment with point and/or columnar disorder and hard or soft core repulsion; 2) the vortex glass model for a disordered superconductor in the strong screening limit and 3) the Sine-Gordon model with random pase shifts in the strong coupling limit.Comment: 4 pages RevTeX, 3 eps-figures include

Flip-flop jet nozzle extended to supersonic flows

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/76991/1/AIAA-11725-757.pd

Pareto Optimal Matchings in Many-to-Many Markets with Ties

We consider Pareto-optimal matchings (POMs) in a many-to-many market of applicants and courses where applicants have preferences, which may include ties, over individual courses and lexicographic preferences over sets of courses. Since this is the most general setting examined so far in the literature, our work unifies and generalizes several known results. Specifically, we characterize POMs and introduce the \emph{Generalized Serial Dictatorship Mechanism with Ties (GSDT)} that effectively handles ties via properties of network flows. We show that GSDT can generate all POMs using different priority orderings over the applicants, but it satisfies truthfulness only for certain such orderings. This shortcoming is not specific to our mechanism; we show that any mechanism generating all POMs in our setting is prone to strategic manipulation. This is in contrast to the one-to-one case (with or without ties), for which truthful mechanisms generating all POMs do exist

Using network-flow techniques to solve an optimization problem from surface-physics

The solid-on-solid model provides a commonly used framework for the description of surfaces. In the last years it has been extended in order to investigate the effect of defects in the bulk on the roughness of the surface. The determination of the ground state of this model leads to a combinatorial problem, which is reduced to an uncapacitated, convex minimum-circulation problem. We will show that the successive shortest path algorithm solves the problem in polynomial time.Comment: 8 Pages LaTeX, using Elsevier preprint style (macros included

Optimal Traffic Networks

Inspired by studies on the airports' network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a combination of topological and metric quantities. It is characterized by a strongly heterogeneous traffic, non-trivial correlations between distance and traffic and a broadly distributed centrality. A clear spatial hierarchical organization, with local hubs distributing traffic in smaller regions, emerges as a result of the optimization. Varying the parameters of the cost function, different classes of trees are recovered, including in particular the minimum spanning tree and the shortest path tree. These results suggest that a variational approach represents an alternative and possibly very meaningful path to the study of the structure of complex weighted networks.Comment: 4 pages, 4 figures, final revised versio

A Component Based Heuristic Search Method with Evolutionary Eliminations

Nurse rostering is a complex scheduling problem that affects hospital personnel on a daily basis all over the world. This paper presents a new component-based approach with evolutionary eliminations, for a nurse scheduling problem arising at a major UK hospital. The main idea behind this technique is to decompose a schedule into its components (i.e. the allocated shift pattern of each nurse), and then to implement two evolutionary elimination strategies mimicking natural selection and natural mutation process on these components respectively to iteratively deliver better schedules. The worthiness of all components in the schedule has to be continuously demonstrated in order for them to remain there. This demonstration employs an evaluation function which evaluates how well each component contributes towards the final objective. Two elimination steps are then applied: the first elimination eliminates a number of components that are deemed not worthy to stay in the current schedule; the second elimination may also throw out, with a low level of probability, some worthy components. The eliminated components are replenished with new ones using a set of constructive heuristics using local optimality criteria. Computational results using 52 data instances demonstrate the applicability of the proposed approach in solving real-world problems.Comment: 27 pages, 4 figure

Application of a minimum cost flow algorithm to the three-dimensional gauge glass model with screening

We study the three-dimensional gauge glass model in the limit of strong screening by using a minimum cost flow algorithm, enabling us to obtain EXACT ground states for systems of linear size L<=48. By calculating the domain-wall energy, we obtain the stiffness exponent theta = -0.95+/-0.03, indicating the absence of a finite temperature phase transition, and the thermal exponent nu=1.05+/-0.03. We discuss the sensitivity of the ground state with respect to small perturbations of the disorder and determine the overlap length, which is characterized by the chaos exponent zeta=3.9+/-0.2, implying strong chaos.Comment: 4 pages RevTeX, 2 eps-figures include

The flip flop nozzle extended to supersonic flows

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/76293/1/AIAA-1992-2724-750.pd

A validated stability-indicating HPLC method for determination of varenicline in its bulk and tablets

A simple, sensitive and accurate stability-indicating HPLC method has been developed and validated for determination of varenicline (VRC) in its bulk form and pharmaceutical tablets. Chromatographic separation was achieved on a Zorbax Eclipse XDB-C8 column (150 mm × 4.6 mm i.d., particle size 5 μm, maintained at ambient temperature) by a mobile phase consisted of acetonitrile and 50 mM potassium dihydrogen phosphate buffer (10:90, v/v) with apparent pH of 3.5 ± 0.1 and a flow rate of 1.0 ml/min. The detection wavelength was set at 235 nm. VRC was subjected to different accelerated stress conditions. The degradation products, when any, were well resolved from the pure drug with significantly different retention time values. The method was linear (r = 0.9998) at a concentration range of 2 - 14 μg/ml. The limit of detection and limit of quantitation were 0.38 and 1.11 μg/ml, respectively. The intra- and inter-assay precisions were satisfactory; the relative standard deviations did not exceed 2%. The accuracy of the method was proved; the mean recovery of VRC was 100.10 ± 1.08%. The proposed method has high throughput as the analysis involved short run-time (~ 6 min). The method met the ICH/FDA regulatory requirements. The proposed method was successfully applied for the determination of VRC in bulk and tablets with acceptable accuracy and precisions; the label claim percentages were 99.65 ± 0.32%. The results demonstrated that the method would have a great value when applied in quality control and stability studies for VRC