Utilization of Chemical Structure Information for Analysis of Spectra Composites

Size: px
Start display at page:

Download "Utilization of Chemical Structure Information for Analysis of Spectra Composites"

Transcription

1 ESANN 214 proceedings, European Symposium on Artificia Neura Networks, Computationa Inteigence and Machine Learning Bruges (Begium), Apri 214, i6doccom pub, ISBN Avaiabe from Utiization of Chemica Structure Information for Anaysis of Spectra Composites Kristin Domaschke1,2, Andre Rossberg1 and Thomas Vimann3 1- Hemhotz-Zentrum Dresden-Rossendorf, Institute of Resource Ecoogy, PO Box 51 1, 1314 Dresden, Germany 2- current address: Life Science Inkubator Sachsen GmbH & Co KG, project team NanoscopiX, Tatzberg 47, 137 Dresden, Germany 3- University of App Science Mittweida - Dept of Mathematics, Technikumpatz 17, 9648 Mittweida, Germany Abstract In this paper, we propose the utiization of structura information of spectra data during the preprocessing to extend the abiity of subsequent anaysis methods Specificay, we expect a dataset of measured spectra containing mixtures of ony a few spectra components Using the concentration ratios for a sma subset of mixtures and the chemica structura knowedge, theoretica spectra components are generated Then a set, which combines measured and theoretica spectra, is anayzed using a sef-organizing map to predict the unknown mixture ratios of the remaining subset by an associative earning At this time, the initia study on simuated data reached very good resuts 1 Introduction The prediction of concentration of mixture components is an important task in chemica data anaysis In this paper we propose an approach based on Kohonen s Sef-Organizing Map (SOM,[1]) and an utiization of structura chemica knowedge, if the mixture information is avaiabe for a few data of the whoe data set The SOM is one of the most popuar data mining and visuaization methods for vectoria data It provides a non-inear mapping of the possiby high-dimensiona data onto a ow-dimensiona, frequenty two-dimensiona, grid Under certain conditions this mapping preserves the topoogica properties of the data [2] Chemica spectra data are known to be high-dimensiona in genera and, therefore, are predestined for processing using SOMs in order to visuaize them or to detect custers To anayze the dependence of the spectra structure of data on specific chemica parameters, such as the ph-vaues or concentrations, a fused mapping of the spectra data together with further information is frequenty requested For this need, Messen proposed the XY-fused SOM [3] In this approach, two SOMs, one for spectra data and one for chemica parameters, are combined bi-directionay via a merged winner determination Yet, this structure is very compex and fais if ony a sma amount of data is avaiabe for earning, as it is frequenty the case in chemica data anaysis The authors woud ike to thank Dr Vinzenz Brender and Dr Kay Grossmann, of Institute of Resource Ecoogy at Hemhotz-Zentrum Dresden-Rossendorf, for hosting this research 277

2 ESANN 214 proceedings, European Symposium on Artificia Neura Networks, Computationa Inteigence and Machine Learning Bruges (Begium), Apri 214, i6doccom pub, ISBN Avaiabe from Here, the factor anaysis, which is used as standard method for spectra decomposition, can be mentioned Nevertheess, the non-inearity of SOMs seems to have much greater potentia especiay for further research on spectra unmixing probems as the factor anaysis Thus, in this paper we propose the foowing strategy: First, in a preprocessing step, we use the avaiabe mixture information for a sma subset of the spectra data to estimate theoretica pure component spectra, which can serve as additiona data vectors with the identity matrix as known mixture information For this purpose, chemica structure information is expicity taken into account Thereafter, we appy associative earning in sef-organizing maps to estimate the unknown mixture ratios for a spectra of the data set In the ast section of this paper we present the appication of this strategy to a simuated data set 2 21 Preprocessing of spectra using chemica structure information Spectra pattern and structura information in composite spectra We assume n spectra di obtained from some measurements with NB bands coected in the data matrix D = {d1,, dn } Rn NB In our data to be anayzed, these spectra are obtained by extended X-RAY absorption fine structure spectroscopy (EXAFS,[4]) as absorption spectra These measured spectra composites di consist of sparse mixtures of m theoretica components, where m << n These m pure spectra, which are estimated as described ater, are coected in the matrix R Rm NB with R = {r1,, rm } and rj RNB Further we denote by C Rn m with C = {c1,, cn } and ci Rm the unknown component concentration ratios of the component spectra R within the composites D The structura information of the spectra signa can be described by the Lambert-Beer aw [5] In the foowing, this definition is expained for absorption spectroscopic methods, but can be adapted simpy to many other spectroscopic methods, such as fuorescence spectroscopy The spectra signa of an absorbing substance is caed extinction E in absorption spectroscopy and depends proportionay on the thickness of the sampe b, the concentration c and on an extinction coefficient α by mo (1) E(λk ) = b c α(λk ) [cm] mo cm The unit of the extinction coefficient α resuts from the units for b and c We suppose the thickness of the sampe b is standardized to 1cm for each measurement, so we can reduce the equation (1) to mo E(λk ) = c α(λk ) mo If we further assume a high concentration of 1 mo for the substance, we see that the extinction coefficient α(λk ) is equa to E(λk ) and therefor has the same data characteristics as E(λk ) 278

3 ESANN 214 proceedings, European Symposium on Artificia Neura Networks, Computationa Inteigence and Machine Learning Bruges (Begium), Apri 214, i6doccom pub, ISBN Avaiabe from Furthermore, mixture sampes contain more than one absorbing substance, which here are assumed having no interactions between them Then, the absorption of a composite sampe E i, with i is the index of measurements in 1 < i < n, is the sum of the singuar extinctions E i (λ k ) = E 1 (λ k ) + E 2 (λ k ) + + E m (λ k ) resuting in the inear Lambert-Beer aw for the m components E i (λ k ) = m c ij α j (λ k ) (2) j=1 Furthermore, these equations show, that the extinction E and their extinction coefficient α reies on λ k, which is the waveength of the k th band with k = {1,, N B } Depending on the dimension of λ k, which can characterize either ony one or a N B spectra bands, we get either a singe extinction vaue E or an extinction vector E This aso appies to the extinction coefficients α For our data set, the extinction vector E of a sampe i is the measured spectrum d i Further, the m pure components can be identified with their extinction coefficients α j such that r j = α j is vaid Thus we obtain in (2) d i (λ k ) = m c ij r j (λ k ) (3) j=1 D = CR (4) We observe that under certain conditions the measured spectra d i can be determined additivey by the spectra of the pure components r j and their concentration vaues c ij within the composites For a set of measured spectra D equation (3) hods in the same way, as shown in (4) Further we ony consider convex data structures, ie m j=1 c ij = 1 In particuar, it is assumed that the number of a contained components is known in advance Unfortunatey, the concentration matrix C is generay not known for the measured data Hence, we cannot cacuate the matrix R However, the deduced structura reation (4) can be used as chemica structure information for structured preprocessing if a few concentrations are avaiabe 22 Using structura information for structured preprocessing In our probem we assume a spectra data subset D S R m N B, for which the concentrations C S R m m are known Thus, if we have this additiona data at east for as many spectra as components r j with 1 < j < m underying the data, we can compute the pure component spectra R using the structura information in (4) For this purpose, we appy an iterative Jacobi scheme [6], such that for each iteration step t + 1 we obtain R t+1 = O 1 [ D S LR t] (t = 1, 2, ) 279

4 ESANN 214 proceedings, European Symposium on Artificia Neura Networks, Computationa Inteigence and Machine Learning Bruges (Begium), Apri 214, i6doccom pub, ISBN Avaiabe from where the foowing notation is used c11 c21 = c12 c22 c1m c2m = L + O with cm1 cm2 c21 L = c12 cmm c1m c11 c2m, O= cm1 cm2 CS c22 cmm The iteration, starting with some set vaues R, is performed unti krt+1 Rt k <, where > is a chosen toerance, is reached Here, k k denotes the spectra norm Convergence is guaranteed if either max i m X j=1,j6=i m X cij < 1 or max j cii i=1,i6=j cij <1 cii hods [6] As a resut, we obtain the estimates R of the pure component spectra The concentration matrix CR with CR = {e1,, em } and ej Rm is simpy the unity matrix of dimension m consisting of the respective unity vectors ej In this way, we are abe to generate additiona spectra with known concentrations based on the chemica structure information (4) 3 Utiization of the extended data set to SOM-associationearning After the structured preprocessing, we have, on the one hand, the originay given data, consisting of D with the subset DS, for which the concentrations CS are avaiabe Wog we suppose these spectra to be d1 dm with concentration vectors c1 cm On the other hand we generated the pure component spectra R with trivia concentrations CR Thus we have the foowing dataset: d1,1 d V = NB,1 c1,1 cm,1 d1,m dnb,m c1,m cm,m rnb,1 e1,1 em,1 r1,1 r1,m rnb,m, V = e1,m em,m dnb,m+1 c1,m+1 cm,m+1 d1,m+1 d1,n dnb,n c1,n cm,n Hence, the fused dataset V = {v1,, vm+m } contains both informations, the spectra and their known concentrations merged into singe vectors v Rp with p = NB + m and 1 < < m + m The set V coects the remaining n m spectra together with the unknown concentrations cm+1 cn Both datasets are used for associative earning in SOMs [1] In our appication, the SOM grid A is a square attice of edge ength N such that the coordinate vectors are k N 2 The weight vectors or prototypes W = {wk } assigned to 28

5 ESANN 214 proceedings, European Symposium on Artificia Neura Networks, Computationa Inteigence and Machine Learning Bruges (Begium), Apri 214, i6doccom pub, ISBN Avaiabe from A, have the same dimension p as defined for the data vector of V Usua SOM training takes pace as appying the winner determination s(v) = arg min kv wk k k A and subsequent prototype adaptation according to wk = hks (v wk ) kk ska with hks = exp 2σ 2 being the neighborhood function Here < 1 is the earning rate and σ is the neighborhood function To keep the information of the subset V we aso feed these vectors into the training scheme Because of the unknown concentration information for these vectors v k ony the spectra information is used for winner determination For prototype update we appy the spectra information and the concentration estimations given by the current best matching unit After training, the unknown concentrations for the vectors v k can be estimated by association, ie the winner s(v k ) is determined and we simpy set NB +i v knb +i = ws(v for i = 1 m as association step k) 4 Appication of structured information processing for an EXAFS data set For this appication a dataset of n = 14 simuated EXAFS spectra with NB = 1 is used The underying chemica structure information assumes m = 4 components and a sinusoida pure component spectrum according to sin(bj f ) for a given frequency vector f RNB [7] Here we consider b = (125, 25, 5, 1) for the different pure component spectra We generated the simuated spectra as mixtures of these pure components with a predefined mixing matrix C of concentrations In the simuations we provided the concentrations ony for m = 4 simuated spectra to the above described processing agorithm using a SOM-grid A with N = 15 Thus, these data pay the roe of the subset DS For the SOM-training the neighborhood range σ remains non-vanishing aso during the convergence phase of SOM-earning to keep the generaization abiity of the mode despite the sma number of avaiabe training data, which is a common procedure for those cases [8] Further, we appied a prototype correction to ensure the reation (4) for the prototypes during the earning process Thus, the structura knowedge is used again After the appication of the compete anaysis procedure we obtain the estimated concentrations for the remaining 1 spectra We can compare them with the origina ones used for generating the simuated data set As we can see in Fig 1, we get accurate predictions Thus, the association earning by SOMs together with the utiization of the chemica structure information is abe to estimate the unknown concentrations quite we for this data set 5 Concusion We propose a data anaysis framework for spectra data processing in order to estimate mixture concentrations in spectra composites under the assumption of 281

6 ESANN 214 proceedings, European Symposium on Artificia Neura Networks, Computationa Inteigence and Machine Learning Bruges (Begium), Apri 214, i6doccom pub, ISBN Avaiabe from Fig 1: Comparison of the 4 origina component concentrations ( ) and the respective predicted vaues (?) obtained from the structured data processing for the 1 spectra not contained in DS sparsey avaiabe concentration information This approach takes the structura chemica information into account to generate an extended whie reiabe data set, which then can be used for association earning in SOMs We introduced the method and expained, how the structura-chemica information is integrated We exempary demonstrated the method for an artificia dataset Yet, further simuation and stabiity anaysis is required In particuar, the infuence of noisy data has to be considered Thus, the presented work is ony a proof of concepts so far, which has to be evauated further in the next steps of our research References [1] T Kohonen The sef-organizing map Proceedings of the IEEE, 78(9): , 199 [2] Th Vimann, R Der, M Herrmann, and Th M Martinetz Topoogy preservation in sef-organizing feature maps: Exact definition and measurement IEEE Transactions on Neura Networks, 8(2): , 1997 [3] W Messen, R Wehrens, and L Buydens Supervised Kohonen networks for cassification probems Chemometrics and Inteigent Laboratory Systems, 83(2):99 113, 26 [4] A Rossberg, T Reich, and G Bernhard Compexation of uranium (vi) with protocatechuic acid - appication of iterative transformation factor anaysis to exafs spectroscopy Anaytica and bioanaytica chemistry, 376(5): , 23 [5] DA Skoog and JJ Leary Instrumentee Anaytik: Grundagen - Gera te - Anwendungen Springer-Lehrbuch Springer, 1996 [6] H Friedrich and F Pietschmann Numerische Methoden: ein Lehr- und U bungsbuch Water de Gruyter GmbH & Co KG, 21 [7] K Domaschke Mutidimensionae Spektrenanayse mittes neuronae Netze dipoma thesis, Hochschue Zittau/Go ritz - Univerity of Appied Science, 212 [8] Th Vimann Neura maps for faithfu data modeing in medicine - state of the art and exempary appications Neurocomputing, 48(1-4):229 25,

BP neural network-based sports performance prediction model applied research

BP neural network-based sports performance prediction model applied research Avaiabe onine www.jocpr.com Journa of Chemica and Pharmaceutica Research, 204, 6(7:93-936 Research Artice ISSN : 0975-7384 CODEN(USA : JCPRC5 BP neura networ-based sports performance prediction mode appied

More information

CS229 Lecture notes. Andrew Ng

CS229 Lecture notes. Andrew Ng CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view

More information

A Brief Introduction to Markov Chains and Hidden Markov Models

A Brief Introduction to Markov Chains and Hidden Markov Models A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,

More information

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network An Agorithm for Pruning Redundant Modues in Min-Max Moduar Network Hui-Cheng Lian and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University 1954 Hua Shan Rd., Shanghai

More information

Statistical Learning Theory: A Primer

Statistical Learning Theory: A Primer Internationa Journa of Computer Vision 38(), 9 3, 2000 c 2000 uwer Academic Pubishers. Manufactured in The Netherands. Statistica Learning Theory: A Primer THEODOROS EVGENIOU, MASSIMILIANO PONTIL AND TOMASO

More information

A. Distribution of the test statistic

A. Distribution of the test statistic A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch

More information

Multilayer Kerceptron

Multilayer Kerceptron Mutiayer Kerceptron Zotán Szabó, András Lőrincz Department of Information Systems, Facuty of Informatics Eötvös Loránd University Pázmány Péter sétány 1/C H-1117, Budapest, Hungary e-mai: szzoi@csetehu,

More information

A Solution to the 4-bit Parity Problem with a Single Quaternary Neuron

A Solution to the 4-bit Parity Problem with a Single Quaternary Neuron Neura Information Processing - Letters and Reviews Vo. 5, No. 2, November 2004 LETTER A Soution to the 4-bit Parity Probem with a Singe Quaternary Neuron Tohru Nitta Nationa Institute of Advanced Industria

More information

Model-based Clustering by Probabilistic Self-organizing Maps

Model-based Clustering by Probabilistic Self-organizing Maps EEE TRANATN N NERA NETRK, V. XX, N., ode-based ustering by robabiistic ef-organizing aps hih-ian heng, Hsin-hia u, ember, EEE, and Hsin-in ang, ember, EEE Abstract n this paper, we consider the earning

More information

Combining reaction kinetics to the multi-phase Gibbs energy calculation

Combining reaction kinetics to the multi-phase Gibbs energy calculation 7 th European Symposium on Computer Aided Process Engineering ESCAPE7 V. Pesu and P.S. Agachi (Editors) 2007 Esevier B.V. A rights reserved. Combining reaction inetics to the muti-phase Gibbs energy cacuation

More information

MONTE CARLO SIMULATIONS

MONTE CARLO SIMULATIONS MONTE CARLO SIMULATIONS Current physics research 1) Theoretica 2) Experimenta 3) Computationa Monte Caro (MC) Method (1953) used to study 1) Discrete spin systems 2) Fuids 3) Poymers, membranes, soft matter

More information

Statistical Learning Theory: a Primer

Statistical Learning Theory: a Primer ??,??, 1 6 (??) c?? Kuwer Academic Pubishers, Boston. Manufactured in The Netherands. Statistica Learning Theory: a Primer THEODOROS EVGENIOU AND MASSIMILIANO PONTIL Center for Bioogica and Computationa

More information

arxiv: v1 [cs.lg] 31 Oct 2017

arxiv: v1 [cs.lg] 31 Oct 2017 ACCELERATED SPARSE SUBSPACE CLUSTERING Abofaz Hashemi and Haris Vikao Department of Eectrica and Computer Engineering, University of Texas at Austin, Austin, TX, USA arxiv:7.26v [cs.lg] 3 Oct 27 ABSTRACT

More information

The EM Algorithm applied to determining new limit points of Mahler measures

The EM Algorithm applied to determining new limit points of Mahler measures Contro and Cybernetics vo. 39 (2010) No. 4 The EM Agorithm appied to determining new imit points of Maher measures by Souad E Otmani, Georges Rhin and Jean-Marc Sac-Épée Université Pau Veraine-Metz, LMAM,

More information

T.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA

T.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA ON THE SYMMETRY OF THE POWER INE CHANNE T.C. Banwe, S. Gai {bct, sgai}@research.tecordia.com Tecordia Technoogies, Inc., 445 South Street, Morristown, NJ 07960, USA Abstract The indoor power ine network

More information

arxiv: v2 [cond-mat.stat-mech] 14 Nov 2008

arxiv: v2 [cond-mat.stat-mech] 14 Nov 2008 Random Booean Networks Barbara Drosse Institute of Condensed Matter Physics, Darmstadt University of Technoogy, Hochschustraße 6, 64289 Darmstadt, Germany (Dated: June 27) arxiv:76.335v2 [cond-mat.stat-mech]

More information

Two view learning: SVM-2K, Theory and Practice

Two view learning: SVM-2K, Theory and Practice Two view earning: SVM-2K, Theory and Practice Jason D.R. Farquhar jdrf99r@ecs.soton.ac.uk Hongying Meng hongying@cs.york.ac.uk David R. Hardoon drh@ecs.soton.ac.uk John Shawe-Tayor jst@ecs.soton.ac.uk

More information

Stochastic Variational Inference with Gradient Linearization

Stochastic Variational Inference with Gradient Linearization Stochastic Variationa Inference with Gradient Linearization Suppementa Materia Tobias Pötz * Anne S Wannenwetsch Stefan Roth Department of Computer Science, TU Darmstadt Preface In this suppementa materia,

More information

A Novel Learning Method for Elman Neural Network Using Local Search

A Novel Learning Method for Elman Neural Network Using Local Search Neura Information Processing Letters and Reviews Vo. 11, No. 8, August 2007 LETTER A Nove Learning Method for Eman Neura Networ Using Loca Search Facuty of Engineering, Toyama University, Gofuu 3190 Toyama

More information

Optimality of Inference in Hierarchical Coding for Distributed Object-Based Representations

Optimality of Inference in Hierarchical Coding for Distributed Object-Based Representations Optimaity of Inference in Hierarchica Coding for Distributed Object-Based Representations Simon Brodeur, Jean Rouat NECOTIS, Département génie éectrique et génie informatique, Université de Sherbrooke,

More information

A Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c)

A Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c) A Simpe Efficient Agorithm of 3-D Singe-Source Locaization with Uniform Cross Array Bing Xue a * Guangyou Fang b Yicai Ji c Key Laboratory of Eectromagnetic Radiation Sensing Technoogy, Institute of Eectronics,

More information

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with?

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with? Bayesian Learning A powerfu and growing approach in machine earning We use it in our own decision making a the time You hear a which which coud equay be Thanks or Tanks, which woud you go with? Combine

More information

Related Topics Maxwell s equations, electrical eddy field, magnetic field of coils, coil, magnetic flux, induced voltage

Related Topics Maxwell s equations, electrical eddy field, magnetic field of coils, coil, magnetic flux, induced voltage Magnetic induction TEP Reated Topics Maxwe s equations, eectrica eddy fied, magnetic fied of cois, coi, magnetic fux, induced votage Principe A magnetic fied of variabe frequency and varying strength is

More information

Appendix A: MATLAB commands for neural networks

Appendix A: MATLAB commands for neural networks Appendix A: MATLAB commands for neura networks 132 Appendix A: MATLAB commands for neura networks p=importdata('pn.xs'); t=importdata('tn.xs'); [pn,meanp,stdp,tn,meant,stdt]=prestd(p,t); for m=1:10 net=newff(minmax(pn),[m,1],{'tansig','purein'},'trainm');

More information

The influence of temperature of photovoltaic modules on performance of solar power plant

The influence of temperature of photovoltaic modules on performance of solar power plant IOSR Journa of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vo. 05, Issue 04 (Apri. 2015), V1 PP 09-15 www.iosrjen.org The infuence of temperature of photovotaic modues on performance

More information

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After

More information

Determining The Degree of Generalization Using An Incremental Learning Algorithm

Determining The Degree of Generalization Using An Incremental Learning Algorithm Determining The Degree of Generaization Using An Incrementa Learning Agorithm Pabo Zegers Facutad de Ingeniería, Universidad de os Andes San Caros de Apoquindo 22, Las Condes, Santiago, Chie pzegers@uandes.c

More information

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries c 26 Noninear Phenomena in Compex Systems First-Order Corrections to Gutzwier s Trace Formua for Systems with Discrete Symmetries Hoger Cartarius, Jörg Main, and Günter Wunner Institut für Theoretische

More information

Schedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness

Schedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness 1 Scheduabiity Anaysis of Deferrabe Scheduing Agorithms for Maintaining Rea-Time Data Freshness Song Han, Deji Chen, Ming Xiong, Kam-yiu Lam, Aoysius K. Mok, Krithi Ramamritham UT Austin, Emerson Process

More information

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES Separation of variabes is a method to sove certain PDEs which have a warped product structure. First, on R n, a inear PDE of order m is

More information

Problem set 6 The Perron Frobenius theorem.

Problem set 6 The Perron Frobenius theorem. Probem set 6 The Perron Frobenius theorem. Math 22a4 Oct 2 204, Due Oct.28 In a future probem set I want to discuss some criteria which aow us to concude that that the ground state of a sef-adjoint operator

More information

Explicit overall risk minimization transductive bound

Explicit overall risk minimization transductive bound 1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,

More information

An approximate method for solving the inverse scattering problem with fixed-energy data

An approximate method for solving the inverse scattering problem with fixed-energy data J. Inv. I-Posed Probems, Vo. 7, No. 6, pp. 561 571 (1999) c VSP 1999 An approximate method for soving the inverse scattering probem with fixed-energy data A. G. Ramm and W. Scheid Received May 12, 1999

More information

High Efficiency Development of a Reciprocating Compressor by Clarification of Loss Generation in Bearings

High Efficiency Development of a Reciprocating Compressor by Clarification of Loss Generation in Bearings Purdue University Purdue e-pubs Internationa Compressor Engineering Conference Schoo of Mechanica Engineering 2010 High Efficiency Deveopment of a Reciprocating Compressor by Carification of Loss Generation

More information

Self Inductance of a Solenoid with a Permanent-Magnet Core

Self Inductance of a Solenoid with a Permanent-Magnet Core 1 Probem Sef Inductance of a Soenoid with a Permanent-Magnet Core Kirk T. McDonad Joseph Henry Laboratories, Princeton University, Princeton, NJ 08544 (March 3, 2013; updated October 19, 2018) Deduce the

More information

SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS

SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS ISEE 1 SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS By Yingying Fan and Jinchi Lv University of Southern Caifornia This Suppementary Materia

More information

Higher dimensional PDEs and multidimensional eigenvalue problems

Higher dimensional PDEs and multidimensional eigenvalue problems Higher dimensiona PEs and mutidimensiona eigenvaue probems 1 Probems with three independent variabes Consider the prototypica equations u t = u (iffusion) u tt = u (W ave) u zz = u (Lapace) where u = u

More information

Moreau-Yosida Regularization for Grouped Tree Structure Learning

Moreau-Yosida Regularization for Grouped Tree Structure Learning Moreau-Yosida Reguarization for Grouped Tree Structure Learning Jun Liu Computer Science and Engineering Arizona State University J.Liu@asu.edu Jieping Ye Computer Science and Engineering Arizona State

More information

Symbolic models for nonlinear control systems using approximate bisimulation

Symbolic models for nonlinear control systems using approximate bisimulation Symboic modes for noninear contro systems using approximate bisimuation Giordano Poa, Antoine Girard and Pauo Tabuada Abstract Contro systems are usuay modeed by differentia equations describing how physica

More information

Schedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness

Schedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness 1 Scheduabiity Anaysis of Deferrabe Scheduing Agorithms for Maintaining Rea- Data Freshness Song Han, Deji Chen, Ming Xiong, Kam-yiu Lam, Aoysius K. Mok, Krithi Ramamritham UT Austin, Emerson Process Management,

More information

THE OUT-OF-PLANE BEHAVIOUR OF SPREAD-TOW FABRICS

THE OUT-OF-PLANE BEHAVIOUR OF SPREAD-TOW FABRICS ECCM6-6 TH EUROPEAN CONFERENCE ON COMPOSITE MATERIALS, Sevie, Spain, -6 June 04 THE OUT-OF-PLANE BEHAVIOUR OF SPREAD-TOW FABRICS M. Wysocki a,b*, M. Szpieg a, P. Heström a and F. Ohsson c a Swerea SICOMP

More information

Identification of macro and micro parameters in solidification model

Identification of macro and micro parameters in solidification model BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vo. 55, No. 1, 27 Identification of macro and micro parameters in soidification mode B. MOCHNACKI 1 and E. MAJCHRZAK 2,1 1 Czestochowa University

More information

4 Separation of Variables

4 Separation of Variables 4 Separation of Variabes In this chapter we describe a cassica technique for constructing forma soutions to inear boundary vaue probems. The soution of three cassica (paraboic, hyperboic and eiptic) PDE

More information

Collective organization in an adaptative mixture of experts

Collective organization in an adaptative mixture of experts Coective organization in an adaptative mixture of experts Vincent Vigneron, Christine Fuchen, Jean-Marc Martinez To cite this version: Vincent Vigneron, Christine Fuchen, Jean-Marc Martinez. Coective organization

More information

XSAT of linear CNF formulas

XSAT of linear CNF formulas XSAT of inear CN formuas Bernd R. Schuh Dr. Bernd Schuh, D-50968 Kön, Germany; bernd.schuh@netcoogne.de eywords: compexity, XSAT, exact inear formua, -reguarity, -uniformity, NPcompeteness Abstract. Open

More information

Torsion and shear stresses due to shear centre eccentricity in SCIA Engineer Delft University of Technology. Marijn Drillenburg

Torsion and shear stresses due to shear centre eccentricity in SCIA Engineer Delft University of Technology. Marijn Drillenburg Torsion and shear stresses due to shear centre eccentricity in SCIA Engineer Deft University of Technoogy Marijn Drienburg October 2017 Contents 1 Introduction 2 1.1 Hand Cacuation....................................

More information

Proceedings of Meetings on Acoustics

Proceedings of Meetings on Acoustics Proceedings of Meetings on Acoustics Voume 9, 23 http://acousticasociety.org/ ICA 23 Montrea Montrea, Canada 2-7 June 23 Architectura Acoustics Session 4pAAa: Room Acoustics Computer Simuation II 4pAAa9.

More information

Simplified analysis of EXAFS data and determination of bond lengths

Simplified analysis of EXAFS data and determination of bond lengths Indian Journa of Pure & Appied Physics Vo. 49, January 0, pp. 5-9 Simpified anaysis of EXAFS data and determination of bond engths A Mishra, N Parsai & B D Shrivastava * Schoo of Physics, Devi Ahiya University,

More information

II. PROBLEM. A. Description. For the space of audio signals

II. PROBLEM. A. Description. For the space of audio signals CS229 - Fina Report Speech Recording based Language Recognition (Natura Language) Leopod Cambier - cambier; Matan Leibovich - matane; Cindy Orozco Bohorquez - orozcocc ABSTRACT We construct a rea time

More information

Tracking Control of Multiple Mobile Robots

Tracking Control of Multiple Mobile Robots Proceedings of the 2001 IEEE Internationa Conference on Robotics & Automation Seou, Korea May 21-26, 2001 Tracking Contro of Mutipe Mobie Robots A Case Study of Inter-Robot Coision-Free Probem Jurachart

More information

A Fundamental Storage-Communication Tradeoff in Distributed Computing with Straggling Nodes

A Fundamental Storage-Communication Tradeoff in Distributed Computing with Straggling Nodes A Fundamenta Storage-Communication Tradeoff in Distributed Computing with Stragging odes ifa Yan, Michèe Wigger LTCI, Téécom ParisTech 75013 Paris, France Emai: {qifa.yan, michee.wigger} @teecom-paristech.fr

More information

Steepest Descent Adaptation of Min-Max Fuzzy If-Then Rules 1

Steepest Descent Adaptation of Min-Max Fuzzy If-Then Rules 1 Steepest Descent Adaptation of Min-Max Fuzzy If-Then Rues 1 R.J. Marks II, S. Oh, P. Arabshahi Λ, T.P. Caude, J.J. Choi, B.G. Song Λ Λ Dept. of Eectrica Engineering Boeing Computer Services University

More information

An Information Geometrical View of Stationary Subspace Analysis

An Information Geometrical View of Stationary Subspace Analysis An Information Geometrica View of Stationary Subspace Anaysis Motoaki Kawanabe, Wojciech Samek, Pau von Bünau, and Frank C. Meinecke Fraunhofer Institute FIRST, Kekuéstr. 7, 12489 Berin, Germany Berin

More information

V.B The Cluster Expansion

V.B The Cluster Expansion V.B The Custer Expansion For short range interactions, speciay with a hard core, it is much better to repace the expansion parameter V( q ) by f( q ) = exp ( βv( q )), which is obtained by summing over

More information

SVM-based Supervised and Unsupervised Classification Schemes

SVM-based Supervised and Unsupervised Classification Schemes SVM-based Supervised and Unsupervised Cassification Schemes LUMINITA STATE University of Pitesti Facuty of Mathematics and Computer Science 1 Targu din Vae St., Pitesti 110040 ROMANIA state@cicknet.ro

More information

Expectation-Maximization for Estimating Parameters for a Mixture of Poissons

Expectation-Maximization for Estimating Parameters for a Mixture of Poissons Expectation-Maximization for Estimating Parameters for a Mixture of Poissons Brandon Maone Department of Computer Science University of Hesini February 18, 2014 Abstract This document derives, in excrutiating

More information

6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17. Solution 7

6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17. Solution 7 6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17 Soution 7 Probem 1: Generating Random Variabes Each part of this probem requires impementation in MATLAB. For the

More information

CS 331: Artificial Intelligence Propositional Logic 2. Review of Last Time

CS 331: Artificial Intelligence Propositional Logic 2. Review of Last Time CS 33 Artificia Inteigence Propositiona Logic 2 Review of Last Time = means ogicay foows - i means can be derived from If your inference agorithm derives ony things that foow ogicay from the KB, the inference

More information

Converting Z-number to Fuzzy Number using. Fuzzy Expected Value

Converting Z-number to Fuzzy Number using. Fuzzy Expected Value ISSN 1746-7659, Engand, UK Journa of Information and Computing Science Vo. 1, No. 4, 017, pp.91-303 Converting Z-number to Fuzzy Number using Fuzzy Expected Vaue Mahdieh Akhbari * Department of Industria

More information

Strauss PDEs 2e: Section Exercise 2 Page 1 of 12. For problem (1), complete the calculation of the series in case j(t) = 0 and h(t) = e t.

Strauss PDEs 2e: Section Exercise 2 Page 1 of 12. For problem (1), complete the calculation of the series in case j(t) = 0 and h(t) = e t. Strauss PDEs e: Section 5.6 - Exercise Page 1 of 1 Exercise For probem (1, compete the cacuation of the series in case j(t = and h(t = e t. Soution With j(t = and h(t = e t, probem (1 on page 147 becomes

More information

Lecture Note 3: Stationary Iterative Methods

Lecture Note 3: Stationary Iterative Methods MATH 5330: Computationa Methods of Linear Agebra Lecture Note 3: Stationary Iterative Methods Xianyi Zeng Department of Mathematica Sciences, UTEP Stationary Iterative Methods The Gaussian eimination (or

More information

Effect of transport ratio on source term in determination of surface emission coefficient

Effect of transport ratio on source term in determination of surface emission coefficient Internationa Journa of heoretica & Appied Sciences, (): 74-78(9) ISSN : 975-78 Effect of transport ratio on source term in determination of surface emission coefficient Sanjeev Kumar and Apna Mishra epartment

More information

Smoothness equivalence properties of univariate subdivision schemes and their projection analogues

Smoothness equivalence properties of univariate subdivision schemes and their projection analogues Numerische Mathematik manuscript No. (wi be inserted by the editor) Smoothness equivaence properties of univariate subdivision schemes and their projection anaogues Phiipp Grohs TU Graz Institute of Geometry

More information

Seasonal Time Series Data Forecasting by Using Neural Networks Multiscale Autoregressive Model

Seasonal Time Series Data Forecasting by Using Neural Networks Multiscale Autoregressive Model American ourna of Appied Sciences 7 (): 372-378, 2 ISSN 546-9239 2 Science Pubications Seasona Time Series Data Forecasting by Using Neura Networks Mutiscae Autoregressive Mode Suhartono, B.S.S. Uama and

More information

Haar Decomposition and Reconstruction Algorithms

Haar Decomposition and Reconstruction Algorithms Jim Lambers MAT 773 Fa Semester 018-19 Lecture 15 and 16 Notes These notes correspond to Sections 4.3 and 4.4 in the text. Haar Decomposition and Reconstruction Agorithms Decomposition Suppose we approximate

More information

The Binary Space Partitioning-Tree Process Supplementary Material

The Binary Space Partitioning-Tree Process Supplementary Material The inary Space Partitioning-Tree Process Suppementary Materia Xuhui Fan in Li Scott. Sisson Schoo of omputer Science Fudan University ibin@fudan.edu.cn Schoo of Mathematics and Statistics University of

More information

In-plane shear stiffness of bare steel deck through shell finite element models. G. Bian, B.W. Schafer. June 2017

In-plane shear stiffness of bare steel deck through shell finite element models. G. Bian, B.W. Schafer. June 2017 In-pane shear stiffness of bare stee deck through she finite eement modes G. Bian, B.W. Schafer June 7 COLD-FORMED STEEL RESEARCH CONSORTIUM REPORT SERIES CFSRC R-7- SDII Stee Diaphragm Innovation Initiative

More information

Bayesian Unscented Kalman Filter for State Estimation of Nonlinear and Non-Gaussian Systems

Bayesian Unscented Kalman Filter for State Estimation of Nonlinear and Non-Gaussian Systems Bayesian Unscented Kaman Fiter for State Estimation of Noninear and Non-aussian Systems Zhong Liu, Shing-Chow Chan, Ho-Chun Wu and iafei Wu Department of Eectrica and Eectronic Engineering, he University

More information

Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels

Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channes arxiv:cs/060700v1 [cs.it] 6 Ju 006 Chun-Hao Hsu and Achieas Anastasopouos Eectrica Engineering and Computer Science Department University

More information

D. Prémel, J.M. Decitre and G. Pichenot. CEA, LIST, F Gif-sur-Yvette, France

D. Prémel, J.M. Decitre and G. Pichenot. CEA, LIST, F Gif-sur-Yvette, France SIMULATION OF EDDY CURRENT INSPECTION INCLUDING MAGNETIC FIELD SENSOR SUCH AS A GIANT MAGNETO-RESISTANCE OVER PLANAR STRATIFIED MEDIA COMPONENTS WITH EMBEDDED FLAWS D. Préme, J.M. Decitre and G. Pichenot

More information

Distributed average consensus: Beyond the realm of linearity

Distributed average consensus: Beyond the realm of linearity Distributed average consensus: Beyond the ream of inearity Usman A. Khan, Soummya Kar, and José M. F. Moura Department of Eectrica and Computer Engineering Carnegie Meon University 5 Forbes Ave, Pittsburgh,

More information

Minimizing Total Weighted Completion Time on Uniform Machines with Unbounded Batch

Minimizing Total Weighted Completion Time on Uniform Machines with Unbounded Batch The Eighth Internationa Symposium on Operations Research and Its Appications (ISORA 09) Zhangiaie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 402 408 Minimizing Tota Weighted Competion

More information

Discrete Techniques. Chapter Introduction

Discrete Techniques. Chapter Introduction Chapter 3 Discrete Techniques 3. Introduction In the previous two chapters we introduced Fourier transforms of continuous functions of the periodic and non-periodic (finite energy) type, as we as various

More information

A Comparison Study of the Test for Right Censored and Grouped Data

A Comparison Study of the Test for Right Censored and Grouped Data Communications for Statistica Appications and Methods 2015, Vo. 22, No. 4, 313 320 DOI: http://dx.doi.org/10.5351/csam.2015.22.4.313 Print ISSN 2287-7843 / Onine ISSN 2383-4757 A Comparison Study of the

More information

The basic equation for the production of turbulent kinetic energy in clouds is. dz + g w

The basic equation for the production of turbulent kinetic energy in clouds is. dz + g w Turbuence in couds The basic equation for the production of turbuent kinetic energy in couds is de TKE dt = u 0 w 0 du v 0 w 0 dv + g w q 0 q 0 e The first two terms on the RHS are associated with shear

More information

A proposed nonparametric mixture density estimation using B-spline functions

A proposed nonparametric mixture density estimation using B-spline functions A proposed nonparametric mixture density estimation using B-spine functions Atizez Hadrich a,b, Mourad Zribi a, Afif Masmoudi b a Laboratoire d Informatique Signa et Image de a Côte d Opae (LISIC-EA 4491),

More information

Applied Nuclear Physics (Fall 2006) Lecture 7 (10/2/06) Overview of Cross Section Calculation

Applied Nuclear Physics (Fall 2006) Lecture 7 (10/2/06) Overview of Cross Section Calculation 22.101 Appied Nucear Physics (Fa 2006) Lecture 7 (10/2/06) Overview of Cross Section Cacuation References P. Roman, Advanced Quantum Theory (Addison-Wesey, Reading, 1965), Chap 3. A. Foderaro, The Eements

More information

V.B The Cluster Expansion

V.B The Cluster Expansion V.B The Custer Expansion For short range interactions, speciay with a hard core, it is much better to repace the expansion parameter V( q ) by f(q ) = exp ( βv( q )) 1, which is obtained by summing over

More information

A Statistical Framework for Real-time Event Detection in Power Systems

A Statistical Framework for Real-time Event Detection in Power Systems 1 A Statistica Framework for Rea-time Event Detection in Power Systems Noan Uhrich, Tim Christman, Phiip Swisher, and Xichen Jiang Abstract A quickest change detection (QCD) agorithm is appied to the probem

More information

Deep Gaussian Processes for Multi-fidelity Modeling

Deep Gaussian Processes for Multi-fidelity Modeling Deep Gaussian Processes for Muti-fideity Modeing Kurt Cutajar EURECOM Sophia Antipois, France Mark Puin Andreas Damianou Nei Lawrence Javier Gonzáez Abstract Muti-fideity modes are prominenty used in various

More information

DISTRIBUTION OF TEMPERATURE IN A SPATIALLY ONE- DIMENSIONAL OBJECT AS A RESULT OF THE ACTIVE POINT SOURCE

DISTRIBUTION OF TEMPERATURE IN A SPATIALLY ONE- DIMENSIONAL OBJECT AS A RESULT OF THE ACTIVE POINT SOURCE DISTRIBUTION OF TEMPERATURE IN A SPATIALLY ONE- DIMENSIONAL OBJECT AS A RESULT OF THE ACTIVE POINT SOURCE Yury Iyushin and Anton Mokeev Saint-Petersburg Mining University, Vasiievsky Isand, 1 st ine, Saint-Petersburg,

More information

Ensemble Online Clustering through Decentralized Observations

Ensemble Online Clustering through Decentralized Observations Ensembe Onine Custering through Decentraized Observations Dimitrios Katseis, Caroyn L. Bec and Mihaea van der Schaar Abstract We investigate the probem of onine earning for an ensembe of agents custering

More information

Reliability: Theory & Applications No.3, September 2006

Reliability: Theory & Applications No.3, September 2006 REDUNDANCY AND RENEWAL OF SERVERS IN OPENED QUEUING NETWORKS G. Sh. Tsitsiashvii M.A. Osipova Vadivosto, Russia 1 An opened queuing networ with a redundancy and a renewa of servers is considered. To cacuate

More information

FRST Multivariate Statistics. Multivariate Discriminant Analysis (MDA)

FRST Multivariate Statistics. Multivariate Discriminant Analysis (MDA) 1 FRST 531 -- Mutivariate Statistics Mutivariate Discriminant Anaysis (MDA) Purpose: 1. To predict which group (Y) an observation beongs to based on the characteristics of p predictor (X) variabes, using

More information

$, (2.1) n="# #. (2.2)

$, (2.1) n=# #. (2.2) Chapter. Eectrostatic II Notes: Most of the materia presented in this chapter is taken from Jackson, Chap.,, and 4, and Di Bartoo, Chap... Mathematica Considerations.. The Fourier series and the Fourier

More information

Improving the Reliability of a Series-Parallel System Using Modified Weibull Distribution

Improving the Reliability of a Series-Parallel System Using Modified Weibull Distribution Internationa Mathematica Forum, Vo. 12, 217, no. 6, 257-269 HIKARI Ltd, www.m-hikari.com https://doi.org/1.12988/imf.217.611155 Improving the Reiabiity of a Series-Parae System Using Modified Weibu Distribution

More information

ASummaryofGaussianProcesses Coryn A.L. Bailer-Jones

ASummaryofGaussianProcesses Coryn A.L. Bailer-Jones ASummaryofGaussianProcesses Coryn A.L. Baier-Jones Cavendish Laboratory University of Cambridge caj@mrao.cam.ac.uk Introduction A genera prediction probem can be posed as foows. We consider that the variabe

More information

Discrete Techniques. Chapter Introduction

Discrete Techniques. Chapter Introduction Chapter 3 Discrete Techniques 3. Introduction In the previous two chapters we introduced Fourier transforms of continuous functions of the periodic and non-periodic (finite energy) type, we as various

More information

Reichenbachian Common Cause Systems

Reichenbachian Common Cause Systems Reichenbachian Common Cause Systems G. Hofer-Szabó Department of Phiosophy Technica University of Budapest e-mai: gszabo@hps.ete.hu Mikós Rédei Department of History and Phiosophy of Science Eötvös University,

More information

International Journal "Information Technologies & Knowledge" Vol.5, Number 1,

International Journal Information Technologies & Knowledge Vol.5, Number 1, Internationa Journa "Information Tecnoogies & Knowedge" Vo.5, Number, 0 5 EVOLVING CASCADE NEURAL NETWORK BASED ON MULTIDIMESNIONAL EPANECHNIKOV S KERNELS AND ITS LEARNING ALGORITHM Yevgeniy Bodyanskiy,

More information

Paper presented at the Workshop on Space Charge Physics in High Intensity Hadron Rings, sponsored by Brookhaven National Laboratory, May 4-7,1998

Paper presented at the Workshop on Space Charge Physics in High Intensity Hadron Rings, sponsored by Brookhaven National Laboratory, May 4-7,1998 Paper presented at the Workshop on Space Charge Physics in High ntensity Hadron Rings, sponsored by Brookhaven Nationa Laboratory, May 4-7,998 Noninear Sef Consistent High Resoution Beam Hao Agorithm in

More information

Cryptanalysis of PKP: A New Approach

Cryptanalysis of PKP: A New Approach Cryptanaysis of PKP: A New Approach Éiane Jaumes and Antoine Joux DCSSI 18, rue du Dr. Zamenhoff F-92131 Issy-es-Mx Cedex France eiane.jaumes@wanadoo.fr Antoine.Joux@ens.fr Abstract. Quite recenty, in

More information

FFTs in Graphics and Vision. Spherical Convolution and Axial Symmetry Detection

FFTs in Graphics and Vision. Spherical Convolution and Axial Symmetry Detection FFTs in Graphics and Vision Spherica Convoution and Axia Symmetry Detection Outine Math Review Symmetry Genera Convoution Spherica Convoution Axia Symmetry Detection Math Review Symmetry: Given a unitary

More information

Sequential Decoding of Polar Codes with Arbitrary Binary Kernel

Sequential Decoding of Polar Codes with Arbitrary Binary Kernel Sequentia Decoding of Poar Codes with Arbitrary Binary Kerne Vera Miosavskaya, Peter Trifonov Saint-Petersburg State Poytechnic University Emai: veram,petert}@dcn.icc.spbstu.ru Abstract The probem of efficient

More information

Establishment of Weak Conditions for Darboux- Goursat-Beudon Theorem

Establishment of Weak Conditions for Darboux- Goursat-Beudon Theorem Georgia Southern University Digita Commons@Georgia Southern Mathematica Sciences Facuty Pubications Department of Mathematica Sciences 2009 Estabishment of Weak Conditions for Darboux- Goursat-Beudon Theorem

More information

Lecture 6: Moderately Large Deflection Theory of Beams

Lecture 6: Moderately Large Deflection Theory of Beams Structura Mechanics 2.8 Lecture 6 Semester Yr Lecture 6: Moderatey Large Defection Theory of Beams 6.1 Genera Formuation Compare to the cassica theory of beams with infinitesima deformation, the moderatey

More information

PARSIMONIOUS VARIATIONAL-BAYES MIXTURE AGGREGATION WITH A POISSON PRIOR. Pierrick Bruneau, Marc Gelgon and Fabien Picarougne

PARSIMONIOUS VARIATIONAL-BAYES MIXTURE AGGREGATION WITH A POISSON PRIOR. Pierrick Bruneau, Marc Gelgon and Fabien Picarougne 17th European Signa Processing Conference (EUSIPCO 2009) Gasgow, Scotand, August 24-28, 2009 PARSIMONIOUS VARIATIONAL-BAYES MIXTURE AGGREGATION WITH A POISSON PRIOR Pierric Bruneau, Marc Gegon and Fabien

More information

Characterization of Low-Temperature SU-8 Photoresist Processing for MEMS Applications

Characterization of Low-Temperature SU-8 Photoresist Processing for MEMS Applications Characterization of Low-Temperature SU-8 Photoresist Processing for MEMS Appications Sang Jeen Hong 1, Seungkeun Choi 2, Yoonsu Choi 3, Mark Aen 4*, and Gary S. May 5 Schoo of Eectrica and Computer Engineering

More information

Can Active Learning Experience Be Transferred?

Can Active Learning Experience Be Transferred? Can Active Learning Experience Be Transferred? Hong-Min Chu Department of Computer Science and Information Engineering, Nationa Taiwan University E-mai: r04922031@csie.ntu.edu.tw Hsuan-Tien Lin Department

More information

Melodic contour estimation with B-spline models using a MDL criterion

Melodic contour estimation with B-spline models using a MDL criterion Meodic contour estimation with B-spine modes using a MDL criterion Damien Loive, Ney Barbot, Oivier Boeffard IRISA / University of Rennes 1 - ENSSAT 6 rue de Kerampont, B.P. 80518, F-305 Lannion Cedex

More information