Concept

Degré de liberté (statistiques)

Publications associées (66)

A stopping criterion for the conjugate gradient algorithm in the framework of anisotropic adaptive finite elements

We propose a simple stopping criterion for the conjugate gradient (CG) algorithm in the framework of anisotropic, adaptive finite elements for elliptic problems. The goal of the adaptive algorithm is to find a triangulation such that the estimated relative ...

2009

Thermal Behavior of an Ultra High-Precision Linear Axis Operating in Industrial Environment

Reymond Clavel, Emanuele Lubrano

Thermal expansion is the major source of inaccuracy for ultra high-precision robots. In this paper we propose a strategy to model and compensate this effect. The experiment is run using a 1 DOF (degree-of-freedom) parallel robot equipped with ten temperatu ...

Schönenfeld & Ziegler2008

Mechanisms for spin supersolidity in S=1/2 spin-dimer antiferromagnets

Frédéric Mila, Jean-David Picon, Nicolas Laflorencie

Using perturbative expansions and the contractor renormalization (CORE) algorithm, we obtain effective hard-core bosonic Hamiltonians describing the low-energy physics of S=1/2 spin-dimer antiferromagnets known to display supersolid phases under an applied ...

2008

Matérn B-Splines and the Optimal Reconstruction of Signals

Michaël Unser, Sathish Ramani

Starting from the power spectral density of Matérn stochastic processes, we introduce a new family of splines that is defined in terms of the whitening operator of such processes. We show that these Matérn splines admit a stable representation in a B-splin ...

IEEE2006

Analytic Determination of Scaling Parameters

Rüdiger Urbanke, Abdelaziz Amraoui, Andrea Montanari

We show that the finite-length scaling parameters for irregular LDPC codes when used over the binary erasure channel can be computed without resorting to ``covariance evolution''. We provide simple expressions that can be evaluated using solely the degree ...

2006

On the decoupling of heavy modes in Kaluza-Klein theories

In this paper we examine the 4-dimensional effective theory for the light Kaluza-Klein (KK) modes. Our main interest is in the interaction terms. We point out that the contribution of the heavy KK modes is generally needed in order to reproduce the correct ...

2006

Raptor Codes on Binary Memoryless Symmetric Channels

Mohammad Amin Shokrollahi, Seyed Omid Etesami

In this paper, we will investigate the performance of Raptor codes on arbitrary binary input memoryless symmetric channels (BIMSCs). In doing so, we generalize some of the results that were proved before for the erasure channel. We will generalize the stab ...

2006

Correlating the rheological and mechanical response of polyurethane nanocomposites containing hyperbranched polymers

John Christopher Plummer, Marlene Rodlert

Cast polyurethane thermosets have been modified with randomly oriented exfoliated and intercalated montmorillonite clay usinghyperbranched polymers (HBP) as reactive additives to promote dispersion of the clay platelets. The influence of the clay content o ...

2005

Fractional Splines, Wavelet Bases, and Applications

Michaël Unser

The purpose of this presentation is to describe a recent family of basis functions—the fractional B-splines—which appear to be intimately connected to fractional calculus. Among other properties, we show that they are the convolution kernels that link the ...

ENSEIRB2004

Fast spline smoothing via spectral factorization concepts

Giancarlo Ferrari Trecate

When tuning the smoothness parameter of nonparametric regression splines, the evaluation of the so-called degrees of freedom is one of the most computer-intensive tasks. In the paper, a closed-form expression of the degrees of freedom is obtained for the c ...

2000

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