p53 and little brother p53/47: linking IRES activities with protein functions

The tumor suppressor p53 represents a paradigm for gene regulation. Its rapid induction in response to DNA damage conditions has been attributed to both increased half-life of p53 protein and also increased translation of p53 mRNA. Recent advances in our understanding of the post-transcriptional regulation of p53 include the discovery of internal ribosome entry sites (IRESs) within the p53 mRNA. These IRES elements regulate the translation of the full length as well as the N-terminally truncated isoform, p53/47. The p53/47 isoform is generated by alternative initiation at an internal AUG codon present within the p53 ORF. The aim of this review is to summarize the role of translational control mechanisms in regulating p53 functions. We discuss here in detail how diverse cellular stress pathways trigger alterations in the cap-dependent and cap-independent translation of p53 mRNA and how changes in the relative expression levels of p53 isoforms result in more differentiated p53 activity.

Adriamycin affects plasma membrane redox functions

Adriamycin (Doxorubicin) stimulates NADH oxidase activity in liver plasma membrane, but does not cause NADH oxidase activity to appear where it is not initially present, as in erythrocyte membrane. NADH dehydrogenase from rat liver and erythrocyte plasma membranes shows similar adriamycin effects with other electron acceptors. Both NADH ferricyanide reductase and vanadate-stimulated NADH oxidation are inhibited by adriamycin, as is a cyanide insensitive ascorbate oxidase activity, whereas NADH cytochrome c reductase is not affected. The effects may contribute to the growth inhibitory (control) and/or deleterious effects of adriamycin. It is clear that adriamycin effects on the plasma membrane dehydrogenase involve more than a simple catalysis of superoxide formation.

Relaxation Labeling with Learning Automata

Relaxation labeling processes are a class of mechanisms that solve the problem of assigning labels to objects in a manner that is consistent with respect to some domain-specific constraints. We reformulate this using the model of a team of learning automata interacting with an environment or a high-level critic that gives noisy responses as to the consistency of a tentative labeling selected by the automata. This results in an iterative linear algorithm that is itself probabilistic. Using an explicit definition of consistency we give a complete analysis of this probabilistic relaxation process using weak convergence results for stochastic algorithms. Our model can accommodate a range of uncertainties in the compatibility functions. We prove a local convergence result and show that the point of convergence depends both on the initial labeling and the constraints. The algorithm is implementable in a highly parallel fashion.

Anisochrony of O-methylene protons of ethyl ester functions and structural factors in the connected chiral entities

(i) Incistrans pairs of cyclic 1,3-dicarboxylic acid ethyl esters thecis-foms exhibit higher O-methylene proton (HA, HB) anisochrony than thetrans-forms; (ii) anisochrony, easily observed in certain decalin-10-carboxylic ethyl esters, ‘disappears’ on one of the rings attaining the possibility of transforming into a ‘twist’ form; (iii) in certain pairs of chiralsecethyl esters and theirtert-methylated analogues anisochrony is higher in the latter, contrary to expectation, while, in certain others, the reverse is observed. Attempted explanations are based on assessments whether H A and H B are or are not in highly different magnetic environments in confomers regarded as preferred. This subsumes the possibility thatXYZC-CO2H A H B Me chiral ethyl acetates differ fromXYZC-CH A H B Me ethanes because intervention by the carboxyl group insulates the prochiral centre and allows anisotropic effects to gain somewhat in importance among mechanisms that discriminate between H A and H B so long as rotamerpopulation inequalities persist. Background information on why rotamer-population inequalities will always persist and on a heuristic that attempts to generalize the effects ofXYZ inXYZC - CU AUB V is provided. Possible effects when connectivity exists between a pair amongX, Y, Z or when specific interactions occur betweenV andX, Y orZ are considered. An interpretation in terms of ‘increasing conformational mobility’ has been suggested for the observed increase in the rate of temperature-dependence of O-methylene anisochrony down a series of chiral ethyl esters.

Comments on Identification of Totally Symmetric Boolean Functions

A modification in the algorithm for the detection of totally symmetric functions as expounded by the author in an earlier note1 is presented here. The modified algorithm takes care of a limited number of functions that escape detection by the previous method.

Synthesis of plane linkages to generate functions of two variables using point position reductionâII. Sliding inputs and outputs

The paper presents simple graphical procedures for the position synthesis of plane linkage mechanisms with sliding inputs and output to generate functions of two independent variables. The procedures are based on point position reduction and permit synthesis of the linkage to satisfy up to five arbitrarily selected precision positions.

A probabilistic approach to the problem of electron localization in disordered systems and sharpness of the mobility edge

By applying the theory of the asymptotic distribution of extremes and a certain stability criterion to the question of the domain of convergence in the probability sense, of the renormalized perturbation expansion (RPE) for the site self-energy in a cellularly disordered system, an expression has been obtained in closed form for the probability of nonconvergence of the RPE on the real-energy axis. Hence, the intrinsic mobility mu (E) as a function of the carrier energy E is deduced to be given by mu (E)= mu 0exp(-exp( mod E mod -Ec) Delta ), where Ec is a nominal 'mobility edge' and Delta is the width of the random site-energy distribution. Thus mobility falls off sharply but continuously for mod E mod >Ec, in contradistinction with the notion of an abrupt 'mobility edge' proposed by Cohen et al. and Mott. Also, the calculated electrical conductivity shows a temperature dependence in qualitative agreement with experiments on disordered semiconductors.

Karnaugh map analysis and synthesis of threshold functions

A unate function can easily be identified on a Karnaugh map from the well-known property that it cons ist s only ofess en ti al prime implicante which intersect at a common implicant. The additional property that the plot of a unate function F(x, ... XII) on a Karnaugh map should possess in order that F may also be Ivrealizable (n';:; 6) has been found. It has been sh own that the I- realizability of a unate function F corresponds to the ' compac tness' of the plot of F. No resort to tho inequalities is made, and no pre-processing such as positivizing and ordering of the given function is required.

A Note on Easily Testable Realizations for Logic Functions

It is shown that at most, n + 3 tests are required to detect any single stuck-at fault in an AND gate or a single faulty EXCLUSIVE OR (EOR) gate in a Reed-Muller canonical form realization of a switching function.

A conditional random field-based downscaling method for assessment of climate change impact on multisite daily precipitation in the Mahanadi basin

Downscaling to station-scale hydrologic variables from large-scale atmospheric variables simulated by general circulation models (GCMs) is usually necessary to assess the hydrologic impact of climate change. This work presents CRF-downscaling, a new probabilistic downscaling method that represents the daily precipitation sequence as a conditional random field (CRF). The conditional distribution of the precipitation sequence at a site, given the daily atmospheric (large-scale) variable sequence, is modeled as a linear chain CRF. CRFs do not make assumptions on independence of observations, which gives them flexibility in using high-dimensional feature vectors. Maximum likelihood parameter estimation for the model is performed using limited memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) optimization. Maximum a posteriori estimation is used to determine the most likely precipitation sequence for a given set of atmospheric input variables using the Viterbi algorithm. Direct classification of dry/wet days as well as precipitation amount is achieved within a single modeling framework. The model is used to project the future cumulative distribution function of precipitation. Uncertainty in precipitation prediction is addressed through a modified Viterbi algorithm that predicts the n most likely sequences. The model is applied for downscaling monsoon (June-September) daily precipitation at eight sites in the Mahanadi basin in Orissa, India, using the MIROC3.2 medium-resolution GCM. The predicted distributions at all sites show an increase in the number of wet days, and also an increase in wet day precipitation amounts. A comparison of current and future predicted probability density functions for daily precipitation shows a change in shape of the density function with decreasing probability of lower precipitation and increasing probability of higher precipitation.

A Note on Minimal Reed-Muller Canonical Forms of Switching Functions

A nonexhaustive procedure for obtaining minimal Reed-Muller canonical (RMC) forms of switching functions is presented. This procedure is a modification of a procedure presented earlier in the literature and enables derivation of an upper bound on the number of RMC forms to be derived to choose a minimal one. It is shown that the task of obtaining minimal RMC forms is simplified in the case of symmetric functions and self-dual functions.

A semi-analytical particle filter for identification of nonlinear oscillators

Particle filters find important applications in the problems of state and parameter estimations of dynamical systems of engineering interest. Since a typical filtering algorithm involves Monte Carlo simulations of the process equations, sample variance of the estimator is inversely proportional to the number of particles. The sample variance may be reduced if one uses a Rao-Blackwell marginalization of states and performs analytical computations as much as possible. In this work, we propose a semi-analytical particle filter, requiring no Rao-Blackwell marginalization, for state and parameter estimations of nonlinear dynamical systems with additively Gaussian process/observation noises. Through local linearizations of the nonlinear drift fields in the process/observation equations via explicit Ito-Taylor expansions, the given nonlinear system is transformed into an ensemble of locally linearized systems. Using the most recent observation, conditionally Gaussian posterior density functions of the linearized systems are analytically obtained through the Kalman filter. This information is further exploited within the particle filter algorithm for obtaining samples from the optimal posterior density of the states. The potential of the method in state/parameter estimations is demonstrated through numerical illustrations for a few nonlinear oscillators. The proposed filter is found to yield estimates with reduced sample variance and improved accuracy vis-a-vis results from a form of sequential importance sampling filter.

Automata and logics over finitely varying functions

We extend some of the classical connections between automata and logic due to Büchi (1960) [5] and McNaughton and Papert (1971) [12] to languages of finitely varying functions or “signals”. In particular, we introduce a natural class of automata for generating finitely varying functions called View the MathML source’s, and show that it coincides in terms of language definability with a natural monadic second-order logic interpreted over finitely varying functions Rabinovich (2002) [15]. We also identify a “counter-free” subclass of View the MathML source’s which characterise the first-order definable languages of finitely varying functions. Our proofs mainly factor through the classical results for word languages. These results have applications in automata characterisations for continuously interpreted real-time logics like Metric Temporal Logic (MTL) Chevalier et al. (2006, 2007) [6] and [7].