1 Example 1: Axis-aligned rectangles
|
|
- Chad Gardner
- 7 years ago
- Views:
Transcription
1 COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton wth VC-dmenson, reduced the problem of fndng a good PAClearnng algorthm to the problem of computng the VC-dmenson of a gven hypothess space. Recall that VC-dmeson s defned usng the noton of a shattered set,.e. a subset S of the doman such that Π H (S 2 S. In ths lecture, we compute the VC-dmenson of several hypothess spaces by computng the maxmum sze of a shattered set. 1 Example 1: Axs-algned rectangles Not all sets of four ponts are shattered. For example the followng arrangement s mpossble: - Fgure 1: An mpossble assgnment of /- to the data, as all rectangles that contan the outer three ponts (marked must also contan the one pont. However, ths s not suffcent to conclude that the VC-dmenson s at most three. Note that the followng set does shatter: Fgure 2: A set of four ponts that shatters, as there s an axs-algned rectangle that contans any gven subset of the ponts but contans no others. Therefore, the VC-dmenson s at least four. In fact, t s exactly four. Consder any set of fve dstnct ponts {v 1, v 2, v 3, v 4, v 5 } R 2. Consder a rectangle that contans the ponts wth maxmum x-coordnate, mnmum x-coordnate, maxmum y-coordnate, and mnmum y-coordnate. These ponts may not be dstnct. However, there are at most four such ponts. Call ths set of ponts S {v 1, v 2, v 3, v 4, v 5 }. Any axs-algned rectangle that
2 contans S must also contan all of the ponts v 1, v 2, v 3, v 4, and v 5. There s at least one v that s not n S, but stll must be n the rectangle. Therefore, the labelng that labels all vertces n S wth and v wth cannot be consstent wth any axs-algned rectangle. Ths means that there s no shattered set of sze 5, snce all possble labelngs of a shattered set must be realzed by some concept. By a smlar argument, we can show that the VC-dmenson of axs-algned rectangles n R n s 2n. By generalzng the approach for provng that the VC-dmenson of the postve half nterval learnng problem s 1, one can show that the VC-dmenson of n 1 dmensonal hyperplanes n R n that pass through the orgn s n. Ths concepts are nequaltes of the form w x > 0 for any fxed w R n and varable x R n. In ths case, concepts label ponts wth f they are one sde of a hyperplane and otherwse. 2 Other remarks on VC-dmenson In the cases mentoned prevously, note that the VC-dmenson s smlar to the number of parameters needed to specfy any partcular concept. In the case of axs-algned rectangles, for example, they are equal snce rectangles requre a left boundary, a rght boundary, a top boundary, and a bottom boundary. Unfortunately, ths smlarty does not always hold, although t often does. There are some hypothess spaces wth nfnte VC-dmenson that can be specfed wth one parameter. Note that f H s fnte, the VC-dmenson s at most log 2 H, as at least 2 r dstnct hypotheses must exst to shatter a set of sze r. For a hypothess space wth nfnte VC-dmenson, there s a set of sze m that s shattered for any m > 0. Therefore, Π H (m 2 m, whch we mentoned last class as an ndcaton of a class that s hard to learn. In the next secton, we wll show that all classes wth bounded VC-dmenson d have Π H (m O(m d, completng the descrpton of PAC-learnablty by VC-dmenson. 3 Sauer s Lemma Recall that ( n k n! (n k!k! f 0 k n and ( n k 0 f k < 0 or k > n. k and n are ntegers and n s nonnegatve for our purposes. Note that ( n k O(n k when k s regarded as a postve constant. We wll show the followng lemma, whch mmedately mples the desred result: Lemma 3.1 (Sauer s Lemma. Let H be a hypothess wth fnte VC-dmenson d. Then, Π H (m d ( m : Φ d (m Proof. We wll prove ths by nducton on m d. There are two base cases: Case 1 (m 0. There s only one possble assgnment of and to the empty set,.e. Π H (m 1 here. Note that Φ d (0 ( 0 0 ( ( 0 d 1, as desred. 2
3 Case 2 (d 0. Not even a sngle pont can be shattered n ths stuaton. Therefore, on any gven pont, all hypotheses have the same value. Therefore, there s only one possble hypothess and Π H (m 1. Ths agrees wth Φ, as Φ 0 (m ( m 0 1. Now, we wll prove the nducton step. For ths, we wll need Pascal s Identty, whch states that ( ( ( n n n 1 k k 1 k 1 for all ntegers n and k wth n 0. Consder a hypothess space H wth VC-dmenson d and a set of m examples S : {x 1, x 2,..., x m }. Let T : {x 1, x 2,..., x m 1 }. Form two hypothess spaces H 1 and H 2 on T as follows (an example s n Fgure 3. Let H 1 be the set of restrctons of hypotheses from H to T. Let h T denote the restrcton of h to T for h H,.e. the functon h T : T {, } such that h T (x h(x for all x T. An element ρ on T s added to H 2 f and only f there are two dstnct hypotheses h 1, h 2 H such that h 1 T h 2 T ρ. Note that Π H (S Π H1 (T Π H2 (T. What are the VC-dmensons of H 1 and H 2? Frst, note that the VC-dmenson of H 1 s at most d, as any shatterng set of sze d 1 n T s also a subset of S that s shattered by the elements of H, contradctng the fact that the VC-dmenson of H s d. Suppose that there s a set of sze d n T that s shattered by H 2. Snce every hypothess n H 2 s the restrcton of two dfferent hypotheses n H, x m can be added to the shattered set of sze d n T to obtan a set shattered by H of sze d 1. Ths s a contradcton, so the VC-dmenson of H 2 s at most d 1. By the nductve hypothess, Π H1 (m 1 Φ d (m 1. Smlarly, Π H2 (m 1 Φ d 1 (m 1. Combnng these two nequaltes shows that Π H (m Φ d (m 1 Φ d 1 (m 1 ( d ( m 1 d 1 ( m 1 j j0 ( m 1 d 1 (( m 1 0 ( m d 1 ( m 0 1 Φ d (m completng the nductve step. ( m 1 1 Often, the polynomal Φ d (m s hard to work wth. Instead, we often use the followng result: Lemma 3.2. Φ d (m (em/d d when m d 1. Proof. m d 1 mples that d m 1. Therefore, snce d n the summand, 3
4 H x 1 x 2 x 3 x 4 x H 1 x 1 x 2 x 3 x H 2 x 1 x 2 x 3 x Fgure 3: The constructon of H 1 and H 2 ( d m d d ( m d ( d ( m m ( 1 d m m e d Multplyng on both sdes by (m/d d on both sdes gves the desred result. Pluggng ths result nto the examples bound proven last class shows that ( ( 1 err(h O d ln m m d ln 1 δ We can also wrte ths n terms of the number of examples requred to learn: ( 1 m O (ln 1/δ d ln 1/ɛ ɛ Note that the number of examples requred to learn scales lnearly wth the VC-dmenson. 4 Lower bounds on learnng The bound proven n the prevous secton shows that the VC-dmenson of a hypothess space yelds an upper bound on the number of examples needed to learn. Lower bounds on the requred number of examples also exst. If the VC-dmenson of a hypothess space s d, there s a shattered set of sze d. Intutvely, any hypothess learned from a subset of sze at most d 1 cannot predct the value of the last element wth probablty better than 1/2. Ths suggests that at least Ω(d examples are requred to learn. In future classes, we wll prove the followng Theorem 4.1. For all learnng algorthms A, there s a concept c C and a dstrbuton D such that f A s gven m d/2 examples labeled by c and dstrbuted accordng to D, then Pr[err(h A > 1/8] 1 8 4
5 One can try to prove ths as follows. Choose a unform dstrbuton D on examples {z 1,..., z d } and run A on m d/2 examples. Call ths set of examples S. Label the elements of S arbtrarly wth and -. Suppose that c C s selected to be consstent wth all of the labels on S and c(x h A (x for all x / S. err D (h A 1 2 snce c agrees wth h A on at most (d/2/2 1/2 of the probablty mass of the doman, whch means that there s no PAC-learnng algorthm on d/2 examples. Ths proof s flawed, as c needs to be chosen before the examples. We wll dscuss a correct proof n future classes. 5
Recurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationWe are now ready to answer the question: What are the possible cardinalities for finite fields?
Chapter 3 Fnte felds We have seen, n the prevous chapters, some examples of fnte felds. For example, the resdue class rng Z/pZ (when p s a prme) forms a feld wth p elements whch may be dentfed wth the
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationGeneralizing the degree sequence problem
Mddlebury College March 2009 Arzona State Unversty Dscrete Mathematcs Semnar The degree sequence problem Problem: Gven an nteger sequence d = (d 1,...,d n ) determne f there exsts a graph G wth d as ts
More informationv a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
More informationn + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)
MATH 16T Exam 1 : Part I (In-Class) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total
More informationNPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6
PAR TESTS If a WEIGHT varable s specfed, t s used to replcate a case as many tmes as ndcated by the weght value rounded to the nearest nteger. If the workspace requrements are exceeded and samplng has
More informationThe Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More information8 Algorithm for Binary Searching in Trees
8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the
More informationBERNSTEIN POLYNOMIALS
On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set
More informationPSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12
14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationRing structure of splines on triangulations
www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon
More informationEmbedding lattices in the Kleene degrees
F U N D A M E N T A MATHEMATICAE 62 (999) Embeddng lattces n the Kleene degrees by Hsato M u r a k (Nagoya) Abstract. Under ZFC+CH, we prove that some lattces whose cardnaltes do not exceed ℵ can be embedded
More informationGeneral Auction Mechanism for Search Advertising
General Aucton Mechansm for Search Advertsng Gagan Aggarwal S. Muthukrshnan Dávd Pál Martn Pál Keywords game theory, onlne auctons, stable matchngs ABSTRACT Internet search advertsng s often sold by an
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationEnergies of Network Nastsemble
Supplementary materal: Assessng the relevance of node features for network structure Gnestra Bancon, 1 Paolo Pn,, 3 and Matteo Marsl 1 1 The Abdus Salam Internatonal Center for Theoretcal Physcs, Strada
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems
More information1. Measuring association using correlation and regression
How to measure assocaton I: Correlaton. 1. Measurng assocaton usng correlaton and regresson We often would lke to know how one varable, such as a mother's weght, s related to another varable, such as a
More informationLogistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification
Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationImplementation of Deutsch's Algorithm Using Mathcad
Implementaton of Deutsch's Algorthm Usng Mathcad Frank Roux The followng s a Mathcad mplementaton of Davd Deutsch's quantum computer prototype as presented on pages - n "Machnes, Logc and Quantum Physcs"
More informationTHE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES
The goal: to measure (determne) an unknown quantty x (the value of a RV X) Realsaton: n results: y 1, y 2,..., y j,..., y n, (the measured values of Y 1, Y 2,..., Y j,..., Y n ) every result s encumbered
More informationProduction. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem.
Producer Theory Producton ASSUMPTION 2.1 Propertes of the Producton Set The producton set Y satsfes the followng propertes 1. Y s non-empty If Y s empty, we have nothng to talk about 2. Y s closed A set
More informationFigure 1. Inventory Level vs. Time - EOQ Problem
IEOR 54 Sprng, 009 rof Leahman otes on Eonom Lot Shedulng and Eonom Rotaton Cyles he Eonom Order Quantty (EOQ) Consder an nventory tem n solaton wth demand rate, holdng ost h per unt per unt tme, and replenshment
More informationQuantization Effects in Digital Filters
Quantzaton Effects n Dgtal Flters Dstrbuton of Truncaton Errors In two's complement representaton an exact number would have nfntely many bts (n general). When we lmt the number of bts to some fnte value
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationREGULAR MULTILINEAR OPERATORS ON C(K) SPACES
REGULAR MULTILINEAR OPERATORS ON C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. The purpose of ths paper s to characterze the class of regular contnuous multlnear operators on a product of
More informationProduct-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks
Bulletn of Mathematcal Bology (21 DOI 1.17/s11538-1-9517-4 ORIGINAL ARTICLE Product-Form Statonary Dstrbutons for Defcency Zero Chemcal Reacton Networks Davd F. Anderson, Gheorghe Cracun, Thomas G. Kurtz
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationLinear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits
Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo
More informationThe University of Texas at Austin. Austin, Texas 78712. December 1987. Abstract. programs in which operations of dierent processes mayoverlap.
Atomc Semantcs of Nonatomc Programs James H. Anderson Mohamed G. Gouda Department of Computer Scences The Unversty of Texas at Austn Austn, Texas 78712 December 1987 Abstract We argue that t s possble,
More informationA Probabilistic Theory of Coherence
A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want
More informationPERRON FROBENIUS THEOREM
PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()
More informationFisher Markets and Convex Programs
Fsher Markets and Convex Programs Nkhl R. Devanur 1 Introducton Convex programmng dualty s usually stated n ts most general form, wth convex objectve functons and convex constrants. (The book by Boyd and
More informationCHAPTER 14 MORE ABOUT REGRESSION
CHAPTER 14 MORE ABOUT REGRESSION We learned n Chapter 5 that often a straght lne descrbes the pattern of a relatonshp between two quanttatve varables. For nstance, n Example 5.1 we explored the relatonshp
More informationVoIP over Multiple IEEE 802.11 Wireless LANs
SUBMITTED TO IEEE TRANSACTIONS ON MOBILE COMPUTING 1 VoIP over Multple IEEE 80.11 Wreless LANs An Chan, Graduate Student Member, IEEE, Soung Chang Lew, Senor Member, IEEE Abstract IEEE 80.11 WLAN has hgh
More informationThe Power of Slightly More than One Sample in Randomized Load Balancing
The Power of Slghtly More than One Sample n Randomzed oad Balancng e Yng, R. Srkant and Xaohan Kang Abstract In many computng and networkng applcatons, arrvng tasks have to be routed to one of many servers,
More informationEfficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ
Effcent Strpng Technques for Varable Bt Rate Contnuous Meda Fle Servers æ Prashant J. Shenoy Harrck M. Vn Department of Computer Scence, Department of Computer Scences, Unversty of Massachusetts at Amherst
More informationCOLLOQUIUM MATHEMATICUM
COLLOQUIUM MATHEMATICUM VOL. 74 997 NO. TRANSFERENCE THEORY ON HARDY AND SOBOLEV SPACES BY MARIA J. CARRO AND JAVIER SORIA (BARCELONA) We show that the transference method of Cofman and Wess can be extended
More informationProject Networks With Mixed-Time Constraints
Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationUpper Bounds on the Cross-Sectional Volumes of Cubes and Other Problems
Upper Bounds on the Cross-Sectonal Volumes of Cubes and Other Problems Ben Pooley March 01 1 Contents 1 Prelmnares 1 11 Introducton 1 1 Basc Concepts and Notaton Cross-Sectonal Volumes of Cubes (Hyperplane
More informationCS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements
Lecture 3 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 5329 Sennott Square Next lecture: Matlab tutoral Announcements Rules for attendng the class: Regstered for credt Regstered for audt (only f there
More informationPerformance Analysis and Coding Strategy of ECOC SVMs
Internatonal Journal of Grd and Dstrbuted Computng Vol.7, No. (04), pp.67-76 http://dx.do.org/0.457/jgdc.04.7..07 Performance Analyss and Codng Strategy of ECOC SVMs Zhgang Yan, and Yuanxuan Yang, School
More informationHow Much to Bet on Video Poker
How Much to Bet on Vdeo Poker Trstan Barnett A queston that arses whenever a gae s favorable to the player s how uch to wager on each event? Whle conservatve play (or nu bet nzes large fluctuatons, t lacks
More informationAn Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems
STAN-CS-73-355 I SU-SE-73-013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part
More informationSupport vector domain description
Pattern Recognton Letters 20 (1999) 1191±1199 www.elsever.nl/locate/patrec Support vector doman descrpton Davd M.J. Tax *,1, Robert P.W. Dun Pattern Recognton Group, Faculty of Appled Scence, Delft Unversty
More informationChapter 7: Answers to Questions and Problems
19. Based on the nformaton contaned n Table 7-3 of the text, the food and apparel ndustres are most compettve and therefore probably represent the best match for the expertse of these managers. Chapter
More informationINSTITUT FÜR INFORMATIK
INSTITUT FÜR INFORMATIK Schedulng jobs on unform processors revsted Klaus Jansen Chrstna Robene Bercht Nr. 1109 November 2011 ISSN 2192-6247 CHRISTIAN-ALBRECHTS-UNIVERSITÄT ZU KIEL Insttut für Informat
More informationTo Fill or not to Fill: The Gas Station Problem
To Fll or not to Fll: The Gas Staton Problem Samr Khuller Azarakhsh Malekan Julán Mestre Abstract In ths paper we study several routng problems that generalze shortest paths and the Travelng Salesman Problem.
More informationComplete Fairness in Secure Two-Party Computation
Complete Farness n Secure Two-Party Computaton S. Dov Gordon Carmt Hazay Jonathan Katz Yehuda Lndell Abstract In the settng of secure two-party computaton, two mutually dstrustng partes wsh to compute
More informationSngle Snk Buy at Bulk Problem and the Access Network
A Constant Factor Approxmaton for the Sngle Snk Edge Installaton Problem Sudpto Guha Adam Meyerson Kamesh Munagala Abstract We present the frst constant approxmaton to the sngle snk buy-at-bulk network
More informationEqulbra Exst and Trade S effcent proportionally
On Compettve Nonlnear Prcng Andrea Attar Thomas Marott Franços Salané February 27, 2013 Abstract A buyer of a dvsble good faces several dentcal sellers. The buyer s preferences are her prvate nformaton,
More informationRelay Secrecy in Wireless Networks with Eavesdropper
Relay Secrecy n Wreless Networks wth Eavesdropper Parvathnathan Venktasubramanam, Tng He and Lang Tong School of Electrcal and Computer Engneerng Cornell Unversty, Ithaca, NY 14853 Emal : {pv45, th255,
More informationAn Overview of Financial Mathematics
An Overvew of Fnancal Mathematcs Wllam Benedct McCartney July 2012 Abstract Ths document s meant to be a quck ntroducton to nterest theory. It s wrtten specfcally for actuaral students preparng to take
More informationPOLYSA: A Polynomial Algorithm for Non-binary Constraint Satisfaction Problems with and
POLYSA: A Polynomal Algorthm for Non-bnary Constrant Satsfacton Problems wth and Mguel A. Saldo, Federco Barber Dpto. Sstemas Informátcos y Computacón Unversdad Poltécnca de Valenca, Camno de Vera s/n
More informationSection 5.4 Annuities, Present Value, and Amortization
Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today
More informationA Lyapunov Optimization Approach to Repeated Stochastic Games
PROC. ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, OCT. 2013 1 A Lyapunov Optmzaton Approach to Repeated Stochastc Games Mchael J. Neely Unversty of Southern Calforna http://www-bcf.usc.edu/
More informationOn Leonid Gurvits s proof for permanents
On Leond Gurvts s proof for permanents Monque Laurent and Alexander Schrver Abstract We gve a concse exposton of the elegant proof gven recently by Leond Gurvts for several lower bounds on permanents.
More informationAvailability-Based Path Selection and Network Vulnerability Assessment
Avalablty-Based Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationOPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL. Thomas S. Ferguson and C. Zachary Gilstein UCLA and Bell Communications May 1985, revised 2004
OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL Thomas S. Ferguson and C. Zachary Glsten UCLA and Bell Communcatons May 985, revsed 2004 Abstract. Optmal nvestment polces for maxmzng the expected
More informationGlobal stability of Cohen-Grossberg neural network with both time-varying and continuous distributed delays
Global stablty of Cohen-Grossberg neural network wth both tme-varyng and contnuous dstrbuted delays José J. Olvera Departamento de Matemátca e Aplcações and CMAT, Escola de Cêncas, Unversdade do Mnho,
More informationCombinatorial Agency of Threshold Functions
Combnatoral Agency of Threshold Functons Shal Jan Computer Scence Department Yale Unversty New Haven, CT 06520 shal.jan@yale.edu Davd C. Parkes School of Engneerng and Appled Scences Harvard Unversty Cambrdge,
More informationA Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,
More informationINTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES.
INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES. HRISTO GANCHEV AND MARIYA SOSKOVA 1. Introducton Degree theory studes mathematcal structures, whch arse from a formal noton
More informationLogical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77-866 Logcal Development Of Vogel s Approxmaton Method (LD- An Approach To Fnd Basc Feasble Soluton Of Transportaton
More informationHow To Calculate The Accountng Perod Of Nequalty
Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.
More informationPower-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts
Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationRate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process
Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer
More informationLoop Parallelization
- - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze
More informationLogistic Regression. Steve Kroon
Logstc Regresson Steve Kroon Course notes sectons: 24.3-24.4 Dsclamer: these notes do not explctly ndcate whether values are vectors or scalars, but expects the reader to dscern ths from the context. Scenaro
More informationInterest Rate Fundamentals
Lecture Part II Interest Rate Fundamentals Topcs n Quanttatve Fnance: Inflaton Dervatves Instructor: Iraj Kan Fundamentals of Interest Rates In part II of ths lecture we wll consder fundamental concepts
More informationFrom Selective to Full Security: Semi-Generic Transformations in the Standard Model
An extended abstract of ths work appears n the proceedngs of PKC 2012 From Selectve to Full Securty: Sem-Generc Transformatons n the Standard Model Mchel Abdalla 1 Daro Fore 2 Vadm Lyubashevsky 1 1 Département
More informationLecture 3: Force of Interest, Real Interest Rate, Annuity
Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and
More informationHow To Know The Components Of Mean Squared Error Of Herarchcal Estmator S
S C H E D A E I N F O R M A T I C A E VOLUME 0 0 On Mean Squared Error of Herarchcal Estmator Stans law Brodowsk Faculty of Physcs, Astronomy, and Appled Computer Scence, Jagellonan Unversty, Reymonta
More informationHow To Calculate An Approxmaton Factor Of 1 1/E
Approxmaton algorthms for allocaton problems: Improvng the factor of 1 1/e Urel Fege Mcrosoft Research Redmond, WA 98052 urfege@mcrosoft.com Jan Vondrák Prnceton Unversty Prnceton, NJ 08540 jvondrak@gmal.com
More informationOn Lockett pairs and Lockett conjecture for π-soluble Fitting classes
On Lockett pars and Lockett conjecture for π-soluble Fttng classes Lujn Zhu Department of Mathematcs, Yangzhou Unversty, Yangzhou 225002, P.R. Chna E-mal: ljzhu@yzu.edu.cn Nanyng Yang School of Mathematcs
More informationA LAW OF LARGE NUMBERS FOR FINITE-RANGE DEPENDENT RANDOM MATRICES
A LAW OF LARGE NUMBERS FOR FINITE-RANGE DEPENDENT RANDOM MATRICES GREG ANDERSON AND OFER ZEITOUNI Abstract. We consder random hermtan matrces n whch dstant abovedagonal entres are ndependent but nearby
More informationStrategy Machines. Representation and Complexity of Strategies in Infinite Games
Strategy Machnes Representaton and Complexty of Strateges n Infnte Games Von der Fakultät für Mathematk, Informatk und Naturwssenschaften der RWTH Aachen Unversty zur Erlangung des akademschen Grades enes
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationSTATISTICAL DATA ANALYSIS IN EXCEL
Mcroarray Center STATISTICAL DATA ANALYSIS IN EXCEL Lecture 6 Some Advanced Topcs Dr. Petr Nazarov 14-01-013 petr.nazarov@crp-sante.lu Statstcal data analyss n Ecel. 6. Some advanced topcs Correcton for
More informationPricing Overage and Underage Penalties for Inventory with Continuous Replenishment and Compound Renewal Demand via Martingale Methods
Prcng Overage and Underage Penaltes for Inventory wth Contnuous Replenshment and Compound Renewal emand va Martngale Methods RAF -Jun-3 - comments welcome, do not cte or dstrbute wthout permsson Junmn
More information+ + + - - This circuit than can be reduced to a planar circuit
MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to
More informationThe Development of Web Log Mining Based on Improve-K-Means Clustering Analysis
The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationLevel Annuities with Payments Less Frequent than Each Interest Period
Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Symoblc approach
More informationLecture 2: Single Layer Perceptrons Kevin Swingler
Lecture 2: Sngle Layer Perceptrons Kevn Sngler kms@cs.str.ac.uk Recap: McCulloch-Ptts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses
More informationTHE HIT PROBLEM FOR THE DICKSON ALGEBRA
TRNSCTIONS OF THE MERICN MTHEMTICL SOCIETY Volume 353 Number 12 Pages 5029 5040 S 0002-9947(01)02705-2 rtcle electroncally publshed on May 22 2001 THE HIT PROBLEM FOR THE DICKSON LGEBR NGUY ÊN H. V. HUNG
More informationForecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network
700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School
More informationNON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia
To appear n Journal o Appled Probablty June 2007 O-COSTAT SUM RED-AD-BLACK GAMES WITH BET-DEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate
More informationAnalysis of Energy-Conserving Access Protocols for Wireless Identification Networks
From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC-97), March 2-23, 1997. 1 Analyss of Energy-Conservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara
More informationFINITE HILBERT STABILITY OF (BI)CANONICAL CURVES
FINITE HILBERT STABILITY OF (BICANONICAL CURVES JAROD ALPER, MAKSYM FEDORCHUK, AND DAVID ISHII SMYTH* To Joe Harrs on hs sxteth brthday Abstract. We prove that a generc canoncally or bcanoncally embedded
More informationNonbinary Quantum Error-Correcting Codes from Algebraic Curves
Nonbnary Quantum Error-Correctng Codes from Algebrac Curves Jon-Lark Km and Judy Walker Department of Mathematcs Unversty of Nebraska-Lncoln, Lncoln, NE 68588-0130 USA e-mal: {jlkm, jwalker}@math.unl.edu
More informationA generalized hierarchical fair service curve algorithm for high network utilization and link-sharing
Computer Networks 43 (2003) 669 694 www.elsever.com/locate/comnet A generalzed herarchcal far servce curve algorthm for hgh network utlzaton and lnk-sharng Khyun Pyun *, Junehwa Song, Heung-Kyu Lee Department
More information