CS345a: Data Mining Jure Leskovec and Anand Rajaraman Stanford University
|
|
- Bryce Fisher
- 6 years ago
- Views:
Transcription
1 CS345a: Data Mnng Jure Leskovec and Anand Rajaraman Stanford Unversty
2 HW3 s out Poster sesson s on last day of classes: Thu March 11 at 4:15 Reports are due March 14 Fnal s March 18 at 12:15 Open book, open notes No laptop 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 2
3 Whch h s best tlnear separator? Data: Examples: (x 1, y 1 ), (x n, y n ) Example : x =(x (1) 1,, x (d) 1 ) y {1, {, +1} Inner product: x= 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 3
4 x=0 Confdence: fd =(x )y For alldataponts: = 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 4
5 Maxmze the margn: + + Good accordng to ntuton, theory & practce + max, s. t., y ( x ) + x=0 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 5
6 Canoncal hyperplanes: Projecton of x on plane x=0: x x 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 6
7 Maxmzng the margn: max, s. t., y ( x ) Equvalent: mn 2 s. t., y ( x ) 1 SVM th hard constrants 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 7
8 If data not separable ntroduce penalty 1 mn C # number of 2 s. t., y ( x ) 1 Choose C based on cross valdaton Ho to penalze mstakes? tk mstakes x=0 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 8
9 Introduce slack varables : mn 1 C n, s. t., y Hnge loss: ( x ) x=0 For each datapont: If margn>1, don t care If margn<1, pay lnear penalty 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 9
10 SVM n the natural form arg mn Where: f f () n 1 ( ) C max{0,1 2 1 y ( x )} 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 10
11 Use quadratc solver: n 1 Use quadratc solver: Mnmze quadratc functon S bj tt l t t n x y t s C 1 ) ( 2 1 mn 1 0, Subject to lnear constrants Stochastc gradent descent: M x y t s 1 ) (,.. Mnmze: n x y C f )} ( max{0,1 2 1 ) ( Update: y x L f t t ), ( ) ( ' 1 2 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 11 f t t ) (
12 Example by Leon Bottou: Reuters RCV1 document corpus m=781k tranng examples, 23k test texamples d=50k features Tranng tme: 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 12
13 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 13
14 What f e subsample the dataset? SGD on full dataset vs. Conjugate gradent on n tranng examples 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 14
15 Need to choose learnng rate : t Leon suggests: L'( ) 1 t t Select small subsample Try varous rates Pck the one that t most reduces the loss Use for next 100k teratons on the full dataset 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 15
16 Stoppng crtera: Ho many teratons of SGD? Early stoppng th cross valdaton Create valdaton set Montor cost functon on the valdaton set Stop hen loss stops decreasng Early stoppng a pror Extract to dsjont subsamples A and B of tranng data Determne the number of epochs k by tranng on A, stop by valdatng on B Tran for k epochs on the full dataset 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 16
17 Kernel functon: K(x,x j ) = (x ) (x j ) Does the SVM kernel trck stll ork? Yes (but not thout a prce): Represent th ts kernel expanson: = (x ) Usually: dl()/d= (x j ) Then update at epoch t by combnng : t = (1 ) t + 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 17
18 [ShalevShartz et al. ICML 07] We had before: Can replace C th : 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 18
19 [ShalevShartz et al. ICML 07] A t = S At t = 1 Subgradent method Stochastc gradent Subgradent Projecton 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 19
20 [ShalevShartz et al. ICML 07] Choosng A =1 n t and a lnear kernel over R Theorem [ShalevShartz et al. 07]: Runtme requred for Pegasos to fnd accurate soluton th prob. >1 Runtme depends d on number of features n Does not depend on #examples m Depends on dffculty of problem ( and ) 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 20
21 SVM and structured output predcton Settng: Assume: Data s..d. from Gven: Tranng sample Goal: Fnd functon from nput space X to output Y Complex objects 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 21
22 Examples: Natural Language Parsng Gven a sequence of ords x, predct the parse tree y Dependences from structural constrants, snce y has to be a tree y S x The dog chased the cat NP VP NP Det N V Det N 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 22
23 Approach: ve as multclass classfcaton task Every complex output s one class Problems: Exponentally many classes! Ho to predct effcently? Ho to learn effcently? Potentally huge model! Manageable number of features? y 1 V VP N S V VP Det NP N x The dog chased the cat y 2 NP Det N S V VP Det NP N y k VP Det N NP S V Det NP N 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 23
24 Feature vector descrbes match beteen x and y Learn sngle eght vector and rank by Hardmargn optmzaton problem: 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 24
25 [Yue et al., SIGIR 07] Rankng: Gven a query x, predct a rankng y. Dependences beteen bt results (e.g. avod redundant hts) Loss functon over rankngs (e.g. AvgPrec) x y 1. KernelMachnes SVM 2. SVMLght 3. Learnng th h Kernels 4. SV Meppen Fan Club 5. Servce Master & Co. 6. School of Volunteer Management 7. SV Mattersburg Onlne 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 25
26 [Yue et al., SIGIR 07] Gven: a complete (eak) rankng of documents for a query Predct: rankng for the nput query and document set The true labelng s a rankng here the relevant documents are all ranked n the front, eg e.g., An ncorrect labelng s any other rankng, e.g., g, There are ntractable many rankngs, thus an ntractable t number of constrants! t 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 26
27 [Yue et al., SIGIR 07] Let x s a set of documents/query examples Let y denote a eak rankng (parse orderngs) y j {1, +1} j 2 SVM objectve functon: C Constrants t are df defned dfor each ncorrect rankng y over the set of documents x: 1 2 y' y : T ( y, x) T ( y', x) ( y, y') s the match beteen target and predcton 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 27
28 [Yue et al., SIGIR 07] Loss: Average precson s the average of the precson scores at the rank locatons of each relevant document. Ex: has average precson /2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 28
29 [Yue et al., SIGIR 07] Maxmze: subject to: here: and: y' ( y', x) C y : : rel j:! rel T T ( y, x ) ( y', x ) ( y, y') y' j ( x x ( y, y') 1 AvgPrec( y') j ) After learnng, predct by sortng on x 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 29
30 [Yue et al., SIGIR 07] Orgnal SVM Problem Exponental constrants t Most are domnated by a small set of mportant constrants Structural SVM Approach Repeatedly fnds the next most volated constrant untl set of constrants s a good approxmaton. 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 30
31 [Yue et al., SIGIR 07] Orgnal SVM Problem Exponental constrants t Most are domnated by a small set of mportant constrants Structural SVM Approach Repeatedly fnds the next most volated constrant untl set of constrants s a good approxmaton. 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 31
32 [Yue et al., SIGIR 07] Orgnal SVM Problem Exponental constrants t Most are domnated by a small set of mportant constrants Structural SVM Approach Repeatedly fnds the next most volated constrant untl set of constrants s a good approxmaton. 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 32
33 [Yue et al., SIGIR 07] Orgnal SVM Problem Exponental constrants t Most are domnated by a small set of mportant constrants Structural SVM Approach Repeatedly fnds the next most volated constrant untl set of constrants s a good approxmaton. 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 33
34 Input: REPEAT FOR Compute ENDFOR IF _ Fnd most volated constrant t Volated by more than? ENDIF optmze StructSVMover Add constrant to orkng set UNTIL has not changed durng teraton [Jo06] [JoFnYu08] 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 34
35 Cuttng plane algorthm: STEP 1: Solve the SVM objectve functon usng only the current orkng set of constrants STEP 2: Usng the model learned n STEP 1, fnd the most volated constrant from the exponental set of constrants STEP 3: If the constrant returned n STEP 2 s more volated than the most volated constrant the orkng set by some small constant, add that constrant to the orkng set Repeat STEP 13 untl no addtonal constrants are added. Return the most recent model that as traned n STEP 1. STEP 13 s guaranteed to loop for at most a polynomal number of teratons. [Tsochantards et al. 2005] 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 35
36 StructuralSVM SVM s an oracle frameork Requres subroutne for fndng the most volated constrant Dependents on the formulaton of loss functon and jont feature representaton Exponental number of constrants! Effcent algorthm n the case of optmzng Mean Avg. Prec. (MAP): MAP s nvarant on the order of documents thn a relevance class 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 36
37 [Yue et al., SIGIR 07] T T H ( y'; ) ( y, y') y' ( x x ) y j : rel j:! rel Observaton: MAP s nvarant on the order of documents thn a relevance class Sappng to relevant or nonrelevant documents does not change MAP. Jont SVM score s optmzed by sortng by document score, x j Reduces to fndng an nterleavng beteen tosorted lstsofdocuments 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 37
38 ( y'; ) ( y, y') T T H y' ( x x ) y j : rel j:! rel j Start th perfect rankng Consder sappng adjacent relevant/nonrelevant documents 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 38
39 ( y'; ) ( y, y') T T H y' ( x x ) y j : rel j:! rel j Start th perfect rankng Consder sappng adjacent relevant/nonrelevant documents Fnd the best feasble rankng of the nonrelevant document 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 39
40 ( y'; ) ( y, y') T T H y' ( x x ) y j : rel j:! rel j Start th perfect rankng Consder sappng adjacent relevant/nonrelevant documents Fnd the best feasble rankng of the nonrelevant document Repeat for next nonrelevant document 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 40
41 ( y'; ) ( y, y') T T H y' ( x x ) y j : rel j:! rel j Start th perfect rankng Consder sappng adjacent relevant/nonrelevant documents Fnd the best feasble rankng of the nonrelevant document Repeat for next nonrelevant document Never ant to sap past prevous nonrelevant document 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 41
42 ( y'; ) ( y, y') T T H y' ( x x ) y j : rel j:! rel j Start th perfect rankng Consder sappng adjacent relevant/nonrelevant documents Fnd the best feasble rankng of the nonrelevant document Repeat for next nonrelevant document Never ant to sap past prevous nonrelevant document Repeat untl all nonrelevant documents have been consdered 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 42
43 SVM Formulaton SVMs optmze a tradeoff beteen model complexty and MAP loss Exponental number of constrants (one for each ncorrect rankng) Structural SVMs fnds a small subset of mportant constrants Requres subprocedure to fnd most volated constrant Fnd Most Volated Constrant Loss functon nvarant to reorderng of relevant documents SVM score mposes an orderng of the relevant documents Fndng nterleavng of to sorted lsts Loss functon has certan monotonc propertes Effcent algorthm 3/2/2010 Jure Leskovec & Anand Rajaraman, Stanford CS345a: Data Mnng 43
Dynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University
Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout
More informationLearning Ensembles of Convolutional Neural Networks
Learnng Ensembles of Convolutonal Neural Networks Lran Chen The Unversty of Chcago Faculty Mentor: Greg Shakhnarovch Toyota Technologcal Insttute at Chcago 1 Introducton Convolutonal Neural Networks (CNN)
More informationTarget Response Adaptation for Correlation Filter Tracking
Target Response Adaptaton for Correlaton Flter Tracng Adel Bb, Matthas Mueller, and Bernard Ghanem Image and Vdeo Understandng Laboratory IVUL, Kng Abdullah Unversty of Scence and Technology KAUST, Saud
More informationNetwork Reconfiguration in Distribution Systems Using a Modified TS Algorithm
Network Reconfguraton n Dstrbuton Systems Usng a Modfed TS Algorthm ZHANG DONG,FU ZHENGCAI,ZHANG LIUCHUN,SONG ZHENGQIANG School of Electroncs, Informaton and Electrcal Engneerng Shangha Jaotong Unversty
More informationResearch of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b
2nd Internatonal Conference on Computer Engneerng, Informaton Scence & Applcaton Technology (ICCIA 207) Research of Dspatchng Method n Elevator Group Control System Based on Fuzzy Neural Network Yufeng
More informationNetworks. Backpropagation. Backpropagation. Introduction to. Backpropagation Network training. Backpropagation Learning Details 1.04.
Networs Introducton to - In 1986 a method for learnng n mult-layer wor,, was nvented by Rumelhart Paper Why are what and where processed by separate cortcal vsual systems? - The algorthm s a sensble approach
More informationAlgorithms Airline Scheduling. Airline Scheduling. Design and Analysis of Algorithms Andrei Bulatov
Algorthms Arlne Schedulng Arlne Schedulng Desgn and Analyss of Algorthms Andre Bulatov Algorthms Arlne Schedulng 11-2 The Problem An arlne carrer wants to serve certan set of flghts Example: Boston (6
More informationReview: Our Approach 2. CSC310 Information Theory
CSC30 Informaton Theory Sam Rowes Lecture 3: Provng the Kraft-McMllan Inequaltes September 8, 6 Revew: Our Approach The study of both compresson and transmsson requres that we abstract data and messages
More informationPRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht
68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly
More informationProfile Optimization of Satellite Antenna for Angular Jerk Minimization
Profle Optmzaton of Satellte Antenna for Angular Jerk Mnmzaton Jangwon Lee, Hyosung Ahn, Kwanghee Ko 3 and Semyung Wang 4 Gwangu Insttute of Scence and Technology, Gwangu, Korea, 500-7 and Daekwan Km 5,
More informationYutaka Matsuo and Akihiko Yokoyama. Department of Electrical Engineering, University oftokyo , Hongo, Bunkyo-ku, Tokyo, Japan
Optmzaton of Installaton of FACTS Devce n Power System Plannng by both Tabu Search and Nonlnear Programmng Methods Yutaka Matsuo and Akhko Yokoyama Department of Electrcal Engneerng, Unversty oftokyo 7-3-,
More informationNETWORK 2001 Transportation Planning Under Multiple Objectives
NETWORK 200 Transportaton Plannng Under Multple Objectves Woodam Chung Graduate Research Assstant, Department of Forest Engneerng, Oregon State Unversty, Corvalls, OR9733, Tel: (54) 737-4952, Fax: (54)
More informationOptimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation
T. Kerdchuen and W. Ongsakul / GMSARN Internatonal Journal (09) - Optmal Placement of and by Hybrd Genetc Algorthm and Smulated Annealng for Multarea Power System State Estmaton Thawatch Kerdchuen and
More informationDecomposition Principles and Online Learning in Cross-Layer Optimization for Delay-Sensitive Applications
Techncal Report Decomposton Prncples and Onlne Learnng n Cross-Layer Optmzaton for Delay-Senstve Applcatons Abstract In ths report, we propose a general cross-layer optmzaton framework n whch we explctly
More informationA NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems
0 nd Internatonal Conference on Industral Technology and Management (ICITM 0) IPCSIT vol. 49 (0) (0) IACSIT Press, Sngapore DOI: 0.776/IPCSIT.0.V49.8 A NSGA-II algorthm to solve a b-obectve optmzaton of
More informationANNUAL OF NAVIGATION 11/2006
ANNUAL OF NAVIGATION 11/2006 TOMASZ PRACZYK Naval Unversty of Gdyna A FEEDFORWARD LINEAR NEURAL NETWORK WITH HEBBA SELFORGANIZATION IN RADAR IMAGE COMPRESSION ABSTRACT The artcle presents the applcaton
More informationarxiv: v1 [cs.lg] 8 Jul 2016
Overcomng Challenges n Fxed Pont Tranng of Deep Convolutonal Networks arxv:1607.02241v1 [cs.lg] 8 Jul 2016 Darryl D. Ln Qualcomm Research, San Dego, CA 92121 USA Sachn S. Talath Qualcomm Research, San
More informationLecture 3: Multi-layer perceptron
x Fundamental Theores and Applcatons of Neural Netors Lecture 3: Mult-laer perceptron Contents of ths lecture Ree of sngle laer neural ors. Formulaton of the delta learnng rule of sngle laer neural ors.
More informationAdaptive Modulation for Multiple Antenna Channels
Adaptve Modulaton for Multple Antenna Channels June Chul Roh and Bhaskar D. Rao Department of Electrcal and Computer Engneerng Unversty of Calforna, San Dego La Jolla, CA 993-7 E-mal: jroh@ece.ucsd.edu,
More informationDefine Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.
Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)
More informationInteger Programming. P.H.S. Torr Lecture 5. Integer Programming
Integer Programmng P.H.S. Torr Lecture 5 Integer Programmng Outlne Mathematcal programmng paradgm Lnear Programmng Integer Programmng Integer Programmng Eample Unmodularty LP -> IP Theorem Concluson Specal
More informationA Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results
AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of
More informationIEE Electronics Letters, vol 34, no 17, August 1998, pp ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES
IEE Electroncs Letters, vol 34, no 17, August 1998, pp. 1622-1624. ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES A. Chatzgeorgou, S. Nkolads 1 and I. Tsoukalas Computer Scence Department, 1 Department
More informationOptimizing Transmission Lengths for Limited Feedback with Non-Binary LDPC Examples
Optmzng Transmsson Lengths for Lmted Feedbac wth on-bnary LDPC Examples Kasra Valna, Sudarsan V. S. Ranganathan, Darush Dvsalar*, and Rchard D. Wesel Department of Electrcal Engneerng, Unversty of Calforna,
More informationOptimization of Ancillary Services for System Security: Sequential vs. Simultaneous LMP calculation
Optmzaton of Ancllary Servces for System Securty: Sequental vs. Smultaneous LM calculaton Sddhartha Kumar Khatan, Yuan L, Student Member, IEEE, and Chen-Chng. Lu, Fellow, IEEE Abstract-- A lnear optmzaton
More informationROBUST IDENTIFICATION AND PREDICTION USING WILCOXON NORM AND PARTICLE SWARM OPTIMIZATION
7th European Sgnal Processng Conference (EUSIPCO 9 Glasgow, Scotland, August 4-8, 9 ROBUST IDENTIFICATION AND PREDICTION USING WILCOXON NORM AND PARTICLE SWARM OPTIMIZATION Babta Majh, G. Panda and B.
More informationPower Minimization Under Constant Throughput Constraint in Wireless Networks with Beamforming
Power Mnmzaton Under Constant Throughput Constrant n Wreless etworks wth Beamformng Zhu Han and K.J. Ray Lu, Electrcal and Computer Engneer Department, Unversty of Maryland, College Park. Abstract In mult-access
More informationThe Spectrum Sharing in Cognitive Radio Networks Based on Competitive Price Game
8 Y. B. LI, R. YAG, Y. LI, F. YE, THE SPECTRUM SHARIG I COGITIVE RADIO ETWORKS BASED O COMPETITIVE The Spectrum Sharng n Cogntve Rado etworks Based on Compettve Prce Game Y-bng LI, Ru YAG., Yun LI, Fang
More informationJoint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding
Communcatons and Network, 2013, 5, 312-318 http://dx.do.org/10.4236/cn.2013.53b2058 Publshed Onlne September 2013 (http://www.scrp.org/journal/cn) Jont Power Control and Schedulng for Two-Cell Energy Effcent
More informationEstimation of Solar Radiations Incident on a Photovoltaic Solar Module using Neural Networks
XXVI. ASR '2001 Semnar, Instruments and Control, Ostrava, Aprl 26-27, 2001 Paper 14 Estmaton of Solar Radatons Incdent on a Photovoltac Solar Module usng Neural Networks ELMINIR, K. Hamdy 1, ALAM JAN,
More informationA TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS
A TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS Pedro Godnho and oana Das Faculdade de Economa and GEMF Unversdade de Combra Av. Das da Slva 65 3004-5
More informationTo: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel
To: Professor Avtable Date: February 4, 3 From: Mechancal Student Subject:.3 Experment # Numercal Methods Usng Excel Introducton Mcrosoft Excel s a spreadsheet program that can be used for data analyss,
More informationNOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION
NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION Phaneendra R.Venkata, Nathan A. Goodman Department of Electrcal and Computer Engneerng, Unversty of Arzona, 30 E. Speedway Blvd, Tucson, Arzona
More informationUnit 1. Current and Voltage U 1 VOLTAGE AND CURRENT. Circuit Basics KVL, KCL, Ohm's Law LED Outputs Buttons/Switch Inputs. Current / Voltage Analogy
..2 nt Crcut Bascs KVL, KCL, Ohm's Law LED Outputs Buttons/Swtch Inputs VOLTAGE AND CRRENT..4 Current and Voltage Current / Voltage Analogy Charge s measured n unts of Coulombs Current Amount of charge
More informationSubcarrier allocation for OFDMA wireless channels using lagrangian relaxation methods
Unversty of Wollongong Research Onlne Faculty of Informatcs - Papers (Archve) Faculty of Engneerng and Informaton Scences 2006 Subcarrer allocaton for OFDMA wreless channels usng lagrangan relaxaton methods
More informationEE 508 Lecture 6. Degrees of Freedom The Approximation Problem
EE 508 Lecture 6 Degrees of Freedom The Approxmaton Problem Revew from Last Tme Desgn Strategy Theorem: A crcut wth transfer functon T(s) can be obtaned from a crcut wth normalzed transfer functon T n
More informationA Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET)
A Novel Optmzaton of the Dstance Source Routng (DSR) Protocol for the Moble Ad Hoc Networs (MANET) Syed S. Rzv 1, Majd A. Jafr, and Khaled Ellethy Computer Scence and Engneerng Department Unversty of Brdgeport
More informationMODEL ORDER REDUCTION AND CONTROLLER DESIGN OF DISCRETE SYSTEM EMPLOYING REAL CODED GENETIC ALGORITHM J. S. Yadav, N. P. Patidar, J.
ABSTRACT Research Artcle MODEL ORDER REDUCTION AND CONTROLLER DESIGN OF DISCRETE SYSTEM EMPLOYING REAL CODED GENETIC ALGORITHM J. S. Yadav, N. P. Patdar, J. Sngha Address for Correspondence Maulana Azad
More informationJoint Rate-Routing Control for Fair and Efficient Data Gathering in Wireless sensor Networks
Jont Rate-Routng Control for Far and Effcent Data Gatherng n Wreless sensor Networks Yng Chen and Bhaskar Krshnamachar Mng Hseh Department of Electrcal Engneerng Unversty of Southern Calforna Los Angeles,
More informationUnderstanding the Spike Algorithm
Understandng the Spke Algorthm Vctor Ejkhout and Robert van de Gejn May, ntroducton The parallel soluton of lnear systems has a long hstory, spannng both drect and teratve methods Whle drect methods exst
More informationTotal Power Minimization in Glitch-Free CMOS Circuits Considering Process Variation
Total Power Mnmzaton n Gltch-Free CMOS Crcuts Consderng Process Varaton Abstract Compared to subthreshold age, dynamc power s normally much less senstve to the process varaton due to ts approxmately lnear
More informationPhoneme Probability Estimation with Dynamic Sparsely Connected Artificial Neural Networks
The Free Speech Journal, Issue # 5(1997) Publshed 10/22/97 1997 All rghts reserved. Phoneme Probablty Estmaton wth Dynamc Sparsely Connected Artfcal Neural Networks Nkko Ström, (nkko@speech.kth.se) Department
More informationAllocation of capacitor banks in distribution systems using multi-objective function
Vol. 8(27), pp. 1282-1288, 18 July, 2013 DOI 10.5897/SRE2013.5554 ISSN 1992-2248 2013 Academc Journals http://www.academcjournals.org/sre Scentfc Research and Essays Full Length Research aper Allocaton
More informationYarn tenacity modeling using artificial neural networks and development of a decision support system based on genetic algorithms
Journal of AI and Data Mnng Vol 2, No, 204, 73-78 Yarn tenacty modelng usng artfcal neural networks and development of a decson support system based on genetc algorthms M Dasht, V Derham 2*, E Ekhtyar
More informationStochastic Programming Models for Optimization of Surgery Delivery Systems
Stochastc Programmng Models for Optmzaton of Surgery Delvery Systems Bran Denton Department of Industral and Operatons Engneerng Unversty of Mchgan Collaborators Har Balasubramanan (Unversty of Massachusetts)
More informationA GBAS Testbed to Support New Monitoring Algorithms Development for CAT III Precision Approach
A GBAS Testbed to Support New Montorng Algorthms Development for CAT III Precson Approach B. Belabbas, T. Dautermann, M. Felux, M. Rppl, S. Schlüter, V. Wlken, A. Hornbostel, M. Meurer German Aerospace
More informationDecision aid methodologies in transportation
Decson ad methodologes n transportaton Lecture 7: More Applcatons Prem Kumar prem.vswanathan@epfl.ch Transport and Moblty Laboratory Summary We learnt about the dfferent schedulng models We also learnt
More informationBreast Cancer Detection using Recursive Least Square and Modified Radial Basis Functional Neural Network
Breast Cancer Detecton usng Recursve Least Square and Modfed Radal Bass Functonal Neural Network M.R.Senapat a, P.K.Routray b,p.k.dask b,a Department of computer scence and Engneerng Gandh Engneerng College
More informationSTRATEGIES TO SUPPORT AMBULANCE SCHEDULING WITH EFFICIENT ROUTING SERVICES
Assocaton for Informaton Systems AIS Electronc Lbrary (AISeL) Wrtschaftsnformatk Proceedngs 2009 Wrtschaftsnformatk 2009 STRATEGIES TO SUPPORT AMBULANCE SCHEDULING WITH EFFICIENT ROUTING SERVICES Günter
More informationThe Effect Of Phase-Shifting Transformer On Total Consumers Payments
Australan Journal of Basc and Appled Scences 5(: 854-85 0 ISSN -88 The Effect Of Phase-Shftng Transformer On Total Consumers Payments R. Jahan Mostafa Nck 3 H. Chahkand Nejad Islamc Azad Unversty Brjand
More informationA study of turbo codes for multilevel modulations in Gaussian and mobile channels
A study of turbo codes for multlevel modulatons n Gaussan and moble channels Lamne Sylla and Paul Forter (sylla, forter)@gel.ulaval.ca Department of Electrcal and Computer Engneerng Laval Unversty, Ste-Foy,
More informationChinese Remainder. Discrete Mathematics Andrei Bulatov
Chnese Remander Introducton Theorem Dscrete Mathematcs Andre Bulatov Dscrete Mathematcs Chnese Remander Theorem 34-2 Prevous Lecture Resdues and arthmetc operatons Caesar cpher Pseudorandom generators
More informationChapter 1. On-line Choice of On-line Algorithms. Yossi Azar Andrei Z. Broder Mark S. Manasse
Chapter On-lne Choce of On-lne Algorthms Yoss Azar Andre Z. Broder Mark S. Manasse Abstract Let fa ; A 2; ; Amg be a set of on-lne algorthms for a problem P wth nput set I. We assume that P can be represented
More informationIntroduction to Coalescent Models. Biostatistics 666 Lecture 4
Introducton to Coalescent Models Bostatstcs 666 Lecture 4 Last Lecture Lnkage Equlbrum Expected state for dstant markers Lnkage Dsequlbrum Assocaton between neghborng alleles Expected to decrease wth dstance
More informationParameter Free Iterative Decoding Metrics for Non-Coherent Orthogonal Modulation
1 Parameter Free Iteratve Decodng Metrcs for Non-Coherent Orthogonal Modulaton Albert Gullén Fàbregas and Alex Grant Abstract We study decoder metrcs suted for teratve decodng of non-coherently detected
More informationCoverage Maximization in Mobile Wireless Sensor Networks Utilizing Immune Node Deployment Algorithm
CCECE 2014 1569888203 Coverage Maxmzaton n Moble Wreless Sensor Networs Utlzng Immune Node Deployment Algorthm Mohammed Abo-Zahhad, Sabah M. Ahmed and Nabl Sabor Electrcal and Electroncs Engneerng Department
More informationarxiv: v1 [cs.lg] 22 Jan 2016 Abstract
Mne Km MINJE@ILLINOIS.EDU Department of Computer Scence, Unversty of Illnos at Urbana-Champagn, Urbana, IL 61801 USA Pars Smaragds Unversty of Illnos at Urbana-Champagn, Urbana, IL 61801 USA Adobe Research,
More informationOptimizing a System of Threshold-based Sensors with Application to Biosurveillance
Optmzng a System of Threshold-based Sensors wth Applcaton to Bosurvellance Ronald D. Frcker, Jr. Thrd Annual Quanttatve Methods n Defense and Natonal Securty Conference May 28, 2008 What s Bosurvellance?
More informationEquivalent Circuit Model of Electromagnetic Behaviour of Wire Objects by the Matrix Pencil Method
ERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 5, No., May 008, -0 Equvalent Crcut Model of Electromagnetc Behavour of Wre Objects by the Matrx Pencl Method Vesna Arnautovsk-Toseva, Khall El Khamlch Drss,
More informationIntroduction to Coalescent Models. Biostatistics 666
Introducton to Coalescent Models Bostatstcs 666 Prevously Allele frequences Hardy Wenberg Equlbrum Lnkage Equlbrum Expected state for dstant markers Lnkage Dsequlbrum Assocaton between neghborng alleles
More informationTotal Power Minimization in Glitch-Free CMOS Circuits Considering Process Variation
21st Internatonal Conference on VLSI Desgn Total Power Mnmzaton n Gltch-Free CMOS Crcuts Consderng Process Varaton Yuanln Lu * Intel Corporaton Folsom, CA 95630, USA yuanln.lu@ntel.com Abstract Compared
More informationNew Applied Methods For Optimum GPS Satellite Selection
New Appled Methods For Optmum GPS Satellte Selecton Hamed Azam, Student Member, IEEE Department of Electrcal Engneerng Iran Unversty of Scence &echnology ehran, Iran hamed_azam@eee.org Mlad Azarbad Department
More informationSorting signed permutations by reversals, revisited
Journal of Computer and System Scences 70 (2005) 321 341 www.elsever.com/locate/jcss Sortng sgned permutatons by reversals, revsted Ham Kaplan, Elad Verbn School of Computer Scence, Tel Avv Unversty, Tel
More informationJoint Optimization of Electricity and Communication Cost for Meter Data Collection in Smart Grid
Receved 3 May 2013; revsed 7 July 2013; accepted 8 July 2013. Date of publcaton 18 July 2013; date of current verson 21 January 2014. Dgtal Object Identfer 10.1109/TETC.2013.2273890 Jont Optmzaton of Electrcty
More informationControlled Random Search Optimization For Linear Antenna Arrays
L. MERAD, F. T. BENDIMERAD, S. M. MERIAH, CONTROLLED RANDOM SEARCH OPTIMIZATION FOR LINEAR Controlled Random Search Optmzaton For Lnear Antenna Arrays Lotf MERAD, Feth Tar BENDIMERAD, Sd Mohammed MERIAH
More informationTest 2. ECON3161, Game Theory. Tuesday, November 6 th
Test 2 ECON36, Game Theory Tuesday, November 6 th Drectons: Answer each queston completely. If you cannot determne the answer, explanng how you would arrve at the answer may earn you some ponts.. (20 ponts)
More informationNew Wavelet Based Performance Analysis and Optimization of Scalable Joint Source/Channel Coder (SJSCC & SJSCCN) for Time-Varying Channels.
Internatonal Research Journal of Engneerng and Technology (IRJET) e-issn: 2395-0056 Volume: 02 Issue: 09 DEC-205 p-issn: 2395-0072 www.rjet.net New Wavelet Based Performance Analyss and Optmzaton of Scalable
More informationGP-based Design and Optimization of a Floating Voltage Source for Low-Power and Highly Tunable OTA Applications
Manuscrpt receved Jun. 11, 2007; revsed Sep. 15, 2007 GP-based Desgn and Optmzaton of a Floatng Voltage Source for Low-Power and Hghly Tunable OTA Applcatons MARYAM SHOJAEI BAGHINI *, RAJENDRA KANPHADE
More informationRobust TDOA Passive Location Using Interval Analysis and Contractor Programming
Robust TDOA Passve Locaton Usng Interval Analyss and Contractor Programmng REYNET O. E 3 I 2 Laboratory, EA3876 ENSIETA Brest, France JAULIN L. ENSIETA Brest, France CHABERT G. Contrantes Team LINA CNRS
More informationIntelligent and Robust Genetic Algorithm Based Classifier
Intellgent and Robust Genetc Algorthm Based Classfer S. H. Zahr, H. Raab Mashhad and S. A. Seyedn Downloaded from eee.ust.ac.r at :4 IRDT on Monday September 3rd 018 Abstract: The concepts of robust classfcaton
More informationUtility Maximization for Uplink MU-MIMO: Combining Spectral-Energy Efficiency and Fairness
EuCNC-MngtTech 79 7 8 9 7 8 9 7 8 9 7 8 9 7 8 9 7 Utlty Maxmzaton for Uplnk MU-MIMO: Combnng Spectral-Energy Effcency and Farness Le Deng, Wenje Zhang, Yun Ru, Yeo Cha Kat Department of Informaton Engneerng,
More informationESTIMATION OF DIVERGENCES IN PRECAST CONSTRUCTIONS USING GEODETIC CONTROL NETWORKS
Proceedngs, 11 th FIG Symposum on Deformaton Measurements, Santorn, Greece, 2003. ESTIMATION OF DIVERGENCES IN PRECAST CONSTRUCTIONS USING GEODETIC CONTROL NETWORKS George D. Georgopoulos & Elsavet C.
More informationJoint Backup Capacity Allocation and Embedding for Survivable Virtual Networks
Jont Backup Capacty Allocaton and Embeddng for Survvable Vrtual Networks Nashd Shahrar, Shhabur Rahman Chowdhury, Reaz Ahmed, Amal Khan, Raouf Boutaba, Jeebak Mtra, and Lu Lu Davd R. Cherton School of
More informationExploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling
Explotng Dynamc Worload Varaton n Low Energy Preemptve Tas Schedulng Lap-Fa Leung, Ch-Yng Tsu Department of Electrcal and Electronc Engneerng Hong Kong Unversty of Scence and Technology Clear Water Bay,
More informationAdaptive System Control with PID Neural Networks
Adaptve System Control wth PID Neural Networs F. Shahra a, M.A. Fanae b, A.R. Aromandzadeh a a Department of Chemcal Engneerng, Unversty of Sstan and Baluchestan, Zahedan, Iran. b Department of Chemcal
More informationShort Term Load Forecasting based on An Optimized Architecture of Hybrid Neural Network Model
Short Term Load Forecastng based on An Optmzed Archtecture of Hybrd Neural Network Model Fras Shhab Ahmed Turksh Aeronautcal Assocaton Unversty Department of Informaton Technology Ankara, Turkey Mnstry
More informationInvestigation of Hybrid Particle Swarm Optimization Methods for Solving Transient-Stability Constrained Optimal Power Flow Problems
Investgaton of Hybrd Partcle Swarm Optmzaton Methods for Solvng Transent-Stablty Constraned Optmal Power Flow Problems K. Y. Chan, G. T. Y. Pong and K. W. Chan Abstract In ths paper, hybrd partcle swarm
More informationMTBF PREDICTION REPORT
MTBF PREDICTION REPORT PRODUCT NAME: BLE112-A-V2 Issued date: 01-23-2015 Rev:1.0 Copyrght@2015 Bluegga Technologes. All rghts reserved. 1 MTBF PREDICTION REPORT... 1 PRODUCT NAME: BLE112-A-V2... 1 1.0
More informationEfficient Large Integers Arithmetic by Adopting Squaring and Complement Recoding Techniques
The th Worshop on Combnatoral Mathematcs and Computaton Theory Effcent Large Integers Arthmetc by Adoptng Squarng and Complement Recodng Technques Cha-Long Wu*, Der-Chyuan Lou, and Te-Jen Chang *Department
More informationDynamic Lightpath Protection in WDM Mesh Networks under Risk-Disjoint Constraint
Dynamc Lghtpath Protecton n D esh Netors under Rs-Dsont Constrant Shengl Yuan* and Jason P. Jue *Department of Computer and athematcal Scences, Unversty of Houston Donton One an Street, Houston, TX 7700,
More informationPerformance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme
Performance Analyss of Mult User MIMO System wth Block-Dagonalzaton Precodng Scheme Yoon Hyun m and Jn Young m, wanwoon Unversty, Department of Electroncs Convergence Engneerng, Wolgye-Dong, Nowon-Gu,
More informationOptimal Reconfiguration of Distribution System by PSO and GA using graph theory
Proceedngs of the 6th WSEAS Internatonal Conference on Applcatons of Electrcal Engneerng, Istanbul, Turkey, May 27-29, 2007 83 Optmal Reconfguraton of Dstrbuton System by PSO and GA usng graph theory Mehd
More informationPredicting Freeway Travelling Time Using Multiple- Source Data
1 2 3 4 5 6 7 8 9 10 Artcle Predctng Freeway Travellng Tme Usng Multple- Source Data Kejun Long 1, Wuka Yao 2, Jan Gu 1 *and We Wu 1 1 Hunan Provncal Key Laboratory of Smart Roadway and Cooperatve Vehcle-Infrastructure
More informationSecure Transmission of Sensitive data using multiple channels
Secure Transmsson of Senstve data usng multple channels Ahmed A. Belal, Ph.D. Department of computer scence and automatc control Faculty of Engneerng Unversty of Alexandra Alexandra, Egypt. aabelal@hotmal.com
More informationKernels and Support Vector Machines
Kernels and Support Vector Machines Machine Learning CSE446 Sham Kakade University of Washington November 1, 2016 2016 Sham Kakade 1 Announcements: Project Milestones coming up HW2 You ve implemented GD,
More informationNew Parallel Radial Basis Function Neural Network for Voltage Security Analysis
New Parallel Radal Bass Functon Neural Network for Voltage Securty Analyss T. Jan, L. Srvastava, S.N. Sngh and I. Erlch Abstract: On-lne montorng of power system voltage securty has become a very demandng
More informationThe PID Controller Based on the Artificial Neural Network and the Differential Evolution Algorithm
2368 JOURNAL OF COMPUERS, VOL. 7, NO., OCOBER 22 he PID Controller Based on the Artfcal Neural Networ and the Dfferental Evoluton Algorthm We Lu he Control Scence and Engneerng Department of Dalan Unversty
More informationOptimum Allocation of Distributed Generations Based on Evolutionary Programming for Loss Reduction and Voltage Profile Correction
ISSN : 0976-8491(Onlne) ISSN : 2229-4333(rnt) Optmum Allocaton of Dstrbuted Generatons Based on Evolutonary rogrammng for Reducton and Voltage rofle Correcton 1 Mohammad Saleh Male, 2 Soodabeh Soleyman
More informationRUNWAY SCHEDULE DETERMINATION BY SIMULATION OPTIMIZATION. Thomas Curtis Holden Frederick Wieland
Proceedngs of the 2003 Wnter Smulaton Conference S. Chck P. J. Sánchez D. Ferrn and D. J. Morrce eds RUNWAY SCHEDULE DETERMINATION BY SIMULATION OPTIMIZATION Thomas Curts Holden Frederck Weland The MITRE
More informationDynamic Lightpath Protection in WDM Mesh Networks under Wavelength Continuity Constraint
Dynamc Lghtpath Protecton n WDM Mesh etworks under Wavelength Contnuty Constrant Shengl Yuan* and Jason P. Jue *Department of Computer and Mathematcal Scences, Unversty of Houston Downtown One Man Street,
More informationResource Allocation for Throughput Enhancement in Cellular Shared Relay Networks
Resource Allocaton for Throughput Enhancement n Cellular Shared Relay Networs Mohamed Fadel, Ahmed Hndy, Amr El-Key, Mohammed Nafe, O. Ozan Koyluoglu, Antona M. Tulno Wreless Intellgent Networs Center
More informationComparison of Gradient descent method, Kalman Filtering and decoupled Kalman in training Neural Networks used for fingerprint-based positioning
Comparson of Gradent descent method, Kalman lterng and decoupled Kalman n tranng Neural Networs used for fngerprnt-based postonng Claude Mbusa Taenga, Koteswara Rao Anne, K Kyamaya, Jean Chamberlan Chedou
More informationProbable Optimization of Reactive Power in distribution systems, in presence of distributed generation sources conjugated to network and islanding
IOSR Journal of Electrcal and Electroncs Engneerng (IOSR-JEEE) e-issn: 2278-1676,p-ISSN: 2320-3331, Volume 11, Issue 5 Ver. II (Sep - Oct 2016), PP 72-78 www.osrjournals.org Probable Optmzaton of Reactve
More informationResearch Article Semidefinite Relaxation Algorithm for Multisource Localization Using TDOA Measurements with Range Constraints
Wreless Communcatons and Moble Computng Volume 2018, Artcle ID 9430180, 9 pages https://doorg/101155/2018/9430180 Research Artcle Semdefnte Relaxaton Algorthm for Multsource Localzaton Usng TDOA Measurements
More informationFull-duplex Relaying for D2D Communication in mmwave based 5G Networks
Full-duplex Relayng for D2D Communcaton n mmwave based 5G Networks Boang Ma Hamed Shah-Mansour Member IEEE and Vncent W.S. Wong Fellow IEEE Abstract Devce-to-devce D2D communcaton whch can offload data
More informationThe Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks
Ths artcle has been accepted for publcaton n a future ssue of ths journal, but has not been fully edted. Content may change pror to fnal publcaton. The Impact of Spectrum Sensng Frequency and Pacet- Loadng
More informationApplying Rprop Neural Network for the Prediction of the Mobile Station Location
Sensors 0,, 407-430; do:0.3390/s040407 OPE ACCESS sensors ISS 44-80 www.mdp.com/journal/sensors Communcaton Applyng Rprop eural etwork for the Predcton of the Moble Staton Locaton Chen-Sheng Chen, * and
More informationth year, No., Computational Intelligence in Electrical Engineering,
1 Applcaton of hybrd neural networks combned wth comprehensve learnng partcle swarm optmzaton to shortterm load forecastng Mohammadreza Emarat 1, Farshd Keyna 2, Alreza Askarzadeh 3 1 PhD Student, Department
More informationCombining Fitness-based Search and User Modeling in Evolutionary Robotics
Combnng Ftness-based Search and User Modelng n Evolutonary Robotcs Josh C. Bongard Dept. of Computer Scence Unversty of Vermont josh.bongard@uvm.edu Gregory S. Hornby Unv. of Calforna Santa Cruz NASA Ames
More informationSide-Match Vector Quantizers Using Neural Network Based Variance Predictor for Image Coding
Sde-Match Vector Quantzers Usng Neural Network Based Varance Predctor for Image Codng Shuangteng Zhang Department of Computer Scence Eastern Kentucky Unversty Rchmond, KY 40475, U.S.A. shuangteng.zhang@eku.edu
More information