Comparative analysis of time-frequency methods estimating the time-varying microstructure of sleep EEG spindles

Proceedings of the Information Technology Applications in Biomedicine, Ioannina - Epirus, Greece, October 26-28, 2006

Potential dementia biomarkers based on the time-varying microstructure of sleep EEG spindles

Proceedings of the 29th Annual International Conference of the IEEE EMBS Cité Internationale, Lyon, France August 23-26, 2007

Real Time Internet DGPS Service

The accuracy of the Navigation Satellite Timing and Ranging (NAVSTAR) Global Positioning System (GPS) measurements is insufficient for many outdoor navigation tasks. As a result, in the late nineties, a new methodology – the Differential GPS (DGPS) – was developed. The differential approach is based on the calculation and dissemination of the range errors of the GPS satellites received. GPS/DGPS receivers correlate the broadcasted GPS data with the DGPS corrections, granting users increased accuracy. DGPS data can be disseminated using terrestrial radio beacons, satellites and, more recently, the Internet. Our goal is to provide mobile platforms within our campus with DGPS data for precise outdoor navigation. To achieve this objective, we designed and implemented a three-tier client/server distributed system that establishes Internet links with remote DGPS sources and performs campus-wide dissemination of the obtained data. The Internet links are established between data servers connected to remote DGPS sources and the client, which is the data input module of the campus-wide DGPS data provider. The campus DGPS data provider allows the establishment of both Intranet and wireless links within the campus. This distributed system is expected to provide adequate support for accurate (submetric) outdoor navigation tasks.

Study of the rheology of self-compacting concrete with fine recycled concrete aggregates

This work studies the effect of incorporating fine recycled aggregates on the rheology of self-compacting concrete over time (at 15,45 and 90 min). The fine fraction of the natural aggregates was replaced at 0%, 20%, 50% and 100% with recycled sand. The fresh-state properties were studied by empirical tests (slump-flow, J-Ring, L-Box) and fundamental ones in an ICAR rheometer. The mixes with 50% and 100% recycled sand lost their SCC characteristics at 90 min. Contrarily the mix with 20% replacement maintained suitable passing and filling ability. The causes of this trend were an initial increase of plastic viscosity and afterwards an increase of yield stress. The compressive strength of the 50% and 100% replacement mixes decreased significantly and that of the 20% replacement mix less than 10%. (C) 2015 Elsevier Ltd. All rights reserved.

Pliocene-quaternary upwelling in the SoutheasternAtlantic may reflect changes in water mass production

Proceedings of tile 1" R.C.A.N.S. Congress, Lisboa, October 1992

The Neogene of Algarve (Portugal)

A synthesis about the Neogene and Quaternary of Algarve (Southern Portugal) is presented. New isotopic 87Sr/86Sr ages as well as biostratigraphic data about the Miocene deposits allow to present a new stratigraphic frame for the previously characterized units. The Lagos-Portimão Formation corresponds to deposits of temperate carbonate platform sedimentological type, developed during a long time span (Lower Burdigalian to Upper Serravallian). A major change in sedimentation conditions (carbonate to siliciclastic environments) occurred in the Lower Tortonian with the deposition of yellowish sands. Spongoliths rich in microfossils are represented in Algarve inland. Their age is not well established; calcareous nannofossils indicate the CN5a zone (Upper Serravallian) while foraminifera point out at least Nl6 zone (Lower Tortonian). In the Upper Tortonian, the sedimentation is widespread in Eastern Algarve, related with the Guadalquivir Basin infill. The deposits begin with detrital limestones, locally very rich in Heterostegina, passing to fossiliferous conglomerates and siltstones (Cacela Formation). Coarse-grained conglomerates at Galvana (Faro) pose some age problems. K/Ar age on glauconite indicates 6.72±0.17 Ma. However, glauconites may be reworked from older deposits (Cacela Formation). The Galvana Conglomerate could be related to Pliocene deposits are not well characterized. Olhos de Água sands, with a thin marine intercalation rich in marine vertebrates (fishes, a crocodile, cetaceans, sirenians), may be Upper Pliocene; however, the vertebrates point out to a Serravallian to Tortonian age. 87Sr/86Sr ages on oysters from above the level with vertebrates point out to 3.0(+2.5-1.0) Ma. Similar sand deposits occur at Morgadinho (Luz de Tavira). These sands are overlain by marls, lignite clays, lacustrine limestones and a silty calcareous crust. A small mammals association indicate an age span between Upper Pliocene and Lower Middle Pleistocene (MN17-MN20). A Biharian mammal fauna (Lower Pleistocene) was collected at Algoz in similar deposits. In the present state of knowledge, Morgadinho and Algoz deposits may be correlative.

Multiple Linear Regression and Artificial Neural Networks to Predict Time and Efficiency of Soil Vapor Extraction

The prediction of the time and the efficiency of the remediation of contaminated soils using soil vapor extraction remain a difficult challenge to the scientific community and consultants. This work reports the development of multiple linear regression and artificial neural network models to predict the remediation time and efficiency of soil vapor extractions performed in soils contaminated separately with benzene, toluene, ethylbenzene, xylene, trichloroethylene, and perchloroethylene. The results demonstrated that the artificial neural network approach presents better performances when compared with multiple linear regression models. The artificial neural network model allowed an accurate prediction of remediation time and efficiency based on only soil and pollutants characteristics, and consequently allowing a simple and quick previous evaluation of the process viability.

Real-time scheduling with resource sharing on heterogeneous multiprocessors

Consider the problem of scheduling a task set τ of implicit-deadline sporadic tasks to meet all deadlines on a t-type heterogeneous multiprocessor platform where tasks may access multiple shared resources. The multiprocessor platform has m k processors of type-k, where k∈{1,2,…,t}. The execution time of a task depends on the type of processor on which it executes. The set of shared resources is denoted by R. For each task τ i , there is a resource set R i ⊆R such that for each job of τ i , during one phase of its execution, the job requests to hold the resource set R i exclusively with the interpretation that (i) the job makes a single request to hold all the resources in the resource set R i and (ii) at all times, when a job of τ i holds R i , no other job holds any resource in R i . Each job of task τ i may request the resource set R i at most once during its execution. A job is allowed to migrate when it requests a resource set and when it releases the resource set but a job is not allowed to migrate at other times. Our goal is to design a scheduling algorithm for this problem and prove its performance. We propose an algorithm, LP-EE-vpr, which offers the guarantee that if an implicit-deadline sporadic task set is schedulable on a t-type heterogeneous multiprocessor platform by an optimal scheduling algorithm that allows a job to migrate only when it requests or releases a resource set, then our algorithm also meets the deadlines with the same restriction on job migration, if given processors 4×(1+MAXP×⌈|P|×MAXPmin{m1,m2,…,mt}⌉) times as fast. (Here MAXP and |P| are computed based on the resource sets that tasks request.) For the special case that each task requests at most one resource, the bound of LP-EE-vpr collapses to 4×(1+⌈|R|min{m1,m2,…,mt}⌉). To the best of our knowledge, LP-EE-vpr is the first algorithm with proven performance guarantee for real-time scheduling of sporadic tasks with resource sharing on t-type heterogeneous multiprocessors.

Efficient schedulability tests for real-time embedded systems with urgent routines

Task scheduling is one of the key mechanisms to ensure timeliness in embedded real-time systems. Such systems have often the need to execute not only application tasks but also some urgent routines (e.g. error-detection actions, consistency checkers, interrupt handlers) with minimum latency. Although fixed-priority schedulers such as Rate-Monotonic (RM) are in line with this need, they usually make a low processor utilization available to the system. Moreover, this availability usually decreases with the number of considered tasks. If dynamic-priority schedulers such as Earliest Deadline First (EDF) are applied instead, high system utilization can be guaranteed but the minimum latency for executing urgent routines may not be ensured. In this paper we describe a scheduling model according to which urgent routines are executed at the highest priority level and all other system tasks are scheduled by EDF. We show that the guaranteed processor utilization for the assumed scheduling model is at least as high as the one provided by RM for two tasks, namely 2(2√−1). Seven polynomial time tests for checking the system timeliness are derived and proved correct. The proposed tests are compared against each other and to an exact but exponential running time test.

Juggling time concepts: complex metanarrative in Alejandro González Iñárritu’s 21 Grams

ABSTRACT - Starting with the explanation of metanarrative as a sort of self-reflexive storytelling (as defended by Kenneth Weaver Hope in his unpublished PhD. thesis), I propose to talk about enunciative practices that stress the telling more than the told. In line with some metaficcional practices applied to cinema, such as the ‘mindfuck’ film (Jonathan Eig, 2003), the ‘psychological puzzle film’ (Elliot Panek, 2003) and the ‘mind-game film’ (Thomas Elsaesser, 2009), I will address the manipulations that a narrative film endures in order to produce a more fruitful and complex experience for the viewer. I will particularly concentrate on the misrepresentation of time as a way to produce a labyrinthine work of fiction where the linear description of events is replaced by a game of time disclosure. The viewer is thus called upon to reconstruct the order of the various situations portrayed in a process that I call ‘temporal mapping’. However, as the viewer attempts to do this, the film, ironically, because of the intricate nature of the plot and the uncertain status of the characters, resists the attempt. There is a sort of teasing taking place between the film and its spectator: an invitation of decoding that is half-denied until the end, where the puzzle is finally solved. I will use three of Alejandro Iñárritu’s films to better convey my point: Amores perros (2000), 21 Grams (2003) and Babel (2006). I will consider Iñárritu’s methods to produce a non-linear storytelling as a way to stress the importance of time and its validity as one of the elements that make up for a metanarrative experience in films. I will focus especially on 21 Grams, which I consider to be a paragon of the labyrinth.

Maximum level and time to peak of dam-break waves on mobile horizontal bed

Journal of Hydraulic Engineering, Vol. 135, No. 11, November 1, 2009

System-on-chip field-programmable gate array design for onboard real-time hyperspectral unmixing

Hyperspectral instruments have been incorporated in satellite missions, providing large amounts of data of high spectral resolution of the Earth surface. This data can be used in remote sensing applications that often require a real-time or near-real-time response. To avoid delays between hyperspectral image acquisition and its interpretation, the last usually done on a ground station, onboard systems have emerged to process data, reducing the volume of information to transfer from the satellite to the ground station. For this purpose, compact reconfigurable hardware modules, such as field-programmable gate arrays (FPGAs), are widely used. This paper proposes an FPGA-based architecture for hyperspectral unmixing. This method based on the vertex component analysis (VCA) and it works without a dimensionality reduction preprocessing step. The architecture has been designed for a low-cost Xilinx Zynq board with a Zynq-7020 system-on-chip FPGA-based on the Artix-7 FPGA programmable logic and tested using real hyperspectral data. Experimental results indicate that the proposed implementation can achieve real-time processing, while maintaining the methods accuracy, which indicate the potential of the proposed platform to implement high-performance, low-cost embedded systems, opening perspectives for onboard hyperspectral image processing.

Changes in pentobarbital induced sleeping-time in mice infected with Schistosoma mansoni and immunosuppressed

To evaluate whether the intensity of the hepatic granulomatous response induced by S. mansoni eggs plays a role in drug metabolism, mice were infected with 40 cercariae and tested to assess the sodic pentobarbital induced sleeping-time. To decrease the inflammatory reaction the animals were irradiated with 400 Rad or received azathioprine, 20mg/kg, 3 times a week, for 4 weeks, respectively in or beginning in the 33th post-infection day. In infected animals receiving azathioprine the area of the hepatic granulomas was smaller and the sleeping-time was similar to that of non-infected ones (controls). In mice infected and irradiated the granuloma dimensions were similar to those of animals only infected, in these two latter groups of animals, the sleeping-time was more prolonged than that of the control animals. These results show that: 1) mice with unaltered hepatic granulomatous reaction show reduction in metabolism of sodic pentobarbital; 2) granulomatous response diminished by azathioprine does not interfere with the capacity of metabolism of the anesthetic drug.

Energy resources management in three distinct time horizons considering a large variation in wind power

The intensive use of distributed generation based on renewable resources increases the complexity of power systems management, particularly the short-term scheduling. Demand response, storage units and electric and plug-in hybrid vehicles also pose new challenges to the short-term scheduling. However, these distributed energy resources can contribute significantly to turn the shortterm scheduling more efficient and effective improving the power system reliability. This paper proposes a short-term scheduling methodology based on two distinct time horizons: hour-ahead scheduling, and real-time scheduling considering the point of view of one aggregator agent. In each scheduling process, it is necessary to update the generation and consumption operation, and the storage and electric vehicles status. Besides the new operation condition, more accurate forecast values of wind generation and consumption are available, for the resulting of short-term and very short-term methods. In this paper, the aggregator has the main goal of maximizing his profits while, fulfilling the established contracts with the aggregated and external players.

Contextual Intelligent Load Management Considering Real-Time Pricing in a Smart Grid Environment

The use of demand response programs enables the adequate use of resources of small and medium players, bringing high benefits to the smart grid, and increasing its efficiency. One of the difficulties to proceed with this paradigm is the lack of intelligence in the management of small and medium size players. In order to make demand response programs a feasible solution, it is essential that small and medium players have an efficient energy management and a fair optimization mechanism to decrease the consumption without heavy loss of comfort, making it acceptable for the users. This paper addresses the application of real-time pricing in a house that uses an intelligent optimization module involving artificial neural networks.