We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byAllison Shipler
Modified about 1 year ago
1 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen OR at Nokia Research Center Jukka K. Nurminen Nokia Research Center
2 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Where is OR at NRC? OR analysts => No LP & Simplex => No Dynamic programming => No Integer programming => No Game theory => No Decision analysis => No At first glance there is little use of OR BUT…
3 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Design an electronic circuit fulfilling a given specification with minimum cost minimum power usage minimum size maximum reuse … Simulation -> Analog Circuit Design
4 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Client 3 Client 2Client/Server 1 Client 4 Client 5 Root server Lucas-Lehmer test: 2 p -1 is prime if and only if S(p-1) = 0 (mod 2 p -1), where S(1) = 4 and S(k+1) = S(k) Personal Java on Nokia Communicator mobile phone + Simulations -> Distributed computing
5 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Plan the transmission network to connect GSM basestations with minimum cost high reliability easy maintenance flexibility for growth … Graph theory -> Network Planning Tool
6 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Queuing Models -> IP network analysis time Packets in the system: - under service - waiting N - arriving packet - departing packet Little’s law: E[N]=E[W] If: = L/C < 1 i.e. if the system is stabile
7 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Data analysis -> Location Detection Algorithms
8 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Statistical analysis -> Analysis of management data
9 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Non-linear programming -> Auto-tuning of base station parameters Cell pilot power P(t) is controlled with formulas:
10 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Self-organizing maps -> Context recoqnition Sensor signals for various user movements Data from a user scenario snapshot of three acc signals
11 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen What kind of OR works? OR tools and techniques embedded to application domain specific solutions Problem-solving mindset Simple, straightforward solutions Flexibility to evolve Fast and evolutionary development Meeting new and unexpected needs Tools complement rather than replace human experts Strict optimality or highly efficient algorithms are seldom needed
1 © NOKIA Presentation_Name.PPT / / Jukka K. Nurminen Optimaalisen tietoliikenneverkon suunnittelu Jukka K. Nurminen Nokia Research Center
1 Self-stabilizing Algorithms and Frequency Assignment Problems.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
KAIS T On the problem of placing Mobility Anchor Points in Wireless Mesh Networks Lei Wu & Bjorn Lanfeldt, Wireless Mesh Community Networks Workshop, 2006.
Protocols used by network systems are not effective to distributed system Special requirements are needed here. They are in cases of: Transparency.
Operational Research II By Dr. SW Poon. Line of Balance.
CEM 514 Modeling of Construction Operations The LP/IP hybrid method for construction time-cost trade-off analysis By Samir Abdallah Sulaiman.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Scheduling Algorithms for Wireless Ad-Hoc Sensor Networks Department of Electrical Engineering California Institute of Technology. [Cedric Florens, Robert.
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
A novel approach of gateway selection and placement in cellular Wi-Fi system Presented By Rajesh Prasad.
NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /
Lucent Technologies Bell Labs Innovations Lucent Technologies - Proprietary Access to the Global Internet: Which Technology Will Win? Evolution +3G builds.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Silberschatz, Galvin and Gagne 2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 19 Scheduling IV.
Group 3 Vahe Karapetyan Dena Rad Eidin Balali Patrick Njathi Zhong Zheng Damilare Adeoye Operations Research & Linear Programming Agenda Introduction.
Optimal Power Control, Rate Adaptation and Scheduling for UWB-Based Wireless Networked Control Systems Sinem Coleri Ergen (joint with Yalcin Sadi) Wireless.
1 PerfCenter and AutoPerf: Tools and Techniques for Modeling and Measurement of the Performance of Distributed Applications Varsha Apte Faculty Member,
Voice and Data Encryption over mobile networks July 2012 IN-NOVA TECNOLOGIC IN-ARG SA MESH VOIP.
1 1 Slide © 2005 Thomson/South-Western MANAGMENT SCIENCE n Chapter 1: Introduction Problem solving and decision making; quantitative analysis and decision.
Decision Making Pr. J.F. Lebraty University of Lyon April
Switching breaks up large collision domains into smaller ones Collision domain is a network segment with two or more devices sharing the same Introduction.
Indian Institute of Technology Bombay 1 Communication Networks Prof. D. Manjunath
Kick-off meeting 3 October 2012 Patras. Research Team B Communication Networks Laboratory (CNL), Computer Engineering & Informatics Department (CEID),
CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.
Collaborative Communications in Wireless Networks Without Perfect Synchronization Xiaohua(Edward) Li Assistant Professor Department of Electrical and Computer.
Lecture 20 Review of ISM 206 Optimization Theory and Applications.
Intelligent machines, the “idiots savants” A High Dessert presentation at University College By Felisa J Vázquez-Abad Dept of Computer Science and Operations.
Adapted from the original presentation made by the authors Reputation-based Framework for High Integrity Sensor Networks.
Decisive Themes, July, JL-1 ARTEMIS Decisive Theme for Integrasys Pedro A. Ruiz Integrasys July, 2011.
Decision Making: An Introduction 1. 2 Decision Making Decision Making is a process of choosing among two or more alternative courses of action for the.
Convex Optimization Chapter 1 Introduction. What, Why and How What is convex optimization Why study convex optimization How to study convex optimization.
EE 4272Spring, 2003 Chapter 10 Packet Switching Packet Switching Principles Switching Techniques Packet Size Comparison of Circuit Switching & Packet.
Wearable Badge for Indoor Location Estimation of Mobile Users MAS 961 Developing Applications for Sensor Networks Daniel Olguin Olguin MIT Media Lab.
WSN Simulation Template for OMNeT++ Stefan Dulman
Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.
LESSON 3. Properties of Well-Engineered Software The attributes or properties of a software product are characteristics displayed by the product once.
MAP BASED ROUTING IN LARGE SCALE URBAN VEHICLE NETWORKS.
DEPARTMENT/SEMESTER ME VII Sem COURSE NAME Operation Research Manav Rachna College of Engg.
Investigation of TDMA solution for the hidden terminal problem (With “ Wavion ” ) Final Report Presentation.
A Two-Phase Linear programming Approach for Redundancy Problems by Yi-Chih HSIEH Department of Industrial Management National Huwei Institute of Technology.
CONTENTS: 1.Abstract. 2.Objective. 3.Block diagram. 4.Methodology. 5.Advantages and Disadvantages. 6.Applications. 7.Conclusion.
CHAPTER 10 LESSON OBJECTIVES. Objectives 10.1 Students will be able to: Identify quadratic functions and determine whether they have a minimum or maximum.
MathCore Engineering AB Experts in Modeling & Simulation WTC.
Towards Seamless Navigation Ari Virtanen, Sami Koskinen VTT Industrial Systems P.O.Box 1302, Tampere Finland
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, and Chonggang Wang University of Minnesota, AT&T Lab, Arizona State University, Syracuse University, NEC.
Mobility Limited Flip-Based Sensor Networks Deployment Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic.
ECEN “Internet Protocols and Modeling”, Spring 2012 Slide 2.
© 2017 SlidePlayer.com Inc. All rights reserved.