Publication

Techniques for modelling microstructure in metal forming processes

Publications associées (37)

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.

Connectez-vous pour utiliser Chat avec Graph Search

Implementing Higher-Kinded Types in Dotty

Martin Odersky, Guillaume André Fradji Martres, Dmytro Petrashko

dotty is a new, experimental Scala compiler based on DOT, the calculus of Dependent Object Types. Higher-kinded types are a natural extension of first-order lambda calculus, and have been a core construct of Haskell and Scala. As long as such types are jus ...

ACM2016

The second order pullback equation

Bernard Dacorogna, Olivier Kneuss, Gyula Csató

Let f, g be two closed k-forms over R-n. The pullback equation studies the existence of a diffeomorphism phi : R-n -> R-n such that phi*(g) = f. We prove two types of results. The first one sharpens some of the existing regularity results. The second one d ...

Springer2014

Linearizability Is Not Always a Safety Property

Rachid Guerraoui, Eric Ruppert

We show that, in contrast to the general belief in the distributed computing community, linearizability, the celebrated consistency property, is not always a safety property. More specifically, we give an object for which it is possible to have an infinite ...

Springer International Publishing2014

Improving the Performance of Scala Collections with Miniboxing

Martin Odersky, Vlad Ureche, Aymeric Genet

Using generics, Scala collections can be used to store different types of data in a type-safe manner. Unfortunately, due to the erasure transformation, the performance of generics is degraded when storing primitive types, such as integers and floating poin ...

2014

Materials Taking a Lesson from Nature

Holger Frauenrath, Emmanuel Croisier, Liangfei Tian

Structural biomaterials with their often extraordinary properties and versatile functions are typically constructed from very limited sets of building blocks and types of supramolecular interactions. In this review we discuss how, inspired by nature's desi ...

Swiss Chemical Soc2013

Complete Completion using Types and Weights

Viktor Kuncak, Tihomir Gvero, Ivan Kuraj, Ruzica Piskac

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 ...

ACM2013

On Complete Completion using Types and Weights

Viktor Kuncak, Tihomir Gvero, Ivan Kuraj, Ruzica Piskac

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 ...

2012

On Fast Code Completion using Type Inhabitation

Viktor Kuncak, Tihomir Gvero, Ivan Kuraj, Ruzica Piskac

2012

Analysis of BLDC motor with zigzag and rhombic winding

Yves Perriard, Miroslav Markovic, Bruno Dehez

The paper presents a detailed analysis and comparison of two types of non-axial windings used for slotless permanent magnet (PM) motors: zigzag and rhombic ones. The motor mathematical model is verified by 3D FEM software. Finally, the motor prototype is p ...

IEEE, Piscataway, NJ, USA2010

ABC: Algebraic Bound Computation for Loops

Régis William Blanc, Laura Ildiko Kovacs, Thibaud Hottelier

We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations bet ...

Springer Berlin Heidelberg2010