Rotational Ambiguity in Hard-Soft Modeling Method

Slides:



Advertisements
Similar presentations
Zhen Lu CPACT University of Newcastle MDC Technology Reduced Hessian Sequential Quadratic Programming(SQP)
Advertisements

The simplex algorithm The simplex algorithm is the classical method for solving linear programs. Its running time is not polynomial in the worst case.
Chapter 19 – Linear Programming
Visualizing the Microscopic Structure of Bilinear Data: Two components chemical systems.
pH Emission Spectrum Emission(3 λ) λ1 λ2 λ3 A λ λ1λ2λ3λ1λ2λ3 A Ex 1 Emission(3 λ) λ1λ2λ3λ1λ2λ3 A Ex 2 Emission(3 λ) λ1λ2λ3λ1λ2λ3 A Ex 3 λ1λ2λ3λ1λ2λ3.
Analyzing Multivariable Change: Optimization
Schedule On Thursdays we will be here in SOS180 for: – (today) – – Homework 1 is on the web, due to next Friday (17: ).
PROCESS INTEGRATED DESIGN WITHIN A MODEL PREDICTIVE CONTROL FRAMEWORK Mario Francisco, Pastora Vega, Omar Pérez University of Salamanca – Spain University.
Operation Research Chapter 3 Simplex Method.
Linear Programming Special Cases Alternate Optimal Solutions No Feasible Solution Unbounded Solutions.
Classification with reject option in gene expression data Blaise Hanczar and Edward R Dougherty BIOINFORMATICS Vol. 24 no , pages
Initial estimates for MCR-ALS method: EFA and SIMPLISMA
1 MCR-ALS analysis using initial estimate of concentration profile by EFA.
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
Projected image of a cube. Classical Calibration.
ISM 206 Lecture 4 Duality and Sensitivity Analysis.
An Introduction to Model-Free Chemical Analysis Hamid Abdollahi IASBS, Zanjan Lecture 2.
5.6 Maximization and Minimization with Mixed Problem Constraints
Review of Reservoir Problem OR753 October 29, 2014 Remote Sensing and GISc, IST.
1 2. The PARAFAC model Quimiometria Teórica e Aplicada Instituto de Química - UNICAMP.
Linear programming. Linear programming… …is a quantitative management tool to obtain optimal solutions to problems that involve restrictions and limitations.
To determine the rate constants for the second order consecutive reactions, a number of chemometrics and hard kinetic based methods are described. The.
COST 723 Training School - Cargese October 2005 OBS 2 Radiative transfer for thermal radiation. Observations Bruno Carli.
WHAT CAN KINETICS LEARN FROM NONSTATIONARY THERMODYNAMICS Miloslav Pekař Faculty of Chemistry Institute of Physical and Applied Chemistry Brno University.
1 A Fast-Nonegativity-Constrained Least Squares Algorithm R. Bro, S. D. Jong J. Chemometrics,11, , 1997 By : Maryam Khoshkam.
Interactive Series Baseline Correction Algorithm
How to Select a Test Method Marlene Moore Advanced Systems, Inc. June 15, 2010.
Chemical Kinetics TURN ON SPECs NOW!. First things first… Safety: Put bags away Goggles Lab Jacket Gloves Basic Reactants! LAB! Warm up Spec 20.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
EASTERN MEDITERRANEAN UNIVERSITY Department of Industrial Engineering Non linear Optimization Spring Instructor: Prof.Dr.Sahand Daneshvar Submited.
1 MODELING MATTER AT NANOSCALES 4. Introduction to quantum treatments The variational method.
Endmember Extraction from Highly Mixed Data Using MVC-NMF Lidan Miao AICIP Group Meeting Apr. 6, 2006 Lidan Miao AICIP Group Meeting Apr. 6, 2006.
1. 2 Model-based analysis for kinetic complexation study of Pizda and Cu(II) Spectrochimica Acta Part A M. Vosough, M. Maeder, M. Jalali-Heravi, S.E.
1 Analysis of GRBs KONUS/Wind Spectra from 2002 to 2004 : The correlation R-H ? Mourad FOUKA CRAAG, Algiers Observatory, Algeria Gamma Ray Bursts & Neutron.
Grey modeling approaches to investigate chemical processes Romà Tauler 1 and Anna de Juan 2 IIQAB-CSIC 1, UB 2 Spain
PATTERN RECOGNITION : PRINCIPAL COMPONENTS ANALYSIS Richard Brereton
Flow in Network. Graph, oriented graph, network A graph G =(V, E) is specified by a non empty set of nodes V and a set of edges E such that each edge.
1 4. Model constraints Quimiometria Teórica e Aplicada Instituto de Química - UNICAMP.
Rotational Ambiguity in Soft- Modeling Methods. D = USV = u 1 s 11 v 1 + … + u r s rr v r Singular Value Decomposition Row vectors: d 1,: d 2,: d p,:
Overview of analytical chemistry Chemistry 321, Summer 2014.
STATIC ANALYSIS OF UNCERTAIN STRUCTURES USING INTERVAL EIGENVALUE DECOMPOSITION Mehdi Modares Tufts University Robert L. Mullen Case Western Reserve University.
Analysis experience at GSIAF Marian Ivanov. HEP data analysis ● Typical HEP data analysis (physic analysis, calibration, alignment) and any statistical.
Instructional Design Document Simplex Method - Optimization STAM Interactive Solutions.
1 Optimization Linear Programming and Simplex Method.
Dillon: CSE470: ANALYSIS1 Requirements l Specify functionality »model objects and resources »model behavior l Specify data interfaces »type, quantity,
Self-Modeling Curve Resolution and Constraints Hamid Abdollahi Department of Chemistry, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan,
An Introduction to Model-Free Chemical Analysis Hamid Abdollahi IASBS, Zanjan Lecture 3.
High Dimensional Probabilistic Modelling through Manifolds
Curve fitting methods for complex and rank deficient chemical data
Section 7.4 Matrix Algebra.
روش عناصر محدود غیرخطی II Nonlinear Finite Element Procedures II
Epipolar geometry.
Structure from motion Input: Output: (Tomasi and Kanade)
Probabilistic Models with Latent Variables
3-3 Optimization with Linear Programming
Part 3. Linear Programming
Chapter 1: The Nature of Analytical Chemistry
8th Grade Matter and Energy in Organisms and Ecosystems
Engineering design is the process of devising a system, component, or process to meet desired needs. It is a decision-making process in which the basic.
Max Z = x1 + x2 2 x1 + 3 x2  6 (1) x2  1.5 (2) x1 - x2  2 (3)
№36 საჯარო სკოლა X კლასი ლუკა აშხატოევი
X.6 Non-Negative Matrix Factorization
Linear Algebra Lecture 18.
Synthesis in the Chemical Space Age
Non-negative Matrix Factorization (NMF)
9.3 Linear programming and 2 x 2 games : A geometric approach
Part 3. Linear Programming
Structure from motion Input: Output: (Tomasi and Kanade)
Prepared by Po-Chuan on 2016/05/24
Computer Animation Algorithms and Techniques
Presentation transcript:

Rotational Ambiguity in Hard-Soft Modeling Method

Hard-Soft Modeling A approach mixing the qualities of hard-modeling and soft-modeling methods is proposed to analyze chemical data. The soft-modeling method, which obtains the pure concentration profiles and spectra of all absorbing species present in the raw measurements by using typical s constraints, a hard constraint is introduced to force some or all the concentration profiles to fulfill a known chemical model, which is refined at each iterative cycle of the optimization process. This modification of soft method drastically decreases the rotational ambiguity associated with the profiles obtained using exclusively constraints. The optional inclusion of some or all the absorbing species into the known chemical model allows the successful treatment of data matrices whose instrumental response is not exclusively due to the chemical components involved in the known process, an impossible scenario for classical hard-modeling approaches

Hard-Soft Modeling Procedure A B C X C 1 2 3 4 5 6 7 8 9 10 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 Time Concentration (a.u.) A B X CSM CHM Non-linear model fitting min(CHM - CSM) CHM = f(k1, k2) All or some of the concentration profiles can be constrained. All or some of the batches can be constrained.

Hard-Soft Modeling in Two-Components system u1 + T12 u2 T21 u1 + u2 UT = [ u1 u2 ] = = [ c1 c2 ] = C c1 = u1 + T12 u2 c2 = T21 u1 + u2 v1 v2 a1 a2 1 - T12 T21 1 -T12 -T21 1 1 T-1V = = = A a1 = (v1 - T21 v2) 1 - T12 T21 1 a2 = (-T12 v1 + v2) 1 - T12 T21 1

HSM in 2 component system GridSearch2_HSM.m HSM in 2 component system

Shows the effects of introducing the hard modeling constraint on second component concentration profile ?

Concentration Profiles Matrix in Three Components System 1 1 1 UT = [ u1 u2 u3] T21 T22 T23 = [ c1 c2 c3 ] = C T31 T32 T33 c1 = u1 + T21 u2 + T31 u3 c2 = u1 + T22 u2 + T32 u3 c3 = u1 + T23 u2 + T33 u3

Spectral Profiles Matrix in Three Components System T22T33 - T32T23 T32 - T33 T23 - T22 v1 det (T) 1 v2 T-1V = T23T31 - T21T33 T33 - T31 T21 - T23 v3 T21T32 - T22T31 T31 - T32 T22 - T21 det (T) 1 a1 = ((T22T33 - T32T23) v1 + (T32 - T33 ) v2 + (T23 - T22) v3) det (T) 1 a2 = ((T23T31 – T21T33) v1 + (T33 - T31 ) v2 + (T21 - T23) v3) det (T) 1 a1 = ((T21T32 – T22T31) v1 + (T31 - T32 ) v2 + (T22 - T21) v3)

Hard-Soft Modeling for a Typical Kinetics System A B K1 ≠ k1 k2 C D A, B and D are absorbing

Visualization the Area of Feasible Solutions -Concentration Profiles Space

Visualization the Area of Feasible Solutions -Spectral Profiles Space

Introducing the hard constraint on A and B -Concentration Profiles Space

Visualization the Area of Feasible Solutions -Spectral Profiles Space

How we can use the obxerved correspondence between concentration and spectral profiles?