Synaptic depression and slow oscillatory activity in a biophysical network model of the cerebral cortex

Short-term synaptic depression (STD) is a form of synaptic plasticity that has a large impact on network computations. Experimental results suggest that STD is modulated by cortical activity, decreasing with activity in the network and increasing during silent states. Here, we explored different activity-modulation protocols in a biophysical network model for which the model displayed less STD when the network was active than when it was silent, in agreement with experimental results. Furthermore, we studied how trains of synaptic potentials had lesser decay during periods of activity (UP states) than during silent periods (DOWN states), providing new experimental predictions. We next tackled the inverse question of what is the impact of modifying STD parameters on the emergent activity of the network, a question difficult to answer experimentally. We found that synaptic depression of cortical connections had a critical role to determine the regime of rhythmic cortical activity. While low STD resulted in an emergent rhythmic activity with short UP states and long DOWN states, increasing STD resulted in longer and more frequent UP states interleaved with short silent periods. A still higher synaptic depression set the network into a non-oscillatory firing regime where DOWN states no longer occurred. The speed of propagation of UP states along the network was not found to be modulated by STD during the oscillatory regime; it remained relatively stable over a range of values of STD. Overall, we found that the mutual interactions between synaptic depression and ongoing network activity are critical to determine the mechanisms that modulate cortical emergent patterns.

Rockfall detection from LIDAR point clouds: A clustering approach using R

The analysis of rockfall characteristics and spatial distribution is fundamental to understand and model the main factors that predispose to failure. In our study we analysed LiDAR point clouds aiming to: (1) detect and characterise single rockfalls; (2) investigate their spatial distribution. To this end, different cluster algorithms were applied: 1a) Nearest Neighbour Clutter Removal (NNCR) in combination with the Expectation?Maximization (EM) in order to separate feature points from clutter; 1b) a density based algorithm (DBSCAN) was applied to isolate the single clusters (i.e. the rockfall events); 2) finally we computed the Ripley's K-function to investigate the global spatial pattern of the extracted rockfalls. The method allowed proper identification and characterization of more than 600 rockfalls occurred on a cliff located in Puigcercos (Catalonia, Spain) during a time span of six months. The spatial distribution of these events proved that rockfall were clustered distributed at a welldefined distance-range. Computations were carried out using R free software for statistical computing and graphics. The understanding of the spatial distribution of precursory rockfalls may shed light on the forecasting of future failures.

Organización de la reanimación cardiopulmonar intrahospitalaria. Situación actual en España.

La parada cardiorrespiratoria (PCR) dentro del hospital es considerada una emergencia vital y está demostrado que existe una relación directa entre la respuesta asistencial y la mortalidad asociada a este evento. Los resultados del tratamiento de la PCR son un indicador de calidad de los centros sanitarios. En el caso en concreto de España, la mayoría de hospitales no disponen de un sistema organizado e integral de atención a la PCR. A pesar de los avances en medicina y tecnológicos, la tasa de supervivencia no ha variado significativamente en los últimos 30 años por lo que se ha de considerar como un problema social, económico y sanitario de gran magnitud que cabe abordar con todas las herramientas disponibles. Objetivos: Conocer cómo se organiza la reanimación cardiopulmonar (RCP) dentro del hospital y conocer los planes integrales de RCP publicados por los hospitales españoles. Metodología: Se realiza una revisión de la literatura a través de las bibliotecas indexadas Pubmed y Web of Science mediante criterios de inclusión/exclusión, uso de operadores booleanos y búsqueda bibliográfica manual. Además se realiza una entrevista a un médico referente nacional en la investigación sobre RCP. Resultados: Se han encontrado 7 planes integrales para la atención a la PCR y solo 2 de ellos están avalados por el Plan Nacional de RCP (PNRCP), miembro del Consejo Español de RCP (CERCP). Conclusiones: Existe una falta de publicaciones por parte de los hospitales españoles sobre planes integrales para la organización de la RCP que cumplan los criterios de calidad necesarios. Si bien todos los hospitales disponen de protocolos propios dirigidos a sus profesionales para la actuación en caso de PCR, estos son de uso interno y solo tienen en común entre ellos el hecho de seguir las recomendaciones de las guías del European Resuscitation Council (ERC). III Es necesario que los centros sanitarios fomenten y compartan su actividad investigadora sobre el tema. Palabras clave: parada cardíaca hospitalaria, resucitación cardiopulmonar, Plan hospitalario de resucitación.

Prosessitietokoneen käytön kehittäminen Mertaniemen voimalaitoksella

Mertaniemen voimalaitoksien prosessitietokone (PTK) on uusittu keväällä 2005. Tämän työn tarkoituksena on ollut auttaa PTK:n virheiden korjaamisessa ja puut-teiden kartoittamisessa. Työssä on keskitytty etenkin prosessiraportoinnin tekemiseen. Työn alussa on kerrottu Mertaniemen voimalaitoksen tekniset tiedot ja PTK:n hankinnan taustatietoja. Uudesta PTK-järjestelmästä on kuvattu laitteisto, sovellus ja perusohjelmistot. PTK:n ja muiden järjestelmien välinen tiedonsiirto on myös kuvattu. PTK muuttujien nimeäminen on esitelty, jotta olisi helpompi hahmottaa työssä käytettyjen positioiden merkityksiä. Prosessiraportoinnin kehittämisessä kuvataan raporttien tarvetta ja niiden sisältöä sekä sitä kuinka raportit on tehty. Päästöraportointi on esitetty omana osa-alueenaan, koska voimalaitosten päästöjen seurantaa edellytetään tehtävän viran¬omaismääräysten ja EU-direktiivien vaatimusten mukaisesti. Raporttien lisäksi prosessiarvojen seuraamista helpottamaan on tehty yhteisiä trendi- ja työtilanäyttöjä. PTK:n ongelmakohtina on käsitelty muuttujien tunnuksissa ja nimissä olevat virheet sekä PTK laskennan tarkastaminen. Muuttujien nimien ja laskennan tarkas¬tusta tehtiin prosessiraportoinnin tekemisen yhteydessä sekä yhteistyössä PTK-järjestelmän toimittaneen Metso Automation Oy:n kanssa. Päästölaskennan korjaaminen oli erityisen tärkeää.

La influència dels continguts numèrics a l’hora de realitzar estratègies de càlcul mental

En aquesta recerca es presenta l’anàlisi de les estratègies que usen els alumnes de 4t de primària de l’escola Barnola d’Avinyó per a resoldre operacions de suma amb nombres de fins a dues xifres. A més, permet observar la seva evolució després d’haver dut a terme una unitat didàctica orientada a treballar i millorar de manera manipulativa i dinàmica, al llarg de set setmanes, els continguts numèrics. Per tant, amb els resultats obtinguts podem valorar si el fet de treballar continguts numèrics influencia en l’ús d’estratègies de càlcul mental i contrastar-ho amb diferents autors destacats en aquest àmbit.

A Write-Based Solver for SAT Modulo the Theory of Arrays

The extensional theory of arrays is one of the most important ones for applications of SAT Modulo Theories (SMT) to hardware and software verification. Here we present a new T-solver for arrays in the context of the DPLL(T) approach to SMT. The main characteristics of our solver are: (i) no translation of writes into reads is needed, (ii) there is no axiom instantiation, and (iii) the T-solver interacts with the Boolean engine by asking to split on equality literals between indices. As far as we know, this is the first accurate description of an array solver integrated in a state-of-the-art SMT solver and, unlike most state-of-the-art solvers, it is not based on a lazy instantiation of the array axioms. Moreover, it is very competitive in practice, specially on problems that require heavy reasoning on array literals

Radiative Heat Transfer in Boiler Furnaces

Better models are needed for radiative heat transfer in boiler furnaces. If the process is known better, combustion in the furnace can be optimized to produce low emissions. It makes the process to be environmental friendly. Furthermore, if there is a better model of the furnace it can more fully explain what is happening inside the furnace. Using of the model one can quickly and easily analyze how it operates with bio fuels, moist fuels or difficult fuels and improve the operation. Models helps with better estimation of furnace dimensions and result in more accurate understanding of operation. Key component lacking in these models is radiative heat transfer in particle laden gases. If there are no particles than radiative heat transfer can be calculated approximately. There are two problems with current models when used with flow modeling. The first one is a need to account for a particle laden gas and the second one is an absence of a fast algorithm. Fast calculation is needed if radiative heat transfer calculation is done for a large CDF model. Computations slow down if time is required for calculating radiative properties over and over again. This thesis presents a band model for radiative heat transfer in boiler furnaces. Advantage is a quickness of calculation and account of particles in the process.

Quimiometria II: planilhas eletrônicas para cálculos de planejamentos experimentais, um tutorial

This work describes, through examples, a simple way to carry out experimental design calculations applying an spreadsheets. The aim of this tutorial is to introduce an alternative to sophisticated commercial programs that normally are too complex in data input and output. An overview of the principal methods is also briefly presented. The spreadsheets are suitable to handle different types of computations such as screening procedures applying factorial design and the optimization procedure based on response surface methodology. Furthermore, the spreadsheets are sufficiently versatile to be adapted to specific experimental designs.

One, two, or many mechanisms? The brain's processing of complex words

The heated debate over whether there is only a single mechanism or two mechanisms for morphology has diverted valuable research energy away from the more critical questions about the neural computations involved in the comprehension and production of morphologically complex forms. Cognitive neuroscience data implicate many brain areas. All extant models, whether they rely on a connectionist network or espouse two mechanisms, are too underspecified to explain why more than a few brain areas differ in their activity during the processing of regular and irregular forms. No one doubts that the brain treats regular and irregular words differently, but brain data indicate that a simplistic account will not do. It is time for us to search for the critical factors free from theoretical blinders.

An Engineering Solution for using Coarse Meshes in the Simulation of Delamination with Cohesive Zone Models

This paper presents a methodology to determine the parameters used in the simulation of delamination in composite materials using decohesion finite elements. A closed-form expression is developed to define the stiffness of the cohesive layer. A novel procedure that allows the use of coarser meshes of decohesion elements in large-scale computations is proposed. The procedure ensures that the energy dissipated by the fracture process is correctly computed. It is shown that coarse-meshed models defined using the approach proposed here yield the same results as the models with finer meshes normally used in the simulation of fracture processes

On Undecidable Dynamical Properties of Reversible One-Dimensional Cellular Automata

Cellular automata are models for massively parallel computation. A cellular automaton consists of cells which are arranged in some kind of regular lattice and a local update rule which updates the state of each cell according to the states of the cell's neighbors on each step of the computation. This work focuses on reversible one-dimensional cellular automata in which the cells are arranged in a two-way in_nite line and the computation is reversible, that is, the previous states of the cells can be derived from the current ones. In this work it is shown that several properties of reversible one-dimensional cellular automata are algorithmically undecidable, that is, there exists no algorithm that would tell whether a given cellular automaton has the property or not. It is shown that the tiling problem of Wang tiles remains undecidable even in some very restricted special cases. It follows that it is undecidable whether some given states will always appear in computations by the given cellular automaton. It also follows that a weaker form of expansivity, which is a concept of dynamical systems, is an undecidable property for reversible one-dimensional cellular automata. It is shown that several properties of dynamical systems are undecidable for reversible one-dimensional cellular automata. It shown that sensitivity to initial conditions and topological mixing are undecidable properties. Furthermore, non-sensitive and mixing cellular automata are recursively inseparable. It follows that also chaotic behavior is an undecidable property for reversible one-dimensional cellular automata.

Trustworthy context dependency in ubiquitous systems

The modern society is getting increasingly dependent on software applications. These run on processors, use memory and account for controlling functionalities that are often taken for granted. Typically, applications adjust the functionality in response to a certain context that is provided or derived from the informal environment with various qualities. To rigorously model the dependence of an application on a context, the details of the context are abstracted and the environment is assumed stable and fixed. However, in a context-aware ubiquitous computing environment populated by autonomous agents, a context and its quality parameters may change at any time. This raises the need to derive the current context and its qualities at runtime. It also implies that a context is never certain and may be subjective, issues captured by the context’s quality parameter of experience-based trustworthiness. Given this, the research question of this thesis is: In what logical topology and by what means may context provided by autonomous agents be derived and formally modelled to serve the context-awareness requirements of an application? This research question also stipulates that the context derivation needs to incorporate the quality of the context. In this thesis, we focus on the quality of context parameter of trustworthiness based on experiences having a level of certainty and referral experiences, thus making trustworthiness reputation based. Hence, in this thesis we seek a basis on which to reason and analyse the inherently inaccurate context derived by autonomous agents populating a ubiquitous computing environment in order to formally model context-awareness. More specifically, the contribution of this thesis is threefold: (i) we propose a logical topology of context derivation and a method of calculating its trustworthiness, (ii) we provide a general model for storing experiences and (iii) we formalise the dependence between the logical topology of context derivation and its experience-based trustworthiness. These contributions enable abstraction of a context and its quality parameters to a Boolean decision at runtime that may be formally reasoned with. We employ the Action Systems framework for modelling this. The thesis is a compendium of the author’s scientific papers, which are republished in Part II. Part I introduces the field of research by providing the mending elements for the thesis to be a coherent introduction for addressing the research question. In Part I we also review a significant body of related literature in order to better illustrate our contributions to the research field.

Numbers and Languages

The thesis presents results obtained during the authors PhD-studies. First systems of language equations of a simple form consisting of just two equations are proved to be computationally universal. These are systems over unary alphabet, that are seen as systems of equations over natural numbers. The systems contain only an equation X+A=B and an equation X+X+C=X+X+D, where A, B, C and D are eventually periodic constants. It is proved that for every recursive set S there exists natural numbers p and d, and eventually periodic sets A, B, C and D such that a number n is in S if and only if np+d is in the unique solution of the abovementioned system of two equations, so all recursive sets can be represented in an encoded form. It is also proved that all recursive sets cannot be represented as they are, so the encoding is really needed. Furthermore, it is proved that the family of languages generated by Boolean grammars is closed under injective gsm-mappings and inverse gsm-mappings. The arguments apply also for the families of unambiguous Boolean languages, conjunctive languages and unambiguous languages. Finally, characterizations for morphisims preserving subfamilies of context-free languages are presented. It is shown that the families of deterministic and LL context-free languages are closed under codes if and only if they are of bounded deciphering delay. These families are also closed under non-codes, if they map every letter into a submonoid generated by a single word. The family of unambiguous context-free languages is closed under all codes and under the same non-codes as the families of deterministic and LL context-free languages.

An experimental/numerical study of the turbulent boundary layer development along a surface with a sudden change in roughness

A theory for the description of turbulent boundary layer flows over surfaces with a sudden change in roughness is considered. The theory resorts to the concept of displacement in origin to specify a wall function boundary condition for a kappa-epsilon model. An approximate algebraic expression for the displacement in origin is obtained from the experimental data by using the chart method of Perry and Joubert(J.F.M., vol. 17, pp. 193-122, 1963). This expression is subsequently included in the near wall logarithmic velocity profile, which is then adopted as a boundary condition for a kappa-epsilon modelling of the external flow. The results are compared with the lower atmospheric observations made by Bradley(Q. J. Roy. Meteo. Soc., vol. 94, pp. 361-379, 1968) as well as with velocity profiles extracted from a set of wind tunnel experiments carried out by Avelino et al.( 7th ENCIT, 1998). The measurements are found to be in good agreement with the theoretical computations. The skin-friction coefficient was calculated according to the chart method of Perry and Joubert(J.F.M., vol. 17, pp. 193-122, 1963) and to a balance of the integral momentum equation. In particular, the growth of the internal boundary layer thickness obtained from the numerical simulation is compared with predictions of the experimental data calculated by two methods, the "knee" point method and the "merge" point method.

Numerical study of wedge supported oblique shock wave-oblique detonation wave transitions

The results of a numerical study of premixed Hydrogen-air flows ignition by an oblique shock wave (OSW) stabilized by a wedge are presented, in situations when initial and boundary conditions are such that transition between the initial OSW and an oblique detonation wave (ODW) is observed. More precisely, the objectives of the paper are: (i) to identify the different possible structures of the transition region that exist between the initial OSW and the resulting ODW and (ii) to evidence the effect on the ODW of an abrupt decrease of the wedge angle in such a way that the final part of the wedge surface becomes parallel to the initial flow. For such a geometrical configuration and for the initial and boundary conditions considered, the overdriven detonation supported by the initial wedge angle is found to relax towards a Chapman-Jouguet detonation in the region where the wedge surface is parallel to the initial flow. Computations are performed using an adaptive, unstructured grid, finite volume computer code previously developed for the sake of the computations of high speed, compressible flows of reactive gas mixtures. Physico-chemical properties are functions of the local mixture composition, temperature and pressure, and they are computed using the CHEMKIN-II subroutines.