HAL: Hyper Article en Ligne
Not a member yet
3159010 research outputs found
Sort by
‘That’s Jazz Made in Germany’ : Émancipation ou contrôle ? Deux scènes berlinoises face à la Guerre froide
No full textInternational audienc
Probing drug pharmacokinetics using neutron scattering techniques
No full textInternational audienceQENS revealed a different impact of the drugs Pd 2 Spm and cisplatin on the global and local dynamics of HSA (at pico/nanosecond time scales). These effects, impacted by the protein's hydration layer, are a determinant of therapeutic activity
Why should I comply with taxes if others don’t?: Social information and behavioral convergence: An experimental study
No full textInternational audienceThis experimental study investigates the impact of social information about others’ tax behavior on individuals’ subsequent tax decisions. Two types of social information are introduced: (i) the average income reported within the subject’s entire group, and (ii) the average income reported within a reference subgroup made of either peers or non-peers and chosen by the subject. Our results show that social information significantly affects subsequent tax decisions, with a change in reported income ranging from 15% to 30% of total income on average. Moreover, the influence of whole-group information on tax behavior appears to be stronger than that of chosen-group information. Quite strikingly, a majority of subjects show more interest in the tax behavior of non-peers than in that of peers. Finally, our data provide strong evidence of behavioral convergence towards the average tax behavior of others
Sparsity and L1-optimal control for linear control systems
No full textInternational audienceFor linear time-invariant systems, we take an interest in sparse controls, i.e., those whose support (or L⁰-norm) is of minimal Lebesgue measure. We propose to extend this research to Radon measures and, in particular, to controls presenting Dirac impulses. Then, we can find a minimizer which is impulsive (and so with a null support) and prove that there is no gap when we extend the problem from L¹-controls to Radon measures. To refine our research, this reasoning leads us to study the minimization problems for L¹ and measure norms. We prove that impulsive controls are still pertinent for these problems: once again, we can find a minimizer and prove that there is no gap. In addition to the existence of a solution, we show that, by extending the research to Radon measures, we can find a solution of L⁰ and L¹-minimization problems in the form of a finite linear combination of Dirac impulses, and we give an expression of the maximal number of these impulses. We also propose an algorithm in order to compute an impulsive solution of the measure norm minimization problem
The Sciences of the Senses in Romantic Literature: Sight, Touch, and Vision
No full textInternational audienceThe Sciences of the Senses in Romantic Literature explores the ways in which eighteenth- and early nineteenth-century research into the physiology of the senses helped Romantic writers imagine new modalities of sensation, in an attempt at turning touch into a visionary sense
Open Government, French Parliamentary Allowances and the ‘Réserve Parmentaire’ in a ‘Sousveillance Society’
No full textInternational audienc
On the magnetic Dirichlet to Neumann operator on the exterior of the disk -diamagnetism, weak-magnetic field limit and flux effects
No full text28 pagesInternational audienceIn this paper, we analyze the magnetic Dirichlet-to-Neumann operator (D-to-N map) Λ(b, ν) on the exterior of the disk with respect to a magnetic potential A b,ν = A b + Aν where, for b ∈ R and ν ∈ R, A b (x, y) = b (-y, x) and Aν (x, y) is the Aharonov-Bohm potential centered at the origin of ux 2πν. First, we show that the limit of Λ(b, ν) as b → 0 is equal to the D-to-N map Λ(ν) on the interior of the disk associated with the potential Aν (x, y). Secondly, we study the ground state energy of the D-to-N map Λ(b, ν) and show that the strong diamagnetism property holds. Finally we slightly extend to the exterior case the asymptotic results obtained in the interior case for general domains.</div
Search for Magnetic Monopoles with the Complete ANTARES Dataset
No full textInternational audienceThis study presents a novel search for magnetic monopoles using data collected over a 14 year period (2008-2022) by the ANTARES neutrino telescope. The interaction of magnetic monopoles with matter was modeled according to Kazama, Yang, and Goldhaber cross-section. Upper limits on the flux of magnetic monopoles are obtained for velocities both above and below the Cherenkov threshold. No events consistent with the passage of magnetic monopoles were detected, enabling the setting of an upper flux limit for relativistic magnetic monopoles of the order of
Isometric path complexity of graphs
No full textInternational audienceA set of isometric paths of a graph is "-rooted", where is a vertex of , if is one of the end-vertices of all the isometric paths in . The isometric path complexity of a graph , denoted by , is the minimum integer such that there exists a vertex satisfying the following property: the vertices of any isometric path of can be covered by many -rooted isometric paths. First, we provide an -time algorithm to compute the isometric path complexity of a graph with vertices and edges. Then we show that the isometric path complexity remains bounded for graphs in three seemingly unrelated graph classes, namely, hyperbolic graphs, (theta, prism, pyramid)-free graphs, and outerstring graphs. Hyperbolic graphs are extensively studied in Metric Graph Theory. The class of (theta, prism, pyramid)-free graphs are extensively studied in Structural Graph Theory, e.g. in the context of the Strong Perfect Graph Theorem. The class of outerstring graphs is studied in Geometric Graph Theory and Computational Geometry. Our results also show that the distance functions of these (structurally) different graph classes are more similar than previously thought. There is a direct algorithmic consequence of having small isometric path complexity. Specifically, we show that if the isometric path complexity of a graph is bounded by a constant, then there exists a polynomial-time constant-factor approximation algorithm for ISOMETRIC PATH COVER, whose objective is to cover all vertices of a graph with a minimum number of isometric paths. This applies to all the above graph classes