Enantiospecific approach to AB-ring system of the diterpenes fusicoccanes

Enantiospecific synthesis of the AB ring system of 5-8-5 tricyclic diterpenes fusicoccanes has been accomplished, starting from the readily available monoterpene (R)-limonene employing an reaction as the key step.

An Approach Toward Homocalystegines and Silyl-homocalystegines. Acid-Mediated Migrations of Acetates in Seven-Membered Ring Systems

A short access to homocalystegine analogues silylated at C7 is described. The synthesis involves the desymmetrization of a (phenyldimethylsilyl)methylcycloheptatriene using osmium-mediated dihydroxylation, followed by the diol protection and a cycloaddition involving the remaining diene moiety and an acylnitroso reagent. Additions of the osmium and acylnitroso reagents were shown, through X-ray diffraction studies of the resulting major isomers, to occur anti and syn, respectively, relative to the SiCH2 substituent. N-O bond cleavage on the resulting cycloadduct then produces the aminopolyol having a silylmethyl substituent. Oxidation of the C-Si bond also afforded an access to unusual amino-heptitols having five contiguous stereogenic centers. In the course of this work, we finally observed a unusual rearrangement taking place on cycloheptanone 18 substituted by two acetyl groups and a neighboring Boc-protected amine. A profound reorganization of the substituents on the seven-membered ring effectively took place under acidic conditions (TFA) leading to the thermodynamically more stable homocalystegine-type compound., DFT calculations of the conformational energy of isomeric silyl homocalystegines indicated that the product observed upon the acid-mediated rearrangement was the most stable of a series of analogues with various distributions of substituents along the seven-membered ring backbone. A tentative mechanism is proposed to rationalize the acetate migrations and inversions of the stereochemistry at various stereocenters.

Hydrogen Storage Capacity of Carbon-Foams: Grand Canonical Monte Carlo Simulations

Hydrogen storage in the three-dimensional carbon foams is analyzed using classical grand canonical Monte Carlo simulations. The calculated storage capacities of the foams meet the material-based DOE targets and are comparable to the capacities of a bundle of well-separated similar diameter open nanotubes. The pore sizes in the foams are optimized for the best hydrogen uptake. The capacity depends sensitively on the C-H-2 interaction potential, and therefore, the results are presented for its ``weak'' and ``strong'' choices, to offer the lower and upper bounds for the expected capacities. Furthermore, quantum effects on the effective C-H-2 as well as H-2-H-2 interaction potentials are considered. We find that the quantum effects noticeably change the adsorption properties of foams and must be accounted for even at room temperature.

Ring Resonators and Micro Fluidics: Novel Design for Drug/Disease Detection

MEMS systems are technologically developed from integrated circuit industry to create miniature sensors and actuators. Originally these semiconductor processes and materials were used to build electrical and mechanical systems, but expanded to include biological, optical fluidic magnetic and other systems 12]. Here a novel approach is suggested where in two different fields are integrated via moems, micro fluidics and ring resonators. It is well known at any preliminary stage of disease onset, many physiological changes occur in the body fluids like saliva, blood, urine etc. The drawback till now was that current calibrations are not sensitive enough to detect the minor physiological changes. This is overcome using optical detector techniques 1]. The basic concepts of ring resonators, with slight variations can be used for optical detection of these minute disease markers. A well known fact of ring resonators is that a change in refractive index will trigger a shift in the resonant wavelength 5]. The trigger for the wavelength shift in the case discussed will be the presence of disease agents. To trap the disease agents specific antibody has to be used (e. g. BSA).

1H-4,1,2-Benzothiadiazines from 1,2,3-Benzothiadiazole via Alkylbenzothiadiazolium Salts: A Novel Heterocyclic Ring Expansion Possibly via Nitrogen Ylides.

ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a “Full Text” option. The original article is trackable via the “References” option.

Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage

In the distributed storage setting that we consider, data is stored across n nodes in the network such that the data can be recovered by connecting to any subset of k nodes. Additionally, one can repair a failed node by connecting to any d nodes while downloading beta units of data from each. Dimakis et al. show that the repair bandwidth d beta can be considerably reduced if each node stores slightly more than the minimum required and characterize the tradeoff between the amount of storage per node and the repair bandwidth. In the exact regeneration variation, unlike the functional regeneration, the replacement for a failed node is required to store data identical to that in the failed node. This greatly reduces the complexity of system maintenance. The main result of this paper is an explicit construction of codes for all values of the system parameters at one of the two most important and extreme points of the tradeoff - the Minimum Bandwidth Regenerating point, which performs optimal exact regeneration of any failed node. A second result is a non-existence proof showing that with one possible exception, no other point on the tradeoff can be achieved for exact regeneration.

A Flexible Class of Regenerating Codes for Distributed Storage

In the distributed storage setting introduced by Dimakis et al., B units of data are stored across n nodes in the network in such a way that the data can be recovered by connecting to any k nodes. Additionally one can repair a failed node by connecting to any d nodes while downloading at most beta units of data from each node. In this paper, we introduce a flexible framework in which the data can be recovered by connecting to any number of nodes as long as the total amount of data downloaded is at least B. Similarly, regeneration of a failed node is possible if the new node connects to the network using links whose individual capacity is bounded above by beta(max) and whose sum capacity equals or exceeds a predetermined parameter gamma. In this flexible setting, we obtain the cut-set lower bound on the repair bandwidth along with a constructive proof for the existence of codes meeting this bound for all values of the parameters. An explicit code construction is provided which is optimal in certain parameter regimes.

Data compression by linear prediction for storage and transmission of EEG signals

The EEG time series has been subjected to various formalisms of analysis to extract meaningful information regarding the underlying neural events. In this paper the linear prediction (LP) method has been used for analysis and presentation of spectral array data for the better visualisation of background EEG activity. It has also been used for signal generation, efficient data storage and transmission of EEG. The LP method is compared with the standard Fourier method of compressed spectral array (CSA) of the multichannel EEG data. The autocorrelation autoregressive (AR) technique is used for obtaining the LP coefficients with a model order of 15. While the Fourier method reduces the data only by half, the LP method just requires the storage of signal variance and LP coefficients. The signal generated using white Gaussian noise as the input to the LP filter has a high correlation coefficient of 0.97 with that of original signal, thus making LP as a useful tool for storage and transmission of EEG. The biological significance of Fourier method and the LP method in respect to the microstructure of neuronal events in the generation of EEG is discussed.

Heterogeneous permanganate oxidations: Synthesis of medium ring keto-lactones via substituent directed oxidative cyclisation

Homoallyl alcohols 4a-b and 5a-b undergo smooth oxidative cyclisation to give the corresponding ring enlarged keto-lactones under heterogeneous permanganate oxidation conditions.

Planar triazinium cations from VO2+-assisted ring cyclizations: a remarkably efficient thiazole species for nuclear staining, PDT and anaerobic photocleavage of DNA

Planar triazinium cationic species, from VO2+-assisted cyclization of 1-(2-thiazolylazo)-2-naphthol, shows efficient DNA intercalative binding, visible light-induced anaerobic plasmid DNA photocleavage activity and photocytotoxicity in HeLa and MCF-7 cancer cells by an apoptotic pathway with selective localization of the compound in the nucleus as evidenced from the nuclear staining and confocal imaging.

Performance of a pipelined ring algorithm for Fast Fourier Transform on transputer arrays

In this paper a pipelined ring algorithm is presented for efficient computation of one and two dimensional Fast Fourier Transform (FFT) on a message passing multiprocessor. The algorithm has been implemented on a transputer based system and experiments reveal that the algorithm is very efficient. A model for analysing the performance of the algorithm is developed from its computation-communication characteristics. Expressions for execution time, speedup and efficiency are obtained and these expressions are validated with experimental results obtained on a four transputer system. The analytical model is then used to estimate the performance of the algorithm for different number of processors, and for different sizes of the input data.

Reactions of palladium chloride with amino spirocyclic cyclotriphosphazenes: Isolation and Crystal Structures of Novel Mono- and Bimetallic Complexes Formed by the Hydrolysis of a .lambda.5-Diazaphospholane Ring

The reaction of the amino spirocyclic cyclotriphosphazene N3P3(NMe2)4(NHCH2CH2CH2NH) (2) with palladium chloride gives the stable chelate complex [PdCl2.2] (4). An X-ray crystallographic study reveals that one of the nitrogen atoms of the diaminoalkane moiety and an adjacent phosphazene ring nitrogen atom are bonded to the metal. An analogous reaction with the phosphazene N3P3(NMe2)4(NHCH2CH2NH) (1) gives initially a similar complex which undergoes facile hydrolysis to give the novel monometallic and bimetallic complexes [PdCl2.HN3P3(O)(NMe2)4(NHCH2CH2NH2)] (5) and [PdCl{N3P3(NMe2)4(NCH2CH2NH2)}]2(O) (6), which have been structurally characterized; in the former, an (oxophosphazadienyl)ethylenediamine is chelated to the metal whereas, in the latter, an oxobridged bis(cyclotriphosphazene) acts as a hexadentate nitrogen donor ligand in its dianionic form. Crystal data for 4 : a = 14.137(1) angstrom, b = 8.3332(5) angstrom, c = 19.205(2) angstrom, beta = 96.108(7)degrees, P2(1)/c, Z = 4, R = 0.027 with 3090 reflections (F > 5sigma(F)). Crystal data for 5 : a = 8.368(2) angstrom, b = 16.841(4) A, c = 16.092(5) angstrom, beta = 98.31(2)degrees, P2(1)/n, Z = 4, R = 0.049 with 3519 reflections (F > 5sigma(F)). Crystal data for 6 : a = 22.455(6) angstrom, b = 14.882(3) angstrom, c = 13.026(5) angstrom, 6 = 98.55(2)degrees, C2/c, Z = 4, R = 0.038 with 3023 reflections (F > 5sigma(F)).

Design issues and caching strategies for CD-ROM based multimedia storage

CD-ROMs have proliferated as a distribution media for desktop machines for a large variety of multimedia applications (targeted for a single-user environment) like encyclopedias, magazines and games. With CD-ROM capacities up to 3 GB being available in the near future, they will form an integral part of Video on Demand (VoD) servers to store full-length movies and multimedia. In the first section of this paper we look at issues related to the single- user desktop environment. Since these multimedia applications are highly interactive in nature, we take a pragmatic approach, and have made a detailed study of the multimedia application behavior in terms of the I/O request patterns generated to the CD-ROM subsystem by tracing these patterns. We discuss prefetch buffer design and seek time characteristics in the context of the analysis of these traces. We also propose an adaptive main-memory hosted cache that receives caching hints from the application to reduce the latency when the user moves from one node of the hyper graph to another. In the second section we look at the use of CD-ROM in a VoD server and discuss the problem of scheduling multiple request streams and buffer management in this scenario. We adapt the C-SCAN (Circular SCAN) algorithm to suit the CD-ROM drive characteristics and prove that it is optimal in terms of buffer size management. We provide computationally inexpensive relations by which this algorithm can be implemented. We then propose an admission control algorithm which admits new request streams without disrupting the continuity of playback of the previous request streams. The algorithm also supports operations such as fast forward and replay. Finally, we discuss the problem of optimal placement of MPEG streams on CD-ROMs in the third section.

Pipelined ring algorithm for matrix multiplication on transputer networks: performance analysis and estimation

A parallel matrix multiplication algorithm is presented, and studies of its performance and estimation are discussed. The algorithm is implemented on a network of transputers connected in a ring topology. An efficient scheme for partitioning the input matrices is introduced which enables overlapping computation with communication. This makes the algorithm achieve near-ideal speed-up for reasonably large matrices. Analytical expressions for the execution time of the algorithm have been derived by analysing its computation and communication characteristics. These expressions are validated by comparing the theoretical results of the performance with the experimental values obtained on a four-transputer network for both square and irregular matrices. The analytical model is also used to estimate the performance of the algorithm for a varying number of transputers and varying problem sizes. Although the algorithm is implemented on transputers, the methodology and the partitioning scheme presented in this paper are quite general and can be implemented on other processors which have the capability of overlapping computation with communication. The equations for performance prediction can also be extended to other multiprocessor systems.