1 Other bottom-up models BCPM HAI Model LECOM. 2 BCPM Uses engineering rules-of-thumb to direct feeder paths to areas of customer location Uses pinetree.

Slides:



Advertisements
Similar presentations
Module 13: Performance Tuning. Overview Performance tuning methodologies Instance level Database level Application level Overview of tools and techniques.
Advertisements

1. Find the cost of each of the following using the Nearest Neighbor Algorithm. a)Start at Vertex M.
Whitebox Testing Fra: CS Fall Whitebox Testing AKA Structural, Basis Path Test Normally used at unit level Assumes errors at unit level are.
DIMENSIONALITY REDUCTION: FEATURE EXTRACTION & FEATURE SELECTION Principle Component Analysis.
TOPOLOGIES FOR POWER EFFICIENT WIRELESS SENSOR NETWORKS ---KRISHNA JETTI.
An Overview of Machine Learning
Patch to the Future: Unsupervised Visual Prediction
By Hitesh Ballani, Paul Francis, Xinyang Zhang Slides by Benson Luk for CS 217B.
Ai in game programming it university of copenhagen Statistical Learning Methods Marco Loog.
Machine Learning.
Telecommunication Networks and integrated Services (TNS) Laboratory Department of Digital Systems University of Piraeus Research Center (UPRC) University.
Planning under Uncertainty
Importance Sampling. What is Importance Sampling ? A simulation technique Used when we are interested in rare events Examples: Bit Error Rate on a channel,
0 Smart Grid Computational Tool (SGCT) For best results view this presentation in Slide Show mode.
1 A Confidence Interval for the Misclassification Rate S.A. Murphy & E.B. Laber.
GIS Functions and Economic Applications Credits to Brian Mennecke, East Carolina University.
CSCI 347 / CS 4206: Data Mining Module 04: Algorithms Topic 06: Regression.
The MRP II Hierarchy. Long-Range Planning At the top of the hierarchy we have long-range planning. This involves three functions: resource planning,
Powered by. Motus is an integrated web-based and mobile software platform that supports field work management and execution, giving employees necessary.
Ch. Eick: Support Vector Machines: The Main Ideas Reading Material Support Vector Machines: 1.Textbook 2. First 3 columns of Smola/Schönkopf article on.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
Section 10.5 – Area and Arc Length in Polar Coordinates
Engineering Design Process
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
Chapter 12 Routing in Switched Networks. Routing in Packet Switched Network  key design issue for (packet) switched networks  select route across network.
Chapter 13 Genetic Algorithms. 2 Data Mining Techniques So Far… Chapter 5 – Statistics Chapter 6 – Decision Trees Chapter 7 – Neural Networks Chapter.
WP4 – Optical Processing Sub-System Development Start M06, finish M30 UCC lead Plans for next 6 months: –Begin firmware/control work –Focus on initial.
Groups of models Intra-Enterprise Planning Enterprise Planning itself Single Facility Location Models Multiple Facility Location Models.
Inductive learning Simplest form: learn a function from examples
1 Local search and optimization Local search= use single current state and move to neighboring states. Advantages: –Use very little memory –Find often.
1 A Bayesian Method for Guessing the Extreme Values in a Data Set Mingxi Wu, Chris Jermaine University of Florida September 2007.
The Hybrid Cost Proxy Model: Portugal Edition D. Mark Kennet William W. Sharkey Instituto das Comunicações de Portugal November, 2000.
Overview of Supervised Learning Overview of Supervised Learning2 Outline Linear Regression and Nearest Neighbors method Statistical Decision.
© OpenRules, Inc. Creating, Testing, and Executing Decision Models with OpenRules-6 Presenter: Dr. Jacob Feldman OpenRules, Inc., CTO OMG Decision.
Data Mining Algorithms for Large-Scale Distributed Systems Presenter: Ran Wolff Joint work with Assaf Schuster 2003.
DataBases & Data Mining Joined Specialization Project „Data Mining Classification Tool” By Mateusz Żochowski & Jakub Strzemżalski.
Data Communications and Networking Chapter 11 Routing in Switched Networks References: Book Chapters 12.1, 12.3 Data and Computer Communications, 8th edition.
Optimal Bayes Classification
Linear Discrimination Reading: Chapter 2 of textbook.
Clustering.
Learning to Navigate Through Crowded Environments Peter Henry 1, Christian Vollmer 2, Brian Ferris 1, Dieter Fox 1 Tuesday, May 4, University of.
Tussle in Cyberspace: Defining Tomorrow’s Internet Presented by: Khoa To.
Unit 1: The World in Spatial Terms Lesson 8: Reading a Road Map.
Frankfurt (Germany), 6-9 June 2011 Marcus R. Carvalho – Brazil – RIF Session 5 – Paper ID 0728 LONG TERM PLANNING BASED ON THE PREDICTION AND ANALYSIS.
Vehicle Routing & Scheduling Cluster Algorithms Improvement Heuristics Time Windows.
User Modeling and Recommender Systems: recommendation algorithms
Demand Response Analysis and Control System (DRACS)
Integrating Geographic Information Systems and Vehicle Operations Hal Bowman ESRI, Inc.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
SAP Controlling Functionality and Implementation
Learning A Better Compiler Predicting Unroll Factors using Supervised Classification And Integrating CPU and L2 Cache Voltage Scaling using Machine Learning.
ExESS Integration with IUCLID5.2. april 2011ExESS and IUCLID5 integration1.
Flow cytometry data analysis: SPADE for cell population identification and sample clustering Narahara.
Data Collection and Process Mapping
Routing: Link State Algorithm
SRAM Yield Rate Optimization EE201C Final Project
Islamic University of Gaza
Tapping Into The Unutilized Router Processing Power
Lookahead pathology in real-time pathfinding
Algorithms for Exploration
Machine Learning Week 1.
CS 31006: Computer Networks – The Routers
Instance Based Learning
The Network Layer Network Layer Design Issues:
SQUARE ROOTS.
Utilizing the ring operation mode of MV distribution feeders
Incorporating lot sizing into MRP
Physics-guided machine learning for milling stability:
Memory-Based Learning Instance-Based Learning K-Nearest Neighbor
is still under development(WIP). Series A-1 Series A-2 Series A-3
Presentation transcript:

1 Other bottom-up models BCPM HAI Model LECOM

2 BCPM Uses engineering rules-of-thumb to direct feeder paths to areas of customer location Uses pinetree feeder routing methodology Uses rules-of-thumb to determine feeder technology Organizes customer locations using map grids Uses rule-of-thumb distribution routing Incorporates SCIS output for switch costs Assumes SONET technology for interoffice

3 Why not BCPM? Rules of thumb do not capture economic tradeoffs necessary to calculate economic cost Customer location approach leads to biased estimates of loop lengths SCIS switching model has never been transparent

4 HAI Model Uses engineering rules-of-thumb to direct feeder paths to areas of customer location Uses modified pinetree feeder routing technology (pinetree + “outlier” terminals) Optimizes feeder technology Organizes customer locations using nearest- neighbor cluster algorithm Uses rule-of-thumb distribution routing Simplified switch cost module Assumes SONET technology for interoffice

5 Why not HAI? Although fewer rules of thumb than BCPM, they are still employed (instead of real economic decision modeling) Customer location approach, although it involves the use of clustering, leads to biased estimates of distribution loop lengths

6 LECOM Uses pinetree feeder routing (no redirection of path) Optimizes feeder technology Organizes customer location using map grids Uses rule-of-thumb to determine distribution routing Optimizes switch number and locations Switch costs based on bottom-up design module Uses rule-of-thumb interoffice module

7 Why not LECOM? Customer location modeling inadequate Pinetree feeder is not optimal Best idea: Integrate LECOM optimization features into HCPM