Spatial Analysis Clustering Petteri Nurmi
|
|
- Ari-Matti Salo
- 7 vuotta sitten
- Katselukertoja:
Transkriptio
1 Spatial Analysis Clustering Petteri Nurmi
2 Questions What kind of preprocessing steps are useful for GPS measurements? What different classes of spatial clustering exist? What is the difference between partitioning algorithms and density-based clustering? What is a place? How places can be detected?
3 Spatial Analysis Process of inspecting geographical data with the aim of extracting useful information Spatial data analysis process Preprocessing Cleaning the data, perform transformations (if needed) Analysis Exploratory: data is searched for models that describe it well without clear hypothesis Confirmatory: hypotheses about data are tested empirically Post-processing
4 Measurement Noise Location measurements are inherently noisy Reference point geometry Atmospheric effects Multipath effects Measurement errors (clock or reference point errors) See Lecture IV Preprocessing attempts to reduce noise before data is being analyzed further Data cleaning: ensure quality of measurements Check the validity of the data
5 Preprocessing - GPS GPS requires at least 4 satellites for estimating position (4 unknowns: 3D position + time offset) GPS uncertainty affected by range error and satellite geometry Dilution of Precision gives an estimate of the influence of satellite geometry Horizontal Dilution of Precision (HDOP) most important for applications Cold/warm start can cause outliers in measurements
6 Preprocessing GPS Example RAW GPS measurements
7 Preprocessing GPS Example Points with satellites < 4 removed
8 Preprocessing GPS Example Points with satellites < 4 and HDOP > 6.0 removed
9 Preprocessing Removing Extreme Values
10 Spatial Clustering Clustering refers to the process of grouping similar objects into classes Points within same cluster more similar to each other than to those in other clusters Spatial clustering refers to clustering that is applied on data with a geographical component Identifying similar geographical areas, e.g., in terms of crime rate or another statistic Merging of regions with similar weather patterns
11 Spatial Clustering Four main categories of algorithms Partitioning methods (e.g., K-means, K-medoids) Hierarchical methods (e.g., BIRCH) Density-based methods (e.g., DBScan) Grid-based methods (e.g., CLIQUE) Optimal technique depends on various factors Application goal Trade-off between clustering quality and speed Characteristics and dimensionality of data Amount of noise in data
12 Spatial Clustering - Partitioning Algorithms Partition data into k clusters so that total deviation of points from their cluster center is minimized Parameter k determines the number of clusters, given usually beforehand Various ways to measure total deviation: Squared distance (K-Means) Posterior of data (Gaussian Mixture Models)
13 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
14 K-Means Algorithm guaranteed to find a local optimum of the objective function (squared loss) Sensitive to the initial choice of cluster centers Clustering typically repeated multiple times with different initial values and solution with smallest total deviation used Initial values can be determined, e.g., using Random sampling Select fraction of data, perform clustering on that, use resulting clusters as initial values Data spectroscopy: analyze spectral characteristics of data values to determine a good initial guess
15 K-Means - Example
16 K-Means Example
17 Partitioning Algorithms Probabilistic Clustering Generative: data assumed to be generated according to some model Parameters of the model unknown and need to be estimated from data Returns a probability distribution over the parameter values Two possible assignments of points to cluster Hard: each point belongs exactly to one cluster Soft: allow multiple (or all) clusters to contribute to the generation of the point
18 Partitioning Algorithms Mixture Models Mixture Models provide a flexible and generic approach to probabilistic clustering 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 Probability of a point is a (convex) combination of the mixture component densities defines the weight or contribution of a component
19 Partitioning Algorithms Gaussian Mixture Models Mixture model where mixture components are assumed to have a Gaussian distribution Mean i determines the center of the cluster Covariance matrix i determines shape of the cluster Assuming Euclidean distances: Shape is circle if variance of all dimensions is equal Shape is an ellipse aligned with coordinate axes when covariance matrix is diagonal Shape is a tilted ellipse when full covariance matrix used K-means can be understood as a Gaussian mixture model where variance is equal
20 Partitioning Algorithms Gaussian Mixture Models Cluster parameters can be determines using the expectation maximization (EM) algorithm Iterative algorithm for finding optimal parameter values in models with latent (i.e., unobservable) variables Consists of two steps (E and M) which are iterated until solution converges Algorithm outline: Initialization: draw initial parameter values E-step: compute expectation of log-likelihood using current estimates M-step: compute parameters that maximize the expected log-likelihood computed in the E-step
21 Partitioning Algorithms Infinite Mixture Models A generalization of mixture models where number of mixture models is assumed infinite (but countable) Example: Chinese restaurant process Customers arrive to a restaurant with an infinite number of circular tables, each having infinite capacity As new customer arrives (s)he selects the table to sit Either one of the partially occupied tables Or completely new table
22 Partitioning Algorithms K-Medoids Partitioning algorithm that represents a cluster using the most centrally located measurement Instead of updating all centers during an iteration, typically updates only a single medoid How to determine the new medoid? How to evaluate effectiveness of clustering? Covered in more detail during Lecture VIII
23 Density-Based Algorithms Class of algorithms that represent clusters as dense regions of objects In contrast to partitioning algorithms, can derive clusters of arbitrary shape Areas with low-density of objects are considered noise Basic concepts Epsilon neighborhood: collection of points that are within distance Eps from a point Dense neighborhood: Epsilon neighborhood that contains at least MinPts points
24 Density-Based Algorithms Radius-Based Clustering Predecessor to density-based clustering Cluster all points with distance Eps of each other to the same cluster MinPts or some other criterion can be used to prune the resulting clusters
25 Radius-Based Clustering Example
26 Density-Based Algorithms DBScan A point that has at least MinPts within its Epsilon neighborhood is called a core object Object can only belong to a cluster if it is within the Epsilon neighborhood of at least one core object Core object o within Epsilon neighborhood of another core object p must belong to the same cluster as p Non-core object belonging to the Epsilon neighborhood of some core objects must belong to the same cluster as one of these core objects Non-core objects which do not belong to the Epsilon neighborhood of any core objects are noise
27 Density-Based Algorithms DBScan Non-core object Core object Outlier / noise Core object Clusters A,B and C can be merged since they share a core object
28 Density-Based Algorithms 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 Cluster expanded with (previously unallocated) points that are within the Epsilon neighborhood of a seed point
29 DBScan example Noise Clusters
30 Density-Based Algorithms DJCluster Variant of DBScan where cluster expansion performed iteratively instead of recursively Better suited for large datasets Basic idea: Find Epsilon neighborhood of a point Assign all points within the neighborhood into cluster Check if cluster shares a core point with any of the previous clusters If so, clusters can be merged
31 Notion of Place Location systems tend to provide information in coordinate form (absolute or relative) People refer to locations using semantic (or symbolic) descriptions Descriptions for the same place can vary between different people Place Representation of location that is consistent with the way people communicate location information
32 Notion of Place Monastery Petra, Jordan Church Royal Tombs Hotel Treasury Ticket Office
33 Notion of Place Definitions for place originate from the field of humanistic geography Roots in phenomenology and philosophy Especially philosophy of Martin Heidegger Places entities that relate physical locations with human experiences and meanings Relph: places physical locations that are linked with meanings and activities Tuan: places are spaces (i.e., physical locations) that are embodied with meanings
34 Notion of Place The meanings attributed to places vary: Activities: swimming hall, movie theater, gym Social: friend s home, regular place to meet friends Generic: library, grocery store, train station Multiple meanings can be attributed to a place Relate to different activities (and times) at the place Places can be perceived as public or private Note: space can be public even if place is private! Depends on the activity, time of day etc. Influences preferences regarding location disclosure
35 Why place matters? Personalized information delivery E.g., associate notes/to-do lists with places Select advertisements or other information to provide E.g., provide train or bus schedules Depends on stability of information and familiarity of place Awareness cue Places often a cue of activity and availability Automated status messages, e.g., in phone contact list Support user studies Differentiating meaningful situations in analysis phase
36 Detecting places Locations correlate strongly with activities What are you doing? often answered with location during mobile phone calls People assign activity-related labels to places Places correlate with time Humans spend the majority of time in a few places Probability of labeling a place increases with time But traffic stops (traffic jams, traffic lights) seldom labeled Places can be detected from location traces Activity information can help (if available)
37 Place Identification Place Identification = the process of detecting places from data A data analysis step with four steps Preparation: clean data, transform data Preprocessing: making data ready for analysis Analysis: performing the actual analysis Post-processing: refining the results Additionally a labeling step Assign semantics with the detected places Can take place before or after analysis
38 Labeling Common choice is to prompt the user to label a place after it has been detected Alternative to label first and learn the places automatically based on the labels Some labels can be assigned automatically Geographic databases can be used to mine information about the type of building Time information can be used to identify home and workplace Different modalities: text, photo, photo + text
39 Detecting Places Overview Most place detection algorithms operate on coordinate data Pruning: remove measurements that are unlikely to be meaningful Clustering: apply spatial clustering on the data Post-processing: determine which clusters are likely to correspond to meaningful places Spatial criteria: matching against Geo-databases, considering size of clusters etc. Temporal criteria: requiring a minimum stay duration
40 Detecting Places Velocity Pruning Measurements where the user is moving are unlikely to correspond to significant places Velocity can be used to prune measurements and clustering applied on remaining data
41 Place Detection Further Topics Coordinate algorithms unable to separate between different places within the same indoor space Radio fingerprinting based place detection uses stability of signal environment to detect places Current state-of-the-art in mobile phone based place detection Performance decreases in areas with limited signal environment Hybrid algorithms Combine coordinate-based techniques with radio fingerprinting based place detection
42 Summary Spatial analysis refers to the process of inspecting geographical data Preprocessing: cleaning and preparing data for analysis Analysis: exploratory or confirmatory Post-processing: validating, pruning results Spatial clustering Grouping of similar (spatial) objects together Partitioning algorithms: divide data optimally to clusters Density-based algorithms: identify dense spatial regions
43 Summary Place Representation of location that is consistent with the way people communicate location information Semantic / symbolic Place detection Process of identifying places from location measurements On coordinate data, can be solved using spatial clustering and temporal + spatial pruning
44 Literature Ester, M.; Kriegel, H.-P.; Sander, J. & Xu, X., A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD), AAAI, 1996, Sander, J.; Ester, M.; Kriegel, H.-P. & Xu, X., Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications, Data Mining and Knowledge Discovery, 1998, 2, Zhou, C.; Frankowski, D.; Ludford, P.; Shekhar, S. & Terveen, L., Discovering Personally Meaningful Places: An Interactive Clustering Approach, ACM Transactions on Information Systems, 2007, 25, 12 Ashbrook, D. & Starner, T., Learning significant locations and predicting user movement with GPS, Proceedings of the 6th International Symposium on Wearable Computers (ISWC), IEEE, 2002, Kang, J.; Welbourne, W.; Stewart, B. & Borriello, G., Extracting places from traces of locations, Proceedings of the 2nd ACM international workshop on Wireless mobile applications and services on WLAN hotspots (WMASH), ACM Press, 2004,
45 Literature Liao, L.; Fox, D. & Kautz, H., Extracting Places and Activities from GPS Traces Using Hierarchical Conditional Random Fields, International Journal of Robotics Research, 2007, 26, Marmasse, N. & Schmandt, C., A user-centered location model, Personal and Ubiquitous Computing, 2002, 6, Nurmi, P. & Bhattacharya, S., Identifying Meaningful Places: The Nonparametric Way, Proceedings of the 6th International Conference on Pervasive Computing (Pervasive), Springer, 2008, 5013, Tuan, Y.-F., Space and Place: The Perspective of Experience, University of Minnesota Press, 2001 Relph, E., Place and Placelessness, Pion Books, 1976 Han, J.; Kambar, M. & Tung, A. K. H., Spatial Clustering Methods in Data Mining: A Survey, Geographic Data Mining and Knowledge Discovery, Taylor & Francis,
Spatial 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
Spatial 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
Capacity 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
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
The 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
On 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
Returns 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
On 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
Network 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
Information 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
Gap-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
Bounds 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
Other 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
Alternative 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
C++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,
On 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
Review Petteri Nurmi
Review Petteri Nurmi 21.2.2012 1 Overview of the Course I: Measuring and estimating location information II: Analysing and understanding location data Representing location, location systems, positioning
Results 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
Characterization 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
7.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
The role of 3dr sector in rural -community based- tourism - potentials, challenges
The role of 3dr sector in rural -community based- tourism - potentials, challenges Lappeenranta, 5th September 2014 Contents of the presentation 1. SEPRA what is it and why does it exist? 2. Experiences
16. 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
Use 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
TM 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
E80. 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
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.
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
Capacity utilization
Mat-2.4142 Seminar on optimization Capacity utilization 12.12.2007 Contents Summary of chapter 14 Related DEA-solver models Illustrative examples Measure of technical capacity utilization Price-based measure
Constructive Alignment in Specialisation Studies in Industrial Pharmacy in Finland
Constructive Alignment in Specialisation Studies in Industrial Pharmacy in Finland Anne Mari Juppo, Nina Katajavuori University of Helsinki Faculty of Pharmacy 23.7.2012 1 Background Pedagogic research
Metsä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
T 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
Uusi Ajatus Löytyy Luonnosta 4 (käsikirja) (Finnish Edition)
Uusi Ajatus Löytyy Luonnosta 4 (käsikirja) (Finnish Edition) Esko Jalkanen Click here if your download doesn"t start automatically Uusi Ajatus Löytyy Luonnosta 4 (käsikirja) (Finnish Edition) Esko Jalkanen
Statistical 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
Choose 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
Land-Use Model for the Helsinki Metropolitan Area
Land-Use Model for the Helsinki Metropolitan Area Paavo Moilanen Introduction & Background Metropolitan Area Council asked 2005: What is good land use for the transport systems plan? At first a literature
Alternatives to the DFT
Alternatives to the DFT Doru Balcan Carnegie Mellon University joint work with Aliaksei Sandryhaila, Jonathan Gross, and Markus Püschel - appeared in IEEE ICASSP 08 - Introduction Discrete time signal
( ( 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
Tynnyrivaara, 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
,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
WindPRO 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
National 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
WindPRO 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
AYYE 9/ HOUSING POLICY
AYYE 9/12 2.10.2012 HOUSING POLICY Mission for AYY Housing? What do we want to achieve by renting apartments? 1) How many apartments do we need? 2) What kind of apartments do we need? 3) To whom do we
Positioning 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?
TM 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
TM 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
Tracking 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
TIEKE 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,
LYTH-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
Tracking 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?
TM 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
TM 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
TM 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
Valuation 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
( ,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
Skene. Games Refueled. Muokkaa perustyyl. napsautt. @Games for Health, Kuopio. 2013 kari.korhonen@tekes.fi. www.tekes.fi/skene
Skene Muokkaa perustyyl. Games Refueled napsautt. @Games for Health, Kuopio Muokkaa alaotsikon perustyyliä napsautt. 2013 kari.korhonen@tekes.fi www.tekes.fi/skene 10.9.201 3 Muokkaa Skene boosts perustyyl.
Categorical 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
Tietorakenteet 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
TM 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
HARJOITUS- PAKETTI A
Logistiikka A35A00310 Tuotantotalouden perusteet HARJOITUS- PAKETTI A (6 pistettä) TUTA 19 Luento 3.Ennustaminen County General 1 piste The number of heart surgeries performed at County General Hospital
TM 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
HITSAUKSEN 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ö
The 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
MEETING PEOPLE COMMUNICATIVE QUESTIONS
Tiistilän koulu English Grades 7-9 Heikki Raevaara MEETING PEOPLE COMMUNICATIVE QUESTIONS Meeting People Hello! Hi! Good morning! Good afternoon! How do you do? Nice to meet you. / Pleased to meet you.
Miksi Suomi on Suomi (Finnish Edition)
Miksi Suomi on Suomi (Finnish Edition) Tommi Uschanov Click here if your download doesn"t start automatically Miksi Suomi on Suomi (Finnish Edition) Tommi Uschanov Miksi Suomi on Suomi (Finnish Edition)
TM 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
Information on Finnish Language Courses Spring Semester 2018 Päivi Paukku & Jenni Laine Centre for Language and Communication Studies
Information on Finnish Language Courses Spring Semester 2018 Päivi Paukku & Jenni Laine 4.1.2018 Centre for Language and Communication Studies Puhutko suomea? -Hei! -Hei hei! -Moi! -Moi moi! -Terve! -Terve
Rotarypiiri 1420 Piiriapurahoista myönnettävät stipendit
Rotarypiiri 1420 Piiriapurahoista myönnettävät stipendit Ø Rotarypiiri myöntää stipendejä sille osoitettujen hakemusten perusteella ensisijaisesti rotaryaatteen mukaisiin tarkoituksiin. Ø Stipendejä myönnetään
Curriculum. Gym card
A new school year Curriculum Fast Track Final Grading Gym card TET A new school year Work Ethic Detention Own work Organisation and independence Wilma TMU Support Services Well-Being CURRICULUM FAST TRACK
Smart specialisation for regions and international collaboration Smart Pilots Seminar
Smart specialisation for regions and international collaboration Smart Pilots Seminar 23.5.2017 Krista Taipale Head of Internaltional Affairs Helsinki-Uusimaa Regional Council Internationalisation
812336A C++ -kielen perusteet, 21.8.2010
812336A C++ -kielen perusteet, 21.8.2010 1. Vastaa lyhyesti seuraaviin kysymyksiin (1p kaikista): a) Mitä tarkoittaa funktion ylikuormittaminen (overloading)? b) Mitä tarkoittaa jäsenfunktion ylimääritys
Kvanttilaskenta - 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
MIKES, 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
FinFamily PostgreSQL installation ( ) FinFamily PostgreSQL
FinFamily PostgreSQL 1 Sisällys / Contents FinFamily PostgreSQL... 1 1. Asenna PostgreSQL tietokanta / Install PostgreSQL database... 3 1.1. PostgreSQL tietokannasta / About the PostgreSQL database...
DIGITAL MARKETING LANDSCAPE. Maatalous-metsätieteellinen tiedekunta
DIGITAL MARKETING LANDSCAPE Mobile marketing, services and games MOBILE TECHNOLOGIES Handset technologies Network technologies Application technologies INTRODUCTION TO MOBILE TECHNOLOGIES COMPANY PERSPECTIVE
7. 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
Travel Getting Around
- Location Olen eksyksissä. Not knowing where you are Voisitko näyttää kartalta missä sen on? Asking for a specific location on a map Mistä täällä on? Asking for a specific...wc?...pankki / rahanvaihtopiste?...hotelli?...huoltoasema?...sairaala?...apteekki?...tavaratalo?...ruokakauppa?...bussipysäkki?
MUSEOT KULTTUURIPALVELUINA
Elina Arola MUSEOT KULTTUURIPALVELUINA Tutkimuskohteena Mikkelin museot Opinnäytetyö Kulttuuripalvelujen koulutusohjelma Marraskuu 2005 KUVAILULEHTI Opinnäytetyön päivämäärä 25.11.2005 Tekijä(t) Elina
TM 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
TM 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
BLOCKCHAINS AND ODR: SMART CONTRACTS AS AN ALTERNATIVE TO ENFORCEMENT
UNCITRAL EMERGENCE CONFERENCE 13.12.2016 Session I: Emerging Legal Issues in the Commercial Exploitation of Deep Seabed, Space and AI BLOCKCHAINS AND ODR: SMART CONTRACTS AS AN ALTERNATIVE TO ENFORCEMENT
Rakennukset 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
Kysymys 5 Compared to the workload, the number of credits awarded was (1 credits equals 27 working hours): (4)
Tilasto T1106120-s2012palaute Kyselyn T1106120+T1106120-s2012palaute yhteenveto: vastauksia (4) Kysymys 1 Degree programme: (4) TIK: TIK 1 25% ************** INF: INF 0 0% EST: EST 0 0% TLT: TLT 0 0% BIO:
Information on Finnish Language Courses Spring Semester 2017 Jenni Laine
Information on Finnish Language Courses Spring Semester 2017 Jenni Laine 4.1.2017 KIELIKESKUS LANGUAGE CENTRE Puhutko suomea? Do you speak Finnish? -Hei! -Moi! -Mitä kuuluu? -Kiitos, hyvää. -Entä sinulle?
Use 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
Informaatioteknologia vaikuttaa ihmisten käyttäytymiseen ja asenteisiin
Infotech Seminar, Oulu, November 11, 2005 Informaatioteknologia vaikuttaa ihmisten käyttäytymiseen ja asenteisiin Prof. Harri Oinas-Kukkonen Dept. Information Processing Science University of Oulu Outline
toukokuu 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
Indoor Environment 2011-2015
Indoor Environment 2011-2015 18.4.2013 Risto Kosonen Ohjelma on investointinäkökulmasta edennyt pääosin suunnitelman mukaisesti Työpaketti Kumulatiiviset kustannukset 1.5.2011 31.8.2012 Kumulatiiviset
Information on Finnish Courses Autumn Semester 2017 Jenni Laine & Päivi Paukku Centre for Language and Communication Studies
Information on Finnish Courses Autumn Semester 2017 Jenni Laine & Päivi Paukku 24.8.2017 Centre for Language and Communication Studies Puhutko suomea? -Hei! -Hei hei! -Moi! -Moi moi! -Terve! -Terve terve!
RINNAKKAINEN 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
Operatioanalyysi 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
ReFuel 70 % Emission Reduction Using Renewable High Cetane Number Paraffinic Diesel Fuel. Kalle Lehto, Aalto-yliopisto 5.5.
ReFuel 70 % Emission Reduction Using Renewable High Cetane Number Paraffinic Diesel Fuel Kalle Lehto, Aalto-yliopisto 5.5.2011 Otaniemi ReFuel a three year research project (2009-2011) goal utilize the
FIS IMATRAN KYLPYLÄHIIHDOT Team captains meeting
FIS IMATRAN KYLPYLÄHIIHDOT 8.-9.12.2018 Team captains meeting 8.12.2018 Agenda 1 Opening of the meeting 2 Presence 3 Organizer s personell 4 Jury 5 Weather forecast 6 Composition of competitors startlists
KONEISTUSKOKOONPANON 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
TM 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
Tarua vai totta: sähkön vähittäismarkkina ei toimi? 11.2.2015 Satu Viljainen Professori, sähkömarkkinat
Tarua vai totta: sähkön vähittäismarkkina ei toimi? 11.2.2015 Satu Viljainen Professori, sähkömarkkinat Esityksen sisältö: 1. EU:n energiapolitiikka on se, joka ei toimi 2. Mihin perustuu väite, etteivät
Research 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
ECVETin soveltuvuus suomalaisiin tutkinnon perusteisiin. Case:Yrittäjyyskurssi matkailualan opiskelijoille englantilaisen opettajan toteuttamana
ECVETin soveltuvuus suomalaisiin tutkinnon perusteisiin Case:Yrittäjyyskurssi matkailualan opiskelijoille englantilaisen opettajan toteuttamana Taustaa KAO mukana FINECVET-hankeessa, jossa pilotoimme ECVETiä
S 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
Uusi Ajatus Löytyy Luonnosta 3 (Finnish Edition)
Uusi Ajatus Löytyy Luonnosta 3 (Finnish Edition) Esko Jalkanen Click here if your download doesn"t start automatically Uusi Ajatus Löytyy Luonnosta 3 (Finnish Edition) Esko Jalkanen Uusi Ajatus Löytyy
Sisällysluettelo Table of contents
Sisällysluettelo Table of contents OTC:n Moodlen käyttöohje suomeksi... 1 Kirjautuminen Moodleen... 2 Ensimmäinen kirjautuminen Moodleen... 2 Salasanan vaihto... 2 Oma käyttäjäprofiili... 3 Työskentely