Modelling of chloride transport in non-saturated concrete : from microscale to macroscale

Corrosion of steel bars embedded in concrete has a great influence on structural performance and durability of reinforced concrete. Chloride penetration is considered to be a primary cause of concrete deterioration in a vast majority of structures. Therefore, modelling of chloride penetration into concrete has become an area of great interest. The present work focuses on modelling of chloride transport in concrete. The differential macroscopic equations which govern the problem were derived from the equations at the microscopic scale by comparing the porous network with a single equivalent pore whose properties are the same as the average properties of the real porous network. The resulting transport model, which accounts for diffusion, migration, advection, chloride binding and chloride precipitation, consists of three coupled differential equations. The first equation models the transport of chloride ions, while the other two model the flow of the pore water and the heat transfer. In order to calibrate the model, the material parameters to determine experimentally were identified. The differential equations were solved by means of the finite element method. The classical Galerkin method was employed for the pore solution flow and the heat transfer equations, while the streamline upwind Petrov Galerkin method was adopted for the transport equation in order to avoid spatial instabilities for advection dominated problems. The finite element codes are implemented in Matlab® . To retrieve a good understanding of the influence of each variable and parameter, a detailed sensitivity analysis of the model was carried out. In order to determine the diffusive and hygroscopic properties of the studied concretes, as well as their chloride binding capacity, an experimental analysis was performed. The model was successfully compared with experimental data obtained from an offshore oil platform located in Brazil. Moreover, apart from the main objectives, numerous results were obtained throughout this work. For instance, several diffusion coefficients and the relation between them are discussed. It is shown how the electric field set up between the ionic species depends on the gradient of the species’ concentrations. Furthermore, the capillary hysteresis effects are illustrated by a proposed model, which leads to the determination of several microstructure properties, such as the pore size distribution and the tortuosity-connectivity of the porous network. El fenómeno de corrosión del acero de refuerzo embebido en el hormigón ha tenido gran influencia en estructuras de hormigón armado, tanto en su funcionalidad estructural como en aspectos de durabilidad. La penetración de cloruros en el interior del hormigón esta considerada como el factor principal en el deterioro de la gran mayoría de estructuras. Por lo tanto, la modelización numérica de dicho fenómeno ha generado gran interés. El presente trabajo de investigación se centra en la modelización del transporte de cloruros en el interior del hormigón. Las ecuaciones diferenciales que gobiernan los fenómenos a nivel macroscópico se deducen de ecuaciones planteadas a nivel microscópico. Esto se obtiene comparando la red porosa con un poro equivalente, el cual mantiene las mismas propiedades de la red porosa real. El modelo está constituido por tres ecuaciones diferenciales acopladas que consideran el transporte de cloruros, el flujo de la solución de poro y la transferencia de calor. Con estas ecuaciones se tienen en cuenta los fenómenos de difusión, migración, advección, combinación y precipitación de cloruros. El análisis llevado a cabo en este trabajo ha definido los parámetros necesarios para calibrar el modelo. De acuerdo con ellas, se seleccionaron los ensayos experimentales a realizar. Las ecuaciones diferenciales se resolvieron mediante el método de elementos finitos. El método clásico de Galerkin se empleó para solucionar las ecuaciones de flujo de la solución de poro y de la transferencia de calor, mientras que el método streamline upwind Petrov-Galerkin se utilizó para resolver la ecuación de transporte de cloruros con la finalidad de evitar inestabilidades espaciales en problemas con advección dominante. El código de elementos finitos está implementado en Matlab® . Con el objetivo de facilitar la comprensión del grado de influencia de cada variable y parámetro, se realizó un análisis de sensibilidad detallado del modelo. Se llevó a cabo una campaña experimental sobre los hormigones estudiados, con el objeto de obtener sus propiedades difusivas, químicas e higroscópicas. El modelo se contrastó con datos experimentales obtenidos en una plataforma petrolera localizada en Brasil. Las simulaciones numéricas corroboraron los datos experimentales. Además, durante el desarrollo de la investigación se obtuvieron resultados paralelos a los planteados inicialmente. Por ejemplo, el análisis de diferentes coeficientes de difusión y la relación entre ellos. Así como también se observó que el campo eléctrico establecido entre las especies iónicas disueltas en la solución de poro depende del gradiente de concentración de las mismas. Los efectos de histéresis capilar son expresados por el modelo propuesto, el cual conduce a la determinación de una serie de propiedades microscópicas, tales como la distribución del tamaño de poro, además de la tortuosidad y conectividad de la red porosa.

Prion crystalization model and its application to recognition pattern

This paper introduces APA (?Artificial Prion Assembly?): a pattern recognition system based on artificial prion crystalization. Specifically, the system exhibits the capability to classify patterns according to the resulting prion self- assembly simulated with cellular automata. Our approach is inspired in the biological process of proteins aggregation, known as prions, which are assembled as amyloid fibers related with neurodegenerative disorders.

Community Structure in Soil Porous System

Diffusion controls the gaseous transport process in soils when advective transport is almost null. Knowledge of the soil structure and pore connectivity are critical issues to understand and modelling soil aeration, sequestration or emission of greenhouse gasses, volatilization of volatile organic chemicals among other phenomena. In the last decades these issues increased our attention as scientist have realize that soil is one of the most complex materials on the earth, within which many biological, physical and chemical processes that support life and affect climate change take place. A quantitative and explicit characterization of soil structure is difficult because of the complexity of the pore space. This is the main reason why most theoretical approaches to soil porosity are idealizations to simplify this system. In this work, we proposed a more realistic attempt to capture the complexity of the system developing a model that considers the size and location of pores in order to relate them into a network. In the model we interpret porous soils as heterogeneous networks where pores are represented by nodes, characterized by their size and spatial location, and the links representing flows between them. In this work we perform an analysis of the community structure of porous media of soils represented as networks. For different real soils samples, modelled as heterogeneous complex networks, spatial communities of pores have been detected depending on the values of the parameters of the porous soil model used. These types of models are named as Heterogeneous Preferential Attachment (HPA). Developing an exhaustive analysis of the model, analytical solutions are obtained for the degree densities and degree distribution of the pore networks generated by the model in the thermodynamic limit and shown that the networks exhibit similar properties to those observed in other complex networks. With the aim to study in more detail topological properties of these networks, the presence of soil pore community structures is studied. The detection of communities of pores, as groups densely connected with only sparser connections between groups, could contribute to understand the mechanisms of the diffusion phenomena in soils.

Self-organizing cultured neural networks: Image analysis techniques for longitudinal tracking and modeling of the underlying network structure

Esta tesis estudia la evolución estructural de conjuntos de neuronas como la capacidad de auto-organización desde conjuntos de neuronas separadas hasta que forman una red (clusterizada) compleja. Esta tesis contribuye con el diseño e implementación de un algoritmo no supervisado de segmentación basado en grafos con un coste computacional muy bajo. Este algoritmo proporciona de forma automática la estructura completa de la red a partir de imágenes de cultivos neuronales tomadas con microscopios de fase con una resolución muy alta. La estructura de la red es representada mediante un objeto matemático (matriz) cuyos nodos representan a las neuronas o grupos de neuronas y los enlaces son las conexiones reconstruidas entre ellos. Este algoritmo extrae también otras medidas morfológicas importantes que caracterizan a las neuronas y a las neuritas. A diferencia de otros algoritmos hasta el momento, que necesitan de fluorescencia y técnicas inmunocitoquímicas, el algoritmo propuesto permite el estudio longitudinal de forma no invasiva posibilitando el estudio durante la formación de un cultivo. Además, esta tesis, estudia de forma sistemática un grupo de variables topológicas que garantizan la posibilidad de cuantificar e investigar la progresión de las características principales durante el proceso de auto-organización del cultivo. Nuestros resultados muestran la existencia de un estado concreto correspondiente a redes con configuracin small-world y la emergencia de propiedades a micro- y meso-escala de la estructura de la red. Finalmente, identificamos los procesos físicos principales que guían las transformaciones morfológicas de los cultivos y proponemos un modelo de crecimiento de red que reproduce el comportamiento cuantitativamente de las observaciones experimentales. ABSTRACT The thesis analyzes the morphological evolution of assemblies of living neurons, as they self-organize from collections of separated cells into elaborated, clustered, networks. In particular, it contributes with the design and implementation of a graph-based unsupervised segmentation algorithm, having an associated very low computational cost. The processing automatically retrieves the whole network structure from large scale phase-contrast images taken at high resolution throughout the entire life of a cultured neuronal network. The network structure is represented by a mathematical object (a matrix) in which nodes are identified neurons or neurons clusters, and links are the reconstructed connections between them. The algorithm is also able to extract any other relevant morphological information characterizing neurons and neurites. More importantly, and at variance with other segmentation methods that require fluorescence imaging from immunocyto- chemistry techniques, our measures are non invasive and entitle us to carry out a fully longitudinal analysis during the maturation of a single culture. In turn, a systematic statistical analysis of a group of topological observables grants us the possibility of quantifying and tracking the progression of the main networks characteristics during the self-organization process of the culture. Our results point to the existence of a particular state corresponding to a small-world network configuration, in which several relevant graphs micro- and meso-scale properties emerge. Finally, we identify the main physical processes taking place during the cultures morphological transformations, and embed them into a simplified growth model that quantitatively reproduces the overall set of experimental observations.

Self-organizing cultured neural networks: Image analysis techniques for longitudinal tracking and modeling of the underlying network structure (versión actualizada)

Esta tesis estudia la evolución estructural de conjuntos de neuronas como la capacidad de auto-organización desde conjuntos de neuronas separadas hasta que forman una red (clusterizada) compleja. Esta tesis contribuye con el diseño e implementación de un algoritmo no supervisado de segmentación basado en grafos con un coste computacional muy bajo. Este algoritmo proporciona de forma automática la estructura completa de la red a partir de imágenes de cultivos neuronales tomadas con microscopios de fase con una resolución muy alta. La estructura de la red es representada mediante un objeto matemático (matriz) cuyos nodos representan a las neuronas o grupos de neuronas y los enlaces son las conexiones reconstruidas entre ellos. Este algoritmo extrae también otras medidas morfológicas importantes que caracterizan a las neuronas y a las neuritas. A diferencia de otros algoritmos hasta el momento, que necesitan de fluorescencia y técnicas inmunocitoquímicas, el algoritmo propuesto permite el estudio longitudinal de forma no invasiva posibilitando el estudio durante la formación de un cultivo. Además, esta tesis, estudia de forma sistemática un grupo de variables topológicas que garantizan la posibilidad de cuantificar e investigar la progresión de las características principales durante el proceso de auto-organización del cultivo. Nuestros resultados muestran la existencia de un estado concreto correspondiente a redes con configuracin small-world y la emergencia de propiedades a micro- y meso-escala de la estructura de la red. Finalmente, identificamos los procesos físicos principales que guían las transformaciones morfológicas de los cultivos y proponemos un modelo de crecimiento de red que reproduce el comportamiento cuantitativamente de las observaciones experimentales. ABSTRACT The thesis analyzes the morphological evolution of assemblies of living neurons, as they self-organize from collections of separated cells into elaborated, clustered, networks. In particular, it contributes with the design and implementation of a graph-based unsupervised segmentation algorithm, having an associated very low computational cost. The processing automatically retrieves the whole network structure from large scale phase-contrast images taken at high resolution throughout the entire life of a cultured neuronal network. The network structure is represented by a mathematical object (a matrix) in which nodes are identified neurons or neurons clusters, and links are the reconstructed connections between them. The algorithm is also able to extract any other relevant morphological information characterizing neurons and neurites. More importantly, and at variance with other segmentation methods that require fluorescence imaging from immunocyto- chemistry techniques, our measures are non invasive and entitle us to carry out a fully longitudinal analysis during the maturation of a single culture. In turn, a systematic statistical analysis of a group of topological observables grants us the possibility of quantifying and tracking the progression of the main networks characteristics during the self-organization process of the culture. Our results point to the existence of a particular state corresponding to a small-world network configuration, in which several relevant graphs micro- and meso-scale properties emerge. Finally, we identify the main physical processes taking place during the cultures morphological transformations, and embed them into a simplified growth model that quantitatively reproduces the overall set of experimental observations.

A combined measure for quantifying and qualifying the topology preservation of growing self-organizing maps

The Self-OrganizingMap (SOM) is a neural network model that performs an ordered projection of a high dimensional input space in a low-dimensional topological structure. The process in which such mapping is formed is defined by the SOM algorithm, which is a competitive, unsupervised and nonparametric method, since it does not make any assumption about the input data distribution. The feature maps provided by this algorithm have been successfully applied for vector quantization, clustering and high dimensional data visualization processes. However, the initialization of the network topology and the selection of the SOM training parameters are two difficult tasks caused by the unknown distribution of the input signals. A misconfiguration of these parameters can generate a feature map of low-quality, so it is necessary to have some measure of the degree of adaptation of the SOM network to the input data model. The topologypreservation is the most common concept used to implement this measure. Several qualitative and quantitative methods have been proposed for measuring the degree of SOM topologypreservation, particularly using Kohonen's model. In this work, two methods for measuring the topologypreservation of the Growing Cell Structures (GCSs) model are proposed: the topographic function and the topology preserving map

Self-organizing Routing Algorithm fo Wireless Sensors Networks (WSN) using Ant Colony Optimization (ACO) with Tinyos.

This paper describes the basic tools to work with wireless sensors. TinyOShas a componentbased architecture which enables rapid innovation and implementation while minimizing code size as required by the severe memory constraints inherent in sensor networks. TinyOS's component library includes network protocols, distributed services, sensor drivers, and data acquisition tools ? all of which can be used asia or be further refined for a custom application. TinyOS was originally developed as a research project at the University of California Berkeley, but has since grown to have an international community of developers and users. Some algorithms concerning packet routing are shown. Incar entertainment systems can be based on wireless sensors in order to obtain information from Internet, but routing protocols must be implemented in order to avoid bottleneck problems. Ant Colony algorithms are really useful in such cases, therefore they can be embedded into the sensors to perform such routing task.

Heterogeneous Collaborative Sensor Network for Electrical Management of an Automated House with PV Energy

In this paper we present a heterogeneous collaborative sensor network for electrical management in the residential sector. Improving demand-side management is very important in distributed energy generation applications. Sensing and control are the foundations of the “Smart Grid” which is the future of large-scale energy management. The system presented in this paper has been developed on a self-sufficient solar house called “MagicBox” equipped with grid connection, PV generation, lead-acid batteries, controllable appliances and smart metering. Therefore, there is a large number of energy variables to be monitored that allow us to precisely manage the energy performance of the house by means of collaborative sensors. The experimental results, performed on a real house, demonstrate the feasibility of the proposed collaborative system to reduce the consumption of electrical power and to increase energy efficiency.

Simulation techniques for design of overhead conductor rail lines for speeds over 140 km/h

In overhead conductor rail lines, aluminium beams are usually mounted with support spacing between 8 and 12 meters, to limit the maximum vertical deflection in the center of the span. This small support spacing limits the use of overhead conductor rail to tunnels, therefore it has been used almost exclusively in metropolitan networks, with operation speeds below 110 km/h. Nevertheless, due to the lower cost of maintenance required for this electrification system, some railway administrations are beginning to install it in some tunnels on long-distance lines, requesting higher operation speeds [1]. Some examples are the Barcelona and Madrid suburban networks (Spain), and recent lines in Turkey and Malaysia. In order to adapt the design of the overhead conductor for higher speeds (V > 160 km/h), particular attention must be paid to the geometry of the conductor rail in critical zones as overlaps, crossings and, especially, transitions between conductor rail and conventional catenary, since the use of overhead conductor rail is limited to tunnels, as already mentioned. This paper describes simulation techniques developed in order to take into account these critical zones. Furthermore, some specific simulations results are presented that have been used to analyze and optimizes the geometry of this special zones to get a better current collection quality, in a real suburban network. This paper presents the work undertaken by the Railways Technology Research Centre (CITEF), having over 10 years of experience in railways research [1-4].

Fractal Behaviour and Irregularity of Wetting Fronts in Heterogeneous Porous Media

The wetting front is the zone where water invades and advances into an initially dry porous material and it plays a crucial role in solute transport through the unsaturated zone. Water is an essential part of the physiological process of all plants. Through water, necessary minerals are moved from the roots to the parts of the plants that require them. Water moves chemicals from one part of the plant to another. It is also required for photosynthesis, for metabolism and for transpiration. The leaching of chemicals by wetting fronts is influenced by two major factors, namely: the irregularity of the fronts and heterogeneity in the distribution of chemicals, both of which have been described by using fractal techniques. Soil structure can significantly modify infiltration rates and flow pathways in soils. Relations between features of soil structure and features of infiltration could be elucidated from the velocities and the structure of wetting fronts. When rainwater falls onto soil, it doesn?t just pool on surfaces. Water ?or another fluid- acts differently on porous surfaces. If the surface is permeable (porous) it seeps down through layers of soil, filling that layer to capacity. Once that layer is filled, it moves down into the next layer. In sandy soil, water moves quickly, while it moves much slower through clay soil. The movement of water through soil layers is called the the wetting front. Our research concerns the motion of a liquid into an initially dry porous medium. Our work presents a theoretical framework for studying the physical interplay between a stationary wetting front of fractal dimension D with different porous materials. The aim was to model the mass geometry interplay by using the fractal dimension D of a stationary wetting front. The plane corresponding to the image is divided in several squares (the minimum correspond to the pixel size) of size length ". We acknowledge the help of Prof. M. García Velarde and the facilities offered by the Pluri-Disciplinary Institute of the Complutense University of Madrid. We also acknowledge the help of European Community under project Multi-scale complex fluid flows and interfacial phenomena (PITN-GA-2008-214919). Thanks are also due to ERCOFTAC (PELNoT, SIG 14)

Community Structurein Soil Porous System.

Soil is well recognized as a highly complex system. The interaction and coupled physical, chemical, and biological processes and phenomena occurring in the soil environment at different spatial and temporal scales are the main reasons for such complexity. There is a need for appropriate methodologies to characterize soil porous systems with an interdisciplinary character. Four different real soil samples, presenting different textures, have been modeled as heterogeneous complex networks, applying a model known as the heterogeneous preferential attachment. An analytical study of the degree distributions in the soil model shows a multiscaling behavior in the connectivity degrees, leaving an empirically testable signature of heterogeneity in the topology of soil pore networks. We also show that the power-law scaling in the degree distribution is a robust trait of the soil model. Last, the detection of spatial pore communities, as densely connected groups with only sparser connections between them, has been studied for the first time in these soil networks. Our results show that the presence of these communities depends on the parameter values used to construct the network. These findings could contribute to understanding the mechanisms of the diffusion phenomena in soils, such as gas and water diffusion, development and dynamics of microorganisms, among others.

Air pollution data classification by SOM Neural Network

Over the last ten years, Salamanca has been considered among the most polluted cities in México. This paper presents a Self-Organizing Maps (SOM) Neural Network application to classify pollution data and automatize the air pollution level determination for Sulphur Dioxide (SO2) in Salamanca. Meteorological parameters are well known to be important factors contributing to air quality estimation and prediction. In order to observe the behavior and clarify the influence of wind parameters on the SO2 concentrations a SOM Neural Network have been implemented along a year. The main advantages of the SOM is that it allows to integrate data from different sensors and provide readily interpretation results. Especially, it is powerful mapping and classification tool, which others information in an easier way and facilitates the task of establishing an order of priority between the distinguished groups of concentrations depending on their need for further research or remediation actions in subsequent management steps. The results show a significative correlation between pollutant concentrations and some environmental variables.

Topology of a percolating soil pore network.

A connectivity function defined by the 3D-Euler number, is a topological indicator and can be related to hydraulic properties (Vogel and Roth, 2001). This study aims to develop connectivity Euler indexes as indicators of the ability of soils for fluid percolation. The starting point was a 3D grey image acquired by X-ray computed tomography of a soil at bulk density of 1.2 mg cm-3. This image was used in the simulation of 40000 particles following a directed random walk algorithms with 7 binarization thresholds. These data consisted of 7 files containing the simulated end points of the 40000 random walks, obtained in Ruiz-Ramos et al. (2010). MATLAB software was used for computing the frequency matrix of the number of particles arriving at every end point of the random walks and their 3D representation.

A Monitoring Infrastructure for FPGA Self-Awareness and Dynamic Adaptation

Variabilities associated with CMOS evolution affect the yield and performance of current digital designs. FPGAs, which are widely used for fast prototyping and implementation of digital circuits, also suffer from these issues. Proactive approaches start to appear to achieve self-awareness and dynamic adaptation of these devices. To support these techniques we propose the employment of a multi-purpose sensor network. This infrastructure, through adequate use of configuration and automation tools, is able to obtain relevant data along the life cycle of an FPGA. This is realised at a very reduced cost, not only in terms of area or other limited resources, but also regarding the design effort required to define and deploy the measuring infrastructure. Our proposal has been validated by measuring inter-die and intra-die variability in different FPGA families.

Cattle-powered nodes experience in a heterogeneous network for localization of herds

A heterogeneous network, mainly based on nodes that use harvested energy to self-energize is presented and its use demonstrated. The network, mostly kinetically powered, has been used for the localization of herds in grazing areas under extreme climate conditions. The network consists of secondary and primary nodes. The former, powered by a kinetic generator, take advantage of animal movements to broadcast a unique identifier. The latter are battery-powered and gather secondarynode transmitted information to provide it, along with position and time data, to a final base station in charge of the animal monitoring. Because a limited human interaction is desirable, the aim of this network is to reduce the battery count of the system.