We introduce space-time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space-time block code and the encoded data is split into n streams which are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. Maximum-likelihood decoding is achieved in a simple way through decoupling of the signals transmitted from different antennas rather than joint detection. This uses the orthogonal structure of the space-time block code and gives a maximum-likelihood decoding algorithm which is based only on linear processing at the receiver. Space-time block codes are designed to achieve the maximum diversity order for a given number of transmit and receive antennas subject to the constraint of having a simple decoding algorithm. The classical mathematical framework of orthogonal designs is applied to construct space-time block codes. It is shown that space-time block codes constructed in this way only exist for few sporadic values of n. Subsequently, a generalization of orthogonal designs is shown to provide space-time block codes for both real and complex constellations for any number of transmit antennas. These codes achieve the maximum possible transmission rate for any number of transmit antennas using any arbitrary real constellation such as PAM. For an arbitrary complex constellation such as PSK and QAM, space-time block codes are designed that achieve 1/2 of the maximum possible transmission rate for any number of transmit antennas. For the specific cases of two, three, and four transmit antennas, space-time block codes are designed that achieve, respectively, all, 3/4, and 3/4 of maximum possible transmission rate using arbitrary complex constellations. The best tradeoff between the decoding delay and the number of transmit antennas is also computed and it is shown that many of the codes presented here are optimal in this sense as well.
Block copolymers are macromolecules composed of sequences, or blocks, of chemically distinct repeat units. The development of this field originated with the discovery of termination-free anionic polymerization, which made possible the sequential addition of monomers to various carbanion-ter minated (living) linear polymer chains. Polymerization of just two dis tinct monomer types (e.g. styrene and isoprene) leads to a class of materials referred to as AB block copolymers. Within this class, a variety of molec ular architectures is possible. For example, the simplest combination, obtained by the two-step anionic polymerization of A and B monomers, is an (A-B) dioblock copolymer. A three-step reaction provides for the preparation of (ABA) or (BAB) triblock copolymer. Alternatively, living diblock copolymers can be reacted with an n-functional coupling agent to produce (A-B)n star-block copolymers, where n = 2 constitutes a triblock copolymer. Several representative (A-B)n block copolymer architectures
Abstract This comprehensive and systematic text is the first of its kind to deal with the fundamental physics underlying the remarkable structural and dynamical properties of block copolymers. It provides the polymer scientist and technologist with a firm grounding in the principles underlying the wide applications of these important materials. It also highlights the intrinsically fascinating properties of block copolymers, such as nanoscale self-assembly in bulk and two-dimensions. The first text of its kind on the subject since the mid-1980s, this book stands alone - previous texts have focused on the chemical and material properties of block copolymers. During the last decade, there have been major developments in the field, and these experimental and theoretical advances are discussed in depth. Topics covered include: the thermodynamics and dynamics of block copolymer melts, block copolymers in dilute, semidilute and concentrated solutions, the structure of crystalline block copolymers and block copolymers in blends with other polymers. This informative book is essential to the polymer physics and materials science researcher in industry and academia, and postgraduates in related fields. Final year undergraduate students in chemistry, physics and materials science will also find this book useful as a reference text.
A method is proposed for estimating intra-block and inter-blook weights in the analysis of incomplete block designs with block sizes not necessarily equal. The method consists of maximizing the likelihood, not of all the data, but of a set of selected error contrasts. When block sizes are equal results are identical with those obtained by the method of Nelder (1968) for generally balanced designs. Although mainly concerned with incomplete block designs the paper also gives in outline an extension of the modified maximum likelihood procedure to designs with a more complicated block structure.
Thoracic neuropathic pain is a debilitating condition that is often poorly responsive to oral and topical pharmacotherapy. The benefit of interventional nerve block procedures is unclear due to a paucity of evidence and the invasiveness of the described techniques. In this report, we describe a novel interfascial plane block, the erector spinae plane (ESP) block, and its successful application in 2 cases of severe neuropathic pain (the first resulting from metastatic disease of the ribs, and the second from malunion of multiple rib fractures). In both cases, the ESP block also produced an extensive multidermatomal sensory block. Anatomical and radiological investigation in fresh cadavers indicates that its likely site of action is at the dorsal and ventral rami of the thoracic spinal nerves. The ESP block holds promise as a simple and safe technique for thoracic analgesia in both chronic neuropathic pain as well as acute postsurgical or posttraumatic pain.
Vascular endothelial growth factor (VEGF) plays a critical role during normal embryonic angiogenesis and also in the pathological angiogenesis that occurs in a number of diseases, including cancer. Initial attempts to block VEGF by using a humanized monoclonal antibody are beginning to show promise in human cancer patients, underscoring the importance of optimizing VEGF blockade. Previous studies have found that one of the most effective ways to block the VEGF-signaling pathway is to prevent VEGF from binding to its normal receptors by administering decoy-soluble receptors. The highest-affinity VEGF blocker described to date is a soluble decoy receptor created by fusing the first three Ig domains of VEGF receptor 1 to an Ig constant region; however, this fusion protein has very poor in vivo pharmacokinetic properties. By determining the requirements to maintain high affinity while extending in vivo half life, we were able to engineer a very potent high-affinity VEGF blocker that has markedly enhanced pharmacokinetic properties. This VEGF-Trap effectively suppresses tumor growth and vascularization in vivo, resulting in stunted and almost completely avascular tumors. VEGF-Trap-mediated blockade may be superior to that achieved by other agents, such as monoclonal antibodies targeted against the VEGF receptor.
Alignment quality may have as much impact on phylogenetic reconstruction as the phylogenetic methods used. Not only the alignment algorithm, but also the method used to deal with the most problematic alignment regions, may have a critical effect on the final tree. Although some authors remove such problematic regions, either manually or using automatic methods, in order to improve phylogenetic performance, others prefer to keep such regions to avoid losing any information. Our aim in the present work was to examine whether phylogenetic reconstruction improves after alignment cleaning or not. Using simulated protein alignments with gaps, we tested the relative performance in diverse phylogenetic analyses of the whole alignments versus the alignments with problematic regions removed with our previously developed Gblocks program. We also tested the performance of more or less stringent conditions in the selection of blocks. Alignments constructed with different alignment methods (ClustalW, Mafft, and Probcons) were used to estimate phylogenetic trees by maximum likelihood, neighbor joining, and parsimony. We show that, in most alignment conditions, and for alignments that are not too short, removal of blocks leads to better trees. That is, despite losing some information, there is an increase in the actual phylogenetic signal. Overall, the best trees are obtained by maximum-likelihood reconstruction of alignments cleaned by Gblocks. In general, a relaxed selection of blocks is better for short alignment, whereas a stringent selection is more adequate for longer ones. Finally, we show that cleaned alignments produce better topologies although, paradoxically, with lower bootstrap. This indicates that divergent and problematic alignment regions may lead, when present, to apparently better supported although, in fact, more biased topologies.
Block copolymers are all around us, found in such products as upholstery foam, adhesive tape and asphalt additives. This class of macromolecules is produced by joining two or more chemically distinct polymer blocks, each a linear series of identical monomers, that may be thermodynamically incompatible (like oil and vinegar). Segregation of these blocks on the molecular scale (5–100 nm) can produce astonishingly complex nanostructures, such as the “knitting pattern” shown on the cover of this issue of PHYSICS TODAY. This striking pattern, discovered by Reimund Stadler and his coworkers, reflects a delicate free-energy minimization that is common to all block copolymer materials.
Iterative decoding of two-dimensional systematic convolutional codes has been termed "turbo" (de)coding. Using log-likelihood algebra, we show that any decoder can be used which accepts soft inputs-including a priori values-and delivers soft outputs that can be split into three terms: the soft channel and a priori inputs, and the extrinsic value. The extrinsic value is used as an a priori value for the next iteration. Decoding algorithms in the log-likelihood domain are given not only for convolutional codes but also for any linear binary systematic block code. The iteration is controlled by a stop criterion derived from cross entropy, which results in a minimal number of iterations. Optimal and suboptimal decoders with reduced complexity are presented. Simulation results show that very simple component codes are sufficient, block codes are appropriate for high rates and convolutional codes for lower rates less than 2/3. Any combination of block and convolutional component codes is possible. Several interleaving techniques are described. At a bit error rate (BER) of 10/sup -4/ the performance is slightly above or around the bounds given by the cutoff rate for reasonably simple block/convolutional component codes, interleaver sizes less than 1000 and for three to six iterations.
We document the performance of space-time block codes, which provide a new paradigm for transmission over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space-time block code, and the encoded data is split into n streams which are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. Maximum likelihood decoding is achieved in a simple way through decoupling of the signals transmitted from different antennas rather than joint detection. This uses the orthogonal structure of the space-time block code and gives a maximum likelihood decoding algorithm which is based only on linear processing at the receiver. We review the encoding and decoding algorithms for various codes and provide simulation results demonstrating their performance. It is shown that using multiple transmit antennas and space-time block coding provides remarkable performance at the expense of almost no extra processing.
Traditionally, consumers used the Internet to simply expend content: they read it, they watched it, and they used it to buy products and services. Increasingly, however, consumers are utilizing platforms-such as content sharing sites, blogs, social networking, and wikis-to create, modify, share, and discuss Internet content. This represents the social media phenomenon, which can now significantly impact a firm's reputation, sales, and even survival. Yet, many executives eschew or ignore this form of media because they don't understand what it is, the various forms it can take, and how to engage with it and learn. In response, we present a framework that defines social media by using seven functional building blocks: identity, conversations, sharing, presence, relationships, reputation, and groups. As different social media activities are defined by the extent to which they focus on some or all of these blocks, we explain the implications that each block can have for how firms should engage with social media. To conclude, we present a number of recommendations regarding how firms should develop strategies for monitoring, understanding, and responding to different social media activities. © 2011 Kelley School of Business, Indiana University.
Because semiconductor nanowires can transport electrons and holes, they could function as building blocks for nanoscale electronics assembled without the need for complex and costly fabrication facilities. Boron- and phosphorous-doped silicon nanowires were used as building blocks to assemble three types of semiconductor nanodevices. Passive diode structures consisting of crossed p- and n-type nanowires exhibit rectifying transport similar to planar p-n junctions. Active bipolar transistors, consisting of heavily and lightly n-doped nanowires crossing a common p-type wire base, exhibit common base and emitter current gains as large as 0.94 and 16, respectively. In addition, p- and n-type nanowires have been used to assemble complementary inverter-like structures. The facile assembly of key electronic device elements from well-defined nanoscale building blocks may represent a step toward a "bottom-up" paradigm for electronics manufacturing.
BACKGROUND: In patients undergoing mechanical ventilation for the acute respiratory distress syndrome (ARDS), neuromuscular blocking agents may improve oxygenation and decrease ventilator-induced lung injury but may also cause muscle weakness. We evaluated clinical outcomes after 2 days of therapy with neuromuscular blocking agents in patients with early, severe ARDS. METHODS: In this multicenter, double-blind trial, 340 patients presenting to the intensive care unit (ICU) with an onset of severe ARDS within the previous 48 hours were randomly assigned to receive, for 48 hours, either cisatracurium besylate (178 patients) or placebo (162 patients). Severe ARDS was defined as a ratio of the partial pressure of arterial oxygen (PaO2) to the fraction of inspired oxygen (FIO2) of less than 150, with a positive end-expiratory pressure of 5 cm or more of water and a tidal volume of 6 to 8 ml per kilogram of predicted body weight. The primary outcome was the proportion of patients who died either before hospital discharge or within 90 days after study enrollment (i.e., the 90-day in-hospital mortality rate), adjusted for predefined covariates and baseline differences between groups with the use of a Cox model. RESULTS: The hazard ratio for death at 90 days in the cisatracurium group, as compared with the placebo group, was 0.68 (95% confidence interval [CI], 0.48 to 0.98; P=0.04), after adjustment for both the baseline PaO2:FIO2 and plateau pressure and the Simplified Acute Physiology II score. The crude 90-day mortality was 31.6% (95% CI, 25.2 to 38.8) in the cisatracurium group and 40.7% (95% CI, 33.5 to 48.4) in the placebo group (P=0.08). Mortality at 28 days was 23.7% (95% CI, 18.1 to 30.5) with cisatracurium and 33.3% (95% CI, 26.5 to 40.9) with placebo (P=0.05). The rate of ICU-acquired paresis did not differ significantly between the two groups. CONCLUSIONS: In patients with severe ARDS, early administration of a neuromuscular blocking agent improved the adjusted 90-day survival and increased the time off the ventilator without increasing muscle weakness. (Funded by Assistance Publique-Hôpitaux de Marseille and the Programme Hospitalier de Recherche Clinique Régional 2004-26 of the French Ministry of Health; ClinicalTrials.gov number, NCT00299650.)
We describe a block-sorting, lossless data compression algorithm, and our implementation of that algorithm. We compare the performance of our implementation with widely available data compressors running on the same hardware. \n \nThe algorithm works by applying a reversible transformation to a block of input text. The transformation does not itself compress the data, but reorders it to make it easy to compress with simple algorithms such as move-to-front coding. \n \nOur algorithm achieves speed comparable to algorithms based on the techniques of Lempel and Ziv, but obtains compression close to the best statistical modelling techniques. The size of the input block must be large (a few kilobytes) to achieve good compression.
The use of some multiple-sequence alignments in phylogenetic analysis, particularly those that are not very well conserved, requires the elimination of poorly aligned positions and divergent regions, since they may not be homologous or may have been saturated by multiple substitutions. A computerized method that eliminates such positions and at the same time tries to minimize the loss of informative sites is presented here. The method is based on the selection of blocks of positions that fulfill a simple set of requirements with respect to the number of contiguous conserved positions, lack of gaps, and high conservation of flanking positions, making the final alignment more suitable for phylogenetic analysis. To illustrate the efficiency of this method, alignments of 10 mitochondrial proteins from several completely sequenced mitochondrial genomes belonging to diverse eukaryotes were used as examples. The percentages of removed positions were higher in the most divergent alignments. After removing divergent segments, the amino acid composition of the different sequences was more uniform, and pairwise distances became much smaller. Phylogenetic trees show that topologies can be different after removing conserved blocks, particularly when there are several poorly resolved nodes. Strong support was found for the grouping of animals and fungi but not for the position of more basal eukaryotes. The use of a computerized method such as the one presented here reduces to a certain extent the necessity of manually editing multiple alignments, makes the automation of phylogenetic analysis of large data sets feasible, and facilitates the reproduction of the final alignment by other researchers.
Haplotype-based methods offer a powerful approach to disease gene mapping, based on the association between causal mutations and the ancestral haplotypes on which they arose. As part of The SNP Consortium Allele Frequency Projects, we characterized haplotype patterns across 51 autosomal regions (spanning 13 megabases of the human genome) in samples from Africa, Europe, and Asia. We show that the human genome can be parsed objectively into haplotype blocks: sizable regions over which there is little evidence for historical recombination and within which only a few common haplotypes are observed. The boundaries of blocks and specific haplotypes they contain are highly correlated across populations. We demonstrate that such haplotype frameworks provide substantial statistical power in association studies of common genetic variation across each region. Our results provide a foundation for the construction of a haplotype map of the human genome, facilitating comprehensive genetic association studies of human disease.
BACKGROUND: Aldosterone blockade reduces mortality and morbidity among patients with severe heart failure. We conducted a double-blind, placebo-controlled study evaluating the effect of eplerenone, a selective aldosterone blocker, on morbidity and mortality among patients with acute myocardial infarction complicated by left ventricular dysfunction and heart failure. METHODS: Patients were randomly assigned to eplerenone (25 mg per day initially, titrated to a maximum of 50 mg per day; 3319 patients) or placebo (3313 patients) [correction] in addition to optimal medical therapy. The study continued until 1012 deaths occurred. The primary end points were death from any cause and death from cardiovascular causes or hospitalization for heart failure, acute myocardial infarction, stroke, or ventricular arrhythmia. RESULTS: During a mean follow-up of 16 months, there were 478 deaths in the eplerenone group and 554 deaths in the placebo group (relative risk, 0.85; 95 percent confidence interval, 0.75 to 0.96; P=0.008). Of these deaths, 407 in the eplerenone group and 483 in the placebo group were attributed to cardiovascular causes (relative risk, 0.83; 95 percent confidence interval, 0.72 to 0.94; P=0.005). The rate of the other primary end point, death from cardiovascular causes or hospitalization for cardiovascular events, was reduced by eplerenone (relative risk, 0.87; 95 percent confidence interval, 0.79 to 0.95; P=0.002), as was the secondary end point of death from any cause or any hospitalization (relative risk, 0.92; 95 percent confidence interval, 0.86 to 0.98; P=0.02). There was also a reduction in the rate of sudden death from cardiac causes (relative risk, 0.79; 95 percent confidence interval, 0.64 to 0.97; P=0.03). The rate of serious hyperkalemia was 5.5 percent in the eplerenone group and 3.9 percent in the placebo group (P=0.002), whereas the rate of hypokalemia was 8.4 percent in the eplerenone group and 13.1 percent in the placebo group (P<0.001). CONCLUSIONS: The addition of eplerenone to optimal medical therapy reduces morbidity and mortality among patients with acute myocardial infarction complicated by left ventricular dysfunction and heart failure.
Polyoxometalates (POMs) are a subset of metal oxides that represent a diverse range of molecular clusters with an almost unmatched range of physical properties and the ability to form dynamic structures that can range in size from the nano- to the micrometer scale. Herein we present the very latest developments from synthesis to structure and function of POMs. We discuss the possibilities of creating highly sophisticated functional hierarchical systems with multiple, interdependent, functionalities along with a critical analysis that allows the non-specialist to learn the salient features. We propose and present a "periodic table of polyoxometalate building blocks". We also highlight some of the current issues and challenges that need to be addressed to work towards the design of functional systems based upon POM building blocks and look ahead to possible emerging application areas.
Complex networks are studied across many fields of science. To uncover their structural design principles, we defined "network motifs," patterns of interconnections occurring in complex networks at numbers that are significantly higher than those in randomized networks. We found such motifs in networks from biochemistry, neurobiology, ecology, and engineering. The motifs shared by ecological food webs were distinct from the motifs shared by the genetic networks of Escherichia coli and Saccharomyces cerevisiae or from those found in the World Wide Web. Similar motifs were found in networks that perform information processing, even though they describe elements as different as biomolecules within a cell and synaptic connections between neurons in Caenorhabditis elegans. Motifs may thus define universal classes of networks. This approach may uncover the basic building blocks of most networks.
It has been shown that a complex orthogonal design that provides full diversity and full transmission rate for a space-time block code is not possible for more than two antennas. Previous attempts have been concentrated in generalizing orthogonal designs which provide space-time block codes with full diversity and a high transmission rate. We design rate one codes which are quasi-orthogonal and provide partial diversity. The decoder of the proposed codes works with pairs of transmitted symbols instead of single symbols.