The convex hull of two core capacitated network design problems

The network loading problem (NLP) is a specialized capacitated network design problem in which prescribed point-to-point demand between various pairs of nodes of a network must be met by installing (loading) a capacitated facility. We can load any number of units of the facility on each of the arcs at a specified arc dependent cost. The problem is to determine the number of facilities to be loaded on the arcs that will satisfy the given demand at minimum cost.This paper studies two core subproblems of the NLP. The first problem, motivated by a Lagrangian relaxation approach for solving the problem, considers a multiple commodity, single arc capacitated network design problem. The second problem is a three node network; this specialized network arises in larger networks if we aggregate nodes. In both cases, we develop families of facets and completely characterize the convex hull of feasible solutions to the integer programming formulation of the problems. These results in turn strengthen the formulation of the NLP.Research of this author was supported in part by a Faculty Grant from the Katz Graduate School of Business, University of Pittsburgh.     

Totally dressed SDCI calculations: An application to HF and F2

Summary A previously proposed procedure including the linked and unlinked contributions due to Triple and Quadruple excitations into a size-consistent SDCI-like model has been applied to HF and F₂ single-bond systems. The procedure is a non-iterative approximation to the more general total dressing model, which is based on the intermediate Hamiltonians theory. Three basis sets have been employed: the correlation consistent cc-pVTZ basis, a similar one including 3d1f polarization functions, and another including one set of g polarization functions. Excellent agreement with experiment and high-quality calculations is obtained for both equilibrium distances and spectroscopic constants. The possibilities of the method in treating single-bond breaking are also demonstrated. Finally, the Linked and Non-Linked contributions from Triple and Quadruple excitations are analysed separately and it is suggested that the addition of the linked triples to the size-consistent SDCI is sufficient to have quantitatively correct spectroscopic properties in going from the size-consistent SDCI to nearly experimental values.     

高分子结晶的新进展、新模型

回顾了高分子结晶经典模型－成核与生长模型，讨论了近年来高分子结晶研究的新结果，新进展，特别介绍了德国著名高分子物理学家Strobl提出的高分子结晶是从熔体先形成中间相，中间相转变为小晶块，最后小晶块融合为均匀为片晶的全新模型。     

Intermediate error estimates

Let R[f] be the remainder of some approximation method, having estimates of the form f;R[f]f; ρ_i ; f⁽ⁱ⁾ for i = 0,…, r. In many cases, ρ₀ and ρ_r are known, but not the intermediate error constants ρ₁,…,ρ_r−1. For periodic functions, Ligun (1973) has obtained an estimate for these intermediate error constants by ρ₀ and ρ_r. In this paper, we show that this holds in the nonperiodic case, too. For instance, the estimates obtained can be applied to the error of polynomial or spline approximation and interpolation, or to numerical integration and differentiation.     

An ant colony algorithm for the pos/neg weighted p-median problem

Let a graph G = (V, E) with vertex set V and edge set E be given. The classical graph version of the p-median problem asks for a subset of cardinality p, so that the (weighted) sum of the minimum distances from X to all other vertices in V is minimized. We consider the semi-obnoxious case, where every vertex has either a positive or a negative weight. This gives rise to two different objective functions, namely the weighted sum of the minimum distances from X to the vertices in V\X and, differently, the sum over the minimum weighted distances from X to V\X. In this paper an Ant Colony algorithm with a tabu restriction is designed for both problems. Computational results show its superiority with respect to a previously investigated variable neighborhood search and a tabu search heuristic.This research has partially been supported by the Spezialforschungsbereich F 003 “Optimierung und Kontrolle”, Projektbereich Diskrete Optimierung.     

Generalized structure of higher order nonclassicality

A generalized notion of higher order nonclassicality (in terms of higher order moments) is introduced. Under this generalized framework of higher order nonclassicality, conditions of higher order squeezing and higher order subpoissonian photon statistics are derived. A simpler form of the Hong-Mandel higher order squeezing criterion is derived under this framework by using an operator ordering theorem introduced by us in [A. Pathak, J. Phys. A 33 (2000) 5607]. It is also generalized for multi-photon Bose operators of Brandt and Greenberg. Similarly, condition for higher order subpoissonian photon statistics is derived by normal ordering of higher powers of number operator. Further, with the help of simple density matrices, it is shown that the higher order antibunching (HOA) and higher order subpoissonian photon statistics (HOSPS) are not the manifestation of the same phenomenon and consequently it is incorrect to use the condition of HOA as a test of HOSPS. It is also shown that the HOA and HOSPS may exist even in absence of the corresponding lower order phenomenon. Binomial state, nonlinear first order excited squeezed state (NLESS) and nonlinear vacuum squeezed state (NLVSS) are used as examples of quantum state and it is shown that these states may show higher order nonclassical characteristics. It is observed that the Binomial state which is always antibunched, is not always higher order squeezed and NLVSS which shows higher order squeezing does not show HOSPS and HOA. The opposite is observed in NLESS and consequently it is established that the HOSPS and HOS are two independent signatures of higher order nonclassicality.     

Intermittent dissipation and lack of universality in one-dimensional Alfvénic turbulence

The randomly driven Cohen–Kulsrud–Burgers equation is used to study the influence of viscous intermediate shocks (IS) on Alfvénic turbulence. Some of these structures are unstable and undergo gradient collapse leading, as the viscosity is reduced, to increasingly intermittent dissipation bursts. The slow decay at intermediate scales of stable IS prevents the existence of a usual inertial range. Furthermore, the dissipation is unable to adiabatically compensate for the energy injection, making the total energy sensitive to the viscosity parameter. Turbulence thus looses its universal character. Preliminary simulations extend these conclusions to magnetohydrodynamic equations with anisotropic viscosity, typical of strongly magnetized plasmas.     

Network DEA approach to airports performance assessment considering undesirable outputs

In this paper, a directional distance approach is proposed to deal with network DEA problems in which the processes may generate not only desirable final outputs but also undesirable outputs. The proposed approach is applied to the problem of modelling and benchmarking airport operations. The corresponding network DEA model considers two process (Aircraft Movement and Aircraft Loading) with two final outputs (Annual Passenger Movement and Annual Cargo handled), one intermediate product (Aircraft Traffic Movements) and two undesirable outputs (Number of Delayed Flights and Accumulated Flight Delays). The proposed approach has been applied to Spanish airports data for year 2008 comparing the computed directional distance efficiency scores with those obtained using a conventional, single-process directional distance function approach. From this comparison, it can be concluded that the proposed network DEA approach has more discriminatory power than its single-process counterpart, uncovering more inefficiencies and providing more valid results.     

Network DEA pitfalls: Divisional efficiency and frontier projection under general network structures

Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs). Recently network DEA models been developed to examine the efficiency of DMUs with internal structures. The internal network structures range from a simple two-stage process to a complex system where multiple divisions are linked together with intermediate measures. In general, there are two types of network DEA models. One is developed under the standard multiplier DEA models based upon the DEA ratio efficiency, and the other under the envelopment DEA models based upon production possibility sets. While the multiplier and envelopment DEA models are dual models and equivalent under the standard DEA, such is not necessarily true for the two types of network DEA models. Pitfalls in network DEA are discussed with respect to the determination of divisional efficiency, frontier type, and projections. We point out that the envelopment-based network DEA model should be used for determining the frontier projection for inefficient DMUs while the multiplier-based network DEA model should be used for determining the divisional efficiency. Finally, we demonstrate that under general network structures, the multiplier and envelopment network DEA models are two different approaches. The divisional efficiency obtained from the multiplier network DEA model can be infeasible in the envelopment network DEA model. This indicates that these two types of network DEA models use different concepts of efficiency. We further demonstrate that the envelopment model’s divisional efficiency may actually be the overall efficiency.     

Seven‐Step Continuous Flow Synthesis of Linezolid Without Intermediate Purification

Herein, the blockbuster antibacterial drug linezolid is synthesized from simple starting blocks by a convergent continuous flow sequence involving seven (7) chemical transformations. This is the highest total number of distinct reaction steps ever performed in continuous flow without conducting solvent exchanges or intermediate purification. Linezolid was obtained in 73 % isolated yield in a total residence time of 27 minutes, corresponding to a throughput of 816 mg h^?1.