Succinate and malate improve development of hamster eight-cell embryos in vitro: Confirmation of viability by embryo transfer

The in vitro development of hamster preimplantation embryos is supported by non-glucose energy substrates. To investigate the importance of embryonic metabolism, influence of succinate and malate on the development of hamster 8-cell embryos to blastocysts was examined using a chemically defined protein-free modified hamster embryo culture medium-2 (HECM-2m). There was a dose-dependent influence of succinate on blastocyst development; 0.5 mM succinate was optimal (85.1% ± 3.9 vs. 54.5% ± 3.5). In succinate-supplemented HECM-2m, blastocyst development was reduced by omission of lactate (68.5% ± 7.2), but not pyruvate (85.8% ± 6.2) or glutamine (84.1% ± 2.1). Succinate along with either glutamine or lactate or pyruvate poorly supported blastocyst development (28%-58%). Malate also stimulated blastocyst development; 0.01 mM malate was optimal (86.3% ± 2.8). Supplementation of both succinate and malate to HECM-2m supported maximal (100%) blastocyst development, which was inhibited 4-fold by the addition of glucose/phosphate. The mean cell numbers (MCN) of blastocysts cultured in succinate-supplemented HECM-2m was higher (28.3 ± 1.1) than it was for those cultured in the absence of glutamine or pyruvate (range 20-24). The MCN was the highest (33.4 ± 1.6) for blastocysts cultured in succinate-malate-supplemented HECM-2m followed by those in succinate (28.3 ± 1.1) or malate (24.7 ± 0.5) supplemented HECM-2m. Embryo transfer experiments showed that 29.8% (±4.5) of transferred blastocysts cultured in succinate-malate-supplemented HECM-2m produced live births, similar (P > 0.1) to the control transfers of freshly recovered 8-cells (33.5% ± 2.0) or blastocysts (28.9% ± 3.0). These data show that supplementation of succinate and malate to HECM-2m supports 100% development of hamster 8-cell embryos to high quality viable blastocysts and that non-glucose oxidizable energy substrates are the most preferred components in hamster embryo culture medium. Mol. Reprod. Dev. 47:440-447, 1997. © 1997 Wiley-Liss, Inc.

Confirmation of linkage and refinement of the RP28 locus for autosomal recessive retinitis pigmentosa on chromosome 2p14-p15 in an Indian family

PURPOSE: To report the linkage analysis of retinitis pigmentosa (RP) in an Indian family. METHODS: Individuals were examined for symptoms of retinitis pigmentosa and their blood samples were withdrawn for genetic analysis. The disorder was tested for linkage to known 14 adRP and 22 arRP loci using microsatellite markers. RESULTS: Seventeen individuals including seven affecteds participated in the study. All affected individuals had typical RP. The age of onset of the disease ranged from 8-18 years. The disorder in this family segregated either as an autosomal recessive trait with pseudodominance or an autosomal dominant trait. Linkage to an autosomal recessive locus RP28 on chromosome 2p14-p15 was positive with a maximum two-point lod score of 3.96 at theta=0 for D2S380. All affected individuals were homozygous for alleles at D2S2320, D2S2397, D2S380, and D2S136. Recombination events placed the minimum critical region (MCR) for the RP28 gene in a 1.06 cM region between D2S2225 and D2S296. CONCLUSIONS : The present data confirmed linkage of arRP to the RP28 locus in a second Indian family. The RP28 locus was previously mapped to a 16 cM region between D2S1337 and D2S286 in a single Indian family. Haplotype analysis in this family has further narrowed the MCR for the RP28 locus to a 1.06 cM region between D2S2225 and D2S296. Of 15 genes reported in the MCR, 14 genes (KIAA0903, OTX1, MDH1, UGP2, VPS54, PELI1, HSPC159, FLJ20080, TRIP-Br2, SLC1A4, KIAA0582, RAB1A, ACTR2, and SPRED2) are either expressed in the eye or retina. Further study needs to be done to test which of these genes is mutated in patients with RP linked to the RP28 locus.

Confirmation of pauling's theory that vitamin C improves immunity to infection

It is pointed out that the complement Clq, associated with the immune response system, has a part containing about 80 residues with a collagen-like sequence, with Gly at every third location and having also a number of Hyp and Hyl residues in locations before Gly, and that it takes the triple-helical conformation characteristic of collagen. As with collagen biosynthesis, ascorbic acid is therefore expected to be required for its production. Also, collagen itself, in the extracellular matrix, is connected with the fibroblast surface protein (FSP), whose absence leads to cell proliferation, and whose addition leads to suppression of malignancy in tissue culture. All these show the great importance of vitamin C for resistance to diseases, and even to cancer, as has been widely advocated by Pauling.

Enantiospecific first total synthesis and confirmation of the relative and absolute stereostructure of isocalamusenone

The enantiospecific total synthesis of two epimers of the sesquiterpene isocalamusenone has been accomplished starting from the readily available monoterpene (R)-limonene which of the natural product established the stereostructure and the absolute configuration (C) 2010 Elsevier Ltd All rights reserved

Enantiospecific synthesis and confirmation of the relative and absolute stereostructure of 11-hydroxyguaiadienes

Enantiospecific total synthesis of two epimeric sesquiterpenes 11-hydroxyguaiadienes has been accomplished starting from the readily available monoterpene (R)-limonene, which confirmed the structure and absolute configuration of the natural products. (C) 2010 Elsevier Ltd. All rights reserved.

Fracture analysis of concrete using singular fractal functions with lattice beam network and confirmation with acoustic emission study

In the present study singular fractal functions (SFF) were used to generate stress-strain plots for quasibrittle material like concrete and cement mortar and subsequently stress-strain plot of cement mortar obtained using SFF was used for modeling fracture process in concrete. The fracture surface of concrete is rough and irregular. The fracture surface of concrete is affected by the concrete's microstructure that is influenced by water cement ratio, grade of cement and type of aggregate 11-41. Also the macrostructural properties such as the size and shape of the specimen, the initial notch length and the rate of loading contribute to the shape of the fracture surface of concrete. It is known that concrete is a heterogeneous and quasi-brittle material containing micro-defects and its mechanical properties strongly relate to the presence of micro-pores and micro-cracks in concrete 11-41. The damage in concrete is believed to be mainly due to initiation and development of micro-defects with irregularity and fractal characteristics. However, repeated observations at various magnifications also reveal a variety of additional structures that fall between the `micro' and the `macro' and have not yet been described satisfactorily in a systematic manner [1-11,15-17]. The concept of singular fractal functions by Mosolov was used to generate stress-strain plot of cement concrete, cement mortar and subsequently the stress-strain plot of cement mortar was used in two-dimensional lattice model [28]. A two-dimensional lattice model was used to study concrete fracture by considering softening of matrix (cement mortar). The results obtained from simulations with lattice model show softening behavior of concrete and fairly agrees with the experimental results. The number of fractured elements are compared with the acoustic emission (AE) hits. The trend in the cumulative fractured beam elements in the lattice fracture simulation reasonably reflected the trend in the recorded AE measurements. In other words, the pattern in which AE hits were distributed around the notch has the same trend as that of the fractured elements around the notch which is in support of lattice model. (C) 2011 Elsevier Ltd. All rights reserved.

TCP: thread contention predictor for parallel programs

With proliferation of chip multicores (CMPs) on desktops and embedded platforms, multi-threaded programs have become ubiquitous. Existence of multiple threads may cause resource contention, such as, in on-chip shared cache and interconnects, depending upon how they access resources. Hence, we propose a tool - Thread Contention Predictor (TCP) to help quantify the number of threads sharing data and their sharing pattern. We demonstrate its use to predict a more profitable shared, last level on-chip cache (LLC) access policy on CMPs. Our cache configuration predictor is 2.2 times faster compared to the cycle-accurate simulations. We also demonstrate its use for identifying hot data structures in a program which may cause performance degradation due to false data sharing. We fix layout of such data structures and show up-to 10% and 18% improvement in execution time and energy-delay product (EDP), respectively.

A distributed TDMA slot scheduling algorithm for spatially correlated contention in WSNs

In wireless sensor networks (WSNs) the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting at the same time. Such a situation is known as spatially correlated contention. The random access methods to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation of spatially correlated contention persists only for a short duration and therefore generating an optimal or sub-optimal schedule is not very useful. On the other hand, if the algorithm takes very large time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. To efficiently handle the spatially correlated contention in WSNs, we present a distributed TDMA slot scheduling algorithm, called DTSS algorithm. The DTSS algorithm is designed with the primary objective of reducing the time required to perform scheduling, while restricting the schedule length to maximum degree of interference graph. The algorithm uses randomized TDMA channel access as the mechanism to transmit protocol messages, which bounds the message delay and therefore reduces the time required to get a feasible schedule. The DTSS algorithm supports unicast, multicast and broadcast scheduling, simultaneously without any modification in the protocol. The protocol has been simulated using Castalia simulator to evaluate the run time performance. Simulation results show that our protocol is able to considerably reduce the time required to schedule.

Improved Erlenmeyer Synthesis with 5-Thiazolone and Catalytic Mn(II) Acetate. Crystal Structure Confirmation of the Reaction Stereochemistry

2-Phenylthiazolin-5-one (5, a thioazlactone) condenses with various aldehydes in the presence of the mild base Mn(II) acetate as catalyst in CH2Cl2 solution. This leads to the corresponding Erlenmeyer reaction products (6) in excellent yields in the case of aromatic aldehydes and moderate yields in others. The mildness of the reaction conditions is apparently enabled by the aromaticity of the (putative) intermediate thiazolone anion. The structure and stereochemistry (Z) of the product derived from i-BuCHO was confirmed by single crystal X-ray diffraction. This study overcomes key limitations of the classical Erlenmeyer synthesis and also introduces the relatively nontoxic Mn(II) acetate as a reagent in heterocyclic chemistry.

A Distributed TDMA Slot Scheduling Algorithm for Spatially Correlated Contention in WSNs

In WSNs the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting simultaneously. Such a situation is known as spatially correlated contention. The random access method to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation of spatially correlated contention persists only for a short duration, and therefore generating an optimal or suboptimal schedule is not very useful. Additionally, if an algorithm takes very long time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. In this paper, we present a distributed TDMA slot scheduling (DTSS) algorithm, which considerably reduces the time required to perform scheduling, while restricting the schedule length to the maximum degree of interference graph. The DTSS algorithm supports unicast, multicast, and broadcast scheduling, simultaneously without any modification in the protocol. We have analyzed the protocol for average case performance and also simulated it using Castalia simulator to evaluate its runtime performance. Both analytical and simulation results show that our protocol is able to considerably reduce the time required for scheduling.

RD-TDMA: A Randomized and Distributed TDMA Scheduling for Correlated Contention in WSNs

In wireless sensor networks (WSNs), contention occurs when two or more nodes in a proximity simultaneously try to access the channel. The contention causes collisions, which are very likely to occur when traffic is correlated. The excessive collision not only affects the reliability and the QoS of the application, but also the lifetime of the network. It is well-known that random access mechanisms do not efficiently handle correlated-contention, and therefore, suffer from high collision rate. Most of the existing TDMA scheduling techniques try to find an optimal or a sub-optimal schedule. Usually, the situation of correlated-contention persists only for a short duration, and therefore, it is not worthwhile to take a long time to generate an optimal or a sub-optimal schedule. We propose a randomized distributed TDMA scheduling (RD-TDMA) algorithm to quickly generate a feasible schedule (not necessarily optimal) to handle correlated-contention in WSNs. In RD-TDMA, a node in the network negotiates a slot with its neighbors using the message exchange mechanism. The proposed protocol has been simulated using the Castalia simulator to evaluate its runtime performance. Simulation results show that the RD-TDMA algorithm considerably reduces the time required to schedule.

Fast Multiple Access Selection through variable power transmissions

Many wireless applications demand a fast mechanism to detect the packet from a node with the highest priority ("best node") only, while packets from nodes with lower priority are irrelevant. In this paper, we introduce an extremely fast contention-based multiple access algorithm that selects the best node and requires only local information of the priorities of the nodes. The algorithm, which we call Variable Power Multiple Access Selection (VP-MAS), uses the local channel state information from the accessing nodes to the receiver, and maps the priorities onto the receive power. It is based on a key result that shows that mapping onto a set of discrete receive power levels is optimal, when the power levels are chosen to exploit packet capture that inherently occurs in a wireless physical layer. The VP-MAS algorithm adjusts the expected number of users that contend in each step and their respective transmission powers, depending on whether previous transmission attempts resulted in capture, idle channel, or collision. We also show how reliable information regarding the total received power at the receiver can be used to improve the algorithm by enhancing the feedback mechanism. The algorithm detects the packet from the best node in 1.5 to 2.1 slots, which is considerably lower than the 2.43 slot average achieved by the best algorithm known to date.

Performance modelling of a fault-tolerant real-time multiprocessor using stochastic Petri nets

The fault-tolerant multiprocessor (ftmp) is a bus-based multiprocessor architecture with real-time and fault- tolerance features and is used in critical aerospace applications. A preliminary performance evaluation is of crucial importance in the design of such systems. In this paper, we review stochastic Petri nets (spn) and developspn-based performance models forftmp. These performance models enable efficient computation of important performance measures such as processing power, bus contention, bus utilization, and waiting times.

sopB of Salmonella enterica serovar Typhimurium is a potential DNA vaccine candidate in conjugation with live attenuated bacteria

The immune response against Salmonella is multi-faceted involving both the innate and the adaptive immune system. The characterization of specific Salmonella antigens inducing immune response could critically contribute to the development of epitope based vaccines for Salmonella. We have tried to identify a protective T cell epitope(s) of Salmonella, as cell mediated immunity conferred by CD8+ T cells is the most crucial subset conferring protective immunity against Salmonella. It being a proven fact that secreted proteins are better in inducing cell mediated immunity than cell surface and cytosolic antigens, we have analyzed all the genbank annotated Salmonella pathogenicity island 1 and 2 secreted proteins of Salmonella enterica serovar Typhimurium (S. typhimurium) and S. enterica serovar Typhi (S. typhi). They were subjected to BIMAS and SYFPEITHI analysis to map MHC-I and MHC-II binding epitopes. The huge profile of possible T cell epitopes obtained from the two classes of secreted proteins were tabulated and using a scoring system that considers the binding affinity and promiscuity of binding to more than one allele, SopB and SifB were chosen for experimental confirmation in murine immunization model. The entire SopB and SifB genes were cloned into DNA vaccine vectors and were administered along with live attenuated Salmonella and it was found that SopB vaccination reduced the bacterial burden of organs by about 5-fold on day 4 and day 8 after challenge with virulent Salmonella and proved to be a more efficient vaccination strategy than live attenuated bacteria alone.