A TOOL FOR COLLECTING, QUERYING AND MINING MACROSEISMIC DATA

SEISMO-SURFER is a tool for collecting, querying and mining seismic data being developed in Java programming language using Oracle database system. The objective is to combine recent research trends and results in the fields of spatial and spatio-temporal databases, data warehouses and data mining, as well as well established visualization techniques for geographical information. The database of the tool is automatically updated from remote sources while existing possibilities allow the querying on different earthquakes parameters, the analysis of the data for extraction of useful information and the graphical representation of the results via maps, charts etc. In the present work, we extend SEISMO-SURFER to include macroseismic data collected by the Geodynamic Institute and filled in a relative database. More specifically, the seismic parameters of the strong earthquakes, stored into the SEISMO-SURFER database, are linked to the macroseismic intensities observed at different sites. Administrative information for each site, local surface geology, tectonic lines, damage photographs and detailed descriptions from newspapers are also included. University of Piraeus and Geodynamic Institute are working together to continuously update and develop SEISMO-SURFER, concerning the data included, the variety of parameters stored and the mining algorithms supported for exploiting knowledge

Bidding at Sequential First-Price Auctions with(out) Supply Uncertainty: A Laboratory Analysis

We report on a series of experiments that test the effects of an uncertain supply on the formation of bids and prices in sequential first-price auctions with private-independent values and unit-demands. Supply is assumed uncertain when buyers do not know the exact number of units to be sold (i.e., the length of the sequence). Although we observe a non-monotone behavior when supply is certain and an important overbidding, the data qualitatively support our price trend predictions and the risk neutral Nash equilibrium model of bidding for the last stage of a sequence, whether supply is certain or not. Our study shows that behavior in these markets changes significantly with the presence of an uncertain supply, and that it can be explained by assuming that bidders formulate pessimistic beliefs about the occurrence of another stage.Financial support from the University of Valencia (project GV98_08/2960) and from a EU-TMR ENDEAR Network Grant (FMRX-CT98-0238) is gratefully acknowledged

Time-aware Sub-Trajectory Clustering in Hermes@PostgreSQL

In this paper, we present an efficient in-DBMS framework for progressive time-aware sub-trajectory cluster analysis. In particular, we address two variants of the problem: (a) spatiotemporal sub-trajectory clustering and (b) index-based time-aware clustering at querying environment. Our approach for (a) relies on a two-phase process: a voting-and-segmentation phase followed by a sampling-and-clustering phase. Regarding (b), we organize data into partitions that correspond to groups of sub-trajectories, which are incrementally maintained in a hierarchical structure. Both approaches have been implemented in Hermes@PostgreSQL, a real Moving Object Database engine built on top of PostgreSQL, enabling users to perform progressive cluster analysis via simple SQL. The framework is also extended with a Visual Analytics (VA) tool to facilitate real world analysis

Application of the Gaussian mixture model in pulsar astronomy -- pulsar classification and candidates ranking for {\it Fermi} 2FGL catalog

Machine learning, algorithms to extract empirical knowledge from data, can be used to classify data, which is one of the most common tasks in observational astronomy. In this paper, we focus on Bayesian data classification algorithms using the Gaussian mixture model and show two applications in pulsar astronomy. After reviewing the Gaussian mixture model and the related Expectation-Maximization algorithm, we present a data classification method using the Neyman-Pearson test. To demonstrate the method, we apply the algorithm to two classification problems. Firstly, it is applied to the well known period-period derivative diagram, where we find that the pulsar distribution can be modeled with six Gaussian clusters, with two clusters for millisecond pulsars (recycled pulsars) and the rest for normal pulsars. From this distribution, we derive an empirical definition for millisecond pulsars as $\frac{\dot{P}}{10^{-17}} \leq3.23(\frac{P}{100 \textrm{ms}})^{-2.34}$. The two millisecond pulsar clusters may have different evolutionary origins, since the companion stars to these pulsars in the two clusters show different chemical composition. Four clusters are found for normal pulsars. Possible implications for these clusters are also discussed. Our second example is to calculate the likelihood of unidentified \textit{Fermi} point sources being pulsars and rank them accordingly. In the ranked point source list, the top 5% sources contain 50% known pulsars, the top 50% contain 99% known pulsars, and no known active galaxy (the other major population) appears in the top 6%. Such a ranked list can be used to help the future follow-up observations for finding pulsars in unidentified \textit{Fermi} point sources.Comment: 9 pages, 4 figures, accepted by MNRA

PA-Tree: A Parametric Indexing Scheme for Spatio-temporal Trajectories

Abstract. Many new applications involving moving objects require the collec-tion and querying of trajectory data, so efficient indexing methods are needed to support complex spatio-temporal queries on such data. Current work in this domain has used MBRs to approximate trajectories, which fail to capture some basic properties of trajectories, including smoothness and lack of internal area. This mismatch leads to poor pruning when such indices are used. In this work, we revisit the issue of using parametric space indexing for historical trajectory data. We approximate a sequence of movement functions with single continuous polynomial. Since trajectories tend to be smooth, our approximations work well and yield much finer approximation quality than MBRs. We present the PA-tree, a parametric index that uses this new approximation method. Experiments show that PA-tree construction costs are orders of magnitude lower than that of com-peting methods. Further, for spatio-temporal range queries, MBR-based methods require 20%–60 % more I/O than PA-trees with clustered indicies, and 300%– 400 % more I/O than PA-trees with non-clustered indicies.