Design of delay-tolerant space–time codes with limited feedback

In cooperative communication networks, owing to the nodes' arbitrary geographical locations and individual oscillators, the system is fundamentally asynchronous. Such a timing mismatch may cause rank deficiency of the conventional space-time codes and, thus, performance degradation. One efficient way to overcome such an issue is the delay-tolerant space-time codes (DT-STCs). The existing DT-STCs are designed assuming that the transmitter has no knowledge about the channels. In this paper, we show how the performance of DT-STCs can be improved by utilizing some feedback information. A general framework for designing DT-STC with limited feedback is first proposed, allowing for flexible system parameters such as the number of transmit/receive antennas, modulated symbols, and the length of codewords. Then, a new design method is proposed by combining Lloyd's algorithm and the stochastic gradient-descent algorithm to obtain optimal codebook of STCs, particularly for systems with linear minimum-mean-square-error receiver. Finally, simulation results confirm the performance of the newly designed DT-STCs with limited feedback.

Detection of assemblages A and B of Giardia duodenalis in water and sewage from Sao Paulo state, Brazil

Giardia duodenalis is a protozoan that parasitizes humans and other mammals and causes giardiasis. Although its isolates have been divided into seven assemblages, named A to G, only A and B have been detected in human faeces. Assemblage A isolates are commonly divided into two genotypes, AI and AII. Even though information about the presence of this protozoan in water and sewage is available in Brazil, it is important to verify the distribution of different assemblages that might be present, which can only be done by genotyping techniques. A total of 24 raw and treated sewage, surface and spring water samples were collected, concentrated and purified. DNA was extracted, and a nested PCR was used to amplify an 890 bp fragment of the gdh gene of G. duodenalis, which codes for glutamate dehydrogenase. Positive samples were cloned and sequenced. Ten out of 24 (41.6%) samples were confirmed to be positive for G. duodenalis by sequencing. Phylogenetic analysis grouped most sequences with G. duodenalis genotype AII from GenBank. Only two raw sewage samples presented sequences assigned to assemblage B. In one of these samples genotype AII was also detected. As these assemblages/genotypes are commonly associated to human giardiasis, the contact with these matrices represents risk for public health.

DIFFUSION OF MAGNETIC FIELD AND REMOVAL OF MAGNETIC FLUX FROM CLOUDS VIA TURBULENT RECONNECTION

The diffusion of astrophysical magnetic fields in conducting fluids in the presence of turbulence depends on whether magnetic fields can change their topology via reconnection in highly conducting media. Recent progress in understanding fast magnetic reconnection in the presence of turbulence reassures that the magnetic field behavior in computer simulations and turbulent astrophysical environments is similar, as far as magnetic reconnection is concerned. This makes it meaningful to perform MHD simulations of turbulent flows in order to understand the diffusion of magnetic field in astrophysical environments. Our studies of magnetic field diffusion in turbulent medium reveal interesting new phenomena. First of all, our three-dimensional MHD simulations initiated with anti-correlating magnetic field and gaseous density exhibit at later times a de-correlation of the magnetic field and density, which corresponds well to the observations of the interstellar media. While earlier studies stressed the role of either ambipolar diffusion or time-dependent turbulent fluctuations for de-correlating magnetic field and density, we get the effect of permanent de-correlation with one fluid code, i.e., without invoking ambipolar diffusion. In addition, in the presence of gravity and turbulence, our three-dimensional simulations show the decrease of the magnetic flux-to-mass ratio as the gaseous density at the center of the gravitational potential increases. We observe this effect both in the situations when we start with equilibrium distributions of gas and magnetic field and when we follow the evolution of collapsing dynamically unstable configurations. Thus, the process of turbulent magnetic field removal should be applicable both to quasi-static subcritical molecular clouds and cores and violently collapsing supercritical entities. The increase of the gravitational potential as well as the magnetization of the gas increases the segregation of the mass and magnetic flux in the saturated final state of the simulations, supporting the notion that the reconnection-enabled diffusivity relaxes the magnetic field + gas system in the gravitational field to its minimal energy state. This effect is expected to play an important role in star formation, from its initial stages of concentrating interstellar gas to the final stages of the accretion to the forming protostar. In addition, we benchmark our codes by studying the heat transfer in magnetized compressible fluids and confirm the high rates of turbulent advection of heat obtained in an earlier study.

The Trypanosoma cruzi proteins TcCox10 and TcCox15 catalyze the formation of heme A in the yeast Saccharomyces cerevisiae

Trypanosoma cruzi, the etiologic agent for Chagas` disease, has requirements for several cofactors, one of which is heme. Because this organism is unable to synthesize heme, which serves as a prosthetic group for several heme proteins (including the respiratory chain complexes), it therefore must be acquired from the environment. Considering this deficiency, it is an open question as to how heme A, the essential cofactor for eukaryotic CcO enzymes, is acquired by this parasite. In the present work, we provide evidence for the presence and functionality of genes coding for heme O and heme A synthases, which catalyze the synthesis of heme O and its conversion into heme A, respectively. The functions of these T. cruzi proteins were evaluated using yeast complementation assays, and the mRNA levels of their respective genes were analyzed at the different T. cruzi life stages. It was observed that the amount of mRNA coding for these proteins changes during the parasite life cycle, suggesting that this variation could reflect different respiratory requirements in the different parasite life stages.

Crystallographic structure and substrate-binding interactions of the molybdate-binding protein of the phytopathogen Xanthomonas axonopodis pv. citri

In Xanthomonas axonopodis pv. citri (Xac or X citri), the modA gene codes for a periplasmic protein (ModA) that is capable of binding molybdate and tungstate as part of the ABC-type transporter required for the uptake of micronutrients. In this study, we report the crystallographic structure of the Xac ModA protein with bound molybdate. The Xac ModA structure is similar to orthologs with known three-dimensional structures and consists of two nearly symmetrical domains separated by a hinge region where the oxyanion-binding site lies. Phylogenetic analysis of different ModA orthologs based on sequence alignments revealed three groups of molybdate-binding proteins: bacterial phytopathogens, enterobacteria and soil bacteria. Even though the ModA orthologs are segregated into different groups, the ligand-binding hydrogen bonds are mostly conserved, except for Archaeglobus fulgidus ModA. A detailed discussion of hydrophobic interactions in the active site is presented and two new residues, Ala(38) and Ser(151), are shown to be part of the ligand-binding pocket. (c) 2007 Elsevier B.V All rights reserved.

FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ`S ATTRACTOR

A novel cryptography method based on the Lorenz`s attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.

From decoherence-free channels to decoherence-free and quasi-free subspaces within bosonic dissipative networks

We present a technique to build, within a dissipative bosonic network, decoherence-free channels (DFCs): a group of normal-mode oscillators with null effective damping rates. We verify that the states protected within the DFC define the well-known decoherence-free subspaces (DFSs) when mapped back into the natural network oscillators. Therefore, our technique to build protected normal-mode channels turns out to be an alternative way to build DFSs, which offers advantages over the conventional method. It enables the computation of all the network-protected states at once, as well as leading naturally to the concept of the decoherence quasi-free subspace (DQFS), inside which a superposition state is quasi-completely protected against decoherence. The concept of the DQFS, weaker than that of the DFS, may provide a more manageable mechanism to control decoherence. Finally, as an application of the DQFSs, we show how to build them for quasi-perfect state transfer in networks of coupled quantum dissipative oscillators.

A game theoretical approach to the evolution of structured communication codes

Structured meaning-signal mappings, i.e., mappings that preserve neighborhood relationships by associating similar signals with similar meanings, are advantageous in an environment where signals are corrupted by noise and sub-optimal meaning inferences are rewarded as well. The evolution of these mappings, however, cannot be explained within a traditional language evolutionary game scenario in which individuals meet randomly because the evolutionary dynamics is trapped in local maxima that do not reflect the structure of the meaning and signal spaces. Here we use a simple game theoretical model to show analytically that when individuals adopting the same communication code meet more frequently than individuals using different codes-a result of the spatial organization of the population-then advantageous linguistic innovations can spread and take over the population. In addition, we report results of simulations in which an individual can communicate only with its K nearest neighbors and show that the probability that the lineage of a mutant that uses a more efficient communication code becomes fixed decreases exponentially with increasing K. These findings support the mother tongue hypothesis that human language evolved as a communication system used among kin, especially between mothers and offspring.

Some classes of semisimple group (and loop) algebras over finite fields

We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components We apply our work to obtain similar information about the loop algebras of mdecomposable RA loops and to produce negative answers to the isomorphism problem over various fields (C) 2010 Elsevier Inc All rights reserved

Skipping of exon 30 in C5 gene results in complete human C5 deficiency and demonstrates the importance of C5d and CUB domains for stability

The deficiency of complement C5 is rare and frequently associated with severe and recurrent infections, especially caused by Neisseria spp. We observed the absence of component C5 in the serum of 3 siblings from a Brazilian family with history of consanguinity. The patients had suffered from recurrent episodes of meningitis and other less severe infections. Sera from these patients were unable to mediate hemolytic activity either by the classical or alternative pathways and presented extremely low levels of C5 protein (13, 0.9 and 1.0 mu g/ml-normal range: 45-190 mu g/ml). Hemolytic activity could be restored by the addition of purified C5 to deficient serum. Sequencing of sibling C5 cDNA revealed a homozygous 153 bp deletion that corresponds precisely to exon 30. The parents carried the same deletion but only in one allele. Sequencing of the corresponding region in the genomic DNA revealed a C to C substitution within intron 30 and, most significantly, the substitution of GAG(4028) for GAA(4028) at the 3` end of exon 30 which is most likely responsible for skipping of exon 30. The resulting in-frame deletion in the C5 mRNA codes for a mutant C5 protein lacking residues 1289-1339. These residues map to the CUB and C5d domains of the C5 alpha chain. This deletion is expected to produce a non-functional and unstable C5 protein which is more susceptible to degradation. (C) 2009 Published by Elsevier Ltd.

Structure, processing and midgut secretion of putative peritrophic membrane ancillary protein (PMAP) from Tenebrio molitor larvae

A cDNA coding for a Tenebrio molitor midgut protein named peritrophic membrane ancillary protein (PMAP) was cloned and sequenced. The complete cDNA codes for a protein of 595 amino acids with six insect-allergen-related-repeats that may be grouped in A (predicted globular)- and B (predicted nonglobular)-types forming an ABABAB structure. The PMAP-cDNA was expressed in Pichia pastoris and the recombinant protein (64 kDa) was purified to homogeneity and used to raise antibodies in rabbits. The specific antibody detected PMAP peptides (22 kDa) in the anterior and middle midgut tissue, luminal contents, peritrophic membrane and feces. These peptides derive from PMAP, as supported by mass spectrometry, and resemble those formed by the in vitro action of trypsin on recombinant PMAP. Both in vitro and in vivo PMAP processing seem to occur by attack of trypsin to susceptible bonds in the coils predicted to link AB pairs, thus releasing the putative functional AB structures. The AB-domain structure of PMAP is found in homologous proteins from several insect orders, except lepidopterans that have the apparently derived protein known as nitrile-specifier protein. Immunocytolocalization shows that PMAP is secreted by exocytosis and becomes entrapped in the glycocalyx, before being released into midgut contents. Circumstantial evidence suggests that PMAP-like proteins have a role in peritrophic membrane type 2 formation. (C) 2007 Elsevier Ltd. All rights reserved.

Sequencing of Spodoptera frugiperda midgut trehalases and demonstration of secretion of soluble trehalase by midgut columnar cells

Both soluble (SfTre1) and membrane-bound (SfTre2) trehalases occur along the midgut of Spodoptera frugiperda larvae. Released SfTre2 was purified as a 67 kDa protein. Its K(m) (1.6 mM) and thermal stability (half life 10 min at 62 degrees C) are different from the previously isolated soluble trehalase (K(m) = 0.47 mM; 100% stable at 62 degrees C). Two cDNAs coding for S. frugiperda trehalases have been cloned using primers based on consensus sequences of trehalases and having as templates a cDNA library prepared from total polyA-containing RNA extracted from midguts. One cDNA codes for a trehalase that has a predicted transmembrane sequence and was defined as SfTre2. The other, after being cloned and expressed, results in a recombinant trehalase with a K(m) value and thermal stability like those of native soluble trehalase. This enzyme was defined as SfTre1 and, after it was used to generate antibodies, it was immunolocalized at the secretory vesicles and at the glycocalyx of columnar cells. Escherichia coli trehalase 3D structure and sequence alignment with SfTre1 support a proposal regarding the residue modulating the pKa value of the proton donor.

Independent Domain of Symmetric Encryption using Least SignificantBit : Computer Vision, Steganography and Cryptography Techniques

The rapid development of data transfer through internet made it easier to send the data accurate and faster to the destination. There are many transmission media to transfer the data to destination like e-mails; at the same time it is may be easier to modify and misuse the valuable information through hacking. So, in order to transfer the data securely to the destination without any modifications, there are many approaches like cryptography and steganography. This paper deals with the image steganography as well as with the different security issues, general overview of cryptography, steganography and digital watermarking approaches.  The problem of copyright violation of multimedia data has increased due to the enormous growth of computer networks that provides fast and error free transmission of any unauthorized duplicate and possibly manipulated copy of multimedia information. In order to be effective for copyright protection, digital watermark must be robust which are difficult to remove from the object in which they are embedded despite a variety of possible attacks. The message to be send safe and secure, we use watermarking. We use invisible watermarking to embed the message using LSB (Least Significant Bit) steganographic technique. The standard LSB technique embed the message in every pixel, but my contribution for this proposed watermarking, works with the hint for embedding the message only on the image edges alone. If the hacker knows that the system uses LSB technique also, it cannot decrypt correct message. To make my system robust and secure, we added cryptography algorithm as Vigenere square. Whereas the message is transmitted in cipher text and its added advantage to the proposed system. The standard Vigenere square algorithm works with either lower case or upper case. The proposed cryptography algorithm is Vigenere square with extension of numbers also. We can keep the crypto key with combination of characters and numbers. So by using these modifications and updating in this existing algorithm and combination of cryptography and steganography method we develop a secure and strong watermarking method. Performance of this watermarking scheme has been analyzed by evaluating the robustness of the algorithm with PSNR (Peak Signal to Noise Ratio) and MSE (Mean Square Error) against the quality of the image for large amount of data. While coming to see results of the proposed encryption, higher value of 89dB of PSNR with small value of MSE is 0.0017. Then it seems the proposed watermarking system is secure and robust for hiding secure information in any digital system, because this system collect the properties of both steganography and cryptography sciences.

Of Law, Lawlessness, and Sovereignty : Multinational Peacekeeping and International Law

Laws of war have been carefully defined by individual nations’ own codes of law as well as by supranational bodies. Yet the international scene has seen an increasing movement away from traditionally declared war toward multinational peacekeeping missions geared at containing local conflicts when perceived as potential threats to their respective regions’ political stability. While individual nations’ laws governing warfare presuppose national sovereignty, the multinational nature of peacekeeping scenarios can blur the lines of command structures, soldiers’ national loyalties, occupational jurisdiction, and raise profound questions as to which countries’ moral sense/governmental system is to be the one upheld. Historically increasingly complex international relations have driven increasingly detailed internationally drafted guidelines for countries’ interactions while at war, yet there are operational, legislative, and moral issues arising in multinational peacekeeping situations which these laws do not address at all. The author analyzes three unique peacekeeping operations in light of these legislative voids and suggests systematic points to consider to the end of protecting the peacekeepers, the national interests of the countries involved, operational matters, and clearly delineating both the objective and logical boundaries of a given multinational peacekeeping mission.