Error Bounds for Context Reduction and Feature Omission
|
|
- Cecil Powell
- 5 years ago
- Views:
Transcription
1 Error Bounds for Context Redution and Feature Omission Eugen Bek, Ralf Shlüter, Hermann Ney,2 Human Language Tehnology and Pattern Reognition, Computer Siene Department RWTH Aahen University, Ahornstr. 55, 5256 Aahen, Germany 2 Spoken Language Proessing Group, LIMSI CNRS, Paris, Frane {bek, shlueter, ney}@s.rwth-aahen.de Abstrat In language proessing appliations like speeh reognition, printed/handwritten harater reognition, or statistial mahine translation, the language model usually has a major influene on the performane, by introduing ontext. An inrease of ontext length usually improves perplexity and inreases the auray of a lassifier using suh a language model. In this work, the effet of ontext redution, i.e. the auray differene between a ontext sensitive, and a ontext-insensitive lassifier is onsidered. Context redution is shown to be related to feature omission in the ase of single symbol lassifiation. Therefore, the simplest non-trivial ase of feature omission will be analyzed by omparing a feature-aware lassifier that uses an emission model to a prior-only lassifier that statially infers the prior maximizing lass only and thus ignores the observation underlying the lassifiation problem. Upper and lower tight bounds are presented for the auray differene of these model lassifiers. The orresponding analyti proofs, though not presented here, were supported by an extensive simulation analysis of the problem, whih gave empirial estimates of the auray differene bounds. Further, it is shown that the same bounds, though not tightly, also apply to the original ase of ontext redution. This result is supported by further simulation experiments for symbol string lassifiation. Index Terms: language model, ontext, error bound. Introdution In appliations like automati speeh reognition, statistial mahine translation, printed/or handwritten harater reognition, lassifiation refers to string lasses, where eah lass represents a string (or sequene) of symbols (words, haraters, phonemes, et.). The orresponding language models, providing symbol probability distributions in symbol sequene ontext of varying length, are an important aspet of many natural language proessing tasks. Language modeling paradigms may be based on smoothed n-gram ounts [8], or on multilayer pereptrons [2]. Empirially, using longer ontext improves perplexity and, up to some extent, also the auray [3] of string lassifiers. Nevertheless, to the best of the authors knowledge, urrently no formal relation is known between the order of the Markov model used in the language model and the auray of a resulting reognition system. To disover orresponding bounds, an empirial Monte- Carlo approah was applied. To judge if a measure is a potential andidate for a bound, millions of distributions were simulated, disarding measures that did not exhibit a suitable bounding behavior on the auray differene of two lassifiers with different ontext length. If a bound existed, its funtional form was onjetured, followed by an attempt to find a formal proof. Information theory provides a number of bounds on the Bayes error itself. Examples for this are the Chernoff bound [4], the Lainiotis bound [], and the nearest neighbor bound [7]. These bounds do not provide information on the effet of ontext in string lassifiation, although the nearest-neighbor bound resembles a part of the lower bound presented here. In [5], an upper bound on the Bayes error of a string lassifier using two lasses is desribed. The bound is a funtion of the lass prior and requires a restrition on the lass onditional observation distribution. In [], two bounds on the auray differene between a Bayes single symbol lassifier and a model lassifier (e.g. one learned from data) are presented. These bounds are based on the squared distane and the Kullbak-Leibler divergene [9]. The Kullbak-Leibler based bound was later tightened and extended to the general lass of f-divergenes [6] in [2]. In this work, the feature-dependene of a lassifier is analyzed by omparing a feature-aware lassifier using an emission model to a prior-only lassifier that statially infers the prior maximizing lass only. The orresponding auray differene between suh a pair of lassifiers is shown to be losely related to the auray differene between a ontext sensitive, and a ontext-insensitive lassifier, being the original motivation for this work. Upper and lower tight bounds are presented for this auray differene. Although not presented here, analyti proofs are available. Extensive simulation analysis of the problem provided the initial hypothesis that lead to these proofs. Further derivations presented here also show that the derived bounds an be related to the auray differene indued by ontext length variation in a language model for symbol string lassifiation, whih is supported by simulation results. 2. Context Redution vs. Feature Omission Let C be a finite set of lasses (e.g. words, symbols, et.) and X be the set of observations. For simpliity X is assumed to be finite. Then the task of string lassifiation is to map a sequene of observations x N X N to a sequene of lasses N C N. Note that here the sequene of lasses and observations have the same length and no alignment problem is assumed, like in automati speeh reognition. An exemplary task, whih would be represented by this model would be part-of-speeh tagging. Let pr( N, x N ) = pr( N ) pr(x N N ) be the probability mass funtion of the true joint distribution, with the language model pr( N ) and the observation model pr(x N N ). Then the auray of a Bayes lassifier at position
2 i in the string of lasses is: A i = max x N N : i= pr( N )pr(x N N ) The language model is assumed to be a bigram: pr( N ) = N pr( n n ) n= From this bigram a position dependent unigram an be derived by marginalization for position i N: pr i() = pr( N ) = pr( i ) N : i= i : i= Also, it is assumed that the observation model pr(x N N ) only exhibits loal dependene: pr(x N N ) = N pr(x n n) n= To measure the effet of the language model ontext, the differene A i between the full, bigram-based lassifier s auray A i, and the auray of the redued ontext lassifier Ãi that is based on the derived unigram prior, is onsidered: A i = A i Ãi = x N with: pr i(, x N ) := max pr i(, x N ) x N : i= pr( N, x N ), pr i(, x) :=pr i()pr(x ). max pr i(, x), To emphasize the onnetion to single symbols, the last equation is rewritten as follows: A i = x i pr i(x i) A i(x i), () with the definition of the loal auray differene: A i(x i) := pr i(y x i) max pr i( y, x i) max pr i( x i), y=x N \x i and the marginals in symbol position i are, with y = x N \ x i: pr i(x) = pr( N )pr(x N N ) N,xN :x i=x pr i( x) = pri()pr(x ) pr i(x) pr i( y, x i) = pr i( x N ) = pri(, xn ) pr i(, x N ) pr i(, y x i) = pr i(, x N \ x i x i) = pri(, xn ) pr i(x i) pr i(y x i) = pr i(, y x i) (2) The loal auray differene defined in Eq. (2) atually shows the differene between the auraies of a single symbol lassifier that maps an observation y Y to a single lass C, and a lassifier that only uses the prior (mapping every observation to the same lass). Disarding the ondition on x i and replaing y with x, the auray differene for the ase of feature omission is obtained: A = A Ã = x max pr()pr(x ) max pr(), (3) for whih bounds will be derived in the following setion that also lead to similar bounds for the symbol string lassifiation ase introdued here. 3. Gini Differene Bounds Assume single symbol lassifiation, and define the following statistial measure for the differene between the lass posterior and the lass prior probability, whih will be alled Gini differene in the following: G = x = x pr(x) pr(x) pr( x) 2 [pr( x) pr()] 2 pr() 2 The term Gini differene is hosen here, as it is similar to the Gini riterion, as, e.g. used in deision tree learning. In [7], the minuend and subtrahend of the Gini differene are known as Bayesian distane. In the following, tight lower and upper bounds of the auray differene for the ase of feature omission are presented in terms of the Gini differene. The orresponding proofs are not presented for lak of spae, but are available from the authors on request. Note that both the Gini differene, and the auray differene an take values between and. Therefore, both measures are be normalized: A = A, G = G. As shown in the following, in terms of these normalized measures, the bounds do not expliitly depend on the number of lasses. 3.. Upper Bound The normalized auray differene defined in Eq. (3) is tightly bounded from above by the square root of the normalized Gini differene: A G Lower Bound The lower bound of the Gini differene onsists of three different segments First Segment of the Lower Bound The (normalized) auray differene is positive: A, (4)
3 and equality an be obtained iff the normalized Gini differene is onstrained to: G Seond Segment of the Lower Bound Also, the normalized auray differene is linearly bounded from below by the normalized Gini differene minus a onstant: A G 4 This bound is tight for 4 G Third Segment of the Lower Bound If the Gini differene is onstrained to G 3 4, (5) then the set of tight lower bounds of the normalized auray differene is ompleted by: A G G 2 A ( A ) 2 The bounds are shown in Fig. in terms of normalized Gini differene and normalized auray differene Transition to Context Redution For the ase of symbol string lassifiation, the Gini differene an also be defined for a speifi symbol position i: G i := x i pr i(x i) G i(x i) Then Jensen s inequality [3, p. 82] an be applied to obtain the same bounds for the global, symbol string ase: A i = x i pr i(x i) A i(x i) x i pr i(x i)g ( G i(x i) ) (Eq.(6)) g ( x i pr i(x i) G i(x i) ) (Jensen s ineq., onave ase) g ( G i ) A i = x i pr i(x i) A i(x i) x i pr i(x i)f ( G i(x i) ) (Eq.(7)) f ( x i pr i(x i) G i(x i) ) (Jensen s ineq., onvex ase) f ( G i ) Nevertheless, it should be mentioned that these global bounds for the symbol string ase are not neessarily tight anymore, as is onfirmed by the simulations shown in the following setion. 4. Simulations 4.. Feature Omission: Single Symbol Case In order to determine the exat relation between the Gini differene and the auray differene, originally millions of distributions were simulated to alulate their values of the Gini, and the auray differene for a number of onfigurations. In Fig., the results of suh a simulation for 8 lasses and a set of 6 different disrete observations is presented. An upper and a lower bound for the auray differene as a funtion of the Gini differene is visible. This type of simulation also was performed for other ombinations of and X and from these results the upper and lower bounds presented in Se. 3 were hypothesized empirially by extensive analysis of the simulations, whih further led to orresponding proofs as presented in []. with the loal Gini differene: G i(x i) := pr i(y x i) pr i( y, x i) 2 pr i( x i) 2 y=x N \x i Apart from the additional ondition on x i, both the loal auray differene A i(x i), and the loal Gini differene G i(x i) effetively an be identified as single symbol ases, suh that the same upper and lower bounds apply, as derived for the feature omission ase in Subses. 3., and 3.2. Also, note that these upper and lower bounds are onave and onvex funtions, respetively. Now assume, these upper and lower bounds are represented by the following two funtions g and f, respetively (now assumed without normalization of Gini, and auray differene, without loss of generality), suh that: A i(x i) g ( G i(x i) ) (6) A i(x i) f ( G i(x i) ) (7) A Figure : Simulation results for = 8 lasses and X = 6 observations. Eah gray dot represents one simulated distribution. Also, the derived analyti tight upper and lower bounds are shown in red and blue, respetively. G
4 4.2. Context Redution: Symbol String Case The same experiments were performed for symbol string lassifiation. The upper and lower bounds from the symbol ase (feature omission) do hold for the string ase as shown in Setion 2, but the simulations suggest that in this ase the bounds are not tight any more, i.e. the simulations do not reah the bound in general, as shown in Fig. 2 number of simulations required to obtain good filling of the spae between the bounds inreases strongly. A2 A2 G2 G2 Figure 2: Simulation results for a string lassifier with = 5 lasses, X = observations, and sequene length N = 3. The auray/gini differene was alulated at position i = 2. Eah gray dot represents one simulated distribution. In the following Fig. 3, the number of lasses and observations X were proportionally redued, upon whih the spae between the analytial bounds is muh less filled. This might be due to the dependeny between the individual position s distributions, whih might be stronger for a lower number of lasses and observations. A2 Figure 4: Simulation results for a string lassifier with = 8 lasses, X = 9 observations, and sequene length N = 5. The auray/gini differene was alulated at position i = 3. Eah gray dot represents one simulated distribution. 5. Conlusions & Outlook In this work, upper and lower bounds on the auray differene for feature omission for single symbol lassifiation, and ontext redution for symbol string reognition were investigated. First of all, a relation between both ases was derived. Further, tight upper and lower bounds were presented for the single symbol ase. Monte-Carlo simulations played an important role in the disovery, as well as the formal proof of the bounds presented. Further simulations for the ase of ontext redution in symbol string lassifiation were presented, whih underline the relation between both ases. As suggested by these, the presented bounds, although being tight for the single symbol ase, do not seem to be tight in general for the symbol string ase. Nevertheless, the simulations strongly hint at the existene of tighter bounds for the symbol string ase, whih will be investigated in further work. To the knowledge of the authors, the bounds presented are the first to analytially support the empirially observed effet of feature omission and ontext redution on the auray. 6. Aknowledgments G2 Figure 3: Simulation results for a string lassifier with = 3 lasses, X = 6 observations, and sequene length N = 3. The auray/gini differene was alulated at position i = 2. Eah gray dot represents one simulated distribution. When (slightly) inreasing the length N, apparently no strong differene an be observed, as shown in Fig. 4. The number of observations here was redued somewhat, as the omplexity of the simulations apparently is exponential and the The authors would like to thank Tamer Alkhouli and Malte Nuhn for many insightful onversations on this topi. This work has been supported by a ompute time grant on the RWTH ITC luster. This work was partly funded under the projet EUBridge (FP ). H. Ney was partially supported by a senior hair award from DIGITEO, a Frenh researh luster in Ile-de-Frane. 7. Referenes [] Y. Bengio, R. Duharme, P. Vinent, and C. Jauvin, A Neural Probabilisti Language Model, Journal of Mahine Learning Researh, Vol. 3, pp , 23. [2] G. Casella, R.L. Berger. Statistial Inferene, Duxbury Press, Belmont, California, 99, 65 pages. [3] H. Chernoff, A Measure of Asymptoti Effiieny for Tests of
5 a Hypothesis Based on the Sum of Observations, The Annals of Mathematial Statistis, Vol. 23, No. 4, pp , 952. [4] J. Chu, Error Bounds for a Contextual Reognition Proedure, IEEE Transations on Computers, Vol. C-2, No., pp , Ot 97. [5] I. Csiszár, Eine informationstheoretishe Ungleihung und ihre Anwendung auf den Beweis der Ergodizitat von Markoffshen Ketten, Magyar. Tud. Akad. Mat. Kutató Int. Közl, Vol. 8, pp. 85 8, 963. [6] P. A. Devijver, On a New Class of Bounds on Bayes Risk in Multihypothesis Pattern Reognition, IEEE Transations on Computers, Vol. C-23, No., pp. 7 8, Jan [7] R. Kneser and H. Ney, Improved Baking-Off for m-gram Language Modeling, in Pro. IEEE Intern. Conf. on Aoustis, Speeh, and Signal Proessing, Vol., pp. 8 84, Detroit, MI, May 995. [8] S. Kullbak and R. Leibler, On Information and Suffiieny, The Annals of Mathematial Statistis, Vol. 22, No., pp , 95. [9] D. Lainiotis, A lass of upper bounds on probability of error for multihypotheses pattern reognition (orresp.), IEEE Transations on Information Theory, Vol. 5, No. 6, pp , Nov [] H. Ney, On the Relationship Between Classifiation Error Bounds and Training Criteria in Statistial Pattern Reognition, in Pro. Iberian Conferene on Pattern Reognition and Image Analysis, pp , Puerto de Andratx, Spain, Jun. 23. [] R. Shlüter, M. Nußbaum-Thom, E. Bek, T. Alkhouli, and H. Ney, Novel Tight Classifiation Error Bounds under Mismath Conditions Based on f-divergene, in Pro. IEEE Information Theory Workshop, pp , Sevilla, Spain, Sep. 23. [2] H. Shwenk, Continuous Spae Language Models, Computer Speeh & Language, Vol. 2, No. 3, pp , 27.
Complexity of Regularization RBF Networks
Complexity of Regularization RBF Networks Mark A Kon Department of Mathematis and Statistis Boston University Boston, MA 02215 mkon@buedu Leszek Plaskota Institute of Applied Mathematis University of Warsaw
More informationSensitivity Analysis in Markov Networks
Sensitivity Analysis in Markov Networks Hei Chan and Adnan Darwihe Computer Siene Department University of California, Los Angeles Los Angeles, CA 90095 {hei,darwihe}@s.ula.edu Abstrat This paper explores
More informationProbabilistic Graphical Models
Probabilisti Graphial Models David Sontag New York University Leture 12, April 19, 2012 Aknowledgement: Partially based on slides by Eri Xing at CMU and Andrew MCallum at UMass Amherst David Sontag (NYU)
More informationThe Effectiveness of the Linear Hull Effect
The Effetiveness of the Linear Hull Effet S. Murphy Tehnial Report RHUL MA 009 9 6 Otober 009 Department of Mathematis Royal Holloway, University of London Egham, Surrey TW0 0EX, England http://www.rhul.a.uk/mathematis/tehreports
More information10.5 Unsupervised Bayesian Learning
The Bayes Classifier Maximum-likelihood methods: Li Yu Hongda Mao Joan Wang parameter vetor is a fixed but unknown value Bayes methods: parameter vetor is a random variable with known prior distribution
More informationAn I-Vector Backend for Speaker Verification
An I-Vetor Bakend for Speaker Verifiation Patrik Kenny, 1 Themos Stafylakis, 1 Jahangir Alam, 1 and Marel Kokmann 2 1 CRIM, Canada, {patrik.kenny, themos.stafylakis, jahangir.alam}@rim.a 2 VoieTrust, Canada,
More informationModel-based mixture discriminant analysis an experimental study
Model-based mixture disriminant analysis an experimental study Zohar Halbe and Mayer Aladjem Department of Eletrial and Computer Engineering, Ben-Gurion University of the Negev P.O.Box 653, Beer-Sheva,
More informationA Spatiotemporal Approach to Passive Sound Source Localization
A Spatiotemporal Approah Passive Sound Soure Loalization Pasi Pertilä, Mikko Parviainen, Teemu Korhonen and Ari Visa Institute of Signal Proessing Tampere University of Tehnology, P.O.Box 553, FIN-330,
More informationIMPEDANCE EFFECTS OF LEFT TURNERS FROM THE MAJOR STREET AT A TWSC INTERSECTION
09-1289 Citation: Brilon, W. (2009): Impedane Effets of Left Turners from the Major Street at A TWSC Intersetion. Transportation Researh Reord Nr. 2130, pp. 2-8 IMPEDANCE EFFECTS OF LEFT TURNERS FROM THE
More informationDanielle Maddix AA238 Final Project December 9, 2016
Struture and Parameter Learning in Bayesian Networks with Appliations to Prediting Breast Caner Tumor Malignany in a Lower Dimension Feature Spae Danielle Maddix AA238 Final Projet Deember 9, 2016 Abstrat
More informationLOGISTIC REGRESSION IN DEPRESSION CLASSIFICATION
LOGISIC REGRESSIO I DEPRESSIO CLASSIFICAIO J. Kual,. V. ran, M. Bareš KSE, FJFI, CVU v Praze PCP, CS, 3LF UK v Praze Abstrat Well nown logisti regression and the other binary response models an be used
More informationAssessing the Performance of a BCI: A Task-Oriented Approach
Assessing the Performane of a BCI: A Task-Oriented Approah B. Dal Seno, L. Mainardi 2, M. Matteui Department of Eletronis and Information, IIT-Unit, Politenio di Milano, Italy 2 Department of Bioengineering,
More informationCoding for Random Projections and Approximate Near Neighbor Search
Coding for Random Projetions and Approximate Near Neighbor Searh Ping Li Department of Statistis & Biostatistis Department of Computer Siene Rutgers University Pisataay, NJ 8854, USA pingli@stat.rutgers.edu
More informationHankel Optimal Model Order Reduction 1
Massahusetts Institute of Tehnology Department of Eletrial Engineering and Computer Siene 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Hankel Optimal Model Order Redution 1 This leture overs both
More informationChapter 8 Hypothesis Testing
Leture 5 for BST 63: Statistial Theory II Kui Zhang, Spring Chapter 8 Hypothesis Testing Setion 8 Introdution Definition 8 A hypothesis is a statement about a population parameter Definition 8 The two
More informationControl Theory association of mathematics and engineering
Control Theory assoiation of mathematis and engineering Wojieh Mitkowski Krzysztof Oprzedkiewiz Department of Automatis AGH Univ. of Siene & Tehnology, Craow, Poland, Abstrat In this paper a methodology
More informationOptimization of Statistical Decisions for Age Replacement Problems via a New Pivotal Quantity Averaging Approach
Amerian Journal of heoretial and Applied tatistis 6; 5(-): -8 Published online January 7, 6 (http://www.sienepublishinggroup.om/j/ajtas) doi:.648/j.ajtas.s.65.4 IN: 36-8999 (Print); IN: 36-96 (Online)
More informationDevelopment of Fuzzy Extreme Value Theory. Populations
Applied Mathematial Sienes, Vol. 6, 0, no. 7, 58 5834 Development of Fuzzy Extreme Value Theory Control Charts Using α -uts for Sewed Populations Rungsarit Intaramo Department of Mathematis, Faulty of
More informationNonreversibility of Multiple Unicast Networks
Nonreversibility of Multiple Uniast Networks Randall Dougherty and Kenneth Zeger September 27, 2005 Abstrat We prove that for any finite direted ayli network, there exists a orresponding multiple uniast
More informationWeighted K-Nearest Neighbor Revisited
Weighted -Nearest Neighbor Revisited M. Biego University of Verona Verona, Italy Email: manuele.biego@univr.it M. Loog Delft University of Tehnology Delft, The Netherlands Email: m.loog@tudelft.nl Abstrat
More informationFeature Selection by Independent Component Analysis and Mutual Information Maximization in EEG Signal Classification
Feature Seletion by Independent Component Analysis and Mutual Information Maximization in EEG Signal Classifiation Tian Lan, Deniz Erdogmus, Andre Adami, Mihael Pavel BME Department, Oregon Health & Siene
More informationMethods of evaluating tests
Methods of evaluating tests Let X,, 1 Xn be i.i.d. Bernoulli( p ). Then 5 j= 1 j ( 5, ) T = X Binomial p. We test 1 H : p vs. 1 1 H : p>. We saw that a LRT is 1 if t k* φ ( x ) =. otherwise (t is the observed
More informationREFINED UPPER BOUNDS FOR THE LINEAR DIOPHANTINE PROBLEM OF FROBENIUS. 1. Introduction
Version of 5/2/2003 To appear in Advanes in Applied Mathematis REFINED UPPER BOUNDS FOR THE LINEAR DIOPHANTINE PROBLEM OF FROBENIUS MATTHIAS BECK AND SHELEMYAHU ZACKS Abstrat We study the Frobenius problem:
More informationInfomax Boosting. Abstract. 1. Introduction. 2. Infomax feature pursuit. Siwei Lyu Department of Computer Science Dartmouth College
Infomax Boosting Siwei Lyu Department of Computer Siene Dartmouth College Abstrat In this paper, we desribed an effiient feature pursuit sheme for boosting. The proposed method is based on the infomax
More informationDiscrete Bessel functions and partial difference equations
Disrete Bessel funtions and partial differene equations Antonín Slavík Charles University, Faulty of Mathematis and Physis, Sokolovská 83, 186 75 Praha 8, Czeh Republi E-mail: slavik@karlin.mff.uni.z Abstrat
More informationBilinear Formulated Multiple Kernel Learning for Multi-class Classification Problem
Bilinear Formulated Multiple Kernel Learning for Multi-lass Classifiation Problem Takumi Kobayashi and Nobuyuki Otsu National Institute of Advaned Industrial Siene and Tehnology, -- Umezono, Tsukuba, Japan
More informationA model for measurement of the states in a coupled-dot qubit
A model for measurement of the states in a oupled-dot qubit H B Sun and H M Wiseman Centre for Quantum Computer Tehnology Centre for Quantum Dynamis Griffith University Brisbane 4 QLD Australia E-mail:
More informationA Small Footprint i-vector Extractor
A Small Footprint i-vetor Extrator Patrik Kenny Centre de reherhe informatique de Montréal (CRIM) Patrik.Kenny@rim.a Abstrat Both the memory and omputational requirements of algorithms traditionally used
More informationThe universal model of error of active power measuring channel
7 th Symposium EKO TC 4 3 rd Symposium EKO TC 9 and 5 th WADC Workshop nstrumentation for the CT Era Sept. 8-2 Kosie Slovakia The universal model of error of ative power measuring hannel Boris Stogny Evgeny
More informationA NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM
NETWORK SIMPLEX LGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM Cen Çalışan, Utah Valley University, 800 W. University Parway, Orem, UT 84058, 801-863-6487, en.alisan@uvu.edu BSTRCT The minimum
More informationAdvances in Radio Science
Advanes in adio Siene 2003) 1: 99 104 Copernius GmbH 2003 Advanes in adio Siene A hybrid method ombining the FDTD and a time domain boundary-integral equation marhing-on-in-time algorithm A Beker and V
More informationDistributed Gaussian Mixture Model for Monitoring Multimode Plant-wide Process
istributed Gaussian Mixture Model for Monitoring Multimode Plant-wide Proess Jinlin Zhu, Zhiqiang Ge, Zhihuan Song. State ey Laboratory of Industrial Control Tehnology, Institute of Industrial Proess Control,
More informationEstimating the probability law of the codelength as a function of the approximation error in image compression
Estimating the probability law of the odelength as a funtion of the approximation error in image ompression François Malgouyres Marh 7, 2007 Abstrat After some reolletions on ompression of images using
More informationA New Version of Flusser Moment Set for Pattern Feature Extraction
A New Version of Flusser Moment Set for Pattern Feature Extration Constantin-Iulian VIZITIU, Doru MUNTEANU, Cristian MOLDER Communiations and Eletroni Systems Department Military Tehnial Aademy George
More informationMaximum Entropy and Exponential Families
Maximum Entropy and Exponential Families April 9, 209 Abstrat The goal of this note is to derive the exponential form of probability distribution from more basi onsiderations, in partiular Entropy. It
More informationJAST 2015 M.U.C. Women s College, Burdwan ISSN a peer reviewed multidisciplinary research journal Vol.-01, Issue- 01
JAST 05 M.U.C. Women s College, Burdwan ISSN 395-353 -a peer reviewed multidisiplinary researh journal Vol.-0, Issue- 0 On Type II Fuzzy Parameterized Soft Sets Pinaki Majumdar Department of Mathematis,
More informationResolving RIPS Measurement Ambiguity in Maximum Likelihood Estimation
14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 011 Resolving RIPS Measurement Ambiguity in Maximum Likelihood Estimation Wenhao Li, Xuezhi Wang, and Bill Moran Shool
More informationarxiv:cond-mat/ v1 [cond-mat.stat-mech] 16 Aug 2004
Computational omplexity and fundamental limitations to fermioni quantum Monte Carlo simulations arxiv:ond-mat/0408370v1 [ond-mat.stat-meh] 16 Aug 2004 Matthias Troyer, 1 Uwe-Jens Wiese 2 1 Theoretishe
More informationSearching All Approximate Covers and Their Distance using Finite Automata
Searhing All Approximate Covers and Their Distane using Finite Automata Ondřej Guth, Bořivoj Melihar, and Miroslav Balík České vysoké učení tehniké v Praze, Praha, CZ, {gutho1,melihar,alikm}@fel.vut.z
More informationA Queueing Model for Call Blending in Call Centers
A Queueing Model for Call Blending in Call Centers Sandjai Bhulai and Ger Koole Vrije Universiteit Amsterdam Faulty of Sienes De Boelelaan 1081a 1081 HV Amsterdam The Netherlands E-mail: {sbhulai, koole}@s.vu.nl
More informationArray Design for Superresolution Direction-Finding Algorithms
Array Design for Superresolution Diretion-Finding Algorithms Naushad Hussein Dowlut BEng, ACGI, AMIEE Athanassios Manikas PhD, DIC, AMIEE, MIEEE Department of Eletrial Eletroni Engineering Imperial College
More informationGeneralised Differential Quadrature Method in the Study of Free Vibration Analysis of Monoclinic Rectangular Plates
Amerian Journal of Computational and Applied Mathematis 0, (4): 66-7 DOI: 0.59/.aam.0004.05 Generalised Differential Quadrature Method in the Study of Free Vibration Analysis of Monolini Retangular Plates
More informationCOMPUTER METHODS FOR THE DETERMINATION OF THE CRITICAL PARAMETERS OF POLLUTED INSULATORS
COMPUTER METHODS FOR THE DETERMINATION OF THE CRITICAL PARAMETERS OF POLLUTED INSULATORS I. F. GONOS S. A. SUFLIS F. V. TOPALIS I.A. STATHOPULOS NATIONAL TECHNICAL UNIVERSITY OF ATHENS DEPARTMENT OF ELECTRICAL
More informationQCLAS Sensor for Purity Monitoring in Medical Gas Supply Lines
DOI.56/sensoren6/P3. QLAS Sensor for Purity Monitoring in Medial Gas Supply Lines Henrik Zimmermann, Mathias Wiese, Alessandro Ragnoni neoplas ontrol GmbH, Walther-Rathenau-Str. 49a, 7489 Greifswald, Germany
More informationarxiv:gr-qc/ v2 6 Feb 2004
Hubble Red Shift and the Anomalous Aeleration of Pioneer 0 and arxiv:gr-q/0402024v2 6 Feb 2004 Kostadin Trenčevski Faulty of Natural Sienes and Mathematis, P.O.Box 62, 000 Skopje, Maedonia Abstrat It this
More informationEstimation for Unknown Parameters of the Extended Burr Type-XII Distribution Based on Type-I Hybrid Progressive Censoring Scheme
Estimation for Unknown Parameters of the Extended Burr Type-XII Distribution Based on Type-I Hybrid Progressive Censoring Sheme M.M. Amein Department of Mathematis Statistis, Faulty of Siene, Taif University,
More informationGeneral probability weighted moments for the three-parameter Weibull Distribution and their application in S-N curves modelling
General probability weighted moments for the three-parameter Weibull Distribution and their appliation in S-N urves modelling Paul Dario Toasa Caiza a,, Thomas Ummenhofer a a KIT Stahl- und Leihtbau, Versuhsanstalt
More informationA Unified View on Multi-class Support Vector Classification Supplement
Journal of Mahine Learning Researh??) Submitted 7/15; Published?/?? A Unified View on Multi-lass Support Vetor Classifiation Supplement Ürün Doğan Mirosoft Researh Tobias Glasmahers Institut für Neuroinformatik
More informationAverage Rate Speed Scaling
Average Rate Speed Saling Nikhil Bansal David P. Bunde Ho-Leung Chan Kirk Pruhs May 2, 2008 Abstrat Speed saling is a power management tehnique that involves dynamially hanging the speed of a proessor.
More informationSufficient Conditions for a Flexible Manufacturing System to be Deadlocked
Paper 0, INT 0 Suffiient Conditions for a Flexile Manufaturing System to e Deadloked Paul E Deering, PhD Department of Engineering Tehnology and Management Ohio University deering@ohioedu Astrat In reent
More informationA NONLILEAR CONTROLLER FOR SHIP AUTOPILOTS
Vietnam Journal of Mehanis, VAST, Vol. 4, No. (), pp. A NONLILEAR CONTROLLER FOR SHIP AUTOPILOTS Le Thanh Tung Hanoi University of Siene and Tehnology, Vietnam Abstrat. Conventional ship autopilots are
More informationMeasuring & Inducing Neural Activity Using Extracellular Fields I: Inverse systems approach
Measuring & Induing Neural Ativity Using Extraellular Fields I: Inverse systems approah Keith Dillon Department of Eletrial and Computer Engineering University of California San Diego 9500 Gilman Dr. La
More informationThe Second Postulate of Euclid and the Hyperbolic Geometry
1 The Seond Postulate of Eulid and the Hyperboli Geometry Yuriy N. Zayko Department of Applied Informatis, Faulty of Publi Administration, Russian Presidential Aademy of National Eonomy and Publi Administration,
More informationConvergence of reinforcement learning with general function approximators
Convergene of reinforement learning with general funtion approximators assilis A. Papavassiliou and Stuart Russell Computer Siene Division, U. of California, Berkeley, CA 94720-1776 fvassilis,russellg@s.berkeley.edu
More informationModeling of discrete/continuous optimization problems: characterization and formulation of disjunctions and their relaxations
Computers and Chemial Engineering (00) 4/448 www.elsevier.om/loate/omphemeng Modeling of disrete/ontinuous optimization problems: haraterization and formulation of disjuntions and their relaxations Aldo
More informationUniversity of Groningen
University of Groningen Port Hamiltonian Formulation of Infinite Dimensional Systems II. Boundary Control by Interonnetion Mahelli, Alessandro; van der Shaft, Abraham; Melhiorri, Claudio Published in:
More informationFactorized Asymptotic Bayesian Inference for Mixture Modeling
Fatorized Asymptoti Bayesian Inferene for Mixture Modeling Ryohei Fujimaki NEC Laboratories Ameria Department of Media Analytis rfujimaki@sv.ne-labs.om Satoshi Morinaga NEC Corporation Information and
More informationNormative and descriptive approaches to multiattribute decision making
De. 009, Volume 8, No. (Serial No.78) China-USA Business Review, ISSN 57-54, USA Normative and desriptive approahes to multiattribute deision making Milan Terek (Department of Statistis, University of
More informationModeling of Threading Dislocation Density Reduction in Heteroepitaxial Layers
A. E. Romanov et al.: Threading Disloation Density Redution in Layers (II) 33 phys. stat. sol. (b) 99, 33 (997) Subjet lassifiation: 6.72.C; 68.55.Ln; S5.; S5.2; S7.; S7.2 Modeling of Threading Disloation
More informationParallel disrete-event simulation is an attempt to speed-up the simulation proess through the use of multiple proessors. In some sense parallel disret
Exploiting intra-objet dependenies in parallel simulation Franeso Quaglia a;1 Roberto Baldoni a;2 a Dipartimento di Informatia e Sistemistia Universita \La Sapienza" Via Salaria 113, 198 Roma, Italy Abstrat
More informationOn the Bit Error Probability of Noisy Channel Networks With Intermediate Node Encoding I. INTRODUCTION
5188 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 11, NOVEMBER 2008 [8] A. P. Dempster, N. M. Laird, and D. B. Rubin, Maximum likelihood estimation from inomplete data via the EM algorithm, J.
More informationAn Integrated Architecture of Adaptive Neural Network Control for Dynamic Systems
An Integrated Arhiteture of Adaptive Neural Network Control for Dynami Systems Robert L. Tokar 2 Brian D.MVey2 'Center for Nonlinear Studies, 2Applied Theoretial Physis Division Los Alamos National Laboratory,
More informationCS 687 Jana Kosecka. Uncertainty, Bayesian Networks Chapter 13, Russell and Norvig Chapter 14,
CS 687 Jana Koseka Unertainty Bayesian Networks Chapter 13 Russell and Norvig Chapter 14 14.1-14.3 Outline Unertainty robability Syntax and Semantis Inferene Independene and Bayes' Rule Syntax Basi element:
More informationLikelihood-confidence intervals for quantiles in Extreme Value Distributions
Likelihood-onfidene intervals for quantiles in Extreme Value Distributions A. Bolívar, E. Díaz-Franés, J. Ortega, and E. Vilhis. Centro de Investigaión en Matemátias; A.P. 42, Guanajuato, Gto. 36; Méxio
More informationMillennium Relativity Acceleration Composition. The Relativistic Relationship between Acceleration and Uniform Motion
Millennium Relativity Aeleration Composition he Relativisti Relationship between Aeleration and niform Motion Copyright 003 Joseph A. Rybzyk Abstrat he relativisti priniples developed throughout the six
More informationTaste for variety and optimum product diversity in an open economy
Taste for variety and optimum produt diversity in an open eonomy Javier Coto-Martínez City University Paul Levine University of Surrey Otober 0, 005 María D.C. Garía-Alonso University of Kent Abstrat We
More informationThe Influences of Smooth Approximation Functions for SPTSVM
The Influenes of Smooth Approximation Funtions for SPTSVM Xinxin Zhang Liaoheng University Shool of Mathematis Sienes Liaoheng, 5059 P.R. China ldzhangxin008@6.om Liya Fan Liaoheng University Shool of
More informationAfter the completion of this section the student should recall
Chapter I MTH FUNDMENTLS I. Sets, Numbers, Coordinates, Funtions ugust 30, 08 3 I. SETS, NUMERS, COORDINTES, FUNCTIONS Objetives: fter the ompletion of this setion the student should reall - the definition
More information"Research Note" ANALYSIS AND OPTIMIZATION OF A FISSION CHAMBER DETECTOR USING MCNP4C AND SRIM MONTE CARLO CODES *
Iranian Journal of Siene & Tehnology, Transation A, Vol. 33, o. A3 Printed in the Islami Republi of Iran, 9 Shiraz University "Researh ote" AALYSIS AD OPTIMIZATIO OF A FISSIO CHAMBER DETECTOR USIG MCP4C
More informationOPPORTUNISTIC SENSING FOR OBJECT RECOGNITION A UNIFIED FORMULATION FOR DYNAMIC SENSOR SELECTION AND FEATURE EXTRACTION
OPPORTUNISTIC SENSING FOR OBJECT RECOGNITION A UNIFIED FORMULATION FOR DYNAMIC SENSOR SELECTION AND FEATURE EXTRACTION Zhaowen Wang, Jianhao Yang, Nasser Nasrabadi and Thomas Huang Bekman Institute, University
More informationAnalysis of discretization in the direct simulation Monte Carlo
PHYSICS OF FLUIDS VOLUME 1, UMBER 1 OCTOBER Analysis of disretization in the diret simulation Monte Carlo iolas G. Hadjionstantinou a) Department of Mehanial Engineering, Massahusetts Institute of Tehnology,
More informationGrasp Planning: How to Choose a Suitable Task Wrench Space
Grasp Planning: How to Choose a Suitable Task Wrenh Spae Ch. Borst, M. Fisher and G. Hirzinger German Aerospae Center - DLR Institute for Robotis and Mehatronis 8223 Wessling, Germany Email: [Christoph.Borst,
More informationScalable Positivity Preserving Model Reduction Using Linear Energy Functions
Salable Positivity Preserving Model Redution Using Linear Energy Funtions Sootla, Aivar; Rantzer, Anders Published in: IEEE 51st Annual Conferene on Deision and Control (CDC), 2012 DOI: 10.1109/CDC.2012.6427032
More informationOrdering Generalized Trapezoidal Fuzzy Numbers. Using Orthocentre of Centroids
International Journal of lgera Vol. 6 no. 69-85 Ordering Generalized Trapezoidal Fuzzy Numers Using Orthoentre of Centroids Y. L. P. Thorani P. Phani Bushan ao and N. avi Shanar Dept. of pplied Mathematis
More informationCOMBINED PROBE FOR MACH NUMBER, TEMPERATURE AND INCIDENCE INDICATION
4 TH INTERNATIONAL CONGRESS OF THE AERONAUTICAL SCIENCES COMBINED PROBE FOR MACH NUMBER, TEMPERATURE AND INCIDENCE INDICATION Jiri Nozika*, Josef Adame*, Daniel Hanus** *Department of Fluid Dynamis and
More informationTHEORETICAL ANALYSIS OF EMPIRICAL RELATIONSHIPS FOR PARETO- DISTRIBUTED SCIENTOMETRIC DATA Vladimir Atanassov, Ekaterina Detcheva
International Journal "Information Models and Analyses" Vol.1 / 2012 271 THEORETICAL ANALYSIS OF EMPIRICAL RELATIONSHIPS FOR PARETO- DISTRIBUTED SCIENTOMETRIC DATA Vladimir Atanassov, Ekaterina Detheva
More informationNeuro-Fuzzy Modeling of Heat Recovery Steam Generator
International Journal of Mahine Learning and Computing, Vol. 2, No. 5, Otober 202 Neuro-Fuzzy Modeling of Heat Reovery Steam Generator A. Ghaffari, A. Chaibakhsh, and S. Shahhoseini represented in a network
More informationResearch Collection. Mismatched decoding for the relay channel. Conference Paper. ETH Library. Author(s): Hucher, Charlotte; Sadeghi, Parastoo
Researh Colletion Conferene Paper Mismathed deoding for the relay hannel Author(s): Huher, Charlotte; Sadeghi, Parastoo Publiation Date: 2010 Permanent Link: https://doi.org/10.3929/ethz-a-005997152 Rights
More informationMoments and Wavelets in Signal Estimation
Moments and Wavelets in Signal Estimation Edward J. Wegman 1 Center for Computational Statistis George Mason University Hung T. Le 2 International usiness Mahines Abstrat: The problem of generalized nonparametri
More informationSECOND HANKEL DETERMINANT PROBLEM FOR SOME ANALYTIC FUNCTION CLASSES WITH CONNECTED K-FIBONACCI NUMBERS
Ata Universitatis Apulensis ISSN: 15-539 http://www.uab.ro/auajournal/ No. 5/01 pp. 161-17 doi: 10.1711/j.aua.01.5.11 SECOND HANKEL DETERMINANT PROBLEM FOR SOME ANALYTIC FUNCTION CLASSES WITH CONNECTED
More informationMulticomponent analysis on polluted waters by means of an electronic tongue
Sensors and Atuators B 44 (1997) 423 428 Multiomponent analysis on polluted waters by means of an eletroni tongue C. Di Natale a, *, A. Maagnano a, F. Davide a, A. D Amio a, A. Legin b, Y. Vlasov b, A.
More informationThe Possibility of FTL Space Travel by using the Quantum Tunneling Effect through the Light Barrier
ISSN: 19-98 The Possibility of FTL Spae Travel by using the Quantum Tunneling Effet through the Light Barrier Musha T Advaned Si-Teh Researh Organization, -11-7-61, Namiki, Kanazawa-Ku, Yokohama 65, Japan
More informationAdaptive neuro-fuzzy inference system-based controllers for smart material actuator modelling
Adaptive neuro-fuzzy inferene system-based ontrollers for smart material atuator modelling T L Grigorie and R M Botez Éole de Tehnologie Supérieure, Montréal, Quebe, Canada The manusript was reeived on
More informationNonlinear Distributed Estimation Fusion That Reduces Mean Square Error
Nonlinear Distributed Estimation Fusion That Redues Mean Square Error Hua Li Feng Xiao Jie Zhou College of Mathematis Sihuan University Chengdu, Sihuan 60064, China jzhou@su.edu.n X. Rong Li Department
More informationCalibration of Piping Assessment Models in the Netherlands
ISGSR 2011 - Vogt, Shuppener, Straub & Bräu (eds) - 2011 Bundesanstalt für Wasserbau ISBN 978-3-939230-01-4 Calibration of Piping Assessment Models in the Netherlands J. Lopez de la Cruz & E.O.F. Calle
More informationA RUIN MODEL WITH DEPENDENCE BETWEEN CLAIM SIZES AND CLAIM INTERVALS
A RUIN MODEL WITH DEPENDENCE BETWEEN CLAIM SIZES AND CLAIM INTERVALS Hansjörg Albreher a, Onno J. Boxma b a Graz University of Tehnology, Steyrergasse 3, A-8 Graz, Austria b Eindhoven University of Tehnology
More informationModal Horn Logics Have Interpolation
Modal Horn Logis Have Interpolation Marus Kraht Department of Linguistis, UCLA PO Box 951543 405 Hilgard Avenue Los Angeles, CA 90095-1543 USA kraht@humnet.ula.de Abstrat We shall show that the polymodal
More informationONLINE APPENDICES for Cost-Effective Quality Assurance in Crowd Labeling
ONLINE APPENDICES for Cost-Effetive Quality Assurane in Crowd Labeling Jing Wang Shool of Business and Management Hong Kong University of Siene and Tehnology Clear Water Bay Kowloon Hong Kong jwang@usthk
More informationMonte Carlo Simulation of Electron and Radiative Emission from Silicon Diodes
SIMULATION OF SEMICONDUCTOR DEVICES AND PROCESSES Vol. 4 Edited by W. Fihtner, D. Aemmer - Zurih (Switzerland) September 12-14,1991 - Hartung-Gorre 521 Monte Carlo Simulation of Eletron and Radiative Emission
More information3 Tidal systems modelling: ASMITA model
3 Tidal systems modelling: ASMITA model 3.1 Introdution For many pratial appliations, simulation and predition of oastal behaviour (morphologial development of shorefae, beahes and dunes) at a ertain level
More informationOptimization of replica exchange molecular dynamics by fast mimicking
THE JOURNAL OF CHEMICAL PHYSICS 127, 204104 2007 Optimization of replia exhange moleular dynamis by fast mimiking Jozef Hritz and Chris Oostenbrink a Leiden Amsterdam Center for Drug Researh (LACDR), Division
More informationA simple expression for radial distribution functions of pure fluids and mixtures
A simple expression for radial distribution funtions of pure fluids and mixtures Enrio Matteoli a) Istituto di Chimia Quantistia ed Energetia Moleolare, CNR, Via Risorgimento, 35, 56126 Pisa, Italy G.
More informationAircraft CAS Design with Input Saturation Using Dynamic Model Inversion
International Journal of Control, Automation, and Systems Vol., No. 3, September 003 35 Airraft CAS Design with Input Saturation sing Dynami Model Inversion Sangsoo Lim and Byoung Soo Kim Abstrat: This
More information23.1 Tuning controllers, in the large view Quoting from Section 16.7:
Lesson 23. Tuning a real ontroller - modeling, proess identifiation, fine tuning 23.0 Context We have learned to view proesses as dynami systems, taking are to identify their input, intermediate, and output
More informationCollinear Equilibrium Points in the Relativistic R3BP when the Bigger Primary is a Triaxial Rigid Body Nakone Bello 1,a and Aminu Abubakar Hussain 2,b
International Frontier Siene Letters Submitted: 6-- ISSN: 9-8, Vol., pp -6 Aepted: -- doi:.8/www.sipress.om/ifsl.. Online: --8 SiPress Ltd., Switzerland Collinear Equilibrium Points in the Relativisti
More informationThe Tetrahedron Quality Factors of CSDS
MAX PLANCK INSTITUT FÜR AERONOMIE D 37191 Katlenburg-Lindau, Federal Republi of Germany MPAE W 100 94 27 The Tetrahedron Quality Fators of CSDS PATRICK W. DALY 1994 June 7 This report available from http://www.mpae.gwdg.de/~daly/tetra.html
More information11.1 Polynomial Least-Squares Curve Fit
11.1 Polynomial Least-Squares Curve Fit A. Purpose This subroutine determines a univariate polynomial that fits a given disrete set of data in the sense of minimizing the weighted sum of squares of residuals.
More informationarxiv: v1 [cond-mat.stat-mech] 20 Apr 2015
arxiv:154.517v1 [ond-mat.stat-meh] 2 Apr 215 Optimal strategy to apture a skittish lamb wandering near a preipie M. Chupeau Laboratoire de Physique Théorique de la Matière Condensée UMR CNRS 76, Université
More informationLong time stability of regularized PML wave equations
Long time stability of regularized PML wave equations Dojin Kim Email:kimdojin@knu.a.kr Yonghyeon Jeon Email:dydgus@knu.a.kr Philsu Kim Email:kimps@knu.a.kr Abstrat In this paper, we onsider two dimensional
More informationCRITICAL EXPONENTS TAKING INTO ACCOUNT DYNAMIC SCALING FOR ADSORPTION ON SMALL-SIZE ONE-DIMENSIONAL CLUSTERS
Russian Physis Journal, Vol. 48, No. 8, 5 CRITICAL EXPONENTS TAKING INTO ACCOUNT DYNAMIC SCALING FOR ADSORPTION ON SMALL-SIZE ONE-DIMENSIONAL CLUSTERS A. N. Taskin, V. N. Udodov, and A. I. Potekaev UDC
More information