Habitat use and diel vertical migration of bigeye thresher shark: overlap with pelagic longline fishing gear

Pelagic longliners targeting swordfish and tunas in oceanic waters regularly capture sharks as bycatch, including currently protected species as the bigeye thresher, Alopias superciliosus. Fifteen bigeye threshers were tagged with pop-up satellite archival tags (PSATs) in 2012-2014 in the tropical northeast Atlantic, with successful transmissions received from 12 tags for a total of 907 tracking days. Marked diel vertical movements were recorded on all specimens, with most of the daytime spent in deeper colder water (mean depth = 353 m, SD = 73; mean temperature = 10.7 °C, SD = 1.8) and nighttime spent in warmer water closer to the surface (mean depth = 72 m, SD = 54; mean temperature = 21.9 °C, SD = 3.7). The operating depth of the pelagic longline gear was measured with Minilog Temperature and Depth Recorders (TDRs), and the overlap with habitat utilization was calculated. Overlap is taking place mainly during the night and is higher for juveniles. The results presented herein can be used as inputs for Ecological Risk Assessments for bigeye threshers captured in oceanic tuna fisheries, and serve as a basis for efficient management and conservation of this vulnerable shark species.

Modeling the suitable habitat of a structural red gorgonian species in the Mediterranean/east Atlantic regions predicts a wider distribution than previously known

Dissertação de mestrado, Biologia Marinha, Faculdade de Ciências e Tecnologia, Univerdade do Algarve, 2015

Identifying the Influence of Channel Morphology on Physical Habitat Availability for Native Fish: Application to the Two-spined Blackfish (Gadopsis bispinosus) in the Cotter River, Australia.

The impact of channel morphology and flow on physical habitat availability for the two-spined blackfish (Gadopsis bispinosus) was assessed in the Cotter River, ACT, Australia. Physical habitat requirements for three life stages were identified based on previous field sampling in the Cotter River. Two sites were selected with contrasting channel morphology: Spur Hole, with a moderate gradient and runs and glides, and Vanity’s Crossing, with a steeper gradient, rapids, and fast-flowing pools. Physical Habitat Simulation System (PHABSIM) was used to simulate the flow v. physical habitat availability relationship for each life stage at both sites. Clear differences were apparent between sites, with Spur Hole characterised by increasing habitat with increasing flow and Vanity’s Crossing showing the opposite relationship. The nature of the channel morphology determined this difference, with Spur Hole characterised by marginal zones becoming inundated at higher flows and providing additional suitable physical habitat as discharge increases. Vanity’s Crossing does not contain similar marginal zones. Further analysis demonstrated that high water velocity was the most important factor limiting physical habitat availability at both sites. This approach demonstrates the importance of channel morphology in determining physical habitat availability and an alternative use of PHABSIM to highlight limiting factors for target species.

Effects of climate and land management changes on conservation : of mediterranean cork oak woodlands and their bird communities

Tese de doutoramento (co-tutela), Biologia (Biologia da Conservação), Faculdade de Ciências da Universidade de Lisboa, University of East Anglia, School of Environmental Sciences, 2014

Analysis of zooplankton species composition and depth-based habitat preference in Nootka Sound, B.C., Canada

Senior thesis written for Oceanography 445

Heterogeneous Agglomeration

Many prior treatments of agglomeration explicitly or implicitly assume that all industries agglomerate for the same reasons. This paper uses UK establishment-level coagglomeration data to document substantial heterogeneity across industries in the microfoundations of agglomeration economies. It finds robust evidence of organizational and adaptive agglomeration forces as discussed by Chinitz (1961), Vernon (1960), and Jacobs (1969). These forces interact with the traditional Marshallian (1890) factors of input sharing, labor pooling, and knowledge spillovers, establishing a previously unrecognized complementarity between the approaches of Marshall and Jacobs, as well as others, to the analysis of agglomeration.

Is the incipient Chinese civil society playing a role in regenerating historic urban areas? Evidence from Nanjing, Suzhou and Shanghai

Urban regeneration in Western countries can count on a long-lasting tradition of experiences in which civil society has played a fundamental role in counterbalancing the system of power, resulting in profound urban governance readjustments. This has been the result of the increasing centrality of horizontal alliances between citizens and associations involved in urban affairs since the late 1960s in the West. Similar theoretical frameworks have been applied in China. However, these have frequently resulted in conceptual shortcuts that depict civil society as immature or lacking and the state as authoritarian. This paper will explore whether these categories are still entirely valid to urban regeneration in China. While the regime has traditionally prevented horizontal linkages of associations in urban governance (supporting their vertical integration to ensure a certain degree of soft control), there are signs of change. In particular, three cases of urban regeneration in historic areas will be used to discuss the changing role played by civil society in China. The ultimate goal is to examine whether horizontal linkages across groups of heterogeneous citizens are arising at the micro-level of urban governance.

Habitat predictive modelling of demersal fish species in the Azores

Dissertação de Mestrado, Estudos Integrados dos Oceanos, 25 de Março de 2013, Universidade dos Açores.

Cold-water coral communities in the Azores : diversity, habitat and conservation

Tese de Doutoramento, Ciências do Mar (especialidade em Ecologia Marinha), 11 de Setembro de 2015, Universidade dos Açores.

Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

A preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Symposium, 2010, pp. 239–248.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning real-time tasks on a heterogeneous multiprocessor platform comprising two different types of processors — such a platform is referred to as two-type platform. We present two linearithmic timecomplexity algorithms, SA and SA-P, each providing the follow- ing guarantee. For a given two-type platform and a given task set, if there exists a feasible task-to-processor-type assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type, then (i) using SA, it is guaranteed to find such a feasible task-to- processor-type assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding 2 a feasible task-to-processor assignment where tasks are not allowed to migrate between processors but given a platform in which processors are 1+α/times faster, where 0<α≤1. The parameter α is a property of the task set — it is the maximum utilization of any task which is less than or equal to 1.

Engineering PROFIBUS networks with heterogeneous transmission media

A significant number of process control and factory automation systems use PROFIBUS as the underlying fieldbus communication network. The process of properly setting up a PROFIBUS network is not a straightforward task. In fact, a number of network parameters must be set for guaranteeing the required levels of timeliness and dependability. Engineering PROFIBUS networks is even more subtle when the network includes various physical segments exhibiting heterogeneous specifications, such as bus speed or frame formats, just to mention a few. In this paper we provide underlying theory and a methodology to guarantee the proper operation of such type of heterogeneous PROFIBUS networks. We additionally show how the methodology can be applied to the practical case of PROFIBUS networks containing simultaneously DP (Decentralised Periphery) and PA (Process Automation) segments, two of the most used commercial-off-the-shelf (COTS) PROFIBUS solutions. The importance of the findings is however not limited to this case. The proposed methodology can be generalised to cover other heterogeneous infrastructures. Hybrid wired/wireless solutions are just an example for which an enormous eagerness exists.

Time-bounded distributed QoS-aware service configuration in heterogeneous cooperative environments

The scarcity and diversity of resources among the devices of heterogeneous computing environments may affect their ability to perform services with specific Quality of Service constraints, particularly in dynamic distributed environments where the characteristics of the computational load cannot always be predicted in advance. Our work addresses this problem by allowing resource constrained devices to cooperate with more powerful neighbour nodes, opportunistically taking advantage of global distributed resources and processing power. Rather than assuming that the dynamic configuration of this cooperative service executes until it computes its optimal output, the paper proposes an anytime approach that has the ability to tradeoff deliberation time for the quality of the solution. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves at each iteration, with an overhead that can be considered negligible.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.