931 resultados para Encoding (symbols)
Resumo:
We study the boundedness of Toeplitz operators on Segal-Bargmann spaces in various contexts. Using Gutzmer's formula as the main tool we identify symbols for which the Toeplitz operators correspond to Fourier multipliers on the underlying groups. The spaces considered include Fock spaces, Hermite and twisted Bergman spaces and Segal-Bargmann spaces associated to Riemannian symmetric spaces of compact type.
Resumo:
Transforming growth factor-beta s (TGF-beta 5) are multifunctional polypeptides, known to influence proliferation and differentiation of many cell types. TGF-beta 5 cDNA was cloned from Xenopus laevis and this isoform is unique to the amphibians. Here, we report the isolation and characterization of the TGF-beta 5 genomic clones to determine the structure of TGF-beta 5 gene. The gene consists of seven exons and all intron-exon boundaries follow the GT-AG consensus. The organization of TGF-beta 5 gene was identical to that of the mammalian TGF-beta isoforms, with the exception of position of the first splice junction. We determined the size of TGF-beta 5 gene to be approximately 20 kb.
Resumo:
We consider the problem of compression via homomorphic encoding of a source having a group alphabet. This is motivated by the problem of distributed function computation, where it is known that if one is only interested in computing a function of several sources, then one can at times improve upon the compression rate required by the Slepian-Wolf bound. The functions of interest are those which could be represented by the binary operation in the group. We first consider the case when the source alphabet is the cyclic Abelian group, Zpr. In this scenario, we show that the set of achievable rates provided by Krithivasan and Pradhan [1], is indeed the best possible. In addition to that, we provide a simpler proof of their achievability result. In the case of a general Abelian group, an improved achievable rate region is presented than what was obtained by Krithivasan and Pradhan. We then consider the case when the source alphabet is a non-Abelian group. We show that if all the source symbols have non-zero probability and the center of the group is trivial, then it is impossible to compress such a source if one employs a homomorphic encoder. Finally, we present certain non-homomorphic encoders, which also are suitable in the context of function computation over non-Abelian group sources and provide rate regions achieved by these encoders.
Resumo:
We describe here the characterization of the gene gp64 encoding the envelope fusion protein GP64 (open reading frame) ORF 105 from Bombyx mori nucleopolyhedrovirus (BmNPV). gp64 was transcribed from the early to late stages of infection and the transcripts were seen from 6 to 72 h post infection (hpi). The early transcripts initiated from a consensus CAGT motif while the late transcripts arose from three conserved TAAG motifs, all of which were located in the near upstream region of the coding sequence. Both early and late transcripts terminated at a run of T residues following the second polyadenylation signal located 31 nt downstream of the translation termination codon. BmGP64 protein was detectable from 6 hpi and was present in larger quantities throughout the infection process from 12 hpi, in BmNPV-infected BmN cells. The persistent presence of GP64 in BmN cells differed from the protein expression pattern of GP64 in Autographa californica multinucleocapsid nucleopolyhedrovirus infection, where the protein levels decreased significantly by late times (48 hpi). BmGP64 was located in the membrane and cytoplasm of the infected host cells and as a component of the budded virions. The production of infectious budded virus and the fusion activity were reduced when glycosylation of GP64 was inhibited. (C) 2003 Elsevier Science B.V. All rights reserved.
Resumo:
We have developed two reduced complexity bit-allocation algorithms for MP3/AAC based audio encoding, which can be useful at low bit-rates. One algorithm derives optimum bit-allocation using constrained optimization of weighted noise-to-mask ratio and the second algorithm uses decoupled iterations for distortion control and rate control, with convergence criteria. MUSHRA based evaluation indicated that the new algorithm would be comparable to AAC but requiring only about 1/10 th the complexity.
Resumo:
In general the objective of accurately encoding the input data and the objective of extracting good features to facilitate classification are not consistent with each other. As a result, good encoding methods may not be effective mechanisms for classification. In this paper, an earlier proposed unsupervised feature extraction mechanism for pattern classification has been extended to obtain an invertible map. The method of bimodal projection-based features was inspired by the general class of methods called projection pursuit. The principle of projection pursuit concentrates on projections that discriminate between clusters and not faithful representations. The basic feature map obtained by the method of bimodal projections has been extended to overcome this. The extended feature map is an embedding of the input space in the feature space. As a result, the inverse map exists and hence the representation of the input space in the feature space is exact. This map can be naturally expressed as a feedforward neural network.
Resumo:
Primary microcephaly is an autosomal recessive disorder characterized by smaller than normal brain size and mental retardation. It is genetically heterogeneous with seven loci: MCPH1-MCPH7. We have previously reported genetic analysis of 35 families, including the identification of the MCPH7 gene STIL. Of the 35 families, three families showed linkage to the MCPH2 locus. Recent whole-exome sequencing studies have shown that the WDR62 gene, located in the MCPH2 candidate region, is mutated in patients with severe brain malformations. We therefore sequenced the WDR62 gene in our MCPH2 families and identified two novel homozygous protein truncating mutations in two families. Affected individuals in the two families had pachygyria, microlissencephaly, band heterotopias, gyral thickening, and dysplastic cortex. Using immunofluorescence study, we showed that, as with other MCPH proteins, WDR62 localizes to centrosomes in A549, HepG2, and HaCaT cells. In addition, WDR62 was also localized to nucleoli. Bioinformatics analysis predicted two overlapping nuclear localization signals and multiple WD-40 repeats in WDR62. Two other groups have also recently identified WDR62 mutations in MCPH2 families. Our results therefore add further evidence that WDR62 is the MCPH2 gene. The present findings will be helpful in genetic diagnosis of patients linked to the MCPH2 locus.
Resumo:
For a family/sequence of Space-Time Block Codes (STBCs) C1, C2,⋯, with increasing number of transmit antennas Ni, with rates Ri complex symbols per channel use (cspcu), i = 1,2,⋯, the asymptotic normalized rate is defined as limi→∞ Ri/Ni. A family of STBCs is said to be asymptotically-good if the asymptotic normalized rate is non-zero, i.e., when the rate scales as a non-zero fraction of the number of transmit antennas, and the family of STBCs is said to be asymptotically-optimal if the asymptotic normalized rate is 1, which is the maximum possible value. In this paper, we construct a new class of full-diversity STBCs that have the least maximum-likelihood (ML) decoding complexity among all known codes for any number of transmit antennas N>;1 and rates R>;1 cspcu. For a large set of (R,N) pairs, the new codes have lower ML decoding complexity than the codes already available in the literature. Among the new codes, the class of full-rate codes (R=N) are asymptotically-optimal and fast-decodable, and for N>;5 have lower ML decoding complexity than all other families of asymptotically-optimal, fast-decodable, full-diversity STBCs available in the literature. The construction of the new STBCs is facilitated by the following further contributions of this paper: (i) Construction of a new class of asymptotically-good, full-diversity multigroup ML decodable codes, that not only includes STBCs for a larger set of antennas, but also either matches in rate or contains as a proper subset all other high-rate or asymptotically-good, delay-optimal, multigroup ML decodable codes available in the literature. (ii) Construction of a new class of fast-group-decodable codes (codes that combine the low ML decoding complexity properties of multigroup ML decodable codes and fast-decodable codes) for all even number of transmit antennas and rates 1 <; R ≤ 5/4.- - (iii) Given a design with full-rank linear dispersion matrices, we show that a full-diversity STBC can be constructed from this design by encoding the real symbols independently using only regular PAM constellations.
Resumo:
We report that the bgl operon of Escherichia coli, encoding the functions necessary for the uptake and metabolism of aryl-beta-glucosides, is involved in the regulation of oligopeptide transport during stationary phase. Global analysis of intracellular proteins from Bgl-positive (Bgl(+)) and Bgl-negative (Bgl(-)) strains revealed that the operon exerts regulation on at least 12 downstream target genes. Of these, oppA, which encodes an oligopeptide transporter, was confirmed to be upregulated in the Bgl(+) strain. Loss of oppA function results in a partial loss of the growth advantage in stationary-phase (GASP) phenotype of Bgl(+) cells. The regulatory effect of the bgl operon on oppA expression is indirect and is mediated via gcvA, the activator of the glycine cleavage system, and gcvB, which regulates oppA at the posttranscriptional level. We show that BglG destabilizes the gcvA mRNA in vivo, leading to reduced expression of gcvA in the stationary phase. Deletion of gcvA results in the downregulation of gcvB and upregulation of oppA and can partially rescue the loss of the GASP phenotype seen in Delta bglG strains. A possible mechanism by which oppA confers a competitive advantage to Bgl(+) cells relative to Bgl(-) cells is discussed.
Resumo:
Diaminopropionate ammonia lyase (DAPAL) is a pyridoxal-5'phosphate (PLP)-dependent enzyme that catalyzes the conversion of diaminopropionate (DAP) to pyruvate and ammonia and plays an important role in cell metabolism. We have investigated the role of the ygeX gene of Escherichia coli K-12 and its ortholog, STM1002, in Salmonella enterica serovar Typhimurium LT2, presumed to encode DAPAL, in the growth kinetics of the bacteria. While Salmonella Typhimurium LT2 could grow on DL-DAP as a sole carbon source, the wild-type E. coli K-12 strain exhibited only marginal growth on DL-DAP, suggesting that DAPAL is functional in S. Typhimurium. The expression of ygeX in E. coli was low as detected by reverse transcriptase PCR (RT-PCR), consistent with the poor growth of E. coli on DL-DAP. Strains of S. Typhimurium and E. coli with STM1002 and ygeX, respectively, deleted showed loss of growth on DL-DAP, confirming that STM1002 (ygeX) is the locus encoding DAPAL. Interestingly, the presence of DL-DAP caused a growth inhibition of the wild-type E. coli strain as well as the knockout strains of S. Typhimurium and E. coli in minimal glucose/glycerol medium. Inhibition by DL-DAP was rescued by transforming the strains with plasmids containing the STM1002 (ygeX) gene encoding DAPAL or supplementing the medium with Casamino Acids. Growth restoration studies using media lacking specific amino acid supplements suggested that growth inhibition by DL-DAP in the absence of DAPAL is associated with auxotrophy related to the inhibition of the enzymes involved in the biosynthetic pathways of pyruvate and aspartate and the amino acids derived from them.
Resumo:
Identifying the determinants of neuronal energy consumption and their relationship to information coding is critical to understanding neuronal function and evolution. Three of the main determinants are cell size, ion channel density, and stimulus statistics. Here we investigate their impact on neuronal energy consumption and information coding by comparing single-compartment spiking neuron models of different sizes with different densities of stochastic voltage-gated Na+ and K+ channels and different statistics of synaptic inputs. The largest compartments have the highest information rates but the lowest energy efficiency for a given voltage-gated ion channel density, and the highest signaling efficiency (bits spike(-1)) for a given firing rate. For a given cell size, our models revealed that the ion channel density that maximizes energy efficiency is lower than that maximizing information rate. Low rates of small synaptic inputs improve energy efficiency but the highest information rates occur with higher rates and larger inputs. These relationships produce a Law of Diminishing Returns that penalizes costly excess information coding capacity, promoting the reduction of cell size, channel density, and input stimuli to the minimum possible, suggesting that the trade-off between energy and information has influenced all aspects of neuronal anatomy and physiology.
Resumo:
The algebraic formulation for linear network coding in acyclic networks with each link having an integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes at any given time instant is a Fq-linear combination of the input symbols across different generations, where Fq denotes the field over which the network operates. We use finite-field discrete Fourier transform (DFT) to convert the output symbols at the sink nodes at any given time instant into a Fq-linear combination of the input symbols generated during the same generation. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (non-transform) approach if and only if there exists a network code satisfying sink demands in the transform approach. Furthermore, assuming time invariant local encoding kernels, we show that the transform method can be employed to achieve half the rate corresponding to the individual source-destination mincut (which are assumed to be equal to 1) for some classes of three-source three-destination multiple unicast network with delays using alignment strategies when the zero-interference condition is not satisfied.
Resumo:
The Wilms tumor 1 gene (WT1) can either repress or induce the expression of genes. Inconsistent with its tumor suppressor role, elevated WT1 levels have been observed in leukemia and solid tumors. WT1 has also been suggested to act as an oncogene by inducing the expression of MYC and BCL-2. However, these are only the correlational studies, and no functional study has been performed to date. Consistent with its tumor suppressor role, CDC73 binds to RNA polymerase II as part of a PAF1 transcriptional regulatory complex and causes transcriptional repression of oncogenes MYC and CCND1. It also represses beta-catenin-mediated transcription. Based on the reduced level of CDC73 in oral squamous cell carcinoma (OSCC) samples in the absence of loss-of-heterozygosity, promoter methylation, and mutations, we speculated that an inhibitory transcription factor is regulating its expression. The bioinformatics analysis predicted WT1 as an inhibitory transcription factor to regulate the CDC73 level. Our results showed that overexpression of WT1 decreased CDC73 levels and promoted proliferation of OSCC cells. ChIP and EMSA results demonstrated binding of WT1 to the CDC73 promoter. The 5-azacytidine treatment of OSCC cells led to an up-regulation of WT1 with a concomitant down-regulation of CDC73, further suggesting regulation of CDC73 by WT1. Exogenous CDC73 attenuated the protumorigenic activity of WT1 by apoptosis induction. An inverse correlation between expression levels of CDC73 and WT1 was observed in OSCC samples. These observations indicated that WT1 functions as an oncogene by repressing the expression of CDC73 in OSCC. We suggest that targeting WT1 could be a therapeutic strategy for cancer, including OSCC.