Search results for "Quadrat"

showing 10 items of 344 documents

Some insights on the description of gradient elution in reversed-phase liquid chromatography

2014

The so-called "fundamental equation for gradient elution" has been used for modeling the retention in gradient elution. In this approach, the instantaneous retention factor (k) is expressed as a function of the change in the modifier content (φ(ts )), ts being the time the solute has spent in the stationary phase. This approach can only be applied at constant flow rate and with gradients where the elution strength depends on the column length following a f(t-l/u) function, u being the linear mobile phase flow rate, and l the distance from the column inlet to the location where the solute is at time t measured from the beginning of the gradient. These limitations can be solved by using the h…

Work (thermodynamics)Quadratic equationChemistryElutionPhase (matter)Content (measure theory)Analytical chemistryThermodynamicsFiltration and SeparationFunction (mathematics)Reversed-phase chromatographyAnalytical ChemistryVolumetric flow rateJournal of Separation Science
researchProduct

OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS

2010

The tensorial Bernstein basis for multivariate polynomials in n variables has a number 3n of functions for degree 2. Consequently, computing the representation of a multivariate polynomial in the tensorial Bernstein basis is an exponential time algorithm, which makes tensorial Bernstein-based solvers impractical for systems with more than n = 6 or 7 variables. This article describes a polytope (Bernstein polytope) with a number of faces, which allows to bound a sparse, multivariate polynomial expressed in the canonical basis by solving several linear programming problems. We compare the performance of a subdivision solver using domain reductions by linear programming with a solver using a c…

[ INFO.INFO-NA ] Computer Science [cs]/Numerical Analysis [cs.NA]Linear programmingPolytopeBernstein polynomials01 natural sciencesSimplex algorithmApplied mathematicssimplex algorithm0101 mathematicsMathematicsDiscrete mathematicsBasis (linear algebra)Applied Mathematics010102 general mathematicssubdivision solverlinear programmingalgebraic systemsQuadratic function[INFO.INFO-NA]Computer Science [cs]/Numerical Analysis [cs.NA]Solver1991 Mathematics Subject Classification: 14Q15 14Q20 65G40Bernstein polynomialComputer Science Applications010101 applied mathematicsModeling and SimulationStandard basisGeometry and TopologyComputer Vision and Pattern RecognitionSoftwareInternational Journal of Shape Modeling
researchProduct

Quadratic Objective Functions for Dichromatic Model Parameters Estimation

2017

International audience; In this paper, we present a novel method to estimate dichromatic model parameters from a single color image. Estimation of reflectance, shading and specularity has many applications such as shape recovery, specularity removal and facilitates classical image processing and computer vision tasks such as segmentation or classification. Our method is based on two successive and independent constrained quadratic programming steps to recover the parameters of the model. Compared to recent methods, our approach has the advantage to transform a complex inverse problem into two parralelizable optimization steps that are much easier to solve. We have compared our method with r…

[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image ProcessingLinear programmingColor imagebusiness.industry[INFO.INFO-TS] Computer Science [cs]/Signal and Image ProcessingComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]020206 networking & telecommunicationsImage processing02 engineering and technologyInverse problem[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Quadratic equation[INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Specularity[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingRobustness (computer science)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingComputer visionQuadratic programmingArtificial intelligencebusinessAlgorithmMathematics
researchProduct

Hom-Lie quadratic and Pinczon Algebras

2017

ABSTRACTPresenting the structure equation of a hom-Lie algebra 𝔤, as the vanishing of the self commutator of a coderivation of some associative comultiplication, we define up to homotopy hom-Lie algebras, which yields the general hom-Lie algebra cohomology with value in a module. If the hom-Lie algebra is quadratic, using the Pinczon bracket on skew symmetric multilinear forms on 𝔤, we express this theory in the space of forms. If the hom-Lie algebra is symmetric, it is possible to associate to each module a quadratic hom-Lie algebra and describe the cohomology with value in the module.

[ MATH ] Mathematics [math]Universal enveloping algebra01 natural sciencesCohomologyFiltered algebraQuadratic algebraMathematics::Category Theory0103 physical sciences[MATH]Mathematics [math]0101 mathematicsMSC: 17A45 17B56 17D99 55N20ComputingMilieux_MISCELLANEOUSMathematicsSymmetric algebraAlgebra and Number TheoryQuadratic algebrasMathematics::Rings and Algebras010102 general mathematicsUp to homotopy algebras16. Peace & justiceLie conformal algebraHom-Lie algebrasAlgebraDivision algebraAlgebra representationPhysics::Accelerator PhysicsCellular algebra010307 mathematical physics
researchProduct

Unfolding of saddle-nodes and their Dulac time

2016

Altres ajuts: UNAB10-4E-378, co-funded by ERDF "A way to build Europe" and by the French ANR-11-BS01-0009 STAAVF. In this paper we study unfoldings of saddle-nodes and their Dulac time. By unfolding a saddle-node, saddles and nodes appear. In the first result (Theorem A) we give a uniform asymptotic expansion of the trajectories arriving at the node. Uniformity is with respect to all parameters including the unfolding parameter bringing the node to a saddle-node and a parameter belonging to a space of functions. In the second part, we apply this first result for proving a regularity result (Theorem B) on the Dulac time (time of Dulac map) of an unfolding of a saddle-node. This result is a b…

[ MATH.MATH-DS ] Mathematics [math]/Dynamical Systems [math.DS][MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]Block (permutation group theory)Dynamical Systems (math.DS)Space (mathematics)01 natural sciencesCombinatoricsQuadratic equationFOS: MathematicsMathematics - Dynamical Systems0101 mathematicsBifurcationSaddleMathematicsPeriod functionApplied MathematicsUnfolding of a saddle-node010102 general mathematics16. Peace & justice010101 applied mathematicsMSC: 34C07Asymptotic expansions34C07Node (circuits)Asymptotic expansionAnalysis
researchProduct

Optimal control of an ensemble of Bloch equations with applications in MRI

2016

International audience; The optimal control of an ensemble of Bloch equations describing the evolution of an ensemble of spins is the mathematical model used in Nuclear Resonance Imaging and the associated costs lead to consider Mayer optimal control problems. The Maximum Principle allows to parameterize the optimal control and the dynamics is analyzed in the framework of geometric optimal control. This lead to numerical implementations or suboptimal controls using averaging principle.

[ MATH.MATH-OC ] Mathematics [math]/Optimization and Control [math.OC]0209 industrial biotechnologySpins010102 general mathematicsNuclear resonance[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]02 engineering and technologyOptimal controlLinear-quadratic-Gaussian control01 natural sciences020901 industrial engineering & automationMaximum principleControl theoryBloch equationsApplied mathematics[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]Boundary value problem0101 mathematicsComputingMilieux_MISCELLANEOUSMathematics2016 IEEE 55th Conference on Decision and Control (CDC)
researchProduct

New applications of graded Lie algebras to Lie algebras, generalized Lie algebras and cohomology

2007

We give new applications of graded Lie algebras to: identities of standard polynomials, deformation theory of quadratic Lie algebras, cyclic cohomology of quadratic Lie algebras, $2k$-Lie algebras, generalized Poisson brackets and so on.

[MATH.MATH-RT]Mathematics [math]/Representation Theory [math.RT]2k-Lie algebrasstandard polynomial.standard polynomial[ MATH.MATH-RT ] Mathematics [math]/Representation Theory [math.RT]Deformation theoryGerstenhaber-Nijenhuis bracketFOS: Mathematicsgraded Lie algebrasquadratic Lie algebra[MATH.MATH-RT] Mathematics [math]/Representation Theory [math.RT]Representation Theory (math.RT)Gerstenhaber bracketcyclic cohomologysuper Poisson bracketsMathematics - Representation TheorySchouten bracket17B70 17B05 17B20 17B56 17B60 17B65
researchProduct

Quasi-soliton spatial autoguidé en milieu non lineaire quadratique

2021

International audience; Nous démontrons ici des phénomènes d'autoguidage optique existant dans les milieux à non-linéarités quadratiques. En plus de la formation puis disparition d'un phénomène auto confiné, nous observons des effets de commutation ultrarapide et de démultiplication spatiale, ainsi qu'une restructuration temporelle suivie d'élargissements spectraux.

[PHYS.PHYS.PHYS-OPTICS] Physics [physics]/Physics [physics]/Optics [physics.optics][PHYS.PHYS.PHYS-OPTICS]Physics [physics]/Physics [physics]/Optics [physics.optics]Compression spatiale[PHYS.PHYS.PHYS-GEN-PH] Physics [physics]/Physics [physics]/General Physics [physics.gen-ph]pulsebreakingnonlinear optics[PHYS.PHYS.PHYS-ATM-PH]Physics [physics]/Physics [physics]/Atomic and Molecular Clusters [physics.atm-clus]Elargissement spectral[PHYS.PHYS.PHYS-GEN-PH]Physics [physics]/Physics [physics]/General Physics [physics.gen-ph]optical solitons[NLIN.NLIN-PS]Nonlinear Sciences [physics]/Pattern Formation and Solitons [nlin.PS]Quasi-Soliton[NLIN.NLIN-PS] Nonlinear Sciences [physics]/Pattern Formation and Solitons [nlin.PS]nonlinear optics; optical solitons; quadratic media[PHYS.PHYS.PHYS-ATM-PH] Physics [physics]/Physics [physics]/Atomic and Molecular Clusters [physics.atm-clus]quadratic mediapulse breaking
researchProduct

Study of the accretion torque during the 2014 outburst of the X-ray pulsar GRO J1744−28

2017

We present the spectral and timing analysis of the X-ray pulsar GRO J1744-28 during its 2014 outburst using data collected with the X-ray satellites Swift, INTEGRAL, Chandra, and XMM-Newton. We derived, by phase-connected timing analysis of the observed pulses, an updated set of the source ephemeris. We were also able to investigate the spin-up of the X-ray pulsar as a consequence of the accretion torque during the outburst. Relating the spin-up rate and the mass accretion rate as $\dot{\nu}\propto\dot{M}^{\beta}$, we fitted the pulse phase delays obtaining a value of $\beta=0.96(3)$. Combining the results from the source spin-up frequency derivative and the flux estimation, we constrained …

accretion accretion discAstrophysics::High Energy Astrophysical PhenomenaFOS: Physical sciencesAstrophysics::Cosmology and Extragalactic AstrophysicsAstrophysicsEphemeris01 natural sciencesstars: neutronQuadratic equationPulsar0103 physical sciencesTorque010303 astronomy & astrophysicsGroup delay and phase delayHigh Energy Astrophysical Phenomena (astro-ph.HE)Physics010308 nuclear & particles physicsneutron; X-rays: binaries; X-rays: individual: GRO J1744-28 [accretion accretion disc; stars]Static timing analysisAstronomy and AstrophysicsX-rays: binarieAccretion (astrophysics)Space and Planetary ScienceAstrophysics::Earth and Planetary AstrophysicsAstrophysics - High Energy Astrophysical PhenomenaX-rays: individual: GRO J1744-28X-ray pulsarMonthly Notices of the Royal Astronomical Society
researchProduct

Methods for optimal shape design of electrical devices

1996

Often the primary problem facing designers of structural systems is determining the shape of the structure. In spite of graphical work stations and modern software for analyzing the structure, finding the best geometry for the structure by “trial and error” is still a very tedious and timeconsuming task. The goal in optimal shape design (structural optimization, or redesign) is to computerize the design process and therefore shorten the time it takes to design new products or improve the existing design. Structural optimization is already used in many applications in industry. In general, however, structural optimization is just beginning to penetrate the industrial community. Integrating F…

business.industryComputer scienceStructural systemTopology optimizationCADTrial and errorcomputer.software_genreIndustrial engineeringSoftwareComputer Aided DesignbusinessEngineering design processcomputerSequential quadratic programming
researchProduct