Experimental Investigation of a Hermetic Scroll Expander–Generator.
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.
Overcomplete transforms have received considerable attention over the past years. However, they often suffer from a complexity burden. In this paper, a low complexity approach is provided, where an orthonormal basis is complemented with a set of incomplete ...
A significant theme in data envelopment analysis (DEA) is the stability of returns to scale (RTS) classification of specific decision making unit (DMU) which is under observed production possibility set. In this study the observed DMUs are public postal op ...
River confluences are known for their marked 3D patterns and, due to the complexity of local flow features and bed morphology, they require particular consideration. Although there are studies on the flow structure in junctions of two streams, amore detail ...
This contribution introduces a novel model, Laboratory as a Service (LaaS), for developing remote laboratories as independent component modules and implementing them as a set of loosely-coupled services to be consumed with a high level of abstraction and v ...
I4U is a joint entry of nine research Institutes and Universities across 4 continents to NIST SRE 2012. It started with a brief discussion during the Odyssey 2012 workshop in Singapore. An online discussion group was soon set up, providing a discussion pla ...
Bringing flexibility and extensibility into Learning Management Systems is crucial because it gives teachers and students a free choice of technologies and educational materials they want to use for their courses. This paper presents a solution by enabling ...
We show that the lines of every arrangement of n lines in the plane can be colored with O(root n/log n) colors such that no face of the arrangement is monochromatic. This improves a bound of Bose et al. by a circle minus(root/log n) factor. Any further imp ...
Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, an ...
We consider the problem of trajectory generation for constrained differentially flat systems. Based on the topological properties of the set of admissible steady state values of a flat output we derive conditions which allow for an a priori verification of ...
The submission of I4U, is a joint effort of nine research Institutes and Universities across 4 continents for submitting speaker recognition results to NIST SRE 2012. The joint efforts were started with a brief discussion during the Odyssey 2012 workshop i ...
