다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

“Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks”の学習報告

https://www.cs.ox.ac.uk/people/bernardo.cuencagrau/publications/PelletDemo.pdf

Pellet: A practical OWL-DL reasoner

Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. The problem of designing data integration systems is important in current real world applications, and is characterized by a number of issues that are interesting from a theoretical point of view. This document presents on overview of the material to be presented in a tutorial on data integration. The tutorial is focused on some of the theoretical issues that are relevant for data integration. Special attention will be devoted to the following aspects: modeling a data integration application, processing queries in data integration, dealing with inconsistent data sources, and reasoning on queries.

/pdf/data-integration-a-theoretical-perspective-58aesjvhuk.pdf

Data integration: a theoretical perspective

Multi-robot patrolling is a key feature for various applications related to surveillance and security, and it has been studied from several different perspectives, ranging from techniques that devise optimal off-line strategies to implemented systems. However, still few approaches consider on-line decision techniques that can cope with uncertainty and non-determinism in robot behaviors. In this article we address on-line coordination, by casting the multi-robot patrolling problem as a task assignment problem and proposing two solution techniques: DTA-Greedy, which is a baseline greedy approach, and DTAP, which is based on sequential single-item auctions. We evaluate the performance of our system in a realistic simulation environment (built with ROS and stage) as well as on real robotic platforms. In particular, in the simulated environment we compare our task assignment approaches with previous off-line and on-line methods. Our results confirm that on-line coordination approaches improve the performance of the multi-robot patrolling system in real environments, and that coordination approaches that employ more informed coordination protocols (e.g., DTAP) achieve better performances with respect to state-of-the-art online approaches (e.g., SEBS) in scenarios where interferences among robots are likely to occur. Moreover, the deployment on real platforms (three Turtlebots in an office environment) shows that our on-line approaches can successfully coordinate the robots achieving good patrolling behaviors when facing typical uncertainty and noise (e.g., localization and navigation errors) associated to real platforms.

/pdf/distributed-on-line-dynamic-task-assignment-for-multi-robot-47t93tokgb.pdf

Distributed on-line Dynamic Task Assignment for Multi-Robot Patrolling

Precision agriculture is gaining increasing attention because of the possible reduction of agricultural inputs (e.g., fertilizers and pesticides) that can be obtained by using hightech equipment, including robots. In this paper, we focus on an agricultural robotics system that addresses the weeding problem by means of selective spraying or mechanical removal of the detected weeds. In particular, we describe a deep learning based method to allow a robot to perform an accurate weed/crop classification using a sequence of two Convolutional Neural Networks (CNNs) applied to RGB images. The first network, based on an encoder-decoder segmentation architecture, performs a pixelwise, plant-type agnostic, segmentation between vegetation and soil that enables to extract a set of connected blobs representing plant instances. We show that such network can be trained also using external, ready to use pixel-wise labeled data sets coming from different contexts. Each plant is hence classified between crop and weeds by using the second network. Quantitative experimental results, obtained on real world data, demonstrate that the proposed approach can achieve good classification results also on challenging images.

Crop and Weeds Classification for Precision Agriculture Using Context-Independent Pixel-Wise Segmentation

To coordinate a team of robots for exploration is a challenging problem, particularly in large areas as for example the devastated area after a disaster. This problem can generally be decomposed into task assignment and multi-robot path planning. In this paper, we address both problems jointly. This is possible because we reduce significantly the size of the search space by utilizing RFID tags as coordination points. The exploration approach consists of two parts: a stand-alone distributed local search and a global monitoring process which can be used to restart the local search in more convenient locations. Our results show that the local exploration works for large robot teams, particularly if there are limited computational resources. Experiments with the global approach showed that the number of conflicts can be reduced, and that the global coordination mechanism increases significantly the explored area.

/pdf/rfid-based-exploration-for-large-robot-teams-221dwuequ1.pdf

RFID-Based Exploration for Large Robot Teams

This paper presents an approach for learning environmental knowledge from task-based human-robot dialog. Previous approaches to dialog use domain knowledge to constrain the types of language people are likely to use. In contrast, by introducing a joint probabilistic model over speech, the resulting semantic parse and the mapping from each element of the parse to a physical entity in the building (e.g., grounding), our approach is flexible to the ways that untrained people interact with robots, is robust to speech to text errors and is able to learn referring expressions for physical locations in a map (e.g., to create a semantic map). Our approach has been evaluated by having untrained people interact with a service robot. Starting with an empty semantic map, our approach is able ask 50% fewer questions than a baseline approach, thereby enabling more effective and intuitive human robot dialog.

Learning environmental knowledge from task-based human-robot dialog

The ICP algorithm has been extensively used in computer vision for registration and tracking purposes. The original formulation of this method is restricted to the use of non-articulated models. A straightforward generalisation to articulated structures is achievable through the joint minimisation of all the structure pose parameters, for example using Levenberg-Marquardt (LM) optimisation. However, in this approach the aligning transformation cannot be estimated in closed form, like in the original ICP, and the approach heavily suffers from local minima. To overcome this limitation, some authors have extended the straightforward generalisation at the cost of giving up some of the properties of ICP. In this paper, we present a generalisation of ICP to articulated structures, which preserves all the properties of the original algorithm. The key idea is to divide the articulated body into parts, which can be aligned rigidly in the way of the original ICP, with additional constraints to keep the articulated structure intact. Experiments show that our method reduces the residual registration error by a factor of 2.

/pdf/a-generalisation-of-the-icp-algorithm-for-articulated-bodies-3gny9iis5e.pdf

Daniele Nardi

Papers

Distributed on-line Dynamic Task Assignment for Multi-Robot Patrolling

Crop and Weeds Classification for Precision Agriculture Using Context-Independent Pixel-Wise Segmentation

RFID-Based Exploration for Large Robot Teams

Learning environmental knowledge from task-based human-robot dialog

A Generalisation of the ICP Algorithm for Articulated Bodies