The algebra of connectors - Structuring interaction in BIP
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.
Developing modern software typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that synthesizes ...
The goal of this work is to study Alexander-Whitney coalgebras (first defined in [HPST06]) from a topological point of view. An Alexander-Whitney coalgebra is a coassociative chain coalgebra over Z with an extra algebraic structure : the comultiplication m ...
Accuracy is critical if we are to trust simulation predictions. In settings such as fluid- structure interaction it is all the more important to obtain reliable results to understand, for example, the impact of pathologies on blood flows in the cardiovascula ...
Several Hall sensor configurations have been integrated in CMOS 0.35 mu m technology and analyzed in terms of offset at room temperature and offset drift. We searched for the best geometry that would minimize the offset and its corresponding drift. The tar ...
Let K be a field with char(K) ≠ 2. The Witt-Grothendieck ring (K) and the Witt ring W (K) of K are both quotients of the group ring ℤ[𝓖(K)], where 𝓖(K) := K*/(K*)2 is the square class group of K. Since ℤ[𝓖(K)] is integra ...
Let u be a unipotent element of a simple algebraic group G over a field k of characteristic p. We develop a method for computing the connected component of Z(C-G(u)) in the cases where p is positive and both it and the rank of G are small enough. The metho ...
Ahlswede et al. in the seminal paper [1] have shown that in data transfer over networks, processing the data at the nodes can significantly improve the throughput. As proved by Li et al. in [2], even with a simple type of operation, namely linear operation ...
This article approaches the incremental view maintenance problem from an algebraic perspective. The algebraic structure of a ring of databases is constructed and extended to form a powerful aggregate query calculus. The query calculus inherits the key prop ...
Developing modern software applications typically involves composing functionality from existing libraries. This task is difficult because libraries may expose many methods to the developer. To help developers in such scenarios, we present a technique that ...
In the field of timber construction, we work on surface design that is based on an iterative model called "IFS" (Iterated Function System). The modeled figures must meet certain properties in order to ensure their physical feasibility. For the construction ...
