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.
In mathematics, especially in order theory, the greatest element of a subset of a partially ordered set (poset) is an element of that is greater than every other element of . The term least element is defined dually, that is, it is an element of that is smaller than every other element of Let be a preordered set and let An element is said to be if and if it also satisfies: for all By switching the side of the relation that is on in the above definition, the definition of a least element of is obtained. Explicitly, an element is said to be if and if it also satisfies: for all If is also a partially ordered set then can have at most one greatest element and it can have at most one least element. Whenever a greatest element of exists and is unique then this element is called greatest element of . The terminology least element of is defined similarly. If has a greatest element (resp. a least element) then this element is also called (resp. ) of Greatest elements are closely related to upper bounds. Let be a preordered set and let An is an element such that and for all Importantly, an upper bound of in is required to be an element of If then is a greatest element of if and only if is an upper bound of in In particular, any greatest element of is also an upper bound of (in ) but an upper bound of in is a greatest element of if and only if it to In the particular case where the definition of " is an upper bound of " becomes: is an element such that and for all which is to the definition of a greatest element given before. Thus is a greatest element of if and only if is an upper bound of . If is an upper bound of that is not an upper bound of (which can happen if and only if ) then can be a greatest element of (however, it may be possible that some other element a greatest element of ). In particular, it is possible for to simultaneously have a greatest element for there to exist some upper bound of . Even if a set has some upper bounds, it need not have a greatest element, as shown by the example of the negative real numbers.
[2]Paolo Prandoni, [3]LCAV, EPFL
In [1]:
import matplotlib.pyplot as plt
import numpy as np
import scipy.signal as sp
import seaborn as sns
sns.set()
In [2]:
plt.rcParams["figure.figsize"] = (14,4)
The basic reproduction number[4]¶
The propagation mechanism of an epidemic such as the one caused by
SARS-CoV-2 virus can be roughly modeled, at least in its inital phase,
as a process in which each infected individ [2]Paolo Prandoni, [3]LCAV, EPFL
In this notebook we will implement a simple fractional resampler that
uses local Lagrange interpolation. The resampler can be used to perform
any rational sampling rate change (but beware of aliasing when
downsampling!)
In [1]:
import numpy as np
import IPython
from scipy.io import wavfile
Local Lagrange interpolation[4]¶
To perform resampling we will need to compute subsample values and, in [2]Paolo Prandoni, [3]LCAV, EPFL
The concept of "basis" for a vector space is one of the most profound
and fruitful ideas in linear algebra. Basis vectors are the "building
blocks" that all other vectors are built from; by "disassembling" a
vector into a linear combination of basis elements we are able to "look
inside" the vector and highlight many of its relevant features.
A vector space has an infinite number o