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.

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.

Time series irreversibility: a visibility graph approach

We propose a method to measure real-valued time series irreversibility which combines two different tools: the horizontal visibility algorithm and the Kullback-Leibler divergence. This method maps a time series to a directed network according to a geometric criterion. The degree of irreversibility of the series is then estimated by the Kullback-Leibler divergence (i.e. the distinguishability) between the in and out degree distributions of the associated graph. The method is computationally efficient and does not require any ad hoc symbolization process. We find that the method correctly distinguishes between reversible and irreversible stationary time series, including analytical and numerical studies of its performance for: (i) reversible stochastic processes (uncorrelated and Gaussian linearly correlated), (ii) irreversible stochastic processes (a discrete flashing ratchet in an asymmetric potential), (iii) reversible (conservative) and irreversible (dissipative) chaotic maps, and (iv) dissipative chaotic maps in the presence of noise. Two alternative graph functionals, the degree and the degree-degree distributions, can be used as the Kullback-Leibler divergence argument. The former is simpler and more intuitive and can be used as a benchmark, but in the case of an irreversible process with null net current, the degree-degree distribution has to be considered to identify the irreversible nature of the series

Modeling the evolution of item rating networks using time-domain preferential attachment

The understanding of the structure and dynamics of the intricate network of connections among people that consumes products through Internet appears as an extremely useful asset in order to study emergent properties related to social behavior. This knowledge could be useful, for example, to improve the performance of personal recommendation algorithms. In this contribution, we analyzed five-year records of movie-rating transactions provided by Netflix, a movie rental platform where users rate movies from an online catalog. This dataset can be studied as a bipartite user-item network whose structure evolves in time. Even though several topological properties from subsets of this bipartite network have been reported with a model that combines random and preferential attachment mechanisms [Beguerisse Díaz et al., 2010], there are still many aspects worth to be explored, as they are connected to relevant phenomena underlying the evolution of the network. In this work, we test the hypothesis that bursty human behavior is essential in order to describe how a bipartite user-item network evolves in time. To that end, we propose a novel model that combines, for user nodes, a network growth prescription based on a preferential attachment mechanism acting not only in the topological domain (i.e. based on node degrees) but also in time domain. In the case of items, the model mixes degree preferential attachment and random selection. With these ingredients, the model is not only able to reproduce the asymptotic degree distribution, but also shows an excellent agreement with the Netflix data in several time-dependent topological properties.

Horizontal visibility graphs generated by type-I intermittency

The type-I intermittency route to (or out of) chaos is investigated within the horizontal visibility (HV) graph theory. For that purpose, we address the trajectories generated by unimodal maps close to an inverse tangent bifurcation and construct their associatedHVgraphs.We showhowthe alternation of laminar episodes and chaotic bursts imprints a fingerprint in the resulting graph structure. Accordingly, we derive a phenomenological theory that predicts quantitative values for several network parameters. In particular, we predict that the characteristic power-law scaling of the mean length of laminar trend sizes is fully inherited by the variance of the graph degree distribution, in good agreement with the numerics. We also report numerical evidence on how the characteristic power-law scaling of the Lyapunov exponent as a function of the distance to the tangent bifurcation is inherited in the graph by an analogous scaling of block entropy functionals defined on the graph. Furthermore, we are able to recast the full set of HV graphs generated by intermittent dynamics into a renormalization-group framework, where the fixed points of its graph-theoretical renormalization-group flow account for the different types of dynamics.We also establish that the nontrivial fixed point of this flow coincides with the tangency condition and that the corresponding invariant graph exhibits extremal entropic properties.

A review of the distribution of particulate trace elements in urban terrestrial environments and its application to considerations of risk

We review the evolution, state of the art and future lines of research on the sources, transport pathways, and sinks of particulate trace elements in urban terrestrial environments to include the atmosphere, soils, and street and indoor dusts. Such studies reveal reductions in the emissions of some elements of historical concern such as Pb, with interest consequently focusing on other toxic trace elements such as As, Cd, Hg, Zn, and Cu. While establishment of levels of these elements is important in assessing the potential impacts of human society on the urban environment, it is also necessary to apply this knowledge in conjunction with information on the toxicity of those trace elements and the degree of exposure of human receptors to an assessment of whether such contamination represents a real risk to the city’s inhabitants and therefore how this risk can be addressed.

Simulation of academic performance rates, estimation of indicators of subjects and of a complete degree

The purpose of this paper is to present a program written in Matlab-Octave for the simulation of the time evolution of student curricula, i.e, how students pass their subjects along time until graduation. The program computes, from the simulations, the academic performance rates for the subjects of the study plan for each semester as well as the overall rates, which are a) the efficiency rate defined as the ratio of the number of students passing the exam to the number of students who registered for it and b) the success rate, defined as the ratio of the number of students passing the exam to the number of students who not only registered for it but also actually took it. Additionally, we compute the rates for the bachelor academic degree which are established for Spain by the National Quality Evaluation and Accreditation Agency (ANECA) and which are the graduation rate (measured as the percentage of students who finish as scheduled in the plan or taking an extra year) and the efficiency rate (measured as the percentage of credits which a student who graduated has really taken). The simulation is done in terms of the probabilities of passing all the subjects in their study plan. The application of the simulator to Polytech students in Madrid, where requirements for passing are specially stiff in first and second year subjects, is particularly relevant to analyze student cohorts and the probabilities of students finishing in the minimum of four years, or taking and extra year or two extra years, and so forth. It is a very useful tool when designing new study plans. The calculation of the probability distribution of the random variable "number of semesters a student has taken to complete the curricula and graduate" is difficult or even unfeasible to obtain analytically, and this is even truer when we incorporate uncertainty in parameter estimation. This is why we apply Monte Carlo simulation which not only provides illustration of the stochastic process but also a method for computation. The stochastic simulator is proving to be a useful tool for identification of the subjects most critical in the distribution of the number of semesters for curriculum vitae (CV) completion and subsequently for a decision making process in terms of CV planning and passing standards in the University. Simulations are performed through a graphical interface where also the results are presented in appropriate figures. The Project has been funded by the Call for Innovation in Education Projects of Universidad Politécnica de Madrid (UPM) through a Project of its school Escuela Técnica Superior de Ingenieros Industriales ETSII during the period September 2010-September 2011.

Effects of sheep and horse manure and pine bark amendments on metal distribution and chemical properties of contaminated mine soils.

Mine soils usually contain large levels of heavy metals and poor fertility conditions which limit their reclamation and the application of phyto-remediation technologies. Two organic waste materials (pine bark compost and sheep and horse manure compost), with different pHs and varying degrees of humification and nutrient contents, were applied as amendments to assess their effects on copper (Cu) and zinc (Zn) bioavailability and on fertility conditions of mine soils. Soil samples collected from two abandoned mining areas near Madrid (Spain) were mixed with 0, 30 and 60 t ha?1 of the organic amendments. The concentrations of metals among the different mineral and organic fractions of soil were determined by several extraction procedures to study the metal distribution in the solid phase of the soil affected by the organic amendments. The results showed that the manure amendment increased the soil pH and the cation exchange capacity and enhanced the nutrient levels of these soils. The pine bark amendment decreased the soil pH and did not significantly change the nutrient status of soil. Soil pH, organic matter content and its degree of humification, which were altered by the amendments, were the main factors affecting Cu fractionation. Zn fractionation was mainly affected by soil pH. The addition of manure not only improved soil fertility, but also decreased metal bioavailability resulting in a reduction of metal toxicity. Conversely, pine bark amendment increased metal ioavailability. The use of sheep and horse manure could be a cost-effective practice for the restoration of contaminated mine soils.

Evolutionary computation of forests with Degree- and Role-Constrained Minimum Spanning Trees

Finding the degree-constrained minimum spanning tree (DCMST) of a graph is a widely studied NP-hard problem. One of its most important applications is network design. Here we deal with a new variant of the DCMST problem, which consists of finding not only the degree- but also the role-constrained minimum spanning tree (DRCMST), i.e., we add constraints to restrict the role of the nodes in the tree to root, intermediate or leaf node. Furthermore, we do not limit the number of root nodes to one, thereby, generally, building a forest of DRCMSTs. The modeling of network design problems can benefit from the possibility of generating more than one tree and determining the role of the nodes in the network. We propose a novel permutation-based representation to encode these forests. In this new representation, one permutation simultaneously encodes all the trees to be built. We simulate a wide variety of DRCMST problems which we optimize using eight different evolutionary computation algorithms encoding individuals of the population using the proposed representation. The algorithms we use are: estimation of distribution algorithm, generational genetic algorithm, steady-state genetic algorithm, covariance matrix adaptation evolution strategy, differential evolution, elitist evolution strategy, non-elitist evolution strategy and particle swarm optimization. The best results are for the estimation of distribution algorithms and both types of genetic algorithms, although the genetic algorithms are significantly faster.

Propuesta de un marco conceptual para el análisis comparativo de las redes de distribución de dos supermercados online = Proposal of a conceptual framework for the comparative analysis of the distribution networks of two online supermarkets

In this article the network configuration for fulfillment and distribution of online orders of two British retailers is analyzed and compared. For this purpose, it is proposed a conceptual framework that consists of the key following aspects: network configuration, transportation management and location of demand. As a result is not obvious to determine the ideal centralization degree in each case. Finally, it is suggested the future development of an analytic tool that helps to choose the most appropriate model.

Shear stress distribution on beam cross-sections under shear loading

In this work, some results obtained by Trabucho and Viaño for the shear stress distribution in beam cross sections using asymptotic expansions of the three-dimensional elasticity equations are compared with those calculated by the classical formulae of the Strength of Materials. We use beams with rectangular and circular cross section to compare the degree of accuracy reached by each method.