Comparative Behavior of Wild and Hatchery Reared White Sea Bream (Diplodus sargus) Released on Artificial Reefs Off the Algarve (Southern Portugal)

Three hatchery produced and reared (HPR) and five wild white sea bream (Diplodus sargus) were double tagged with Vemco V8SC-2L acoustic transmitters and Floy Tag T-bar anchor tags, and released on artificial reefs located near a natural reef off the southern coast of Portugal. Passive telemetry was used to monitor movements of the white sea bream over a nine week period from April to June 2007. Differences in behavior at release, habitat association (artificial vs. natural reef), and in daily movements were registered. Wild fish moved from one habitat to the other with increased preference for the artificial habitat during the day, whereas HPR fish showed no site fidelity or consistent daily movement pattern and left the release site soon after release. Comparison of Minimum Convex Polygon (MCP) showed a higher area usage by wild fish. This experiment shows that these artificial reefs are used on a daily basis by wild white sea bream but apparently are not optimal release locations for hatchery produced white sea bream.

Site fidelity and movements of gilthead sea bream (Sparus aurata) in a coastal lagoon (Ria Formosa, Portugal)

Short-time site fidelity and movements of gilthead sea bream (Sparus aurata) in a coastal lagoon were determined using passive acoustic telemetry. Nine fish, ranging from 20.1 to 32.5 cm total length, were surgically implanted with acoustic transmitters and monitored for up to 179 days. Minimum convex polygon areas ranged from 18,698.6 m(2) to 352,711.9 m(2). Home range sizes were small, with individuals using core areas on a daily basis. However, these core areas shifted within the study site over time towards the opening to the sea. Two different diel behaviors were recorded, with some individuals more active at night and others during day time. Some individuals also demonstrated homing abilities, returning to the capture site after being released more than 4 km away. (C) 2008 Elsevier Ltd. All rights reserved.

AGV Safety Areas Obstacle Detection and Interaction with Point Cloud Derived Map

This thesis project aims to the development of an algorithm for the obstacle detection and the interaction between the safety areas of an Automated Guided Vehicles (AGV) and a Point Cloud derived map inside the context of a CAD software. The first part of the project focuses on the implementation of an algorithm for the clipping of general polygons, with which has been possible to: construct the safety areas polygon, derive the sweep of this areas along the navigation path performing a union and detect the intersections with line or polygon representing the obstacles. The second part is about the construction of a map in terms of geometric entities (lines and polygons) starting from a point cloud given by the 3D scan of the environment. The point cloud is processed using: filters, clustering algorithms and concave/convex hull derived algorithms in order to extract line and polygon entities representing obstacles. Finally, the last part aims to use the a priori knowledge of possible obstacle detections on a given segment, to predict the behavior of the AGV and use this prediction to optimize the choice of the vehicle's assigned velocity in that segment, minimizing the travel time.

Proof of Location through a Blockchain Agnostic Smart Contract Language: Design and Evaluation over Algorand and Ethereum

Le applicazioni che offrono servizi sulla base della posizione degli utenti sono sempre più utilizzate, a partire dal navigatore fino ad arrivare ai sistemi di trasporto intelligenti (ITS) i quali permetteranno ai veicoli di comunicare tra loro. Alcune di questi servizi permettono perfino di ottenere qualche incentivo se l'utente visita o passa per determinate zone. Per esempio un negozio potrebbe offrire dei coupon alle persone che si trovano nei paraggi. Tuttavia, la posizione degli utenti è facilmente falsificabile, ed in quest'ultima tipologia di servizi, essi potrebbero ottenere gli incentivi in modo illecito, raggirando il sistema. Diviene quindi necessario implementare un'architettura in grado di impedire alle persone di falsificare la loro posizione. A tal fine, numerosi lavori sono stati proposti, i quali delegherebbero la realizzazione di "prove di luogo" a dei server centralizzati oppure collocherebbero degli access point in grado di rilasciare prove o certificati a quegli utenti che si trovano vicino. In questo lavoro di tesi abbiamo ideato un'architettura diversa da quelle dei lavori correlati, cercando di utilizzare le funzionalità offerte dalla tecnologia blockchain e dalla memorizzazione distribuita. In questo modo è stato possibile progettare una soluzione che fosse decentralizzata e trasparente, assicurando l'immutabilità dei dati mediante l'utilizzo della blockchain. Inoltre, verrà dettagliato un'idea di caso d'uso da realizzare utilizzando l'architettura da noi proposta, andando ad evidenziare i vantaggi che, potenzialmente, si potrebbero trarre da essa. Infine, abbiamo implementato parte del sistema in questione, misurando i tempi ed i costi richiesti dalle transazioni su alcune delle blockchain disponibili al giorno d'oggi, utilizzando le infrastrutture messe a disposizione da Ethereum, Polygon e Algorand.