Open World Face Recognition with Credibility and Confidence Measures


 Neal Peters
 1 years ago
 Views:
Transcription
1 Open Worl Face Recognition with Creibility an Confience Measures Fayin Li an Harry Wechsler Department of Computer Science George Mason University Fairfax, VA {fli, Abstract. his paper escribes a novel framework for the Open Worl face recognition problem, where one has to provie for the Reject option. Base upon algorithmic ranomness an transuction, a particular form of inuction, we escribe the CMkNN (ransuction Confience Machine knearest Neighbor) algorithm for Open Worl face recognition. he algorithm propose performs much better than PCA an is comparable with Fisherfaces. In aition to recognition an rejection, the algorithm can assign creibility ( likelihoo ) an confience ( lack of ambiguity ) measures with the ientification ecisions taken.. Introuction he choices facing face recognition systems shoul inclue: ACCEP, REJEC ( is not here ), an AMBIGUI ( nee more information ). he inclusion of the REJEC option, which correspons to an open worl of (face recognition) hypotheses, as complexity to the whole process an makes face recognition much harer compare to the more traitional close worl biometric systems available toay. In aition to seeking how similar or close some probe face image is to each subject in the face gallery set, one nees some measure of confience when making any ientification ecision. his paper escribes a novel methoology for hanling an open worl of hypotheses, incluing the REJEC option, an provies the means to associate creibility an confience measures with each of the ecisions mae regaring HumanID. he propose methoology, base upon ranomness concepts an transuctive learning, is formally valiate on challenging (varying illumination) an large overlapping FERE ata sets. 2. Ranomness an pvalues Confience measures can be base upon universal tests for ranomness, or their approximation. A MartinLof ranomness eficiency (Li an Vitanyi, 997) base on such tests is a universal version of the stanar statistical notion of pvalues. Universal tests for
2 ranomness are not computable an hence one has to approximate the pvalues using nonuniversal tests. We use the pvalue construction in Proerou et al. (200) to efine the quality of information. he assumption use is that ata items are inepenent an are prouce by the same stochastic mechanism. Given a sequence of proximities (istances) between the given training (gallery) set an an unknown sample (test) probe, one quantifies to what extent the (classification) ecision taken is reliable, i.e., nonranom. owars that en one efines the strangeness of the unknown sample probe i with putative label y in relation to the rest of the training set exemplars as: D k j k y ¹ j D ij D y ij ¹ he strangeness measure is the ratio of the sum of the k nearest istances D from the same class (y) to the sum of the k nearest istances from all other classes ( y). he strangeness of an exemplar increases when the istance from the exemplars of the same class becomes larger an when the istance from the other classes becomes smaller. A vali ranomness test (Nouretinov et al., 200) efines then the pvalue measure of a test exemplar with a possible classification assigne to it as p f ( D ) f ( D 2) ( m f ( ) f ( D D new m) ) f ( Dnew ) where f is some monotonic nonecreasing function with f(0) = 0, e.g., f(d) = D, m is the number of training examples, an Dnew is the strangeness measure of a new potential test probe exemplar c new. An alternative efinition available for the pvalue is p( c ) #{ i : D t D }/( m new i new ). Using the pvalue one can now preict the class membership as the one that yiels the largest pvalue, which is efine as the creibility of the assignment mae. he associate confience measure, which is one minus the 2n largest pvalue, inicates how close the first two assignments are. he confience value inicates how improbable the classifications other than the preicte classification are an the creibility value shows how suitable the training set is for the classification of that testing example. One can compare the top ranke assignments, rather than only the first two assignments, an efine aitional confience criteria. Both the creibility an confience measures allow the face recognition moule to aapt to existing conitions an act accoringly. 3. ransuction Confience Machine (CM) knn Another form of learning, beyon inuction, is transuction. Given an unlabele valiation test, in aition to the training set, the task now is to estimate the class for each unlabele
3 pattern in orer to construct the best classifier rule for both the training an valiation sets. CMkNN Algorithm for i = to m y y Fin an store D i an D i Calculate the alpha strangeness values for all the training exemplars Calculate the similarity ist vector as the istances of the new exemplar from all the training exemplars for j = to c o for every training exemplar t classifie as j o if D > ist(t), i = }k, recalculate the alpha value of exemplar t j ti for every training exemplar t classifie as nonj o if D ti j > ist(t), i = }k, recalculate the alpha value of exemplar t Calculate alpha value for the new exemplar classifie as j Calculate pvalue for the new exemplar classifie as j Preict the class with the largest pvalue Output as confience one minus the 2n largest pvalue Output as creibility the largest pvalue he constraints on the (geometric) layout of the learning space an the search for improve classification margins are aresse in this paper using algorithmic ranomness (Vovk et al., 999), universal measures of confience ranomness (Vovk et al., 999), an transuctive confience (learning) machines (CM) (Proerou et al., 200). he experimental ata presente later on that valiates our approach, is base on CMkNN which is an augmente CM using localitybase evience, e.g., the knearest Neighbors (knn) concept. he similarity istances ist (in script) use are shown next. Given two nimensional n vectors, ƒ, the istance measures use are efine as follows: n 2 L (, ) i i L2 (, ) ( ) ( ) i cos (, ) Dice 2 (, ) 2 2 2
4 Jaccar Mah L (, ) 2 2 2(, ) ( ) 6 ( ) Mah 6 cos (, ) where 6 is the scatter matrix of the training ata. For PCA, 6 is iagonal an the iagonal elements are the (eigenvalues) variances of the corresponing components. he Mahalanobis + L istance efine only for PCA is n i i Mah L (, ) 4. Data Collection i i Figure. Face Images Our ata set is rawn from the FERE atabase, which has become a e facto stanar for evaluating face recognition technologies (Phillips et al., 998). he ata set consists of 600 FERE frontal face images corresponing to 200 subjects, which were acquire uner variable illumination an facial expressions. Each subject has three images of size 256x384 with 256 gray scale levels. Face image normalization is carrie out as follows: first, the centers of the eyes of an image are manually etecte, then rotation an scaling transformations align the centers of the eyes to preefine locations, an finally, the face image is croppe to the size of 28x28 to extract the facial region. he extracte facial region is further normalize to zero mean an unit variance. Fig. shows some exemplar images use in our experiments that are alreay croppe to the size of 28x28. Each
5 column in Fig. correspons to one subject. Note that for each subject, two images are ranomly chosen for training, while the remaining image (unseen uring training) is use for testing. he normalize face images are processe to yiel 400 PCA coefficients, accoring to eqs. 7 9 from Liu an Wechsler (2002), an 200 Fisherfaces using FLD (Fisher Linear Discriminant), accoring to eqs. 0 2 from Liu an Wechsler (2002) on a reuce 200 imensional space PCA space. 5. Open Worl Face Recognition Algorithms Open Worl CMkNN Algorithm Calculate the alpha values for all the training exemplars for i = to c o for every training exemplar t classifie as i o for j = to c an j!= i o Assume t is classifie as j, which shoul be rejecte Recalculate the alpha value for all the training exemplars classifie as nonj Calculate alpha value for the exemplar t classifie as j Calculate pvalue for the exemplar t classifie as j Calculate the P max, P mean an P stev (stanar eviation) for the pvalue of exemplar t Calculate the PSR value for exemplar t: PSR = (P max P mean )/P stev Calculate the mean, stev (stanar eviation) for all the PSR values Calculate the mean + 3*stev as threshol for rejection Calculate the istances of the probe exemplar from all the training exemplars for i = to c o Calculate alpha value for the probe exemplar classifie as i Calculate pvalue for the probe exemplar classifie as i Calculate the largest pvalue max for the probe exemplar Calculate the mean an stev for the probe pvalue without max Calculate the PSR value for the probe exemplar: PSR = (max mean)/ stev Reject the probe exemplar if its PSR is less than or equal to the threshol. Otherwise preict the class with the largest pvalue
6 Open Worl {PCA, Fisherfaces} Algorithm for i = to m Fin the maximum intrawithinistance an minimum interbetweenistance Calculate the mean an stanar eviation for all maximum intraistances an minimum interistances: mean intra, mean inter, stev intra an stev inter Calculate mean intra + 3* stev intra as the lower boun of the threshol Calculate mean inter  3* stev inter as the upper boun of the threshol Choose the threshol base on the lower an upper boun Calculate the istances of the probe exemplar from all the training exemplars Fin the minimum istance ist min of the probe exemplar If ist min >= threshol, then reject the probe exemplar Else preict the class with the minimum istance ist min 6. Experimental Results We foun that the best similarity istances for PCA an Fisherfaces are {Mahalanobis + (L, L 2 or cos)} an {cosine, Dice, Jaccar, (Mahalonobis + cos)}, respectively. hose istances are use in our experiments. he experiments reporte were carrie out on the ata escribe in the previous section. Both the gallery an the probe sets consist of 00 subjects, an the overlap portion between the two sets on the average 50 subjects. he recognition rate is the percentage of the subjects whose probe is correctly recognize or rejecte Recognition Rate Recognition Rate hreshol hreshol Figure 2. he Recognition Rate vs hreshol: PCA (Left) an Fisherfaces (Right) Open Worl (PCA an Fisherfaces) Face Recognition he ata was ranomly chosen, the same experiment was run 00 times, an Fig. 2 shows the mean recognition rates for ifferent threshols. he istance measurements for PCA an Fisherfaces, which yiel the best results, are Mahalanobis + L 2 an cosine, respectively. Fig. 2 shows that the best recognition rate for PCA is 77% if the threshol
7 can be chosen correctly, while for Fisherfaces is 9% if the threshol is chosen as its upper boun. he stanar eviation for the best recognition rate for PCA an Fisherfaces are 3.7% an 2.4%, respectively correct rejection correct recognition false recognition 0.08 correct rejection correct recognition wrong recognition pvalue pvalue classes classes Figure 3. est pvalue istribution of rejection, correct an false recognition using PCA with (Mahalanobis + L2) istance (Left) an Fisherfaces with cosine istance (Right) PCA PSR histogram with Mahalanobis + L istance Fisherface PSR histogram with cos istance Figure 4. he PSR value histogram: PCA (Left) an Fisherfaces (Right) CMkNN he ata use are either the (400) PCA or (200) Fisherface components, an k =. he threshol is compute accoring to the algorithm escribe in Sect. 5 base on the training exemplars. he pvalue istributions shown in Fig.3 inicate that the test PSR values are useful for rejection an recognition. Recognition is riven by large PSR values. he best recognition rate using PCA components is 87.87% using the Mahalanobis + L istance, an its stanar eviation is 3.0%. he threshol is 6.57 compute from the PSR histogram shown in Fig. 4 (left). he best recognition rate using Fisherface components is 90% using the cosine istance, an its stanar eviation is 2.7%. he threshol is 9.20 compute from the PSR histogram shown in Fig. 4 (right). CMkNN provies aitional information regaring the creibility an confience in the recognition ecision taken. he corresponing 2D istribution for correct an false
8 recognition is shown in Fig. 5, where one can see that false recognition, for both the PCA an Fisherfaces components, shows up at low values. correct recognition false recognition 0.35 correct recognition false recognition Creibility 0.7 Creibility Confience Confience Figure 5: Distribution of confience an Creibility: PCA (left) an Fisherfaces (right). 7. Conclusions We introuce in this paper a new face recognition algorithm suitable for open worl face recognition. he feasibility an usefulness of the algorithm has been shown on varying illumination an facial expression images rawn from FERE. Furthermore, both creibility an confience measures are provie for both the recognition an rejection ecisions. We plan to use those measures for optimal training of the face recognition system, such that the composition an size of the training set are etermine using active rather than ranom selection 8. References. A. Gammerman, V. Vovk, an V. Vapnik (998), Learning by ransuction. In Uncertainty in Artificial Intelligence, M. Li an P. Vitanyi (997), An Introuction to Kolmogorov Complexity an Its Applications, 2e., SpringerVerlag. 3. C. Liu an H. Wechsler (2002), Gabor Feature Base Classification Using the Enhnace Fisher Linera Discriminant Moel for Face Recognition, IEEE rans. on Image Processing, Vol., No. 4, I. Nouretinov,. Melluish, an V. Vovk (200), Rige Regression Confience Machine, Proc. 7th Int. Conf. on Machine Learning. 5. P. J. Phillips, H. Wechsler, J. Huang, an P. Rauss (998), he FERE Database an Evaluation Proceure for Face Recognition Algorithms, Image an Vision Computing, Vol.6, No.5, K. Proerou, I. Nouretinov, V. Vovk an A. Gammerman (200), ransuctive Confience Machines for Pattern Recognition, R CLRCR002, Royal Holloway University of Lonon. 7. V. Vovk, A. Gammerman, an C. Sauners (999), Machine Leraning Applications of Algorithmic Ranomness, Proc. 6th Int. Conf. on Machine Learning.
CrossOver Analysis Using TTests
Chapter 35 CrossOver Analysis Using ests Introuction his proceure analyzes ata from a twotreatment, twoperio (x) crossover esign. he response is assume to be a continuous ranom variable that follows
More informationUCLA STAT 13 Introduction to Statistical Methods for the Life and Health Sciences. Chapter 9 Paired Data. Paired data. Paired data
UCLA STAT 3 Introuction to Statistical Methos for the Life an Health Sciences Instructor: Ivo Dinov, Asst. Prof. of Statistics an Neurology Chapter 9 Paire Data Teaching Assistants: Jacquelina Dacosta
More informationA New Evaluation Measure for Information Retrieval Systems
A New Evaluation Measure for Information Retrieval Systems Martin Mehlitz martin.mehlitz@ailabor.e Christian Bauckhage Deutsche Telekom Laboratories christian.bauckhage@telekom.e Jérôme Kunegis jerome.kunegis@ailabor.e
More informationSensor Network Localization from Local Connectivity : Performance Analysis for the MDSMAP Algorithm
Sensor Network Localization from Local Connectivity : Performance Analysis for the MDSMAP Algorithm Sewoong Oh an Anrea Montanari Electrical Engineering an Statistics Department Stanfor University, Stanfor,
More informationData Center Power System Reliability Beyond the 9 s: A Practical Approach
Data Center Power System Reliability Beyon the 9 s: A Practical Approach Bill Brown, P.E., Square D Critical Power Competency Center. Abstract Reliability has always been the focus of missioncritical
More informationDetecting Possibly Fraudulent or ErrorProne Survey Data Using Benford s Law
Detecting Possibly Frauulent or ErrorProne Survey Data Using Benfor s Law Davi Swanson, Moon Jung Cho, John Eltinge U.S. Bureau of Labor Statistics 2 Massachusetts Ave., NE, Room 3650, Washington, DC
More information10.2 Systems of Linear Equations: Matrices
SECTION 0.2 Systems of Linear Equations: Matrices 7 0.2 Systems of Linear Equations: Matrices OBJECTIVES Write the Augmente Matrix of a System of Linear Equations 2 Write the System from the Augmente Matrix
More informationPurpose of the Experiments. Principles and Error Analysis. ε 0 is the dielectric constant,ε 0. ε r. = 8.854 10 12 F/m is the permittivity of
Experiments with Parallel Plate Capacitors to Evaluate the Capacitance Calculation an Gauss Law in Electricity, an to Measure the Dielectric Constants of a Few Soli an Liqui Samples Table of Contents Purpose
More informationA Generalization of Sauer s Lemma to Classes of LargeMargin Functions
A Generalization of Sauer s Lemma to Classes of LargeMargin Functions Joel Ratsaby University College Lonon Gower Street, Lonon WC1E 6BT, Unite Kingom J.Ratsaby@cs.ucl.ac.uk, WWW home page: http://www.cs.ucl.ac.uk/staff/j.ratsaby/
More informationView Synthesis by Image Mapping and Interpolation
View Synthesis by Image Mapping an Interpolation Farris J. Halim Jesse S. Jin, School of Computer Science & Engineering, University of New South Wales Syney, NSW 05, Australia Basser epartment of Computer
More informationRobust Reading of Ambiguous Writing
In submission; please o not istribute. Abstract A given entity, representing a person, a location or an organization, may be mentione in text in multiple, ambiguous ways. Unerstaning natural language requires
More informationA Case Study of Applying SOM in Market Segmentation of Automobile Insurance Customers
International Journal of Database Theory an Application, pp.2536 http://x.oi.org/10.14257/ijta.2014.7.1.03 A Case Stuy of Applying SOM in Market Segmentation of Automobile Insurance Customers Vahi Golmah
More informationOn Adaboost and Optimal Betting Strategies
On Aaboost an Optimal Betting Strategies Pasquale Malacaria 1 an Fabrizio Smerali 1 1 School of Electronic Engineering an Computer Science, Queen Mary University of Lonon, Lonon, UK Abstract We explore
More informationGame Theoretic Modeling of Cooperation among Service Providers in Mobile Cloud Computing Environments
2012 IEEE Wireless Communications an Networking Conference: Services, Applications, an Business Game Theoretic Moeling of Cooperation among Service Proviers in Mobile Clou Computing Environments Dusit
More informationStock Market Value Prediction Using Neural Networks
Stock Market Value Preiction Using Neural Networks Mahi Pakaman Naeini IT & Computer Engineering Department Islamic Aza University Paran Branch email: m.pakaman@ece.ut.ac.ir Hamireza Taremian Engineering
More informationCHAPTER 5 : CALCULUS
Dr Roger Ni (Queen Mary, University of Lonon)  5. CHAPTER 5 : CALCULUS Differentiation Introuction to Differentiation Calculus is a branch of mathematics which concerns itself with change. Irrespective
More informationCh 10. Arithmetic Average Options and Asian Opitons
Ch 10. Arithmetic Average Options an Asian Opitons I. Asian Option an the Analytic Pricing Formula II. Binomial Tree Moel to Price Average Options III. Combination of Arithmetic Average an Reset Options
More informationMSc. Econ: MATHEMATICAL STATISTICS, 1995 MAXIMUMLIKELIHOOD ESTIMATION
MAXIMUMLIKELIHOOD ESTIMATION The General Theory of ML Estimation In orer to erive an ML estimator, we are boun to make an assumption about the functional form of the istribution which generates the
More informationRobust Reading: Identification and Tracing of Ambiguous Names
Robust Reaing: Ientification an Tracing of Ambiguous Names Xin Li Paul Morie Dan Roth Department of Computer Science University of Illinois, Urbana, IL 61801 {xli1,morie,anr}@uiuc.eu Abstract A given entity,
More informationThe oneyear nonlife insurance risk
The oneyear nonlife insurance risk Ohlsson, Esbjörn & Lauzeningks, Jan Abstract With few exceptions, the literature on nonlife insurance reserve risk has been evote to the ultimo risk, the risk in the
More informationApplications of Global Positioning System in Traffic Studies. Yi Jiang 1
Applications of Global Positioning System in Traffic Stuies Yi Jiang 1 Introuction A Global Positioning System (GPS) evice was use in this stuy to measure traffic characteristics at highway intersections
More informationELECTRON DIFFRACTION
17 Jul 12 ElectDiff.1 ELECTRON DIFFRACTION In this experiment the existence of wave properties of particles is emonstrate through observation of electron iffraction. The wavelengths of electrons iffracting
More informationOptimizing Multiple Stock Trading Rules using Genetic Algorithms
Optimizing Multiple Stock Traing Rules using Genetic Algorithms Ariano Simões, Rui Neves, Nuno Horta Instituto as Telecomunicações, Instituto Superior Técnico Av. Rovisco Pais, 04000 Lisboa, Portugal.
More informationPractical Lab 2 The Diffraction Grating
Practical Lab 2 The Diffraction Grating OBJECTIVES: 1) Observe the interference pattern prouce when laser light passes through multipleslit grating (a iffraction grating). 2) Graphically verify the wavelength
More informationState of Louisiana Office of Information Technology. Change Management Plan
State of Louisiana Office of Information Technology Change Management Plan Table of Contents Change Management Overview Change Management Plan Key Consierations Organizational Transition Stages Change
More informationOptimal Energy Commitments with Storage and Intermittent Supply
Submitte to Operations Research manuscript OPRE200909406 Optimal Energy Commitments with Storage an Intermittent Supply Jae Ho Kim Department of Electrical Engineering, Princeton University, Princeton,
More informationCalibration of the broad band UV Radiometer
Calibration of the broa ban UV Raiometer Marian Morys an Daniel Berger Solar Light Co., Philaelphia, PA 19126 ABSTRACT Mounting concern about the ozone layer epletion an the potential ultraviolet exposure
More informationModelling and Resolving Software Dependencies
June 15, 2005 Abstract Many Linux istributions an other moern operating systems feature the explicit eclaration of (often complex) epenency relationships between the pieces of software
More informationImage compression predicated on recurrent iterated function systems **
1 Image compression preicate on recurrent iterate function systems ** W. Metzler a, *, C.H. Yun b, M. Barski a a Faculty of Mathematics University of Kassel, Kassel, F. R. Germany b Faculty of Mathematics
More informationIdentification and Tracing of Ambiguous Names: Discriminative and Generative Approaches
Ientification an Tracing of Ambiguous Names: Discriminative an Generative Approaches Xin Li Paul Morie Dan Roth Department of Computer Science University of Illinois, Urbana, IL 61801 {xli1,morie,anr}@uiuc.eu
More informationA Universal Sensor Control Architecture Considering Robot Dynamics
International Conference on Multisensor Fusion an Integration for Intelligent Systems (MFI2001) BaenBaen, Germany, August 2001 A Universal Sensor Control Architecture Consiering Robot Dynamics Frierich
More informationSprings, Shocks and your Suspension
rings, Shocks an your Suspension y Doc Hathaway, H&S Prototype an Design, C. Unerstaning how your springs an shocks move as your race car moves through its range of motions is one of the basics you must
More informationA Data Placement Strategy in Scientific Cloud Workflows
A Data Placement Strategy in Scientific Clou Workflows Dong Yuan, Yun Yang, Xiao Liu, Jinjun Chen Faculty of Information an Communication Technologies, Swinburne University of Technology Hawthorn, Melbourne,
More information. A UML/MARTE DETECTION OF STARVATION AND DEADLOCKS AT THE DESIGN LEVEL IN CONCURRENT SYSTEM
. A UML/MARTE DETECTION OF STARVATION AND DEADLOCKS AT THE DESIGN LEVEL IN CONCURRENT SYSTEM C.Revath Department of computer science an Engineering, Karunya University, comibatore,inia.rcswathiathi@gmail.com
More informationJON HOLTAN. if P&C Insurance Ltd., Oslo, Norway ABSTRACT
OPTIMAL INSURANCE COVERAGE UNDER BONUSMALUS CONTRACTS BY JON HOLTAN if P&C Insurance Lt., Oslo, Norway ABSTRACT The paper analyses the questions: Shoul or shoul not an iniviual buy insurance? An if so,
More informationA New Pricing Model for Competitive Telecommunications Services Using Congestion Discounts
A New Pricing Moel for Competitive Telecommunications Services Using Congestion Discounts N. Keon an G. Ananalingam Department of Systems Engineering University of Pennsylvania Philaelphia, PA 191046315
More informationWeek 4  Linear Demand and Supply Curves
Week 4  Linear Deman an Supply Curves November 26, 2007 1 Suppose that we have a linear eman curve efine by the expression X D = A bp X an a linear supply curve given by X S = C + P X, where b > 0 an
More informationLiquidity and Corporate Debt Market Timing
Liquiity an Corporate Debt Market Timing Marina Balboa Faculty of Economics University of Alicante Phone: +34 965903621 Fax: +34 965903621 marina.balboa@ua.es Belén Nieto (Corresponing author) Faculty
More informationFirewall Design: Consistency, Completeness, and Compactness
C IS COS YS TE MS Firewall Design: Consistency, Completeness, an Compactness Mohame G. Goua an XiangYang Alex Liu Department of Computer Sciences The University of Texas at Austin Austin, Texas 787121188,
More informationIncreasing Packet Delivery Ratio in DSR by Link Prediction
Increasing Packet Delivery Ratio in DSR by Link Preiction Liang Qin Thomas Kunz Department of Systems an Computer Engineering Carleton University, Ottawa, Ontario, Canaa K1S 5B6 {lqin,tkunz}@sce.carleton.ca
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS Contents 1. Moment generating functions 2. Sum of a ranom number of ranom variables 3. Transforms
More informationA Comparison of Performance Measures for Online Algorithms
A Comparison of Performance Measures for Online Algorithms Joan Boyar 1, Sany Irani 2, an Kim S. Larsen 1 1 Department of Mathematics an Computer Science, University of Southern Denmark, Campusvej 55,
More informationMinimizing Makespan in Flow Shop Scheduling Using a Network Approach
Minimizing Makespan in Flow Shop Scheuling Using a Network Approach Amin Sahraeian Department of Inustrial Engineering, Payame Noor University, Asaluyeh, Iran 1 Introuction Prouction systems can be ivie
More informationLecture 8: Expanders and Applications
Lecture 8: Expaners an Applications Topics in Complexity Theory an Pseuoranomness (Spring 013) Rutgers University Swastik Kopparty Scribes: Amey Bhangale, Mrinal Kumar 1 Overview In this lecture, we will
More informationProcedure to Measure the Data Transmission Speed in Mobile Networks in Accordance with the LTE Standard (Methodical procedure)
Prague, 15 August 2013 Proceure to Measure the Data Transmission Spee in Mobile Networks in Accorance with the LTE Stanar (Methoical proceure Publishe in connection with the Tener for the awar of the rights
More informationDEVELOPMENT OF A BRAKING MODEL FOR SPEED SUPERVISION SYSTEMS
DEVELOPMENT OF A BRAKING MODEL FOR SPEED SUPERVISION SYSTEMS Paolo Presciani*, Monica Malvezzi #, Giuseppe Luigi Bonacci +, Monica Balli + * FS Trenitalia Unità Tecnologie Materiale Rotabile Direzione
More informationAverageCase Analysis of a Nearest Neighbor Algorithm. Moett Field, CA USA. in accuracy. neighbor.
From Proceeings of the Thirteenth International Joint Conference on Articial Intelligence (1993). Chambery, France: Morgan Kaufmann AverageCase Analysis of a Nearest Neighbor Algorithm Pat Langley Learning
More informationIRMA InfraRed Motion Analyzer Automatic Passenger Counter (APC) System. Technical Documentation of the Fourth Generation
IRMA InfraRe Motion Analyzer Automatic Paenger Counter (APC) Sytem Technical Documentation of the Fourth Generation Part: General (Accuracy) Englih Verion pffile of the online ocumentation ate on the
More informationPerformance of 2D versus 3D Topographic Representations for Different Task Types
Performance of versus Topographic Representations for Different s Debra MacIvor Savage, Eric N. Wiebe an Hugh A. Devine North Carolina State University Raleigh, North Carolina In this stuy, a performance
More informationFace Recognition using SIFT Features
Face Recognition using SIFT Features Mohamed Aly CNS186 Term Project Winter 2006 Abstract Face recognition has many important practical applications, like surveillance and access control.
More informationPatch Complexity, Finite Pixel Correlations and Optimal Denoising
Patch Complexity, Finite Pixel Correlations an Optimal Denoising Anat Levin Boaz Naler Freo Duran William T. Freeman Weizmann Institute MIT CSAIL Abstract. Image restoration tasks are illpose problems,
More informationHOST SELECTION METHODOLOGY IN CLOUD COMPUTING ENVIRONMENT
International Journal of Avance Research in Computer Engineering & Technology (IJARCET) HOST SELECTION METHODOLOGY IN CLOUD COMPUTING ENVIRONMENT Pawan Kumar, Pijush Kanti Dutta Pramanik Computer Science
More informationAn intertemporal model of the real exchange rate, stock market, and international debt dynamics: policy simulations
This page may be remove to conceal the ientities of the authors An intertemporal moel of the real exchange rate, stock market, an international ebt ynamics: policy simulations Saziye Gazioglu an W. Davi
More informationComparative study regarding the methods of interpolation
Recent Avances in Geoesy an Geomatics Engineering Comparative stuy regaring the methos of interpolation PAUL DANIEL DUMITRU, MARIN PLOPEANU, DRAGOS BADEA Department of Geoesy an Photogrammetry Faculty
More informationINFLUENCE OF GPS TECHNOLOGY ON COST CONTROL AND MAINTENANCE OF VEHICLES
1 st Logistics International Conference Belgrae, Serbia 2830 November 2013 INFLUENCE OF GPS TECHNOLOGY ON COST CONTROL AND MAINTENANCE OF VEHICLES Goran N. Raoičić * University of Niš, Faculty of Mechanical
More informationLearningBased Summarisation of XML Documents
LearningBase Summarisation of XML Documents Massih R. Amini Anastasios Tombros Nicolas Usunier Mounia Lalmas {name}@poleia.lip6.fr {first name}@cs.qmul.ac.uk University Pierre an Marie Curie Queen Mary,
More informationCapacitive mtouch Sensing Solutions
Capacitive mtouch Sensing Solutions Design Guielines 2008 Microchip Technology Incorporate. ll Rights Reserve. Slie 1 Hello, my name is Marc McComb, Technical Training Engineer in the Security Microcontroller
More informationUniversal Gravity Based on the Electric Universe Model
Universal Gravity Base on the Electric Universe Moel By Frerik Nygaar frerik_nygaar@hotmail.com Nov 015, Porto Portugal. Introuction While most people are aware of both Newton's Universal Law of Gravity
More informationStochastic Modeling of MEMS Inertial Sensors
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 10, No Sofia 010 Stochastic Moeling of MEMS Inertial Sensors Petko Petkov, Tsonyo Slavov Department of Automatics, Technical
More informationA SPATIAL UNIT LEVEL MODEL FOR SMALL AREA ESTIMATION
REVSTAT Statistical Journal Volume 9, Number 2, June 2011, 155 180 A SPATIAL UNIT LEVEL MODEL FOR SMALL AREA ESTIMATION Authors: Pero S. Coelho ISEGI Universiae Nova e Lisboa, Portugal Faculty of Economics,
More informationDetermining the Rank of the Beta Matrix in Linear Asset Pricing Models *
Determining the Rank of the Beta Matrix in Linear Asset Pricing Moels * Seung C. Ahn a Arizona State University an Sogang University Alex R. Horenstein b IAM School of Business Na Wang c Arizona State
More informationDi usion on Social Networks. Current Version: June 6, 2006 Appeared in: Économie Publique, Numéro 16, pp 316, 2005/1.
Di usion on Social Networks Matthew O. Jackson y Caltech Leeat Yariv z Caltech Current Version: June 6, 2006 Appeare in: Économie Publique, Numéro 16, pp 316, 2005/1. Abstract. We analyze a moel of i
More information1 HighDimensional Space
Contents HighDimensional Space. Properties of HighDimensional Space..................... 4. The HighDimensional Sphere......................... 5.. The Sphere an the Cube in Higher Dimensions...........
More informationUsing Stein s Method to Show Poisson and Normal Limit Laws for Fringe Subtrees
AofA 2014, Paris, France DMTCS proc. (subm., by the authors, 1 12 Using Stein s Metho to Show Poisson an Normal Limit Laws for Fringe Subtrees Cecilia Holmgren 1 an Svante Janson 2 1 Department of Mathematics,
More informationIf you have ever spoken with your grandparents about what their lives were like
CHAPTER 7 Economic Growth I: Capital Accumulation an Population Growth The question of growth is nothing new but a new isguise for an ageol issue, one which has always intrigue an preoccupie economics:
More informationImproving Direct Marketing Profitability with Neural Networks
Volume 9 o.5, September 011 Improving Direct Marketing Profitability with eural etworks Zaiyong Tang Salem State University Salem, MA 01970 ABSTRACT Data mining in irect marketing aims at ientifying the
More informationHardness Evaluation of Polytetrafluoroethylene Products
ECNDT 2006  Poster 111 Harness Evaluation of Polytetrafluoroethylene Proucts T.A.KODINTSEVA, A.M.KASHKAROV, V.A.KALOSHIN NPO Energomash Khimky, Russia A.P.KREN, V.A.RUDNITSKY, Institute of Applie Physics
More information! # % & ( ) +,,),. / 0 1 2 % ( 345 6, & 7 8 4 8 & & &&3 6
! # % & ( ) +,,),. / 0 1 2 % ( 345 6, & 7 8 4 8 & & &&3 6 9 Quality signposting : the role of online information prescription in proviing patient information Liz Brewster & Barbara Sen Information School,
More informationEstimating the drilling rate in Ahvaz oil field
J Petrol Explor Pro Technol (2013) 3:169 173 DOI 10.1007/s1320201300603 ORIGINAL PAPER  PRODUCTION ENGINEERING Estimating the rilling rate in Ahvaz oil fiel Masou Cheraghi Seifaba Peyman Ehteshami
More informationImplementing IP Traceback in the Internet An ISP Perspective
Implementing IP Traceback in the Internet An ISP Perspective Dong Wei, Stuent Member, IEEE, an Nirwan Ansari, Senior Member, IEEE AbstractDenialofService (DoS) attacks consume the resources of remote
More information_Mankiw7e_CH07.qxp 3/2/09 9:40 PM Page 189 PART III. Growth Theory: The Economy in the Very Long Run
189220_Mankiw7e_CH07.qxp 3/2/09 9:40 PM Page 189 PART III Growth Theory: The Economy in the Very Long Run 189220_Mankiw7e_CH07.qxp 3/2/09 9:40 PM Page 190 189220_Mankiw7e_CH07.qxp 3/2/09 9:40 PM Page
More informationExploratory Optimal Latin Hypercube Designs for Computer Simulated Experiments
Thailan Statistician July 0; 9() : 793 http://statassoc.or.th Contribute paper Exploratory Optimal Latin Hypercube Designs for Computer Simulate Experiments Rachaaporn Timun [a,b] Anamai Nauom* [a,b]
More informationFeedback linearization control of a twolink robot using a multicrossover genetic algorithm
Available online at www.scienceirect.com Expert Systems with Applications 3 (009) 454 459 Short communication Feeback linearization control of a twolink robot using a multicrossover genetic algorithm
More informationRelative Frequency Histogram. Density Curve. Continuous Distribution. Continuous Random Variable. Meaning of Area Under Curve. Normal Distribution
Relative Frequency Histogram Percent Moeling Continuous 10 0 30 40 0 60 70 0 90 100 110 Test scores 1 Density function, f (x) Density Curve Percent A smooth curve that fit the istribution 10 0 30 40 0
More informationOptimal Control Policy of a Production and Inventory System for multiproduct in Segmented Market
RATIO MATHEMATICA 25 (2013), 29 46 ISSN:15927415 Optimal Control Policy of a Prouction an Inventory System for multiprouct in Segmente Market Kuleep Chauhary, Yogener Singh, P. C. Jha Department of Operational
More information6.3 Microbial growth in a chemostat
6.3 Microbial growth in a chemostat The chemostat is a wielyuse apparatus use in the stuy of microbial physiology an ecology. In such a chemostat also known as continuousflow culture), microbes such
More informationMeasures of distance between samples: Euclidean
4 Chapter 4 Measures of istance between samples: Eucliean We will be talking a lot about istances in this book. The concept of istance between two samples or between two variables is funamental in multivariate
More informationEvaluation of Life Cycle Cost Analysis Methodologies
www.corporateenvstrategy.com Life Cycle Cost Analysis Evaluation of Life Cycle Cost Analysis Methoologies Senthil Kumaran Durairaj, S.K. Ong, A.Y.C. Nee an R.B.H. Tan* After the emergence of Life Cycle
More informationGoal Programming. Multicriteria Decision Problems. Goal Programming Goal Programming: Formulation
Goal Programming Multicriteria Decision Problems Goal Programming Goal Programming: Formulation Goal Programming?? How o you fin optimal solutions to the following? Multiple criterion for measuring performance
More informationProfessional Level Options Module, Paper P4(SGP)
Answers Professional Level Options Moule, Paper P4(SGP) Avance Financial Management (Singapore) December 2007 Answers Tutorial note: These moel answers are consierably longer an more etaile than woul be
More informationHeuristics for allocation of reconfigurable resources in a serial line with reliability considerations
IIE Transactions ISSN: 0740817X (Print) 15458830 (Online) Journal homepage: http://www.tanfonline.com/loi/uiie20 Heuristics for allocation of reconfigurable resources in a serial line with reliability
More informationSupporting Adaptive Workflows in Advanced Application Environments
Supporting aptive Workflows in vance pplication Environments Manfre Reichert, lemens Hensinger, Peter Daam Department Databases an Information Systems University of Ulm, D89069 Ulm, Germany Email: {reichert,
More informationThroughputScheduler: Learning to Schedule on Heterogeneous Hadoop Clusters
ThroughputScheuler: Learning to Scheule on Heterogeneous Haoop Clusters Shehar Gupta, Christian Fritz, Bob Price, Roger Hoover, an Johan e Kleer Palo Alto Research Center, Palo Alto, CA, USA {sgupta, cfritz,
More informationForecasting and Staffing Call Centers with Multiple Interdependent Uncertain Arrival Streams
Forecasting an Staffing Call Centers with Multiple Interepenent Uncertain Arrival Streams Han Ye Department of Statistics an Operations Research, University of North Carolina, Chapel Hill, NC 27599, hanye@email.unc.eu
More informationWeb Appendices to Selling to Overcon dent Consumers
Web Appenices to Selling to Overcon ent Consumers Michael D. Grubb MIT Sloan School of Management Cambrige, MA 02142 mgrubbmit.eu www.mit.eu/~mgrubb May 2, 2008 B Option Pricing Intuition This appenix
More informationAchieving quality audio testing for mobile phones
Test & Measurement Achieving quality auio testing for mobile phones The auio capabilities of a cellular hanset provie the funamental interface between the user an the raio transceiver. Just as RF testing
More informationTraffic Delay Studies at Signalized Intersections with Global Positioning System Devices
Traffic Delay Stuies at Signalize Intersections with Global Positioning System Devices THIS FEATURE PRESENTS METHODS FOR APPLYING GPS DEVICES TO STUDY TRAFFIC DELAYS AT SIGNALIZED INTERSECTIONS. MOST OF
More informationPredicting Television Ratings and Its Application to Taiwan Cable TV Channels
2n International Symposium on Computer, Communication, Control an Automation (3CA 2013) Preicting Television Ratings an Its Application to Taiwan Cable TV Channels HuiLing Huang Department of Biological
More informationMODELLING OF TWO STRATEGIES IN INVENTORY CONTROL SYSTEM WITH RANDOM LEAD TIME AND DEMAND
art I. robobabilystic Moels Computer Moelling an New echnologies 27 Vol. No. 23 ransport an elecommunication Institute omonosova iga V9 atvia MOEING OF WO AEGIE IN INVENOY CONO YEM WIH ANOM EA IME AN
More informationChapter 2 Review of Classical Action Principles
Chapter Review of Classical Action Principles This section grew out of lectures given by Schwinger at UCLA aroun 1974, which were substantially transforme into Chap. 8 of Classical Electroynamics (Schwinger
More informationUnsteady Flow Visualization by Animating EvenlySpaced Streamlines
EUROGRAPHICS 2000 / M. Gross an F.R.A. Hopgoo Volume 19, (2000), Number 3 (Guest Eitors) Unsteay Flow Visualization by Animating EvenlySpace Bruno Jobar an Wilfri Lefer Université u Littoral Côte Opale,
More informationCALCULATION INSTRUCTIONS
Energy Saving Guarantee Contract ppenix 8 CLCULTION INSTRUCTIONS Calculation Instructions for the Determination of the Energy Costs aseline, the nnual mounts of Savings an the Remuneration 1 asics ll prices
More informationS&P Systematic Global Macro Index (S&P SGMI) Methodology
S&P Systematic Global Macro Inex (S&P SGMI) Methoology May 2014 S&P Dow Jones Inices: Inex Methoology Table of Contents Introuction 3 Overview 3 Highlights 4 The S&P SGMI Methoology 4 Inex Family 5 Inex
More informationPROBLEMS. A.1 Implement the COINCIDENCE function in sumofproducts form, where COINCIDENCE = XOR.
724 APPENDIX A LOGIC CIRCUITS (Corrispone al cap. 2  Elementi i logica) PROBLEMS A. Implement the COINCIDENCE function in sumofproucts form, where COINCIDENCE = XOR. A.2 Prove the following ientities
More informationClassspecific Sparse Coding for Learning of Object Representations
Classspecific Sparse Coding for Learning of Object Representations Stephan Hasler, Heiko Wersing, and Edgar Körner Honda Research Institute Europe GmbH CarlLegienStr. 30, 63073 Offenbach am Main, Germany
More informationHull, Chapter 11 + Sections 17.1 and 17.2 Additional reference: John Cox and Mark Rubinstein, Options Markets, Chapter 5
Binomial Moel Hull, Chapter 11 + ections 17.1 an 17.2 Aitional reference: John Cox an Mark Rubinstein, Options Markets, Chapter 5 1. OnePerio Binomial Moel Creating synthetic options (replicating options)
More informationEmergence of heterogeneity in acute leukemias
Stiehl et al. Biology Direct (2016) 11:51 DOI 10.1186/s1306201601541 RESEARCH Open Access Emergence of heterogeneity in acute leukemias Thomas Stiehl 1,2,3*, Christoph Lutz 4 an Anna MarciniakCzochra
More informationCost Efficient Datacenter Selection for Cloud Services
Cost Efficient Datacenter Selection for Clou Services Hong u, Baochun Li henryxu, bli@eecg.toronto.eu Department of Electrical an Computer Engineering University of Toronto Abstract Many clou services
More informationA secure face tracking system
International Journal of Information & Computation Technology. ISSN 09742239 Volume 4, Number 10 (2014), pp. 959964 International Research Publications House http://www. irphouse.com A secure face tracking
More informationWrites of Passage: Writing an Empirical Journal Article
LYNN WHITE University of Nebraska Lincoln Writes of Passage: Writing an Empirical Journal Article This article provies avice about preparing research reports for submission to professional journals in
More information