Dependable decentralized storage management for cloud computing

The MAP-i Doctoral Program of the Universities of Minho, Aveiro and Porto.

Polysaccharide-based freestanding multilayered membranes exhibiting reversible switchable properties

The design of self-standing multilayered structures based on biopolymers has been attracting increasing interest due to their potential in the biomedical field. However, their use has been limited due to their gel-like properties. Herein, we report the combination of covalent and ionic cross-linking, using natural and non-cytotoxic cross-linkers, such as genipin and calcium chloride (CaCl2). Combining both cross-linking types the mechanical properties of the multilayers increased and the water uptake ability decreased. The ionic cross-linking of multilayered chitosan (CHI)â alginate (ALG) films led to freestanding membranes with multiple interesting properties, such as: improved mechanical strength, calcium-induced adhesion and shape memory ability. The use of CaCl2 also offered the possibility of reversibly switching all of these properties by simple immersion in a chelate solution. We attribute the switch-ability of the mechanical properties, shape memory ability and the propensity for induced-adhesion to the ionic cross-linking of the multilayers. These findings suggested the potential of the developed polysaccharide freestanding membranes in a plethora of research fields, including in biomedical and biotechnological fields.

Immersiveness of ubiquitous computing environments prototypes: A case study

The development of ubiquitous computing (ubicomp) environments raises several challenges in terms of their evaluation. Ubicomp virtual reality prototyping tools enable users to experience the system to be developed and are of great help to face those challenges, as they support developers in assessing the consequences of a design decision in the early phases of development. Given the situated nature of ubicomp environments, a particular issue to consider is the level of realism provided by the prototypes. This work presents a case study where two ubicomp prototypes, featuring different levels of immersion (desktop-based versus CAVE-based), were developed and compared. The goal was to determine the cost/benefits relation of both solutions, which provided better user experience results, and whether or not simpler solutions provide the same user experience results as more elaborate one.

Inactivación reversible de la NR: Aislamiento y caracterización de la proteína inactivante de hojas de avena

La fosforilación reversible de proteínas, catalizadas por protein-kinasas y protein fosfatasas es uno de los principales modos de regulación metabólica en plantas. Entre las enzimas cuya actividad es modulada por procesos de fosforilación reversible está la nitrato reductasa (NR) de plantas superiores. Estos procesos son los responsables de la inactivación reversible de la NR de hojas, observada in vivo, durante la transición luz-oscuridad, correspondiendo la forma fosforilada a la enzima inactiva y la defosforilada a la máxima actividad. Se ha demostrado que la inactivación por fosforilación de la NR sólo es detectada en presencia de cationes divalentes libres y de una proteína inactivante (FI), que ha sido aislada y caracterizada en dictiledóneas. Los datos disponibles permiten suponer que esta proteína existe también en monocotiledóneas, pero hasta el momento esto no ha sido comprobado. El objeto del trabajo es determinar si este FI es de ocurrencia generalizada, por lo que se tratará de aislarlo y caracterizarlo en hojas de avena, donde también fue demostrada la inactivación por fosforilación de la NR.

Filososofía y Ciencia Computacional: Aspectos epistemológicos, ontológicos y metodológicos. Philosophy and Computing Sciencs: Epistemological, Ontological and Methodological Aspects.

Uno de los temas centrales del proyecto concierne la naturaleza de la ciencia de la computación. La reciente aparición de esta disciplina sumada a su origen híbrido como ciencia formal y disciplina tecnológica hace que su caracterización aún no esté completa y menos aún acordada entre los científicos del área. En el trabajo Three paradigms of Computer Science de A. Eden, se presentan tres posiciones admitidamente exageradas acerca de como entender tanto el objeto de estudio (ontología) como los métodos de trabajo (metodología) y la estructura de la teoría y las justificaciones del conocimiento informático (epistemología): La llamada racionalista, la cual se basa en la idea de que los programas son fórmulas lógicas y que la forma de trabajo es deductiva, la tecnocrática que presenta a la ciencia computacional como una disciplina ingenieril y la ahi llamada científica, la cual asimilaría a la computación a las ciencias empíricas. Algunos de los problemas de ciencia de la computación están relacionados con cuestiones de filosofía de la matemática, en particular la relación entre las entidades abstractas y el mundo. Sin embargo, el carácter prescriptivo de los axiomas y teoremas de las teorías de la programación puede permitir interpretaciones alternativas y cuestionaría fuertemente la posibilidad de pensar a la ciencia de la computación como una ciencia empírica, al menos en el sentido tradicional. Por otro lado, es posible que el tipo de análisis aplicado a las ciencias de la computación propuesto en este proyecto aporte nuevas ideas para pensar problemas de filosofía de la matemática. Un ejemplo de estos posibles aportes puede verse en el trabajo de Arkoudas Computers, Justi?cation, and Mathematical Knowledge el cual echa nueva luz al problema del significado de las demostraciones matemáticas.Los objetivos del proyecto son: Caracterizar el campo de las ciencias de la computación.Evaluar los fundamentos ontológicos, epistemológicos y metodológicos de la ciencia de la computación actual.Analizar las relaciones entre las diferentes perspectivas heurísticas y epistémicas y las practicas de la programación.

monitoring-based approach to object-oriented real-time computing

Monitoring, object-orientation, real-time, execution-time, scheduling

Quadratic perturbations of a quadratic reversible Lotka-Volterra System

"Vegeu el resum a l'inici del document del fitxer adjunt."

Bifurcations of homoclinic tangency in two-dimensional area-preserving and reversible maps

Report for the scientific sojourn at the Research Institute for Applied Mathematics and Cybernetics, Nizhny Novgorod, Russia, from July to September 2006. Within the project, bifurcations of orbit behavior in area-preserving and reversible maps with a homoclinic tangency were studied. Finitely smooth normal forms for such maps near saddle fixed points were constructed and it was shown that they coincide in the main order with the analytical Birkhoff-Moser normal form. Bifurcations of single-round periodic orbits for two-dimensional symplectic maps close to a map with a quadratic homoclinic tangency were studied. The existence of one- and two-parameter cascades of elliptic periodic orbits was proved.

Myoclonies chez une personne très âgée; une cause fréquente et réversible [Myoclonia in an oldest old woman: a frequent and reversible etiology]

A 98-year-old woman was referred to our hospital because of myoclonia. The concentration of calcium and vitamin D in the serum was low. In this context, we concluded of neuromuscular irritability secondary to hypocalcaemia. The symptoms disappeared after a treatment of intravenous calcium. This case shows how important it is to investigate electrolytes in case of neuromuscular irritability symptoms in elderly people.

Plataforma Computing@home

En este proyecto se han visto dos sistemas de computación distribuida diferentes entre ellos: Condor y BOINC. Se exploran las posibilidades para poder conseguir que ambos sistemas logren trabajar conjuntamente, escogiendo la parte más efectiva de cada uno de los sistemas con el fin de complementarse.

Reversible behavioural autistic-like regression: A manifestation of a special (new?) epileptic syndrome in a 28-month-old child. A 2-year longitudinal study .

A 28-month-old boy was referred for acute onset of abnormal head movements. History revealed an insidious progressive regression in behaviour and communication over several months. Head and shoulder 'spasms' with alteration of consciousness and on one occasion ictal laughter were seen. The electroencephalograph (EEG) showed repeated bursts of brief generalized polyspikes and spike-wave during the 'spasms', followed by flattening, a special pattern which never recurred after treatment. Review of family videos showed a single 'minor' identical seizure 6 months previously. Magnetic resonance imaging was normal. Clonazepam brought immediate cessation of seizures, normalization of the EEG and a parallel spectacular improvement in communication, mood and language. Follow-up over the next 10 months showed a new regression unaccompained by recognized seizures, although numerous seizures were discovered during the videotaped neuropsychological examination, when stereotyped subtle brief paroxysmal changes in posture and behaviour could be studied in slow motion and compared with the 'prototypical' initial ones. The EEG showed predominant rare left-sided fronto-temporal discharges. Clonazepam was changed to carbamazepin with marked improvement in behaviour, language and cognition which has been sustained up to the last control at 51 months. Videotaped home observations allowed the documentation of striking qualitative and quantitative variations in social interaction and play of autistic type in relation to the epileptic activity. We conclude that this child has a special characteristic epileptic syndrome with subtle motor and vegetative symptomatology associated with an insidious catastrophic 'autistic-like' regression which could be overlooked. The methods used to document such fluctuating epileptic behavioural manifestations are discussed.

Computing Markov-Perfect Optimal Policies in Business-Cycle Models

Time-inconsistency is an essential feature of many policy problems (Kydland and Prescott, 1977). This paper presents and compares three methods for computing Markov-perfect optimal policies in stochastic nonlinear business cycle models. The methods considered include value function iteration, generalized Euler-equations, and parameterized shadow prices. In the context of a business cycle model in which a scal authority chooses government spending and income taxation optimally, while lacking the ability to commit, we show that the solutions obtained using value function iteration and generalized Euler equations are somewhat more accurate than that obtained using parameterized shadow prices. Among these three methods, we show that value function iteration can be applied easily, even to environments that include a risk-sensitive scal authority and/or inequality constraints on government spending. We show that the risk-sensitive scal authority lowers government spending and income-taxation, reducing the disincentive households face to accumulate wealth.

Monitorització d'alt nivell per a el computing de l'experiment ATLAS (LHC)

Aquest projecte descriu la fusió de les necessitats diaries de monitorització del experiment ATLAS des del punt de vista del cloud. La idea principal es desenvolupar un conjunt de col·lectors que recullin informació de la distribució i processat de les dades i dels test de wlcg (Service Availability Monitoring), emmagatzemant-la en BBDD específiques per tal de mostrar els resultats en una sola pàgina HLM (High Level Monitoring). Un cop aconseguit, l’aplicació ha de permetre investigar més enllà via interacció amb el front-end, el qual estarà alimentat per les estadístiques emmagatzemades a la BBDD.

Computing hypergraph width measures exactly

Hypergraph width measures are a class of hypergraph invariants important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. A connection between these and tree decompositions is established. This enables us to almost seamlessly adapt the combinatorial and algorithmic results known for tree decompositions of graphs to the case of hypergraphs and obtain fast exact algorithms. As a consequence, we provide algorithms which, given a hypergraph H on n vertices and m hyperedges, compute the generalized hypertree-width of H in time O*(2n) and compute the fractional hypertree-width of H in time O(1.734601n.m).1