Algorithms Airline Scheduling. Airline Scheduling. Design and Analysis of Algorithms Andrei Bulatov
|
|
- Jessica Ferguson
- 5 years ago
- Views:
Transcription
1 Algorthms Arlne Schedulng Arlne Schedulng Desgn and Analyss of Algorthms Andre Bulatov
2 Algorthms Arlne Schedulng 11-2 The Problem An arlne carrer wants to serve certan set of flghts Example: Boston (6 am) - Washngton DC (7 am), San Francsco (2:15pm) - Seattle (3:15pm) Phladelpha (7 am) - Pttsburg (8 am), Las Vegas (5 pm) - Seattle (6 pm) Washngton DC (8 am) Los Angeles (11 am) Phladelpha (11 am) - San Francsco (2 pm) The same plane can be used for flght and for flght j f - the destnaton of s the same as orgn of j and there s enough tme for mantenance (say, 1 hour) - a flght can be added n between that gets the plane from the destnaton of to the orgn of j wth adequate tme n between
3 Algorthms Arlne Schedulng 11-3 Formalsm Boston (6 am) - Washngton DC (7 am), Phladelpha (11 am) - San Francsco (2 pm) Phladelpha (7 am) - Pttsburg (8 am), San Francsco (2:15pm) - Seattle (3:15pm) Washngton DC (8 am) Los Angeles (11 am), Las Vegas (5 pm) - Seattle (6 pm) BOS 6 DC 7 DC 8 LAX 11 LAS 5 SEA 6 PHL 7 PIT 8 PHL 11 SFO 2 SFO 2:15 SEA 3:15 Flght j s reachable from flght f t s possble to use the same plane for flght, and then later for flght j as well. (or we can use a dfferent set of rules, t does not matter)
4 Algorthms Arlne Schedulng 11-4 The Problem The Arlne Schedulng Problem Instance: A set of flghts to serve, and a set of pars of reachable flghts, the allowed number k of planes Objectve: Is t possble to serve the requred flghts wth k planes
5 Algorthms Arlne Schedulng 11-5 The Idea Each arplane s represented by a unt of flow The requred flghts (arcs) have lower bound 1, and capacty 1 If ( u, v ) and ( u j, v j ) are arcs representng requred flghts and j, and j s reachable from, then there s an arc connectng v to u j ; we assgn ths arc capacty 1 Extend the network by addng an external source and snk BOS 6 DC 7 DC 8 LAX 11 LAS 5 SEA 6 PHL 7 PIT 8 PHL 11 SFO 2 SFO 2:15 SEA 3:15
6 Algorthms Arlne Schedulng 11-6 Constructon - For each requred flght, the graph G has two nodes and - G also has a dstnct source s and a snk t - For each, there s an arc ( u, v ) wth a lower bound 1 and capacty 1 - For each and j such that flght j s reachable from flght, there s an arc ( v, u j ) wth a lower bound 0 and a capacty 1 - For each there s an arc ( s, u ) wth a lower bound 0 and a capacty 1 - For each there s an arc ( v, t) wth a lower bound 0 and a capacty 1 - There s an arc (s,t) wth lower bound 0 and capacty k - The node s has demand -k, and node t has demand k u v
7 Algorthms Arlne Schedulng 11-7 The Problem Theorem There s a way to perform all flghts usng at most k planes f and only f there s a feasble crculaton n the network G. Proof DIY
8 Algorthms Image Segmentaton 15-8 Image Segmentaton Desgn and Analyss of Algorthms Andre Bulatov
9 Algorthms Image Segmentaton 15-9 Image Segmentaton The general problem s to separate objects on a dgtal mage We have pxels and have to decde, whch object each pxel belongs to The problem we solve: decde whether a pxel belongs to the background or foreground The decson, where a gven pxel belongs to s made takng nto account ts neghbors Usually, pxels are arranged n a grd But our model wll allow any other confguraton
10 Algorthms Image Segmentaton Image Segmentaton: Framework We construct an undrected graph G = (V,E) where V s the set of pxels, and E s the neghborhood relaton For every pxel there are assocated lkelhood a that t belongs to the foreground, and lkelhood that t belongs to the background The lkelhoods can be any non-negatve numbers b For a pxel we tend to label t as a foreground pxel f a > b and as a background pxel otherwse However, the label also depends on labels of ts neghbors It s regulated by a separaton penalty p j 0 for one of and j n the foreground, and the other n the background
11 Algorthms Image Segmentaton The Problem The Image Segmentaton Problem Instance: A set of pxels wth lkelhoods and separaton penaltes Objectve: Fnd an optmal labelng, that s, a partton of the set of pxels nto sets A and B (foreground and background) so as to maxmze q( A, B) = A a + B b p j (, j) A E {, j} = 1
12 Algorthms Image Segmentaton Algorthm Ideas Observe that the problem s smlar to fndng a mnmal cut Dffcultes: (1) Need to maxmze, rather than mnmze (2) No source and snk (3) Have to deal wth values assgned to vertces (4) The graph s undrected
13 Algorthms Image Segmentaton Algorthm Ideas (cntd) (1) Need to maxmze, rather than mnmze Let Then So Thus nstead of maxmzng q(a,b) we can mnmze = + a b Q ) ( = + B A B A a b Q b a = = 1 }, { ), ( ), ( j A E j j B A p a b Q B A q = + + = 1 }, { ), ( ), '( j A E j j B A p a b B A q
14 Algorthms Image Segmentaton Algorthm Ideas (cntd) (2) No source and snk Add an external source, s, and snk, t (3) Have to deal wth values assgned to vertces We use the external source and snk Assgn capacty to edges (s,), b a and capacty to edges (,t)
15 Algorthms Image Segmentaton Algorthm Ideas (cntd) (4) The graph s undrected Replace each undrected edge wth two drected arcs p j and assgn capacty to both
16 Algorthms Image Segmentaton Cuts vs. Segmentaton A cut ( A {s}, B {t} ) corresponds to partton (A,B) of the orgnal graph The capacty c(a,b) s contrbuted by - edges (s,j), where j B; ths edge contrbutes - edges (,t), where A; ths edge contrbutes - edges (,j), where A and j B; ths edge contrbutes p j a b
17 Algorthms Image Segmentaton The Result Theorem The soluton to the Segmentaton Problem can be obtaned by a mnmum-cut algorthm n the graph G constructed above. For a mnmum cut (A,B ), the partton (A,B) obtaned by deletng s and t maxmzes the segmentaton value q(a,b)
Decision aid methodologies in transportation
Decson ad methodologes n transportaton Lecture 7: More Applcatons Prem Kumar prem.vswanathan@epfl.ch Transport and Moblty Laboratory Summary We learnt about the dfferent schedulng models We also learnt
More informationUtility-based Routing
Utlty-based Routng Je Wu Dept. of Computer and Informaton Scences Temple Unversty Roadmap Introducton Why Another Routng Scheme Utlty-Based Routng Implementatons Extensons Some Fnal Thoughts 2 . Introducton
More informationA comparative study of initial basic feasible solution methods for transportation problems
Matheatcal Theory and Modelng ISSN 2224-5804 (Paper) ISSN 2225-0522 (Onlne) www.ste.org A coparatve study of ntal basc feasble soluton ethods for transportaton probles Abstract Abdul Sattar Sooro 1 Gurudeo
More informationInteger Programming. P.H.S. Torr Lecture 5. Integer Programming
Integer Programmng P.H.S. Torr Lecture 5 Integer Programmng Outlne Mathematcal programmng paradgm Lnear Programmng Integer Programmng Integer Programmng Eample Unmodularty LP -> IP Theorem Concluson Specal
More informationReview: Our Approach 2. CSC310 Information Theory
CSC30 Informaton Theory Sam Rowes Lecture 3: Provng the Kraft-McMllan Inequaltes September 8, 6 Revew: Our Approach The study of both compresson and transmsson requres that we abstract data and messages
More informationDefine Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.
Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)
More informationRational Secret Sharing without Broadcast
Ratonal Secret Sharng wthout Broadcast Amjed Shareef, Department of Computer Scence and Engneerng, Indan Insttute of Technology Madras, Chenna, Inda. Emal: amjedshareef@gmal.com Abstract We use the concept
More informationUnderstanding the Spike Algorithm
Understandng the Spke Algorthm Vctor Ejkhout and Robert van de Gejn May, ntroducton The parallel soluton of lnear systems has a long hstory, spannng both drect and teratve methods Whle drect methods exst
More informationChinese Remainder. Discrete Mathematics Andrei Bulatov
Chnese Remander Introducton Theorem Dscrete Mathematcs Andre Bulatov Dscrete Mathematcs Chnese Remander Theorem 34-2 Prevous Lecture Resdues and arthmetc operatons Caesar cpher Pseudorandom generators
More informationNetwork Reconfiguration in Distribution Systems Using a Modified TS Algorithm
Network Reconfguraton n Dstrbuton Systems Usng a Modfed TS Algorthm ZHANG DONG,FU ZHENGCAI,ZHANG LIUCHUN,SONG ZHENGQIANG School of Electroncs, Informaton and Electrcal Engneerng Shangha Jaotong Unversty
More informationWalsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter
Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957
More informationANNUAL OF NAVIGATION 11/2006
ANNUAL OF NAVIGATION 11/2006 TOMASZ PRACZYK Naval Unversty of Gdyna A FEEDFORWARD LINEAR NEURAL NETWORK WITH HEBBA SELFORGANIZATION IN RADAR IMAGE COMPRESSION ABSTRACT The artcle presents the applcaton
More informationGraph Method for Solving Switched Capacitors Circuits
Recent Advances n rcuts, ystems, gnal and Telecommuncatons Graph Method for olvng wtched apactors rcuts BHUMIL BRTNÍ Department of lectroncs and Informatcs ollege of Polytechncs Jhlava Tolstého 6, 586
More informationOptimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation
T. Kerdchuen and W. Ongsakul / GMSARN Internatonal Journal (09) - Optmal Placement of and by Hybrd Genetc Algorthm and Smulated Annealng for Multarea Power System State Estmaton Thawatch Kerdchuen and
More informationEnhancing Throughput in Wireless Multi-Hop Network with Multiple Packet Reception
Enhancng Throughput n Wreless Mult-Hop Network wth Multple Packet Recepton Ja-lang Lu, Paulne Vandenhove, We Shu, Mn-You Wu Dept. of Computer Scence & Engneerng, Shangha JaoTong Unversty, Shangha, Chna
More informationFull-duplex Relaying for D2D Communication in mmwave based 5G Networks
Full-duplex Relayng for D2D Communcaton n mmwave based 5G Networks Boang Ma Hamed Shah-Mansour Member IEEE and Vncent W.S. Wong Fellow IEEE Abstract Devce-to-devce D2D communcaton whch can offload data
More informationPRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht
68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly
More informationRC Filters TEP Related Topics Principle Equipment
RC Flters TEP Related Topcs Hgh-pass, low-pass, Wen-Robnson brdge, parallel-t flters, dfferentatng network, ntegratng network, step response, square wave, transfer functon. Prncple Resstor-Capactor (RC)
More informationA Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET)
A Novel Optmzaton of the Dstance Source Routng (DSR) Protocol for the Moble Ad Hoc Networs (MANET) Syed S. Rzv 1, Majd A. Jafr, and Khaled Ellethy Computer Scence and Engneerng Department Unversty of Brdgeport
More informationNetwork Theory. EC / EE / IN. for
Network Theory for / / IN By www.thegateacademy.com Syllabus Syllabus for Networks Network Graphs: Matrces Assocated Wth Graphs: Incdence, Fundamental ut Set and Fundamental rcut Matrces. Soluton Methods:
More informationYutaka Matsuo and Akihiko Yokoyama. Department of Electrical Engineering, University oftokyo , Hongo, Bunkyo-ku, Tokyo, Japan
Optmzaton of Installaton of FACTS Devce n Power System Plannng by both Tabu Search and Nonlnear Programmng Methods Yutaka Matsuo and Akhko Yokoyama Department of Electrcal Engneerng, Unversty oftokyo 7-3-,
More informationDynamic Lightpath Protection in WDM Mesh Networks under Wavelength Continuity Constraint
Dynamc Lghtpath Protecton n WDM Mesh etworks under Wavelength Contnuty Constrant Shengl Yuan* and Jason P. Jue *Department of Computer and Mathematcal Scences, Unversty of Houston Downtown One Man Street,
More informationA Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results
AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of
More informationMaster Physician Scheduling Problem 1
Master Physcan Schedulng Problem 1 Aldy Gunawan and Hoong Chun Lau School of Informaton Systems, Sngapore Management Unversty, Sngapore Abstract We study a real-world problem arsng from the operatons of
More informationA Stochastic Approach to Hotel Revenue Management Considering Individual and Group Customers
Proceedngs of the Internatonal Conference on Industral Engneerng and Operatons Management Bal, Indonesa, January 7 9, A Stochastc Approach to Hotel Revenue Management Consderng Indvdual and Group Customers
More informationMulti-Robot Map-Merging-Free Connectivity-Based Positioning and Tethering in Unknown Environments
Mult-Robot Map-Mergng-Free Connectvty-Based Postonng and Tetherng n Unknown Envronments Somchaya Lemhetcharat and Manuela Veloso February 16, 2012 Abstract We consder a set of statc towers out of communcaton
More informationThe Application of Tabu Search Algorithm on Power System Restoration
The Applcaton of Tabu Search Algorthm on Power System Restoraton FANG Xn-yan,CAI Xao-y, Jang Chuan-wen Dept.of Electrcal Eng.., Shangha Jaotong Unv., Shangha 200240, Chna Abstract:-The essay s just accordng
More informationDynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University
Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout
More informationOptimal Reconfiguration of Distribution System by PSO and GA using graph theory
Proceedngs of the 6th WSEAS Internatonal Conference on Applcatons of Electrcal Engneerng, Istanbul, Turkey, May 27-29, 2007 83 Optmal Reconfguraton of Dstrbuton System by PSO and GA usng graph theory Mehd
More informationDigital Transmission
Dgtal Transmsson Most modern communcaton systems are dgtal, meanng that the transmtted normaton sgnal carres bts and symbols rather than an analog sgnal. The eect o C/N rato ncrease or decrease on dgtal
More informationDistributed Algorithms for the Operator Placement Problem
TZIRITAS ET AL.: DISTRIBUTED ALGORITHMS FOR THE OPERATOR PLACEMET PROBLEM Dstrbuted Algorthms for the Operator Placement Problem kos Tzrtas, Thanass Loukopoulos, Samee U. Khan, Senor Member, IEEE, Cheng-Zhong
More informationEE 508 Lecture 6. Degrees of Freedom The Approximation Problem
EE 508 Lecture 6 Degrees of Freedom The Approxmaton Problem Revew from Last Tme Desgn Strategy Theorem: A crcut wth transfer functon T(s) can be obtaned from a crcut wth normalzed transfer functon T n
More informationChain Codes. Shape Representation and Description. Signatures. Polygonal Approximations
Shae Reresentaton and Descrton Reresentaton Matchng or comarng reresentatons for shae recognton Invarance wth resect to nusance arameters Image codng Descrton Classf shaes based on a descrtor Invarance
More informationProbable Optimization of Reactive Power in distribution systems, in presence of distributed generation sources conjugated to network and islanding
IOSR Journal of Electrcal and Electroncs Engneerng (IOSR-JEEE) e-issn: 2278-1676,p-ISSN: 2320-3331, Volume 11, Issue 5 Ver. II (Sep - Oct 2016), PP 72-78 www.osrjournals.org Probable Optmzaton of Reactve
More informationApproaches Method to Solve Ships Routing Problem with an Application to the Indonesian National Shipping Company
Approaches Method to Solve Shps Routng Problem wth an Applcaton to the Indonesan Natonal Shppng Company ISMAIL YUSUF 1,2), ACHMAD YANI 2,3), and MOHD. SAFIYAN BABA 1) Department of Artfcal Intellgence,
More informationInverse Halftoning Method Using Pattern Substitution Based Data Hiding Scheme
Proceedngs of the World Congress on Engneerng 2011 Vol II, July 6-8, 2011, London, U.K. Inverse Halftonng Method Usng Pattern Substtuton Based Data Hdng Scheme Me-Y Wu, Ja-Hong Lee and Hong-Je Wu Abstract
More informationA GBAS Testbed to Support New Monitoring Algorithms Development for CAT III Precision Approach
A GBAS Testbed to Support New Montorng Algorthms Development for CAT III Precson Approach B. Belabbas, T. Dautermann, M. Felux, M. Rppl, S. Schlüter, V. Wlken, A. Hornbostel, M. Meurer German Aerospace
More informationWeighted Penalty Model for Content Balancing in CATS
Weghted Penalty Model for Content Balancng n CATS Chngwe Davd Shn Yuehme Chen Walter Denny Way Len Swanson Aprl 2009 Usng assessment and research to promote learnng WPM for CAT Content Balancng 2 Abstract
More informationA TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS
A TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS Pedro Godnho and oana Das Faculdade de Economa and GEMF Unversdade de Combra Av. Das da Slva 65 3004-5
More informationJoint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding
Communcatons and Network, 2013, 5, 312-318 http://dx.do.org/10.4236/cn.2013.53b2058 Publshed Onlne September 2013 (http://www.scrp.org/journal/cn) Jont Power Control and Schedulng for Two-Cell Energy Effcent
More informationThe Performance Improvement of BASK System for Giga-Bit MODEM Using the Fuzzy System
Int. J. Communcatons, Network and System Scences, 10, 3, 1-5 do:10.36/jcns.10.358 Publshed Onlne May 10 (http://www.scrp.org/journal/jcns/) The Performance Improvement of BASK System for Gga-Bt MODEM Usng
More informationFixed-Charge Network Flow Problems with a Hybrid Optimization and. Constraint Programming Approach. Solving. John Hooker, Hak-Jin Kim
Solvng Fed-Charge Network Flow Problems wth a Hbrd Optmaton and Constrant Programmng Approach John Hooker, Hak-Jn Km Carnege ellon Unverst ISP, August 2 An Approach that Combnes Optmaton and Constrant
More informationA NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems
0 nd Internatonal Conference on Industral Technology and Management (ICITM 0) IPCSIT vol. 49 (0) (0) IACSIT Press, Sngapore DOI: 0.776/IPCSIT.0.V49.8 A NSGA-II algorthm to solve a b-obectve optmzaton of
More informationPrevention of Sequential Message Loss in CAN Systems
Preventon of Sequental Message Loss n CAN Systems Shengbng Jang Electrcal & Controls Integraton Lab GM R&D Center, MC: 480-106-390 30500 Mound Road, Warren, MI 48090 shengbng.jang@gm.com Ratnesh Kumar
More informationNatural connectivity and robustness in the topological structure of Eletrosul transmission system
Trabalho apresentado no CMAC-Sul, Curtba-PR, 4. atural connectvty and robustness n the topologcal structure of Eletrosul transmsson system M.S. Onetta, T. Carlotto, J.M.V. Grzybows Unversdade Federal da
More informationCapacitated set-covering model considering the distance objective and dependency of alternative facilities
IOP Conference Seres: Materals Scence and Engneerng PAPER OPEN ACCESS Capactated set-coverng model consderng the dstance obectve and dependency of alternatve facltes To cte ths artcle: I Wayan Suletra
More informationMedium Term Load Forecasting for Jordan Electric Power System Using Particle Swarm Optimization Algorithm Based on Least Square Regression Methods
Journal of Power and Energy Engneerng, 2017, 5, 75-96 http://www.scrp.org/journal/jpee ISSN Onlne: 2327-5901 ISSN Prnt: 2327-588X Medum Term Load Forecastng for Jordan Electrc Power System Usng Partcle
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationExploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling
Explotng Dynamc Worload Varaton n Low Energy Preemptve Tas Schedulng Lap-Fa Leung, Ch-Yng Tsu Department of Electrcal and Electronc Engneerng Hong Kong Unversty of Scence and Technology Clear Water Bay,
More informationA MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION
A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION Vncent A. Nguyen Peng-Jun Wan Ophr Freder Computer Scence Department Illnos Insttute of Technology Chcago, Illnos vnguyen@t.edu,
More informationDynamic Wavelength Routing in WDM Networks under Multiple Signal Quality Constraints
Dynamc Wavelength Routng n WDM Networks under Multple Sgnal Qualty Constrants Wey Zhang, Guolang Xue, Senor Member, IEEE, Jan Tang, Krshnayan Thulasraman, Fellow, IEEE Abstract Most research works n routng
More informationTRAIN PLATFORMING PROBLEM Ľudmila JÁNOŠÍKOVÁ 1, Michal KREMPL 2
GIS Ostrava 2014 - Geonformatcs for Intellgent Transportaton Abstract TRAIN PLATFORMING PROBLEM Ľudmla JÁNOŠÍKOVÁ 1, Mchal KREMPL 2 1 Department of Transportaton Networks, Faculty of Management Scence
More informationPriority based Dynamic Multiple Robot Path Planning
2nd Internatonal Conference on Autonomous obots and Agents Prorty based Dynamc Multple obot Path Plannng Abstract Taxong Zheng Department of Automaton Chongqng Unversty of Post and Telecommuncaton, Chna
More informationA MODIFIED DIFFERENTIAL EVOLUTION ALGORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS
A MODIFIED DIFFERENTIAL EVOLUTION ALORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS Kaml Dmller Department of Electrcal-Electroncs Engneerng rne Amercan Unversty North Cyprus, Mersn TURKEY kdmller@gau.edu.tr
More informationMulticarrier Modulation
Multcarrer Modulaton Wha Sook Jeon Moble Computng & Communcatons Lab Contents Concept of multcarrer modulaton Data transmsson over multple carrers Multcarrer modulaton wth overlappng Chap. subchannels
More informationUnit 1. Current and Voltage U 1 VOLTAGE AND CURRENT. Circuit Basics KVL, KCL, Ohm's Law LED Outputs Buttons/Switch Inputs. Current / Voltage Analogy
..2 nt Crcut Bascs KVL, KCL, Ohm's Law LED Outputs Buttons/Swtch Inputs VOLTAGE AND CRRENT..4 Current and Voltage Current / Voltage Analogy Charge s measured n unts of Coulombs Current Amount of charge
More informationKeywords parasitic flow loops, flow networks, dominated parasitic flow loops, optimization 1. PARASITIC FLOW LOOPS IN NETWORKS
Internatonal Journal of Operatons Research Vol., No., 00 07 (04) Domnated parastc flow loops n networks M.Todnov * Department of Mechancal Engneerng and Mathematcal Scences, Oxford Brookes Unversty Oxford,
More informationNOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION
NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION Phaneendra R.Venkata, Nathan A. Goodman Department of Electrcal and Computer Engneerng, Unversty of Arzona, 30 E. Speedway Blvd, Tucson, Arzona
More informationTECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS TN TERMINATON FOR POINT-TO-POINT SYSTEMS. Zo = L C. ω - angular frequency = 2πf
TECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS INTRODUCTION Because dgtal sgnal rates n computng systems are ncreasng at an astonshng rate, sgnal ntegrty ssues have become far more mportant to
More informationNETWORK 2001 Transportation Planning Under Multiple Objectives
NETWORK 200 Transportaton Plannng Under Multple Objectves Woodam Chung Graduate Research Assstant, Department of Forest Engneerng, Oregon State Unversty, Corvalls, OR9733, Tel: (54) 737-4952, Fax: (54)
More informationDistributed Resource Allocation and Scheduling in OFDMA Wireless Networks
Southern Illnos Unversty Carbondale OpenSIUC Conference Proceedngs Department of Electrcal and Computer Engneerng 11-2006 Dstrbuted Resource Allocaton and Schedulng n OFDMA Wreless Networks Xangpng Qn
More informationGeneralized Incomplete Trojan-Type Designs with Unequal Cell Sizes
Internatonal Journal of Theoretcal & Appled Scences 6(1): 50-54(2014) ISSN No. (Prnt): 0975-1718 ISSN No. (Onlne): 2249-3247 Generalzed Incomplete Trojan-Type Desgns wth Unequal Cell Szes Cn Varghese,
More informationResource Scheduling in Dependable Integrated Modular Avionics
Resource Schedulng n Dependable Integrated Modular Avoncs Yann-Hang Lee and Daeyoung Km Real Tme Systems Research Laboratory CISE Department, Unversty of Florda {yhlee, dkm}@cse.ufl.edu Mohamed Youns,
More informationHard Real-Time Scheduling for Low-Energy Using Stochastic Data and DVS Processors
Hard Real-me Schedulng for Low-Energy Usng Stochastc Data and DVS Processors Flavus Gruan Department of Computer Scence, Lund Unversty Box 118 S-221 00 Lund, Sweden el.: +46 046 2224673 e-mal: Flavus.Gruan@cs.lth.se
More informationPhasor Representation of Sinusoidal Signals
Phasor Representaton of Snusodal Sgnals COSC 44: Dgtal Communcatons Instructor: Dr. Amr Asf Department of Computer Scence and Engneerng York Unversty Handout # 6: Bandpass odulaton Usng Euler dentty e
More informationTraffic balancing over licensed and unlicensed bands in heterogeneous networks
Correspondence letter Traffc balancng over lcensed and unlcensed bands n heterogeneous networks LI Zhen, CUI Qme, CUI Zhyan, ZHENG We Natonal Engneerng Laboratory for Moble Network Securty, Bejng Unversty
More informationMTBF PREDICTION REPORT
MTBF PREDICTION REPORT PRODUCT NAME: BLE112-A-V2 Issued date: 01-23-2015 Rev:1.0 Copyrght@2015 Bluegga Technologes. All rghts reserved. 1 MTBF PREDICTION REPORT... 1 PRODUCT NAME: BLE112-A-V2... 1 1.0
More informationJoint Access Point Placement and Channel Assignment for Wireless Local Area Networks
Ttle Jont Access ont lacement and Channel Assgnment for 802. Wreless Local Area Networks Author(s) Lng, X; Yeung, LK Ctaton The 2005 IEEE Wreless Communcatons and Networkng Conference (WCNC), New Orleans,
More informationTechniques for Graceful Reversion from Dual to Single Frequency WAAS
Technques for Graceful Reverson from Dual to Sngle Frequency WAAS Shau-Shun Jan, Todd Walter, Per Enge Department of Aeronautcs and Astronautcs Stanford Unversty, Calforna 94305 ABSTRACT Ths paper nvestgates
More informationA New Type of Weighted DV-Hop Algorithm Based on Correction Factor in WSNs
Journal of Communcatons Vol. 9, No. 9, September 2014 A New Type of Weghted DV-Hop Algorthm Based on Correcton Factor n WSNs Yng Wang, Zhy Fang, and Ln Chen Department of Computer scence and technology,
More informationScheduling Analysis of Cluster Tools with Buffer/Process Modules
Schedulng Analyss of Cluster Tools wth Buffer/Process Modules Jngang Y Dept. of Mech. Eng. Texas A&M Unversty College Staton, TX 77843 jgy@tamu.edu Shengwe Dng Dept. of IEOR Unversty of Calforna Berkeley,
More informationFigure 1. DC-DC Boost Converter
EE46, Power Electroncs, DC-DC Boost Converter Verson Oct. 3, 11 Overvew Boost converters make t possble to effcently convert a DC voltage from a lower level to a hgher level. Theory of Operaton Relaton
More informationHanif D. Sheralit. and foremost, we show that performance gap between. time in solving the optimization problem. II.
CROSS-LAYER OPTMZATON FOR UWB-BASED AD HOC NETWORKS Y Sh* * Y. Thomas Hou* Hanf D. Sheralt Sastry Kompella' The Bradley Department of Electrcal and Computer Engneerng, Vrgna Tech, Blacsburg, VA The Grado
More informationOptimization Process for Berth and Quay-Crane Assignment in Container Terminals with Separate Piers. By Neven Grubisic Livia Maglic
Athens Journal of Technology and Engneerng March 2018 Optmzaton Process for Berth and Quay-Crane Assgnment n Contaner Termnals wth Separate Pers By Neven Grubsc Lva Maglc The objectve of ths research s
More informationComparison of Two Measurement Devices I. Fundamental Ideas.
Comparson of Two Measurement Devces I. Fundamental Ideas. ASQ-RS Qualty Conference March 16, 005 Joseph G. Voelkel, COE, RIT Bruce Sskowsk Rechert, Inc. Topcs The Problem, Eample, Mathematcal Model One
More informationMASTER TIMING AND TOF MODULE-
MASTER TMNG AND TOF MODULE- G. Mazaher Stanford Lnear Accelerator Center, Stanford Unversty, Stanford, CA 9409 USA SLAC-PUB-66 November 99 (/E) Abstract n conjuncton wth the development of a Beam Sze Montor
More informationPlanning of Relay Station Locations in IEEE (WiMAX) Networks
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the WCNC 010 proceedngs. Plannng of Relay Staton Locatons n IEEE 0.16 (WMAX) Networks
More informationSide-Match Vector Quantizers Using Neural Network Based Variance Predictor for Image Coding
Sde-Match Vector Quantzers Usng Neural Network Based Varance Predctor for Image Codng Shuangteng Zhang Department of Computer Scence Eastern Kentucky Unversty Rchmond, KY 40475, U.S.A. shuangteng.zhang@eku.edu
More informationEnergy saving in fixed wireless broadband networks
Energy savng n fxed wreless broadband networks Davd Coudert, Napoleao Nepomuceno, Issam Tahr To cte ths verson: Davd Coudert, Napoleao Nepomuceno, Issam Tahr. Energy savng n fxed wreless broadband networks.
More informationLearning Ensembles of Convolutional Neural Networks
Learnng Ensembles of Convolutonal Neural Networks Lran Chen The Unversty of Chcago Faculty Mentor: Greg Shakhnarovch Toyota Technologcal Insttute at Chcago 1 Introducton Convolutonal Neural Networks (CNN)
More informationGuidelines for CCPR and RMO Bilateral Key Comparisons CCPR Working Group on Key Comparison CCPR-G5 October 10 th, 2014
Gudelnes for CCPR and RMO Blateral Key Comparsons CCPR Workng Group on Key Comparson CCPR-G5 October 10 th, 2014 These gudelnes are prepared by CCPR WG-KC and RMO P&R representatves, and approved by CCPR,
More informationCloud of Things for Sensing-as-a-Service: Architecture, Algorithms, and Use Case
Cloud of Thngs for Sensng-as-a-Servce: Archtecture, Algorthms, and Use Case Sherf Abdelwahab, Bechr Hamdaou, Mohsen Guzan, and Taeb Znat Oregon State Unversty, abdelwas,hamdaou@eecs.orst.edu Unversty of
More informationCS345a: Data Mining Jure Leskovec and Anand Rajaraman Stanford University
CS345a: Data Mnng Jure Leskovec and Anand Rajaraman Stanford Unversty HW3 s out Poster sesson s on last day of classes: Thu March 11 at 4:15 Reports are due March 14 Fnal s March 18 at 12:15 Open book,
More informationUNIT 11 TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT
UNIT TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT Structure. Introducton Obectves. Key Terms Used n Game Theory.3 The Maxmn-Mnmax Prncple.4 Summary.5 Solutons/Answers. INTRODUCTION In Game Theory, the word
More informationCoverage Control for Multiple Event Types with Heterogeneous Robots
Coverage Control for Multple Event Types wth Heterogeneous Robots Armn Sadegh Stephen L. Smth Abstract Ths paper focuses on the problem of deployng a set of autonomous robots to effcently montor multple
More informationThe Synthesis of Dependable Communication Networks for Automotive Systems
06AE-258 The Synthess of Dependable Communcaton Networks for Automotve Systems Copyrght 2005 SAE Internatonal Nagarajan Kandasamy Drexel Unversty, Phladelpha, USA Fad Aloul Amercan Unversty of Sharjah,
More informationChapter 1. On-line Choice of On-line Algorithms. Yossi Azar Andrei Z. Broder Mark S. Manasse
Chapter On-lne Choce of On-lne Algorthms Yoss Azar Andre Z. Broder Mark S. Manasse Abstract Let fa ; A 2; ; Amg be a set of on-lne algorthms for a problem P wth nput set I. We assume that P can be represented
More informationOptimal Transmission Scheduling of Cooperative Communications with A Full-duplex Relay
1 Optmal Transmsson Schedulng of Cooperatve Communcatons wth A Full-duplex Relay Peng L Member IEEE Song Guo Senor Member IEEE Wehua Zhuang Fellow IEEE Abstract Most exstng research studes n cooperatve
More informationPower Distribution Strategy Considering Active Power Loss for DFIGs Wind Farm
Journal of Power and Energy Engneerng, 014,, 13-19 Publshed Onlne Aprl 014 n cres. http://www.scrp.org/journal/jpee http://dx.do.org/10.436/jpee.014.4030 Power Dstrbuton trategy Consderng Actve Power Loss
More informationGenetic Algorithm for Sensor Scheduling with Adjustable Sensing Range
Genetc Algorthm for Sensor Schedulng wth Adjustable Sensng Range D.Arvudanamb #, G.Sreekanth *, S.Balaj # # Department of Mathematcs, Anna Unversty Chenna, Inda arvu@annaunv.edu skbalaj8@gmal.com * Department
More informationOptimization of Shortest Path of Multiple Transportation Model Based on Cost Analyses
Optmzaton of Shortest Path of Multple Transportaton Model Based on Cost Analyses Yang Yang 1,2 Ruyng Wang 1 Qanqan Zhang 1 1 Chna Unversty of Mnng & Technology (Bejng), School of Management, Bejng, 100083,
More informationCalculation of the received voltage due to the radiation from multiple co-frequency sources
Rec. ITU-R SM.1271-0 1 RECOMMENDATION ITU-R SM.1271-0 * EFFICIENT SPECTRUM UTILIZATION USING PROBABILISTIC METHODS Rec. ITU-R SM.1271 (1997) The ITU Radocommuncaton Assembly, consderng a) that communcatons
More informationLocation of Rescue Helicopters in South Tyrol
Locaton of Rescue Helcopters n South Tyrol Monca Talwar Department of Engneerng Scence Unversty of Auckland New Zealand talwar_monca@yahoo.co.nz Abstract South Tyrol s a popular destnaton n Northern Italy
More informationAn Analytical Method for Centroid Computing and Its Application in Wireless Localization
An Analytcal Method for Centrod Computng and Its Applcaton n Wreless Localzaton Xue Jun L School of Engneerng Auckland Unversty of Technology, New Zealand Emal: xuejun.l@aut.ac.nz Abstract Ths paper presents
More informationAn Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks
An Energy Effcent Herarchcal Clusterng Algorthm for Wreless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette, IN, USA {seema,
More informationaperture David Makovoz, 30/01/2006 Version 1.0 Table of Contents
aperture 1 aperture Davd Makovoz, 30/01/2006 Verson 1.0 Table of Contents aperture... 1 1 Overvew... 2 1.1 Input Image Requrements... 2 2 aperture... 2 2.1 Input... 2 2.2 Processng... 4 2.3 Output Table...
More informationRevision of Lecture Twenty-One
Revson of Lecture Twenty-One FFT / IFFT most wdely found operatons n communcaton systems Important to know what are gong on nsde a FFT / IFFT algorthm Wth the ad of FFT / IFFT, ths lecture looks nto OFDM
More informationNon-Cooperative Design of Translucent Networks
Non-Cooperatve Desgn of Translucent Networs Benoît Châtelan, She Mannor, Franços Gagnon, Davd V. Plant McGll Unversty, Electrcal and Computer Engneerng, 3480 Unversty, Montreal, Canada, H3A A7 École de
More informationCooperative perimeter surveillance with a team of mobile robots under communication constraints
213 IEEE/RSJ Internatonal Conference on Intellgent Robots and Systems (IROS) November 3-7, 213. Toyo, Japan Cooperatve permeter survellance wth a team of moble robots under communcaton constrants J.J.
More informationDouble-lock for image encryption with virtual optical wavelength
Double-lock for mage encrypton wth vrtual optcal wavelength Xang Peng Natonal Laboratory of Precson Measurement Technology and Instrumentaton, Tanjn Unversty, 30007 Tanjn, Chna Lngfeng Yu, and Llong Ca
More information