RPS4Y gene family evolution in primates

Background: The RPS4 gene codifies for ribosomal protein S4, a very well-conserved protein present in all kingdoms. In primates, RPS4 is codified by two functional genes located on both sex chromosomes: the RPS4X and RPS4Y genes. In humans, RPS4Y is duplicated and the Y chromosome therefore carries a third functional paralog: RPS4Y2, which presents a testis-specific expression pattern. Results: DNA sequence analysis of the intronic and cDNA regions of RPS4Y genes from species covering the entire primate phylogeny showed that the duplication event leading to the second Y-linked copy occurred after the divergence of New World monkeys, about 35 million years ago. Maximum likelihood analyses of the synonymous and non-synonymous substitutions revealed that positive selection was acting on RPS4Y2 gene in the human lineage, which represents the first evidence of positive selection on a ribosomal protein gene. Putative positive amino acid replacements affected the three domains of the protein: one of these changes is located in the KOW protein domain and affects the unique invariable position of this motif, and might thus have a dramatic effect on the protein function.Conclusion: Here, we shed new light on the evolutionary history of RPS4Y gene family, especially on that of RPS4Y2. The results point that the RPS4Y1 gene might be maintained to compensate gene dosage between sexes, while RPS4Y2 might have acquired a new function, at least in the lineage leading to humans.

Modelos de tasas de interes en Chile: una revisión

Con este trabajo revisamos los Modelos de niveles de las tasas de intereses en Chile. Además de los Modelos de Nivel tradicionales por Chan, Karoly, Longstaff y Lijadoras (1992) en EE. UU, y Parisi (1998) en Chile, por el método de Probabilidad Maximun permitimos que la volatilidad condicional también incluya los procesos inesperados de la información (el modelo GARCH ) y también que la volatilidad sea la función del nivel de la tasa de intereses (modelo TVP-NIVELE) como en Brenner, Harjes y la Crona (1996). Para esto usamos producciones de mercado de bonos de reconocimiento, en cambio las producciones mensuales medias de subasta PDBC, y la ampliación del tamaño y la frecuencia de la muestra a 4 producciones semanales con términos(condiciones) diferentes a la madurez: 1 año, 5 años, 10 años y 15 años. Los resultados principales del estudio pueden ser resumidos en esto: la volatilidad de los cambios inesperados de las tarifas depende positivamente del nivel de las tarifas, sobre todo en el modelo de TVP-NIVEL. Obtenemos pruebas de reversión tacañas, tal que los incrementos en las tasas de intereses no eran independientes, contrariamente a lo obtenido por Brenner. en EE. UU. Los modelos de NIVELES no son capaces de ajustar apropiadamente la volatilidad en comparación con un modelo GARCH (1,1), y finalmente, el modelo de TVP-NIVEL no vence los resultados del modelo GARCH (1,1)

Network-based scoring system for genome-scale metabolic reconstructions

Background: Network reconstructions at the cell level are a major development in Systems Biology. However, we are far from fully exploiting its potentialities. Often, the incremental complexity of the pursued systems overrides experimental capabilities, or increasingly sophisticated protocols are underutilized to merely refine confidence levels of already established interactions. For metabolic networks, the currently employed confidence scoring system rates reactions discretely according to nested categories of experimental evidence or model-based likelihood. Results: Here, we propose a complementary network-based scoring system that exploits the statistical regularities of a metabolic network as a bipartite graph. As an illustration, we apply it to the metabolism of Escherichia coli. The model is adjusted to the observations to derive connection probabilities between individual metabolite-reaction pairs and, after validation, to assess the reliability of each reaction in probabilistic terms. This network-based scoring system uncovers very specific reactions that could be functionally or evolutionary important, identifies prominent experimental targets, and enables further confirmation of modeling results. Conclusions: We foresee a wide range of potential applications at different sub-cellular or supra-cellular levels of biological interactions given the natural bipartivity of many biological networks.

Graduate labor mismatch in Central and Eastern Europe

[cat] Utilitzant l’enquesta REFLEX/HEGESCO, aquest article explora la probabilitat de desajustament entre educació i treball a l’Europa de l’Est i Central. Classifiquem els països en dos grups segons la transparència dels títols educatius al mercat de treball. Polònia, la República Txeca i Eslovènia formen el grup amb més transparència, i Hongria, Lituània i Estònia formen el grup amb més opacitat. Analitzem tres tipus de desajustaments: el vertical (infra‐, sobre‐educació), l’horitzontal (desajustament del camp d’estudi) i el desajust en habilitats. Focalitzem l’anàlisi en l’efecte dels camps d’estudi i les competències dels individus en el desajustament del mercat laboral en aquests països. Els resultats mostren importants diferències entre els dos grups de països estudiats.

Man-bites-dog business cycles

The newsworthiness of an event is partly determined by how unusual it isand this paper investigates the business cycle implications of this fact. In particular, weanalyze the consequences of information structures in which some types of signals are morelikely to be observed after unusual events. Such signals may increase both uncertainty anddisagreement among agents and when embedded in a simple business cycle model, can helpus understand why we observe (i) occasional large changes in macro economic aggregatevariables without a correspondingly large change in underlying fundamentals (ii) persistentperiods of high macroeconomic volatility and (iii) a positive correlation between absolutechanges in macro variables and the cross-sectional dispersion of expectations as measuredby survey data. These results are consequences of optimal updating by agents when theavailability of some signals is positively correlated with tail-events. The model is estimatedby likelihood based methods using individual survey responses and a quarterly time seriesof total factor productivity along with standard aggregate time series. The estimated modelsuggests that there have been episodes in recent US history when the impact on outputof innovations to productivity of a given magnitude was more than eight times as largecompared to other times.

On the tractability of the piecewise-linear approximation for general discrete-choice network revenue management

The choice network revenue management (RM) model incorporates customer purchase behavioras customers purchasing products with certain probabilities that are a function of the offeredassortment of products, and is the appropriate model for airline and hotel network revenuemanagement, dynamic sales of bundles, and dynamic assortment optimization. The underlyingstochastic dynamic program is intractable and even its certainty-equivalence approximation, inthe form of a linear program called Choice Deterministic Linear Program (CDLP) is difficultto solve in most cases. The separation problem for CDLP is NP-complete for MNL with justtwo segments when their consideration sets overlap; the affine approximation of the dynamicprogram is NP-complete for even a single-segment MNL. This is in contrast to the independentclass(perfect-segmentation) case where even the piecewise-linear approximation has been shownto be tractable. In this paper we investigate the piecewise-linear approximation for network RMunder a general discrete-choice model of demand. We show that the gap between the CDLP andthe piecewise-linear bounds is within a factor of at most 2. We then show that the piecewiselinearapproximation is polynomially-time solvable for a fixed consideration set size, bringing itinto the realm of tractability for small consideration sets; small consideration sets are a reasonablemodeling tradeoff in many practical applications. Our solution relies on showing that forany discrete-choice model the separation problem for the linear program of the piecewise-linearapproximation can be solved exactly by a Lagrangian relaxation. We give modeling extensionsand show by numerical experiments the improvements from using piecewise-linear approximationfunctions.

Barnbyn Skå (Skå, la vila dels infants) 1947-1972: L’experiència terapèutica de Gustav Jonsson amb infants «irrecuperables»

The article presents the trajectory of the Swedish psychiatrist Gustav Jonsson (1907-1994) who, in the 1940s, revolutionised the therapeutic and educational treatment of children and young people, considered irreclaimable from the social point of view, who were committed to educational institutions. It analyses the social development of the Welfare State in Sweden, the legal framework of child protection, as well as the context of Swedish residential care centres for children and young people in the first half of the 20th century in order to go further into the psychological and educational work conducted with the Barnbyn Skå group. Jonsson redirected the analysis of violent behaviours that were manifest in these children and young people which made them intractable from the educational point of view and established elements of psychoanalytical understanding, based on a systemic approach in which the family context became essential in order to understand the children’s difficulties. Barnbyn Skå was the centre which, under the guidance of Jonsson, developed this new therapeutic and pedagogic approach. The educational work carried out there exceeded the traditional model in terms of control and surveillance. The methods were considered radical from within pedagogy and caused great controversy which led the centre to continuous investigations on behalf of the Social Services of Stockholm between 1960 and 1970. For several decades Barnbyn Skå has been considered a pioneering experience in the field of Scandinavian child psychiatry.

Confirmatory factor analysis of an integrated model of psycopathology assessed with MMPI-2-RF and the MCMI-III

We presented an integrated hierarchical model of psychopathology that more accurately captures empirical patterns of comorbidity between clinical syndromes and personality disorders.In order to verify the structural validity of the model proposed, this study aimed to analyze the convergence between the Restructured Clinical (RC) scales and Personality scales (PSY-5) of the MMPI-2-RF and the Clinical Syndrome and Personality Disorder scales of the MCMI-III.The MMPI-2-RF and MCMI-III were administered to a clinical sample of 377 outpatients (167 men and 210 women).The structural hypothesiswas assessed by using a Confirmatory Factor Analytic design with four common superordinate factors. An independent-cluster-basis solution was proposed based on maximum likelihood estimation and the application of several fit indices.The fit of the proposed model can be considered as good and more so if we take into account its complexity.

Bayes linear spaces

Linear spaces consisting of σ-finite probability measures and infinite measures (improper priors and likelihood functions) are defined. The commutative group operation, called perturbation, is the updating given by Bayes theorem; the inverse operation is the Radon-Nikodym derivative. Bayes spaces of measures are sets of classes of proportional measures. In this framework, basic notions of mathematical statistics get a simple algebraic interpretation. For example, exponential families appear as affine subspaces with their sufficient statistics as a basis. Bayesian statistics, in particular some well-known properties of conjugated priors and likelihood functions, are revisited and slightly extended

Interrogating eleven fast-evolving genes for signatures of recent positive selection in worldwide human populations

Different signatures of natural selection persist over varying time scales in our genome, revealing possible episodes of adaptative evolution during human history. Here, we identify genes showing signatures of ancestral positive selection in the human lineage and investigate whether some of those genes have been evolving adaptatively in extant human populations. Specifically, we compared more than 11,000 human genes with their orthologs inchimpanzee, mouse, rat and dog and applied a branch-site likelihood method to test for positive selection on the human lineage. Among the significant cases, a robust set of 11 genes were then further explored for signatures of recent positive selection using SNP data. We genotyped 223 SNPs in 39 worldwide populations from the HGDP Diversity panel and supplemented this information with available genotypes for up to 4,814 SNPs distributed along 2 Mb centered on each gene. After exploring the allele frequency spectrum, population differentiation and the maintainance of long unbroken haplotypes, we found signals of recent adaptative phenomena in only one of the 11 candidate gene regions. However, the signal ofrecent selection in this region may come from a different, neighbouring gene (CD5) ratherthan from the candidate gene itself (VPS37C). For this set of positively-selected genes in thehuman lineage, we find no indication that these genes maintained their rapid evolutionarypace among human populations. Based on these data, it therefore appears that adaptation forhuman-specific and for population-specific traits may have involved different genes.

Block structured dynamics and neuronal coding

When certain control parameters of nervous cell models are varied, complex bifurcation structures develop in which the dynamical behaviors available appear classified in blocks, according to criteria of dynamical likelihood. This block structured dynamics may be a clue to understand how activated neurons encode information by firing spike trains of their action potentials.

The Gaussian assumption in second-order estimation problems in digital communications

This paper deals with the goodness of the Gaussian assumption when designing second-order blind estimationmethods in the context of digital communications. The low- andhigh-signal-to-noise ratio (SNR) asymptotic performance of the maximum likelihood estimator—derived assuming Gaussiantransmitted symbols—is compared with the performance of the optimal second-order estimator, which exploits the actualdistribution of the discrete constellation. The asymptotic study concludes that the Gaussian assumption leads to the optimalsecond-order solution if the SNR is very low or if the symbols belong to a multilevel constellation such as quadrature-amplitudemodulation (QAM) or amplitude-phase-shift keying (APSK). On the other hand, the Gaussian assumption can yield importantlosses at high SNR if the transmitted symbols are drawn from a constant modulus constellation such as phase-shift keying (PSK)or continuous-phase modulations (CPM). These conclusions are illustrated for the problem of direction-of-arrival (DOA) estimation of multiple digitally-modulated signals.

A performance lower bound for quadratic timing recovery accounting for the symbol transition density

The symbol transition density in a digitally modulated signal affects the performance of practical synchronization schemes designed for timing recovery. This paper focuses on the derivation of simple performance limits for the estimation of the time delay of a noisy linearly modulated signal in the presence of various degrees of symbol correlation produced by the varioustransition densities in the symbol streams. The paper develops high- and low-signal-to-noise ratio (SNR) approximations of the so-called (Gaussian) unconditional Cramér–Rao bound (UCRB),as well as general expressions that are applicable in all ranges of SNR. The derived bounds are valid only for the class of quadratic, non-data-aided (NDA) timing recovery schemes. To illustrate the validity of the derived bounds, they are compared with the actual performance achieved by some well-known quadratic NDA timing recovery schemes. The impact of the symbol transitiondensity on the classical threshold effect present in NDA timing recovery schemes is also analyzed. Previous work on performancebounds for timing recovery from various authors is generalized and unified in this contribution.

ML approaches to channel estimation for pilot-aided multi-rate DS/CDMA systems

This paper analyzes the asymptotic performance of maximum likelihood (ML) channel estimation algorithms in wideband code division multiple access (WCDMA) scenarios. We concentrate on systems with periodic spreading sequences (period larger than or equal to the symbol span) where the transmitted signal contains a code division multiplexed pilot for channel estimation purposes. First, the asymptotic covariances of the training-only, semi-blind conditional maximum likelihood (CML) and semi-blind Gaussian maximum likelihood (GML) channelestimators are derived. Then, these formulas are further simplified assuming randomized spreading and training sequences under the approximation of high spreading factors and high number of codes. The results provide a useful tool to describe the performance of the channel estimators as a function of basicsystem parameters such as number of codes, spreading factors, or traffic to training power ratio.

On the inclusion of channel's time dependence in a hidden Markov model for blind channel estimation

In this paper, the theory of hidden Markov models (HMM) isapplied to the problem of blind (without training sequences) channel estimationand data detection. Within a HMM framework, the Baum–Welch(BW) identification algorithm is frequently used to find out maximum-likelihood (ML) estimates of the corresponding model. However, such a procedureassumes the model (i.e., the channel response) to be static throughoutthe observation sequence. By means of introducing a parametric model fortime-varying channel responses, a version of the algorithm, which is moreappropriate for mobile channels [time-dependent Baum-Welch (TDBW)] isderived. Aiming to compare algorithm behavior, a set of computer simulationsfor a GSM scenario is provided. Results indicate that, in comparisonto other Baum–Welch (BW) versions of the algorithm, the TDBW approachattains a remarkable enhancement in performance. For that purpose, onlya moderate increase in computational complexity is needed.