Concept

Numératie

Publications associées (180)

A closed-form expression for the total degradation in OFDM systems

In this paper, building upon Bussgang's theorem, we present a new expression for the total degradation (TD) in OFDM systems. This novel expression is applicable to any high power amplifier (HPA) model. In case of ideal clipping HPA model and for particular ...

Wiley-Blackwell2015

Composite convex minimization involving self-concordant-like cost functions

Volkan Cevher, Quoc Tran Dinh, Yen-Huan Li

The self-concordant-like property of a smooth convex func- tion is a new analytical structure that generalizes the self-concordant notion. While a wide variety of important applications feature the self- concordant-like property, this concept has heretofor ...

2015

Composite convex minimization involving self-concordant-like cost functions

Volkan Cevher, Quoc Tran Dinh, Yen-Huan Li

Abstract. The self-concordant-like property of a smooth convex func- tion is a new analytical structure that generalizes the self-concordant notion. While a wide variety of important applications feature the self- concordant-like property, this concept has ...

2015

Spectrally intense terahertz source based on triangular Selenium

Christoph Peter Hauri, Mostafa Shalaby

The intensity of a nonlinear terahertz (THz) source is primarily given by its spectral density. In this letter, we introduce triangular Selinium (Se) as a novel THz emitter and show numerically its superior properties to the currently used crystals for int ...

2015

Assistive technology for supporting learning numeracy

Calculation depends on the majority of the abilities within the domain of general intelligence (Blair et al., 2005). Most major theories of intelligence include numeracy or quantitative thinking as one aspect of general cognitive skills (Kaufman et al., 20 ...

Psychology Press2014

MATHICSE Technical Report : Comparison of Clenshaw-Curtis and Leja quasi-optimal sparse grids for the approximation of random PDEs

Fabio Nobile, Lorenzo Tamellini

In this work we compare numerically different families of nested quadrature points, i.e. the classic Clenshaw{Curtis and various kinds of Leja points, in the context of the quasi-optimal sparse grid approximation of random elliptic PDEs. Numerical evidence ...

MATHICSE2014

Rinforzo di pannelli in muratura con griglie in materiali compositi immerse in matrici cementizie

Angelo Garofano

In the present paper the experimental results of in-plane shear tests on masonry walls subject to cyclic loads under constant axial load and externally strengthened with composite grid embedded in a cementitious matrix are synthetized. The experimental res ...

2014

Localized Orthogonal Decomposition Techniques For Boundary Value Problems

Patrick Henning

In this paper we propose a local orthogonal decomposition method (LOD) for elliptic partial differential equations with inhomogeneous Dirichlet and Neumann boundary conditions. For this purpose, we present new boundary correctors which preserve the common ...

Siam Publications2014

Barrier Smoothing for Nonsmooth Convex Minimization

Volkan Cevher, Quoc Tran Dinh, Yen-Huan Li

This paper proposes a smoothing technique for nonsmooth convex minimization using self-concordant barriers. To illustrate the main ideas, we compare our technique and the proximity smoothing approach (Nesterov2005) via the classical gradient method on both ...

Ieee2014

Stabilized reduced basis method for parametrized advection-diffusion PDEs

Gianluigi Rozza, Paolo Pacciarini

In this work, we propose viable and efficient strategies for the stabilization of the reduced basis approximation of an advection dominated problem. In particular, we investigate the combination of a classic stabilization method (SUPG) with the Offline-Onl ...

Elsevier2014

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