Concept

Sheaf of modules

Related publications (71)

Graph Chatbot

Chat with Graph Search

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.

Some remarks on orbit sets of unimodular rows

Jean Fasel

Let A be a d-dimensional smooth algebra over a perfect field of characteristic not 2. Let Um(n+1)(A)/En+1 (A) be the set of unimodular rows of length n + 1 up to elementary transformations. If n >= (d + 2)/2, it carries a natural structure of group as disc ...

2011

Homotopic Descent over Monoidal Model Categories

The starting point for this project is the article of Kathryn Hess [11]. In this article, a homotopic version of monadic descent is developed. In the classical setting, one constructs a category D(𝕋) of coalgebras in the Eilenberg-Moore category of ...

EPFL2011

Categorical Foundations for K-theory

Nicolas Mathieu Michel

K-Theory was originally defined by Grothendieck as a contravariant functor from a subcategory of schemes to abelian groups, known today as K0. The same kind of construction was then applied to other fields of mathematics, like spaces and (not necessarily c ...

EPFL2010

ExpressionView-an interactive viewer for modules identified in gene expression data

Bastian Peter

Summary: ExpressionView is an R package that provides an interactive graphical environment to explore transcription modules identified in gene expression data. A sophisticated ordering algorithm is used to present the modules with the expression in a visua ...

2010

Projective modules over the real algebraic sphere of dimension 3

Jean Fasel

Let A be a commutative noetherian ring of Krull dimension 3. We give a necessary and sufficient condition for A-projective modules of rank 2 to be free. Using this, we show that all the finitely generated projective modules over the algebraic real 3-sphere ...

2010

Why H Z-algebra Spectra are Differential Graded Algebras?

Varvara Karpova

In homological algebra, to understand commutative rings R, one studies R-modules, chain complexes of R-modules and their monoids, the differential graded R-algebras. The category of R-modules has a rich structure, but too rigid to efficiently work with hom ...

2010

Proposition of a Modular I2C-Based Wearable Architecture

Daniel Thalmann, Xavier Righetti

In this paper we propose a novel wearable architecture based on the popular and proven I2C protocol. Our goal is to develop a modular approach towards wearable computing in a sense that users simply attach specific modules to their garments depending on th ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Roombots: Reconfigurable Robots for Adaptive Furniture

Auke Ijspeert, Pierre Dillenbourg, Aude Billard, Alexander Spröwitz, Soha Pouya, Jesse van den Kieboom, Rico Möckel, Stéphane Bonardi

Imagine a world in which our furniture moves around like legged robots, interacts with us, and changes shape and function during the day according to our needs. This is the long term vision we have in the Roombots project. To work towards this dream, we ar ...

2010

A Modular Approach towards Wearable Computing

Xavier Righetti

Thanks to recent improvements in electronics, conductive materials and energy storage capabilities, we are now able to embed small circuits but also ultra-mobile PCs (UMPC) into clothes. These devices are able to sense, process and communicate information ...

EPFL2010

Graph signature for self-reconfiguration planning of modules with symmetry

Auke Ijspeert, Milad Shafiee Ashtiani, Masoud Asadpour

In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism test between different configurations and the graph edit-distance is a similari ...

2009