Multiply Nitrated High‐Energy Dense Oxidizers Derived from the Simple Amino Acid Glycine

Various energetic polynitro esters, carbamates, and nitrocarbamates that were derived from the amino acid glycine were fully characterized by single‐crystal X‐ray diffraction, vibrational spectroscopy (IR and Raman), multinuclear NMR spectroscopy, elemental analysis, and differential scanning calorimetry (DSC). Owing to their positive oxygen balance, the suitability of these compounds as potential oxidizers in energetic formulations was investigated and discussed. In addition, the heats of formation of the products were calculated by using the Gaussian 09 program package at the CBS‐4M level of theory. From these values and the calculated densities (from the X‐ray data), several detonation parameters, such as detonation pressure, velocity, energy, and temperature, were computed by using the EXPLO5 code. Furthermore, their sensitivities towards impact, friction, and electrostatic discharge were tested by using a drop hammer, a friction tester (both BAM certified), and a small‐scale electrical‐discharge device, respectively.     

Synthesis of diblock methylcellulose derivatives with regioselective functionalization patterns

This article describes a new synthesis strategy to prepare diblock copolymers as model compounds for industrially produced cellulose ethers exemplified with methylcellulose (MC). To elucidate a key structure for thermoreversible gelation of MC, five regioselectively methylated celluloses 1 – 5 (236, 23, 26, 3, and 6 MC), five corresponding methyl‐β‐D‐glucopyranosyl‐(1→4)‐cellulosides 6 – 10 , and five equiv methyl‐β‐D‐glucopyranosyl‐(1→4)‐β‐D‐glucopyranosyl‐(1→4)‐cellulosides 11 – 15 were synthesized for the first time via combination of the glycosyl trichloroacetimidate method and the acid‐catalyzed methanolysis method. The structure of compounds 1 – 15 was confirmed by means of NMR spectroscopy and MALDI‐TOF MS. © 2011 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem, 2011     

Demand dispersion and logistics costs in one-to-many distribution systems

When an organization decides on which groups of consumers it should target, the locations of these target consumers often play a role. Methods from the field of market segmentation are able to identify target groups with high benefit levels, but the expected costs of supplying products to the target groups are less well understood. These costs can play a large role if the locations of the customers, the demand locations, are geographically widely dispersed. This paper focuses on one-to-many distribution systems in which a central facility serves all demand points. We derive accurate logistics cost estimates from the dispersion of demand points for such systems, enabling a comparison of the expected logistics costs of different candidate target groups. The most accurate measure combines the average distance from the demand locations to a central location and the mutual distances between neighboring demand locations. The average of the distances between all pairs of locations forms a good alternative measure.     

Choiceless polynomial time

Turing machines define polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model whose machines do not distinguish between isomorphic structures and compute exactly PTime properties? This question can be recast as follows: Does there exist a logic that captures polynomial time (without presuming the presence of a linear order)? Earlier, one of us conjectured a negative answer. The problem motivated a quest for stronger and stronger PTime logics. All these logics avoid arbitrary choice. Here we attempt to capture the choiceless fragment of PTime. Our computation model is a version of abstract state machines (formerly called evolving algebras). The idea is to replace arbitrary choice with parallel execution. The resulting logic expresses all properties expressible in any other PTime logic in the literature. A more difficult theorem shows that the logic does not capture all of PTime.