Cyclic Imide and Open-Chain Amide Carboxylic Acid Derivatives from the Facile Reaction of cis-Cyclohexane-1,2-dicarboxylic Anhydride with Three Substituted Anilines

The structures of the compounds from the reaction of cis-cyclohexane-1,2-dicarboxylic anhydride with 4-chloroaniline [rac-N-(4-chlorophenyl)-2-carboxycycloclohexane-1-carboxamide] (1), 4-bromoaniline [2-(4-bromophenyl)-perhydroisoindolyl-1,3-dione] (2) and 3-hydroxy-4-carboxyaniline (5-aminosalicylic acid) [2-(3-hydroxy-4-carboxyphenyl)-perhydroisoindolyl-1,3-dione] (3) have been determined at 200 K. Crystals of the open-chain amide carboxylic acid 1 are orthorhombic, space group Pbcn, with unit cell dimensions a = 20.1753(10), b = 8.6267(4), c = 15.9940(9) Å, and Z = 8. Compounds 2 and 3 are cyclic imides, with 1 monoclinic having space group P21 and cell dimensions a = 11.5321(3), b = 6.7095(2), c = 17.2040(5) Å, β = 102.527(3)o. Compound 3 is orthorhombic with cell dimensions a = 6.4642(3), b = 12.8196(5), c = 16.4197(7) Å. Molecules of 1 form hydrogen-bonded cyclic dimers which are extended into a two-dimensional layered structure through amide-group associations: 3 forms into one-dimensional zigzag chains through carboxylic acid…imide O-atom hydrogen bonds, while compound 2 is essentially unassociated. With both cyclic imides 2 and 3, disorder is found which involves the presence of partial enantiomeric replacement of the cis-cyclohexane-1,2-substituted ring systems.

Proton-transfer and non-transfer compounds of the multi-purpose drug dapsone [4-(4-Aminophenylsulfonyl)aniline] with 3,5-dinitrosalicylic acid and 5-nitroisophthalic acid

The structures of the compounds from the reaction of the drug dapsone [4-(4-aminophenylsulfonyl)aniline] with 3,5-dinitrosalicylic acid, the salt hydrate [4-(4-aminohenylsulfonyl)anilinium 2-carboxy-4,6-dinitrophenolate monohydrate] (1) and the 1:1 adduct with 5-nitroisophthalic acid [4-(4-aminophenylsulfonyl)aniline 5-nitrobenzene-1,3-dicarboxylic acid] (2) have been determined. Crystals of 1 are triclinic, space group P-1, with unit cell dimensions a = 8.2043(3), b = 11.4000(6), c = 11.8261(6)Å, α = 110.891(5), β = 91.927(3), γ = 98.590(4)deg. and Z = 4. Compound 2 is orthorhombic, space group Pbcn, with unit cell dimensions a = 20.2662(6), b = 12.7161(4), c = 15.9423(5)Å and Z = 8. In 1, intermolecular analinium N-H…O and water O-H…O and O-H…N hydrogen-bonding interactions with sulfone, carboxyl, phenolate and nitro O-atom and aniline N-atom acceptors give a two-dimensional layered structure. With 2, the intermolecular interactions involve both aniline N-H…O and carboxylic acid O-H…O and O-H…N hydrogen bonds to sulfone, carboxyl, nitro and aniline acceptors, giving a three-dimensional network structure. In both structures π--π aromatic ring associations are present.

Four-dimensional current algebra from Chern-Simons theory

We study an abelian Chern-Simons theory on a five-dimensional manifold with boundary. We find it to be equivalent to a higher-derivative generalization of the abelian Wess-Zumino-Witten model on the boundary. It contains a U(1) current algebra with an operational extension.

Single-Generation Network Coding for Networks with Delay

A single-source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the incoming symbols (received at their incoming edges) on their outgoing edges. Memory-free networks with delay using network coding are forced to do inter-generation network coding, as a result of which the problem of some or all sinks requiring a large amount of memory for decoding is faced. In this work, we address this problem by utilizing memory elements at the internal nodes of the network also, which results in the reduction of the number of memory elements used at the sinks. We give an algorithm which employs memory at all the nodes of the network to achieve single- generation network coding. For fixed latency, our algorithm reduces the total number of memory elements used in the network to achieve single- generation network coding. We also discuss the advantages of employing single-generation network coding together with convolutional network-error correction codes (CNECCs) for networks with unit- delay and illustrate the performance gain of CNECCs by using memory at the intermediate nodes using simulations on an example network under a probabilistic network error model.

Contractive Hilbert modules and their dilations

In this note, we show that a quasi-free Hilbert module R defined over the polydisk algebra with kernel function k(z,w) admits a unique minimal dilation (actually an isometric co-extension) to the Hardy module over the polydisk if and only if S (-1)(z, w)k(z, w) is a positive kernel function, where S(z,w) is the Szego kernel for the polydisk. Moreover, we establish the equivalence of such a factorization of the kernel function and a positivity condition, defined using the hereditary functional calculus, which was introduced earlier by Athavale [8] and Ambrozie, Englis and Muller [2]. An explicit realization of the dilation space is given along with the isometric embedding of the module R in it. The proof works for a wider class of Hilbert modules in which the Hardy module is replaced by more general quasi-free Hilbert modules such as the classical spaces on the polydisk or the unit ball in a'', (m) . Some consequences of this more general result are then explored in the case of several natural function algebras.

Mining Unit Tests for Discovery and Migration of Math APIs

Today's programming languages are supported by powerful third-party APIs. For a given application domain, it is common to have many competing APIs that provide similar functionality. Programmer productivity therefore depends heavily on the programmer's ability to discover suitable APIs both during an initial coding phase, as well as during software maintenance. The aim of this work is to support the discovery and migration of math APIs. Math APIs are at the heart of many application domains ranging from machine learning to scientific computations. Our approach, called MATHFINDER, combines executable specifications of mathematical computations with unit tests (operational specifications) of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code comprised of API methods to compute the expression by mining unit tests of the API methods. We present a sequential version of our unit test mining algorithm and also design a more scalable data-parallel version. We perform extensive evaluation of MATHFINDER (1) for API discovery, where math algorithms are to be implemented from scratch and (2) for API migration, where client programs utilizing a math API are to be migrated to another API. We evaluated the precision and recall of MATHFINDER on a diverse collection of math expressions, culled from algorithms used in a wide range of application areas such as control systems and structural dynamics. In a user study to evaluate the productivity gains obtained by using MATHFINDER for API discovery, the programmers who used MATHFINDER finished their programming tasks twice as fast as their counterparts who used the usual techniques like web and code search, IDE code completion, and manual inspection of library documentation. For the problem of API migration, as a case study, we used MATHFINDER to migrate Weka, a popular machine learning library. Overall, our evaluation shows that MATHFINDER is easy to use, provides highly precise results across several math APIs and application domains even with a small number of unit tests per method, and scales to large collections of unit tests.

Relativistic quark models and the current algebra

In this thesis we are concerned with finding representations of the algebra of SU(3) vector and axial-vector charge densities at infinite momentum (the "current algebra") to describe the mesons, idealizing the real continua of multiparticle states as a series of discrete resonances of zero width. Such representations would describe the masses and quantum numbers of the mesons, the shapes of their Regge trajectories, their electromagnetic and weak form factors, and (approximately, through the PCAC hypothesis) pion emission or absorption amplitudes.

We assume that the mesons have internal degrees of freedom equivalent to being made of two quarks (one an antiquark) and look for models in which the mass is SU(3)-independent and the current is a sum of contributions from the individual quarks. Requiring that the current algebra, as well as conditions of relativistic invariance, be satisfied turns out to be very restrictive, and, in fact, no model has been found which satisfies all requirements and gives a reasonable mass spectrum. We show that using more general mass and current operators but keeping the same internal degrees of freedom will not make the problem any more solvable. In particular, in order for any two-quark solution to exist it must be possible to solve the "factorized SU(2) problem," in which the currents are isospin currents and are carried by only one of the component quarks (as in the K meson and its excited states).

In the free-quark model the currents at infinite momentum are found using a manifestly covariant formalism and are shown to satisfy the current algebra, but the mass spectrum is unrealistic. We then consider a pair of quarks bound by a potential, finding the current as a power series in 1/m where m is the quark mass. Here it is found impossible to satisfy the algebra and relativistic invariance with the type of potential tried, because the current contributions from the two quarks do not commute with each other to order 1/m³. However, it may be possible to solve the factorized SU(2) problem with this model.

The factorized problem can be solved exactly in the case where all mesons have the same mass, using a covariant formulation in terms of an internal Lorentz group. For a more realistic, nondegenerate mass there is difficulty in covariantly solving even the factorized problem; one model is described which almost works but appears to require particles of spacelike 4-momentum, which seem unphysical.

Although the search for a completely satisfactory model has been unsuccessful, the techniques used here might eventually reveal a working model. There is also a possibility of satisfying a weaker form of the current algebra with existing models.

Synthesis and structure of 1:1 complex of ethylphenyltin dichloride with N-4-methoxyphenyl-2-hydroxynaphthylideneimine

A novel organotin complex, EtPhSnCl(2) . 2HOC(10)H(6)CH = NC6H1OCH3 was synthesized, and its crystal structure was determined by X-ray diffraction method. The crystal is triclinic, belonging to space group, with unit cell parameters a = 1.150 8(5) nm, b = 1. 153 1(5) gm, c = 1. 004 6 (3) nm, alpha = 94. 15 (3)degrees, beta = 115.47 (3)degrees, r = 85. 94 (4)degrees, V = 1199 7(1) nm(3), Z=2, D-c=1.68 g/cm(3), mu=13. 20 cm(-1), F(000)=618 for 4 131 reflections tions. R=0. 047, R(w)=0. 047. The ligand coordinates to tin atom via phenolic oxygen atom. The complex has a distored trigonal bipyramidal structure, the phenolic oxygen atom of the ligand and one of two chlorine atoms occupy the axial position. The distance between noncoodinated nitrogen atom with phenolic oxygen atom is 0. 257 4 nm, which indicates that the intramolecular hydrogen bond of Schiff base ligand is retained in the complex.

Crystal and molecular structure of the complex of methoxycarbonylethyltin trichloride with salicylidene-m-toluidine

The synthesis and properties of the title complex CH3OCOCH2CH2SnCl3.2-HOC6H4CH=NC6H4-3'-CH3 are described. It crystallizes from benzene in the monoclinic space group P2(1/n) with unit cell dimensions a=10.326 (C),b=6.815(8), c=12.931(6) Angstrom, beta =111.52(3,)degrees, V=2088.7(1) Angstrom (3), Z=4, F(000) =1040, mu =16.31 cm(-1), Dc=1. 67g/cm(3) final R factor is 0.037 for 3177 observed reflections, 1 greater than or equal to3 sigma (1(0)). The tin atom in the structure of the complex exists in a distored octahedral geometry defined by three Cl atoms, the C and O atoms of a chelating methoxycarbonylethyl. group as well as an O atom derived from the Schiff base ligand.

Low temperature crystal structure of N-Acetyl-L-Glutamic acid: comparison with the DFT calculated structure

N-acetyl-L-glutamic acid, crystallizes in the orthorhombic space group P2(1)2(1)2(1) with unit cell parameters a = 4.747(3), b = 12.852(7), c = 13.906(7) Å, V = 848.5(8) Å3, Z = 4, density (calculated) = 1.481 mg/m3, linear absorption coefficient 0.127 mm−1. The crystal structure determination was carried out with MoKalpha X-ray data measured with liquid nitrogen cooling at 100(2) K temperature. In the final refinement cycle the data/restraints/parameter ratios were 1,691/0/131; goodness-of-fit on F(2) = 1.122. Final R indices for [I > 2sigma(I)] were R1 = 0.0430, wR2 = 0.0878 and R indices (all data) R1 = 0.0473, wR2 = 0.0894. The largest electron density difference peak and hole were 0.207 and −0.154 eÅ(−3). Details of the molecular geometry are discussed and compared with a model DFT structure calculated using Gaussian 98.

Finite dimensional semigroup quadratic algebras with the minimal number of relations

A quadratic semigroup algebra is an algebra over a field given by the generators x_1, . . . , x_n and a finite set of quadratic relations each of which either has the shape x_j x_k = 0 or the shape x_j x_k = x_l x_m . We prove that a quadratic semigroup algebra given by n generators and d=(n^2+n)/4 relations is always infinite dimensional. This strengthens the Golod–Shafarevich estimate for the above class of algebras. Our main result however is that for every n, there is a finite dimensional quadratic semigroup algebra with n generators and d_n relations, where d_n is the first integer greater than (n^2+n)/4 . That is, the above Golod–Shafarevich-type estimate for semigroup algebras is sharp.

Deciding Kleene Algebra Terms Equivalence in Coq

This paper presents a mechanically verified implementation of an algorithm for deciding the equivalence of Kleene algebra terms within the Coq proof assistant. The algorithm decides equivalence of two given regular expressions through an iterated process of testing the equivalence of their partial derivatives and does not require the construction of the corresponding automata. Recent theoretical and experimental research provides evidence that this method is, on average, more efficient than the classical methods based on automata. We present some performance tests, comparisons with similar approaches, and also introduce a generalization of the algorithm to decide the equivalence of terms of Kleene algebra with tests. The motivation for the work presented in this paper is that of using the libraries developed as trusted frameworks for carrying out certified program verification.