PReS-FINAL-2161: Safety and effectiveness of adalimumab in children with polyarticular juvenile idiopathic arthritis aged 2 to <4 years or >=4 years weighing <15 kg

International audienceEn faisant le tour du monde (Mauritanie, Madagascar, Éthiopie, Burkina Faso, Cameroun, New-York, Nouvelle-Zélande, France... ) en passant par l’Internet, cet ouvrage fait le point sur les dernières innovations en matière de gestion des déchets. Considéré comme une ressource, le déchet révèle enfin sa valeur : il est créateur de revenus, de liens sociaux et de nouvelles technologies. C’est pourquoi il devient urgent de structurer son économie

Dynamic changes in biochemical markers of renal function with thyroid status- A study in Indian population

Thyroid dysfunction is known to cause significant changes in glomerular filtration rate. The present cross-sectional study was performed to evaluate the changes in biochemical markers of renal function in hypothyroid subjects before and after treatment. Thyroid function tests (T3, T4 and TSH levels) were assayed in 385 subjects. Based on TSH levels, subjects were classified as euthyroid (n=198), sub-clinical hypothyroid (n=98; TSH 6.1 to 19.9 &mu;IU/ml) and overt hypothyroid (n=89; TSH &ge; 20 &mu;IU/ml, abnormally low T4 levels). Forty-eight hypothyroid patients were re-evaluated after 3 months of thyroxine replacement therapy. Renal function tests were carried out in all subjects and statistically analyzed. Serum creatinine was significantly increased in subclinical and overt hypothyroid groups as compared to euthyroid subjects. Serum creatinine showed a significant negative correlation with T3 &T4 levels in overt group(r = -0.372 and r = - 0.371), whereas a positive correlation was observed with TSH (r=0.283). Uric acid levels were significantly increased in the overt group as compared to euthyroid subjects. Uric acid levels showed a significant negative correlation with T3 levels in the overt group (r= -0.298). After 3 months of thyroxine replacement therapy, creatinine and uric acids levels decreased significantly and were comparable to euthyroid levels. Hypothyroidism leads to reversible changes in renal function

On Coloring Resilient Graphs

We introduce a new notion of resilience for constraint satisfaction problems, with the goal of more precisely determining the boundary between NP-hardness and the existence of efficient algorithms for resilient instances. In particular, we study $r$-resiliently $k$-colorable graphs, which are those $k$-colorable graphs that remain $k$-colorable even after the addition of any $r$ new edges. We prove lower bounds on the NP-hardness of coloring resiliently colorable graphs, and provide an algorithm that colors sufficiently resilient graphs. We also analyze the corresponding notion of resilience for $k$-SAT. This notion of resilience suggests an array of open questions for graph coloring and other combinatorial problems.Comment: Appearing in MFCS 201

Fast by Nature - How Stress Patterns Define Human Experience and Performance in Dexterous Tasks

In the present study we quantify stress by measuring transient perspiratory responses on the perinasal area through thermal imaging. These responses prove to be sympathetically driven and hence, a likely indicator of stress processes in the brain. Armed with the unobtrusive measurement methodology we developed, we were able to monitor stress responses in the context of surgical training, the quintessence of human dexterity. We show that in dexterous tasking under critical conditions, novices attempt to perform a task's step equally fast with experienced individuals. We further show that while fast behavior in experienced individuals is afforded by skill, fast behavior in novices is likely instigated by high stress levels, at the expense of accuracy. Humans avoid adjusting speed to skill and rather grow their skill to a predetermined speed level, likely defined by neurophysiological latency

SBMDb: First whole genome putative microsatellite DNA marker database of sugarbeet for bioenergy and industrial applications

© 2015 The Author(s) 2015. DNA marker plays important role as valuable tools to increase crop productivity by finding plausible answers to genetic variations and linking the Quantitative Trait Loci (QTL) of beneficial trait. Prior approaches in development of Short Tandem Repeats (STR) markers were time consuming and inefficient. Recent methods invoking the development of STR markers using whole genomic or transcriptomics data has gained wide importance with immense potential in developing breeding and cultivator improvement approaches. Availability of whole genome sequences and in silico approaches has revolutionized bulk marker discovery. We report world's first sugarbeet whole genome marker discovery having 145 K markers along with 5 K functional domain markers unified in common platform using MySQL, Apache and PHP in SBMDb. Embedded markers and corresponding location information can be selected for desired chromosome, location/interval and primers can be generated using Primer3 core, integrated at backend. Our analyses revealed abundance of 'mono' repeat (76.82%) over 'di' repeats (13.68%). Highest density (671.05 markers/Mb) was found in chromosome 1 and lowest density (341.27 markers/Mb) in chromosome 6. Current investigation of sugarbeet genome marker density has direct implications in increasing mapping marker density. This will enable present linkage map having marker distance of ∼2 cM, i.e. from 200 to 2.6 Kb, thus facilitating QTL/gene mapping. We also report e-PCR-based detection of 2027 polymorphic markers in panel of five genotypes. These markers can be used for DUS test of variety identification and MAS/GAS in variety improvement program. The present database presents wide source of potential markers for developing and implementing new approaches for molecular breeding required to accelerate industrious use of this crop, especially for sugar, health care products, medicines and color dye. Identified markers will also help in improvement of bioenergy trait of bioethanol and biogas production along with reaping advantage of crop efficiency in terms of low water and carbon footprint especially in era of climate change

An assessment of natural methane fluxes simulated by the CLASS-CTEM model

Natural methane emissions from wetlands and fire, and soil uptake of methane, simulated using the Canadian Land Surface Scheme and Canadian Terrestrial Ecosystem (CLASS-CTEM) modelling framework, over the historical 1850–2008 period, are assessed by using a one-box model of atmospheric methane burden. This one-box model also requires anthropogenic emissions and the methane sink in the atmosphere to simulate the historical evolution of global methane burden. For this purpose, global anthropogenic methane emissions for the period 1850–2008 were reconstructed based on the harmonized representative concentration pathway (RCP) and Emission Database for Global Atmospheric Research (EDGAR) data sets. The methane sink in the atmosphere is represented using bias-corrected methane lifetimes from the Canadian Middle Atmosphere Model (CMAM). The resulting evolution of atmospheric methane concentration over the historical period compares reasonably well with observation-based estimates (correlation&thinsp; = &thinsp;0.99, root mean square error&thinsp; = &thinsp;35&thinsp;ppb). The modelled natural emissions are also assessed using an inverse procedure where the methane lifetimes required to reproduce the observed year-to-year increase in atmospheric methane burden are calculated based upon the specified global anthropogenic and modelled natural emissions that we have used here. These calculated methane lifetimes over the historical period fall within the uncertainty range of observation-based estimates. The present-day (2000–2008) values of modelled methane emissions from wetlands (169&thinsp;Tg&thinsp;CH4&thinsp;yr−1) and fire (27&thinsp;Tg&thinsp;CH4&thinsp;yr−1), methane uptake by soil (29&thinsp;Tg&thinsp;CH4&thinsp;yr−1), and the budget terms associated with overall anthropogenic and natural emissions are consistent with estimates reported in a recent global methane budget that is based on top-down approaches constrained by observed atmospheric methane burden. The modelled wetland emissions increase over the historical period in response to both increases in precipitation and in atmospheric CO2 concentration. This increase in wetland emissions over the historical period yields evolution of the atmospheric methane concentration that compares better with observation-based values than the case when wetland emissions are held constant over the historical period.</p

Generalized Drude model: Unification of ballistic and diffusive electron transport

For electron transport in parallel-plane semiconducting structures, a model is developed that unifies ballistic and diffusive transport and thus generalizes the Drude model. The unified model is valid for arbitrary magnitude of the mean free path and arbitrary shape of the conduction band edge profile. Universal formulas are obtained for the current-voltage characteristic in the nondegenerate case and for the zero-bias conductance in the degenerate case, which describe in a transparent manner the interplay of ballistic and diffusive transport. The semiclassical approach is adopted, but quantum corrections allowing for tunneling are included. Examples are considered, in particular the case of chains of grains in polycrystalline or microcrystalline semiconductors with grain size comparable to, or smaller than, the mean free path. Substantial deviations of the results of the unified model from those of the ballistic thermionic-emission model and of the drift-diffusion model are found. The formulation of the model is one-dimensional, but it is argued that its results should not differ substantially from those of a fully three-dimensional treatment.Comment: 14 pages, 5 figures, REVTEX file, to appear in J. Phys.: Condens. Matte

An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices

In this paper, we study the Learning With Errors problem and its binary variant, where secrets and errors are binary or taken in a small interval. We introduce a new variant of the Blum, Kalai and Wasserman algorithm, relying on a quantization step that generalizes and fine-tunes modulus switching. In general this new technique yields a significant gain in the constant in front of the exponent in the overall complexity. We illustrate this by solving p within half a day a LWE instance with dimension n = 128, modulus $q = n^2$, Gaussian noise $\alpha = 1/(\sqrt{n/\pi} \log^2 n)$ and binary secret, using $2^{28}$ samples, while the previous best result based on BKW claims a time complexity of $2^{74}$ with $2^{60}$ samples for the same parameters. We then introduce variants of BDD, GapSVP and UniqueSVP, where the target point is required to lie in the fundamental parallelepiped, and show how the previous algorithm is able to solve these variants in subexponential time. Moreover, we also show how the previous algorithm can be used to solve the BinaryLWE problem with n samples in subexponential time $2^{(\ln 2/2+o(1))n/\log \log n}$. This analysis does not require any heuristic assumption, contrary to other algebraic approaches; instead, it uses a variant of an idea by Lyubashevsky to generate many samples from a small number of samples. This makes it possible to asymptotically and heuristically break the NTRU cryptosystem in subexponential time (without contradicting its security assumption). We are also able to solve subset sum problems in subexponential time for density $o(1)$, which is of independent interest: for such density, the previous best algorithm requires exponential time. As a direct application, we can solve in subexponential time the parameters of a cryptosystem based on this problem proposed at TCC 2010.Comment: CRYPTO 201

Complexity of Discrete Energy Minimization Problems

Discrete energy minimization is widely-used in computer vision and machine learning for problems such as MAP inference in graphical models. The problem, in general, is notoriously intractable, and finding the global optimal solution is known to be NP-hard. However, is it possible to approximate this problem with a reasonable ratio bound on the solution quality in polynomial time? We show in this paper that the answer is no. Specifically, we show that general energy minimization, even in the 2-label pairwise case, and planar energy minimization with three or more labels are exp-APX-complete. This finding rules out the existence of any approximation algorithm with a sub-exponential approximation ratio in the input size for these two problems, including constant factor approximations. Moreover, we collect and review the computational complexity of several subclass problems and arrange them on a complexity scale consisting of three major complexity classes -- PO, APX, and exp-APX, corresponding to problems that are solvable, approximable, and inapproximable in polynomial time. Problems in the first two complexity classes can serve as alternative tractable formulations to the inapproximable ones. This paper can help vision researchers to select an appropriate model for an application or guide them in designing new algorithms.Comment: ECCV'16 accepte