22 resultados para Maximal Rewriting of a Regular Language at a Regular Substitution
em Indian Institute of Science - Bangalore - Índia
Resumo:
A Linear Processing Complex Orthogonal Design (LPCOD) is a p x n matrix epsilon, (p >= n) in k complex indeterminates x(1), x(2),..., x(k) such that (i) the entries of epsilon are complex linear combinations of 0, +/- x(i), i = 1,..., k and their conjugates, (ii) epsilon(H)epsilon = D, where epsilon(H) is the Hermitian (conjugate transpose) of epsilon and D is a diagonal matrix with the (i, i)-th diagonal element of the form l(1)((i))vertical bar x(1)vertical bar(2) + l(2)((i))vertical bar x(2)vertical bar(2)+...+ l(k)((i))vertical bar x(k)vertical bar(2) where l(j)((i)), i = 1, 2,..., n, j = 1, 2,...,k are strictly positive real numbers and the condition l(1)((i)) = l(2)((i)) = ... = l(k)((i)), called the equal-weights condition, holds for all values of i. For square designs it is known. that whenever a LPCOD exists without the equal-weights condition satisfied then there exists another LPCOD with identical parameters with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1. This implies that the maximum possible rate for square LPCODs without the equal-weights condition is the same as that or square LPCODs with equal-weights condition. In this paper, this result is extended to a subclass of non-square LPCODs. It is shown that, a set of sufficient conditions is identified such that whenever a non-square (p > n) LPCOD satisfies these sufficient conditions and do not satisfy the equal-weights condition, then there exists another LPCOD with the same parameters n, k and p in the same complex indeterminates with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1.
Resumo:
For p x n complex orthogonal designs in k variables, where p is the number of channels uses and n is the number of transmit antennas, the maximal rate L of the design is asymptotically half as n increases. But, for such maximal rate codes, the decoding delay p increases exponentially. To control the delay, if we put the restriction that p = n, i.e., consider only the square designs, then, the rate decreases exponentially as n increases. This necessitates the study of the maximal rate of the designs with restrictions of the form p = n+1, p = n+2, p = n+3 etc. In this paper, we study the maximal rate of complex orthogonal designs with the restrictions p = n+1 and p = n+2. We derive upper and lower bounds for the maximal rate for p = n+1 and p = n+2. Also for the case of p = n+1, we show that if the orthogonal design admit only the variables, their negatives and multiples of these by root-1 and zeros as the entries of the matrix (other complex linear combinations are not allowed), then the maximal rate always equals the lower bound.
Resumo:
An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes are near regular in the sense that the degree of a left/right vertex is allowed to differ by at most one from the average. The construction yields in quadratic time complexity an asymptotic code family with provable lower bounds on the rate and the girth for a given choice of block length and average degree. The construction gives flexibility in the choice of design parameters of the code like rate, girth and average degree. Performance simulations of iterative decoding algorithm for the AWGN channel on codes designed using the method demonstrate that these codes perform better than regular PEG codes and MacKay codes of similar length for all values of Signal to noise ratio.
Resumo:
Space-time block codes based on orthogonal designs are used for wireless communications with multiple transmit antennas which can achieve full transmit diversity and have low decoding complexity. However, the rate of the square real/complex orthogonal designs tends to zero with increase in number of antennas, while it is possible to have a rate-1 real orthogonal design (ROD) for any number of antennas.In case of complex orthogonal designs (CODs), rate-1 codes exist only for 1 and 2 antennas. In general, For a transmit antennas, the maximal rate of a COD is 1/2 + l/n or 1/2 + 1/n+1 for n even or odd respectively. In this paper, we present a simple construction for maximal-rate CODs for any number of antennas from square CODs which resembles the construction of rate-1 RODs from square RODs. These designs are shown to be amenable for construction of a class of generalized CODs (called Coordinate-Interleaved Scaled CODs) with low peak-to-average power ratio (PAPR) having the same parameters as the maximal-rate codes. Simulation results indicate that these codes perform better than the existing maximal rate codes under peak power constraint while performing the same under average power constraint.
Resumo:
We propose a scheme for the compression of tree structured intermediate code consisting of a sequence of trees specified by a regular tree grammar. The scheme is based on arithmetic coding, and the model that works in conjunction with the coder is automatically generated from the syntactical specification of the tree language. Experiments on data sets consisting of intermediate code trees yield compression ratios ranging from 2.5 to 8, for file sizes ranging from 167 bytes to 1 megabyte.
Resumo:
Current scientific research is characterized by increasing specialization, accumulating knowledge at a high speed due to parallel advances in a multitude of sub-disciplines. Recent estimates suggest that human knowledge doubles every two to three years – and with the advances in information and communication technologies, this wide body of scientific knowledge is available to anyone, anywhere, anytime. This may also be referred to as ambient intelligence – an environment characterized by plentiful and available knowledge. The bottleneck in utilizing this knowledge for specific applications is not accessing but assimilating the information and transforming it to suit the needs for a specific application. The increasingly specialized areas of scientific research often have the common goal of converting data into insight allowing the identification of solutions to scientific problems. Due to this common goal, there are strong parallels between different areas of applications that can be exploited and used to cross-fertilize different disciplines. For example, the same fundamental statistical methods are used extensively in speech and language processing, in materials science applications, in visual processing and in biomedicine. Each sub-discipline has found its own specialized methodologies making these statistical methods successful to the given application. The unification of specialized areas is possible because many different problems can share strong analogies, making the theories developed for one problem applicable to other areas of research. It is the goal of this paper to demonstrate the utility of merging two disparate areas of applications to advance scientific research. The merging process requires cross-disciplinary collaboration to allow maximal exploitation of advances in one sub-discipline for that of another. We will demonstrate this general concept with the specific example of merging language technologies and computational biology.
Resumo:
We consider some non-autonomous second order Cauchy problems of the form u + B(t)(u) over dot + A(t)u = f (t is an element of [0, T]), u(0) = (u) over dot(0) = 0. We assume that the first order problem (u) over dot + B(t)u = f (t is an element of [0, T]), u(0) = 0, has L-p-maximal regularity. Then we establish L-p-maximal regularity of the second order problem in situations when the domains of B(t(1)) and A(t(2)) always coincide, or when A(t) = kappa B(t).
Resumo:
A new geometrical method for generating aperiodic lattices forn-fold non-crystallographic axes is described. The method is based on the self-similarity principle. It makes use of the principles of gnomons to divide the basic triangle of a regular polygon of 2n sides to appropriate isosceles triangles and to generate a minimum set of rhombi required to fill that polygon. The method is applicable to anyn-fold noncrystallographic axis. It is first shown how these regular polygons can be obtained and how these can be used to generate aperiodic structures. In particular, the application of this method to the cases of five-fold and seven-fold axes is discussed. The present method indicates that the recursion rule used by others earlier is a restricted one and that several aperiodic lattices with five fold symmetry could be generated. It is also shown how a limited array of approximately square cells with large dimensions could be detected in a quasi lattice and these are compared with the unit cell dimensions of MnAl6 suggested by Pauling. In addition, the recursion rule for sub-dividing the three basic rhombi of seven-fold structure was obtained and the aperiodic lattice thus generated is also shown.
Resumo:
A simple procedure for the state minimization of an incompletely specified sequential machine whose number of internal states is not very large is presented. It introduces the concept of a compatibility graph from which the set of maximal compatibles of the machine can be very conveniently derived. Primary and secondary implication trees associated with each maximal compatible are then constructed. The minimal state machine covering the incompletely specified machine is then obtained from these implication trees.
Resumo:
Base-base interactions were computed for single- and double- stranded polynucleotides, for all possible base sequences. In each case, both right and left stacking arrangements are energetically possible. The preference of one over the other depends upon the base-sequence and the orientation of the bases with respect to helix-axis. Inverted stacking arrangement is also energetically possible for both single- and double-stranded polynucleotides. Finally, interaction energies of a regular duplex and the alternative structures3 were compared. It was found that the type II model3 is energetically more favourable than the rest.
Resumo:
The influence of fructose 2,6-bisphosphate on the activation of purified swine kidney phosphofructokinase as a function of the concentration of fructose 6P, ATP and citrate was investigated. The purified enzyme was nearly completely inhibited in the presence of 2 mM ATP. The addition of 20 nM fructose 2,6-P2 reversed the inhibition and restored more than 80% of the activity. In the absence of fructose 2,6-P2 the reaction showed a sigmoidal dependence on fructose-6-phosphate. The addition of 10 nM fructose 2,6-bisphosphate decreased the K0.5 for fructose 6-phosphate from 3 mM to 0.4 mM in the presence of 1.5 mM ATP. These results clearly show that fructose 2,6-bisphosphate increases the affinity of the enzyme for fructose 6-phosphate and decreases the inhibitory effect of ATP. The extent of inhibition by citrate was also significantly decreased in the presence of fructose 2,6-phosphate. The influence of various effectors of phosphofructokinase on the binding of ATP and fructose 6-P to the enzyme was examined in gel filtration studies. It was found that kidney phosphofructokinase binds 5.6 moles of fructose 6-P per mole of enzyme, which corresponds to about one site per subunit of tetrameric enzyme. The KD for fructose 6-P was 13 microM and in the presence of 0.5 mM ATP it increased to 27 microM. The addition of 0.3 mM citrate also increased the KD for fructose 6-P to about 40 microM. AMP, 10 microM, decreased the KD to 5 microM and the addition of fructose 2,6-phosphate decreased the KD for fructose 6-P to 0.9 microM. The addition of these compounds did not effect the maximal amount of fructose 6-P bound to the enzyme, which indicated that the binding site for these compounds might be near, but was not identical to the fructose 6-P binding site. The enzyme bound a maximum of about 12.5 moles of ATP per mole, which corresponds to 3 moles per subunit. The KD of the site with the highest affinity for ATP was 4 microM, and it increased to 15 microM in the presence of fructose 2,6-bisphosphate. The addition of 50 microM fructose 1,6-bisphosphate increased the KD for ATP to 5.9 microM. AMP increased the KD to 5.9 microM whereas 0.3 mM citrate decreased the KD for ATP to about 2 microM.(ABSTRACT TRUNCATED AT 400 WORDS).
Resumo:
Transport of 1-14C-IAA in successive stem segments of Cuscuta was strictly basipetal in growing and non growing regions of the vine with a flux velocity of 10-12 mm/h (intercept method). This transport showed a distinct peaked profile, increasing from a low value at 10 mm from the apex to a maximum between 50 and 90 mm before declining to a low value again around 160 mm at which elongation growth ceased. The IAA transport profile paralleled the in vivo growth rate profile, though the latter peaked ahead of transport. A better correlation was observed between the profile of growth responsiveness of the vine to exogenous IAA application and the profile of IAA transport. Growth responsiveness was determined as the differential in growth rate of stem segments in vitro in the absence and presence of growth optimal concentration of IAA (10 μm). Retention of exogenous IAA in the stem was maximal where transport decreased, and this coincided with the region of maximal conjugation of applied 1-14C-IAA to aspartic acid to form indoleacetylaspartate (IAAsp). In addition to aspartate, IAA was conjugated to a small extent to an unidentified compound. IAA destruction by decarboxylation was greatest where transport was low, particularly in the nongrowing region, where lignification occurred (i.e., beyond 180 mm). At concentrations up to 20 μM, a pulse of 1-14C-IAA chased by "cold" IAA moved as a peak (with a peak displacement velocity of 12-18 mm/h) in the "growth" region of the vine, but became diffusionlike where growth either fell off steeply or ceased. At a higher (50 μM) IAA concentration, though uptake was not saturated, transport in the growth region became diffusionlike, indicating saturation of the system. Reduced IAA flux in the region where growth responsiveness to IAA declined coincided with the region of increased IAA conjugation. However, it cannot be concluded whether increased IAA conjugation was the cause or effect of decreased IAA flux. Application of benzyladenine to the vines in vivo, a treatment that elicited haustoria formation by 72 h, resulted in the inhibition of both IAA transport and elongation growth rate in the subapical region. In vitro treatment of vine segments with BA similarly increased IAA retention and decreased IAA transport. IAA loss was suppressed, and conjugation to IAAsp was enhanced. © 1989 Springer-Verlag New York Inc.
Resumo:
Human platelet-derived growth factor (PDGF) is composed of two polypeptide chains, PDGF-1 and PDGF-2,the human homolog of the v-sis oncogene. Deregulation of PDGF-2 expression can confer a growth advantage to cells possessing the cognate receptor and, thus, may contribute to the malignant phenotype. We investigated the regulation of PDGF-2 mRNA expression during megakaryocytic differentiation of K562 cells. Induction by 12-O-tetradecanoylphorbol-13-acetate (TPA) led to a greater than 200-fold increase in PDGF-2 transcript levels in these cells. Induction was dependent on protein synthesis and was not enhanced by cycloheximide exposure.In our initial investigation of the PDGF-2 promoter, a minimal promoter region, which included sequences extending only 42 base pairs upstream of the TATA signal, was found to be as efficient as 4 kilobase pairs upstream of the TATA signal in driving expression of a reporter gene in uninduced K562 cells. We also functionally identified different regulatory sequence elements of the PDGF-2 promoter in TPA-induced K562 cells. One region acted as a transcriptional silencer, while another region was necessary for maximal activity of the promoter in megakaryoblasts. This region was shown to bind nuclear factors and was the target for trans-activation in normal and tumor cells. In one tumor cell line, which expressed high PDGF-2 mRNA levels, the presence of the positive regulatory region resulted in a 30-fold increase in promoter activity. However, the ability of the minimal PDGF-2 promoter to drive reporter gene expression in uninduced K562 cells and normal fibroblasts, which contained no detectable PDGF-2 transcripts, implies the existence of other negative control mechanisms beyond the regulation of promoter activity.
Resumo:
Using normal mode analysis Rayleigh-Taylor instability is investigated for three-layer viscous stratified incompressible steady flow, when the top 3rd and bottom 1st layers extend up to infinity, the middle layer has a small thickness δ. The wave Reynolds number in the middle layer is assumed to be sufficiently small. A dispersion relation (a seventh degree polynomial in wave frequency ω) valid up to the order of the maximal value of all possible Kj (j less-than-or-equals, slant 0, K is the wave number) in each coefficient of the polynomial is obtained. A sufficient condition for instability is found out for the first time, pursuing a medium wavelength analysis. It depends on ratios (α and β) of the coefficients of viscosity, the thickness of the middle layer δ, surface tension ratio T and wave number K. This is a new analytical criterion for Rayleigh-Taylor instability of three-layer fluids. It recovers the results of the corresponding problem for two-layer fluids. Among the results obtained, it is observed that taking the coefficients of viscosity of 2nd and 3rd layers same can inhibit the effect of surface tension completely. For large wave number K, the thickness of the middle layer should be correspondingly small to keep the domain of dependence of the threshold wave number Kc constant for fixed α, β and T.
Resumo:
An expression is developed for the variation of the critical solution temperature of a binary liquid system when a third component (dopant) is added, using an extension of the regular solution theory. The model can be used for UCST, LCST and for closed loop systems and has the correct features in the limiting cases.