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.
Steinhaus graphs on n vertices are certain simple graphs in bijective correspondence with binary {0,1}-sequences of length n-1. A conjecture of Dymacek in 1979 states that the only nontrivial regular Steinhaus graphs are those corresponding to the periodic ...
Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees are required. For networks of FIFO aggregate schedulers, the main existing suffic ...
Correct prediction of analyte concentrations from a new spectrum without drift is possible provided the spectrum lies in the row space spanned by the calibration spectra (space-inclusion condition). However, this condition may be violated as on-line spectr ...
Let P and Q be finite sets of points in the plane. In this note we consider the largest cardinality of a subset of the Minkowski sum S ⊆ P⊕Q which consist of convex independent points. We show that, if P and Q contain at most n points, then |S| = O(n^(4/3) ...
When a mixed self-assembled monolayer forms on the curved surface of a gold nanoparticle two opposed point defects must form for topological reasons. Here we present a thermodynamic study proving that these defects are more reactive than other sites on the ...
φ For all finite n ∈ N, there is a well-known isomorphism between the standard braid group Bn and the mapping class group π0Hn. This isomorphism has been exhaustively studied in literature, and generalized in many ways. For some basic topological reason, t ...
Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees are required. For networks of FIFO aggregate schedulers, the main existing suffic ...
This paper provides some useful results for convex risk measures. In fact, we consider convex functions on a locally convex vector space E which are monotone with respect to the preference relation implied by some convex cone and invariant with respect to ...
Systems and synthetic biology are two emerging disciplines that hold promise to revolutionize our understanding of biological systems and to herald a new era of programmable hardware, respectively. Mathematical abstraction and today's abundance of quantita ...
The vector analysis of stimulated Brillouin scattering amplification in birefringent fibers is extended to include signal pulses. The analysis finds that the different slow-light delays experienced by the states of polarization corresponding to maximum and ...