Concept

Compact convergence

Publications associées (84)

Comparison of HIPIMS sputtered Ag- and Cu-surfaces leading to accelerated bacterial inactivation in the dark

César Pulgarin, Juan Kiwi, Sami Rtimi, Oualid Baghriche

Recently, compact uniform and adhesive films of Ag and Cu have been prepared by DC-magnetron sputtering (DC), pulsed DC magnetron sputtering (DCP) and high power impulse magnetron sputtering (HIPIMS). This study reports the HIPIMS deposition for Ag and Cu ...

Elsevier Science Sa2014

Broadcasting oneself: Visual Discovery of Vlogging Styles

Daniel Gatica-Perez, Oya Aran, Joan Isaac Biel Tres

We present a data-driven approach to discover different styles that people use to present themselves in online video blogging (vlogging). By vlogging style, we denote the combination of conscious and unconscious choices that the vlogger made during the pro ...

2014

On the Use of Second-Order Modifiers for Real-Time Optimization

Dominique Bonvin, Timm Faulwasser

We consider the real-time optimization of static plants and propose a generalized version of the modifier-adaptation strategy that relies on second-order adaptation of the cost and constraint functions. We show that second-order adaptation allows checking ...

2014

Convergence of Ising Interfaces to Schramm's SLE Curves

Clément Hongler, Stanislav Smirnov

We show how to combine our earlier results to deduce strong convergence of the interfaces in the planar critical Ising model and its random-cluster representation to Schramm’s SLE curves with parameter κ = 3 and κ = 16 / 3 respectively. ...

2014

On the Convergence Speed of Spatially Coupled LDPC Ensembles

Vahid Aref

Spatially coupled low-density parity-check codes show an outstanding performance under the low-complexity belief propagation (BP) decoding algorithm. They exhibit a peculiar convergence phenomenon above the BP threshold of the underlying non-coupled ensemb ...

2013

On the continuity of mean total normal stress in geometrical multiscale cardiovascular problems

Simone Deparis, Adelmo Cristiano Innocenza Malossi

In this work an iterative strategy to implicitly couple dimensionally-heterogeneous blood flow models accounting for the continuity of mean total normal stress at interface boundaries is developed. Conservation of mean total normal stress in the coupling o ...

Elsevier2013

Time accurate partitioned algorithms for the solution of fluid-structure interaction problems in haemodynamics

Fabio Nobile, Christian Vergara

In this work we deal with the numerical solution of the fluid-structure interaction problem arising in the haemodynamic environment. In particular, we consider BDF and Newmark time discretization schemes, and we study different methods for the treatment of ...

2013

Certification Aspects of the Fast Gradient Method for Solving the Dual of Parametric Convex Programs

Colin Neil Jones

This paper examines the computational complexity certification of the fast gradient method for the solution of the dual of a parametric con- vex program. To this end, a lower iteration bound is derived such that for all parameters from a compact set a solu ...

Springer Heidelberg2012

Continuous-time distributed estimation with asymmetric mixing

Ali H. Sayed

Discrete-time mobile adaptive networks have been successfully used to model self-organization in biological networks. We recently introduced a continuous-time adaptive diffusion strategy with the goal of better modeling physical phenomena governed by conti ...

IEEE2012

A dimension reduction technique for estimation in linear mixed models

This paper proposes a dimension reduction technique for estimation in linear mixed models. Specifically, we show that in a linear mixed model, the maximum-likelihood (ML) problem can be rewritten as a substantially simpler optimization problem which presen ...

Taylor & Francis2012

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