Search results for "NIP"

Expression profiling of uniparental mouse embryos is inefficient in identifying novel imprinted genes

2006

AbstractImprinted genes are expressed from only one allele in a parent-of-origin-specific manner. We here describe a systematic approach to identify novel imprinted genes using quantification of allele-specific expression by Pyrosequencing, a highly accurate method to detect allele-specific expression differences. Sixty-eight candidate imprinted transcripts mapping to known imprinted chromosomal regions were selected from a recent expression profiling study of uniparental mouse embryos and analyzed. Three novel imprinted transcripts encoding putative non-protein-coding RNAs were identified on the basis of parent-of-origin-specific monoallelic expression in E11.5 (C57BL/6 × Cast/Ei)F1 and in…

El descrédito de la democracia / 3: La corrupción blanca

2006

José Vidal-Beneyto. Analizar la comunicación desde la coherencia democrática

2003

"Luz y taquígrafos" es una publicación ligada a la Federación de Sindicatos de Periodistas y al Sindicato de Periodistas de Madrid. Esta reseña sobre la figura de Vidal-Beneyto se publica con motivo de su intervención en el "I Congreso del Sindicato de Periodistas de Madrid".

Ética y Medios

1995

Improving operational performance in altered gravity

2022

Human motor adaptation is crucial to remain efficient when exposed to unfamiliar environments. In these contexts, the efficient strategies developed by the brain to optimise movement can prove deficient. Dexterous manual movement execution in space therefore require the learning of new coordinated motor actions. Traditionally, adaptation mechanisms are tested in laboratory using robotic devices that disturb the limb specifically involved in the task while the dynamics of the rest of the body remain unchanged. Although participants build a more accurate representation of the task over repetitions, these approaches are limiting as they do not reflect the ecological adjustment to globally modi…

A generalized integration formula for indefinite integrals of special functions

2020

An integration formula for generating indefinite integrals which was presented in Conway JT [A Lagrangian method for deriving new indefinite integrals of special functions. Integral Transforms Spec...

A decidable word problem without equivalent canonical term rewriting system

1989

We present a weak associative single-axiom system having the following property: the word problem is decidable with an efficient algorithm even though there does not exist any finite equivalent canonical term rewriting system.

Computational Aspects in Spaces of Bivariate Polynomial of w-Degree n

2005

Multivariate ideal interpolation schemes are deeply connected with H-bases. Both the definition of a H-basis and of an ideal interpolation space depend of the notion of degree used in the grading decomposition of the polynomial spaces. We studied, in the case of bivariate polynomials, a generalized degree, introduced by T. Sauer and named w-degree. This article give some theoretical results that allow us to construct algorithms for calculus of the dimension of the homogeneous spaces of bivariate polynomials of w – degree n. We implemented these algorithms in C++ language. The analysis of the results obtained, leads us to another theoretical conjecture which we proved in the end.

Guaranteed error bounds for a class of Picard-Lindelöf iteration methods

2013

We present a new version of the Picard-Lindelof method for ordinary dif- ¨ ferential equations (ODEs) supplied with guaranteed and explicitly computable upper bounds of an approximation error. The upper bounds are based on the Ostrowski estimates and the Banach fixed point theorem for contractive operators. The estimates derived in the paper take into account interpolation and integration errors and, therefore, provide objective information on the accuracy of computed approximations. peerReviewed

Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics

2007

The original publication is available at www.springerlink.com ; ISBN 978-3-540-75519-7 ; ISSN 0302-9743 (Print) 1611-3349 (Online); International audience; We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, \ie surfaces of algebraic degree~2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is {\em complete} in the sense that it can handle all kinds of…