Hubbard chain with a Kondo impurity

A Bethe Ansatz solution of a (modified) Hubbard chain with a Kondo impurity of arbitrary spin S at a highly symmetric line of parameter space is proposed and explored. Our results confirm the existence of a strong-coupling (line of) fixed-point(s) with ferromagnetic Kondo coupling as first hypothetized by Furusaki and Nagaosa on the basis of perturbative renormalization group calculations. For on-site Hubbard repulsion and ferromagnetic Kondo exchange, the ground state has spin S-1/2, i.e., is a singlet when S=1/2. The contributions of the impurity to the magnetic susceptibility and low-temperature specific heat are discussed. While the Wilson ratio is unity in the half-filled band, it is found to be a function of density and interaction away from half-filling.Comment: 5 pages, Revte

Avoiding spurious feedback loops in the reconstruction of gene regulatory networks with dynamic bayesian networks

Feedback loops and recurrent structures are essential to the regulation and stable control of complex biological systems. The application of dynamic as opposed to static Bayesian networks is promising in that, in principle, these feedback loops can be learned. However, we show that the widely applied BGe score is susceptible to learning spurious feedback loops, which are a consequence of non-linear regulation and autocorrelation in the data. We propose a non-linear generalisation of the BGe model, based on a mixture model, and demonstrate that this approach successfully represses spurious feedback loops

Mahalanobis distance, a novel statistical proxy of homeostasis loss is longitudinally associated with risk of type 2 diabetes

Background: The potential role of individual plasma biomarkers in the pathogenesis of type 2 diabetes (T2D) has been broadly studied, but the impact of biomarkers interaction remains underexplored. Recently, the Mahalanobis distance (MD) of plasma biomarkers has been proposed as a proxy of physiological dysregulation. Here we aimed to investigate whether the MD calculated from circulating biomarkers is prospectively associated with development of T2D. Methods: We calculated the MD of the Principal Components (PCs) integrating the information of 32 circulating biomarkers (comprising inflammation, glycemic, lipid, microbiome and one-carbon metabolism) measured in 6247 participants of the PREVEND study without T2D at baseline. Cox proportional-hazards regression analyses were performed to study the association of MD with T2D development. Findings: After a median follow-up of 7·3 years, 312 subjects developed T2D. The overall MD (mean (SD)) was higher in subjects who developed T2D compared to those who did not: 35·65 (26·67) and 30.75 (27·57), respectively (P = 0·002). The highest hazard ratio (HR) was obtained using the MD calculated from the first 31 PCs (per 1 log-unit increment) (1·72 (95% CI 1·42,2·07), P < 0·001). Such associations remained after the adjustment for age, sex, plasma glucose, parental history of T2D, lipids, blood pressure medication, and BMI (HRadj 1·37 (95% CI 1·11,1·70), P = 0·004). Interpretation: Our results are in line with the premise that MD represents an estimate of homeostasis loss. This study suggests that MD is able to provide information about physiological dysregulation also in the pathogenesis of T2D. Funding: The Dutch Kidney Foundation (Grant E.033)

Robust computations with dynamical systems

In this paper we discuss the computational power of Lipschitz dynamical systems which are robust to in nitesimal perturbations. Whereas the study in [1] was done only for not-so-natural systems from a classical mathematical point of view (discontinuous di erential equation systems, discontinuous piecewise a ne maps, or perturbed Turing machines), we prove that the results presented there can be generalized to Lipschitz and computable dynamical systems. In other words, we prove that the perturbed reachability problem (i.e. the reachability problem for systems which are subjected to in nitesimal perturbations) is co-recursively enumerable for this kind of systems. Using this result we show that if robustness to in nitesimal perturbations is also required, the reachability problem becomes decidable. This result can be interpreted in the following manner: undecidability of veri cation doesn't hold for Lipschitz, computable and robust systems. We also show that the perturbed reachability problem is co-r.e. complete even for C1-systems

Interparticle interactions:Energy potentials, energy transfer, and nanoscale mechanical motion in response to optical radiation

In the interactions between particles of material with slightly different electronic levels, unusually large shifts in the pair potential can result from photoexcitation, and on subsequent electronic excitation transfer. To elicit these phenomena, it is necessary to understand the fundamental differences between a variety of optical properties deriving from dispersion interactions, and processes such as resonance energy transfer that occur under laser irradiance. This helps dispel some confusion in the recent literature. By developing and interpreting the theory at a deeper level, one can anticipate that in suitable systems, light absorption and energy transfer will be accompanied by significant displacements in interparticle separation, leading to nanoscale mechanical motion

Solving analytic differential equations in polynomial time over unbounded domains

In this paper we consider the computational complexity of solving initial-value problems de ned with analytic ordinary diferential equations (ODEs) over unbounded domains of Rn and Cn, under the Computable Analysis setting. We show that the solution can be computed in polynomial time over its maximal interval of de nition, provided it satis es a very generous bound on its growth, and that the function admits an analytic extension to the complex plane

The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation

In this paper we revisit one of the rst models of analog computation, Shannon's General Purpose Analog Computer (GPAC). The GPAC has often been argued to be weaker than computable analysis. As main contribution, we show that if we change the notion of GPACcomputability in a natural way, we compute exactly all real computable functions (in the sense of computable analysis). Moreover, since GPACs are equivalent to systems of polynomial di erential equations then we show that all real computable functions can be de ned by such models

Mereotopological Connection

The paper outlines a model-theoretic framework for investigating and comparing a variety of mereotopological theories. In the first part we consider different ways of characterizing a mereotopology with respect to (i) the intended interpretation of the connection primitive, and (ii) the composition of the admissible domains of quantification (e.g., whether or not they include boundary elements). The second part extends this study by considering two further dimensions along which different patterns of topological connection can be classified—the strength of the connection and its multiplicity