Search results for "Approx"

showing 10 items of 922 documents

Approximation algorithm for constrained coupled-tasks scheduling problem

2014

International audience; We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. In such context, we propose some complexity results according to several parameters and we design an efficient polynomial-time approximation algorithm.

Rate-monotonic schedulingEarliest deadline first schedulingOptimizationBipartite graphMathematical optimizationOpen-shop schedulingSchedulesDistributed computingComplexity theoryProcessor schedulingDynamic priority schedulingApproximation methodscoupled-tasksFair-share schedulingApproximation algorithmsFixed-priority pre-emptive schedulingNurse scheduling problemTwo-level schedulingMathematics[ INFO.INFO-RO ] Computer Science [cs]/Operations Research [cs.RO]
researchProduct

On fractional smoothness and Lp-approximation on the Wiener space

2015

Real interpolationBesov spacesStochastic analysis on a Gaussian spaceApproximation of stochastic integralsRiemann-Liouville operators
researchProduct

Interpolation and approximation in L2(γ)

AbstractAssume a standard Brownian motion W=(Wt)t∈[0,1], a Borel function f:R→R such that f(W1)∈L2, and the standard Gaussian measure γ on the real line. We characterize that f belongs to the Besov space B2,qθ(γ)≔(L2(γ),D1,2(γ))θ,q, obtained via the real interpolation method, by the behavior of aX(f(X1);τ)≔∥f(W1)-PXτf(W1)∥L2, where τ=(ti)i=0n is a deterministic time net and PXτ:L2→L2 the orthogonal projection onto a subspace of ‘discrete’ stochastic integrals x0+∑i=1nvi-1(Xti-Xti-1) with X being the Brownian motion or the geometric Brownian motion. By using Hermite polynomial expansions the problem is reduced to a deterministic one. The approximation numbers aX(f(X1);τ) can be used to descr…

Real interpolationStochastic approximationBesov spacesJournal of Approximation Theory
researchProduct

3D digitization of transparent objects by polalization techniques in IR & by triangulation in UV

2011

Two non-conventional methods for the 3D digitization of transparent objects via non-contact measurement are reported in this thesis. 3D digitization is a well acknowledged technique for opaque objects and various commercial solutions based on different measurement approaches are available in the market offering different types of resolution at different prices. Since these techniques require a diffused or lambertian surface, their application to transparent surfaces fails. Indeed, rays reflected by the transparent surface are perturbed by diverse inter-reflections induced by the refractive properties of the object. Therefore, in industrial applications like quality control, the transparent …

Reconstruction par polarisation dans l'IRLow cost systemApproximation du modèle orthographique[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]Objets transparentscoût)3D digitizationMéthode de validation des paramètres de StokesExcellent accuracyFluorescence tracking and characterizationTransparent objectsValidation method for optimal configuration setupScanning par laser UVIndustrialisable (en terme de précisionIndustrial applicationsOrthographic approximation approachShape from polarization in IRStokes parameters validation method[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH]Scanning from UV laserMéthode de validation pour une configuration optimale du système[ INFO.INFO-OH ] Computer Science [cs]/Other [cs.OH]Non telecentric lenseNumérisation 3DLentille non télécentrique"tracking" et caractérisation de la fluorescence
researchProduct

Online topology estimation for vector autoregressive processes in data networks

2017

An important problem in data sciences pertains to inferring causal interactions among a collection of time series. Upon modeling these as a vector autoregressive (VAR) process, this paper deals with estimating the model parameters to identify the underlying causality graph. To exploit the sparse connectivity of causality graphs, the proposed estimators minimize a group-Lasso regularized functional. To cope with real-time applications, big data setups, and possibly time-varying topologies, two online algorithms are presented to recover the sparse coefficients when observations are received sequentially. The proposed algorithms are inspired by the classic recursive least squares (RLS) algorit…

Recursive least squares filter021103 operations researchComputer science0211 other engineering and technologiesEstimatorApproximation algorithm020206 networking & telecommunications02 engineering and technologyNetwork topologyCausality (physics)Autoregressive model0202 electrical engineering electronic engineering information engineeringOnline algorithmTime seriesAlgorithm2017 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)
researchProduct

A brief overview on the numerical behavior of an implicit meshless method and an outlook to future challenges

2015

In this paper recent results on a leapfrog ADI meshless formulation are reported and some future challenges are addressed. The method benefits from the elimination of the meshing task from the pre-processing stage in space and it is unconditionally stable in time. Further improvements come from the ease of implementation, which makes computer codes very flexible in contrast to mesh based solver ones. The method requires only nodes at scattered locations and a function and its derivatives are approximated by means of a kernel representation. A perceived obstacle in the implicit formulation is in the second order differentiations which sometimes are eccesively sensitive to the node configurat…

Regularized meshless methodMathematical optimizationComputer sciencemedia_common.quotation_subjectSPHKernel representationSolverMathematics::Numerical AnalysisTask (project management)ADI leapfrog methodPhysics and Astronomy (all)Settore MAT/08 - Analisi NumericaSettore ING-IND/31 - ElettrotecnicaObstaclemeshless methodNode (circuits)Function (engineering)numerical approximationmedia_commonAIP Conference Proceedings
researchProduct

A novel numerical meshless approach for electric potential estimation in transcranial stimulation

2015

In this paper, a first application of the method of fundamental solutions in estimating the electric potential and the spatial current density distribution in the brain due to transcranial stimulation, is presented. The coupled boundary value p roblems for the electric potential are solved in a meshless way, so avoiding the use of grid based numerical methods. A multi-spherical geometry is considered and numerical results are discussed.

Regularized meshless methodMathematical optimizationmethod of fundamental solutionQuantitative Biology::Neurons and CognitionNumerical analysistranscranial electrical stimulationCurrent density distributionGrid basedBoundary valuesPhysics and Astronomy (all)Settore MAT/08 - Analisi NumericaSettore ING-IND/31 - ElettrotecnicaApplied mathematicsMethod of fundamental solutionsMeshfree methodsmeshless methodElectric potentialnumerical approximationMathematics
researchProduct

Fractional model of concrete hereditary viscoelastic behaviour

2016

The evaluation of creep effects in concrete structures is addressed in the literature using different predictive models, supplied by specific codes, and applying the concepts of linear viscoelastic theory with ageing. The expressions used in the literature are mainly based on exponential laws, which are introduced in the integral expression of the Boltzmann principle; this approach leads to the need of finding approximated numerical solutions of the viscoelastic response. In this study, the hereditary fractional viscoelastic model is applied to concrete elements, underlining the convenience of using creep or relaxation functions expressed by power laws. The full reciprocal character of cree…

RelaxationDiscretizationLaplace transformMechanical EngineeringMathematical analysis02 engineering and technologyConvolution integralsCreep021001 nanoscience & nanotechnologyPower lawViscoelasticityExponential functionMatrix (mathematics)Linear viscoelasticity020303 mechanical engineering & transports0203 mechanical engineeringCreepFractional operatorsRelaxation (approximation)0210 nano-technologyMathematicsConcrete
researchProduct

User-Centered Virtual Reality for Promoting Relaxation: An Innovative Approach

2019

[EN] Virtual reality has been used effectively to promote relaxation and reduce stress. It is possible to find two main approaches to achieve such aims across the literature. The first one is focused on genetic environments filled with relaxing "narratives" to induce control over one's own body and physiological response, while the second one engages the user in virtual reality-mediated activities to empower his/her own abilities to regulate emotion. The scope of the present contribution is to extend the discourse on VR use to promote relaxation, by proposing a third approach. This would be based on VR with personalized content, based on user research to identify important life events. As a…

Relaxationemotion regulationEXPRESION GRAFICA EN LA INGENIERIAlcsh:BF1-990Control (management)Virtual realityPersonalized virtual realitypersonalized virtual realityVirtual reality050105 experimental psychologyPersonalization03 medical and health sciencesUser-centered virtual reality0302 clinical medicinerelaxationHuman–computer interactionSettore M-PSI/01 - PSICOLOGIA GENERALEPsychology0501 psychology and cognitive sciencesNarrativeGeneral PsychologyScope (project management)Emotion regulation05 social sciencesLife eventsUser Researchlcsh:PsychologyPerspectivevirtual realityRelaxation (approximation)Psychology030217 neurology & neurosurgeryuser-centered virtual realityFrontiers in Psychology
researchProduct

Beyond the triangle and uniqueness relations: non-zeta counterterms at large $N$ from positive knots

1997

Counterterms that are not reducible to ζn are generated by 3F2 hypergeometric series arising from diagrams for which triangle and uniqueness relations furnish insufficient data. Irreducible double sums, corresponding to the torus knots (4, 3) = 819 and (5, 3) = 10124, are found in anomalous dimensions at O(1/N 3) in the large-N limit, which we compute analytically up to terms of level 11, corresponding to 11 loops for 4-dimensional field theories and 12 loops for 2-dimensional theories. High-precision numerical results are obtained up to 24 loops and used in Pade resummations of e-expansions, which are compared with analytical results in 3 dimensions. The O(1/N 3) results entail knots gener…

RenormalizationPure mathematicsKnot (unit)Physics and Astronomy (miscellaneous)Mathematical analysisPadé approximantPropagatorTorusUniquenessHypergeometric functionMathematics::Geometric TopologyMathematicsKnot theoryZeitschrift f�r Physik C Particles and Fields
researchProduct