Concept

Computer-assisted proof

Publications associées (44)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Why our best theories of perception lead to Anti-reductionism

Michael Herzog, Adrien Christophe Doerig

Basic percepts and observation sentences, such as "the voltmeter is at 7A", provide the ground truth for realistic theories. Reduction is the second backbone of these theories linking, for example, neuroscience to physics. First, we will show, by mathemati ...

2016

Open channel-based microchip electrophoresis interfaced with mass spectrometry via electrostatic spray ionization

Hubert Girault, Natalia Gasilova, Liang Qiao, Yan Deng

The coupling between open channel-based microchip electrophoresis and mass spectrometry via electrostatic spray ionization is proposed for in situ detection of fractionated analytes. Electrophoretic separation is performed in an open channel fabricated in ...

Elsevier2016

Induced Matchings In Graphs Of Degree At Most 4

Viet Hang Nguyen

For a graph G, let nu(s)(G) be the strong matching number of G. We prove the sharp bound nu(s)(G) >= n(G)/9 for every graph G of maximum degree at most 4 and without isolated vertices that does not contain a certain blown-up 5-cycle as a component. This re ...

Siam Publications2016

Superlensing using complementary media

Hoài-Minh Nguyên

This paper studies magnifying superlens using complementary media. Superlensing using complementary media was suggested by Veselago in [16] and innovated by Nicorovici et al. in [9] and Pendry in [10]. The study of this problem is difficult due to two fact ...

Gauthier-Villars/Editions Elsevier2015

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex

Jan Kyncl

We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer d, there is a constant such that whenever are n-element subsets of , we can find a point and subsets for every , each of size at least , suc ...

Springer2015

New Anomalous Lieb-Robinson Bounds in Quasiperiodic XY Chains

Marius Christopher Lemm

We announce and sketch the rigorous proof of a new kind of anomalous (or sub-ballistic) Lieb-Robinson (LR) bound for an isotropic XY chain in a quasiperiodic transversal magnetic field. Instead of the usual effective light cone |x|≤v|t|, we obtain |x|≤v|t| ...

2014

Automated quality control in MR-based brain morphometry

Jean-Philippe Thiran, Tobias Kober, Tom Hilbert, Bénédicte Marie Maréchal, Delphine Ribes Lemay, Reto Meuli, Alexis Roche

Normal aging and a wide range of neurologic, inflammatory or psychiatric diseases lead to changes in the brain tissue over time. In the interest of diagnosis, prognosis and treatment monitoring, it is highly desirable to have robust tools that reliably mea ...

2012

Lightweight Polymorphic Effects - Proofs

Martin Odersky, Philipp Haller, Lukas Rytz

This technical report presents the full proofs for the type preservation and effect soundness theorems of the type system presented in the article "Lightweight Polymorphic Effects". ...

2012

Bifurcation Analysis at a Singular Soliton State in Fiber Couplers

Boris Buffoni

The system {-u '' + u = u(3) + lambda v, u(x)= u(-x) is an element of R, x is an element of R, -v '' + v = v(3) + lambda u, v(x) = v(-x) is an element of R, x is an element of R, describes pulses in nonlinear fiber couplers. It has the family (U1+lambda, - ...

Advanced Nonlinear Studies, Inc2012

Faster and Smoother - VSH Revisited

Juraj Sarinay

We reconsider the provably collision resistant Very Smooth Hash and propose a small change in the design aiming to improve both performance and security. While the original proofs of security based on hardness of factoring or discrete logarithms are preser ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011