Analysis of Open Discrete Time Queueing Networks: A Refined Decomposition Approach

This paper deals with approximate analysis methods for open queueing networks. External and internal flows from and to the nodes are characterized by renewal processes with discrete time distributions of their interarrival times. Stationary distributions of the waiting time, the queue size and the interdeparture times are obtained using efficient discrete time algorithms for single server (GI/G/1) and multi-server (GI/D/c) nodes with deterministic service. The network analysis is extended to semi-Markovian representations of each flow among the nodes, which include parameters of the autocorrelation function.     

Project Management Duration/Resource Tradeoff Analysis: an Application of the Cut Search Approach

The paper presents an application oriented procedure for solving the project management duration/resource tradeoff problem. A procedure is presented for reducing a project from a normal to a crash duration state at a minimum amount of additional resource expenditure assuming a linear utilization functions. The procedure is network based using a graphical Cut Search Approach to locate the minimal resource level at each reduction in total project duration. Activity-on-arc networks and flow networks are utilized. The paper is presented for practical application and for conceptual development as compared to a theoretical treatment.     

LP modeling languages for personal computers: A comparison

The purpose of this paper is to compare and contrast the modeling capabilities of seven algebraic modeling languages (ML) available today, namely, AMPL, GAMS, LINGO, LPL, MPL, PC-PROG and XPRESS-LP. In general, these MLs do an excellent job of providing an interface with which the modeler can specify an algebraically formatted linear program (LP). That is, each ML provides a substantial improvement in time and convenience over the matrix generator/report writers of the last few decades. Further, each of the MLs provides: (1) significant flexibility in model specification, instantiation and modification, (2) effective and efficient conversion from algebraic to solver format, and (3) an understandable and, for the most part, self-documenting model representation. In addition, each of the MLs is constantly being updated and upgraded to provide additional capabilities sought by practitioners and users. However, as shown in the fifteen tables provided in the body of this paper, each ML has its own set of competitive advantages. For example, the most integrated environments (i.e. those integrating the modeling language with a full-screen editor, data import capabilities and a solver) are provided by LINGO and PC-PROG. The most user-friendly interfaces are provided by MPL and PC-PROG, both of which provide window-based interfaces to create models and pop-up windows to display error messages; MPL also uses pull-down menus to specify various operations, whereas PC-PROG uses function keys for operational control. Package costs are led by a current (March, 1991) introductory offer from LINGO. Modeling effectiveness, especially with respect to flexibility in specifying arithmetic statements, is led by GAMS and LPL. Model compactness, as measured by the number of lines required to specify a model, is led by AMPL, LPL, MPL and PC-PROG; LPL, MPL and PC-PROG also provide context sensitive editors which automatically position the cursor where the error was detected. And finally, the most comprehensive user documentation is provided by GAMS, whereas GAMS, LINGO and LPL provide extensive libraries of sample models for those users who learn by example.     

Lattice size estimates for Gabor decompositions

It is shown that the Gabor frame operator for frames with lattice such thatab=1/N for some integerN1 is continuous on the modulation spaces ([9], [20]) whenever the basic functiong is a Schwartz function and (g, a, b) generates a frame forL ² (R). From this a sufficient condition on the lattice is given which guarantees that one has a Banach frame for the modulation spaces of Feichtinger.This work was supported by NSF grant # DMS-8916968 while the author was visiting Yale University.     

The reaction of allenylsilanes with α,β-unsaturated acylsilanes: new annulation approaches to five and six-membered carbocyclic compounds

The reaction of α,β-unsaturated acylsilanes with allenylsilanes can be directed to produce either five or six-membered carbocyclic compounds.     

Crystal structure of (1rs, 14sr, 17rs, 18rs)-2,20-dioxa-17-methyltricyclo [16,3,0,0] heneicosa-15-ene-3,19,21-trione; a macrocyclic lac

An X-ray study of the major product of the intramolecular Diels-Alder reaction of the diene-anhydride (2) has confirmed it as being the desired cytochalasan analogue (3). In particular the cyclisation has been regioselective, and has taken place via the endo transition state to generate the adduct with the correct relative configurations at the four chiral centres. Details of the conformational geometry of (3) are discussed.     

Assembly of colloidal particles into microwires using an alternating electric field

We have investigated the dielectrophoretic assembly of colloidal gold, carbon black, and carbon nanotubes into electrical wires. The resulting microwires have diameters less than 1 microm, with lengths ranging from 5 microm to 3 mm. Current-voltage curves for these wires indicate an ohmic response, where the resistance is determined by the type of colloid and by the frequency of the alternating field used to grow the wires. The predicted frequency dependence of dielectrophoresis is confirmed by experiment. Measurements of the threshold voltage for initial wire growth are also presented. These experiments demonstrate that a variety of nanoparticles can be assembled into microwires for sensor applications.