Google Earth Engine: Planetary-scale geospatial analysis for everyone

We present YAGO, a light-weight and extensible ontology with high coverage and quality. YAGO builds on entities and relations and currently contains more than 1 million entities and 5 million facts. This includes the Is-A hierarchy as well as non-taxonomic relations between entities (such as HASONEPRIZE). The facts have been automatically extracted from Wikipedia and unified with WordNet, using a carefully designed combination of rule-based and heuristic methods described in this paper. The resulting knowledge base is a major step beyond WordNet: in quality by adding knowledge about individuals like persons, organizations, products, etc. with their semantic relationships - and in quantity by increasing the number of facts by more than an order of magnitude. Our empirical evaluation of fact correctness shows an accuracy of about 95%. YAGO is based on a logically clean model, which is decidable, extensible, and compatible with RDFS. Finally, we show how YAGO can be further extended by state-of-the-art information extraction techniques.

/pdf/yago-a-core-of-semantic-knowledge-13k3nmj6l2.pdf

Yago: a core of semantic knowledge

Social Network Analysis

The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.

[서평]「Applied Cryptography」

The present report is submitted in response to General Assembly resolution 61/106, by which the Assembly adopted the Convention on the Rights of Persons with Disabilities and the Optional Protocol thereto. As requested by the Assembly, a brief overview of the status of the Convention as at 3 August 2007 is presented. The report also contains a brief description of technical arrangements on staff and facilities made necessary for the effective performance of the functions of the Conference of States Parties and the Committee under the Convention and the Optional Protocol, and a description on the progressive implementation of standards and guidelines for the accessibility of facilities and services of the United Nations system. Recent efforts of the United Nations and agencies to disseminate information on the Convention and the Optional Protocol are also described.

わかりやすい障害者の権利条約 : 知的障害のある人の権利のために = Convention on the rights of persons with disabilities

The increasing availability of massive and accurate laser data enables the processing of spatial queries on terrains As shortest-path computation, an integral element of query processing, is inherently expensive on terrains, a key approach to enabling efficient query processing is to reduce the need for exact shortest-path computation in query processing We develop new lower and upper bounds on terrain shortest distances that are provably tighter than any existing bounds Unlike existing bounds, the new bounds do not rely on the quality of the triangulation We show how use of the new bounds speeds up query processing by reducing the need for exact distance computations Speedups of of nearly an order of magnitude are demonstrated empirically for well-known spatial queries

/pdf/new-lower-and-upper-bounds-for-shortest-distance-queries-on-2viurz00ds.pdf

New lower and upper bounds for shortest distance queries on terrains

Modeling and Querying.- Moving Objects: Logical Relationships and Queries.- A Spatiotemporal Model and Language for Moving Objects on Road Networks.- Similarity of Cardinal Directions.- Moving-Object Query Processing.- Querying Mobile Objects in Spatio-Temporal Databases.- K-Nearest Neighbor Search for Moving Query Point.- Semantic Caching in Location-Dependent Query Processing.- Query Processing--Architectures and Cost Estimation.- A Model-Based, Open Architecture for Mobile, Spatially Aware Applications.- Continuous Queries within an Architecture for Querying XML-Represented Moving Objects.- Selectivity Estimation of Complex Spatial Queries.- Wavelet-Based Cost Estimation for Spatial Queries.- Processing Advanced Queries.- Evaluation of Buffer Queries in Spatial Databases.- On Multi-Way Spatial Joins with Direction Predicates.- Discovering Spatial Co-location Patterns: A Summary of Results.- Constrained Nearest Neighbor Queries.- Formal Aspects.- Calendars, Time Granularities, and Automata.- Composing Cardinal Direction Relations.- Data Representation.- Creating Representations for Continuously Moving Regions from Observations.- Compressing Multiresolution Triangle Meshes.- Design and Implementation of Multi-scale Databases.- Industrial Session.- The Architecture of ArcIMS, a Distributed Internet Map Server.- Efficient Processing of Large Spatial Queries Using Interior Approximations.- Data Warehousing and Mining.- Efficient Mining of Spatiotemporal Patterns.- Efficient OLAP Operations in Spatial Data Warehouses.- Pre-aggregation in Spatial Data Warehouses.- Indexing.- Interval Sequences: An Object-Relational Approach to Manage Spatial Data.- Query Processing in Broadcasted Spatial Index Trees.- Object-Relational Indexing for General Interval Relationships.

Advances in Spatial and Temporal Databases: 7th International Symposium, SSTD 2001, Redondo Beach, CA, USA, July 12-15, 2001 Proceedings

/pdf/editorial-the-dark-citations-of-tods-papers-and-what-to-do-2sbbfyj9sv.pdf

Editorial: The Dark Citations of TODS Papers and What to Do about It—or: Cite the Journal Paper

We provide efficient support for applications that aim to continuously find pairs of similar sets in rapid streams of sets. A prototypical example setting is that of tweets. A tweet is a set of words, and Twitter emits about half a billion tweets per day. Our solution makes it possible to efficiently maintain the top-$k$ most similar tweets from a pair of rapid Twitter streams, e.g., to discover similar trends in two cities if the streams concern cities. 
Using a sliding window model, the top-$k$ result changes as new sets in the stream enter the window or existing ones leave the window. Maintaining the top-$k$ result under rapid streams is challenging. First, when a set arrives, it may form a new pair for the top-$k$ result with any set already in the window. Second, when a set leaves the window, all its pairings in the top-$k$ are invalidated and must be replaced. It is not enough to maintain the $k$ most similar pairs, as less similar pairs may eventually be promoted to the top-$k$ result. A straightforward solution that pairs every new set with all sets in the window and keeps all pairs for maintaining the top-$k$ result is memory intensive and too slow. We propose SWOOP, a highly scalable stream join algorithm that solves these issues. Novel indexing techniques and sophisticated filters efficiently prune useless pairs as new sets enter the window. SWOOP incrementally maintains a stock of similar pairs to update the top-$k$ result at any time, and the stock is shown to be minimal. Our experiments confirm that SWOOP can deal with stream rates that are orders of magnitude faster than the rates of existing approaches.

SWOOP: Top-k Similarity Joins over Set Streams

For over 40 years, organization studies have examined human factors in physical workplaces and their influence on the ability of an individual to perform a task, or a set of tasks, alone or in collaboration with others. In a virtual marketplace, the crowd is typically volatile, its arrival and departure asynchronous, and its levels of attention and accuracy diverse. This has generated a wealth of new research ranging from studying workers’ fatigue in task completion to examining the role of motivation in task assignment. I will review such work and argue that we need a holistic view to take full advantage of human factors such as skills, expected wage and motivation, in improving the performance of a crowdsourcing platform. Experience on XXX Health such as Earth Health and Human Health Though Big Data

Christian S. Jensen

Papers

New lower and upper bounds for shortest distance queries on terrains

Advances in Spatial and Temporal Databases: 7th International Symposium, SSTD 2001, Redondo Beach, CA, USA, July 12-15, 2001 Proceedings

Editorial: The Dark Citations of TODS Papers and What to Do about It—or: Cite the Journal Paper

SWOOP: Top-k Similarity Joins over Set Streams

Web and Big Data: First International Joint Conference, APWeb-WAIM 2017, Proceedings, Part I