Routing of a hazmat truck in the presence of weather systems

This paper focuses on the effects of weather systems on hazmat routing. We start by analyzing the effects of a weather system on a vehicle traversing a single link. This helps characterize the time-dependent attributes of a link due to movement of the weather systems. This analysis is used as a building block for the problem of finding a least risk path for hazmat transportation on a network exposed to such weather systems. Several methods are offered to solve the underlying problem, and computational results are reported. We draw two conclusions from this paper. First, it is possible to determine the time-dependent attributes for links on a network provided that some assumptions on the nature of the weather system are made. Second, heuristics can provide effective solutions for practical size problems while allowing for parking the vehicle to avoid weather system effects.     

Studies in dyeing. II. Effect of crystal modification of disperse dyes on polyester dyeing at 130°C

Four commercial disperse dyes were purified and their different crystal forms were prepared by crystallizing from different solvents or precipitating from their solutions in glacial acetic acid by dilution with water. These forms were found to have different melting points. They were dyed on polyester fibers at 130°C to fiber saturation values by changing the dyebath every 15 min. The effect of pretreatment of the dyes in an aqueous environment at different temperatures (60°, 100°, and 130°C) for 15–60 min in the presence and absence of a dispersing agent on the dye uptake values was also studied. Such treatments are shown to reduce the dye uptake. The implication of these treatments in practical dyeing are pointed out.     

Path Hitting in Acyclic Graphs

An instance of the path hitting problem consists of two families of paths, and ℋ, in a common undirected graph, where each path in ℋ is associated with a non-negative cost. We refer to and ℋ as the sets of demand and hitting paths, respectively. When p∈ℋ and share at least one mutual edge, we say that p hits q. The objective is to find a minimum cost subset of ℋ whose members collectively hit those of . In this paper we provide constant factor approximation algorithms for path hitting, confined to instances in which the underlying graph is a tree, a spider, or a star. Although such restricted settings may appear to be very simple, we demonstrate that they still capture some of the most basic covering problems in graphs. Our approach combines several novel ideas: We extend the algorithm of Garg, Vazirani and Yannakakis (Algorithmica, 18:3–20, 1997) for approximate multicuts and multicommodity flows in trees to prove new integrality properties; we present a reduction that involves multiple calls to this extended algorithm; and we introduce a polynomial-time solvable variant of the edge cover problem, which may be of independent interest. An extended abstract of this paper appeared in Proceedings of the 14th Annual European Symposium on Algorithms, 2006. This work is part of D. Segev’s Ph.D. thesis prepared at Tel-Aviv University under the supervision of Prof. Refael Hassin.     

Approximation algorithms for partially covering with edges

The edge dominating set (EDS) and edge-cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or vertices, respectively, of a graph. We consider the generalized partial cover version of these problems, in which failing to cover an edge, in the EDS case, or vertex, in the EC case, induces a penalty. Given a bound on the total amount of penalties that we are permitted to pay, the objective is to find a minimum cost cover with respect to this bound. We give an 8/3-approximation for generalized partial EDS. This result matches the best-known guarantee for the {0,1}-EDS problem, a specialization in which only a specified set of edges need to be covered. Moreover, 8/3 corresponds to the integrality gap of the natural formulation of the {0,1}-EDS problem. Our techniques can also be used to derive an approximation scheme for the generalized partial edge-cover problem, which is -complete even though the uniform penalty version of the partial edge-cover problem is in .     

Approximation Algorithms for <Emphasis Type="Italic">k</Emphasis>-hurdle Problems

The polynomial-time solvable k-hurdle problem is a natural generalization of the classical s-t minimum cut problem where we must select a minimum-cost subset S of the edges of a graph such that |p∩S|≥k for every s-t path p. In this paper, we describe a set of approximation algorithms for “k-hurdle” variants of the NP-hard multiway cut and multicut problems. For the k-hurdle multiway cut problem with r terminals, we give two results, the first being a pseudo-approximation algorithm that outputs a (k−1)-hurdle solution whose cost is at most that of an optimal solution for k hurdles. Secondly, we provide a 2(1-\frac1r)2(1-\frac{1}{r})-approximation algorithm based on rounding the solution of a linear program, for which we give a simple randomized half-integrality proof that works for both edge and vertex k-hurdle multiway cuts that generalizes the half-integrality results of Garg et al. for the vertex multiway cut problem. We also describe an approximation-preserving reduction from vertex cover as evidence that it may be difficult to achieve a better approximation ratio than 2(1-\frac1r)2(1-\frac{1}{r}). For the k-hurdle multicut problem in an n-vertex graph, we provide an algorithm that, for any constant ε>0, outputs a ⌈(1−ε)k⌉-hurdle solution of cost at most O(log n) times that of an optimal k-hurdle solution, and we obtain a 2-approximation algorithm for trees.     

Lessons and Challenges from Mining Retail E-Commerce Data

The architecture of Blue Martini Software's e-commerce suite has supported data collection, data transformation, and data mining since its inception. With clickstreams being collected at the application-server layer, high-level events being logged, and data automatically transformed into a data warehouse using meta-data, common problems plaguing data mining using weblogs (e.g., sessionization and conflating multi-sourced data) were obviated, thus allowing us to concentrate on actual data mining goals. The paper briefly reviews the architecture and discusses many lessons learned over the last four years and the challenges that still need to be addressed. The lessons and challenges are presented across two dimensions: business-level vs. technical, and throughout the data mining lifecycle stages of data collection, data warehouse construction, business intelligence, and deployment. The lessons and challenges are also widely applicable to data mining domains outside retail e-commerce.     

Risk factors for multiple intracranial aneurysms

OBJECTIVE: Risk factors that predispose to the formation of multiple intracranial aneurysms, which are present in up to 34% of patients with intracranial aneurysms, are not well defined. In this study, we examined the association between known risk factors for cerebrovascular disease and presence of multiple intracranial aneurysms. METHODS: We reviewed the medical records and results of conventional angiography in all patients with a diagnosis of intracranial aneurysms admitted to the Johns Hopkins University hospital between January 1990 and June 1997. We determined the independent association between various cerebrovascular risk factors and the presence of multiple aneurysms using logistic regression analysis. RESULTS: Of 419 patients admitted with intracranial aneurysms (298 ruptured and 121 unruptured), 127 (30%) had multiple intracranial aneurysms. In univariate analysis, female gender (odds ratio [OR] = 1.9; 95% confidence interval [CI], 1.1-3.3) and cigarette smoking at any time (OR = 1.8; 95% CI, 1.1-3.0) were significantly associated with presence of multiple aneurysms. In the multivariate analysis, cigarette smoking at any time (OR = 1.7; 95% CI, 1.1-2.8) and female gender (OR = 2.1; 95% CI 1.2-3.5) remained significantly associated with multiple aneurysms. Hypertension, diabetes mellitus, and alcohol and illicit drug use were not significantly associated with presence of multiple aneurysms. CONCLUSION: Cigarette smoking and female gender seem to increase the risk for multiple aneurysms in patients predisposed to intracranial aneurysm formation. Further studies are required to investigate the mechanism underlying the association between cigarette smoking and intracranial aneurysm formation.     

A generalized processor sharing approach to flow control inintegrated services networks: the single-node case

The problem of allocating network resources to the users of an integrated services network is investigated in the context of rate-based flow control. The network is assumed to be a virtual circuit, connection-based packet network. It is shown that the use of generalized processor sharing (GPS), when combined with leaky bucket admission control, allows the network to make a wide range of worst-case performance guarantees on throughput and delay. The scheme is flexible in that different users may be given widely different performance guarantees and is efficient in that each of the servers is work conserving. The authors present a practical packet-by-packet service discipline, PGPS that closely approximates GPS. This allows them to relate results for GPS to the packet-by-packet scheme in a precise manner. The performance of a single-server GPS system is analyzed exactly from the standpoint of worst-case packet delay and burstiness when the sources are constrained by leaky buckets. The worst-case session backlogs are also determined     

Structural and Optical Properties of ZnO Nanotips Grown on GaN Using Metalorganic Chemical Vapor Deposition

ZnO nanotips are grown on epitaxial GaN/c-sapphire templates by metalorganic chemical vapor deposition. X-ray diffraction (XRD) studies indicate that the epitaxial relationship between ZnO nanotips and the GaN layer is (0002)ZnO||(0002)GaN and (101̄0)ZnO||(101̄0)GaN. Temperature-dependent photoluminescence (PL) spectra have been measured. Sharp free exciton and donor-bound exciton peaks are observed at 4.4 K with photon energies of 3.380 eV, 3.369 eV, and 3.364 eV, confirming high optical quality of ZnO nanotips. Free exciton emission dominates at temperatures above 50 K. The thermal dissociation of these bound excitons forms free excitons and neutral donors. The thermal activation energies of the bound excitons at 3.369 eV and 3.364 eV are 11 meV and 16 meV, respectively. Temperature-dependent free A exciton peak emission is fitted to the Varshni’s equation to study the variation of energy bandgap versus temperature.