LNT: a logical neighbor tree secure group communication scheme for wireless sensor networks

Secure group communication is a paradigm that primarily designates one-to-many communication security. The proposed works relevant to secure group communication have predominantly considered the whole network as being a single group managed by a central powerful node capable of supporting heavy communication, computation and storage cost. However, a typical Wireless Sensor Network (WSN) may contain several groups, and each one is maintained by a sensor node (the group controller) with constrained resources. Moreover, the previously proposed schemes require a multicast routing support to deliver the rekeying messages. Nevertheless, multicast routing can incur heavy storage and communication overheads in the case of a wireless sensor network. Due to these two major limitations, we have reckoned it necessary to propose a new secure group communication with a lightweight rekeying process. Our proposal overcomes the two limitations mentioned above, and can be applied to a homogeneous WSN with resource-constrained nodes with no need for a multicast routing support. Actually, the analysis and simulation results have clearly demonstrated that our scheme outperforms the previous well-known solutions.

Building a microscope for the data center

Managing the physical and compute infrastructure of a large data center is an embodiment of a Cyber-Physical System (CPS). The physical parameters of the data center (such as power, temperature, pressure, humidity) are tightly coupled with computations, even more so in upcoming data centers, where the location of workloads can vary substantially due, for example, to workloads being moved in a cloud infrastructure hosted in the data center. In this paper, we describe a data collection and distribution architecture that enables gathering physical parameters of a large data center at a very high temporal and spatial resolutionof the sensor measurements. We think this is an important characteristic to enable more accurate heat-flow models of the data center andwith them, _and opportunities to optimize energy consumption. Havinga high resolution picture of the data center conditions, also enables minimizing local hotspots, perform more accurate predictive maintenance (pending failures in cooling and other infrastructure equipment can be more promptly detected) and more accurate billing. We detail this architecture and define the structure of the underlying messaging system that is used to collect and distribute the data. Finally, we show the results of a preliminary study of a typical data center radio environment.

WCET analysis considering contention on memory bus in COTS-based multicores

The usage of COTS-based multicores is becoming widespread in the field of embedded systems. Providing realtime guarantees at design-time is a pre-requisite to deploy real-time systems on these multicores. This necessitates the consideration of the impact of the contention due to shared low-level hardware resources on the Worst-Case Execution Time (WCET) of the tasks. As a step towards this aim, this paper first identifies the different factors that make the WCET analysis a challenging problem in a typical COTS-based multicore system. Then, we propose and prove, a mathematically correct method to determine tight upper bounds on the WCET of the tasks, when they are co-scheduled on different cores.

Response time analysis of COTS-Based multicores considering the contention on the shared memory bus

The current industry trend is towards using Commercially available Off-The-Shelf (COTS) based multicores for developing real time embedded systems, as opposed to the usage of custom-made hardware. In typical implementation of such COTS-based multicores, multiple cores access the main memory via a shared bus. This often leads to contention on this shared channel, which results in an increase of the response time of the tasks. Analyzing this increased response time, considering the contention on the shared bus, is challenging on COTS-based systems mainly because bus arbitration protocols are often undocumented and the exact instants at which the shared bus is accessed by tasks are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. This paper makes three contributions towards analyzing tasks scheduled on COTS-based multicores. Firstly, we describe a method to model the memory access patterns of a task. Secondly, we apply this model to analyze the worst case response time for a set of tasks. Although the required parameters to obtain the request profile can be obtained by static analysis, we provide an alternative method to experimentally obtain them by using performance monitoring counters (PMCs). We also compare our work against an existing approach and show that our approach outperforms it by providing tighter upper-bound on the number of bus requests generated by a task.

Analysis of temperature time-series: embedding dynamics into the MDS method

Global warming and the associated climate changes are being the subject of intensive research due to their major impact on social, economic and health aspects of the human life. Surface temperature time-series characterise Earth as a slow dynamics spatiotemporal system, evidencing long memory behaviour, typical of fractional order systems. Such phenomena are difficult to model and analyse, demanding for alternative approaches. This paper studies the complex correlations between global temperature time-series using the Multidimensional scaling (MDS) approach. MDS provides a graphical representation of the pattern of climatic similarities between regions around the globe. The similarities are quantified through two mathematical indices that correlate the monthly average temperatures observed in meteorological stations, over a given period of time. Furthermore, time dynamics is analysed by performing the MDS analysis over slices sampling the time series. MDS generates maps describing the stations’ locus in the perspective that, if they are perceived to be similar to each other, then they are placed on the map forming clusters. We show that MDS provides an intuitive and useful visual representation of the complex relationships that are present among temperature time-series, which are not perceived on traditional geographic maps. Moreover, MDS avoids sensitivity to the irregular distribution density of the meteorological stations.

Analysis of financial indices by means of the windowed Fourier transform

The goal of this study is to analyze the dynamical properties of financial data series from nineteen worldwide stock market indices (SMI) during the period 1995–2009. SMI reveal a complex behavior that can be explored since it is available a considerable volume of data. In this paper is applied the window Fourier transform and methods of fractional calculus. The results reveal classification patterns typical of fractional order systems.

Les acanthopleurocératinés portugais et leurs relations avec les formes subboréales

The evolution of the Portuguese Acanthopleuroceratinae is similar to the celto-souabe succession such as it was described in the collects of the Cottards (Cher, France). A subspecies of one of the oldest Acanthopleuroceras (A. carinatum atlanticum) is abundant in the lower part of the Portuguese Ibex zone; this form is described here. The species is recognized in France by several nuclei associated with A. arietiforme (Cottards-22). Generally the similarity between the successive French and Portuguese populations (A. maugenesti, A. valdani, A. alisiense, junior synonym of A. lepidum TUTCHER and TRUEMAN, 1925), is very good. This fact suggests their specific identity. It is typical for A. lepidum of which the greatest populations allow the biometric comparaisons. In Portugal, the mesogean Tropidaceras are missing. This absence of the subboreal Acanthopleuroceras ancestors suggests the straight celto-souabe derivation of the Portuguese Acanthopleuroceras and not a similar local evolution. A. lepidum the last Acanthopleuroceras reaches the western coast of Canada (British Columbia) probably by the Arctic ocean.

Les ostracodes du Miocène inférieur de la region de Lisbonne (basin du Tage)

Forty-five species of ostracoda from the Aquitanian of the Lisbon area, belonging in thirty-two genera, are presented. These are the first species belonging to this group reported for the Miocene formations in Portugal. Ostracoda assemblages are typical of fresh water, brackish and marine environments (littoral and inner continental shelf). References are made to the stratigraphically more significant species. Data on the paleoenvironments are also presented. A list of the studied species includes a comparison with their distribution in the Aquitaine and Rhone Miocene basins.

O Caloviano do flanco norte do Guilhim (Algarve oriental): biostratigrafia e paleobiogeografia

Stratigraphical study of Telheiro and Cancela sections (northern slope of Guilhim hill) allowed its dating: these may be reported to the Lower Callovian, as ammonite associations typical of Rehmanni and Pictava horizons have been collected there. Hence Gracilis zone can be recognized in Algarve. Ammonites are also associated to Dinoflagellates. These microfossils have been found for the first time in the Callovian of Portugal. Callovian paleogeogtaphy is reapprised, and the limits between mesogean submediterranean and mediterranean provinces are more accurately recognized. Algarve belongs to the mediterranean province according to the typically mesogean character of the fauna where Phylloceratidae are dominant.

sMapReduce: a programming pattern for wireless sensor networks

Wireless Sensor Networks (WSNs) are increasingly used in various application domains like home-automation, agriculture, industries and infrastructure monitoring. As applications tend to leverage larger geographical deployments of sensor networks, the availability of an intuitive and user friendly programming abstraction becomes a crucial factor in enabling faster and more efficient development, and reprogramming of applications. We propose a programming pattern named sMapReduce, inspired by the Google MapReduce framework, for mapping application behaviors on to a sensor network and enabling complex data aggregation. The proposed pattern requires a user to create a network-level application in two functions: sMap and Reduce, in order to abstract away from the low-level details without sacrificing the control to develop complex logic. Such a two-fold division of programming logic is a natural-fit to typical sensor networking operation which makes sensing and topological modalities accessible to the user.

A pseudo-medium-wide 8-competitive interface for two-level compositional real-time scheduling of constrained- deadline sporadic tasks on a uniprocessor

Compositional real-time scheduling clearly requires that ”normal” real-time scheduling challenges are addressed but challenges intrinsic to compositionality must be addressed as well, in particular: (i) how should interfaces be described? and (ii) how should numerical values be assigned to parameters constituting the interfaces? The real-time systems community has traditionally used narrow interfaces for describing a component (for example, a utilization/bandwidthlike metric and the distribution of this bandwidth in time). In this paper, we introduce the concept of competitive ratio of an interface and show that typical narrow interfaces cause poor performance for scheduling constrained-deadline sporadic tasks (competitive ratio is infinite). Therefore, we explore more expressive interfaces; in particular a class called medium-wide interfaces. For this class, we propose an interface type and show how the parameters of the interface should be selected. We also prove that this interface is 8-competitive.

Microfacies studies of carbonate rocks from Jurassic outcrops in the north of Faro, Southern Portugal

The Middle and Upper Jurassique limestones investigated were sub-divided into nine microfacies (MF) types. The firsts four represent Bathonian sediments with shallow water characteristics typical for carbonate platforms. They are comparable with Wilson's facies zones 6 to 8. Reef and reef debris, near-shore clastic-dominated limestones are not present. These MF-types are reiterated several times without cyclicity. The vertical development of the differentiated facies units indicates a close interfingering. The microfacies data are typical of inter to shallow subtidal environments; both authigenous quartz and low faunal and floral diversity of several layers point to temporary restricted conditions. The occurrence of Dictyoconus cayeuxi LUCAS and Callovian ammonites from the above lying strata argue for a Bathonian age. The MF-types 5-9 (Oxfordian-Kimmeridgian) show completely different sedimentation conditions. Fully marine nearshore recifal limestones alternate with pelagic sediments formed at deeper shelf areas. The pelagic micritic limestones of Oxfordian age are characterized by allodapic intercalations whereas the Oxfordian/Kimmeridgian limestones with tuberolithic fabrics often show intensive silifications. Only initial patch reef growth-stages were reached during the development of the Oxfordian and Kimmeridgian shallow water limestones.

Online robust optimization framework for QoS guarantees in distributed soft real-time systems

In distributed soft real-time systems, maximizing the aggregate quality-of-service (QoS) is a typical system-wide goal, and addressing the problem through distributed optimization is challenging. Subtasks are subject to unpredictable failures in many practical environments, and this makes the problem much harder. In this paper, we present a robust optimization framework for maximizing the aggregate QoS in the presence of random failures. We introduce the notion of K-failure to bound the effect of random failures on schedulability. Using this notion we define the concept of K-robustness that quantifies the degree of robustness on QoS guarantee in a probabilistic sense. The parameter K helps to tradeoff achievable QoS versus robustness. The proposed robust framework produces optimal solutions through distributed computations on the basis of Lagrangian duality, and we present some implementation techniques. Our simulation results show that the proposed framework can probabilistically guarantee sub-optimal QoS which remains feasible even in the presence of random failures.

An approach to health and safety in E.U. forestry operations – Hazards and preventive measures

Forestry in general and logging in particular continue to be among the three most hazardous sectors in European countries. The aim of this article is to characterize health and safety problems and solutions in E.U. forestry operations, and particularly in Portuguese operations. Forest types, production, employment and ownership are used to characterize the forest sector. Forestry accidents and health problems data are mentioned. Typical hazards associated to the nature of logging operations are systematized. Preventive measures, focused on a wide spectrum of measures, making safety considerations an integral feature of all operational activities from planning to organization to execution and supervision of work are emphasized in this article.

Monitoring chlorophyll-a with remote sensing techniques in the Tagus Estuary

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Gestão e Sistemas Ambientais