Reducing the Bias of Causality Measures

Measures of the direction and strength of the interdependence between two time series are evaluated and modified in order to reduce the bias in the estimation of the measures, so that they give zero values when there is no causal effect. For this, point shuffling is employed as used in the frame of surrogate data. This correction is not specific to a particular measure and it is implemented here on measures based on state space reconstruction and information measures. The performance of the causality measures and their modifications is evaluated on simulated uncoupled and coupled dynamical systems and for different settings of embedding dimension, time series length and noise level. The corrected measures, and particularly the suggested corrected transfer entropy, turn out to stabilize at the zero level in the absence of causal effect and detect correctly the direction of information flow when it is present. The measures are also evaluated on electroencephalograms (EEG) for the detection of the information flow in the brain of an epileptic patient. The performance of the measures on EEG is interpreted, in view of the results from the simulation study.Comment: 30 pages, 12 figures, accepted to Physical Review

Quantum interference and phonon-mediated back-action in lateral quantum dot circuits

Spin qubits have been successfully realized in electrostatically defined, lateral few-electron quantum dot circuits. Qubit readout typically involves spin to charge information conversion, followed by a charge measurement made using a nearby biased quantum point contact. It is critical to understand the back-action disturbances resulting from such a measurement approach. Previous studies have indicated that quantum point contact detectors emit phonons which are then absorbed by nearby qubits. We report here the observation of a pronounced back-action effect in multiple dot circuits where the absorption of detector-generated phonons is strongly modified by a quantum interference effect, and show that the phenomenon is well described by a theory incorporating both the quantum point contact and coherent phonon absorption. Our combined experimental and theoretical results suggest strategies to suppress back-action during the qubit readout procedure.Comment: 25 pages, 8 figure

Salivary uric acid across child development and associations with weight, height, and body mass index

IntroductionObesity during childhood is a serious and growing chronic disease with consequences for lifelong health. In an effort to advance research into the preclinical indicators of pediatric obesity, we examined longitudinal assessments of uric acid concentrations in saliva among a cohort of healthy children from age 6-months to 12-years (n's per assessment range from 294 to 727).MethodsUsing data from a subsample of participants from the Family Life Project (an Environmental influences on Child Health Outcomes Program cohort), we: (1) characterized salivary uric acid (sUA) concentrations from infancy to early adolescence by sex and race; (2) assessed changes in sUA levels across development; and (3) evaluated associations between sUA concentrations and measures of child weight, height, and body mass index (BMI). Across four assessments conducted at 6-, 24-, 90-, and 154-months of age, 2,000 saliva samples were assayed for UA from 781 participants (217 participants had sUA data at all assessments).ResultsThere were no significant differences in sUA concentrations by sex at any assessment, and differences in sUA concentrations between White and non-White children varied by age. At the 90- and 154-month assessments, sUA concentrations were positively correlated with measures of child weight, height, and BMI (90-month: weight- ρ(610) = 0.13, p < 0.01; height- ρ(607) = 0.10, p < 0.05; BMI- ρ(604) = 0.13, p < 0.01; 154-month: weight- ρ(723) = 0.18, p < 0.0001; height- ρ(721) = 0.10, p < 0.01; BMI- ρ(721) = 0.17, p < 0.0001). Group based trajectory modeling identified two groups of children in our sample with distinct patterns of sUA developmental change. The majority (72%) of participants showed no significant changes in sUA across time (“Stable” group), while 28% showed increases in sUA across childhood with steep increases from the 90- to 154-month assessments (“Increasing” group). Children in the Increasing group exhibited higher sUA concentrations at all assessments (6-month: t(215) = −5.71, p < 0.001; 24-month: t(215) = −2.89, p < 0.01; 90-month: t(215) = −3.89, p < 0.001; 154-month: t(215) = −19.28, p < 0.001) and higher weight at the 24- and 90-month assessments (24-month: t(214) = −2.37, p < 0.05; 90-month: t(214) = −2.73, p < 0.01).DiscussionOur findings support the potential utility of sUA as a novel, minimally-invasive biomarker that may help advance understanding of the mechanisms underlying obesity as well as further surveillance and monitoring efforts for pediatric obesity on a large-scale

Automatic Abstraction for Congruences

One approach to verifying bit-twiddling algorithms is to derive invariants between the bits that constitute the variables of a program. Such invariants can often be described with systems of congruences where in each equation $\vec{c} \cdot \vec{x} = d \mod m$, (unknown variable m)$is a power of two,$\vec{c}$is a vector of integer coefficients, and$\vec{x}$ is a vector of propositional variables (bits). Because of the low-level nature of these invariants and the large number of bits that are involved, it is important that the transfer functions can be derived automatically. We address this problem, showing how an analysis for bit-level congruence relationships can be decoupled into two parts: (1) a SAT-based abstraction (compilation) step which can be automated, and (2) an interpretation step that requires no SAT-solving. We exploit triangular matrix forms to derive transfer functions efficiently, even in the presence of large numbers of bits. Finally we propose program transformations that improve the analysis results

Interval Slopes as Numerical Abstract Domain for Floating-Point Variables

The design of embedded control systems is mainly done with model-based tools such as Matlab/Simulink. Numerical simulation is the central technique of development and verification of such tools. Floating-point arithmetic, that is well-known to only provide approximated results, is omnipresent in this activity. In order to validate the behaviors of numerical simulations using abstract interpretation-based static analysis, we present, theoretically and with experiments, a new partially relational abstract domain dedicated to floating-point variables. It comes from interval expansion of non-linear functions using slopes and it is able to mimic all the behaviors of the floating-point arithmetic. Hence it is adapted to prove the absence of run-time errors or to analyze the numerical precision of embedded control systems

Singlet-triplet transition in a single-electron transistor at zero magnetic field

We report sharp peaks in the differential conductance of a single-electron transistor (SET) at low temperature, for gate voltages at which charge fluctuations are suppressed. For odd numbers of electrons we observe the expected Kondo peak at zero bias. For even numbers of electrons we generally observe Kondo-like features corresponding to excited states. For the latter, the excitation energy often decreases with gate voltage until a new zero-bias Kondo peak results. We ascribe this behavior to a singlet-triplet transition in zero magnetic field driven by the change of shape of the potential that confines the electrons in the SET.Comment: 4 p., 4 fig., 5 new ref. Rewrote 1st paragr. on p. 4. Revised author list. More detailed fit results on page 3. A plotting error in the horizontal axis of Fig. 1b and 3 was corrected, and so were the numbers in the text read from those fig. Fig. 4 was modified with a better temperature calibration (changes are a few percent). The inset of this fig. was removed as it is unnecessary here. Added remarks in the conclusion. Typos are correcte

Solving discrete logarithms on a 170-bit MNT curve by pairing reduction

Pairing based cryptography is in a dangerous position following the breakthroughs on discrete logarithms computations in finite fields of small characteristic. Remaining instances are built over finite fields of large characteristic and their security relies on the fact that the embedding field of the underlying curve is relatively large. How large is debatable. The aim of our work is to sustain the claim that the combination of degree 3 embedding and too small finite fields obviously does not provide enough security. As a computational example, we solve the DLP on a 170-bit MNT curve, by exploiting the pairing embedding to a 508-bit, degree-3 extension of the base field.Comment: to appear in the Lecture Notes in Computer Science (LNCS