A new approach to the initial value problem

5th Portuguese Conference on Automatic Control, September, 5-7, 2002, Aveiro, Portugal

On divisors of pseudovarieties generated by some classes of full transformation semigroups

Algebra Colloquium, 15 (2008), p. 581–588

Partial classification of Lorenz knots: Syllable permutations of torus knots words

We define families of aperiodic words associated to Lorenz knots that arise naturally as syllable permutations of symbolic words corresponding to torus knots. An algorithm to construct symbolic words of satellite Lorenz knots is defined. We prove, subject to the validity of a previous conjecture, that Lorenz knots coded by some of these families of words are hyperbolic, by showing that they are neither satellites nor torus knots and making use of Thurston's theorem. Infinite families of hyperbolic Lorenz knots are generated in this way, to our knowledge, for the first time. The techniques used can be generalized to study other families of Lorenz knots.

Algorithms for time series clustering applied to biomedical signals

Thesis submitted in the fulfillment of the requirements for the Degree of Master in Biomedical Engineering

The present situation regarding lymphatic filariasis in Cabo de Santo Agostinho, Pernambuco, Northeast Brazil

A cross-sectional population-based survey on the occurrence of lymphatic filariasis was carried out in the municipality of Cabo de Santo Agostinho, Pernambuco, Northeast Brazil. 7,650 individuals of both sexes were examined (from 1,416 households) of whom six tested positive for microfilaria according to the thick blood diagnostic test. The age of the individuals examined varied from 0 to 98 (averaging 26.6 years), whilst the age of the microfilaria-positive individuals varied from 11 to 29, averaging 22.5 years. Five of the six positive cases were male. These cases were residents of the following areas: Pista Preta (one case); Ponte dos Carvalhos (four cases); and Pontezinha (one case). This last case from Pontezinha was autochthonous. Of the individuals examined, 109 (1.4%) cited complaints relating to filariasis. These results suggest that filariasis is being transmitted in the municipality of Cabo de Santo Agostinho, a finding that establishes the need to carry out disease control activities, and to collaborate with the planning of the national programme for the elimination of filariasis.

Interictal Spike EEG Source Analysis in Hypothalamic Hamartoma Epilepsy

Objective: The epilepsy associated with the hypothalamic hamartomas constitutes a syndrome with peculiar seizures, usually refractory to medical therapy, mild cognitive delay, behavioural problems and multifocal spike activity in the scalp electroencephalogram (EEG). The cortical origin of spikes has been widely assumed but not specifically demonstrated. Methods: We present results of a source analysis of interictal spikes from 4 patients (age 2–25 years) with epilepsy and hypothalamic hamartoma, using EEG scalp recordings (32 electrodes) and realistic boundary element models constructed from volumetric magnetic resonance imaging (MRIs). Multifocal spike activity was the most common finding, distributed mainly over the frontal and temporal lobes. A spike classification based on scalp topography was done and averaging within each class performed to improve the signal to noise ratio. Single moving dipole models were used, as well as the Rap-MUSIC algorithm. Results: All spikes with good signal to noise ratio were best explained by initial deep sources in the neighbourhood of the hamartoma, with late sources located in the cortex. Not a single patient could have his spike activity explained by a combination of cortical sources. Conclusions: Overall, the results demonstrate a consistent origin of spike activity in the subcortical region in the neighbourhood of the hamartoma, with late spread to cortical areas.

An existence result for discontinuous games

We introduce a notion of upper semicontinuity, weak upper semicontinuity, and show that it, together with a weak form of payoff security, is enough to guarantee the existence of Nash equilibria in compact, quasiconcave normal form games. We show that our result generalizes the pure strategy existence theorem of Dasgupta and Maskin (1986) and that it is neither implied nor does it imply the existence theorems of Baye, Tian, and Zhou (1993) and Reny (1999). Furthermore, we show that an equilibrium may fail to exist when, while maintaining weak payoff security, weak upper semicontinuity is weakened to reciprocal upper semicontinuity.

A nanopore-based stochastic detection method: Single molecule characterisation of nanoparticles using ()- hemolysin

Dissertation presented to obtain the Ph.D degree in Chemistry.

Development of a satellite based PM10 concentration product for urban areas

Dissertação para obtenção do Grau de Doutor em Engenharia do Ambiente

Evaluation of motor neuron excitability by CMAP scanning with modulated current

It is important to have better evaluation and understanding of the motor neuron physiology, with the goal to early and objectively diagnose and treat patients with neurodegenerative pathologies. The Compound Muscle Action Potential (CMAP) scan is a non-invasive diagnosis technique for neurodegenerative pathologies, such as ALS, and enables a quick analysis of the muscle action potentials in response to motor nerve stimulation. This work aims to study the influence of different pulse modulated waveforms in peripheral nerve excitability by CMAP scan technique on healthy subjects. A total of 13 healthy subjects were submitted to the same test. The stimuli were applied in the medium nerve on the right wrist and electromyography signal collected on the Abductor Pollicis Brevis (APB) muscle surface on the right thumb. Stimulation was performed with an increasing intensities range from 4 to 30 mA, with varying steps, 3 stimuli per step. The procedure was repeated 4 times per subject, each repetition using a different single pulse stimulation waveform: monophasic square, monophasic triangular, monophasic quadratic and biphasic square. Results were retrieved from the averaging of the stimuli on each current intensity step. The square pulse needs less current intensity to generate the same response amplitude regarding the other waves and presents a more steep curve slope and this effect is gradually decreasing for the triangular and quadratic pulse,respectively, being the difference even more evident regarding the biphasic pulse. The control of the waveform stimulation pulse allows varying the stimulusresponse curve slope.

Mapping numbers onto space in preschool children and adults

Tese de Doutoramento em Psicologia - Especialidade em Psicologia Experimental e Ciências Cognitivas

On simple bounds for eigenvalues of symmetric tridiagonal matrices

How much can be said about the location of the eigenvalues of a symmetric tridiagonal matrix just by looking at its diagonal entries? We use classical results on the eigenvalues of symmetric matrices to show that the diagonal entries are bounds for some of the eigenvalues regardless of the size of the off-diagonal entries. Numerical examples are given to illustrate that our arithmetic-free technique delivers useful information on the location of the eigenvalues.

Flow updating: fault-tolerant aggregation for dynamic networks

Documento submetido para revisão pelos pares. A publicar em Journal of Parallel and Distributed Computing. ISSN 0743-7315

Refinement in hybridised institutions

Hybrid logics, which add to the modal description of transition structures the ability to refer to specific states, offer a generic framework to approach the specification and design of reconfigurable systems, i.e., systems with reconfiguration mechanisms governing the dynamic evolution of their execution configurations in response to both external stimuli or internal performance measures. A formal representation of such systems is through transition structures whose states correspond to the different configurations they may adopt. Therefore, each node is endowed with, for example, an algebra, or a first-order structure, to precisely characterise the semantics of the services provided in the corresponding configuration. This paper characterises equivalence and refinement for these sorts of models in a way which is independent of (or parametric on) whatever logic (propositional, equational, fuzzy, etc) is found appropriate to describe the local configurations. A Hennessy–Milner like theorem is proved for hybridised logics.

Sistemas de Tipos para Verificación de Programas Concurrentes. Type Systems for Concurrent Programs Verification.

La programación concurrente es una tarea difícil aún para los más experimentados programadores. Las investigaciones en concurrencia han dado como resultado una gran cantidad de mecanismos y herramientas para resolver problemas de condiciones de carrera de datos y deadlocks, problemas que surgen por el mal uso de los mecanismos de sincronización. La verificación de propiedades interesantes de programas concurrentes presenta dificultades extras a los programas secuenciales debido al no-determinismo de su ejecución, lo cual resulta en una explosión en el número de posibles estados de programa, haciendo casi imposible un tratamiento manual o aún con la ayuda de computadoras. Algunos enfoques se basan en la creación de lenguajes de programación con construcciones con un alto nivel de abstración para expresar concurrencia y sincronización. Otros enfoques tratan de desarrollar técnicas y métodos de razonamiento para demostrar propiedades, algunos usan demostradores de teoremas generales, model-checking o algortimos específicos sobre un determinado sistema de tipos. Los enfoques basados en análisis estático liviano utilizan técnicas como interpretación abstracta para detectar ciertos tipos de errores, de una manera conservativa. Estas técnicas generalmente escalan lo suficiente para aplicarse en grandes proyectos de software pero los tipos de errores que pueden detectar es limitada. Algunas propiedades interesantes están relacionadas a condiciones de carrera y deadlocks, mientras que otros están interesados en problemas relacionados con la seguridad de los sistemas, como confidencialidad e integridad de datos. Los principales objetivos de esta propuesta es identificar algunas propiedades de interés a verificar en sistemas concurrentes y desarrollar técnicas y herramientas para realizar la verificación en forma automática. Para lograr estos objetivos, se pondrá énfasis en el estudio y desarrollo de sistemas de tipos como tipos dependientes, sistema de tipos y efectos, y tipos de efectos sensibles al flujo de datos y control. Estos sistemas de tipos se aplicarán a algunos modelos de programación concurrente como por ejemplo, en Simple Concurrent Object-Oriented Programming (SCOOP) y Java. Además se abordarán propiedades de seguridad usando sistemas de tipos específicos. Concurrent programming has remained a dificult task even for very experienced programmers. Concurrency research has provided a rich set of tools and mechanisms for dealing with data races and deadlocks that arise of incorrect use of synchronization. Verification of most interesting properties of concurrent programs is a very dificult task due to intrinsic non-deterministic nature of concurrency, resulting in a state explosion which make it almost imposible to be manually treat and it is a serious challenge to do that even with help of computers. Some approaches attempts create programming languages with higher levels of abstraction for expressing concurrency and synchronization. Other approaches try to develop reasoning methods to prove properties, either using general theorem provers, model-checking or specific algorithms on some type systems. The light-weight static analysis approach apply techniques like abstract interpretation to find certain kind of bugs in a conservative way. This techniques scale well to be applied in large software projects but the kind of bugs they may find are limited. Some interesting properties are related to data races and deadlocks, while others are interested in some security problems like confidentiality and integrity of data. The main goals of this proposal is to identify some interesting properties to verify in concurrent systems and develop techniques and tools to do full automatic verification. The main approach will be the application of type systems, as dependent types, type and effect systems, and flow-efect types. Those type systems will be applied to some models for concurrent programming as Simple Concurrent Object-Oriented Programming (SCOOP) and Java. Other goals include the analysis of security properties also using specific type systems.