Review Petteri Nurmi
|
|
- Arttu Hakola
- 6 vuotta sitten
- Katselukertoja:
Transkriptio
1 Review Petteri Nurmi
2 Overview of the Course I: Measuring and estimating location information II: Analysing and understanding location data Representing location, location systems, positioning and tracking Place identification, mobility modeling, trajectory analysis
3 Part I: Measuring and Estimating Location Information
4 Representing Location Information Absolute Coordinates with respect to a given reference system Requires an origin and a reference/unit distance Relative Location specified relative to an object Requires reference point, distance and angle Symbolic Location expressed using a semantic description (place or room)
5 Ellipsoidal Coordinate Systems Contemporary geographic reference systems rely on ellipsoidal coordinate systems Shape of Earth represented as an ellipsoid Origin specified by two orthogonal planes that intersect at the geocenter of Earth Latitude ): parallel to Equator Longitude ): perpendicular to Equator Shape of geographic area approximated using a reference ellipsoid Essential for distance calculations Specified by a combination of semi-major axis (or diameter) and inverse flattening
6 Geoid Approximation of mean sea level Equipotential surface of the gravitational field that coincides with mean sea level Standard for measuring altitudes from sea level 1) True ocean level 2) Reference ellipsoid 3) Local plumb 4) Continent 5) Geoid
7 Measuring distances between locations Euclidean distance Useful for short distances Requires an unit distance, i.e., how much a difference of 0.01 (or so) in coordinates is in meters at a given latitude Geodetic distance Distance along the surface of an ellipsoid Geodetic problem defines how differences in coordinates are mapped into distances and vice versa Direct: given an angle and distance, determine new location from a known origin Indirect: given two points, determine angle and distance between them Vincenty s formula provides an iterative algorithm for solving geodetic problems
8 Determining Location Location system Component that provides measurements that can be used for determining the position of an entity Types of measurements: Identifier: GSM cell identifier, WiFi Mac address RSS: received signal strength (-dbm) Geographic: distance or angle Positioning algorithm Technique for determining the position of an entity using the measurements provided by the location system Triangulation, trilateration, multilateration, fingerprinting
9 Geometric Positioning Algorithms Basic idea: Angle and/or distance measurements from two or more reference points used for determining position Triangulation The use of angle measurements for determining the position of an entity Trilateration The use of distance measurements for determining the position of an entity Multilateration The use of differences in distances for determining the position of an entity
10 Error of Geometric Positioning Distance and/or angle from reference points can seldom be measured exactly Obstacles cause attenuation and multi path effects Synchronization, reference point errors, interference Measurements define an error region Intersection of multiple error regions defines an area of uncertainty for position estimate Size of the area of uncertainty referred to as the Dilution of Precision (DoP) Geometry of reference points influences the size of the error region
11 Location Systems for Geometric Positioning Distance can be measured using Time-of-flight One-way: from reference point to receiver or vice versa, requires time synchronization (e.g., GPS) Round-trip time (e.g., Radar) Radio propagation models Mathematical formulation of how signals vary as a function of distance Example, log distance path loss model Alternative is to use angle measurements E.g., ultrasound, zigbee
12 Other sources of error Atmospheric effects Propagation follows speed of light only in a vacuum Refraction: change in direction of wave, occurs when a wave enters from one medium to another Multipath propagation Phenomenon where signals reach the receiver along multiple paths Reflection, diffraction or scattering, depending on wavelength and size of obstacles Clock errors Synchronization errors between two clocks can cause huge errors due to speed of signals
13 Fingerprinting Technique that exploits spatial variations in observed signal characteristics for positioning Two phases Calibration: construct a database that characterizes the signal variations at different locations Operates on measurements containing both location and signal characteristics Estimation: compare a new measurement against the radio map to determine the location of an entity Given a new signal characteristics measurement, use the radio map to estimate the most likely position where the measurement was taken
14 Deterministic Fingerprinting Basic idea: Given measurement s, calculate a distance d(s,x) between s and all measurements x in the radio map Typically Euclidean distance or correlation Use the most similar measurements x (as defined by the distance) to estimate location of client knn and WkNN Find the best k measurements, i.e., measurement x for which d(s,x) is smallest Assign a weight for each measurement (knn = uniform, WkNN = non-uniform) Position estimated as a weighted average of the locations associated with the best matching measurements
15 Probabilistic Fingerprinting Basic idea: Given measurement s, calculate the probability of seeing the measurement at different locations Estimate the location of the client based on the resulting probabilities Probability of a location given by a signal model Specifies the probability distribution of observing particular signal values at a given location Can be histogram-based or parametric (e.g., Gaussian)
16 Location Systems Proximity Sensing Position based on closeness of a reference point Examples: infrared, RFID, Bluetooth Special case: mobile call-detail records (CDR), location estimated as coordinates of current cell tower
17 Location Systems Satellite Positioning Trilateration-based positioning approach Reference points are satellites on a specific orbit Distances from satellites measured using one way timeof-flight measurements Satellites broadcast messages that contain orbital position and system time of the satellite Receivers listen for the broadcasts and estimate Distance from the satellites Clock offset Pseudorange:
18 Location Systems Mobile Networks Network divided into base stations and cells Base Transceiver Station: equipment responsible for handling communications within a geographic area Cell: antenna that serves a specific geographic area One BTS can be responsible for multiple cells Location Area Identifier (LAI): globally unique id for a cell Location Area (LA): cluster of cells, smallest unit for which the network maintains position information Position can be determined using Proximity sensing: BTS coordinates, Timing Advance Multilateration: Differences in arrival times Fingerprinting: on the handset based on observed RSS values of cells
19 Position Tracking Monitoring the location of an entity over time State space models provide a generic framework for implementing tracking Location of an entity represented using a state x k which cannot be directly observed Evolution of state over time controlled by state equation x k = Ax k-1 + v Measurements (or observations) y k provide cues about the true state of the system Measurement equation specifies how the measurements relate to the true system state y k = Ux k + w
20 Bayesian Optimal Filter Probabilistic approach to state space models Given a sequence of measurements y 1:k returns a probability distribution p(x k y 1:k ) over the current state (location of object) Evolution of state specified by a probability distribution p(x k x k-1 ), also know as (state) transition probability Measurements relate to state using another probability distribution p(y k x 1:k, y 1:k-1 ) Usually assume that Future and past independent of each other given present Measurements are conditionally independent given state
21 Kalman Filter Closed form solution of the Bayesian optimal filter Assumes noise is uncorrelated and Gaussian and that relationships between variables are linear Under these assumptions, the filtering distribution p(x k y k-1 ) is also Gaussian Implementing the filter thus requires maintaining estimates of the mean and covariance matrix Two phases Prediction: guess the most likely values of the parameters given the current values Update: correct the predictions when a new measurement comes available
22 Kalman Filter Prediction: Propagate current values using system dynamics Update m* k A k-1 m k-1 P* k A k-1 P k-1 A T k-1 + Q Calculate residuals between predicted value and estimated value and correct the predicted values
23 Particle Filters In real world applications noise often non-gaussian and the state space is non-linear x k = z(x k-1 ) + q k y k = h(x k )+ r k Particle filtering uses Monte Carlo integration recursively to approximate the filtering distribution For function g( ) and distribution f(x), we have: E(g(x)) = g(x) f(x) dx When f(x) equals the filtering density, we get: E(g(x)) = g(x) p(x k, y 1:k ) dx 1/K j g(x kj )
24 Particle Filters Sequential Importance Resampling Initialization: Draw K particles according to prior distribution, set w j = 1/ K for all particles Estimation step: Draw K samples from proposal distribution: x kj (x k x kj, y 1:k ) Update importance weight of particle j w kj = w k-1 j p(y k x kj ) p(x kj x k-1j ) / (x k j, x 1:k-1j, y 1:k ) Calculate number of effective particles N EFF = 1 / j (w kj ) 2 and resample particles if value below a threshold State of filter can be estimated using j w kj x k j
25 Part II: Analysing Location Measurements
26 Preprocessing Errors in location measurements should be rectified before data can be analyzed Measurement validity: remove extreme values or values that are otherwise known to be erroneous (e.g., less than 4 GPS satellites) Measurement uncertainty: remove measurements with high uncertainty (e.g., high HDOP value) or filter measurements over time (Kalman filter or particle filter) to smoothen them
27 Partitioning Algorithms K-Means One of the best-known clustering algorithms Iterative relocation algorithm, optimizes squared loss m i corresponds to the center of a cluster, C i is the set of points allocated to cluster i Basic structure: Initialization: generate k cluster centers according to some criterion (e.g., random selection from data) During each iteration: Allocate each point to the cluster that is closest Revise cluster centers based on the points that are assigned to the cluster Repeat until no change in values
28 Partitioning Algorithms Gaussian Mixture Models Data generated by k random variables, each variable X i characterized by probability density function f i ( i ) For each point i, a hidden and unobservable variable c i determines the cluster where i belongs to The clusters are called mixture components Each f i ( i ) is assumed to be Gaussian Mean i determines the center of the cluster Covariance matrix i determines shape of the cluster Cluster parameters can be determined using the expectation maximization (EM) algorithm
29 Density-Based Clustering Class of algorithms that represents clusters as dense regions of objects Epsilon neighborhood: collection of points that are within distance Eps from a point Dense neighborhood: Epsilon neighborhood that contains at least MinPts points Radius-based clustering Merge all points within distance Eps Prune clusters using a density criterion
30 Density-Based Clustering DBScan Algorithm that recursively merges Epsilon neighborhoods together to identify dense regions Let c be a core object, within the Epsilon neighborhood of c considered as seed points A point that has at least MinPts within its Epsilon neighborhood is called a core object Non-core objects which do not belong to the Epsilon neighborhood of any core objects are noise Cluster expanded with (previously unallocated) points that are within the Epsilon neighborhood of a seed point
31 Place Identification (from coordinate data) Place is a symbolic/semantic representation of location Physical locations linked with activities and semantics Consistent with the way people refer to location information Places can be detected from coordinate data: Spatial clustering used to identify regions where a person spends a significant amount of time Pre- or post-processing used to remove areas/points that are unlikely to be significant E.g., using temporal or spatial constraints Additionally a labeling step that assigns semantics with the identified places
32 Movement Statistics Area of influence The geographical area within which a user spends most of her time doing daily activities Diameter Maximum distance between two cell towers (BTS) Characterizes the size of the area of influence Radius of gyration Average distance that the person typically travels
33 Mobility Model Mathematical characterization of how people move Model can capture: 1. Movement between places (location) 2. Arrival times, i.e., when person arrives to places 3. Duration of stay in places Context independent vs. dependent Whether the model depends or not on factors such as time-of-day, weekend/weekday, type of location etc. Model order Specifies how much historical information needs to be considered to make predictions about future behavior
34 Location Transition Modeling Markov Predictor Stochastic state machine State of the system is assumed to evolve over time according to a probabilistic model p(x k x 1:k-1 ) Transition probabilities p(x k x 1:k-1 ) determine how likely it is that a person moves from one place to another Probability of current state assumed to depend on previous q values, where q is the order of the model In practice Use place identification to learn the places of interest for an individual Use location measurements to estimate how the person moves from one location to another
35 Lempel-Ziv (LZ) Predictor Sequence of visited locations represented as a string The string is recursively split into parts to maximize compressibility of the input Splitting of string can be represented using a so-called LZ tree Next place can be predicted by examining how often a particular location has followed the current location history 2/3 3/8 2/8 2/8 1/8 1/2 1/
36 Stationary Detection Stationary Moving Determining whether a person is moving or not, the first subtask in transportation behavior monitoring Sensor values tend to contain more variation when the user is moving compared to stationary periods Variance or intensity of accelerometer values Rate of change in the signal environment Similarity of WiFi access points seen over consecutive time windows Number of unique cell towers observed within a window
37 GPS Locomotion Detection HCR = P c / d SR = P s / d VCR = P v / d Variations in movement trajectories can be used for determining transportation mode Heading change rate (HCR): frequency that people change heading direction within unit distance Stop rate (SR): frequency that people stop / move with slow speed within unit distance Velocity change rate (VCR): frequency of observing significant changes in velocity over a unit distance Other possible features Statistical features (mean, variance, maximum etc.) characterizing velocity and acceleration, calculated over specific road segments
38 Trajectory The location of an object over time Continuous function f(t) that returns the 2D or 3D position of an object at time t Location measurements can only be collected at discrete intervals Sensed trajectory is a piece-wise continuous function f(t k ) that returns position of object at sampling interval t k s 1 s 2 s 3 s 4 s 5 s 6 s 7 s8 = s R
39 Trajectory Simplification Simplification refers to approximating the original trajectory with a simpler form Reduces storage space Provides savings in power consumption Location measurements Sensed Trajectory Simplified Trajectory Measurements retained
40 Simplification Error Error measured as the difference between the original trajectory and simplified trajectory Perpendicular distance: maximum distance between any measurement and the simplified line Angular distance: accumulated difference in angle Orthogonal distance: difference in distance e 4 e 5 e 6 e 1 e 2 e
41 Trajectory Simplification Douglas-Peucker Iterative trajectory simplification algorithm Generate segment between first and last measurement Identify point that is furthest from the segment and if it is further than a threshold, include the point Apply algorithm recursively on the two segments defined by the first, last and the added point e e e e e e
42 Trajectory Simplification Minimum Description Length Simplified trajectory considered a hypothesis Hypothesis that provides the best balance between preciseness (accuracy) and conciseness (small number of points) is the optimal simplification True s i+1 s i+2 False s i+3 False s i s i+4 = s j
43 Trajectory Similarity Measures Euclidean A B Compares measurements at the same time instance t Time offsets, dilation and noise have significant impact on resulting values A B Dynamic time warping Dynamic programming approach to time series, similar to edit distance but differences carry a dynamic penalty Longest common subsequence (LCS) Similarity measured as the total length of common subsequences
44 Trajectory Clustering KMedoids 15 Partitioning-based clustering algorithm where clusters represented using the most centrally located measurement/object medoid 0 0 medoid -5-5 medoid
45 Trajectory Clustering TRACLUS 1. Segment trajectories 2. Calculate weighted sum of distances between trajectory segments 3. Apply DBSCAN 4. Extract representative trajectory
46 Location-Based Services Computer applications that deliver information depending on the location of the device and user Numerous different categories of services Emergency services: E911 and E112 Mobile advertising Location-based games (Mobile) Augmented reality Main challenges Privacy Energy-efficiency Indoor positioning Lack of standards
47 Energy-Efficiency Minimizing power consumption of location sensing, tracking and reporting Trade-off between position accuracy and the amount of savings that can be obtained Define an error threshold E and optimize energy so that position is accurate within E most of the time Three main techniques for reducing power Duty cycling: reducing sampling frequency of sensors Sensor management: use less accurate but more energyefficient sensors whenever possible Data uploading: intelligent schemes for reducing location reporting frequency
48 Location Privacy Ability to prevent other parties from learning one s current or past location Countermeasures Anonymity: replace associated name with pseudonym or other untraceable identifier K-Anonymity Mix-Zones Obfuscation: reduce quality of information to hide sensitive details Spatial and/or temporal degradation Cloaking
49 Home Exam
50 Home Exam Exam period 22/2 16:00 7/3 16:00 Similar to the exercises, do not provide only results but also how they were derived (including code) Solutions to exam must be submitted by to the lecturer AND teaching assistants before the hard cut-off (16:00 on 7 th of March) Course grading takes into account both exercise activity and success in the exam
Efficiency change over time
Efficiency change over time Heikki Tikanmäki Optimointiopin seminaari 14.11.2007 Contents Introduction (11.1) Window analysis (11.2) Example, application, analysis Malmquist index (11.3) Dealing with panel
LisätiedotCapacity Utilization
Capacity Utilization Tim Schöneberg 28th November Agenda Introduction Fixed and variable input ressources Technical capacity utilization Price based capacity utilization measure Long run and short run
LisätiedotPositioning Algorithms. Petteri Nurmi
Positioning Algorithms Petteri Nurmi 19.1.2012 1 Questions How triangulation works and where it is still used? How trilateration works? How can distances be measured? How multilateration differs from trilateration?
LisätiedotSpatial Analysis Clustering Petteri Nurmi
Spatial Analysis Clustering Petteri Nurmi 2.2.2012 1 Questions What kind of preprocessing steps are useful for GPS measurements? What different classes of spatial clustering exist? What is the difference
LisätiedotPositioning Algorithms. Petteri Nurmi
Positioning Algorithms Petteri Nurmi 19.1.2012 1 Questions What are the main positioning algorithms and how they work? Which two main factors influence positioning errors? What is dilution of precision?
LisätiedotTracking and Filtering. Petteri Nurmi
Tracking and Filtering Petteri Nurmi 4.4.2014 1 Questions What are state space models? Why are they relevant in position tracking? What is a Bayesian optimal filter? Which two steps form the filter? What
LisätiedotThe CCR Model and Production Correspondence
The CCR Model and Production Correspondence Tim Schöneberg The 19th of September Agenda Introduction Definitions Production Possiblity Set CCR Model and the Dual Problem Input excesses and output shortfalls
LisätiedotE80. Data Uncertainty, Data Fitting, Error Propagation. Jan. 23, 2014 Jon Roberts. Experimental Engineering
Lecture 2 Data Uncertainty, Data Fitting, Error Propagation Jan. 23, 2014 Jon Roberts Purpose & Outline Data Uncertainty & Confidence in Measurements Data Fitting - Linear Regression Error Propagation
LisätiedotTM ETRS-TM35FIN-ETRS89 WTG
SHADOW - Main Result Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered by the blade Please look in WTG table WindPRO version 2.8.579
LisätiedotTracking and Filtering. Petteri Nurmi
Tracking and Filtering Petteri Nurmi 19.11.2016 1 Questions What are state space models? Why are they relevant in position tracking? What is a Bayesian optimal filter? Which two steps form the filter?
LisätiedotMetsälamminkankaan tuulivoimapuiston osayleiskaava
VAALAN KUNTA TUULISAIMAA OY Metsälamminkankaan tuulivoimapuiston osayleiskaava Liite 3. Varjostusmallinnus FCG SUUNNITTELU JA TEKNIIKKA OY 12.5.2015 P25370 SHADOW - Main Result Assumptions for shadow calculations
Lisätiedot( ( OX2 Perkkiö. Rakennuskanta. Varjostus. 9 x N131 x HH145
OX2 9 x N131 x HH145 Rakennuskanta Asuinrakennus Lomarakennus Liike- tai julkinen rakennus Teollinen rakennus Kirkko tai kirkollinen rak. Muu rakennus Allas Varjostus 1 h/a 8 h/a 20 h/a 0 0,5 1 1,5 2 km
LisätiedotSpatial Analysis Clustering. Petteri Nurmi
Spatial Analysis Clustering Petteri Nurmi 28.3.2014 1 Questions What kind of preprocessing steps are useful for GPS measurements? What different classes of spatial clustering exist? What is the difference
LisätiedotTynnyrivaara, OX2 Tuulivoimahanke. ( Layout 9 x N131 x HH145. Rakennukset Asuinrakennus Lomarakennus 9 x N131 x HH145 Varjostus 1 h/a 8 h/a 20 h/a
, Tuulivoimahanke Layout 9 x N131 x HH145 Rakennukset Asuinrakennus Lomarakennus 9 x N131 x HH145 Varjostus 1 h/a 8 h/a 20 h/a 0 0,5 1 1,5 km 2 SHADOW - Main Result Assumptions for shadow calculations
LisätiedotTM ETRS-TM35FIN-ETRS89 WTG
SHADOW - Main Result Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered by the blade Please look in WTG table WindPRO version 2.9.269
LisätiedotT Statistical Natural Language Processing Answers 6 Collocations Version 1.0
T-61.5020 Statistical Natural Language Processing Answers 6 Collocations Version 1.0 1. Let s start by calculating the results for pair valkoinen, talo manually: Frequency: Bigrams valkoinen, talo occurred
LisätiedotTM ETRS-TM35FIN-ETRS89 WTG
VE1 SHADOW - Main Result Calculation: 8 x Nordex N131 x HH145m Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered by the blade Please
LisätiedotIndoor Localization I Introduction and Positioning Algorithms Petteri Nurmi
Indoor Localization I Introduction and Positioning Algorithms Petteri Nurmi 29.10.2015 1 About the course Advanced course: networking and services subprogramme (also well suited for algorithms, data analytics,
LisätiedotTM ETRS-TM35FIN-ETRS89 WTG
SHADOW - Main Result Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered by the blade Please look in WTG table WindPRO version 2.8.579
LisätiedotTM ETRS-TM35FIN-ETRS89 WTG
SHADOW - Main Result Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered by the blade Please look in WTG table WindPRO version 2.8.579
Lisätiedot16. Allocation Models
16. Allocation Models Juha Saloheimo 17.1.27 S steemianalsin Optimointiopin seminaari - Sks 27 Content Introduction Overall Efficienc with common prices and costs Cost Efficienc S steemianalsin Revenue
LisätiedotWindPRO version joulu 2012 Printed/Page :47 / 1. SHADOW - Main Result
SHADOW - Main Result Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered by the blade Please look in WTG table WindPRO version 2.8.579
LisätiedotWindPRO version joulu 2012 Printed/Page :42 / 1. SHADOW - Main Result
SHADOW - Main Result Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered by the blade Please look in WTG table 13.6.2013 19:42 / 1 Minimum
LisätiedotReturns to Scale II. S ysteemianalyysin. Laboratorio. Esitelmä 8 Timo Salminen. Teknillinen korkeakoulu
Returns to Scale II Contents Most Productive Scale Size Further Considerations Relaxation of the Convexity Condition Useful Reminder Theorem 5.5 A DMU found to be efficient with a CCR model will also be
LisätiedotOther approaches to restrict multipliers
Other approaches to restrict multipliers Heikki Tikanmäki Optimointiopin seminaari 10.10.2007 Contents Short revision (6.2) Another Assurance Region Model (6.3) Cone-Ratio Method (6.4) An Application of
Lisätiedot1. SIT. The handler and dog stop with the dog sitting at heel. When the dog is sitting, the handler cues the dog to heel forward.
START START SIT 1. SIT. The handler and dog stop with the dog sitting at heel. When the dog is sitting, the handler cues the dog to heel forward. This is a static exercise. SIT STAND 2. SIT STAND. The
Lisätiedot,0 Yes ,0 120, ,8
SHADOW - Main Result Calculation: Alue 2 ( x 9 x HH120) TuuliSaimaa kaavaluonnos Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered
LisätiedotTM ETRS-TM35FIN-ETRS89 WTG
SHADOW - Main Result Calculation: N117 x 9 x HH141 Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered by the blade Please look in WTG
Lisätiedot( ,5 1 1,5 2 km
Tuulivoimala Rakennukset Asuinrakennus Liikerak. tai Julkinen rak. Lomarakennus Teollinen rakennus Kirkollinen rakennus Varjostus "real case" h/a 1 h/a 8 h/a 20 h/a 4 5 3 1 2 6 7 8 9 10 0 0,5 1 1,5 2 km
LisätiedotSpatial Analysis Clustering. Petteri Nurmi
Spatial Analysis Clustering Petteri Nurmi 24.11.2016 1 Questions How GPS measurements can be preprocessed? What different classes of spatial clustering exist? What is the difference between partitioning
LisätiedotThe Viking Battle - Part Version: Finnish
The Viking Battle - Part 1 015 Version: Finnish Tehtävä 1 Olkoon kokonaisluku, ja olkoon A n joukko A n = { n k k Z, 0 k < n}. Selvitä suurin kokonaisluku M n, jota ei voi kirjoittaa yhden tai useamman
LisätiedotTM ETRS-TM35FIN-ETRS89 WTG
SHADOW - Main Result Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered by the blade Please look in WTG table 5.11.2013 16:44 / 1 Minimum
Lisätiedot7.4 Variability management
7.4 Variability management time... space software product-line should support variability in space (different products) support variability in time (maintenance, evolution) 1 Product variation Product
LisätiedotTM ETRS-TM35FIN-ETRS89 WTG
SHADOW - Main Result Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered by the blade Please look in WTG table 22.12.2014 11:33 / 1 Minimum
LisätiedotHuom. tämä kulma on yhtä suuri kuin ohjauskulman muutos. lasketaan ajoneuvon keskipisteen ympyräkaaren jänteen pituus
AS-84.327 Paikannus- ja navigointimenetelmät Ratkaisut 2.. a) Kun kuvan ajoneuvon kumpaakin pyörää pyöritetään tasaisella nopeudella, ajoneuvon rata on ympyränkaaren segmentin muotoinen. Hitaammin kulkeva
LisätiedotTM ETRS-TM35FIN-ETRS89 WTG
SHADOW - Main Result Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered by the blade Please look in WTG table WindPRO version 2.8.579
LisätiedotAlternative DEA Models
Mat-2.4142 Alternative DEA Models 19.9.2007 Table of Contents Banker-Charnes-Cooper Model Additive Model Example Data Home assignment BCC Model (Banker-Charnes-Cooper) production frontiers spanned by convex
LisätiedotRakennukset Varjostus "real case" h/a 0,5 1,5
Tuulivoimala Rakennukset Asuinrakennus Liikerak. tai Julkinen rak. Lomarakennus Teollinen rakennus Kirkollinen rakennus Varjostus "real case" h/a 1 h/a 8 h/a 20 h/a 1 2 3 5 8 4 6 7 9 10 0 0,5 1 1,5 2 km
LisätiedotValuation of Asian Quanto- Basket Options
Valuation of Asian Quanto- Basket Options (Final Presentation) 21.11.2011 Thesis Instructor and Supervisor: Prof. Ahti Salo Työn saa tallentaa ja julkistaa Aalto-yliopiston avoimilla verkkosivuilla. Muilta
LisätiedotInformation on preparing Presentation
Information on preparing Presentation Seminar on big data management Lecturer: Spring 2017 20.1.2017 1 Agenda Hints and tips on giving a good presentation Watch two videos and discussion 22.1.2017 2 Goals
LisätiedotLocation Systems Petteri Nurmi
Location Systems Petteri Nurmi 26.1.2012 1 Questions Which dimensions can be used to characterize location systems? Which criteria can be used to evaluate location systems? What is proximity sensing and
LisätiedotIndoor Localization II Location Systems. Petteri Nurmi Autumn 2015
Indoor Localization II Location Systems Petteri Nurmi Autumn 2015 6.11.2015 1 Learning Objectives What are the main dimensions for categorizing location systems? Which are main error sources for indoor
LisätiedotTrajectory Analysis. Sourav Bhattacharya, Petteri Nurmi
Trajectory Analysis Sourav Bhattacharya, Petteri Nurmi 12.4.2014 1 Questions What are trajectories? How are they represented? What are the challenges with large trajectory data? How can we reduce trajectory
LisätiedotLYTH-CONS CONSISTENCY TRANSMITTER
LYTH-CONS CONSISTENCY TRANSMITTER LYTH-INSTRUMENT OY has generate new consistency transmitter with blade-system to meet high technical requirements in Pulp&Paper industries. Insurmountable advantages are
LisätiedotTM ETRS-TM35FIN-ETRS89 WTG
SHADOW - Main Result Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered by the blade Please look in WTG table WindPRO version 2.8.579
LisätiedotTM ETRS-TM35FIN-ETRS89 WTG
SHADOW - Main Result Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered by the blade Please look in WTG table WindPRO version 2.8.579
LisätiedotLocation Systems. Petteri Nurmi
Location Systems Petteri Nurmi 20.3.2014 1 Questions Which dimensions can be used to characterize location systems? Which criteria can be used to evaluate location systems? What is proximity sensing and
LisätiedotModeling Mobility. Petteri Nurmi
Modeling Mobility Petteri Nurmi 28.3.2014 1 Questions What mobility models are? What is a discrete Markov model? What is an order q Markov predictor? What is the LZ predictor? What are time independent
LisätiedotC++11 seminaari, kevät Johannes Koskinen
C++11 seminaari, kevät 2012 Johannes Koskinen Sisältö Mikä onkaan ongelma? Standardidraftin luku 29: Atomiset tyypit Muistimalli Rinnakkaisuus On multicore systems, when a thread writes a value to memory,
LisätiedotGap-filling methods for CH 4 data
Gap-filling methods for CH 4 data Sigrid Dengel University of Helsinki Outline - Ecosystems known for CH 4 emissions; - Why is gap-filling of CH 4 data not as easy and straight forward as CO 2 ; - Gap-filling
LisätiedotHITSAUKSEN TUOTTAVUUSRATKAISUT
Kemppi ARC YOU GET WHAT YOU MEASURE OR BE CAREFUL WHAT YOU WISH FOR HITSAUKSEN TUOTTAVUUSRATKAISUT Puolitetaan hitsauskustannukset seminaari 9.4.2008 Mikko Veikkolainen, Ratkaisuliiketoimintapäällikkö
LisätiedotResults on the new polydrug use questions in the Finnish TDI data
Results on the new polydrug use questions in the Finnish TDI data Multi-drug use, polydrug use and problematic polydrug use Martta Forsell, Finnish Focal Point 28/09/2015 Martta Forsell 1 28/09/2015 Esityksen
LisätiedotBounds on non-surjective cellular automata
Bounds on non-surjective cellular automata Jarkko Kari Pascal Vanier Thomas Zeume University of Turku LIF Marseille Universität Hannover 27 august 2009 J. Kari, P. Vanier, T. Zeume (UTU) Bounds on non-surjective
LisätiedotLocation Systems. Petteri Nurmi
Location Systems Petteri Nurmi 19.11.2016 1 Questions Which dimensions can be used to characterize location systems? Which criteria can be used to evaluate location systems? What is proximity sensing and
LisätiedotTM ETRS-TM35FIN-ETRS89 WTG
SHADOW - Main Result Assumptions for shadow calculations Maximum distance for influence Calculate only when more than 20 % of sun is covered by the blade Please look in WTG table WindPRO version 2.8.579
Lisätiedot( N117 x HH141 ( Honkajoki N117 x 9 x HH120 tv-alueet ( ( ( ( ( ( ( ( ( ( m. Honkajoki & Kankaanpää tuulivoimahankkeet
Honkajoki & Kankaanpää tuulivoimahankkeet N117 x HH141 Honkajoki N117 x 9 x HH120 tv-alueet Alahonkajoki_kaava_alueen_raja_polyline Asuinrakennus Julkinen tai liiker rak. Lomarakennus Teollinen rak. Allas
LisätiedotVaisala s New Global L ightning Lightning Dataset GLD360
Vaisala s New Global Lightning Dataset GLD360 Vaisala Global Lightning Dataset GLD360 Page 2 / Oct09 / Holle-SW Hydro / Vaisala Schedule GLD360 Validation Applications Demonstration Page 3 / Oct09 / Holle-SW
Lisätiedot7. Product-line architectures
7. Product-line architectures 7.1 Introduction 7.2 Product-line basics 7.3 Layered style for product-lines 7.4 Variability management 7.5 Benefits and problems with product-lines 1 Short history of software
LisätiedotNational Building Code of Finland, Part D1, Building Water Supply and Sewerage Systems, Regulations and guidelines 2007
National Building Code of Finland, Part D1, Building Water Supply and Sewerage Systems, Regulations and guidelines 2007 Chapter 2.4 Jukka Räisä 1 WATER PIPES PLACEMENT 2.4.1 Regulation Water pipe and its
LisätiedotUse of spatial data in the new production environment and in a data warehouse
Use of spatial data in the new production environment and in a data warehouse Nordic Forum for Geostatistics 2007 Session 3, GI infrastructure and use of spatial database Statistics Finland, Population
LisätiedotDigitally signed by Hans Vadbäck DN: cn=hans Vadbäck, o, ou=fcg Suunnittelu ja Tekniikka Oy, email=hans.vadback@fcg.fi, c=fi Date: 2016.12.20 15:45:35 +02'00' Jakob Kjellman Digitally signed by Jakob Kjellman
LisätiedotS Sähkön jakelu ja markkinat S Electricity Distribution and Markets
S-18.3153 Sähkön jakelu ja markkinat S-18.3154 Electricity Distribution and Markets Voltage Sag 1) Kolmivaiheinen vastukseton oikosulku tapahtuu 20 kv lähdöllä etäisyydellä 1 km, 3 km, 5 km, 8 km, 10 km
LisätiedotCharacterization of clay using x-ray and neutron scattering at the University of Helsinki and ILL
Characterization of clay using x-ray and neutron scattering at the University of Helsinki and ILL Ville Liljeström, Micha Matusewicz, Kari Pirkkalainen, Jussi-Petteri Suuronen and Ritva Serimaa 13.3.2012
LisätiedotTIEKE Verkottaja Service Tools for electronic data interchange utilizers. Heikki Laaksamo
TIEKE Verkottaja Service Tools for electronic data interchange utilizers Heikki Laaksamo TIEKE Finnish Information Society Development Centre (TIEKE Tietoyhteiskunnan kehittämiskeskus ry) TIEKE is a neutral,
LisätiedotTietorakenteet ja algoritmit
Tietorakenteet ja algoritmit Taulukon edut Taulukon haitat Taulukon haittojen välttäminen Dynaamisesti linkattu lista Linkatun listan solmun määrittelytavat Lineaarisen listan toteutus dynaamisesti linkattuna
LisätiedotOn instrument costs in decentralized macroeconomic decision making (Helsingin Kauppakorkeakoulun julkaisuja ; D-31)
On instrument costs in decentralized macroeconomic decision making (Helsingin Kauppakorkeakoulun julkaisuja ; D-31) Juha Kahkonen Click here if your download doesn"t start automatically On instrument costs
LisätiedotKvanttilaskenta - 1. tehtävät
Kvanttilaskenta -. tehtävät Johannes Verwijnen January 9, 0 edx-tehtävät Vastauksissa on käytetty edx-kurssin materiaalia.. Problem False, sillä 0 0. Problem False, sillä 0 0 0 0. Problem A quantum state
LisätiedotTrajectory Clustering. Teemu Pulkkinen
Trajectory Clustering Teemu Pulkkinen 12.4.2014 1 Questions What can we gain from clustering trajectories? How can we determine if two trajectories are similar? What are the benefits and problems of the
LisätiedotLX 70. Ominaisuuksien mittaustulokset 1-kerroksinen 2-kerroksinen. Fyysiset ominaisuudet, nimellisarvot. Kalvon ominaisuudet
LX 70 % Läpäisy 36 32 % Absorptio 30 40 % Heijastus 34 28 % Läpäisy 72 65 % Heijastus ulkopuoli 9 16 % Heijastus sisäpuoli 9 13 Emissiivisyys.77.77 Auringonsuojakerroin.54.58 Auringonsäteilyn lämmönsiirtokerroin.47.50
LisätiedotChoose Finland-Helsinki Valitse Finland-Helsinki
Write down the Temporary Application ID. If you do not manage to complete the form you can continue where you stopped with this ID no. Muista Temporary Application ID. Jos et onnistu täyttää lomake loppuun
LisätiedotOn instrument costs in decentralized macroeconomic decision making (Helsingin Kauppakorkeakoulun julkaisuja ; D-31)
On instrument costs in decentralized macroeconomic decision making (Helsingin Kauppakorkeakoulun julkaisuja ; D-31) Juha Kahkonen Click here if your download doesn"t start automatically On instrument costs
LisätiedotStatistical design. Tuomas Selander
Statistical design Tuomas Selander 28.8.2014 Introduction Biostatistician Work area KYS-erva KYS, Jyväskylä, Joensuu, Mikkeli, Savonlinna Work tasks Statistical methods, selection and quiding Data analysis
LisätiedotMat Seminar on Optimization. Data Envelopment Analysis. Economies of Scope S ysteemianalyysin. Laboratorio. Teknillinen korkeakoulu
Mat-2.4142 Seminar on Optimization Data Envelopment Analysis Economies of Scope 21.11.2007 Economies of Scope Introduced 1982 by Panzar and Willing Support decisions like: Should a firm... Produce a variety
LisätiedotHankkeen toiminnot työsuunnitelman laatiminen
Hankkeen toiminnot työsuunnitelman laatiminen Hanketyöpaja LLP-ohjelman keskitettyjä hankkeita (Leonardo & Poikittaisohjelma) valmisteleville11.11.2011 Työsuunnitelma Vastaa kysymykseen mitä projektissa
LisätiedotTrajectory Similarity and Clustering. Teemu Pulkkinen, Petteri Nurmi
Trajectory Similarity and Clustering Teemu Pulkkinen, Petteri Nurmi 30.11.2016 1 Questions What can we gain from clustering trajectories? How can we determine if two trajectories are similar? What are
LisätiedotResearch plan for masters thesis in forest sciences. The PELLETime 2009 Symposium Mervi Juntunen
Modelling tree and stand characteristics and estimating biomass removals and harvesting costs of lodgepole pine (Pinus contorta) plantations in Iceland Research plan for masters thesis in forest sciences
Lisätiedottoukokuu 2011: Lukion kokeiden kehittämistyöryhmien suunnittelukokous
Tuula Sutela toukokuu 2011: Lukion kokeiden kehittämistyöryhmien suunnittelukokous äidinkieli ja kirjallisuus, modersmål och litteratur, kemia, maantiede, matematiikka, englanti käsikirjoitukset vuoden
LisätiedotSIMULINK S-funktiot. SIMULINK S-funktiot
S-funktio on ohjelmointikielellä (Matlab, C, Fortran) laadittu oma algoritmi tai dynaamisen järjestelmän kuvaus, jota voidaan käyttää Simulink-malleissa kuin mitä tahansa valmista lohkoa. S-funktion rakenne
LisätiedotTelecommunication Software
Telecommunication Software Final exam 21.11.2006 COMPUTER ENGINEERING LABORATORY 521265A Vastaukset englanniksi tai suomeksi. / Answers in English or in Finnish. 1. (a) Määrittele sovellusviesti, PersonnelRecord,
Lisätiedot19. Statistical Approaches to. Data Variations Tuomas Koivunen S ysteemianalyysin. Laboratorio. Optimointiopin seminaari - Syksy 2007
19. Statistical Approaches to Data Variations Tuomas Koivunen 24.10.2007 Contents 1. Production Function 2. Stochastic Frontier Regressions 3. Example: Study of Texas Schools 4. Example Continued: Simulation
LisätiedotNetwork to Get Work. Tehtäviä opiskelijoille Assignments for students. www.laurea.fi
Network to Get Work Tehtäviä opiskelijoille Assignments for students www.laurea.fi Ohje henkilöstölle Instructions for Staff Seuraavassa on esitetty joukko tehtäviä, joista voit valita opiskelijaryhmällesi
LisätiedotPaikkatiedon semanttinen mallinnus, integrointi ja julkaiseminen Case Suomalainen ajallinen paikkaontologia SAPO
Paikkatiedon semanttinen mallinnus, integrointi ja julkaiseminen Case Suomalainen ajallinen paikkaontologia SAPO Tomi Kauppinen, Eero Hyvönen, Jari Väätäinen Semantic Computing Research Group (SeCo) http://www.seco.tkk.fi/
LisätiedotUse of Stochastic Compromise Programming to develop forest management alternatives for ecosystem services
Use of Stochastic Compromise Programming to develop forest management alternatives for ecosystem services Kyle Eyvindson 24.3.2014 Forest Science Department / Kyle Eyvindson 3/26/2014 1 Overview Introduction
Lisätiedot2017/S Contract notice. Supplies
Supplies 153936 2017 25/04/2017 S80 - - Supplies - Contract notice - Open procedure I. II. III. IV. VI. -: Medical equipments, pharmaceuticals and personal care products 2017/S 080-153936 Contract notice
LisätiedotOn instrument costs in decentralized macroeconomic decision making (Helsingin Kauppakorkeakoulun julkaisuja ; D-31)
On instrument costs in decentralized macroeconomic decision making (Helsingin Kauppakorkeakoulun julkaisuja ; D-31) Juha Kahkonen Click here if your download doesn"t start automatically On instrument costs
LisätiedotSalasanan vaihto uuteen / How to change password
Salasanan vaihto uuteen / How to change password Sisällys Salasanakäytäntö / Password policy... 2 Salasanan vaihto verkkosivulla / Change password on website... 3 Salasanan vaihto matkapuhelimella / Change
LisätiedotExercise 1. (session: )
EEN-E3001, FUNDAMENTALS IN INDUSTRIAL ENERGY ENGINEERING Exercise 1 (session: 24.1.2017) Problem 3 will be graded. The deadline for the return is on 31.1. at 12:00 am (before the exercise session). You
LisätiedotKONEISTUSKOKOONPANON TEKEMINEN NX10-YMPÄRISTÖSSÄ
KONEISTUSKOKOONPANON TEKEMINEN NX10-YMPÄRISTÖSSÄ https://community.plm.automation.siemens.com/t5/tech-tips- Knowledge-Base-NX/How-to-simulate-any-G-code-file-in-NX- CAM/ta-p/3340 Koneistusympäristön määrittely
LisätiedotMIKES, Julkaisu J3/2000 MASS COMPARISON M3. Comparison of 1 kg and 10 kg weights between MIKES and three FINAS accredited calibration laboratories
MITTATEKNIIKAN KESKUS CENTRE FOR METROLOGY AND ACCREDITATION Julkaisu J3/2000 MASS COMPARISON M3 Comparison of 1 kg and 10 kg weights between MIKES and three FINAS accredited calibration laboratories Kari
LisätiedotMALE ADULT FIBROBLAST LINE (82-6hTERT)
Double-stranded methylation patterns of a 104-bp L1 promoter in DNAs from male and female fibroblasts, male leukocytes and female lymphoblastoid cells using hairpin-bisulfite PCR. Fifteen L1 sequences
LisätiedotToppila/Kivistö 10.01.2013 Vastaa kaikkin neljään tehtävään, jotka kukin arvostellaan asteikolla 0-6 pistettä.
..23 Vastaa kaikkin neljään tehtävään, jotka kukin arvostellaan asteikolla -6 pistettä. Tehtävä Ovatko seuraavat väittämät oikein vai väärin? Perustele vastauksesi. (a) Lineaarisen kokonaislukutehtävän
LisätiedotOperatioanalyysi 2011, Harjoitus 4, viikko 40
Operatioanalyysi 2011, Harjoitus 4, viikko 40 H4t1, Exercise 4.2. H4t2, Exercise 4.3. H4t3, Exercise 4.4. H4t4, Exercise 4.5. H4t5, Exercise 4.6. (Exercise 4.2.) 1 4.2. Solve the LP max z = x 1 + 2x 2
LisätiedotHow to handle uncertainty in future projections?
How to handle uncertainty in future projections? Samu Mäntyniemi, Fisheries and Environmental Management group (FEM), University of Helsinki http://www.helsinki.fi/science/fem/ Biotieteellinen tiedekunta
LisätiedotCategorical Decision Making Units and Comparison of Efficiency between Different Systems
Categorical Decision Making Units and Comparison of Efficiency between Different Systems Mat-2.4142 Optimointiopin Seminaari Source William W. Cooper, Lawrence M. Seiford, Kaoru Tone: Data Envelopment
LisätiedotWAMS 2010,Ylivieska Monitoring service of energy efficiency in housing. 13.10.2010 Jan Nyman, jan.nyman@posintra.fi
WAMS 2010,Ylivieska Monitoring service of energy efficiency in housing 13.10.2010 Jan Nyman, jan.nyman@posintra.fi Background info STOK: development center for technology related to building automation
LisätiedotOlet vastuussa osaamisestasi
Olet vastuussa osaamisestasi Ohjelmistoammattilaisuuden uudet haasteet Timo Vehmaro 02-12-2015 1 Nokia 2015 Mitä osaamista tulevaisuudessa tarvitaan? Vahva perusosaaminen on kaiken perusta Implementaatio
Lisätiedot21~--~--~r--1~~--~--~~r--1~
- K.Loberg FYSE420 DIGITAL ELECTRONICS 13.05.2011 1. Toteuta alla esitetyn sekvenssin tuottava asynkroninen pun. Anna heratefunktiot, siirtotaulukko ja kokonaistilataulukko ( exitation functions, transition
LisätiedotReturns to Scale Chapters
Return to Scale Chapter 5.1-5.4 Saara Tuurala 26.9.2007 Index Introduction Baic Formulation of Retur to Scale Geometric Portrayal in DEA BCC Return to Scale CCR Return to Scale Summary Home Aignment Introduction
LisätiedotRINNAKKAINEN OHJELMOINTI A,
RINNAKKAINEN OHJELMOINTI 815301A, 18.6.2005 1. Vastaa lyhyesti (2p kustakin): a) Mitkä ovat rinnakkaisen ohjelman oikeellisuuskriteerit? b) Mitä tarkoittaa laiska säikeen luominen? c) Mitä ovat kohtaaminen
LisätiedotLocation-Awareness. Petteri Nurmi
Location-Awareness Petteri Nurmi 13.3.2014 1 About the course Advanced course, algorithms and machine learning subprogramme (also well suited for networking and services) 4 credit units for passing the
Lisätiedot