Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In homological algebra and algebraic topology, a spectral sequence is a means of computing homology groups by taking successive approximations. Spectral sequences are a generalization of exact sequences, and since their introduction by , they have become important computational tools, particularly in algebraic topology, algebraic geometry and homological algebra. Motivated by problems in algebraic topology, Jean Leray introduced the notion of a sheaf and found himself faced with the problem of computing sheaf cohomology. To compute sheaf cohomology, Leray introduced a computational technique now known as the Leray spectral sequence. This gave a relation between cohomology groups of a sheaf and cohomology groups of the . The relation involved an infinite process. Leray found that the cohomology groups of the pushforward formed a natural chain complex, so that he could take the cohomology of the cohomology. This was still not the cohomology of the original sheaf, but it was one step closer in a sense. The cohomology of the cohomology again formed a chain complex, and its cohomology formed a chain complex, and so on. The limit of this infinite process was essentially the same as the cohomology groups of the original sheaf. It was soon realized that Leray's computational technique was an example of a more general phenomenon. Spectral sequences were found in diverse situations, and they gave intricate relationships among homology and cohomology groups coming from geometric situations such as fibrations and from algebraic situations involving derived functors. While their theoretical importance has decreased since the introduction of , they are still the most effective computational tool available. This is true even when many of the terms of the spectral sequence are incalculable. Unfortunately, because of the large amount of information carried in spectral sequences, they are difficult to grasp. This information is usually contained in a rank three lattice of abelian groups or modules.
[2]Paolo Prandoni, [3]LCAV, EPFL
In this notebook we will explore various ways to implement a system
that changes the voice of a speaker. Typical applications for these
techniques, strictly sorted by plausibility, include international spy
missions and prank telephone calls, and devices such as the one
displayed here can be easily bought on the web... or in a novelty shop.
No description has been provided for t "I defy anybody to find a record... unless it is some old blues
record from 1922... that uses feedback that way. So I claim it for
the Beatles. Before H
[2]Paolo Prandoni, [3]LCAV, EPFL
The Karplus-Strong algorithm is a simple method to generate synthetic
sounds with arbitrary pitch. In this notebook we will explore a few
variations of the method to illustrate some basic notions of
discrete-time signal processing.
In [1]:
%matplotlib inline
import matplotlib
import matplotlib.pyplot as plt
import numpy as np
import IPython
In [2]:
plt.rcParams["figure.figsize"]