On the PAPR of cosets of linear codes

Employing an error control code is one of the techniques to reduce the Peak-to-Average Power Ratio (PAPR) in a Orthogonal Frequency Division Multiplexing system, a well known class of such codes being the cosets of Reed-Muller codes. In this paper, we consider the class of such coset-codes of arbitrary linear codes and present a method of doubling the size of such a code without increasing the PAPR, by combining two such binary coset-codes. We identify the conditions under which we can employ this doubling more than once with no marginal increase in the PAPR value. Given a PAPR and length, our method has enabled to get the best coset-code (in terms of the size). Also, we show that the PAPR information of the coset-codes of the extended codes is obtainable from the PAPR of the corresponding coset-codes of the parent code. We have also shown a special type of lengthening is useful in PAPR studies.

Parallelization of an unstructured data based cell centre finite volume code, HIFUN-3D

This work describes the parallelization of High Resolution flow solver on unstructured meshes, HIFUN-3D, an unstructured data based finite volume solver for 3-D Euler equations. For mesh partitioning, we use METIS, a software based on multilevel graph partitioning. The unstructured graph used for partitioning is associated with weights both on its vertices and edges. The data residing on every processor is split into four layers. Such a novel procedure of handling data helps in maintaining the effectiveness of the serial code. The communication of data across the processors is achieved by explicit message passing using the standard blocking mode feature of Message Passing Interface (MPI). The parallel code is tested on PACE++128 available in CFD Center

Characterization of human symptomatic rotavirus isolates MP409 and MP480 having ‘long’ RNA electropherotype and subgroup I specificity, highly related to the P6[1],G8 type bovine rotavirus A5, from Mysore, India

In an epidemiological study of symptomatic human rotaviruses in Mysore, India during 1993 and 1994, isolates MP409 and MP480 were isolated from two children suffering from severe, acute dehydrating diarrhea. Both isolates exhibited 'long' RNA pattern and subgroup I specificity suggesting the likelihood of their animal origin. Both isolates did not react with monoclonal antibodies (MAbs) specific for serotypes G1 to G6 as well as CIO. To determine the genetic origin of these isolates, complete nucleotide sequences of genes encoding the outer capsid proteins VP4 and VP7, nonstructural proteins NSP1 and NSP3 and viral enterotoxin protein NSP4 from MP409 and partial sequences of genes from MP480 were determined. Comparison of the 5' and 3' terminal sequences of 250 nucleotides revealed complete identity of the gene sequences in both strains suggesting that MP409 and MP480 are two different isolates of a single strain. Comparison of the nucleotide and deduced amino acid sequences of VP4, VP7, NSP1 and NSP3 of MP409 with published sequences of strains belonging to different serotypes revealed that both outer capsid proteins VP4 and VP7 and NSP1 are highly related to the respective proteins from the P6[1], G8 type bovine rotavirus A5 isolated from a calf with diarrhoea in Thailand and that the NSP3 is highly homologous to that of bovine rotaviruses. The NSP 1 protein showed greatest sequence identity with NSP4s belonging to the KUN genetic group to which NSP4s from human G2 type strains and bovine rotaviruses belong. MP409 and MP480 likely signify interspecies transmission of P6[1], G8 type strains from cattle to humans and represent the first P6[1] type rotaviruses isolated in humans. These and our previous studies on the asymptomatic neonatal strain I321 are of evolutionary and epidemiological significance in the context of close association of majority of the Indian population with cattle.

Genetic Heterogeneity in Wild Isolates of Cellular Slime Mold Social Groups

This study addresses the issues of spatial distribution, dispersal, and genetic heterogeneity in social groups of the cellular slime molds (CSMs). The CSMs are soil amoebae with an unusual life cycle that consists of alternating solitary and social phases. Because the social phase involves division of labor with what appears to be an extreme form of "altruism", the CSMs raise interesting evolutionary questions regarding the origin and maintenance of sociality. Knowledge of the genetic structure of social groups in the wild is necessary for answering these questions. We confirm that CSMs are widespread in undisturbed forest soil from South India. They are dispersed over long distances via the dung of a variety of large mammals. Consistent with this mode of dispersal, most social groups in the two species examined for detailed study, Dictyostelium giganteum and Dictyostelium purpureum, are multi-clonal.

Genetic algorithms: a survey

Genetic algorithms provide an alternative to traditional optimization techniques by using directed random searches to locate optimal solutions in complex landscapes. We introduce the art and science of genetic algorithms and survey current issues in GA theory and practice. We do not present a detailed study, instead, we offer a quick guide into the labyrinth of GA research. First, we draw the analogy between genetic algorithms and the search processes in nature. Then we describe the genetic algorithm that Holland introduced in 1975 and the workings of GAs. After a survey of techniques proposed as improvements to Holland's GA and of some radically different approaches, we survey the advances in GA theory related to modeling, dynamics, and deception

A Low-Complexity, Full-Rate, Full-Diversity 2 x 2 STBC with Golden Code's Coding Gain

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multiple-output (MIMO) system, with coding gain equal to that of the best and well known Golden code for any QAM constellation. Recently, two codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer and Sari), which enjoy a lower decoding complexity relative to the Golden code, but have lesser coding gain. The 2 x 2 STBC presented in this paper has lesser decoding complexity for non-square QAM constellations, compared with that of the Golden code, while having the same decoding complexity for square QAM constellations. Compared with the Paredes-Gershman-Alkhansari and Sezginer-Sari codes, the proposed code has the same decoding complexity for non-rectangular QAM constellations. Simulation results, which compare the codeword error rate (CER) performance, are presented.

Code Generation Paradigms On Optical Orthogonal And Other Codes In a Fiber Optic CDMA Lan

Code Division Multiple Access (CDMA) techniques, by far, had been applied to LAN problems by many investigators, An analytical study of well known algorithms for generation of Orthogonal codes used in FO-CDMA systems like those for prime, quasi-Prime, Optical Orthogonal and Matrix codes has been presented, Algorithms for OOCs like Greedy/Modified Greedy/Accelerated Greedy algorithms are implemented. Many speed-up enhancements. for these algorithms are suggested. A novel Synthetic Algorithm based on Difference Sets (SADS) is also proposed. Investigations are made to vectorise/parallelise SADS to implement the source code on parallel machines. A new matrix for code families of OOCs with different seed code-words but having the same (n,w,lambda) set is formulated.

Comparative Nucleotide and Amino Acid Sequence Analysis of the Sequence-Specific RNA-Binding Rotavirus Nonstructural Protein NSP3

NSP3, an acidic nonstructural protein, encoded by gene 7 has been implicated as the key player in the assembly of the 11 viral plus-strand RNAs into the early replication intermediates during rotavirus morphogenesis. To date, the sequence or NSP3 from only three animal rotaviruses (SA11, SA114F, and bovine UK) has been determined and that from a human strain has not been reported. To determine the genetic diversity among gene 7 alleles from group A rotaviruses, the nucleotide sequence of the NSP3 gene from 13 strains belonging to nine different G serotypes, from both humans and animals, has been determined. Based on the amino acid sequence identity as well as phylogenetic analysis, NSP3 from group A rotaviruses falls into three evolutionarily related groups, i.e., the SA11 group, the Wa group, and the S2 group. The SA 11/SA114F gene appears to have a distant ancestral origin from that of the others and codes for a polypeptide of 315 amino acids (aa) in length. NSP3 from all other group A rotaviruses is only 313 aa in length because of a 2-amino-acid deletion near the carboxy-terminus, While the SA114F gene has the longest 3' untranslated region (UTR) of 132 nucleotides, that from other strains suffered deletions of varying lengths at two positions downstream of the translational termination codon. In spite of the divergence of the nucleotide (nt) sequence in the protein coding region, a stretch of about 80 nt in the 3' UTR is highly conserved in the NSP3 gene from all the strains. This conserved sequence in the 3' UTR might play an important role in the regulation of expression of the NSP3 gene. (C) 1995 Academic Press, Inc.

Primary Sequence That Determines the Functional Overlap between Mitochondrial Heat Shock Protein 70 Ssc1 and Ssc3 of Saccharomyces cerevisiae

The evolutionary diversity of the HSP70 gene family at the genetic level has generated complex structural variations leading to altered functional specificity and mode of regulation in different cellular compartments. By utilizing Saccharomyces cerevisiae as a model system for better understanding the global functional cooperativity between Hsp70 paralogs, we have dissected the differences in functional properties at the biochemical level between mitochondrial heat shock protein 70 (mtHsp70) Ssc1 and an uncharacterized Ssc3 paralog. Based on the evolutionary origin of Ssc3 and a high degree of sequence homology with Ssc1, it has been proposed that both have a close functional overlap in the mitochondrial matrix. Surprisingly, our results demonstrate that there is no functional cross-talk between Ssc1 and Ssc3 paralogs. The lack of in vivo functional overlap is due to altered conformation and significant lower stability associated with Ssc3. The substrate-binding domain of Ssc3 showed poor affinity toward mitochondrial client proteins and Tim44 due to the open conformation in ADP-bound state. In addition to that, the nucleotide-binding domain of Ssc3 showed an altered regulation by the Mge1 co-chaperone due to a high degree of conformational plasticity, which strongly promotes aggregation. Besides, Ssc3 possesses a dysfunctional inter-domain interface thus rendering it unable to perform functions similar to generic Hsp70s. Moreover, we have identified the critical amino acid sequence of Ssc1 and Ssc3 that can ``make or break'' mtHsp70 chaperone function. Together, our analysis provides the first evidence to show that the nucleotide-binding domain of mtHsp70s plays a critical role in determining the functional specificity among paralogs and orthologs across kingdoms.

Study of formation of silicon carbide in the Acheson process

Formation of silicon carbide in the Acheson process was studied using a mass transfer model which has been developed in this study. The century old Acheson process is still used for the mass production of silicon carbide. A heat resistance furnace is used in the Acheson process which uses sand and petroleum coke as major raw materials.: It is a highly energy intensive process. No mass transfer model is available for this process. Therefore, a mass transfer model has been developed to study the mass transfer aspects of the process along with heat transfer. The reaction kinetics of silicon carbide formation has been taken from the literature. It has been shown that reaction kinetics has a reasonable influence on the process efficiency. The effect of various parameters on the process such as total gas pressure, presence of silicon carbide in the initial charge, etc. has been studied. A graphical user interface has also been developed for the Acheson process to make the computer code user friendly.

Assessment of genetic diversity and identification of core collection in sandalwood germplasm using RAPDS

Sandalwood is an economically important aromatic tree belonging to the family Santalaceae. The trees are used mainly for their fragrant heartwood and oil that have immense potential for foreign exchange. Very little information is available on the genetic diversity in this species. Hence studies were initiated and genetic diversity estimated using RAPD markers in 51 genotypes of Santalum album procured from different geographcial regions of India and three exotic lines of S. spicatum from Australia. Eleven selected Operon primers (10mer) generated a total of 156 consistent and unambiguous amplification products ranging from 200bp to 4kb. Rare and genotype specific bands were identified which could be effectively used to distinguish the genotypes. Genetic relationships within the genotypes were evaluated by generating a dissimilarity matrix based on Ward's method (Squared Euclidean distance). The phenetic dendrogram and the Principal Component Analysis generated, separated the 51 Indian genotypes from the three Australian lines. The cluster analysis indicated that sandalwood germplasm within India constitutes a broad genetic base with values of genetic dissimilarity ranging from 15 to 91 %. A core collection of 21 selected individuals revealed the same diversity of the entire population. The results show that RAPD analysis is an efficient marker technology for estimating genetic diversity and relatedness, thereby enabling the formulation of appropriate strategies for conservation, germplasm management, and selection of diverse parents for sandalwood improvement programmes.

The beta-glucoside genes of Klebsiella aerogenes: conservation and divergence in relation to the cryptic bgl genes of Escherichia coli

The ability to metabolize aromatic beta-glucosides such as salicin and arbutin varies among members of the Enterobacteriaceae. The ability of Escherichia coli to degrade salicin and arbutin appears to be cryptic, subject to activation of the bgl genes, whereas many members of the Klebsiella genus can metabolize these sugars. We have examined the genetic basis for beta-glucoside utilization in Klebsiella aerogenes. The Klebsiella equivalents of bglG, bglB and bglR have been cloned using the genome sequence database of Klebsiella pneumoniae. Nucleotide sequencing shows that the K. aerogenes bgl genes show substantial similarities to the E. coli counterparts. The K. aerogenes bgl genes in multiple copies can also complement E. coli mutants deficient in bglG encoding the antiterminator and bglB encoding the phospho-beta-glucosidase, suggesting that they are functional homologues. The regulatory region bglR of K aerogenes shows a high degree of similarity of the sequences involved in BglG-mediated regulation. Interestingly, the regions corresponding to the negative elements present in the E. coli regulatory region show substantial divergence in K aerogenes. The possible evolutionary implications of the results are discussed. (C) 2003 Federation of European Microbiological Societies. Published by Elsevier Science B.v. All rights reserved.

A Low-Complexity, Full-Rate, Full-Diversity 2x2 STBC with Golden Code's Coding Gain

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multipleoutput (MIMO) system, with coding gain equal to that of the best and well known Golden code for any QAM constellation.Recently, two codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer and Sari), which enjoy a lower decoding complexity relative to the Golden code, but have lesser coding gain. The 2 × 2 STBC presented in this paper has lesser decoding complexity for non-square QAM constellations,compared with that of the Golden code, while having the same decoding complexity for square QAM constellations. Compared with the Paredes-Gershman-Alkhansari and Sezginer-Sari codes, the proposed code has the same decoding complexity for nonrectangular QAM constellations. Simulation results, which compare the codeword error rate (CER) performance, are presented.

NETGEM: Network Embedded Temporal GEnerative Model for gene expression data

Background: Temporal analysis of gene expression data has been limited to identifying genes whose expression varies with time and/or correlation between genes that have similar temporal profiles. Often, the methods do not consider the underlying network constraints that connect the genes. It is becoming increasingly evident that interactions change substantially with time. Thus far, there is no systematic method to relate the temporal changes in gene expression to the dynamics of interactions between them. Information on interaction dynamics would open up possibilities for discovering new mechanisms of regulation by providing valuable insight into identifying time-sensitive interactions as well as permit studies on the effect of a genetic perturbation. Results: We present NETGEM, a tractable model rooted in Markov dynamics, for analyzing the dynamics of the interactions between proteins based on the dynamics of the expression changes of the genes that encode them. The model treats the interaction strengths as random variables which are modulated by suitable priors. This approach is necessitated by the extremely small sample size of the datasets, relative to the number of interactions. The model is amenable to a linear time algorithm for efficient inference. Using temporal gene expression data, NETGEM was successful in identifying (i) temporal interactions and determining their strength, (ii) functional categories of the actively interacting partners and (iii) dynamics of interactions in perturbed networks. Conclusions: NETGEM represents an optimal trade-off between model complexity and data requirement. It was able to deduce actively interacting genes and functional categories from temporal gene expression data. It permits inference by incorporating the information available in perturbed networks. Given that the inputs to NETGEM are only the network and the temporal variation of the nodes, this algorithm promises to have widespread applications, beyond biological systems. The source code for NETGEM is available from https://github.com/vjethava/NETGEM

Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any arbitrary of nodes. However regenerating codes possess in addition, the ability to repair a failed node by connecting to any arbitrary nodes and downloading an amount of data that is typically far less than the size of the data file. This amount of download is termed the repair bandwidth. Minimum storage regenerating (MSR) codes are a subclass of regenerating codes that require the least amount of network storage; every such code is a maximum distance separable (MDS) code. Further, when a replacement node stores data identical to that in the failed node, the repair is termed as exact. The four principal results of the paper are (a) the explicit construction of a class of MDS codes for d = n - 1 >= 2k - 1 termed the MISER code, that achieves the cut-set bound on the repair bandwidth for the exact repair of systematic nodes, (b) proof of the necessity of interference alignment in exact-repair MSR codes, (c) a proof showing the impossibility of constructing linear, exact-repair MSR codes for d < 2k - 3 in the absence of symbol extension, and (d) the construction, also explicit, of high-rate MSR codes for d = k+1. Interference alignment (IA) is a theme that runs throughout the paper: the MISER code is built on the principles of IA and IA is also a crucial component to the nonexistence proof for d < 2k - 3. To the best of our knowledge, the constructions presented in this paper are the first explicit constructions of regenerating codes that achieve the cut-set bound.