Solution of the Airline ToD Problem using Severely Limited Subsequence
|
|
- Anna Mathews
- 5 years ago
- Views:
Transcription
1 Solution of the Airline ToD Problem using Severely Limited Subsequence James Priestley Department of Engineering Science University of Auckland New Zealand Abstract The minimum-cost Tour-of-Duty (ToD) Problem is extremely well known in the airline industry. ToDs are typically constructed by considering the complete set of subsequent flights (subsequences) that may be operated by a crewmember after they operate a given flight. The column dimension of the resulting model is generally extremely large, so column generation is used. Limiting the set of subsequences that may be considered is beneficial in terms of reducing the number of columns and improving the integer properties of the LP relaxation. The downside to this approach is that solution quality can be compromised if the limited subsequence set is not carefully selected. We investigate how to dynamically alter the limited subsequence set throughout the solution process so as not to compromise solution quality, while still maintaining the benefits of limiting subsequence. The use of dual stabilisation and constraint aggregation techniques in this context will be discussed. We present comparative results from real airline problems to demonstrate the efficacy of this technique. 1 Introduction Major airlines face multi-million dollar operating costs and one of the biggest components of these is the costs associated with aircrew. Crew costs can be controlled by carefully planning the assignment of crew to scheduled flights. This assignment is known as the Tour-of-Duty (ToD) problem, or alternatively as the Pairings problem, and has a long history in the airline industry. Arabeyre et al. (1969) give a comprehensive summary of the early work in airline crew scheduling. Goldie (1996) gives a more recent summary and outlines details of the software on which our research is based. This paper describes and demonstrates an improved method for solving the ToD problem. The mathematical models formulated to describe the ToD Problem are generally difficult to solve. There are two reasons for this difficulty. First, the formulations result in massive zero-one integer programmes, especially in the column dimension which can number in the billions. The large number of columns makes a priori variable generation
2 impractical so column generation is used. However, the resulting resource constrained shortest path sub-problems are time consuming to solve. Second, the integer properties of the resulting LP-Relaxation are generally poor resulting in very fractional solutions. Consequently, a large amount of Branch and Bound needs to be performed in order to obtain integer solutions. Rather than attempting to solve these massive zero-one integer programmes a number of simplified approaches have been proposed in order to obtain good quality solutions in a reasonable time. Some authors have concentrated on the development of heuristic methods, for example Baker and Fisher (1981), while others have attempted to use decomposition techniques to reduce the size of the problem, for example Wren, Smith, and Miller (1985). Another approach, proposed by Ryan and Falkner (1988), aims to reduce the number of ToDs and obtain less fractional LP solutions through a technique called Subsequence Limitation. This technique is further described by Shah (2000) in the context of domestic operations by Ansett Australia. While effective, the fundamental drawback to this approach is that solutions can be sub-optimal if the limitation is not performed carefully. This paper begins with an introduction to the ToD problem and to the concept of subsequence. We describe Subsequence Limitation and outline its benefits and its drawbacks. We show how constraint aggregation, Elhallaoui et al. (2004), can be used to improve the performance of this technique. We then describe a new technique for solving the ToD Problem called Subsequence Identification and outline its similarities and difference to Subsequence Limitation and column generation. We show how dual stabilisation, du Merle et al. (1999), can be used to improve the performance of this technique. Preliminary computational results for solutions of real world ToD Problems using Subsequence Identification are presented. This paper concludes with a summary and outlines the future directions of the research that we are conducting. 2 The ToD Problem 2.1 The Larger Problem The ToD Problem is part of a series of optimizations that airlines must solve. This process can be divided into three stages: schedules planning, crew scheduling, and day of operation. In the schedules planning stage the airline decides where it will be flying to, when these flights will occur, and which aircraft will be operating each flight. The crew scheduling stage is divided into two parts: ToD planning and rostering. ToD planning involves assigning a particular class of crew to every flight and is the focus of this paper. Rostering involves assigning the ToDs created during the ToD planning stage to individual crew members. Finally, the day of operation stage is where disruptions to the optimised plan get fixed. 2.2 The Composition of a ToD Conditions imposed by employment contracts and Civil Aviation Authority rules limit the maximum length of time that a crew can safely work for and the minimum amount of rest that they must have after work. Since crew cannot work as long as aircraft the assignment of crew to flights must be different from the assignment of aircraft to flights. A ToD consists of a series of duty periods, where the crew is working, separated by rest periods where they are not. A duty period consists of one or more flights where the crew is either operating (ie. carrying out the duties necessary for the operation of an aircraft) or
3 paxing (ie. travelling on an aircraft as passengers to move to another location). A ToD must start and end at the same crew base so that the crew can return home after work. A ToD is generic to a class of crew because it is not assigned to an individual until later in the rostering problem. 2.3 The ToD Model Given a schedule containing m flights we require that each flight be operated by exactly one crew. A crew schedule is a set of ToDs that combine to cover all the flights in the schedule. We wish to find the minimum cost crew schedule. The cost of a ToD is made up of several components. There is the cost of paying the crew for the hours that they work, including overtime if a ToD is especially long. Then there are additional expenses such as allowances for meals, accommodation costs, and paxing. Given a set of n possible ToDs the ToD Problem can be formulated as a set partitioning problem. Indices i = Flight: 1,,m j = ToD: 1,,n Parameters c = Cost of the j' th ToD j 1, a ij = { 0, otherwise Decision Variables 1, if 1) x j = { 0, otherwise Model ToD n 2) Minimise j = if the j' th ToD coversflight i the j' th ToD is includedin the crew schedule 1 c j x j n 3) a x, i 1,..., m j = ij j = 1 = 1 Explanation 1) Ensure that each ToD is either used once in the crew schedule or not at all 2) Objective is to minimise the total cost of the ToDs used in the crew schedule 3) Ensure that each flight in the flight schedule is operated by one crew 3 Subsequences 3.1 Definition of Subsequence The subsequences of a flight F are the set of subsequent flights S that can legally follow F in a ToD. Figure 1 (below) shows flight F arriving at an airport followed by a series of flights departing from the same airport. The flights that are subsequences of F are labelled as S 1 through to S 4.
4 F Night S 3 S 4 An Airport Time Minimum ground time S 1 S 2 Maximum ground time Subsequence of F Not a Subsequence of F Figure 1: The subsequences of a flight F. The amount of time required between two flights in a ToD is called the minimum ground time and is typically between 30 and 45 minutes. Any flight that leaves before this time has elapsed this cannot be subsequence of flight F. Similarly any flight that leaves the airport after a maximum ground time has elapsed, typically at least a day, cannot be a subsequence of flight F. 3.2 Classification of Subsequence Subsequences can belong to one of the following four classes: 1. Follow-on subsequence. The crew do not change aircraft and operate the subsequent flight. 2. Same-day subsequence. The crew change aircraft and operate the subsequent flight which leaves on the same day as the first flight arrives. 3. Overnight subsequence. The crew change aircraft and operate the subsequent flight which leaves on the day after the first flight arrives. 4. Paxing subsequence. The crew is paxing on the subsequent flight. 3.3 Subsequence Counts The subsequence count for a flight F is the number of different subsequent flights that can legally follow F in a ToD. Assuming that the flights i=1,..,m are ordered in increasing order of departure time then the subsequence count for a flight F, denoted SC(F), can be calculated using the following formula: 4) SC(F) = {t [a Fj = 1, a ij = 0 for F < i < t, a tj = 1], j = 1,,n} In Figure 1 the subsequence count of flight F is four. In a typical problem the subsequence counts for a flight range from between twenty and forty. Generally the busier the airport the more subsequences a flight will have. A flight is said to have unique subsequence if its subsequence count is equal to one. An integer solution to the ToD problem defines a unique subsequence for every flight. The subsequences defined by the optimal integer solution are called the optimal subsequences.
5 4 Subsequence Limitation 4.1 The Concept of Subsequence Limitation Subsequence Limitation involves solving the ToD problem while allowing only a reduced set of subsequences, called the Limited Subsequence Set (LSS), to be used rather than all of the legal subsequences. If the LSS contains all of the optimal subsequences then the cost of the solution obtained will be identical to that obtained when solving with all of the subsequences. Reducing the size of the LSS is beneficial and will result in faster solution times for reasons explained below. Consequently, the aim when selecting the LSS is to reduce subsequence counts for all flights by as much as possible while still retaining the optimal subsequences as part of the set. This is done by an a priori heuristic that places subsequences thought likely to be optimal into the LSS. 4.2 The Benefits of Subsequence Limitation There are three benefits of reducing the size of the LSS. First, reducing the number of subsequences reduces the number of variables (n) because any ToDs containing subsequences that are not in the LSS are not allowed to be part of the solution. This makes both pricing and column generation faster, and if the LSS is small enough it may even be possible to use a priori variable generation. Second, reducing the number of subsequences improves the integer properties of the LP-Relaxation. Berge (1972) demonstrated that if a matrix is balanced then all of its extreme points will be naturally integer. A zero-one matrix is balanced if and only if it contains no odd order two-cycle sub matrices (ie. an odd order sub matrix with all its row and column sums equal to two). Unfortunately the real world rarely produces balanced matrices. It is the prevalence of odd order cycles that cause factional solutions in set partitioning problems and make integrality difficult to obtain. However, if the subsequence counts for almost all flights are small then the number of odd order cycles will also be small. Fewer subsequences mean fewer odd order cycles, which in turn means fewer fractions, thus reducing the amount of branch and bound required to obtain integrality. Third, reducing the number of subsequences makes it easier to aggregate constraints. Constraints can be aggregated if the flights they represent must be operated together and cannot be operated individually in a ToD. Reducing the number of constraints reduces the cost of a simplex iteration, O(m 3 ) for a sparse Bartels-Golub method, which in turn leads to shorter solution times. The more flights that are limited to unique subsequence the more opportunities for constraint aggregation arise. To obtain individual dual variables for the aggregated constraints a dual disaggregation strategy proposed by Elhallaoui et al. (2004) can be used. 4.3 How to Select the Limited Subsequence Set There are two ways to select the LSS in an intelligent manner. The first is to use knowledge about the relative likelihoods of the four subsequence classes being present in the optimal solution. Typically around two thirds of the optimal subsequences are of the follow-on class. Since there is only one of these subsequences for each flight this makes an excellent starting point for a LSS. There is a strong objective pressure against long time gaps between same-day subsequences. The same is true for overnights but to a lesser extent. The likelihood of an overnight subsequence being used varies with the time of day: less likely in
6 the morning, much more likely late at night. Paxing subsequences are the hardest to predict. This is because there are generally many of them but only a few are used in the optimal solution and there is no real indication of which, if any, will be required. The second approach is to use previous solutions to make predictions about the likely solution to the current problem. Airlines solve the ToD problem on a regular basis, often weekly. Schedules on the other hand, tend to stay roughly constant for longer periods for customer convenience. Consequently, solutions to two similar schedules will often share common subsequences. 4.4 The Drawback to Subsequence Limitation Unfortunately, no a priori selection heuristic is perfect and eventually one or more optimal subsequences will be accidentally excluded from the LSS. The result of such an exclusion is that the optimal integer solution can no longer be obtained using the LSS and the resulting integer solution will have a higher objective value. The amount of objective degradation depends on the number and class of the subsequences that are excluded. Fortunately, ToD problems tend to have several possible integer solutions with similar objective values. For a typical problem excluding a small number of optimal subsequences has a negligible effect on the objective function. In our experiments we needed to randomly exclude, on average, 4.8% of the optimal subsequences to damage the LP objective by 0.1% (a fifth of the IP bound-gap in these problems). However, as the number of excluded subsequences grows the cost of the crew schedule increases as more expensive ToDs are required to cover the flights. If enough optimal subsequences are excluded the problem may eventually become infeasible. The fundamental drawback to Subsequence Limitation is that it is impossible to tell whether an integer solution is of good quality or not. The reason for this is that it is always possible that a slightly different LSS would have resulted in a much cheaper solution. In order to check the solution quality a comparison with a solution obtained when allowing all of the subsequences is required, but clearly would defeat the purpose of performing subsequence limitation. Consequently, the limitation heuristic needs to be liberal when selecting the LSS to ensure that all, or almost all, of the optimal subsequences are included. Typically a subsequence count of at least ten per flight is required to obtain good quality solutions. The downside to this is that the larger the LSS becomes, the less pronounced the benefits limiting subsequence are. 5 Subsequence Identification 5.1 The Concept of Subsequence Identification The aim of our Subsequence Identification technique is to exploit all of the benefits of limiting subsequence while avoiding the drawback of Subsequence Limitation outlined above. Subsequence Identification also involves solving the ToD problem using reduced set of subsequences. The key difference between the two methods is that for Subsequence Limitation this set is dynamic as opposed to the static LSS used in the Subsequence Limitation technique. This allows for the progressive correction of any mistakes made by the initial selection heuristic throughout the solution process. Consequently, possible exclusion of optimal subsequences by the initial selection heuristic is not the critical problem it is for Subsequence Limitation. This allows the employment of a far more aggressive limitation strategy. We refer to this as solving using a
7 Severely Limited Subsequence Set (SLSS). We want the SLSS to have subsequence counts of no more than three or four for all flights and ideally to have unique subsequence wherever we can be sure of our decision. 5.2 Modifying the Severely Limited Subsequence Set The SLSS can be modified by the addition or removal of subsequences. Decisions to modify the limited subsequence set are made by the subsequence selector. Any missing optimal subsequences are identified and added to the SLSS. Similarly, any non-optimal subsequences are identified and removed from the SLSS in order to keep the set small. The subsequence selector can add subsequences from a set called the Candidate Subsequence Set (CSS). The CSS is a superset of the SLSS and is also a dynamic set. The subsequence selector uses dual variable information to determine which, if any, subsequences should be added to the SLSS from the CSS. In a process similar to column generation the current dual vector is passed to a ToD generator which finds ToDs with negative reduced costs. However unlike column generation, the columns representing the negative reduced cost ToDs are not added to the LP. Instead the generated ToDs are analysed by the subsequence selector in order to make decisions about the SLSS. The subsequence selector gathers statistics about the ToDs it receives and these form the basis for its decisions. The statistics fall into three broad categories. First, the number of ToDs that contain a subsequence is counted. Second, the number of different dual vectors that produce ToDs containing a subsequence is counted. Third, the reduced costs of those ToDs and the contribution of individual subsequences to those reduced costs are analysed. The threshold for adding a subsequence is variable. It depends on the class of the subsequence being considered and on an a priori assessment of its likelihood of being an optimal subsequence. For instance, a higher qualification standard is required for paxing subsequences than for same-day subsequences. The current subsequence count for the flight is also taken into consideration. The more subsequences a flight has in the SLSS the less likely we are to add additional subsequences for that flight. Similar considerations apply to the removal of subsequences. If a ToD containing a subsequence is in the basis at positive value then the subsequence is in use, otherwise it is unused. The use of all subsequences in the SLSS is monitored on a regular basis. The less a subsequence is used the more likely it is to be removed. Especially if the subsequence count for the flight is high or the subsequence has been in the SLSS for many iterations. Adding a subsequence to the SLSS results in the addition of a set of columns to the LP. These columns represent all the ToDs that contain the subsequence to be added but with the restriction that all of their other subsequences must be members of the SLSS. Removing a subsequence from the SLSS results in the removal of all columns representing ToDs that contain that subsequence from the LP. 5.3 Assessing Solution Quality Once an integer solution has been found using Subsequence Identification the quality of that solution is assessed. This ensures that the SLSS contains all, or at least nearly all, of the optimal subsequences and that consequently the solution quality has not been harmed. A fractional solution provides a lower bound on the objective value of an integer solution and is used as a measure of solution quality. The CSS is dynamic and can be expanded to include all legal subsequences for all flights. If no negative reduced cost ToDs
8 can be generated from the expanded CSS using the dual variables from the LP solution then the integer solution obtained is optimal. If negative reduced cost ToDs are found it will be because they contain subsequences that were not part of SLSS. These subsequences can then be added to the SLSS and the LP can continue to solve. So long as the LP lower bound does not significantly decrease with the continued addition of subsequences then the integer solution is of good quality. If a significant objective decrease does occur after the addition of subsequences then branch and bound can be restarted from the new LP solution using the expanded SLSS. In most cases we do not expect the objective to improve significantly because the subsequence selector should ensure that the SLSS contains all of the optimal subsequences. 5.4 Dual Stabilisation Dual variable information is crucial because it determines the content of the ToDs examined by the subsequence selector and thus the quality of the SLSS. Unfortunately the dual variables become unstable whenever the SLSS is altered. This is problematic because alterations to the SLSS occur frequently when performing Subsequence Identification. To combat this problem we perform dual stabilisation. The following method is an adaptation of the stabilisation technique proposed by du Merle et al. (1999). T Τ T 5) min c x δ y + δ + y+ 6) s.t. Ax y + y+ = em 7) x, y, y + 0 Slack (y + ) and surplus (y - ) variables are added to every constraint in the model (6) and are bounded between zero and one (7). The costs on these variables + and - (5) provide an upper and lower bound respectively on the value of each dual variable. For a feasible solution all stabilisation variables must be at the value zero. Progressively increasing the costs of the stabilisation variables will force them from the basis. By adjusting the bounds throughout the solution process the variation of the dual variables can be controlled. Our experiments show that using dual stabilisation improves the performance of Subsequence Limitation by allowing missing optimal subsequences to be identified earlier. 6 Computational Results All computational tests are carried out on a desktop computer with an Intel 3 GHz Pentium IV processor, 768 megabytes of RAM, Microsoft Windows 2000 operating system, and with the programs written and compiled in Microsoft Visual C++ Version 6.0. The Global Pairings Optimiser was used in conjunction with the ZIP simplex solver, Ryan (1980). We compare our results, in Table 1 (below), using Subsequence Identification to a regular solution process across a selection of four different ToD problems taken from two different airlines. The relative sizes of the problems are indicated by the number of constraints. The composition of the initial SLSS was limited to follow-on subsequences only. All four problems show a reduction in the total amount of time required to solve the problem when using Subsequence Identification. The integer objective values are identical for two of the problems and are well within the 0.5% bound tolerance for the other two
9 problems. Small reductions in the percentage of fractional variables in the LP solutions are observed for all problems. A reduction in the number of branch and bound nodes required to obtain an integer solution were observed in three of the problems. Optimisation Number of constraints Regular Solve Number of LP Iterations LP Solution Time (s) % of Basic Variables Fractional Branch and Bound Nodes Branch and Bound Time (s) Integer Objective Total Time (s) Subsequence Identification Number of LP Iterations LP Solution Time (s) % of Variables Fractional Branch and Bound Nodes Branch and Bound Time (s) Integer Objective Total Time (s) Total Time Saved (s) Table 1: Computational results for four problems comparing the Subsequence Identification technique to a regular solve. 7 Conclusions The results demonstrate that Subsequence Identification can be successfully used to reduce the solution time of the ToD problem without harming the quality of the solution. The majority of the time saving in these problems is obtained during the LP solution rather than the branch and bound. However, this is not particularly surprising given that these problems tended not to be very fractional and thus did not require much branch and bound to achieve integrality. The reductions in the percentage of fractions and branch and bound times are encouraging and we expect these reductions to become more pronounced on more fractional problems. A well chosen SLSS can greatly improve the performance Subsequence Identification. Our experiments show that the more optimal subsequences that are initially included the faster a solution can be obtained. We are continuing to develop a selection heuristic for seeding the SLSS and will be investigating how to use previous solutions to aid our predictions. We are investigating how to better integrate Subsequence Identification with the decisions made during branch and bound. We intend to implement and investigate the constraint aggregation technique propose by Elhallaoui et al. (2004). We also have a preliminary parallel implementation of the Subsequence Identification process
10 Acknowledgements I wish to thank my supervisor Prof. David M Ryan for all of his support and encouragement. I also wish to thank Optimal Decision Technologies ( and in particular Dr. Paul Day, for use of the Global Pairings Optimiser software and for their assistance. References Arabeyre, A., Fearnley, J., Steiger, F., and W. Teather The airline crew scheduling problem: a survey. Transportation Science 3. pp Baker, E. and M. Fisher Computational results for very large air crew scheduling problems. Omega 9. pp Berge, C Balanced Matrices. Mathematical Programming 2. pp Day, P Flight Attendant Rostering for Short-haul Airline Operations. The University of Auckland. Elhallaoui, I., Villeneuve, D.,Soumis, F., and G. Desaulniers Dynamic Aggregation of Set Partitioning in Column Generation. Les Cahiers du GERAD. pp Goldie, A Optimal Airline Crew Scheduling Using Dynamic Column Generation. The University of Auckland. du Merle, O., Villeneuve, D,. Derosiers, J,. and P. Hansen Stabilized Column Generation. Discrete Mathematics, 194. Ryan, D. ZIP A zero-one integer programming package for scheduling Report C.S.S. 85, A.E.R.E. Harwell, Oxfordshire. Ryan, D. and J. Falkner On the Integer properties of Scheduling Set Partitioning Models. European Journal of Operations Research, 35 (1988). pp Shah, S Improving the efficiency of the ToD Optimiser for very Large Flight Schedules. The University of Auckland. pp Wren, A., Smith, B., and A. Miller Complementary approaches to crew scheduling. Computer Scheduling of Public Transport, 2. pp
Subsequence Generation for the Airline Crew Pairing Problem
Downloaded from orbit.dtu.dk on: Sep 10, 2018 Subsequence Generation for the Airline Crew Pairing Problem Rasmussen, Matias Sevel; Lusby, Richard Martin ; Ryan, David; Larsen, Jesper Publication date:
More informationUsing Nested Column Generation & Generic Programming to solve Staff Scheduling Problems:
Using Nested Column Generation & Generic Programming to solve Staff Scheduling Problems: Using Compile-time Customisation to create a Flexible C++ Engine for Staff Rostering Andrew Mason & Ed Bulog Department
More informationTransportation Timetabling
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING 1. Sports Timetabling Lecture 16 Transportation Timetabling Marco Chiarandini 2. Transportation Timetabling Tanker Scheduling Air Transport Train Timetabling
More informationTwo-stage column generation and applications in container terminal management
Two-stage column generation and applications in container terminal management Ilaria Vacca Matteo Salani Michel Bierlaire Transport and Mobility Laboratory EPFL 8th Swiss Transport Research Conference
More informationAircraft routing for on-demand air transportation with service upgrade and maintenance events: compact model and case study
Aircraft routing for on-demand air transportation with service upgrade and maintenance events: compact model and case study Pedro Munari, Aldair Alvarez Production Engineering Department, Federal University
More informationChapter 12. Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks
Chapter 12 Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks 1 Outline CR network (CRN) properties Mathematical models at multiple layers Case study 2 Traditional Radio vs CR Traditional
More informationColumn Generation. A short Introduction. Martin Riedler. AC Retreat
Column Generation A short Introduction Martin Riedler AC Retreat Contents 1 Introduction 2 Motivation 3 Further Notes MR Column Generation June 29 July 1 2 / 13 Basic Idea We already heard about Cutting
More informationUncertainty Feature Optimization for the Airline Scheduling Problem
1 Uncertainty Feature Optimization for the Airline Scheduling Problem Niklaus Eggenberg Dr. Matteo Salani Funded by Swiss National Science Foundation (SNSF) 2 Outline Uncertainty Feature Optimization (UFO)
More informationBranch-and-cut for a real-life highly constrained soccer tournament scheduling problem
Branch-and-cut for a real-life highly constrained soccer tournament scheduling problem Guillermo Durán 1, Thiago F. Noronha 2, Celso C. Ribeiro 3, Sebastián Souyris 1, and Andrés Weintraub 1 1 Department
More informationAssignment Problem. Introduction. Formulation of an assignment problem
Assignment Problem Introduction The assignment problem is a special type of transportation problem, where the objective is to minimize the cost or time of completing a number of jobs by a number of persons.
More informationScheduling. Radek Mařík. April 28, 2015 FEE CTU, K Radek Mařík Scheduling April 28, / 48
Scheduling Radek Mařík FEE CTU, K13132 April 28, 2015 Radek Mařík (marikr@fel.cvut.cz) Scheduling April 28, 2015 1 / 48 Outline 1 Introduction to Scheduling Methodology Overview 2 Classification of Scheduling
More informationFor reasons of tractability, the airline scheduling problem has traditionally been sequentially decomposed
Published online ahead of print February 8, 2012 Articles in Advance, pp. 1 13 ISSN 0041-1655 (print) ISSN 1526-5447 (online) http://dx.doi.org/10.1287/trsc.1110.0395 2012 INFORMS Robust Airline Schedule
More informationRolling Partial Rescheduling with Dual Objectives for Single Machine Subject to Disruptions 1)
Vol.32, No.5 ACTA AUTOMATICA SINICA September, 2006 Rolling Partial Rescheduling with Dual Objectives for Single Machine Subject to Disruptions 1) WANG Bing 1,2 XI Yu-Geng 2 1 (School of Information Engineering,
More informationOFDM Pilot Optimization for the Communication and Localization Trade Off
SPCOMNAV Communications and Navigation OFDM Pilot Optimization for the Communication and Localization Trade Off A. Lee Swindlehurst Dept. of Electrical Engineering and Computer Science The Henry Samueli
More informationTrip Assignment. Lecture Notes in Transportation Systems Engineering. Prof. Tom V. Mathew. 1 Overview 1. 2 Link cost function 2
Trip Assignment Lecture Notes in Transportation Systems Engineering Prof. Tom V. Mathew Contents 1 Overview 1 2 Link cost function 2 3 All-or-nothing assignment 3 4 User equilibrium assignment (UE) 3 5
More informationECE/ system of. Summary /CES/2012/55. Paris, 6-8 June successfully. an integrated data collection. GE.
United Nations Economic and Social Council Distr.: General 15 May 2012 ECE/ /CES/2012/55 English only Economic Commission for Europe Conference of European Statisticians Sixtieth plenary session Paris,
More informationControl of the Contract of a Public Transport Service
Control of the Contract of a Public Transport Service Andrea Lodi, Enrico Malaguti, Nicolás E. Stier-Moses Tommaso Bonino DEIS, University of Bologna Graduate School of Business, Columbia University SRM
More informationAn applied optimization based method for line planning to minimize travel time
Downloaded from orbit.dtu.dk on: Dec 15, 2017 An applied optimization based method for line planning to minimize travel time Bull, Simon Henry; Rezanova, Natalia Jurjevna; Lusby, Richard Martin ; Larsen,
More informationConstruction of periodic timetables on a suburban rail network-case study from Mumbai
Construction of periodic timetables on a suburban rail network-case study from Mumbai Soumya Dutta a,1, Narayan Rangaraj b,2, Madhu Belur a,3, Shashank Dangayach c,4, Karuna Singh d,5 a Department of Electrical
More informationAn improved strategy for solving Sudoku by sparse optimization methods
An improved strategy for solving Sudoku by sparse optimization methods Yuchao Tang, Zhenggang Wu 2, Chuanxi Zhu. Department of Mathematics, Nanchang University, Nanchang 33003, P.R. China 2. School of
More informationDistributed Collaborative Path Planning in Sensor Networks with Multiple Mobile Sensor Nodes
7th Mediterranean Conference on Control & Automation Makedonia Palace, Thessaloniki, Greece June 4-6, 009 Distributed Collaborative Path Planning in Sensor Networks with Multiple Mobile Sensor Nodes Theofanis
More informationMATRIX SAMPLING DESIGNS FOR THE YEAR2000 CENSUS. Alfredo Navarro and Richard A. Griffin l Alfredo Navarro, Bureau of the Census, Washington DC 20233
MATRIX SAMPLING DESIGNS FOR THE YEAR2000 CENSUS Alfredo Navarro and Richard A. Griffin l Alfredo Navarro, Bureau of the Census, Washington DC 20233 I. Introduction and Background Over the past fifty years,
More informationBasic Probability Concepts
6.1 Basic Probability Concepts How likely is rain tomorrow? What are the chances that you will pass your driving test on the first attempt? What are the odds that the flight will be on time when you go
More informationTHERE is a growing need for high-performance and. Static Leakage Reduction Through Simultaneous V t /T ox and State Assignment
1014 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 24, NO. 7, JULY 2005 Static Leakage Reduction Through Simultaneous V t /T ox and State Assignment Dongwoo Lee, Student
More informationA GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS
A GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS C. COMMANDER, C.A.S. OLIVEIRA, P.M. PARDALOS, AND M.G.C. RESENDE ABSTRACT. Ad hoc networks are composed of a set of wireless
More informationImproved Draws for Highland Dance
Improved Draws for Highland Dance Tim B. Swartz Abstract In the sport of Highland Dance, Championships are often contested where the order of dance is randomized in each of the four dances. As it is a
More informationUNIT-II LOW POWER VLSI DESIGN APPROACHES
UNIT-II LOW POWER VLSI DESIGN APPROACHES Low power Design through Voltage Scaling: The switching power dissipation in CMOS digital integrated circuits is a strong function of the power supply voltage.
More informationA new mixed integer linear programming formulation for one problem of exploration of online social networks
manuscript No. (will be inserted by the editor) A new mixed integer linear programming formulation for one problem of exploration of online social networks Aleksandra Petrović Received: date / Accepted:
More informationABM-DTA Deep Integration: Results from the Columbus and Atlanta SHRP C10 Implementations
ABM-DTA Deep Integration: Results from the Columbus and Atlanta SHRP C10 Implementations presented by Matt Stratton, WSP USA October 17, 2017 New CT-RAMP Integrable w/dta Enhanced temporal resolution:
More informationDynamic Programming. Objective
Dynamic Programming Richard de Neufville Professor of Engineering Systems and of Civil and Environmental Engineering MIT Massachusetts Institute of Technology Dynamic Programming Slide 1 of 43 Objective
More informationDynamic Programming. Objective
Dynamic Programming Richard de Neufville Professor of Engineering Systems and of Civil and Environmental Engineering MIT Massachusetts Institute of Technology Dynamic Programming Slide 1 of 35 Objective
More informationFree Cell Solver. Copyright 2001 Kevin Atkinson Shari Holstege December 11, 2001
Free Cell Solver Copyright 2001 Kevin Atkinson Shari Holstege December 11, 2001 Abstract We created an agent that plays the Free Cell version of Solitaire by searching through the space of possible sequences
More informationThe Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis
The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis Jeffery L. Kennington Mark W. Lewis Department of Computer
More informationMehrdad Amirghasemi a* Reza Zamani a
The roles of evolutionary computation, fitness landscape, constructive methods and local searches in the development of adaptive systems for infrastructure planning Mehrdad Amirghasemi a* Reza Zamani a
More information37 Game Theory. Bebe b1 b2 b3. a Abe a a A Two-Person Zero-Sum Game
37 Game Theory Game theory is one of the most interesting topics of discrete mathematics. The principal theorem of game theory is sublime and wonderful. We will merely assume this theorem and use it to
More informationDecoding Distance-preserving Permutation Codes for Power-line Communications
Decoding Distance-preserving Permutation Codes for Power-line Communications Theo G. Swart and Hendrik C. Ferreira Department of Electrical and Electronic Engineering Science, University of Johannesburg,
More informationA GRASP heuristic for the Cooperative Communication Problem in Ad Hoc Networks
MIC2005: The Sixth Metaheuristics International Conference??-1 A GRASP heuristic for the Cooperative Communication Problem in Ad Hoc Networks Clayton Commander Carlos A.S. Oliveira Panos M. Pardalos Mauricio
More informationData sources data processing
Data sources data processing Developing National Systems of Tourism Statistics: Challenges and Good Practices Regional Workshop for the CIS countries, 29 June 2 July 2010 United Nations Statistics Division
More informationFast Sorting and Pattern-Avoiding Permutations
Fast Sorting and Pattern-Avoiding Permutations David Arthur Stanford University darthur@cs.stanford.edu Abstract We say a permutation π avoids a pattern σ if no length σ subsequence of π is ordered in
More informationAI Plays Yun Nie (yunn), Wenqi Hou (wenqihou), Yicheng An (yicheng)
AI Plays 2048 Yun Nie (yunn), Wenqi Hou (wenqihou), Yicheng An (yicheng) Abstract The strategy game 2048 gained great popularity quickly. Although it is easy to play, people cannot win the game easily,
More informationA Comparative Study of Quality of Service Routing Schemes That Tolerate Imprecise State Information
A Comparative Study of Quality of Service Routing Schemes That Tolerate Imprecise State Information Xin Yuan Wei Zheng Department of Computer Science, Florida State University, Tallahassee, FL 330 {xyuan,zheng}@cs.fsu.edu
More informationGeneralized Game Trees
Generalized Game Trees Richard E. Korf Computer Science Department University of California, Los Angeles Los Angeles, Ca. 90024 Abstract We consider two generalizations of the standard two-player game
More informationModule 7-4 N-Area Reliability Program (NARP)
Module 7-4 N-Area Reliability Program (NARP) Chanan Singh Associated Power Analysts College Station, Texas N-Area Reliability Program A Monte Carlo Simulation Program, originally developed for studying
More informationMultitree Decoding and Multitree-Aided LDPC Decoding
Multitree Decoding and Multitree-Aided LDPC Decoding Maja Ostojic and Hans-Andrea Loeliger Dept. of Information Technology and Electrical Engineering ETH Zurich, Switzerland Email: {ostojic,loeliger}@isi.ee.ethz.ch
More informationAn Optimization Approach for Real Time Evacuation Reroute. Planning
An Optimization Approach for Real Time Evacuation Reroute Planning Gino J. Lim and M. Reza Baharnemati and Seon Jin Kim November 16, 2015 Abstract This paper addresses evacuation route management in the
More informationChapter 4: Sampling Design 1
1 An introduction to sampling terminology for survey managers The following paragraphs provide brief explanations of technical terms used in sampling that a survey manager should be aware of. They can
More informationDesign of Parallel Algorithms. Communication Algorithms
+ Design of Parallel Algorithms Communication Algorithms + Topic Overview n One-to-All Broadcast and All-to-One Reduction n All-to-All Broadcast and Reduction n All-Reduce and Prefix-Sum Operations n Scatter
More informationUsing Administrative Records for Imputation in the Decennial Census 1
Using Administrative Records for Imputation in the Decennial Census 1 James Farber, Deborah Wagner, and Dean Resnick U.S. Census Bureau James Farber, U.S. Census Bureau, Washington, DC 20233-9200 Keywords:
More informationOptimization Techniques for Alphabet-Constrained Signal Design
Optimization Techniques for Alphabet-Constrained Signal Design Mojtaba Soltanalian Department of Electrical Engineering California Institute of Technology Stanford EE- ISL Mar. 2015 Optimization Techniques
More informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 2 No. 2, 2017 pp.149-159 DOI: 10.22049/CCO.2017.25918.1055 CCO Commun. Comb. Optim. Graceful labelings of the generalized Petersen graphs Zehui Shao
More informationPreservation Costs Survey. Summary of Findings
Preservation Costs Survey Summary of Findings prepared for Civil Justice Reform Group William H.J. Hubbard, J.D., Ph.D. Assistant Professor of Law University of Chicago Law School February 18, 2014 Preservation
More informationOptimal Multicast Routing in Ad Hoc Networks
Mat-2.108 Independent esearch Projects in Applied Mathematics Optimal Multicast outing in Ad Hoc Networks Juha Leino 47032J Juha.Leino@hut.fi 1st December 2002 Contents 1 Introduction 2 2 Optimal Multicasting
More informationRevisiting the USPTO Concordance Between the U.S. Patent Classification and the Standard Industrial Classification Systems
Revisiting the USPTO Concordance Between the U.S. Patent Classification and the Standard Industrial Classification Systems Jim Hirabayashi, U.S. Patent and Trademark Office The United States Patent and
More informationChapter 4 SPEECH ENHANCEMENT
44 Chapter 4 SPEECH ENHANCEMENT 4.1 INTRODUCTION: Enhancement is defined as improvement in the value or Quality of something. Speech enhancement is defined as the improvement in intelligibility and/or
More informationMonte Carlo based battleship agent
Monte Carlo based battleship agent Written by: Omer Haber, 313302010; Dror Sharf, 315357319 Introduction The game of battleship is a guessing game for two players which has been around for almost a century.
More informationOptimized Periodic Broadcast of Non-linear Media
Optimized Periodic Broadcast of Non-linear Media Niklas Carlsson Anirban Mahanti Zongpeng Li Derek Eager Department of Computer Science, University of Saskatchewan, Saskatoon, Canada Department of Computer
More informationSokoban: Reversed Solving
Sokoban: Reversed Solving Frank Takes (ftakes@liacs.nl) Leiden Institute of Advanced Computer Science (LIACS), Leiden University June 20, 2008 Abstract This article describes a new method for attempting
More informationOptimal Yahtzee performance in multi-player games
Optimal Yahtzee performance in multi-player games Andreas Serra aserra@kth.se Kai Widell Niigata kaiwn@kth.se April 12, 2013 Abstract Yahtzee is a game with a moderately large search space, dependent on
More informationRelay Placement in Sensor Networks
Relay Placement in Sensor Networks Jukka Suomela 14 October 2005 Contents: Wireless Sensor Networks? Relay Placement? Problem Classes Computational Complexity Approximation Algorithms HIIT BRU, Adaptive
More informationRing Oscillator PUF Design and Results
Ring Oscillator PUF Design and Results Michael Patterson mjpatter@iastate.edu Chris Sabotta csabotta@iastate.edu Aaron Mills ajmills@iastate.edu Joseph Zambreno zambreno@iastate.edu Sudhanshu Vyas spvyas@iastate.edu.
More informationOpponent Modelling In World Of Warcraft
Opponent Modelling In World Of Warcraft A.J.J. Valkenberg 19th June 2007 Abstract In tactical commercial games, knowledge of an opponent s location is advantageous when designing a tactic. This paper proposes
More informationWavelength Assignment Problem in Optical WDM Networks
Wavelength Assignment Problem in Optical WDM Networks A. Sangeetha,K.Anusudha 2,Shobhit Mathur 3 and Manoj Kumar Chaluvadi 4 asangeetha@vit.ac.in 2 Kanusudha@vit.ac.in 2 3 shobhitmathur24@gmail.com 3 4
More information4-8 Bayes Theorem Bayes Theorem The concept of conditional probability is introduced in Elementary Statistics. We noted that the conditional
4-8 Bayes Theorem 4-8-1 4-8 Bayes Theorem The concept of conditional probability is introduced in Elementary Statistics. We noted that the conditional probability of an event is a probability obtained
More informationLaboratory 1: Uncertainty Analysis
University of Alabama Department of Physics and Astronomy PH101 / LeClair May 26, 2014 Laboratory 1: Uncertainty Analysis Hypothesis: A statistical analysis including both mean and standard deviation can
More informationYet Another Organized Move towards Solving Sudoku Puzzle
!" ##"$%%# &'''( ISSN No. 0976-5697 Yet Another Organized Move towards Solving Sudoku Puzzle Arnab K. Maji* Department Of Information Technology North Eastern Hill University Shillong 793 022, Meghalaya,
More informationTRAINS ON TIME. Optimizing and Scheduling of railway timetables. Soumya Dutta. IIT Bombay. Students Reading Group. July 27, 2016
TRAINS ON TIME Optimizing and Scheduling of railway timetables Soumya Dutta IIT Bombay Students Reading Group July 27, 2016 Soumya Dutta TRAINS ON TIME 1 / 22 Outline Introduction to Optimization Examples
More informationThe most difficult Sudoku puzzles are quickly solved by a straightforward depth-first search algorithm
The most difficult Sudoku puzzles are quickly solved by a straightforward depth-first search algorithm Armando B. Matos armandobcm@yahoo.com LIACC Artificial Intelligence and Computer Science Laboratory
More informationNew Methods in Finding Binary Constant Weight Codes
Faculty of Technology and Science David Taub New Methods in Finding Binary Constant Weight Codes Mathematics Master s Thesis Date/Term: 2007-03-06 Supervisor: Igor Gachkov Examiner: Alexander Bobylev Karlstads
More informationZiggy MacDonald University of Leicester
1 -> 6 07.03.2006 21:38 Volume 9, Issue 3, 1995 Teaching Linear Programming using Microsoft Excel Solver Ziggy MacDonald University of Leicester Linear programming (LP) is one of the most widely applied
More informationMinimization of Dynamic and Static Power Through Joint Assignment of Threshold Voltages and Sizing Optimization
Minimization of Dynamic and Static Power Through Joint Assignment of Threshold Voltages and Sizing Optimization David Nguyen, Abhijit Davare, Michael Orshansky, David Chinnery, Brandon Thompson, and Kurt
More informationEXPLAINING THE SHAPE OF RSK
EXPLAINING THE SHAPE OF RSK SIMON RUBINSTEIN-SALZEDO 1. Introduction There is an algorithm, due to Robinson, Schensted, and Knuth (henceforth RSK), that gives a bijection between permutations σ S n and
More informationThe effect of data aggregation interval on voltage results
University of Wollongong Research Online Faculty of Engineering - Papers (Archive) Faculty of Engineering and Information Sciences 2007 The effect of data aggregation interval on voltage results Sean Elphick
More informationHow to Make the Perfect Fireworks Display: Two Strategies for Hanabi
Mathematical Assoc. of America Mathematics Magazine 88:1 May 16, 2015 2:24 p.m. Hanabi.tex page 1 VOL. 88, O. 1, FEBRUARY 2015 1 How to Make the erfect Fireworks Display: Two Strategies for Hanabi Author
More informationDigital Television Lecture 5
Digital Television Lecture 5 Forward Error Correction (FEC) Åbo Akademi University Domkyrkotorget 5 Åbo 8.4. Error Correction in Transmissions Need for error correction in transmissions Loss of data during
More informationSpecifications for Post-Earthquake Precise Levelling and GNSS Survey. Version 1.0 National Geodetic Office
Specifications for Post-Earthquake Precise Levelling and GNSS Survey Version 1.0 National Geodetic Office 24 November 2010 Specification for Post-Earthquake Precise Levelling and GNSS Survey Page 1 of
More informationComputational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 3 Fall 2010
Computational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 3 Fall 21 Peter Bro Miltersen November 1, 21 Version 1.3 3 Extensive form games (Game Trees, Kuhn Trees)
More informationLESSON 2: THE INCLUSION-EXCLUSION PRINCIPLE
LESSON 2: THE INCLUSION-EXCLUSION PRINCIPLE The inclusion-exclusion principle (also known as the sieve principle) is an extended version of the rule of the sum. It states that, for two (finite) sets, A
More informationA COMPUTATIONAL PARADIGM FOR SPACE-TIME MULTIUSER DETECTION. Lisa Welburn*, Jim Cavers*, Kevin Sowerby** ** The University of Auckland, New Zealand
A COMPUTATIONAL PARADIGM FOR SPACE-TIME MULTIUSER DETECTION Lisa Welburn*, Jim Cavers*, Kevin Sowerby** * Simon Fraser University, Canada ** The University of Auckland, New Zealand 1 OUTLINE: Space-time
More informationMODELLING AND SIMULATION TOOLS FOR SET- BASED DESIGN
MODELLING AND SIMULATION TOOLS FOR SET- BASED DESIGN SUMMARY Dr. Norbert Doerry Naval Sea Systems Command Set-Based Design (SBD) can be thought of as design by elimination. One systematically decides the
More informationMAT 1272 STATISTICS LESSON STATISTICS AND TYPES OF STATISTICS
MAT 1272 STATISTICS LESSON 1 1.1 STATISTICS AND TYPES OF STATISTICS WHAT IS STATISTICS? STATISTICS STATISTICS IS THE SCIENCE OF COLLECTING, ANALYZING, PRESENTING, AND INTERPRETING DATA, AS WELL AS OF MAKING
More informationThe Use of Non-Local Means to Reduce Image Noise
The Use of Non-Local Means to Reduce Image Noise By Chimba Chundu, Danny Bin, and Jackelyn Ferman ABSTRACT Digital images, such as those produced from digital cameras, suffer from random noise that is
More informationAchieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters
Achieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters Scott Watson, Andrew Vardy, Wolfgang Banzhaf Department of Computer Science Memorial University of Newfoundland St John s.
More informationPart VII: VRP - advanced topics
Part VII: VRP - advanced topics c R.F. Hartl, S.N. Parragh 1/32 Overview Dealing with TW and duration constraints Solving VRP to optimality c R.F. Hartl, S.N. Parragh 2/32 Dealing with TW and duration
More informationFast Placement Optimization of Power Supply Pads
Fast Placement Optimization of Power Supply Pads Yu Zhong Martin D. F. Wong Dept. of Electrical and Computer Engineering Dept. of Electrical and Computer Engineering Univ. of Illinois at Urbana-Champaign
More informationAn FPGA Based Architecture for Moving Target Indication (MTI) Processing Using IIR Filters
An FPGA Based Architecture for Moving Target Indication (MTI) Processing Using IIR Filters Ali Arshad, Fakhar Ahsan, Zulfiqar Ali, Umair Razzaq, and Sohaib Sajid Abstract Design and implementation of an
More informationCommunication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi
Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 16 Angle Modulation (Contd.) We will continue our discussion on Angle
More informationMethodology Statement: 2011 Australian Census Demographic Variables
Methodology Statement: 2011 Australian Census Demographic Variables Author: MapData Services Pty Ltd Version: 1.0 Last modified: 2/12/2014 Contents Introduction 3 Statistical Geography 3 Included Data
More informationAppendix. RF Transient Simulator. Page 1
Appendix RF Transient Simulator Page 1 RF Transient/Convolution Simulation This simulator can be used to solve problems associated with circuit simulation, when the signal and waveforms involved are modulated
More informationMULTI-STAGE TRANSMISSION EXPANSION PLANNING CONSIDERING MULTIPLE DISPATCHES AND CONTINGENCY CRITERION
MULTI-STAGE TRANSMISSION EXPANSION PLANNING CONSIDERING MULTIPLE DISPATCHES AND CONTINGENCY CRITERION GERSON C. OLIVEIRA, SILVIO BINATO, MARIO V. PEREIRA, LUIZ M. THOMÉ PSR CONSULTORIA LTDA R. VOLUNTARIOS
More informationMultiple Input Multiple Output (MIMO) Operation Principles
Afriyie Abraham Kwabena Multiple Input Multiple Output (MIMO) Operation Principles Helsinki Metropolia University of Applied Sciences Bachlor of Engineering Information Technology Thesis June 0 Abstract
More informationUtilization-Aware Adaptive Back-Pressure Traffic Signal Control
Utilization-Aware Adaptive Back-Pressure Traffic Signal Control Wanli Chang, Samarjit Chakraborty and Anuradha Annaswamy Abstract Back-pressure control of traffic signal, which computes the control phase
More informationThe Design of E-band MMIC Amplifiers
The Design of E-band MMIC Amplifiers Liam Devlin, Stuart Glynn, Graham Pearson, Andy Dearn * Plextek Ltd, London Road, Great Chesterford, Essex, CB10 1NY, UK; (lmd@plextek.co.uk) Abstract The worldwide
More informationA Mathematical Analysis of Oregon Lottery Win for Life
Introduction 2017 Ted Gruber This report provides a detailed mathematical analysis of the Win for Life SM draw game offered through the Oregon Lottery (https://www.oregonlottery.org/games/draw-games/win-for-life).
More informationRELEASING APERTURE FILTER CONSTRAINTS
RELEASING APERTURE FILTER CONSTRAINTS Jakub Chlapinski 1, Stephen Marshall 2 1 Department of Microelectronics and Computer Science, Technical University of Lodz, ul. Zeromskiego 116, 90-924 Lodz, Poland
More informationSolving All 164,604,041,664 Symmetric Positions of the Rubik s Cube in the Quarter Turn Metric
Solving All 164,604,041,664 Symmetric Positions of the Rubik s Cube in the Quarter Turn Metric Tomas Rokicki March 18, 2014 Abstract A difficult problem in computer cubing is to find positions that are
More informationTwenty-fourth Annual UNC Math Contest Final Round Solutions Jan 2016 [(3!)!] 4
Twenty-fourth Annual UNC Math Contest Final Round Solutions Jan 206 Rules: Three hours; no electronic devices. The positive integers are, 2, 3, 4,.... Pythagorean Triplet The sum of the lengths of the
More informationStatistical Tests: More Complicated Discriminants
03/07/07 PHY310: Statistical Data Analysis 1 PHY310: Lecture 14 Statistical Tests: More Complicated Discriminants Road Map When the likelihood discriminant will fail The Multi Layer Perceptron discriminant
More informationSome of the proposed GALILEO and modernized GPS frequencies.
On the selection of frequencies for long baseline GALILEO ambiguity resolution P.J.G. Teunissen, P. Joosten, C.D. de Jong Department of Mathematical Geodesy and Positioning, Delft University of Technology,
More informationA Static Pattern-Independent Technique for Power Grid Voltage Integrity Verification
A Static Pattern-Independent Technique for Power Grid Voltage Integrity Verification 8.2 Dionysios Kouroussis Department of ECE University of Toronto Toronto, Ontario, Canada diony@eecg.utoronto.ca Farid
More informationTrial version. Resistor Production. How can the outcomes be analysed to optimise the process? Student. Contents. Resistor Production page: 1 of 15
Resistor Production How can the outcomes be analysed to optimise the process? Resistor Production page: 1 of 15 Contents Initial Problem Statement 2 Narrative 3-11 Notes 12 Appendices 13-15 Resistor Production
More information