Search results for "Mathematical optimization"

showing 10 items of 1300 documents

MCR-ALS on metabolic networks: Obtaining more meaningful pathways

2015

[EN] With the aim of understanding the flux distributions across a metabolic network, i.e. within living cells, Principal Component Analysis (PCA) has been proposed to obtain a set of orthogonal components (pathways) capturing most of the variance in the flux data. The problems with this method are (i) that no additional information can be included in the model, and (ii) that orthogonality imposes a hard constraint, not always reasonably. To overcome these drawbacks, here we propose to use a more flexible approach such as Multivariate Curve Resolution-Alternating Least Squares (MCR-ALS) to obtain this set of biological pathways through the network. By using this method, different constraint…

Mathematical optimizationProcess Chemistry and TechnologyESTADISTICA E INVESTIGACION OPERATIVAMetabolic networkMetabolic networkLeast SquaresVariance (accounting)Least squaresINGENIERIA DE SISTEMAS Y AUTOMATICAComputer Science ApplicationsAnalytical ChemistrySet (abstract data type)Constraint (information theory)OrthogonalityPichia pastorisPrincipal component analysisA priori and a posterioriMultivariate Curve Resolution-AlternatingGrey modellingSpectroscopySoftwareMathematics
researchProduct

Feasibility of finite and infinite paths in data dependent programs

2005

This paper considers the feasibility of finite and infinite paths in programs in two simple programming languages. The language LBASE allows to express the dependencies of real time systems on integer data, the language LTIM can model quantitative timing constraints in r.t.s. specifications. It is proven that the problem of whether a given LBASE or LTIM program has an infinite feasible path (i.e. whether it can exhibit an infinite behaviour) is decidable. The possibilities to characterise the sets of all feasible finite and infinite paths in LBASE and LTIM programs are also discussed. The infinite feasible path existence problem is proven decidable also for the language LTIBA which has both…

Mathematical optimizationProgramming languageReachability problemSimple (abstract algebra)Computer sciencePath (graph theory)Computer Science::Programming Languagescomputer.software_genrecomputerData dependentInteger (computer science)Decidability
researchProduct

Accurate registration of random radiographic projections based on three spherical references for the purpose of few-view 3D reconstruction

2008

Precise registration of radiographic projection images acquired in almost arbitrary geometries for the purpose of three-dimensional (3D) reconstruction is beset with difficulties. We modify and enhance a registration method [R. Schulze, D. D. Bruellmann, F. Roeder, and B. d'Hoedt, Med. Phys. 31, 2849-2854 (2004)] based on coupling a minimum amount of three reference spheres in arbitrary positions to a rigid object under study for precise a posteriori pose estimation. Two consecutive optimization procedures (a, initial guess; b, iterative coordinate refinement) are applied to completely exploit the reference's shadow information for precise registration of the projections. The modification h…

Mathematical optimizationProjection (mathematics)Iterative method3D reconstructionImage registrationA priori and a posterioriImage processingGeneral MedicineIterative reconstructionAlgorithmPoseMathematicsMedical Physics
researchProduct

Uncertainty Propagation in Integrated Urban Water Quality Modelling

2018

Sensitivity and uncertainty assessment of integrated urban drainage water quality models are crucial steps in the evaluation of the reliability of model results. Indeed, the assessment of the reliability of the results of complex water quality models is crucial in understanding their significance. In the case of integrated urban drainage water quality models, due to the fact that integrated approaches are basically a cascade of sub-models (simulating the sewer system, wastewater treatment plant and receiving water body), uncertainty produced in one sub-model propagates to the following ones in a manner dependent on the model structure, the estimation of parameters and the availability and u…

Mathematical optimizationPropagation of uncertaintySettore ICAR/03 - Ingegneria Sanitaria-AmbientaleComputer scienceStandard deviationpollution evaluationKeywords: Integrated urban drainage modelling Environmental water quality management Pollution evaluation Uncertainty analysisIntegrated urban drainage modellingSensitivity (control systems)Water qualityDrainageGLUEuncertainty analysisenvironmental water quality managementUncertainty analysisReliability (statistics)
researchProduct

Decision Making on Pareto Front Approximations with Inherent Nondominance

2011

t Approximating the Pareto fronts of nonlinear multiobjective optimization problems is considered and a property called inherent nondominance is proposed for such approximations. It is shown that an approximation having the above property can be explored by interactively solving a multiobjective optimization problem related to it. This exploration can be performed with available interactive multiobjective optimization methods. The ideas presented are especially useful in solving computationally expensive multiobjective optimization problems with costly function value evaluations. peerReviewed

Mathematical optimizationProperty (philosophy)Multiobjective OptimizationComputer Science::Neural and Evolutionary ComputationMathematicsofComputing_NUMERICALANALYSISMathematics::Optimization and ControlPareto principleFunction (mathematics)monitavoiteoptimointiComputingMethodologies_ARTIFICIALINTELLIGENCEMulti-objective optimizationMultiobjective optimization problemNonlinear systemPareto optimalObjective vectorMathematics
researchProduct

Efficient Pruning LMI Conditions for Branch-and-Prune Rank and Chirality-Constrained Estimation of the Dual Absolute Quadric

2014

International audience; We present a new globally optimal algorithm for self- calibrating a moving camera with constant parameters. Our method aims at estimating the Dual Absolute Quadric (DAQ) under the rank-3 and, optionally, camera centers chirality constraints. We employ the Branch-and-Prune paradigm and explore the space of only 5 parameters. Pruning in our method relies on solving Linear Matrix Inequality (LMI) feasibility and Generalized Eigenvalue (GEV) problems that solely depend upon the entries of the DAQ. These LMI and GEV problems are used to rule out branches in the search tree in which a quadric not satisfy- ing the rank and chirality conditions on camera centers is guarantee…

Mathematical optimizationQuadric[INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Rank (linear algebra)Linear matrix inequality[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Function (mathematics)Pruning (decision trees)[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Rotation (mathematics)Search treeEigenvalues and eigenvectorsMathematics
researchProduct

Introduction to the Pontryagin Maximum Principle for Quantum Optimal Control

2021

Optimal Control Theory is a powerful mathematical tool, which has known a rapid development since the 1950s, mainly for engineering applications. More recently, it has become a widely used method to improve process performance in quantum technologies by means of highly efficient control of quantum dynamics. This tutorial aims at providing an introduction to key concepts of optimal control theory which is accessible to physicists and engineers working in quantum control or in related fields. The different mathematical results are introduced intuitively, before being rigorously stated. This tutorial describes modern aspects of optimal control theory, with a particular focus on the Pontryagin …

Mathematical optimizationQuantum PhysicsComputer scienceProcess (engineering)Quantum dynamicsGeneral EngineeringFOS: Physical sciencesOptimal control01 natural sciences010305 fluids & plasmasQuantum technologyDevelopment (topology)[PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph]0103 physical sciencesKey (cryptography)General Earth and Planetary Sciences[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]Quantum Physics (quant-ph)010306 general physicsControl (linguistics)QuantumGeneral Environmental Science
researchProduct

External constraints on optimal control strategies in molecular orientation and photofragmentation: Role of zero-area fields

2013

We propose a new formulation of optimal and local control algorithms which enforces the constraint of time-integrated zero-area on the control field. The fulfillment of this requirement, crucial in many physical applications, is mathematically implemented by the introduction of a Lagrange multiplier aiming at penalizing the pulse area. This method allows to design a control field with an area as small as possible, while bringing the dynamical system close to the target state. We test the efficiency of this approach on two control purposes in molecular dynamics, namely, orientation and photodissociation.

Mathematical optimizationQuantum PhysicsField (physics)Computer scienceOrientation (computer vision)Control (management)FOS: Physical sciencesOptimal controlDynamical systemAtomic and Molecular Physics and OpticsConstraint (information theory)symbols.namesakeLagrange multipliersymbolsState (computer science)Quantum Physics (quant-ph)
researchProduct

Time optimization and state-dependent constraints in the quantum optimal control of molecular orientation

2014

We apply two recent generalizations of monotonically convergent optimization algorithms to the control of molecular orientation by laser fields. We show how to minimize the control duration by a step-wise optimization and maximize the field-free molecular orientation using state-dependent constraints. We discuss the physical relevance of the different results.

Mathematical optimizationQuantum PhysicsQuantum optimal controlOptimization algorithmState dependentComputer scienceFOS: Physical sciencesMonotonic functionOrientation (graph theory)Quantum Physics (quant-ph)Atomic and Molecular Physics and Optics
researchProduct

Bayesian prediction inM/M/1 queues

1994

Simple queues with Poisson input and exponential service times are considered to illustrate how well-suited Bayesian methods are used to handle the common inferential aims that appear when dealing with queue problems. The emphasis will mainly be placed on prediction; in particular, we study the predictive distribution of usual measures of effectiveness in anM/M/1 queue system, such as the number of customers in the queue and in the system, the waiting time in the queue and in the system, the length of an idle period and the length of a busy period.

Mathematical optimizationQueue management systemM/G/k queueM/D/1 queueM/M/1 queueM/D/c queueG/G/1 queueManagement Science and Operations ResearchComputer Science ApplicationsComputer Science::PerformanceComputational Theory and MathematicsStatisticsComputer Science::Networking and Internet ArchitectureM/G/1 queueM/M/c queueMathematicsQueueing Systems
researchProduct