Social networks for volunteered geographic information - A case study of OpenStreetMap

The world of mapping has changed. Earlier, only professional experts were responsible for map production, but today ordinary people without any training or experience can become map-makers. The number of online mapping sites, and the number of volunteer mappers has increased significantly. The development of the technology, such as satellite navigation systems, Web 2.0, broadband Internet connections, and smartphones, have had one of the key roles in enabling the rise of volunteered geographic information (VGI). As opening governmental data to public is a current topic in many countries, the opening of high quality geographical data has a central role in this study. The aim of this study is to investigate how is the quality of spatial data produced by volunteers by comparing it with the map data produced by public authorities, to follow what occurs when spatial data are opened for users, and to get acquainted with the user profile of these volunteer mappers. A central part of this study is OpenStreetMap project (OSM), which aim is to create a map of the entire world by volunteers. Anyone can become an OpenStreetMap contributor, and the data created by the volunteers are free to use for anyone without restricting copyrights or license charges. In this study OpenStreetMap is investigated from two viewpoints. In the first part of the study, the aim was to investigate the quality of volunteered geographic information. A pilot project was implemented by following what occurs when a high-resolution aerial imagery is released freely to the OpenStreetMap contributors. The quality of VGI was investigated by comparing the OSM datasets with the map data of The National Land Survey of Finland (NLS). The quality of OpenStreetMap data was investigated by inspecting the positional accuracy and the completeness of the road datasets, as well as the differences in the attribute datasets between the studied datasets. Also the OSM community was under analysis and the development of the map data of OpenStreetMap was investigated by visual analysis. The aim of the second part of the study was to analyse the user profile of OpenStreetMap contributors, and to investigate how the contributors act when collecting data and editing OpenStreetMap. The aim was also to investigate what motivates users to map and how is the quality of volunteered geographic information envisaged. The second part of the study was implemented by conducting a web inquiry to the OpenStreetMap contributors. The results of the study show that the quality of OpenStreetMap data compared with the data of National Land Survey of Finland can be defined as good. OpenStreetMap differs from the map of National Land Survey especially because of the amount of uncertainty, for example because of the completeness and uniformity of the map are not known. The results of the study reveal that opening spatial data increased notably the amount of the data in the study area, and both the positional accuracy and completeness improved significantly. The study confirms the earlier arguments that only few contributors have created the majority of the data in OpenStreetMap. The inquiry made for the OpenStreetMap users revealed that the data are most often collected by foot or by bicycle using GPS device, or by editing the map with the help of aerial imageries. According to the responses, the users take part to the OpenStreetMap project because they want to make maps better, and want to produce maps, which have information that is up-to-date and cannot be found from any other maps. Almost all of the users exploit the maps by themselves, most popular methods being downloading the map into a navigator or into a mobile device. The users regard the quality of OpenStreetMap as good, especially because of the up-to-dateness and the accuracy of the map.

Covalent attachment of two important dicopper(II) systems in a one-dimensional polymeric chain: An x-ray structure of [Cu2(en)2(OH)2·Cu2(O2CMe)4](PF6)2·0.5EtOH]α showing the shortest Cucdots, three dots, centeredCu Distance in the tetraacetato core

Reaction of Cu2(O2CMe)4(H2O)2 with 1,2-diaminoethane(en) in ethanol, followed by the addition of NH4PF6, led to the formation of a covalently linked 1D polymeric copper(II) title complex showing alternating [Cu2(en)2(OH)22+] and [Cu2(O2CMe)4] units in the chain and the shortest Cucdots, three dots, centeredCu separation of 2.558(2) Å in the tetraacetato core.

NUcache: A Multicore Cache Organization Based on Next-Use Distance

In this work, we propose a new organization for the last level shared cache of a rnulticore system. Our design is based on the observation that the Next-Use distance, measured in terms of intervening misses between the eviction of a line and its next use, for lines brought in by a given delinquent PC falls within a predictable range of values. We exploit this correlation to improve the performance of shared caches in multi-core architectures by proposing the NUcache organization.

On Computation of Minimum Distance of Linear Block Codes Above 1/2 Rate Coding

The minimum distance of linear block codes is one of the important parameter that indicates the error performance of the code. When the code rate is less than 1/2, efficient algorithms are available for finding minimum distance using the concept of information sets. When the code rate is greater than 1/2, only one information set is available and efficiency suffers. In this paper, we investigate and propose a novel algorithm to find the minimum distance of linear block codes with the code rate greater than 1/2. We propose to reverse the roles of information set and parity set to get virtually another information set to improve the efficiency. This method is 67.7 times faster than the minimum distance algorithm implemented in MAGMA Computational Algebra System for a (80, 45) linear block code.

Distance measures on intersecting objects and their applications

Let A and B be two objects. We define measures to characterize the penetration of A and B when A boolean AND B not equal 0. We then present properties of the measures and efficient algorithms to compute them for planar and polyhedral objects. We explore applications of the measures and present some experimental results.

Potential-distance relationships of clay-water systems considering the Stern theory

This paper deals with the use of Stem theory as applied to a clay-water electrolyte system, which is more realistic to understand the force system at micro level man the Gouy-Chapman theory. The influence of the Stern layer on potential-distance relationship has been presented quantitatively for certain specified clay-water systems and the results are compared with the Gouy-Chapman model. A detailed parametric study concerning the number of adsorption spots on the clay platelet, the thickness of the Stern layer, specific adsorption potential and the value of dielectric constant of the pore fluid in the Stern layer, was carried out. This study investigates that the potential obtained at any distance using the Stern theory is higher than that obtained by the Gouy-Chapman theory. The hydrated size of the ion is found to have a significant influence on the potential-distance relationship for a given clay, pore fluid characteristics and valence of the exchangeable ion.

Photophysical and electrochemical redox properties of fixed distance porphyrin-quinone systems

A few fixed distance covalently linked porphyrin-quinone molecules have been synthesized in which a benzoquinone is directly attached to a meso/beta-pyrrole position of tri(phenyl/pentafluorophenyl)/tetraphenylporphyrins. The choice of fluoroarylporphyrins permit modulation of Delta G(ET) values for photoinduced electron-transfer reactions in these systems. All short distance porphyrin-quinone molecules showed efficient quenching of the porphyrin singlet excited state. The electrochemical redox data coupled with the steady-state and time-resolved singlet emission data are analysed to evaluate the dependence of Delta G(ET) values on the rate of electron transfer (k(ET)) in these systems. The meso-trifluoroarylporphyrin-quinones are found to be sensitive probes of the surrounding dielectric environment. Varying solvent polarity on the mechanism of fluorescence quenching and k(ET) values revealed that short donor-acceptor distance and the solvent dielectric relaxation properties play a dominant role. (C) 1999 Elsevier Science S.A. All rights reserved.

Performance issues of distance relays for shunt FACTS compensated transmission lines

In this paper, the performance of distance relays when applied to transmission system equipped with shunt FACTS device, Static Synchronous Compensator (STATCOM) is described. The aim of the proposed study is to evaluate the performance of distance relays when STATCOM is incorporated at the mid point of transmission lines for voltage control. A detailed model of STATCOM and its control strategy is presented. The presence of these devices significantly affects apparent impedance seen by the distance relays due to their rapid response to different power system configurations. The distance relay is evaluated for different loading conditions and for different fault locations. The faults are created during various pre-fault loading conditions. The studies are performed on 400KV and 132KV systems and the results are presented. Simulation studies are carried out using transient simulation software, PSCAD/EMTDC.

An Approach for Distance Relay Co-ordination using Support Vector Machines

In this paper, an approach to enhance the Extra High Voltage (EHV) Transmission system distance protection is presented. The scheme depends on the apparent impedance seen by the distance relay during the disturbance. In a distance relay,the impedance seen at the relay location is calculated from the fundamental frequency component of the voltage and current signals. Support Vector Machines (SVMs) are a new learning-byexample are employed in discriminating zone settings (Zone-1,Zone-2 and Zone-3) using the signals to be used by the relay.Studies on 265-bus system, an equivalent of practical Indian Western grid are presented for illustrating the proposed scheme.

Performance Evaluation of Distance-Hop Proportionality on Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes on a region in Euclidean space, e.g., the unit square. After deployment, the nodes self-organise into a mesh topology. In a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this paper, we analyse the performance of this approximation. We show that nodes with a certain hop distance from a fixed anchor node lie within a certain annulus with probability approach- ing unity as the number of nodes n → ∞. We take a uniform, i.i.d. deployment of n nodes on a unit square, and consider the geometric graph on these nodes with radius r(n) = c q ln n n . We show that, for a given hop distance h of a node from a fixed anchor on the unit square,the Euclidean distance lies within [(1−ǫ)(h−1)r(n), hr(n)],for ǫ > 0, with probability approaching unity as n → ∞.This result shows that it is more likely to expect a node, with hop distance h from the anchor, to lie within this an- nulus centred at the anchor location, and of width roughly r(n), rather than close to a circle whose radius is exactly proportional to h. We show that if the radius r of the ge- ometric graph is fixed, the convergence of the probability is exponentially fast. Similar results hold for a randomised lattice deployment. We provide simulation results that il- lustrate the theory, and serve to show how large n needs to be for the asymptotics to be useful.