Desarrollo de interfases con transferencia controlada de especies moviles. Síntesis, caracterizacion y aplicaciones. Development of Interphases with Controlled Transference of Mobile Species. Synthesis, Characterization and Applications.

Se propone sintetizar nuevos materiales como bloques de construcción de estructuras en escala nanometrica o micrométrica: nanotubos de carbono funcionalizados; nanopartículas metálicas; hidrogeles inteligentes; carbones mesoporosos. Con ellos se construiran interfaces solido/liquido estructuradas: multicapas autoensambladas, patrones micrométricos con heterogeneidad tridimensional y estructuras jerárquicas. Se estudiara el intercambio de especies móviles en las interfaces usando técnicas electroquímicas, espectroelectroquimicas, ópticas y de microscopia. De esta manera se podran controlar el intercambio en esa interface. En base a este conocimientos se desarrollaran aplicaciones tecnológicas tales como sensores de oligonucletidos, microceldas de combustible, arreglos de microelectrodos y supercapacitores.

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

middleware for cooperating mobile embedded systems

Mobile embedded systems, wireless communication, real-time systems, real-time scheduling, communication protocols, cooperation, reliability and fault-tolerance, middleware

Gradient injection in preparative chromatography : exploitation of sample solvents different than the mobile phase

Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2010

Best-Practice - Mobile Testing Viewing mobile usability studies with the example of an eyetracking study in the retail sector

Today, usability testing in the development of software and systems is essential. A stationary usability lab offers many different possibilities in the evaluation of usability, but it reaches its limits in terms of flexibility and the experimental conditions. Mobile usability studies consider consciously outside influences, and these studies require a specially adapted approach to preparation, implementation and evaluation. Using the example of a mobile eye tracking study the difficulties and the opportunities of mobile testing are considered.

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.

Devolution & Entrenched Household Poverty: Is Scotland less mobile?

The Scottish National Party led Scottish Government has identified household poverty as a key focus for its anti-poverty strategy. The government’s ‘Solidarity Target’ seeks to both increase wealth and increase the share of total income gained by these three deciles. The ability to demonstrate the advantages of policy divergence within Scotland, relative to the other parts of the United Kingdom, is central to the Government’s aim of gaining support for increased powers for the devolved government. This paper seeks to provide evidence on one aspect of the government’s anti- poverty strategy; the degree to which Scotland differs from the rest of the UK over levels of entrenched poverty. The paper demonstrates that not only does Scotland have greater entrenched poverty but that the changes in mobility since the 1990s have impacted on Scotland to a lesser degree than the rest of the UK.

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.

Mobile termination and mobile penetration

In this paper, we study how access pricing affects network competition when subscription demand is elastic and each network uses non-linear prices and can apply termination-based price discrimination. In the case of a fixed per minute termination charge, we find that a reduction of the termination charge below cost has two opposing effects: it softens competition but helps to internalize network externalities. The former reduces mobile penetration while the latter boosts it. We find that firms always prefer termination charge below cost for either motive while the regulator prefers termination below cost only when this boosts penetration. Next, we consider the retail benchmarking approach (Jeon and Hurkens, 2008) that determines termination charges as a function of retail prices and show that this approach allows the regulator to increase penetration without distorting call volumes.

Mobile termination, network externalities, and consumer expectations

We re-examine the literature on mobile termination in the presence of network externalities. Externalities arise when firms discriminate between on- and off-net calls or when subscription demand is elastic. This literature predicts that profit decreases and consumer surplus increases in termination charge in a neighborhood of termination cost. This creates a puzzle since in reality we see regulators worldwide pushing termination rates down while being opposed by network operators. We show that this puzzle is resolved when consumers' expectations are assumed passive but required to be fulfilled in equilibrium (as defined by Katz and Shapiro, AER 1985), instead of being rationally responsive to non-equilibrium prices, as assumed until now.

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