Diphosphazanes as Ligands: Links Betwen Phospeorus Ceiwistry and Organohetallic Cejmistry

The reactivity of several new acyclic, cyclic and bicyclic diphosphazanes towards Group-6 metal and iron carbonyls, and Pd, Pt and Rh derivatives has been studied. The structures of the products have been elucidated by IR and NMR spectroscopy and confirmed in a few instances by single crystal X-ray analyses.

Some new results regarding spikes and a heuristic for spike construction

his paper addresses the problem of minimizing the number of columns with superdiagonal nonzeroes (viz., spiked columns) in a square, nonsingular linear system of equations which is to be solved by Gaussian elimination. The exact focus is on a class of min-spike heuristics in which the rows and columns of the coefficient matrix are first permuted to block lower-triangular form. Subsequently, the number of spiked columns in each irreducible block and their heights above the diagonal are minimized heuristically. We show that ifevery column in an irreducible block has exactly two nonzeroes, i.e., is a doubleton, then there is exactly one spiked column. Further, if there is at least one non-doubleton column, there isalways an optimal permutation of rows and columns under whichnone of the doubleton columns are spiked. An analysis of a few benchmark linear programs suggests that singleton and doubleton columns can abound in practice. Hence, it appears that the results of this paper can be practically useful. In the rest of the paper, we develop a polynomial-time min-spike heuristic based on the above results and on a graph-theoretic interpretation of doubleton columns.

On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model

Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under small field size conditions. In this work, we investigate the performance of CNECCs under the error model of the network where the edges are assumed to be statistically independent binary symmetric channels, each with the same probability of error pe(0 <= p(e) < 0.5). We obtain bounds on the performance of such CNECCs based on a modified generating function (the transfer function) of the CNECCs. For a given network, we derive a mathematical condition on how small p(e) should be so that only single edge network-errors need to be accounted for, thus reducing the complexity of evaluating the probability of error of any CNECC. Simulations indicate that convolutional codes are required to possess different properties to achieve good performance in low p(e) and high p(e) regimes. For the low p(e) regime, convolutional codes with good distance properties show good performance. For the high p(e) regime, convolutional codes that have a good slope ( the minimum normalized cycle weight) are seen to be good. We derive a lower bound on the slope of any rate b/c convolutional code with a certain degree.

A simple strategy for spirocyclopentannullation of cyclic ketones. Formal total synthesis of (+/-)-acorone

A general and simple methodology for spirocyclopentannulation of cyclic ketones (or 4,4-disubstituted cyclopentenones from acyclic ketones) and its application in the synthesis of the spirodienone 7 via a prochiral precursor constituting a formal total synthesis of (+/-)-acorone (6), are described.

The generation of carbonyl compounds from acetals and ketals by iodotrichlorosilane (ITCS)

Cheap and readily available iodotrichlorosilane (SiCl4 / NaI) readily regenerates aldehydes and ketones from cyclic and acyclic acetals and ketals, in 20–60 min at ambient temperature. The reaction is highly chemoselective as phenolic ethers and esters are not cleaved. The pathway for the process is unlike any previously proposed.

Network Error Correction for Unit-Delay, Memory-Free Networks Using Convolutional Codes

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 symbols received at their incoming edges on their outgoing edges. In this work, we introduce network-error correction for single source, acyclic, unit-delay, memory-free networks with coherent network coding for multicast. A convolutional code is designed at the source based on the network code in order to correct network- errors that correspond to any of a given set of error patterns, as long as consecutive errors are separated by a certain interval which depends on the convolutional code selected. Bounds on this interval and the field size required for constructing the convolutional code with the required free distance are also obtained. We illustrate the performance of convolutional network error correcting codes (CNECCs) designed for the unit-delay networks using simulations of CNECCs on an example network under a probabilistic error model.

Synthesis and Properties of a Novel (Main-Chain)– (Side-Chain) Polymeric Peroxide

A novel (main-chain)-(side-chain) vinyl polyperoxide, poly(dipentene peroxide)(PDP), an alternating copolymer of dipentene (DP) and oxygen, has been synthesized by thermal oxidative polymerization of DP. The PDP was characterized by 1H NMR, 13C NMR, FTIR, DSC, TGA, and EI-MS studies. The overall activation energies of the degradation from Kissinger’s method were 28 and 33 kcal/mol, respectively, for the endocyclic and acyclic peroxide units. The side-chain peroxy groups were found to be thermally more stable than the main chain. Above 45°C the rate of polymerization increases sharply at a particular instant showing an “autoacceleration” with the formation of knee point. The kinetics of autoacceleration has been studied at various temperatures (45–70°C) and pressures (50–250 psi). © 2000 John Wiley&Sons, Inc. J Appl Polym Sci 79: 1549–1555, 2001

Effect of ester chemical structure and peptide bond conformation in fragmentation pathways of differently metal cationized cyclodepsipeptides

Fragmentation behavior of two classes of cyclodepsipeptides, isariins and isaridins, obtained from the fungus Isaria, was investigated in the presence of different metal ions using multistage tandem mass spectrometry (MS(n)) with collision induced dissociation (CID) and validated by NMR spectroscopy. During MS(n) process, both protonated and metal-cationized isariins generated product ions belonging to the identical `b-ion' series, exhibiting initial backbone cleavage explicitly at the beta-ester bond. Fragmentation behavior for the protonated and metal-cationized acyclic methyl ester derivative of isariins was very similar. On the contrary, isaridins during fragmentation produced ions belonging to the `b' or/and the `y' ion series depending on the nature of interacting metal ions, due to initial backbone cleavages at the beta-ester linkage or/and at a specific amide linkage. Interestingly, independent of the nature of the interacting metal ions, the product ions formed from the acyclic methyl ester derivative of isaridins belonged only to the `y-type'. Complementary NMR data showed that, while all metal ions were located around the beta-ester group of isariins, the metal ion interacting sites varied across the backbone for isaridins. Combined MS and NMR data suggest that the different behavior in sequence specific charge-driven fragmentation of isariins and isaridins is predetermined because of the constituent beta-hydroxy acid residue in isariins and the cis peptide bond in isaridins.

Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design

We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. While two-hop cooperative relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this paper, we identify two families of networks that are multi-hop generalizations of the two-hop network: K-Parallel-Path (KPP)networks and layered networks.KPP networks, can be viewed as the union of K node-disjoint parallel relaying paths, each of length greater than one. KPP networks are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the DMT of these families of networks completely for K > 3. Layered networks are networks comprising of layers of relays with edges existing only between adjacent layers, with more than one relay in each layer. We prove that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4.For multiple-antenna KPP and layered networks, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks.For arbitrary multi-terminal wireless networks with multiple source-sink pairs, the maximum achievable diversity is shown to be equal to the min-cut between the corresponding source and the sink, irrespective of whether the network has half-duplex or full-duplex relays. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable.Along the way, we derive the optimal DMT of a generalized parallel channel and derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. We also give alternative and often simpler proofs of several existing results and show that codes achieving full diversity on a MIMO Rayleigh fading channel achieve full diversity on arbitrary fading channels. All protocols in this paper are explicit and use only amplify-and-forward (AF) relaying. We also construct codes with short block-lengths based on cyclic division algebras that achieve the optimal DMT for all the proposed schemes.Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple AF protocols are often sufficient to attain the optimal DMT

Faster Algorithms for Incremental Topological Ordering.Robert Tarjan

We present two online algorithms for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm takes O(m 1/2) amortized time per arc and our second algorithm takes O(n 2.5/m) amortized time per arc, where n is the number of vertices and m is the total number of arcs. For sparse graphs, our O(m 1/2) bound improves the best previous bound by a factor of logn and is tight to within a constant factor for a natural class of algorithms that includes all the existing ones. Our main insight is that the two-way search method of previous algorithms does not require an ordered search, but can be more general, allowing us to avoid the use of heaps (priority queues). Instead, the deterministic version of our algorithm uses (approximate) median-finding; the randomized version of our algorithm uses uniform random sampling. For dense graphs, our O(n 2.5/m) bound improves the best previously published bound by a factor of n 1/4 and a recent bound obtained independently of our work by a factor of logn. Our main insight is that graph search is wasteful when the graph is dense and can be avoided by searching the topological order space instead. Our algorithms extend to the maintenance of strong components, in the same asymptotic time bounds.

Carbohydrate-based liquid crystals

The carbohydrate based mesogens have gained an importance in the field of liquid crystals, primarily through the amphiphilic nature of many sugar derivatives. A constitutional requirement for the amphiphilic mesogen is that the molecule consists of distinct regions within the molecule that separately would have different responses to changes in thermal energies and/or solvations. Such molecules can be synthesized by linking one or more alkyl chains of appropriate length to both cyclic and acyclic sugars. A driving force for the mesophase formation in these molecules is the phase segregation, leading to aggregates, possessing distinct lyophilic and hydrophilic regions. In this review, we discuss the thermotropic behavior of the carbohydrate amphiphiles. We discuss the relationship between constitutions, configurations, functionalities of the sugar component and the length of the hydrophobic chains necessary to form the various types of thermotropic phases. The influence of the linking group between the hydrophilic sugar head groups and lyophilic alkyl chains on the transition temperatures and mesophase stabilities are also presented.

Assessment of estrus cyclicity in the Asian elephant (Elephas maximus) by measurement of fecal progesterone metabolite 5 alpha-P-3OH, using a non-invasive assay

Reproductive management of the Asian elephant (Elephas maximus) is important for its conservation. To monitor its estrous cyclicity, we earlier used an indirect ELISA to show that levels of fecal progesterone (P(4))-metabolite (allopregnanolone: 5 alpha-P-3OH) in semi-captive females sampled randomly positively correlated with serum P(4) levels [12]. In this longitudinal study (51 weeks), we measured levels of fecal 5 alpha-P-3OH and serum P(4) in seven semi-captive female elephants. Females exhibited three types of hormonal profiles. Four females showed cyclical patterns of fecal 5 alpha-P-3OH and serum P(4) typical of normal estrous cycles, two showed acyclic pattern while one showed high values indicative of a pregnant animal. Values for anestrous or follicular phases were <= 0.3 mu g g(-1), (5 alpha-P-3OH) and <= 0.3 ng mL(-1) (P(4)); for luteal phase 0.32-11.09 mu g g(-1) (5 alpha-P-3OH) and 0.32-1.48 ng mL(-1) (P(4)); for pregnancy 1.41-7.38 mu g g(-1) (5 alpha-P-3OH) and 0.39-1.6 ng mL(-1) (R(4)). A positive correlation (t = 8.8, p < 0.01, n = 321) between levels of fecal 5 alpha-P-3OH and serum P4 was observed. A random sample of 30 free-ranging female elephants showed fecal 5 alpha-P-3OH values of 0.06-23.4 mu g g(-1), indicating them to be in different stages of estrous cyclicity. This study is the first to assess the reproductive phases of female Asian elephants based on the correlative-patterns of both the fecal 5 alpha-P-3OH and serum P(4) values over multiple estrous cycles. This has a potential application in the reproductive management and conservation of Asian elephants. (C) 2011 Elsevier Inc. All rights reserved.

Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance

We present two online algorithms for maintaining a topological order of a directed n-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles m arc additions in O(m(3/2)) time. For sparse graphs (m/n = O(1)), this bound improves the best previous bound by a logarithmic factor, and is tight to within a constant factor among algorithms satisfying a natural locality property. Our second algorithm handles an arbitrary sequence of arc additions in O(n(5/2)) time. For sufficiently dense graphs, this bound improves the best previous bound by a polynomial factor. Our bound may be far from tight: we show that the algorithm can take Omega(n(2)2 root(2lgn)) time by relating its performance to a generalization of the k-levels problem of combinatorial geometry. A completely different algorithm running in Theta (n(2) log n) time was given recently by Bender, Fineman, and Gilbert. We extend both of our algorithms to the maintenance of strong components, without affecting the asymptotic time bounds.

A Triangulation of CP3 as Symmetric Cube of S-2

The symmetric group acts on the Cartesian product (S (2)) (d) by coordinate permutation, and the quotient space is homeomorphic to the complex projective space a'',P (d) . We used the case d=2 of this fact to construct a 10-vertex triangulation of a'',P (2) earlier. In this paper, we have constructed a 124-vertex simplicial subdivision of the 64-vertex standard cellulation of (S (2))(3), such that the -action on this cellulation naturally extends to an action on . Further, the -action on is ``good'', so that the quotient simplicial complex is a 30-vertex triangulation of a'',P (3). In other words, we have constructed a simplicial realization of the branched covering (S (2))(3)-> a'',P (3).

A unified approach to known and unknown cases of Berge's conjecture

Berge's elegant dipath partition conjecture from 1982 states that in a dipath partition P of the vertex set of a digraph minimizing , there exists a collection Ck of k disjoint independent sets, where each dipath P?P meets exactly min{|P|, k} of the independent sets in C. This conjecture extends Linial's conjecture, the GreeneKleitman Theorem and Dilworth's Theorem for all digraphs. The conjecture is known to be true for acyclic digraphs. For general digraphs, it is known for k=1 by the GallaiMilgram Theorem, for k?? (where ?is the number of vertices in the longest dipath in the graph), by the GallaiRoy Theorem, and when the optimal path partition P contains only dipaths P with |P|?k. Recently, it was proved (Eur J Combin (2007)) for k=2. There was no proof that covers all the known cases of Berge's conjecture. In this article, we give an algorithmic proof of a stronger version of the conjecture for acyclic digraphs, using network flows, which covers all the known cases, except the case k=2, and the new, unknown case, of k=?-1 for all digraphs. So far, there has been no proof that unified all these cases. This proof gives hope for finding a proof for all k.