Dinossáurios Eocretácicos de Lagosteiros

According to an ancient folkloric legend, Our Lady, stepping down from the sea, would have rided on a mule to the platform above the cliffs named Pedra da Mua at Lagosteiros'bay, near Espichel cape. Mule's footprints, regarded by fishermen as evidence, would be clearly recognizable on exposed surfaces of the rocks. Indeed there are footprints but from Dinosaurs of latest Jurassic, Portlandian age, this spectacular locality being specially rich in giant Sauropod tracks (that have seldom been found elsewhere in Europe). As we proceeded to its study, another locality with Dinosaur footprints, Lower Cretaceous (Hauterivian) in age, was found on the northern cliffs at Lagosteiros. It is probably the richest one in european Lower Cretaceous and the only of this age known in Portugal, so we decided to give priority to its study. Dinosaur tracks have been printed on calciclastic sands in a lagoonal environment protected by fringing coral reefs. There have been emersion episodes; beaches were frequented by Dinosaurs. Later on, the marine barremian ingression restablished a gulf and such animals could not come here any more. Under a paleogeographical viewpoint, the evidence of a marine regression near the end of Hauterivian is to be remarked. Five types of tracks and footprints have been recognized: - Neosauropus lagosteirensis, new morphogenus and species, tracks from a giant Sauropod, perhaps from Camarasaurus; with its proportions the total length of the author would be about 15,5 m. These are the only Sauropod tracks known till now in Europe's Lower Cretaceous. - tracks from a not so big quadruped, maybe a Sauropod (young individual?); however it is not impossible that they were produced by Stegosaurians or Ankylosaurians. -Megalosauropus (?Eutynichnium) gomesi new morphospecies, four Theropod tracks most probably produced by megalosaurs. - Iguanodon sp., represented by some footprints and specially by a set corresponding to the feet and tail from an individual standing in a rest position. - problematical, quite small-sized biped (maybe an Ornithopod related to Camptosaurus). Evidence points to a richer fauna than that known in barremian "Dinosaur sandstones" from a nearby locality, Boca do Chapim. Lagosteiros' association clearly indicates the predominance of herbivores, which required large amounts of vegetable food in the neighbourhood. This is an indirect evidence of the vegetal wealth, also suggested by associations of plant macrofossils, polen and spores found in early Cretaceous sediments at the same region. The relatively high proportion of Theropoda is related to the wealth of the whole fauna, which comprised a lot of the prey needed by such powerful flesh-eaters. The evidence, as a whole, points out to a warm and moist climate. All the tracks whose direction could be measured are directed to the southern quadrants, this being confirmed by the approximative direction of other footprints. Massive displacements (migration?) could take place during a brief emersion episode. This may result from the ingression of barremian seas, flooding the region and restablishing here a small gulf. Even if the arrival of the waters damaged certain footprints it has not destroyed them completely, thus allowing the preservation of such evidence from a remote past.

Faciès, biostratigraphie et paléogéographie du Jurassique portugais

The facies distribution along the Jurassic stages in an already well established stratigraphic frame is defined for the three portuguese basins: North of Tagus, Santiago de Cacém and Algarve. The deposits are organized in two sedimentary cycles. The first one from the Liassic to Calovian shows, in the Tagus Basin, a transgression from NW which did not surpass the Meseta present limits. The iniatilly brackish deposits only changed to marine by the end of Lotharingian. The sedimentation, mainly marly during the Liassic became more calcareous since the Aalenian. During the Dogger the basin differentiated into platform deposits towards East and South and open sea zone towards West. This zone underwent a progressive reduction and, during the Callovian, two small basins were individualized: Cabo Mondego basin in the North and Serra de El-Rei-Montejunto in the South. It is from the latter that the second sedimentary cycle (Middle Oxfordian-Portlandian) developed with open sea deposits along the Sintra–Torres Vedras axis surrounded by platform and litoral brackish formations. During the first sedimentary cycle only litoral platform deposits are known in Santiago de Cacém and Algarve basins. During the second sedimentary cycle temporary sea open deposits are known in Santiago de Cacém and Central Algarve.

Slotted wiDom: schedulability analysis and its experimental validation

WiDom is a wireless prioritized medium access control protocol which offers a very large number of priority levels. Hence, it brings the potential to employ non-preemptive static-priority scheduling and schedulability analysis for a wireless channel assuming that the overhead of WiDom is modeled properly. One schedulability analysis for WiDom has already been proposed but recent research has created a new version of WiDom (we call it: Slotted WiDom) with lower overhead and for this version of WiDom no schedulability analysis exists. In this paper we propose a new schedulability analysis for slotted WiDom and extend it to work also for message streams with release jitter. We have performed experiments with an implementation of slotted WiDom on a real-world platform (MicaZ). We find that for each message stream, the maximum observed response time never exceeds the calculated response time and hence this corroborates our belief that our new scheduling theory is applicable in practice.

Experiences on the implementation of a cooperative embedded system framework

As the complexity of embedded systems increases, multiple services have to compete for the limited resources of a single device. This situation is particularly critical for small embedded devices used in consumer electronics, telecommunication, industrial automation, or automotive systems. In fact, in order to satisfy a set of constraints related to weight, space, and energy consumption, these systems are typically built using microprocessors with lower processing power and limited resources. The CooperatES framework has recently been proposed to tackle these challenges, allowing resource constrained devices to collectively execute services with their neighbours in order to fulfil the complex Quality of Service (QoS) constraints imposed by users and applications. In order to demonstrate the framework's concepts, a prototype is being implemented in the Android platform. This paper discusses key challenges that must be addressed and possible directions to incorporate the desired real-time behaviour in Android.

Contratos de futuros sobre taxas de juro : estudo de caso sobre a Euribor a 3 meses

Mestrado em Contabilidade e Análise Financeira

Scheduling sporadic tasks on multiprocessors with mutual exclusion constraints

Consider the problem of scheduling sporadic tasks on a multiprocessor platform under mutual exclusion constraints. We present an approach which appears promising for allowing large amounts of parallel task executions and still ensures low amounts of blocking.

Towards comparable simulations of cooperating objects and wireless sensor networks

Simulators are indispensable tools to support the development and testing of cooperating objects such as wireless sensor networks (WSN). However, it is often not possible to compare the results of different simulation tools. Thus, the goal of this paper is the specification of a generic simulation platform for cooperating objects. We propose a platform that consists of a set of simulators that together fulfill desired simulator properties. We show that to achieve comparable results the use of a common specification language for the software-under-test is not feasible. Instead, we argue that using common input formats for the simulated environment and common output formats for the results is useful. This again motivates that a simulation tool consisting of a set of existing simulators that are able to use common scenario-input and can produce common output which will bring us a step closer to the vision of achieving comparable simulation results.

Optimal virtual cluster-based multiprocessor scheduling

Scheduling of constrained deadline sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal scheduler is hard, and therefore most studies have focused on developing algorithms with good processor utilization bounds. These algorithms can be broadly classified into two categories: partitioned scheduling in which tasks are statically assigned to individual processors, and global scheduling in which each task is allowed to execute on any processor in the platform. In this paper we consider a third, more general, approach called cluster-based scheduling. In this approach each task is statically assigned to a processor cluster, tasks in each cluster are globally scheduled among themselves, and clusters in turn are scheduled on the multiprocessor platform. We develop techniques to support such cluster-based scheduling algorithms, and also consider properties that minimize total processor utilization of individual clusters. In the last part of this paper, we develop new virtual cluster-based scheduling algorithms. For implicit deadline sporadic task systems, we develop an optimal scheduling algorithm that is neither Pfair nor ERfair. We also show that the processor utilization bound of us-edf{m/(2m−1)} can be improved by using virtual clustering. Since neither partitioned nor global strategies dominate over the other, cluster-based scheduling is a natural direction for research towards achieving improved processor utilization bounds.

Provably good multiprocessor scheduling with resource sharing

We present a 12(1 + 3R/(4m)) competitive algorithm for scheduling implicit-deadline sporadic tasks on a platform comprising m processors, where a task may request one of R shared resources.

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

Consider the problem of scheduling a set of implicitdeadline sporadic tasks on a heterogeneous multiprocessor so as to meet all deadlines. Tasks cannot migrate and the platform is restricted in that each processor is either of type-1 or type-2 (with each task characterized by a different speed of execution upon each type of processor). We present an algorithm for this problem with a timecomplexity of O(n·m), where n is the number of tasks and m is the number of processors. It offers the guarantee that if a task set can be scheduled by any non-migrative algorithm to meet deadlines then our algorithm meets deadlines as well if given processors twice as fast. Although this result is proven for only a restricted heterogeneous multiprocessor, we consider it significant for being the first realtime scheduling algorithm to use a low-complexity binpacking approach to schedule tasks on a heterogeneous multiprocessor with provably good performance.

Gestão da identidade visual corporativa nos meios digitais: o caso RTP

Relatório de estágio apresentado à Escola Superior de Comunicação Social como parte dos requisitos para obtenção de grau de mestre em Gestão Estratégica das Relações Públicas.

Efficient aggregate computations in large-scale dense WSN

We focus on large-scale and dense deeply embedded systems where, due to the large amount of information generated by all nodes, even simple aggregate computations such as the minimum value (MIN) of the sensor readings become notoriously expensive to obtain. Recent research has exploited a dominance-based medium access control(MAC) protocol, the CAN bus, for computing aggregated quantities in wired systems. For example, MIN can be computed efficiently and an interpolation function which approximates sensor data in an area can be obtained efficiently as well. Dominance-based MAC protocols have recently been proposed for wireless channels and these protocols can be expected to be used for achieving highly scalable aggregate computations in wireless systems. But no experimental demonstration is currently available in the research literature. In this paper, we demonstrate that highly scalable aggregate computations in wireless networks are possible. We do so by (i) building a new wireless hardware platform with appropriate characteristics for making dominance-based MAC protocols efficient, (ii) implementing dominance-based MAC protocols on this platform, (iii) implementing distributed algorithms for aggregate computations (MIN, MAX, Interpolation) using the new implementation of the dominance-based MAC protocol and (iv) performing experiments to prove that such highly scalable aggregate computations in wireless networks are possible.

Sedimentation pelagique et encroûtements cryptalgaires: les calcaires gremeleux du Carixien portugais

In Portugal, Carixian is generally represented by alternative layers of marly limestones characterized by nodule and lumpy levels. These layers are particularly developped [show preferential development] on passage areas to a sedimentary basin, particularly along the slope of tilted blocks between the Meseta and Berlenga's horst. This facies is included in the range of the «nodular limestone» and of the «ammonitico-rosso». Limestones are radiolaria micrites with fragments of pelagic organisms (ammonoids, thin shelled gastropods). These layers can be affected by intensive bioturbation (Brenha) which is responsible for dismantlement, specially where the initial thickness does not exceed a few centimetres. This process can lead to the isolation of residual nodules (Brenha, São Pedro de Muel, Peniche) which can be mobilised by massive sliding (Peniche). The isolated elements, shell fragments or residual nodules, can also be incrustated, thus developing oncolitic cryptalgal structures. At Brenha the lump structure developed progressively into a sequence overlapping the normal sedimentary one (thick limestone beds alternating with bituminous shales). Cryptalgal structures correspond to rather unstable environment conditions on mobile margins. These structures are known in deep pelagic sediments corresponding to well defined events of the geodynamic evolution (end of the initial rifting). Cryptalgal accretions disappear towards the sedimentary basin, and the nodular levels are less important. In the articulation areas with the Tomar platform, small mounds and cupules (Alcabideque) developed within the alternating marly-limestone levels. They represent the so called «mud mounds» of metric dimensions. The upper part of these «mud mounds» is hardened, showing track remains and supporting some brachiopods and pectinids. Hence the lumpy facies of Portugal is included among the range of sedimentaty environments and can be used as «geodynamic tracer».

Evaluating Android OS for embedded real-time systems

Since its official public release, Android has captured the interest from companies, developers and the general audience. From that time up to now, this software platform has been constantly improved either in terms of features or supported hardware and, at the same time, extended to new types of devices different from the originally intended mobile ones. However, there is a feature that has not been explored yet - its real-time capabilities. This paper intends to explore this gap and provide a basis for discussion on the suitability of Android in order to be used in Open Real-Time environments. By analysing the software platform, with the main focus on the virtual machine and its underlying operating system environments, we are able to point out its current limitations and, therefore, provide a hint on different perspectives of directions in order to make Android suitable for these environments. It is our position that Android may provide a suitable architecture for real-time embedded systems, but the real-time community should address its limitations in a joint effort at all of the platform layers.

LLF schedulability analysis on multiprocessor platforms

LLF (Least Laxity First) scheduling, which assigns a higher priority to a task with smaller laxity, has been known as an optimal preemptive scheduling algorithm on a single processor platform. However, its characteristics upon multiprocessor platforms have been little studied until now. Orthogonally, it has remained open how to efficiently schedule general task systems, including constrained deadline task systems, upon multiprocessors. Recent studies have introduced zero laxity (ZL) policy, which assigns a higher priority to a task with zero laxity, as a promising scheduling approach for such systems (e.g., EDZL). Towards understanding the importance of laxity in multiprocessor scheduling, this paper investigates the characteristics of ZL policy and presents the first ZL schedulability test for any work-conserving scheduling algorithm that employs this policy. It then investigates the characteristics of LLF scheduling, which also employs the ZL policy, and derives the first LLF-specific schedulability test on multiprocessors. It is shown that the proposed LLF test dominates the ZL test as well as the state-of-art EDZL test.