Line graphs of bipartite graphs with Hamiltonian paths

It is shown that, if t is an integer ≥3 and not equal to 7 or 8, then there is a unique maximal graph having the path P_t as a star complement for the eigenvalue ?2. The maximal graph is the line graph of K_m,m if t = 2m?1, and of K_m,m+1 if t = 2m. This result yields a characterization of L(G ) when G is a (t + 1)‐vertex bipartite graph with a Hamiltonian path. The graphs with star complement P_r ∪ P_s or P_r ∪ C_s for ?2 are also determined. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 137–149, 2003     

Study of the gas-phase parameters affecting the silicon-oxide film deposition induced by an ArF laser

A study of the gas-phase parameters involved in ArF laser induced chemical vapour deposition of silicon-oxide thin films is presented. A complete set of experiments has been performed showing the influence of the concentration of the precursor gases, N₂O and SiH₄, and their influence on total and partial pressures on film growth and properties. In this paper we demonstrate the ability of this LCVD method to deposit silicon oxide films of different compositions and densities by appropriate control of gas composition and total pressure. Moreover, a material specific calibration plot comprising data obtained using different preparation techniques is presented, allowing determination of the stoichiometry of SiO _x films by using FTIR spectroscopy independently of the deposition method. For the range of processing conditions examined, the experimental results suggest that chemical processes governing deposition take place mainly in the gas phase.     

A Practical Solution to a Cargo Loading Problem at Bethlehem Steel

The optimum assignment of structural steel shapes to rail cars is an important logistical problem in the steel industry. In this paper, we discuss an application at Bethlehem Steel that not only involves weight and dimensional constraints, but also customer unloading constraints. The formulation is a generalized bin packing problem which is solved by modifying and extending the first fit decreasing algorithm. The solution algorithm, SOLID (for Structural Optimal Loading IDentification), has been used extensively for one of Bethlehem's high tonnage customers providing very good practical (implementable) results that achieve the desired goals. Bethlehem has enhanced this approach for use with other customers.     

On worst-case aggregation analysis for network location problems

Network location problems occur when new facilities must be located on a network, and the network distances between new and existing facilities are important. In urban, regional, or geographic contexts, there may be hundreds of thousands (or more) of existing facilities, in which case it is common to aggregate existing facilities, e.g. represent all the existing facility locations in a zip code area by a centroid. This aggregation makes the size of the problem more manageable for data collection and data processing purposes, as well as for purposes of analysis; at the same time, it introduces errors, and results in an approximating location problem being solved. There seems to be relatively little theory for doing aggregation, or evaluating the results of aggregation; most approaches are based on experimentation or computational studies. We propose a theory that has the potential to improve the means available for doing aggregation.This research was supported in part by the National Science Foundation, Grant No. DDM-9023392.     

The effect of nanoparticle shape on polymer‐nanocomposite rheology and tensile strength

Nanoparticles can influence the properties of polymer materials by a variety of mechanisms. With fullerene, carbon nanotube, and clay or graphene sheet nanocomposites in mind, we investigate how particle shape influences the melt shear viscosity η and the tensile strength τ, which we determine via molecular dynamics simulations. Our simulations of compact (icosahedral), tube or rod‐like, and sheet‐like model nanoparticles, all at a volume fraction ? ≈ 0.05, indicate an order of magnitude increase in the viscosity η relative to the pure melt. This finding evidently can not be explained by continuum hydrodynamics and we provide evidence that the η increase in our model nanocomposites has its origin in chain bridging between the nanoparticles. We find that this increase is the largest for the rod‐like nanoparticles and least for the sheet‐like nanoparticles. Curiously, the enhancements of η and τ exhibit opposite trends with increasing chain length N and with particle shape anisotropy. Evidently, the concept of bridging chains alone cannot account for the increase in τ and we suggest that the deformability or flexibility of the sheet nanoparticles contributes to nanocomposite strength and toughness by reducing the relative value of the Poisson ratio of the composite. The molecular dynamics simulations in the present work focus on the reference case where the modification of the melt structure associated with glass‐formation and entanglement interactions should not be an issue. Since many applications require good particle dispersion, we also focus on the case where the polymer‐particle interactions favor nanoparticle dispersion. Our simulations point to a substantial contribution of nanoparticle shape to both mechanical and processing properties of polymer nanocomposites. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 1882–1897, 2007     

Improved modeling and solution methods for the multi-resource routing problem

This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model routing and scheduling problems for intermodal drayage operations in which two resources (tractors and trailers) perform tasks to transport loaded and empty equipment. Tasks may be either well defined, in which both the origin and the destination of a movement are given, or flexible, in which the origin or the destination is chosen by the model. This paper proposes methods to effectively manage the number of options considered for flexible tasks (either feasible origins for a known destination or feasible destinations for a known origin). This modeling change generates sufficient options to allow for low-cost solutions while maintaining reasonable computational effort. We also propose a new solution method that uses randomized route generation. Computational results from test cases show that these changes improve the quality of solutions by at least 5% in the test cases as compared to methods from previous studies.     

Memory management optimization problems for integrated circuit simulators

In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to the great number of tests to be performed, optimization of the simulation code is of prime importance. This paper describes two mathematical models for the minimization of the memory access times for a cycle-based simulator.An integrated circuit being viewed as a directed acyclic graph, the problem consists in building a graph order on the vertices, compatible with the relation order induced by the graph, in order to minimize a cost function that represents the memory access time. For both proposed cost functions, we show that the corresponding problems are NP-complete. However, we show that the special cases where the graphs are in-trees or out-trees can be solved in polynomial time.