Optimization of Containers Inspection at Port-of-Entry
|
|
- Derrick Reed
- 6 years ago
- Views:
Transcription
1 Optimization of Containers Inspection at Port-of-Entry E. A. Elsayed, Christina Young, Yada Zhu Department of Industrial and Systems Engineering Mingyu Li, Minge Xie Department of Statistics Rutgers University
2 Introduction Containers arrive at a port-of-entry for inspection n attributes tested independently Sensors used to classify attributes of a container as safe (d=0) or suspicious (d=1) based on selected threshold values (T i for station i) Overall accept/reject decision based on specified Boolean function of station decisions 2
3 Simple Container Inspection Procedure Containers arriving at port 95~97% Segregation 3~5% to be inspected Station 1: Image Analysis Fail Result Storage area: Containers to Pass be picked up by receivers Station 2: Physical & Visual Check Pass Result Station 3: PRD & RIID Fail CES Central Examination Site Result Fail Pass 3
4 Inspection Problem Description Threshold levels affect the decisions and probabilities of misclassification at each station Sequence of inspection stations affects the expected cost and time of inspection per container Inspection policy specifies sequence (S) and T i values Objective Minimize expected cost of inspection, cost of container misclassifications, and expected inspection time Decision Variables Sensor threshold values and sequence of stations
5 Modeling Approach Assume the unit s true state (x) is 0 or 1 A container attribute value comes from a mixture of two normal distributions, depending on the unit s true state Let r represent the sensor reading returned from a unit, assumed equal to the attribute value 2 r x = 0 Norm( μ0, σ0 ) 2 r x = 1 Norm( μ, σ ) 1 1 For some value T i at station i If measurement r i > threshold level (T i ), then decision for station i, d i =1 5 If r i T i, d i =0
6 Modeling Approach Assume prior distribution of suspicious containers is known: π = P x = 1 = 1 P x = 0 ( ) ( ) Subscript i is used to indicate association with station i Assume parameters of the two normal distributions are known: μ, μ, σ, σ 0i 1i 0i 1i 6
7 Probabilities of Error ( i = 0 x = 1) P( r T x 1) P d = = i Ti μ 1i =Φ σ1 i i ( i = 1 x = 0) P( r T x 0) P d = > = i T i 0i = 1 Φ i μ σ 0i 7
8 Cost of Misclassification The individual results of stations are combined according to defined system Boolean function to reach an overall inspection decision to accept or reject a container This system decision D may or may not agree with the container s true status Probability of false accept, PFA = P ( D = 0 x = 1) Probability of false reject, PFR = P ( D = 1 x = 0) Two sources of container misclassification cost: c FA = cost of false acceptance (undesired cargo) c FR = cost of false rejection (manual unpack) Total cost: = π + ( 1 π) C PFA c PFR c F FA FR 8
9 Cost of Inspection c i = cost of using i th sensor Expected cost of inspection depends on probability of passing (or failing) sensor i : ( ) ( )( ) ( ) pi = P di = 0 = P di = 0 x= 0 1 π + P di = 0 x= 1 T ( ) i μ 0i Ti μ 1i = 1 π Φ + πφ σ0i σ1 i π q = 1 p = P( d = 1 x = 0)( 1 π ) + P( d = 1 x = 1) i i i i T ( ) i μ 0i Ti μ 1i = 1 π 1 Φ + π 1 Φ σ0i σ1 i π 9
10 Optimum Inspection Sequence The sequence in which stations are visited affects the expected cost of inspection A sequence which minimizes this cost is known as an optimum sequence Theorem 1: For a series Boolean decision function, inspecting attributes i, i = 1,2, K, n in sequential order is optimum (minimizes expected inspection cost) if and only if:. c / q c / q Kc / q n n A container is suspicious if decision for any station i is 1. In other words: F( d, d, K, d ) = d d... d ( ) 1 2 n 1 2 n 10
11 Optimum Inspection Sequence Theorem 2: For a parallel Boolean decision function, inspecting attributes i, i = 1,2, K, n in sequential order is optimum (minimizes expected inspection cost) if and only if: c / p c / p Kc / p In other words: Fd (, d, K, d) = d d... d n n ( ) 1 2 n 1 2 n 11
12 Total Expected Cost Example: parallel Boolean decision function Cost of misclassifications: C F = (False acceptance cost) + (False rejection cost) n n Ti μ 1i Ti μ 0i = πcfa 1 1 Φ + ( 1 π) c FR 1 Φ i= 1 σ1 i i= 1 σ0i 12
13 Total Expected Cost Example: parallel Boolean decision function Cost of inspection: n i 1 CI = c1 + qj ci i = 2 j = 1 n i 1 Tj μ 0j Tj μ 1j = c1 + c i ( 1 π) 1 Φ + π 1 Φ i = 2 j = 1 σ 0j σ 1j Total expected cost: c = C + C total I F 13
14 Inspection Time Time for a container to complete inspection at station i denoted t i Optimum sequence with regard to total expected inspection time can be found with similar method to cost Optimum Cost Sequence Similar Methods Optimum Time Sequence 14
15 Inspection Time t i could be a function of threshold T i, approximated from data Higher Threshold More Pass Decisions Fast Inspection 15
16 Objectives Multi-Objective Problem min { c, t } Sequence, Threshold Minimize the total expected cost including inspection cost and misclassification cost, c = C + C Minimize the total expected inspection time Some trade-off between objectives Goal: find solutions located along Pareto front Find min of weighted objective function fw for various 1, w ( ST, ) = w 2 1ctotal + w2ttotal, w2 = 1-w1 weights Each solution is a Pareto optimal point for multiobjective problem Take advantage of optimal sequence theorem to improve efficiency of algorithms total total total I F t total 16
17 Optimum Sequence for Weighted Objective Given fixed weights, optimum sequence theorem can be adapted Change objective from c i to w 1 c i +w 2 t i For parallel Boolean, minimum sequence condition: wc 1 1+ wt 2 1 wc 1 2+ wt 2 2 wc 1 n + wt 2 n... p p p 1 2 Condition for series Boolean: wc 1 1+ wt 2 1 wc 1 2+ wt 2 2 wc 1 n + wt 2 n... q q q 1 2 n n 17
18 Modified Weighted Sum Algorithm Computationally expensive to solve minimization of weighted objective function Easier if sequence is known Apply optimum sequence given thresholds to compute fw1, w( T) = minf 2 w1, w( ST, ) S 2 Solve min fw 1, w( T ) T 2 Avoiding consideration of all potential sequences improves the efficiency of the algorithm 18
19 Solution Methods Three methods developed and implemented to compare optimality of results Grid search- complete enumeration of discrete threshold values Two methods involve repetitions with various weights to solve min fw, w( T ) and generate 1 2 Pareto-optimal solutions Matlab fmincon function Genetic algorithm Output graphed (Pareto frontier) Time vs. cost expectations T 19
20 Numerical Example Three station system using parallel Boolean decision function Cost fixed for each station, c i = 1 Prior π = Distribution parameters µ 0 = [0 0 0] µ 1 = [1 1 1] σ 0 = [ ] σ 1 = [ ] Cost parameters c FA = c FR = 500 Time related a = [ ] b = [ ]
21 Comparison of Three Solution Methods 12 Grid Search Genetic Algorithm Parallel - Grid Search Parallel - Genetic Algorithm fmincon Parallel - fmincon TIV-set1 TIV-set C o s t Time
22 Pareto-Optimal Solutions Output: Graph of time vs. cost trade-off curve Optimal sequence of sensors Threshold level for each sensor Examples of solutions T 1 T 2 T 3 Sequence Cost Time
23 Conclusions Port-of-entry container inspection problem was formulated to determine optimum threshold levels of sensors by minimizing total expected cost and time Estimate threshold-dependent probabilities of false accept and false reject to calculate expected cost of false classification Sequence of inspection affects expected cost and time of inspection but not probabilities of error Compare three approaches to multi-objective problem GA provides dependable set of Pareto solutions 23
24 Acknowledgment and Website This research is conducted with partial support from ONR grant numbers N , N and NSF grant number NSFSES to Rutgers University For further information and related papers, please visit the DIMACS website 24
Data Quality Assurance System. Hong Kong, China
INtegrated Meteorological Data Quality Assurance System (INDAS) in Hong Kong, China JMA/WMO Workshop on Quality Management in Surface, Climate and Upper-air Observations in RA II, Tokyo, 27-30 July 2010
More informationUmans Complexity Theory Lectures
Complexity Theory Umans Complexity Theory Lectures Lecture 1a: Problems and Languages Classify problems according to the computational resources required running time storage space parallelism randomness
More informationProblem Set 2. MAS 622J/1.126J: Pattern Recognition and Analysis. Due: 5:00 p.m. on September 30
Problem Set MAS 6J/1.16J: Pattern Recognition and Analysis Due: 5:00 p.m. on September 30 [Note: All instructions to plot data or write a program should be carried out using Matlab. In order to maintain
More informationStatistical Pattern Recognition
Statistical Pattern Recognition Support Vector Machine (SVM) Hamid R. Rabiee Hadi Asheri, Jafar Muhammadi, Nima Pourdamghani Spring 2013 http://ce.sharif.edu/courses/91-92/2/ce725-1/ Agenda Introduction
More informationA GA Mechanism for Optimizing the Design of attribute-double-sampling-plan
A GA Mechanism for Optimizing the Design of attribute-double-sampling-plan Tao-ming Cheng *, Yen-liang Chen Department of Construction Engineering, Chaoyang University of Technology, Taiwan, R.O.C. Abstract
More informationMachine Learning, Midterm Exam: Spring 2009 SOLUTION
10-601 Machine Learning, Midterm Exam: Spring 2009 SOLUTION March 4, 2009 Please put your name at the top of the table below. If you need more room to work out your answer to a question, use the back of
More informationFinal Exam December 12, 2017
Introduction to Artificial Intelligence CSE 473, Autumn 2017 Dieter Fox Final Exam December 12, 2017 Directions This exam has 7 problems with 111 points shown in the table below, and you have 110 minutes
More informationIntroductory Econometrics. Review of statistics (Part II: Inference)
Introductory Econometrics Review of statistics (Part II: Inference) Jun Ma School of Economics Renmin University of China October 1, 2018 1/16 Null and alternative hypotheses Usually, we have two competing
More informationBBM402-Lecture 11: The Class NP
BBM402-Lecture 11: The Class NP Lecturer: Lale Özkahya Resources for the presentation: http://ocw.mit.edu/courses/electrical-engineering-andcomputer-science/6-045j-automata-computability-andcomplexity-spring-2011/syllabus/
More informationFinal Exam December 12, 2017
Introduction to Artificial Intelligence CSE 473, Autumn 2017 Dieter Fox Final Exam December 12, 2017 Directions This exam has 7 problems with 111 points shown in the table below, and you have 110 minutes
More informationORIE 4741 Final Exam
ORIE 4741 Final Exam December 15, 2016 Rules for the exam. Write your name and NetID at the top of the exam. The exam is 2.5 hours long. Every multiple choice or true false question is worth 1 point. Every
More informationFinal Exam, Machine Learning, Spring 2009
Name: Andrew ID: Final Exam, 10701 Machine Learning, Spring 2009 - The exam is open-book, open-notes, no electronics other than calculators. - The maximum possible score on this exam is 100. You have 3
More informationECE521 Lecture7. Logistic Regression
ECE521 Lecture7 Logistic Regression Outline Review of decision theory Logistic regression A single neuron Multi-class classification 2 Outline Decision theory is conceptually easy and computationally hard
More informationDefinition: A "system" of equations is a set or collection of equations that you deal with all together at once.
System of Equations Definition: A "system" of equations is a set or collection of equations that you deal with all together at once. There is both an x and y value that needs to be solved for Systems
More informationBiometrics: Introduction and Examples. Raymond Veldhuis
Biometrics: Introduction and Examples Raymond Veldhuis 1 Overview Biometric recognition Face recognition Challenges Transparent face recognition Large-scale identification Watch list Anonymous biometrics
More informationSimplex tableau CE 377K. April 2, 2015
CE 377K April 2, 2015 Review Reduced costs Basic and nonbasic variables OUTLINE Review by example: simplex method demonstration Outline Example You own a small firm producing construction materials for
More informationMachine Learning Practice Page 2 of 2 10/28/13
Machine Learning 10-701 Practice Page 2 of 2 10/28/13 1. True or False Please give an explanation for your answer, this is worth 1 pt/question. (a) (2 points) No classifier can do better than a naive Bayes
More informationQuality Control & Statistical Process Control (SPC)
Quality Control & Statistical Process Control (SPC) DR. RON FRICKER PROFESSOR & HEAD, DEPARTMENT OF STATISTICS DATAWORKS CONFERENCE, MARCH 22, 2018 Agenda Some Terminology & Background SPC Methods & Philosophy
More informationEnergy Flow in Electrical Grids
Energy Flow in Electrical Grids Ruolin Fan, Stephanie Greiner, Ahmed Jasim, Weide Peng, Chihwei Yang Mentor: Steven Rosenthal and Dr. Ildar Gabitov May 13, 2014 Abstract: A theoretical and real model of
More informationNumerical Solution for Multivariable Idle Speed Control of a Lean Burn Natural Gas Engine
Numerical Solution for Multivariable Idle Speed Control of a Lean Burn Natural Gas Engine Arvind Sivasubramanian, Peter H. Meckl Abstract This paper proposes a numerical solution to the idle speed and
More informationThe exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
CS 188 Fall 2015 Introduction to Artificial Intelligence Final You have approximately 2 hours and 50 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
More informationIntroduction to Machine Learning
10-701 Introduction to Machine Learning Homework 2, version 1.0 Due Oct 16, 11:59 am Rules: 1. Homework submission is done via CMU Autolab system. Please package your writeup and code into a zip or tar
More information6-1. Canonical Correlation Analysis
6-1. Canonical Correlation Analysis Canonical Correlatin analysis focuses on the correlation between a linear combination of the variable in one set and a linear combination of the variables in another
More informationAlgorithmisches Lernen/Machine Learning
Algorithmisches Lernen/Machine Learning Part 1: Stefan Wermter Introduction Connectionist Learning (e.g. Neural Networks) Decision-Trees, Genetic Algorithms Part 2: Norman Hendrich Support-Vector Machines
More informationChapter 8 Statistical Quality Control, 7th Edition by Douglas C. Montgomery. Copyright (c) 2013 John Wiley & Sons, Inc.
1 Learning Objectives Chapter 8 Statistical Quality Control, 7th Edition by Douglas C. Montgomery. 2 Process Capability Natural tolerance limits are defined as follows: Chapter 8 Statistical Quality Control,
More informationAnnouncements. Unit 3: Foundations for inference Lecture 3: Decision errors, significance levels, sample size, and power.
Announcements Announcements Unit 3: Foundations for inference Lecture 3:, significance levels, sample size, and power Statistics 101 Mine Çetinkaya-Rundel October 1, 2013 Project proposal due 5pm on Friday,
More informationAnomaly Detection. Jing Gao. SUNY Buffalo
Anomaly Detection Jing Gao SUNY Buffalo 1 Anomaly Detection Anomalies the set of objects are considerably dissimilar from the remainder of the data occur relatively infrequently when they do occur, their
More informationCSL302/612 Artificial Intelligence End-Semester Exam 120 Minutes
CSL302/612 Artificial Intelligence End-Semester Exam 120 Minutes Name: Roll Number: Please read the following instructions carefully Ø Calculators are allowed. However, laptops or mobile phones are not
More informationMulti-Attribute Bayesian Optimization under Utility Uncertainty
Multi-Attribute Bayesian Optimization under Utility Uncertainty Raul Astudillo Cornell University Ithaca, NY 14853 ra598@cornell.edu Peter I. Frazier Cornell University Ithaca, NY 14853 pf98@cornell.edu
More informationISyE 6644 Fall 2014 Test 3 Solutions
1 NAME ISyE 6644 Fall 14 Test 3 Solutions revised 8/4/18 You have 1 minutes for this test. You are allowed three cheat sheets. Circle all final answers. Good luck! 1. [4 points] Suppose that the joint
More informationMulti Objective Optimization
Multi Objective Optimization Handout November 4, 2011 (A good reference for this material is the book multi-objective optimization by K. Deb) 1 Multiple Objective Optimization So far we have dealt with
More informationSimultaneous and sequential detection of multiple interacting change points
Simultaneous and sequential detection of multiple interacting change points Long Nguyen Department of Statistics University of Michigan Joint work with Ram Rajagopal (Stanford University) 1 Introduction
More informationLecture 1: Introduction to Sublinear Algorithms
CSE 522: Sublinear (and Streaming) Algorithms Spring 2014 Lecture 1: Introduction to Sublinear Algorithms March 31, 2014 Lecturer: Paul Beame Scribe: Paul Beame Too much data, too little time, space for
More informationMonotonicity Analysis, Evolutionary Multi-Objective Optimization, and Discovery of Design Principles
Monotonicity Analysis, Evolutionary Multi-Objective Optimization, and Discovery of Design Principles Kalyanmoy Deb and Aravind Srinivasan Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute
More informationLab 5: 16 th April Exercises on Neural Networks
Lab 5: 16 th April 01 Exercises on Neural Networks 1. What are the values of weights w 0, w 1, and w for the perceptron whose decision surface is illustrated in the figure? Assume the surface crosses the
More informationExact Max 2-SAT: Easier and Faster. Martin Fürer Shiva Prasad Kasiviswanathan Pennsylvania State University, U.S.A
Exact Max 2-SAT: Easier and Faster Martin Fürer Shiva Prasad Kasiviswanathan Pennsylvania State University, U.S.A MAX 2-SAT Input: A 2-CNF fomula F with weights on clauses. Good assignment is one that
More informationFinal Exam, Fall 2002
15-781 Final Exam, Fall 22 1. Write your name and your andrew email address below. Name: Andrew ID: 2. There should be 17 pages in this exam (excluding this cover sheet). 3. If you need more room to work
More informationLinear Classification. CSE 6363 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington
Linear Classification CSE 6363 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington 1 Example of Linear Classification Red points: patterns belonging
More informationCS5371 Theory of Computation. Lecture 19: Complexity IV (More on NP, NP-Complete)
CS5371 Theory of Computation Lecture 19: Complexity IV (More on NP, NP-Complete) Objectives More discussion on the class NP Cook-Levin Theorem The Class NP revisited Recall that NP is the class of language
More informationL5 Support Vector Classification
L5 Support Vector Classification Support Vector Machine Problem definition Geometrical picture Optimization problem Optimization Problem Hard margin Convexity Dual problem Soft margin problem Alexander
More informationAutomatic Determination of Uncertainty versus Data Density
Automatic Determination of Uncertainty versus Data Density Brandon Wilde and Clayton V. Deutsch It is useful to know how various measures of uncertainty respond to changes in data density. Calculating
More informationPerformance Evaluation and Comparison
Outline Hong Chang Institute of Computing Technology, Chinese Academy of Sciences Machine Learning Methods (Fall 2012) Outline Outline I 1 Introduction 2 Cross Validation and Resampling 3 Interval Estimation
More informationData Mining: Concepts and Techniques. (3 rd ed.) Chapter 8. Chapter 8. Classification: Basic Concepts
Data Mining: Concepts and Techniques (3 rd ed.) Chapter 8 1 Chapter 8. Classification: Basic Concepts Classification: Basic Concepts Decision Tree Induction Bayes Classification Methods Rule-Based Classification
More informationMidterm: CS 6375 Spring 2015 Solutions
Midterm: CS 6375 Spring 2015 Solutions The exam is closed book. You are allowed a one-page cheat sheet. Answer the questions in the spaces provided on the question sheets. If you run out of room for an
More informationNP-Completeness. Until now we have been designing algorithms for specific problems
NP-Completeness 1 Introduction Until now we have been designing algorithms for specific problems We have seen running times O(log n), O(n), O(n log n), O(n 2 ), O(n 3 )... We have also discussed lower
More informationPower Grid State Estimation after a Cyber-Physical Attack under the AC Power Flow Model
Power Grid State Estimation after a Cyber-Physical Attack under the AC Power Flow Model Saleh Soltan, Gil Zussman Department of Electrical Engineering Columbia University, New York, NY Email: {saleh,gil}@ee.columbia.edu
More informationLeast Squares Classification
Least Squares Classification Stephen Boyd EE103 Stanford University November 4, 2017 Outline Classification Least squares classification Multi-class classifiers Classification 2 Classification data fitting
More informationChapter 1: Introduction
Chapter 1: Introduction Definition: A differential equation is an equation involving the derivative of a function. If the function depends on a single variable, then only ordinary derivatives appear and
More informationREVISION SHEET DECISION MATHS 2 DECISION ANALYSIS
REVISION SHEET DECISION MATHS 2 DECISION ANALYSIS The main ideas are covered in AQA Edexcel MEI OCR D2 Before the exam you should know The meaning of the different kinds of node. Be able to construct a
More information9. Decision-making in Complex Engineering Design. School of Mechanical Engineering Associate Professor Choi, Hae-Jin
9. Decision-making in Complex Engineering Design School of Mechanical Engineering Associate Professor Choi, Hae-Jin Overview of Lectures Week 1: Decision Theory in Engineering Needs for decision-making
More informationNatural Language Processing. Classification. Features. Some Definitions. Classification. Feature Vectors. Classification I. Dan Klein UC Berkeley
Natural Language Processing Classification Classification I Dan Klein UC Berkeley Classification Automatically make a decision about inputs Example: document category Example: image of digit digit Example:
More informationStatistical quality control (SQC)
Statistical quality control (SQC) The application of statistical techniques to measure and evaluate the quality of a product, service, or process. Two basic categories: I. Statistical process control (SPC):
More informationTrade Of Analysis For Helical Gear Reduction Units
Trade Of Analysis For Helical Gear Reduction Units V.Vara Prasad1, G.Satish2, K.Ashok Kumar3 Assistant Professor, Mechanical Engineering Department, Shri Vishnu Engineering College For Women, Andhra Pradesh,
More informationCSC501 Operating Systems Principles. Deadlock
CSC501 Operating Systems Principles Deadlock 1 Last Lecture q Priority Inversion Q Priority Inheritance Protocol q Today Q Deadlock 2 The Deadlock Problem q Definition Q A set of blocked processes each
More information1 [15 points] Frequent Itemsets Generation With Map-Reduce
Data Mining Learning from Large Data Sets Final Exam Date: 15 August 2013 Time limit: 120 minutes Number of pages: 11 Maximum score: 100 points You can use the back of the pages if you run out of space.
More informationMathematics (MEI) Advanced Subsidiary GCE Core 1 (4751) May 2010
Link to past paper on OCR website: http://www.mei.org.uk/files/papers/c110ju_ergh.pdf These solutions are for your personal use only. DO NOT photocopy or pass on to third parties. If you are a school or
More informationCSE 546 Final Exam, Autumn 2013
CSE 546 Final Exam, Autumn 0. Personal info: Name: Student ID: E-mail address:. There should be 5 numbered pages in this exam (including this cover sheet).. You can use any material you brought: any book,
More informationUnsupervised Anomaly Detection for High Dimensional Data
Unsupervised Anomaly Detection for High Dimensional Data Department of Mathematics, Rowan University. July 19th, 2013 International Workshop in Sequential Methodologies (IWSM-2013) Outline of Talk Motivation
More informationD1 Discrete Mathematics The Travelling Salesperson problem. The Nearest Neighbour Algorithm The Lower Bound Algorithm The Tour Improvement Algorithm
1 iscrete Mathematics The Travelling Salesperson problem The Nearest Neighbour lgorithm The Lower ound lgorithm The Tour Improvement lgorithm The Travelling Salesperson: Typically a travelling salesperson
More informationAlpha-Beta Pruning: Algorithm and Analysis
Alpha-Beta Pruning: Algorithm and Analysis Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Introduction Alpha-beta pruning is the standard searching procedure used for 2-person
More informationCS151 Complexity Theory. Lecture 1 April 3, 2017
CS151 Complexity Theory Lecture 1 April 3, 2017 Complexity Theory Classify problems according to the computational resources required running time storage space parallelism randomness rounds of interaction,
More informationTechnical Report. Results from 200 billion iris cross-comparisons. John Daugman. Number 635. June Computer Laboratory
Technical Report UCAM-CL-TR-635 ISSN 1476-2986 Number 635 Computer Laboratory Results from 200 billion iris cross-comparisons John Daugman June 2005 15 JJ Thomson Avenue Cambridge CB3 0FD United Kingdom
More informationClassifier Selection. Nicholas Ver Hoeve Craig Martek Ben Gardner
Classifier Selection Nicholas Ver Hoeve Craig Martek Ben Gardner Classifier Ensembles Assume we have an ensemble of classifiers with a well-chosen feature set. We want to optimize the competence of this
More informationUNIVERSITY of PENNSYLVANIA CIS 520: Machine Learning Final, Fall 2014
UNIVERSITY of PENNSYLVANIA CIS 520: Machine Learning Final, Fall 2014 Exam policy: This exam allows two one-page, two-sided cheat sheets (i.e. 4 sides); No other materials. Time: 2 hours. Be sure to write
More informationIn the Name of God. Lecture 11: Single Layer Perceptrons
1 In the Name of God Lecture 11: Single Layer Perceptrons Perceptron: architecture We consider the architecture: feed-forward NN with one layer It is sufficient to study single layer perceptrons with just
More informationSafety analysis and standards Analyse de sécurité et normes Sicherheitsanalyse und Normen
Industrial Automation Automation Industrielle Industrielle Automation 9.6 Safety analysis and standards Analyse de sécurité et normes Sicherheitsanalyse und Normen Prof Dr. Hubert Kirrmann & Dr. B. Eschermann
More informationEVACUATION PLANNING IN EARTHQUAKE DISASTERS, USING RS & GIS
EVACUATION PLANNING IN EARTHQUAKE DISASTERS, USING RS & GIS Karim Naghdi 1, Ali Mansourian 2, Mohammad Javad Valadanzoej 3, Mohammad Saadatseresht 4 1 Faculty of Geodesy & Geomatics Eng., K.N.Toosi University
More informationLecture 14 : Online Learning, Stochastic Gradient Descent, Perceptron
CS446: Machine Learning, Fall 2017 Lecture 14 : Online Learning, Stochastic Gradient Descent, Perceptron Lecturer: Sanmi Koyejo Scribe: Ke Wang, Oct. 24th, 2017 Agenda Recap: SVM and Hinge loss, Representer
More informationCS246 Final Exam, Winter 2011
CS246 Final Exam, Winter 2011 1. Your name and student ID. Name:... Student ID:... 2. I agree to comply with Stanford Honor Code. Signature:... 3. There should be 17 numbered pages in this exam (including
More informationChapter 7 Comparison of two independent samples
Chapter 7 Comparison of two independent samples 7.1 Introduction Population 1 µ σ 1 1 N 1 Sample 1 y s 1 1 n 1 Population µ σ N Sample y s n 1, : population means 1, : population standard deviations N
More informationAlpha-Beta Pruning: Algorithm and Analysis
Alpha-Beta Pruning: Algorithm and Analysis Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Introduction Alpha-beta pruning is the standard searching procedure used for 2-person
More informationReview Questions REVIEW QUESTIONS 71
REVIEW QUESTIONS 71 MATLAB, is [42]. For a comprehensive treatment of error analysis and perturbation theory for linear systems and many other problems in linear algebra, see [126, 241]. An overview of
More informationSolar Flux Case Study
Solar Flux Case Study q" s Surface q" emit P Mass Vs Temperature Multi-Objective Optimization of a Solar Flux Problem www.ozeninc.com/optimization optimization@ozeninc.com Solar Flux Case Study OVERVIEW
More informationJeff Howbert Introduction to Machine Learning Winter
Classification / Regression Support Vector Machines Jeff Howbert Introduction to Machine Learning Winter 2012 1 Topics SVM classifiers for linearly separable classes SVM classifiers for non-linearly separable
More informationEvaluation. Andrea Passerini Machine Learning. Evaluation
Andrea Passerini passerini@disi.unitn.it Machine Learning Basic concepts requires to define performance measures to be optimized Performance of learning algorithms cannot be evaluated on entire domain
More informationMidterm Exam Solutions, Spring 2007
1-71 Midterm Exam Solutions, Spring 7 1. Personal info: Name: Andrew account: E-mail address:. There should be 16 numbered pages in this exam (including this cover sheet). 3. You can use any material you
More informationSupport Vector Machines. CSE 6363 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington
Support Vector Machines CSE 6363 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington 1 A Linearly Separable Problem Consider the binary classification
More informationClassification CE-717: Machine Learning Sharif University of Technology. M. Soleymani Fall 2012
Classification CE-717: Machine Learning Sharif University of Technology M. Soleymani Fall 2012 Topics Discriminant functions Logistic regression Perceptron Generative models Generative vs. discriminative
More informationAdaptive Binary Integration CFAR Processing for Secondary Surveillance Radar *
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 9, No Sofia 2009 Adaptive Binary Integration CFAR Processing for Secondary Surveillance Radar Ivan Garvanov, Christo Kabakchiev
More informationMarkov Decision Processes
Markov Decision Processes Noel Welsh 11 November 2010 Noel Welsh () Markov Decision Processes 11 November 2010 1 / 30 Annoucements Applicant visitor day seeks robot demonstrators for exciting half hour
More informationEvaluation requires to define performance measures to be optimized
Evaluation Basic concepts Evaluation requires to define performance measures to be optimized Performance of learning algorithms cannot be evaluated on entire domain (generalization error) approximation
More informationUniversity of Cambridge Engineering Part IIB Module 3F3: Signal and Pattern Processing Handout 2:. The Multivariate Gaussian & Decision Boundaries
University of Cambridge Engineering Part IIB Module 3F3: Signal and Pattern Processing Handout :. The Multivariate Gaussian & Decision Boundaries..15.1.5 1 8 6 6 8 1 Mark Gales mjfg@eng.cam.ac.uk Lent
More informationThe Behavior of a Multichannel Queueing System under Three Queue Disciplines
The Behavior of a Multichannel Queueing System under Three Queue Disciplines John K Karlof John Jenkins November 11, 2002 Abstract In this paper we investigate a multichannel channel queueing system where
More informationMa 530 Power Series II
Ma 530 Power Series II Please note that there is material on power series at Visual Calculus. Some of this material was used as part of the presentation of the topics that follow. Operations on Power Series
More informationMathematics (MEI) Advanced Subsidiary GCE Core 1 (4751) June 2010
Link to past paper on OCR website: www.ocr.org.uk The above link takes you to OCR s website. From there you click QUALIFICATIONS, QUALIFICATIONS BY TYPE, AS/A LEVEL GCE, MATHEMATICS (MEI), VIEW ALL DOCUMENTS,
More informationThe University of Texas at Austin Department of Electrical and Computer Engineering. EE381V: Large Scale Learning Spring 2013.
The University of Texas at Austin Department of Electrical and Computer Engineering EE381V: Large Scale Learning Spring 2013 Assignment Two Caramanis/Sanghavi Due: Tuesday, Feb. 19, 2013. Computational
More informationAn optimization model for designing acceptance sampling plan based on cumulative count of conforming run length using minimum angle method
Hacettepe Journal of Mathematics and Statistics Volume 44 (5) (2015), 1271 1281 An optimization model for designing acceptance sampling plan based on cumulative count of conforming run length using minimum
More informationFinal Examination CS 540-2: Introduction to Artificial Intelligence
Final Examination CS 540-2: Introduction to Artificial Intelligence May 7, 2017 LAST NAME: SOLUTIONS FIRST NAME: Problem Score Max Score 1 14 2 10 3 6 4 10 5 11 6 9 7 8 9 10 8 12 12 8 Total 100 1 of 11
More informationCS 170, Fall 1997 Second Midterm Professor Papadimitriou
CS 170, Fall 1997 Second Midterm Professor Papadimitriou Problem #1 (10 Points) Remember the change-maker problem: We are given k integers d 1,..., d k > 0 (the coin denominations) and an integer n. We
More informationCSE-4412(M) Midterm. There are five major questions, each worth 10 points, for a total of 50 points. Points for each sub-question are as indicated.
22 February 2007 CSE-4412(M) Midterm p. 1 of 12 CSE-4412(M) Midterm Sur / Last Name: Given / First Name: Student ID: Instructor: Parke Godfrey Exam Duration: 75 minutes Term: Winter 2007 Answer the following
More informationNumerical algorithms for one and two target optimal controls
Numerical algorithms for one and two target optimal controls Sung-Sik Kwon Department of Mathematics and Computer Science, North Carolina Central University 80 Fayetteville St. Durham, NC 27707 Email:
More informationhypothesis a claim about the value of some parameter (like p)
Testing hypotheses hypothesis a claim about the value of some parameter (like p) significance test procedure to assess the strength of evidence provided by a sample of data against the claim of a hypothesized
More informationCHAPTER 2: QUADRATIC PROGRAMMING
CHAPTER 2: QUADRATIC PROGRAMMING Overview Quadratic programming (QP) problems are characterized by objective functions that are quadratic in the design variables, and linear constraints. In this sense,
More informationAlpha-Beta Pruning: Algorithm and Analysis
Alpha-Beta Pruning: Algorithm and Analysis Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Introduction Alpha-beta pruning is the standard searching procedure used for solving
More informationGeneralization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms
Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms Tadahiko Murata 1, Shiori Kaige 2, and Hisao Ishibuchi 2 1 Department of Informatics, Kansai University 2-1-1 Ryozenji-cho,
More informationCPSC 340 Assignment 4 (due November 17 ATE)
CPSC 340 Assignment 4 due November 7 ATE) Multi-Class Logistic The function example multiclass loads a multi-class classification datasetwith y i {,, 3, 4, 5} and fits a one-vs-all classification model
More informationContinuous Ordinal Clustering: A Mystery Story 1
Continuous Ordinal Clustering: A Mystery Story 1 Melvin F. Janowitz Abstract Cluster analysis may be considered as an aid to decision theory because of its ability to group the various alternatives. There
More informationComputationally Expensive Multi-objective Optimization. Juliane Müller
Computationally Expensive Multi-objective Optimization Juliane Müller Lawrence Berkeley National Lab IMA Research Collaboration Workshop University of Minnesota, February 23, 2016 J. Müller (julianemueller@lbl.gov)
More informationArtificial Neural Networks Examination, March 2004
Artificial Neural Networks Examination, March 2004 Instructions There are SIXTY questions (worth up to 60 marks). The exam mark (maximum 60) will be added to the mark obtained in the laborations (maximum
More informationSVM optimization and Kernel methods
Announcements SVM optimization and Kernel methods w 4 is up. Due in a week. Kaggle is up 4/13/17 1 4/13/17 2 Outline Review SVM optimization Non-linear transformations in SVM Soft-margin SVM Goal: Find
More information