学校選択制. Spread of school choice around the globe

Size: px
Start display at page:

Download "学校選択制. Spread of school choice around the globe"

Transcription

1

2 学校選択制 Spread of school choice around the globe

3 学校選択制 Spread of school choice around the globe School authorities take into account preferences of students/parents

4

5

6 National Governors Association Report

7

8

9 respects improvements of school quality

10 respects improvements of school quality

11

12

13

14

15 Criteria SOSM Boston TTC RI in General Environments RI for Desirable Students in General Environments RI in Large Environments RI for Desirable Students in Large Environments RI in Terms of Enrollment RI of Student Quality

16 Criteria SOSM Boston TTC RI in General Environments RI for Desirable Students in General Environments RI in Large Environments RI for Desirable Students in Large Environments RI in Terms of Enrollment RI of Student Quality

17 s1 >s1 c1 >c1 sm >sm cn >cn

18

19 improvement for school c

20 improvement for school c c

21 respects improvements of school quality c c

22 respects improvements of school quality c c

23

24 Student-Optimal Stable

25

26 c :s, s,, c : s, s,, s: c, c,, s : c, c,,

27 c :s, s,, c : s, s,, s: c, c,, s : c, c,, c c

28 c :s, s,, c : s, s,, c c s: c, c,, s : c, c,, s s c c

29 c :s, s,, c : s, s,, c c s: c, c,, s : c, c,, s: c, c,. s s c c c

30 c :s, s,, c : s, s,, c c c c s: c, c,, s : c, c,, s: c, c,. s s s s c c c

31 c :s, s,, c : s, s,, c c c c s: c, c,, s : c, c,, s: c, c,. s s s s c c

32

33

34

35 Boston

36 Boston

37 Top Trading Cycles

38 Top Trading Cycles

39

40

41

42

43

44

45

46 c :s, s,, c : s, s,, c c c c s: c, c,, s : c, c,, s: c, c,. s s s s c c

47

48

49

50

51

52

53 αc(φ) φ c

54 αc(φ) φ c φ approximately RI in large environments c αc(φ) 0.

55

56

57

58

59

60

61

62 s c

63 s c c s

64 s c c s

65 s c c s

66 s c c s

67 s c

68 s c s c

69 s c

70

71

72 s c

73 s c

74

75

76

77

78

79

80 t ( 1) t-1

81 t ( 1) and students who are kept from Step t-1 together.

82 t ( 1) and students who are kept from Step t-1 together.

83

84

85

86

87

88 SOSM Boston TTC RI in Large Environments

89 SOSM Boston TTC RI in Large Environments

90

91

92

93

94

95 s1 >s1 c1 >c1 sm >s2 cn >c2

96 s1 >s1 c1 >c1 sm >sm cn >c2 ( ).

97 s1 >s1 c1 >c1 sm >sm cn >cm matching µ s µs

98 s1 >s1 c1 >c1 sm >sm cn >cn µ c µc

99 s1 >s1 c1 >c1 sm >sm cn >cn mechanism

100 µ individually rational s µs s.

101 µ individually rational s µs s. stable s, c c >s µs µc qc s µc s >c s.

102 Student-Optimal Stable

103 Student-Optimal Stable t ( 1) t-1

104 Student-Optimal Stable t ( 1) and students who are kept from Step t-1 together.

105 Student-Optimal Stable t ( 1) and students who are kept from Step t-1 together.

106 Student-Optimal Stable

107 Student-Optimal Stable

108 ( c : s, s,, c : s, s,, ( c ) c s : c,, s s s : c,. s : c, c,. c

109 c : s, s,, c : s, s,, ( c c ) ( c ) c s : c,, s s s s s : c, c,. s : c, c,. c

110 c : s, s,, c : s, s,, ( c c ) ( c ) c s : c,, s s s s s : c, c,. s : c, c,. c c

111 virtually homogeneous qc c

112

113

114 Acyclicity (Ergin) x-acyclicity (Haeringer and Klijn) Virtual Homogeneity Essential Homogeneity (Kojima) Acyclicity (Kesten) Strong x-acyclicity (Haeringer and Klijn)

115 A random market is a tuple Γ =(C, S, k, D), where k is a positive integer and D is a pair (D C, D S ) of probability distributions. Each random market induces a market by randomly generating preferences of students. D S =(p c ) c C is a probability distribution on C. Preferences of each student s are drawn independently without replacement using probability distribution D S to form the preference list of students of length k. The preference distribution of schools is completely general: D C may be any distribution (or even degenerate).

116 Definition A sequence of random markets ( Γ n ) n N is regular if there exist positive integers k, q and ˆq such that 1 k n k for all n, 2 q c ˆq for all n and c C n, 3 S n qn for all n, and 4 for all n and c C n, every s S n is acceptable to c at any realization of preferences for c at D C n. We also impose the condition that the market is sufficiently thick, i.e. that there are no super-popular schools. For example, if p c p c T for some T R for all c, c C, the market is sufficiently thick.

117 Step t: Each student s S points to her most preferred school (if any); students who do not point at any school are assigned to. Each school c C points to its most preferred student. As there are a finite number of schools and students, there exists at least one cycle, i.e. a sequence of distinct schools and students (s 1, c 1, s 2, c 2,...,s K, c K )suchthatstudents 1 points at school c 1, school c 1 points to student s 2, student s 2 points to school c 2,..., student s K points to school c K, and, finally, school c K points to student s 1. Every student s k (k =1,...,K) isassignedtotheschoolsheispointing at.

118 s1 : c 3,c 1,, c1 : s 1,s 2,s 3,s 4,, s2 : c 2,c 1,, s3 : c 3,c 1,, s4 : c 2,c 4,, c2 : s 1,s 2,..., c3 : s 4,s 3,s 2,s 1, c4 : s 4,...,.

119 s1 : c 3,c 1,, c1 : s 1,s 2,s 3,s 4,, s2 : c 2,c 1,, s3 : c 3,c 1,, s4 : c 2,c 4,, c2 : s 1,s 2,..., c3 : s 4,s 3,s 2,s 1, c4 : s 4,...,. c1

120 c1 : c s1 3 1, : s c1 1,s 2,s 3,s 4,, s 1 1,c 3,. s2 : c 2,c 1,, s3 : c 3,c 1,, s4 : c 2,c 4,, c2 : s 1,s 2,..., c3 : s 4,s 3,s 2,s 1, c4 : s 4,...,. c1

121 c1 s1 : c s1 3 1, : s c1 1,s 2,s 3,s 4,, s 1 1,c 3,. s2 : c 2,c 1,, s3 : c 3,c 1,, s4 : c 2,c 4,, c2 : s 1,s 2,..., c3 : s 4,s 3,s 2,s 1, c4 : s 4,...,. c1

122

123

124 respects improvements in terms of enrollment c c

125 SOSM Boston TTC RI in Terms of Enrollment

126 s1 : c 3,c 1,, c1 : s 1,s 2,s 3,s 4,, s2 : c 2,c 1,, s3 : c 3,c 1,, s4 : c 2,c 4,, c2 : s 1,s 2,..., c3 : s 4,s 3,s 2,s 1, c4 : s 4,...,. c1

127 c1 : c s1 3 1, : s c1 1,s 2,s 3,s 4,, s 1 1,c 3,. s2 : c 2,c 1,, s3 : c 3,c 1,, s4 : c 2,c 4,, c2 : s 1,s 2,..., c3 : s 4,s 3,s 2,s 1, c4 : s 4,...,. c1

128

129 respecting improvements for desirable students

130 SOSM Boston TTC RI for Desirable Students in General Environments RI for Desirable Students in Large Environments

131 SOSM Boston TTC RI in General Markets RI by Desirable Students in General Markets RI in Large Markets RI for Desirable Students in Large Markets RI in Terms of Enrollment

The College Admissions Problem Reconsidered

The College Admissions Problem Reconsidered The College Admissions Problem Reconsidered Zhenhua Jiao School of Economics Shanghai University of Finance and Economics Shanghai, 200433, China Guoqiang Tian Department of Economics Texas A&M University

More information

Efficiency and Respecting Improvements in College Admissions

Efficiency and Respecting Improvements in College Admissions Efficiency and Respecting Improvements in College Admissions Zhenhua Jiao School of Economics Shanghai University of Finance and Economics Shanghai, 200433, China Guoqiang Tian Department of Economics

More information

Properties of matching algorithm in college admission problem with variable capacity quotas. Robert Golański Warsaw School of Economics

Properties of matching algorithm in college admission problem with variable capacity quotas. Robert Golański Warsaw School of Economics Properties of matching algorithm in college admission problem with variable capacity quotas Robert Golański Warsaw School of Economics Social Choice and Welfare Moscow, July 2010 1 College admission problem:

More information

Pairwise stability and strategy-proofness for college admissions with budget constraints

Pairwise stability and strategy-proofness for college admissions with budget constraints Pairwise stability and strategy-proofness for college admissions with budget constraints Azar Abizada University of Rochester First draft: October 22, 2009 This version: January 5, 2012 Abstract We study

More information

SET DEFINITION 1 elements members

SET DEFINITION 1 elements members SETS SET DEFINITION 1 Unordered collection of objects, called elements or members of the set. Said to contain its elements. We write a A to denote that a is an element of the set A. The notation a A denotes

More information

School Choice with Controlled Choice Constraints: Hard Bounds versus Soft Bounds

School Choice with Controlled Choice Constraints: Hard Bounds versus Soft Bounds School Choice with Controlled Choice Constraints: Hard Bounds versus Soft Bounds Lars Ehlers Isa E. Hafalir M. Bumin Yenmez Muhammed A. Yildirim September 2012 Abstract Controlled choice over public schools

More information

On the automorphism group of the m-coloured random graph

On the automorphism group of the m-coloured random graph On the automorphism group of the m-coloured random graph Peter J. Cameron and Sam Tarzi School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, UK p.j.cameron@qmul.ac.uk

More information

Lab 01 Assignment. Diagramming Software Systems for Analysis and Design Modeling

Lab 01 Assignment. Diagramming Software Systems for Analysis and Design Modeling Lab 01 Assignment Diagramming Software Systems for Analysis and Design Modeling 1 Lab 01 Assignment Use computers in BR150 or Br180 OR download on your own laptop and a use all REQUIRED (IBM Rational.

More information

The Structure of Bull-Free Perfect Graphs

The Structure of Bull-Free Perfect Graphs The Structure of Bull-Free Perfect Graphs Maria Chudnovsky and Irena Penev Columbia University, New York, NY 10027 USA May 18, 2012 Abstract The bull is a graph consisting of a triangle and two vertex-disjoint

More information

Te Kura Enrolment System -TES

Te Kura Enrolment System -TES Te Kura Enrolment System -TES User Guide for Schools and Dual Providers Part 4: How to cancel enrolments, subjects or applications Contents Part Subject Page Part 4. How to cancel enrolments, subjects

More information

Topology Homework 3. Section Section 3.3. Samuel Otten

Topology Homework 3. Section Section 3.3. Samuel Otten Topology Homework 3 Section 3.1 - Section 3.3 Samuel Otten 3.1 (1) Proposition. The intersection of finitely many open sets is open and the union of finitely many closed sets is closed. Proof. Note that

More information

YES User Guide Enrollment

YES User Guide Enrollment YES User Guide Enrollment Adding a Class to the Cart 1. On the student landing page, click Student Registration. 2. Use the drop down arrow to select the term. 3. Enter the subject area, course number,

More information

The 2-core of a Non-homogeneous Hypergraph

The 2-core of a Non-homogeneous Hypergraph July 16, 2012 k-cores A Hypergraph G on vertex set V is a collection E of subsets of V. E is the set of hyperedges. For ordinary graphs, e = 2 for all e E. The k-core of a (hyper)graph is the maximal subgraph

More information

PCLUST: An extension of PROMETHEE to interval clustering

PCLUST: An extension of PROMETHEE to interval clustering PCLUST: An extension of PROMETHEE to interval clustering Renaud Sarrazin 1,2, Yves De Smet 2, Jean Rosenfeld 3 1 MSM division,, Brussels, Belgium 2 CoDE-SMG laboratory, Université libre de Bruxelles, Brussels,

More information

Assortment Planning in School Choice [Preliminary Draft]

Assortment Planning in School Choice [Preliminary Draft] Assortment Planning in School Choice [Preliminary Draft] Peng Shi MIT Operations Research Center, Cambridge, MA 02139, pengshi@mit.edu Draft Date: Jan. 2016 In many public school systems across the US,

More information

Vertex-graceful labelings for some double cycles

Vertex-graceful labelings for some double cycles Vertex-graceful labelings for some double cycles Wai Chee SHIU Department of Mathematics Hong Kong Baptist University. June 28, 2011 Vertex-graceful labelings for some double cycles p. 1/2 Vertex-graceful

More information

Super Matrix Solver-P-ICCG:

Super Matrix Solver-P-ICCG: Super Matrix Solver-P-ICCG: February 2011 VINAS Co., Ltd. Project Development Dept. URL: http://www.vinas.com All trademarks and trade names in this document are properties of their respective owners.

More information

Combinatorics of X -variables in finite type cluster algebras

Combinatorics of X -variables in finite type cluster algebras Combinatorics of X -variables in finite type cluster algebras arxiv:1803.02492 Slides available at www.math.berkeley.edu/~msb Melissa Sherman-Bennett, UC Berkeley AMS Fall Central Sectional Meeting 2018

More information

Business Process Document Student Records: Processing Block Enrollments

Business Process Document Student Records: Processing Block Enrollments Student Records: Processing Block Enrollments- 111407 Department Responsibility/Role File Name Version Document Generation Date 12/5/2007 Date Modified 12/5/2007 Last Changed by Status SA 8.9 - Student

More information

ALEKS. Student Account Home: Class Management through Account Home

ALEKS. Student Account Home: Class Management through Account Home ALEKS Student Account Home: Class Management through Account Home Actions for ACTIVE Classes When there are actions available for an active class, they will appear under the Actions menu. Switch to a New

More information

THE TOPOLOGICAL APPROACH TO SOCIAL CHOICE

THE TOPOLOGICAL APPROACH TO SOCIAL CHOICE THE TOPOLOGICAL APPROACH TO SOCIAL CHOICE WEI HAN CHIA Abstract. Social Choice Theory is a field in economics which studies the possibility of fair aggregation maps of choices. One particularly famous

More information

Database Design. Goal: specification of database schema Methodology:

Database Design. Goal: specification of database schema Methodology: Database Design Goal: specification of database schema Methodology: Use E-R model to get a high-level graphical view of essential components of the model and how they are related Convert E-R diagram to

More information

CHAPTER 8. Copyright Cengage Learning. All rights reserved.

CHAPTER 8. Copyright Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation

More information

Making Science Graphs and Interpreting Data

Making Science Graphs and Interpreting Data Making Science Graphs and Interpreting Data Scientific Graphs: Most scientific graphs are made as line graphs. There may be times when other types would be appropriate, but they are rare. The lines on

More information

Introduction to Computational Manifolds and Applications

Introduction to Computational Manifolds and Applications IMPA - Instituto de Matemática Pura e Aplicada, Rio de Janeiro, RJ, Brazil Introduction to Computational Manifolds and Applications Part 1 - Foundations Prof. Jean Gallier jean@cis.upenn.edu Department

More information

Lattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis 1 Warm-Up to Ponder

Lattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis   1 Warm-Up to Ponder Lattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis http://www.geometer.org/mathcircles/pick.pdf 1 Warm-Up to Ponder 1. Is it possible to draw an equilateral triangle on graph paper so

More information

Claw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version.

Claw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version. Claw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version. Part I. Basic graphs Maria Chudnovsky Department of Industrial Engineering and Operations Research Columbia University,

More information

Graph Adjacency Matrix Automata Joshua Abbott, Phyllis Z. Chinn, Tyler Evans, Allen J. Stewart Humboldt State University, Arcata, California

Graph Adjacency Matrix Automata Joshua Abbott, Phyllis Z. Chinn, Tyler Evans, Allen J. Stewart Humboldt State University, Arcata, California Graph Adjacency Matrix Automata Joshua Abbott, Phyllis Z. Chinn, Tyler Evans, Allen J. Stewart Humboldt State University, Arcata, California Abstract We define a graph adjacency matrix automaton (GAMA)

More information

IPMU July 2-7, 2006 Paris, France

IPMU July 2-7, 2006 Paris, France IPMU July 2-7, 2006 Paris, France Information Processing and Management of Uncertainty in Knowledge-Based Systems Conceptual Design and Implementation of the Salem Chakhar 1 and Abelkader Telmoudi 2 1

More information

1. Classify each number as one or more of the following: natural number, integer, rational number; or irrational number. ,,,,,

1. Classify each number as one or more of the following: natural number, integer, rational number; or irrational number. ,,,,, 1. Classify each number as one or more of the following: natural number, integer, rational number; or irrational number.,,,,, What are the natural numbers in this list? (Use commas to separate answers.

More information

March 29, Display Information for a Selected Period and Teacher Change Class Data. 9. Scheduling Master Schedule (SMS) Builder

March 29, Display Information for a Selected Period and Teacher Change Class Data. 9. Scheduling Master Schedule (SMS) Builder March 29, 2016 1. Overview 2. Display Options Scheduling Options Color Codes Scheduling Statistics 3. Display Information for a Selected Period and Teacher Change Class Data 4. Add a Class 5. Move a Class

More information

Mandatory and Optional Bulk s in ADLC s SIS

Mandatory and Optional Bulk  s in ADLC s SIS Mandatory and Optional Bulk Emails in ADLC s SIS Last Updated: March 15, 2018 This document is intended to assist External Teachers with using the mandatory and optional bulk emails in ADLC s Student Information

More information

Chapter 7 Constraints and Triggers. Spring 2011 Instructor: Hassan Khosravi

Chapter 7 Constraints and Triggers. Spring 2011 Instructor: Hassan Khosravi Chapter 7 Constraints and Triggers Spring 2011 Instructor: Hassan Khosravi SQL: Constraints and Triggers Certain properties we d like our database to hold Modification of the database may break these properties

More information

QUESTIONS FROM 2017 VCAA EXAMS ON PROBABILITY

QUESTIONS FROM 2017 VCAA EXAMS ON PROBABILITY 2017 MATHMETH EXAM 2 Question 3 (19 marks) QUESTIONS FROM 2017 VCAA EXAMS ON PROBABILITY The time Jennifer spends on her homework each day varies, but she does some homework every day. The continuous random

More information

Relational Database: The Relational Data Model; Operations on Database Relations

Relational Database: The Relational Data Model; Operations on Database Relations Relational Database: The Relational Data Model; Operations on Database Relations Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Overview

More information

Virginia - Mathematics Standards of Learning (2009): 6.10d Virginia - Mathematics Standards of Learning (2016): 5.8.a, 5.8.b,

Virginia - Mathematics Standards of Learning (2009): 6.10d Virginia - Mathematics Standards of Learning (2016): 5.8.a, 5.8.b, 1 Lesson Plan Volume of a Rectangular Prism Age group: 5 t h Grade, 6t h Grade Virginia - Mathematics Standards of Learning (2009): 6.10d Virginia - Mathematics Standards of Learning (2016): 5.8.a, 5.8.b,

More information

Discrete Mathematics Course Review 3

Discrete Mathematics Course Review 3 21-228 Discrete Mathematics Course Review 3 This document contains a list of the important definitions and theorems that have been covered thus far in the course. It is not a complete listing of what has

More information

Syrvey on block ciphers

Syrvey on block ciphers Syrvey on block ciphers Anna Rimoldi Department of Mathematics - University of Trento BunnyTn 2012 A. Rimoldi (Univ. Trento) Survey on block ciphers 12 March 2012 1 / 21 Symmetric Key Cryptosystem M-Source

More information

Summer Packet for Students Enrolled in Honors Geometry School Year

Summer Packet for Students Enrolled in Honors Geometry School Year Summer Packet for Students Enrolled in Honors Geometry 2016-2017 School Year Dear Parents and Students, This math packet contains 51 problems related to the 9 th grade Common Core mathematics curriculum.

More information

Process Document Topics for Registrars: Creating PINs in Batch

Process Document Topics for Registrars: Creating PINs in Batch Version 1.0 Document Generation Date 2/21/2008 Date Modified 2/21/2008 Last Changed by ASDS Status Draft Creating PINs in Batch-021508 Concept At some Institutions, students must have a special PIN validated

More information

Efficient Random Assignment with Constrained Rankings

Efficient Random Assignment with Constrained Rankings Efficient Random Assignment with Constrained Rankings Gabriel Carroll Department of Economics, Massachusetts Institute of Technology E52-391, 50 Memorial Drive, Cambridge MA 02142, USA gdc@mit.edu January

More information

Drawing Problem. Possible properties Minimum number of edge crossings Small area Straight or short edges Good representation of graph structure...

Drawing Problem. Possible properties Minimum number of edge crossings Small area Straight or short edges Good representation of graph structure... Graph Drawing Embedding Embedding For a given graph G = (V, E), an embedding (into R 2 ) assigns each vertex a coordinate and each edge a (not necessarily straight) line connecting the corresponding coordinates.

More information

Mathematical and Algorithmic Foundations Linear Programming and Matchings

Mathematical and Algorithmic Foundations Linear Programming and Matchings Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis

More information

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from Discrete Mathematics and It's Applications Kenneth H.

More information

Image Smoothing and Segmentation by Graph Regularization

Image Smoothing and Segmentation by Graph Regularization Image Smoothing and Segmentation by Graph Regularization Sébastien Bougleux 1 and Abderrahim Elmoataz 1 GREYC CNRS UMR 6072, Université de Caen Basse-Normandie ENSICAEN 6 BD du Maréchal Juin, 14050 Caen

More information

DRAWING QUADRATIC GRAPHS (EDEXCEL HIGHER) These questions are suitable for Higher Tier students. All questions should be done without a calculator.

DRAWING QUADRATIC GRAPHS (EDEXCEL HIGHER) These questions are suitable for Higher Tier students. All questions should be done without a calculator. GCSE MATHEMATICS KEY TOPIC PRACTICE SHEETS DRAWING QUADRATIC GRAPHS (EDEXCEL HIGHER) These questions are suitable for Higher Tier students. All questions should be done without a calculator. www.tutor2u.net/maths

More information

Digital Logic Design: a rigorous approach c

Digital Logic Design: a rigorous approach c Digital Logic Design: a rigorous approach c Chapter 4: Directed Graphs Guy Even Moti Medina School of Electrical Engineering Tel-Aviv Univ. October 31, 2017 Book Homepage: http://www.eng.tau.ac.il/~guy/even-medina

More information

Hardware/Software Partitioning for SoCs. EECE Advanced Topics in VLSI Design Spring 2009 Brad Quinton

Hardware/Software Partitioning for SoCs. EECE Advanced Topics in VLSI Design Spring 2009 Brad Quinton Hardware/Software Partitioning for SoCs EECE 579 - Advanced Topics in VLSI Design Spring 2009 Brad Quinton Goals of this Lecture Automatic hardware/software partitioning is big topic... In this lecture,

More information

Overview. Probabilistic Programming. Dijkstra s guarded command language: Syntax. Elementary pgcl ingredients. Lecture #4: Probabilistic GCL

Overview. Probabilistic Programming. Dijkstra s guarded command language: Syntax. Elementary pgcl ingredients. Lecture #4: Probabilistic GCL Overview Lecture #4: Probabilistic GCL 1 Joost-Pieter Katoen 2 3 Recursion RWTH Lecture Series on 2018 Joost-Pieter Katoen 1/31 Joost-Pieter Katoen 2/31 Dijkstra s guarded command language: Syntax Elementary

More information

Lecture Ray Model of Light. Physics Help Q&A: tutor.leiacademy.org

Lecture Ray Model of Light. Physics Help Q&A: tutor.leiacademy.org Lecture 1201 Ray Model of Light Physics Help Q&A: tutor.leiacademy.org Reflection of Light A ray of light, the incident ray, travels in a medium. When it encounters a boundary with a second medium, part

More information

Line RC Delay and Mobility issue

Line RC Delay and Mobility issue Line RC Delay and Mobility issue RC delay (Signal line) RC delay becomes a dominant factor above UHD Mobility (TFT) Line signal decay becomes a serious issue! e e e e e e e 0.5 ~ 1.5 um thick Cu lines

More information

On vertex types of graphs

On vertex types of graphs On vertex types of graphs arxiv:1705.09540v1 [math.co] 26 May 2017 Pu Qiao, Xingzhi Zhan Department of Mathematics, East China Normal University, Shanghai 200241, China Abstract The vertices of a graph

More information

Algorithms for Grid Graphs in the MapReduce Model

Algorithms for Grid Graphs in the MapReduce Model University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Computer Science and Engineering: Theses, Dissertations, and Student Research Computer Science and Engineering, Department

More information

PART 1 GRAPHICAL STRUCTURE

PART 1 GRAPHICAL STRUCTURE PART 1 GRAPHICAL STRUCTURE in this web service in this web service 1 Treewidth and Hypertree Width Georg Gottlob, Gianluigi Greco, Francesco Scarcello This chapter covers methods for identifying islands

More information

Lower bounds and recursive methods for the problem of adjudicating conflicting claims

Lower bounds and recursive methods for the problem of adjudicating conflicting claims Lower bounds and recursive methods for the problem of adjudicating conflicting claims Diego Dominguez University of Rochester March 31, 006 Abstract For the problem of adjudicating conflicting claims,

More information

SHRM Affiliate CMS Membership Database

SHRM Affiliate CMS Membership Database SHRM Affiliate CMS Membership Database Page 1 Contents Introduction... 3 How Can the Website Membership Database be Used?... 4 Search Members... 5 Membership Classification... 6 Membership Expiration Date...

More information

标题 :A gpa 时间限制 :1 秒 内存限制 :256M

标题 :A gpa 时间限制 :1 秒 内存限制 :256M 标题 :A gpa 时间限制 :1 秒 内存限制 :256M Kanade selected n courses in the university. The academic credit of the i-th course is s[i] and the score of the i-th course is c[i]. At the university where she attended,

More information

Enrollment. My Class Schedule / Weekly Schedule

Enrollment. My Class Schedule / Weekly Schedule Enrollment My Class Schedule / Weekly Schedule Navigation: Self Service > Enrollment > My Class Schedule OR Click on My Class Schedule link provided in the Academics section on the Student Center page.

More information

CMPT 354 Database Systems I

CMPT 354 Database Systems I CMPT 354 Database Systems I Chapter 2 Entity Relationship Data Modeling Data models A data model is the specifications for designing data organization in a system. Specify database schema using a data

More information

MATH 350 GRAPH THEORY & COMBINATORICS. Contents

MATH 350 GRAPH THEORY & COMBINATORICS. Contents MATH 350 GRAPH THEORY & COMBINATORICS PROF. SERGEY NORIN, FALL 2013 Contents 1. Basic definitions 1 2. Connectivity 2 3. Trees 3 4. Spanning Trees 3 5. Shortest paths 4 6. Eulerian & Hamiltonian cycles

More information

Efficient Synthesis of Production Schedules by Optimization of Timed Automata

Efficient Synthesis of Production Schedules by Optimization of Timed Automata Efficient Synthesis of Production Schedules by Optimization of Timed Automata Inga Krause Institute of Automatic Control Engineering Technische Universität München inga.krause@mytum.de Joint Advanced Student

More information

Strategy Improvement for Parity Games. A combinatorial perspective

Strategy Improvement for Parity Games. A combinatorial perspective : A combinatorial perspective InfoSys seminar Oxford University Computing Laboratory 28 October 2008 Overview Theorem The strategy improvement algorithm for parity games is a bottom-antipodal sink-finding

More information

Problem Set 3. MATH 776, Fall 2009, Mohr. November 30, 2009

Problem Set 3. MATH 776, Fall 2009, Mohr. November 30, 2009 Problem Set 3 MATH 776, Fall 009, Mohr November 30, 009 1 Problem Proposition 1.1. Adding a new edge to a maximal planar graph of order at least 6 always produces both a T K 5 and a T K 3,3 subgraph. Proof.

More information

Surprisingly Stable Detection with Your Finger tip

Surprisingly Stable Detection with Your Finger tip NEW Fiber Sensor S mart Fiber Measurement Discrimination Presence Surprisingly Stable Detection with Your Finger tip Exceptionally easy operation and stabilizing technology reduce maintenance cost. Communications

More information

Arrays: Higher Dimensional Arrays. CS0007: Introduction to Computer Programming

Arrays: Higher Dimensional Arrays. CS0007: Introduction to Computer Programming Arrays: Higher Dimensional Arrays CS0007: Introduction to Computer Programming Review If the == operator has two array variable operands, what is being compared? The reference variables held in the variables.

More information

Ratios and Proportional Relationships (RP) 6 8 Analyze proportional relationships and use them to solve real-world and mathematical problems.

Ratios and Proportional Relationships (RP) 6 8 Analyze proportional relationships and use them to solve real-world and mathematical problems. Ratios and Proportional Relationships (RP) 6 8 Analyze proportional relationships and use them to solve real-world and mathematical problems. 7.1 Compute unit rates associated with ratios of fractions,

More information

Integer Programming Chapter 9

Integer Programming Chapter 9 Integer Programming Chapter 9 University of Chicago Booth School of Business Kipp Martin October 25, 2017 1 / 40 Outline Key Concepts MILP Set Monoids LP set Relaxation of MILP Set Formulation Quality

More information

SQL DDL. CS3 Database Systems Weeks 4-5 SQL DDL Database design. Key Constraints. Inclusion Constraints

SQL DDL. CS3 Database Systems Weeks 4-5 SQL DDL Database design. Key Constraints. Inclusion Constraints SQL DDL CS3 Database Systems Weeks 4-5 SQL DDL Database design In its simplest use, SQL s Data Definition Language (DDL) provides a name and a type for each column of a table. CREATE TABLE Hikers ( HId

More information

6.3 Poincare's Theorem

6.3 Poincare's Theorem Figure 6.5: The second cut. for some g 0. 6.3 Poincare's Theorem Theorem 6.3.1 (Poincare). Let D be a polygon diagram drawn in the hyperbolic plane such that the lengths of its edges and the interior angles

More information

MapReduce Algorithms. Barna Saha. March 28, 2016

MapReduce Algorithms. Barna Saha. March 28, 2016 MapReduce Algorithms Barna Saha March 28, 2016 Complexity Model for MapReduce Minimum Spanning Tree in MapReduce Computing Dense Subgraph in MapReduce Complexity Model for MapReduce:MRC i Input: finite

More information

Mathematics Gap Analysis Phase I

Mathematics Gap Analysis Phase I Mathematics Gap Analysis Phase I Organizing Structure: The Standards Compared to the Common Core College and Career Readiness Standards The Mathematics College and Career Readiness Standards (CCRS) are

More information

Figure 1: A positive crossing

Figure 1: A positive crossing Notes on Link Universality. Rich Schwartz: In his 1991 paper, Ramsey Theorems for Knots, Links, and Spatial Graphs, Seiya Negami proved a beautiful theorem about linearly embedded complete graphs. These

More information

Review of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16

Review of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16 Review of Sets Review Philippe B. Laval Kennesaw State University Current Semester Philippe B. Laval (KSU) Sets Current Semester 1 / 16 Outline 1 Introduction 2 Definitions, Notations and Examples 3 Special

More information

OPENSEES Soil-Pile Interaction Study under Lateral Spread Loading

OPENSEES Soil-Pile Interaction Study under Lateral Spread Loading OPENSEES Soil-Pile Interaction Study under Lateral Spread Loading Po-Lam - EarthMechanics Pedro Arduino UW Peter Mackenzie-Helnwein UW Overview Introduction Background & Common Practice 3D Analysis of

More information

Mental Math. Grade 9 Mathematics (10F) General Questions. test, what percentage of students obtained at least 50% on the test?

Mental Math. Grade 9 Mathematics (10F) General Questions. test, what percentage of students obtained at least 50% on the test? F 1 Specific Learning Outcome: 9.SS.4 1. Add: -4 + 3.1-9.3 2. If 19 out of 20 students obtained at least 15 on the last mathematics 30 test, what percentage of students obtained at least 50% on the test?

More information

INF4820 Algorithms for AI and NLP. Evaluating Classifiers Clustering

INF4820 Algorithms for AI and NLP. Evaluating Classifiers Clustering INF4820 Algorithms for AI and NLP Evaluating Classifiers Clustering Murhaf Fares & Stephan Oepen Language Technology Group (LTG) September 27, 2017 Today 2 Recap Evaluation of classifiers Unsupervised

More information

SURIEM 2016 Final Report: Games on Graphs

SURIEM 2016 Final Report: Games on Graphs SURIEM 2016 Final Report: Games on Graphs Julie Anne Bowman, Arthur Diep-Nguyen, Rashmika Goswami, Dylan King, Nicholas Lindell, Emily Olson, Robert W. Bell July 14, 2016 1 Introduction The game of Cops

More information

Clustering. Bruno Martins. 1 st Semester 2012/2013

Clustering. Bruno Martins. 1 st Semester 2012/2013 Departamento de Engenharia Informática Instituto Superior Técnico 1 st Semester 2012/2013 Slides baseados nos slides oficiais do livro Mining the Web c Soumen Chakrabarti. Outline 1 Motivation Basic Concepts

More information

Year 8. Revision Exercise April Computer Science CARDINAL NEWMAN CATHOLIC SCHOOL. Student Name : Subject Teacher : Tutor Group:

Year 8. Revision Exercise April Computer Science CARDINAL NEWMAN CATHOLIC SCHOOL. Student Name : Subject Teacher : Tutor Group: CARDINAL NEWMAN CATHOLIC SCHOOL Computer Science Year 8 Revision Exercise April 2017 Student Name : Subject Teacher : Tutor Group: Page 1 of 17 Section A: File Management 1. Develop some materials to advise

More information

Chapter S:II. II. Search Space Representation

Chapter S:II. II. Search Space Representation Chapter S:II II. Search Space Representation Systematic Search Encoding of Problems State-Space Representation Problem-Reduction Representation Choosing a Representation S:II-1 Search Space Representation

More information

I N S T R U C T I O N S F O R U S I NG T H E S T S T I T H I A N S C O L L E G E P O R T A L

I N S T R U C T I O N S F O R U S I NG T H E S T S T I T H I A N S C O L L E G E P O R T A L I N S T R U C T I O N S F O R U S I NG T H E S T S T I T H I A N S C O L L E G E P O R T A L 1. Introduction The St Stithians College secure Portal is used by the College to collect parents electronic

More information

Statistics 202: Data Mining. c Jonathan Taylor. Week 8 Based in part on slides from textbook, slides of Susan Holmes. December 2, / 1

Statistics 202: Data Mining. c Jonathan Taylor. Week 8 Based in part on slides from textbook, slides of Susan Holmes. December 2, / 1 Week 8 Based in part on slides from textbook, slides of Susan Holmes December 2, 2012 1 / 1 Part I Clustering 2 / 1 Clustering Clustering Goal: Finding groups of objects such that the objects in a group

More information

MyELT STUDENT QUICK START GUIDE

MyELT STUDENT QUICK START GUIDE MyELT STUDENT QUICK START GUIDE TABLE OF CONTENTS ABOUT THIS GUIDE... 2 GETTING STARTED... 3 HOW DO I REGISTER FOR AN INSTRUCTOR- LED COURSE?... 3 HOW DO I CREATE A SELF- STUDY ACCOUNT?... 7 WHAT SHOULD

More information

Rational Trigonometry Applied to Robotics

Rational Trigonometry Applied to Robotics Robot Kinematic Modeling using Rational Trigonometry 6 de Novembro de 2007 Overview Overview 1 Overview 2 3 The Fixed Frames Model for Robot Kinematics 4 Conclusions 4 Perspectives and Future Work 5 Q&A

More information

3. Relational Data Model 3.5 The Tuple Relational Calculus

3. Relational Data Model 3.5 The Tuple Relational Calculus 3. Relational Data Model 3.5 The Tuple Relational Calculus forall quantification Syntax: t R(P(t)) semantics: for all tuples t in relation R, P(t) has to be fulfilled example query: Determine all students

More information

Date Lesson TOPIC HOMEWORK. Displaying Data WS 6.1. Measures of Central Tendency WS 6.2. Common Distributions WS 6.6. Outliers WS 6.

Date Lesson TOPIC HOMEWORK. Displaying Data WS 6.1. Measures of Central Tendency WS 6.2. Common Distributions WS 6.6. Outliers WS 6. UNIT 6 ONE VARIABLE STATISTICS Date Lesson TOPIC HOMEWORK 6.1 3.3 6.2 3.4 Displaying Data WS 6.1 Measures of Central Tendency WS 6.2 6.3 6.4 3.5 6.5 3.5 Grouped Data Central Tendency Measures of Spread

More information

Incentive Design Bidderand Market Evolution Bidder of Mobile

Incentive Design Bidderand Market Evolution Bidder of Mobile Allocation rule Allocation rule Incentive Design Bidderand Market Evolution Bidder of Mobile Disclore all private Signaling his private User-Provided information Networks information Mohammad Mahdi Khalili,

More information

What is a Graphon? Daniel Glasscock, June 2013

What is a Graphon? Daniel Glasscock, June 2013 What is a Graphon? Daniel Glasscock, June 2013 These notes complement a talk given for the What is...? seminar at the Ohio State University. The block images in this PDF should be sharp; if they appear

More information

Random strongly regular graphs?

Random strongly regular graphs? Graphs with 3 vertices Random strongly regular graphs? Peter J Cameron School of Mathematical Sciences Queen Mary, University of London London E1 NS, U.K. p.j.cameron@qmul.ac.uk COMB01, Barcelona, 1 September

More information

LIGHT: Two-slit Interference

LIGHT: Two-slit Interference LIGHT: Two-slit Interference Objective: To study interference of light waves and verify the wave nature of light. Apparatus: Two red lasers (wavelength, λ = 633 nm); two orange lasers (λ = 612 nm); two

More information

Aspire. Online Registration for New Student without an Aspire Account

Aspire. Online Registration for New Student without an Aspire Account Aspire Online Registration for New Student without an Aspire Account Before you start this process you will need to have Birth Certificate/Passport and phone numbers for emergency contacts. From the Aspire

More information

Producing Batch Transcripts for Student Groups

Producing Batch Transcripts for Student Groups Producing Batch Transcripts for Student Groups OBJECTIVE: Provides an overview for producing and printing batches of transcripts for specific student groups in PeopleSoft. CONTENTS: LESSON 1 CREATING A

More information

This is a function because no vertical line can be drawn so that it intersects the graph more than once.

This is a function because no vertical line can be drawn so that it intersects the graph more than once. Determine whether each relation is a function. Explain. 1. A function is a relation in which each element of the domain is paired with exactly one element of the range. So, this relation is a function.

More information

Verifying Safety Property of Lustre Programs: Temporal Induction

Verifying Safety Property of Lustre Programs: Temporal Induction 22c181: Formal Methods in Software Engineering The University of Iowa Spring 2008 Verifying Safety Property of Lustre Programs: Temporal Induction Copyright 2008 Cesare Tinelli. These notes are copyrighted

More information

(SM) User Guide. For Schools ************************************************************************* SchoolMagica.com

(SM) User Guide. For Schools ************************************************************************* SchoolMagica.com SchoolMagica (SM) User Guide For Schools ************************************************************************* Table of Contents Start using SchoolMagica:... 3 Login Screen:... 4 Settings:... 5 Payment

More information

Achieving k-anonmity* Privacy Protection Using Generalization and Suppression

Achieving k-anonmity* Privacy Protection Using Generalization and Suppression UT DALLAS Erik Jonsson School of Engineering & Computer Science Achieving k-anonmity* Privacy Protection Using Generalization and Suppression Murat Kantarcioglu Based on Sweeney 2002 paper Releasing Private

More information

Data Feedback Report Tutorial Script Data Collection Cycle

Data Feedback Report Tutorial Script Data Collection Cycle Data Feedback Report Tutorial Script 2014-15 Data Collection Cycle The IPEDS Data Center includes a wide-range of functional options, including access to current and previous versions of your institution's

More information

Clustering. Robert M. Haralick. Computer Science, Graduate Center City University of New York

Clustering. Robert M. Haralick. Computer Science, Graduate Center City University of New York Clustering Robert M. Haralick Computer Science, Graduate Center City University of New York Outline K-means 1 K-means 2 3 4 5 Clustering K-means The purpose of clustering is to determine the similarity

More information

Mutation & Data Abstraction Summer 2018 Discussion 4: July 3, Mutable Lists

Mutation & Data Abstraction Summer 2018 Discussion 4: July 3, Mutable Lists CS 61A Mutation & Data Abstraction Summer 2018 Discussion 4: July 3, 2018 1 Mutable Lists Let s imagine you order a mushroom and cheese pizza from La Val s, and that they represent your order as a list:

More information

Dissections of polygons into convex polygons

Dissections of polygons into convex polygons Dissections of polygons into convex polygons Andrzej Żak Faculty of Applied Mathematics, AGH University of Science and Technology al. Mickiewicza 30, 30 059 Kraków, Poland e-mail: zakandrz@uci.agh.edu.pl

More information