A Robot Application for Marine Vessel Inspection

Seagoing vessels have to undergo regular inspections, which are currently performed manually by ship surveyors. The main cost factor in a ship inspection is to provide access to the different areas of the ship, since the surveyor has to be close to the inspected parts, usually within arm's reach, either to perform a visual analysis or to take thickness measurements. The access to the structural elements in cargo holds, e.g., bulkheads, is normally provided by staging or by “cherry‐picking” cranes. To make ship inspections safer and more cost‐efficient, we have introduced new inspection methods, tools, and systems, which have been evaluated in field trials, particularly focusing on cargo holds. More precisely, two magnetic climbing robots and a micro‐aerial vehicle, which are able to assist the surveyor during the inspection, are introduced. Since localization of inspection data is mandatory for the surveyor, we also introduce an external localization system that has been verified in field trials, using a climbing inspection robot. Furthermore, the inspection data collected by the robotic systems are organized and handled by a spatial content management system that enables us to compare the inspection data of one survey with those from another, as well as to document the ship inspection when the robot team is used. Image‐based defect detection is addressed by proposing an integrated solution for detecting corrosion and cracks. The systems' performance is reported, as well as conclusions on their usability, all in accordance with the output of field trials performed onboard two different vessels under real inspection conditions.     

A time bound on the materialization of some recursively defined views

A virtual relation (or view) can be defined with a recursive Horn clause that is a function of one or more base relations. In general, the number of times such a Horn clause must be applied in order to retrieve all the tuples in the virtual relation depends on the contents of the base relations of the definition. However, there exist Horn clauses for which there is an upper bound on the number of applications necessary to form the virtual relation, independent of the contents of the base relations. Considering a restricted class of recursive Horn clauses, we give necessary and sufficient conditions for members of the class to have this bound.     

Exemplar queries: a new way of searching

Modern search engines employ advanced techniques that go beyond the structures that strictly satisfy the query conditions in an effort to better capture the user intentions. In this work, we introduce a novel query paradigm that considers a user query as an example of the data in which the user is interested. We call these queries exemplar queries. We provide a formal specification of their semantics and show that they are fundamentally different from notions like queries by example, approximate queries and related queries. We provide an implementation of these semantics for knowledge graphs and present an exact solution with a number of optimizations that improve performance without compromising the result quality. We study two different congruence relations, isomorphism and strong simulation, for identifying the answers to an exemplar query. We also provide an approximate solution that prunes the search space and achieves considerably better time performance with minimal or no impact on effectiveness. The effectiveness and efficiency of these solutions with synthetic and real datasets are experimentally evaluated, and the importance of exemplar queries in practice is illustrated.     

Indexing and progressive top-k similarity retrieval of trajectories

In this work, we study the performance of state-of-the-art access methods to efficiently store and retrieve trajectories in spatial networks. First, we study how efficiently such methods can manage trajectory data to support indexing for data demanding applications where trajectory retrieval must be fast. At the same time, trajectory insertions, deletions and modifications should also be executed efficiently. Secondly, we compare the performance of progressive processing of trajectory similarity top-k queries, which is a common query in spatial applications. Specifically, we examine FNR-trees (Frentzos 2003) and MON-trees (de Almeida and Gueting, 2005), which have been proposed for trajectory management, against a novel variation of our proposed Cluster-extended Adjacency Lists (CeAL) (Tiakas and Rafailidis 2015). In particular: (a) we extend the above access methods to efficiently handle trajectories of objects that move in large spatial networks, and (b) to enhance their performance, we create an entirely new implementation framework to generate trajectories and to test the trajectory management and retrieval for each approach. With respect to the generation of trajectories, we extend the generator by Brinkhoff (2000) to efficiently support very large spatial networks. Finally, we conduct extensive experimentation which demonstrates that the proposed method CeAL prevails in space and time complexity.

     

A case study on propagating and updating provenance information using the CIDOC CRM

Provenance information of digital objects maintained by digital libraries and archives is crucial for authenticity assessment, reproducibility and accountability. Such information is commonly stored on metadata placed in various Metadata Repositories (MRs) or Knowledge Bases (KBs). Nevertheless, in various settings it is prohibitive to store the provenance of each digital object due to the high storage space requirements that are needed for having complete provenance. In this paper, we introduce provenance-based inference rules as a means to complete the provenance information, to reduce the amount of provenance information that has to be stored, and to ease quality control (e.g., corrections). Roughly, we show how provenance information can be propagated by identifying a number of basic inference rules over a core conceptual model for representing provenance. The propagation of provenance concerns fundamental modelling concepts such as actors, activities, events, devices and information objects, and their associations. However, since a MR/KB is not static but changes over time due to several factors, the question that arises is how we can satisfy update requests while still supporting the aforementioned inference rules. Towards this end, we elaborate on the specification of the required add/delete operations, consider two different semantics for deletion of information, and provide the corresponding update algorithms. Finally, we report extensive comparative results for different repository policies regarding the derivation of new knowledge, in datasets containing up to one million RDF triples. The results allow us to understand the tradeoffs related to the use of inference rules on storage space and performance of queries and updates.     

A unified interaction scheme for information sources

Commonly, for retrieving the desired information from an information source (knowledge base or information base), the user has to use the query language that is provided by the system. This is a big barrier for many ordinary users and the resulting interaction style is rather inflexible. In this paper we give the theoretical foundations of an interaction scheme that allows users to retrieve the objects of interest without having to be familiar with the conceptual schema of the source or with the supported query language. Specifically, we describe an interaction manager that provides a quite flexible interaction scheme by unifying several well-known interaction schemes. Furthermore, we show how this scheme can be applied to taxonomy-based sources by providing all needed algorithms and reporting their computational complexity.     

Multi-Way Distance Join Queries in Spatial Databases

Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The D_{_distance}-value of this n-tuple is the value of a linear function of distances of the n objects that make up this n-tuple, according to the edges of the QG. This paper addresses the problem of finding the K n-tuples between n spatial datasets that have the smallest D_{_distance}-values, the so-called K-multi-way distance join query (K-MWDJQ), where each set is indexed by an R-tree-based structure. This query can be viewed as an extension of K-closest-pairs query (K-CPQ) [8] for n inputs. In addition, a recursive non-incremental branch-and-bound algorithm following a depth-first search for processing synchronously all inputs without producing any intermediate result is proposed. Enhanced pruning techniques are also applied to n R-trees nodes in order to reduce the total response time and the number of distance computations of the query. Due to the exponential nature of the problem, we also propose a time-based approximate version of the recursive algorithm that combines approximation techniques to adjust the quality of the result and the global processing time. Finally, we give a detailed experimental study of the proposed algorithms using real spatial datasets, highlighting their performance and the quality of the approximate results.     

A GIS-based methodology for identifying pedestrians’ crossing patterns

A pedestrian trip is a spatiotemporal process going through different states and related to different decisions made at certain times and locations on the urban network. The analysis of pedestrian trips in terms of crossing patterns is a complex task, which is often further limited by a lack of appropriate and detailed data. The objective of this research is the development and testing of appropriate indicators of pedestrian crossing behavior along urban trips, and a methodology for collecting and processing the data required for the analysis of this behavior. First, a comprehensive set of indicators for the assessment of pedestrian behavior in urban areas is proposed (i.e. average trip length, number, type and location of crossings). Then, a GIS tool is developed for the storage and integration of information on pedestrian trips, and the crossings made during the trips, with other geographical information (e.g. road network function and geometry, traffic control and pedestrian facilities). The proposed approach is then tested at network level on a sample of pedestrian trips collected by a field survey. The results suggest specific patterns of pedestrian crossing behavior, such as the tendency to cross at the beginning of the trip and the tendency to cross at mid-block locations when signalized junctions are not available. The results are further discussed in terms of urban planning and management implications. It is concluded that the proposed approach is very efficient for the analysis of pedestrian crossing behavior in urban areas.     

Digital library information-technology infrastructures

This paper charts a research agenda on systems-oriented issues in digital libraries. It focuses on the most central and generic system issues, including system architecture, user-level functionality, and the overall operational environment. With respect to user-level functionality, in particular, it abstracts the overall information lifecycle in digital libraries to five major stages and identifies key research problems that require solution in each stage. Finally, it recommends an explicit set of activities that would help achieve the research goals outlined and identifies several dimensions along which progress of the digital library field can be evaluated.     

Ant colony and particle swarm optimization for financial classification problems

Financial decisions are often based on classification models which are used to assign a set of observations into predefined groups. Such models ought to be as accurate as possible. One important step towards the development of accurate financial classification models involves the selection of the appropriate independent variables (features) which are relevant for the problem at hand. This is known as the feature selection problem in the machine learning/data mining field. In financial decisions, feature selection is often based on the subjective judgment of the experts. Nevertheless, automated feature selection algorithms could be of great help to the decision-makers providing the means to explore efficiently the solution space. This study uses two nature-inspired methods, namely ant colony optimization and particle swarm optimization, for this problem. The modelling context is developed and the performance of the methods is tested in two financial classification tasks, involving credit risk assessment and audit qualifications.