
Concha, A., Mellado, P., MoreraBrenes, B., Costa, C. S., Mahadevan, L., & MongeNajera, J. (2015). Oscillation of the velvet worm slime jet by passive hydrodynamic instability. Nat. Commun., 6, 6 pp.
Abstract: The rapid squirt of a proteinaceous slime jet endows velvet worms (Onychophora) with a unique mechanism for defence from predators and for capturing prey by entangling them in a disordered web that immobilizes their target. However, to date, neither qualitative nor quantitative descriptions have been provided for this unique adaptation. Here we investigate the fast oscillatory motion of the oral papillae and the exiting liquid jet that oscillates with frequencies f similar to 3060 Hz. Using anatomical images, highspeed videography, theoretical analysis and a physical simulacrum, we show that this fast oscillatory motion is the result of an elastohydrodynamic instability driven by the interplay between the elasticity of oral papillae and the fast unsteady flow during squirting. Our results demonstrate how passive strategies can be cleverly harnessed by organisms, while suggesting future oscillating microfluidic devices, as well as novel ways for micro and nanofibre production using bioinspired strategies.



Cortez, V., Medina, P., Goles, E., Zarama, R., & Rica, S. (2015). Attractors, statistics and fluctuations of the dynamics of the Schelling's model for social segregation. Eur. Phys. J. B, 88(1), 12 pp.
Abstract: Statistical properties, fluctuations and probabilistic arguments are shown to explain the robust dynamics of the Schelling's social segregation model. With the aid of probability density functions we characterize the attractors for multiple external parameters and conditions. We discuss the role of the initial states and we show that, indeed, the system evolves towards well defined attractors. Finally, we provide probabilistic arguments to explain quantitatively the observed behavior.



D'Angelo, G., Di Stefano, G., Navarra, A., Nisse, N., & Suchan, K. (2015). Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. Algorithmica, 72(4), 1055–1096.
Abstract: A set of autonomous robots have to collaborate in order to accomplish a common task in a ringtopology where neither nodes nor edges are labeled (that is, the ring is anonymous). We present a unified approach to solve three important problems: the exclusive perpetual exploration, the exclusive perpetual clearing, and the gathering problems. In the first problem, each robot aims at visiting each node infinitely often while avoiding that two robots occupy a same node (exclusivity property); in exclusive perpetual clearing (also known as graph searching), the team of robots aims at clearing the whole ring infinitely often (an edge is cleared if it is traversed by a robot or if both its endpoints are occupied); and in the gathering problem, all robots must eventually occupy the same node. We investigate these tasks in the LookComputeMove model where the robots cannot communicate but can perceive the positions of other robots. Each robot is equipped with visibility sensors and motion actuators, and it operates in asynchronous cycles. In each cycle, a robot takes a snapshot of the current global configuration (Look), then, based on the perceived configuration, takes a decision to stay idle or to move to one of its adjacent nodes (Compute), and in the latter case it eventually moves to this neighbor (Move). Moreover, robots are endowed with very weak capabilities. Namely, they are anonymous, asynchronous, oblivious, uniform (execute the same algorithm) and have no common sense of orientation. In this setting, we devise algorithms that, starting from an exclusive and rigid (i.e. aperiodic and asymmetric) configuration, solve the three above problems in anonymous ringtopologies.



del Rio, A. V., Buys, B., Campos, J. L., Mendez, R., & MosqueraCorral, A. (2015). Optimizing upflow velocity and calcium precipitation in denitrifying granular systems. Process Biochem., 50(10), 1656–1661.
Abstract: The denitrification process was studied in two granular biomass denitrifying reactors (USB1 and USB2). In USB1 large quantities of biomass were accumulated (9.5 gVSS L1) allowing for the treatment of high nitrogen loads (3.5 g NO3N L1 d(1)). As the biomass granulation process is not immediate the effects of different upflow velocities (0.125.5 m h(1)) and calcium contents (5200 mg Ca2+ L1) were studied in order to speed up the process. Obtained results indicate that the optimum values for these parameters, which allow for the stable operation of USB1, are of 0.19 m h(1) and 60 mg Ca2+ L1. Then these optimum conditions were applied to USB2 where the effects of concentrations from 335 to 1000 mg NO3N L1 were tested. In these conditions nitrate concentrations of 1000 mg NO3N L1 are required for denitrifying granular biomass formation. Summarizing denitrifying granules can be formed at low upflow velocities and in hard or extremely hard water composition conditions if sufficient high nitrogen loads are treated. (C) 2015 Elsevier Ltd. All rights reserved.



del Valle, M. A., Ramos, A. C., Diaz, F. R., & Gacitua, M. A. (2015). Electrosynthesis and Characterisation of Polymer Nanowires from Thiophene and its Oligomers. J. Braz. Chem. Soc., 26(11), 2313–2320.
Abstract: Validating methodology formerly reported, polythiophene electrosynthesised as nanowires from the monomer and some of its oligomers is now described. The work is conducted on a platinum electrode previously modified with a template that tunes the polymer growth inside the confined space of the pores. In addition, it was confirmed that the use of larger chainlength oligomers as starting unit helps to obtain more homogeneous wires, although its adhesion to the supporting substrate works against. Characterisation allows to verify the morphology and to confirm higher levels of doping/undoping of the nanostructures as compared to the corresponding bulky deposits, which points to improved macroscopic properties. It is demonstrated that this strategy allows obtaining nanowires of very small diameter, ranging from 2.8 to 4.0 nm; thus demonstrating that the use of this approach enables the direct obtainment of nanowires upon the electrode surface, with the obvious advantage that this implies.



During, G., Josserand, C., & Rica, S. (2015). Selfsimilar formation of an inverse cascade in vibrating elastic plates. Phys. Rev. E, 91(5), 10 pp.
Abstract: The dynamics of random weakly nonlinear waves is studied in the framework of vibrating thin elastic plates. Although it has been previously predicted that no stationary inverse cascade of constant wave action flux could exist in the framework of wave turbulence for elastic plates, we present substantial evidence of the existence of a timedependent inverse cascade, opening up the possibility of selforganization for a larger class of systems. This inverse cascade transports the spectral density of the amplitude of the waves from short up to large scales, increasing the distribution of long waves despite the shortwave fluctuations. This dynamics appears to be selfsimilar and possesses a powerlaw behavior in the shortwavelength limit which significantly differs from the exponent obtained via a Kolmogorov dimensional analysis argument. Finally, we show explicitly a tendency to build a longwave coherent structure in finite time.



Espinoza, D., Goycoolea, M., & Moreno, E. (2015). The precedence constrained knapsack problem: Separating maximally violated inequalities. Discret Appl. Math., 194, 65–80.
Abstract: We consider the problem of separating maximally violated inequalities for the precedence constrained knapsack problem. Though we consider maximally violated constraints in a very general way, special emphasis is placed on induced cover inequalities and induced clique inequalities. Our contributions include a new partial characterization of maximally violated inequalities, a new safe shrinking technique, and new insights on strengthening and lifting. This work follows on the work of Boyd (1993), Park and Park (1997), van de Leensel et al. (1999) and Boland et al. (2011). Computational experiments show that our new techniques and insights can be used to significantly improve the performance of cutting plane algorithms for this problem. (C) 2015 Elsevier B.V. All rights reserved.



Fierro, R., Leiva, V., & Balakrishnan, N. (2015). Statistical Inference on a Stochastic Epidemic Model. Commun. Stat.Simul. Comput., 44(9), 2297–2314.
Abstract: In this work, we develop statistical inference for the parameters of a discretetime stochastic SIR epidemic model. We use a Markov chain for describing the dynamic behavior of the epidemic. Specifically, we propose estimators for the contact and removal rates based on the maximum likelihood and martingale methods, and establish their asymptotic distributions. The obtained results are applied in the statistical analysis of the basic reproduction number, a quantity that is useful in establishing vaccination policies. In order to evaluate the population size for which the results are useful, a numerical study is carried out. Finally, a comparison of the maximum likelihood and martingale estimators is conducted by means of Monte Carlo simulations.



Fierro, R., Leiva, V., & Moller, J. (2015). The Hawkes Process With Different Exciting Functions And Its Asymptotic Behavior. J. Appl. Probab., 52(1), 37–54.
Abstract: The standard Hawkes process is constructed from a homogeneous Poisson process and uses the same exciting function for different generations of offspring. We propose an extension of this process by considering different exciting functions. This consideration may be important in a number of fields; e.g. in seismology, where main shocks produce aftershocks with possibly different intensities. The main results are devoted to the asymptotic behavior of this extension of the Hawkes process. Indeed, a law of large numbers and a central limit theorem are stated. These results allow us to analyze the asymptotic behavior of the process when unpredictable marks are considered.



Gaspers, S., Liedloff, M., Stein, M., & Suchan, K. (2015). Complexity of splits reconstruction for lowdegree trees. Discret Appl. Math., 180, 89–100.
Abstract: Given a vertexweighted tree T, the split of an edge em T is the minimum over the weights of the two trees obtained by removing e from T, where the weight of a tree is the sum of weights of its vertices. Given a set of weighted vertices V and a multiset of integers s, we consider the problem of constructing a tree on V whose splits correspond to s. The problem is known to be NPcomplete, even when all vertices have unit weight and the maximum vertex degree of T is required to be at most 4. We show that the problem is strongly NPcomplete when T is required to be a path, the problem is NPcomplete when all vertices have unit weight and the maximum degree of T is required to be at most 3, and it remains NPcomplete when all vertices have unit weight and T is required to be a caterpillar with unbounded hair length and maximum degree at most 3. We also design polynomial time algorithms for the variant where T is required to be a path and the number of distinct vertex weights is constant, and the variant where all vertices have unit weight and T has a constant number of leaves. The latter algorithm is not only polynomial when the number of leaves, k, is a constant, but also is a fixedparameter algorithm for parameter k. Finally, we shortly discuss the problem when the vertex weights are not given but can be freely chosen by an algorithm. The considered problem is related to building libraries of chemical compounds used for drug design and discovery. In these inverse problems, the goal is to generate chemical compounds having desired structural properties, as there is a strong relation between structural invariants of the particles, such as the Wiener index and, less directly, the problem under consideration here, and physicochemical properties of the substance. (C) 2014 Elsevier B.V. All rights reserved.



Girard, A., Gago, E. J., Muneer, T., & Caceres, G. (2015). Higher ground source heat pump COP in a residential building through the use of solar thermal collectors. Renew. Energy, 80, 26–39.
Abstract: This article investigates the feasibility of achieving higher performance from groundsource heatpumps (GSHP) in space heating mode through the use of solar thermal collectors. A novel simulation tool for solarassisted groundsource heatpumps (SGSHP) is presented with an analysis of the influence of solar collectors on the improvement of heat pump performance. Solar radiation and climate temperature data of 19 European cities were used to perform simulations of SGSHP and GSHP systems considering a typical residential house. Overall performance coefficients (COPsys) varied from northern to southern locations between 4.4 and 5.8 for SGSHP and between 4.3 and 5.1 for GSHP. Results show that solar collectors coupling has more impact on performance improvement in regions that benefit from higher irradiance. However, greater running cost savings are achieved in milder climate conditions. Both heatpump systems are able to effectively contribute to carbon footprint reductions for residential buildings, especially in countries where fossil fuels are the primary source of electricity generation. SGSHP payback periods are found between 8.5 and 23 years from northern to southern localities, making such heating system an economic heating option. SGSHPs are best suited for high irradiance and cool climate locations such as the mountainous regions in southern Europe. (C) 2015 Elsevier Ltd. All rights reserved.



Goles, E., & Montealegre, P. (2015). The complexity of the majority rule on planar graphs. Adv. Appl. Math., 64, 111–123.
Abstract: We study the complexity of the majority rule on planar automata networks. We reduce a special case of the Monotone Circuit Value Problem to the prediction problem of determining if a vertex of a planar graph will change its state when the network is updated with the majority rule. (C) 2014 Elsevier Inc. All rights reserved.



Goles, E., & Ruz, G. A. (2015). Dynamics of neural networks over undirected graphs. Neural Netw., 63, 156–169.
Abstract: In this paper we study the dynamical behavior of neural networks such that their interconnections are the incidence matrix of an undirected finite graph G = (V, E) (i.e., the weights belong to {0, 1}). The network may be updated synchronously (every node is updated at the same time), sequentially (nodes are updated one by one in a prescribed order) or in a blocksequential way (a mixture of the previous schemes). We characterize completely the attractors (fixed points or cycles). More precisely, we establish the convergence to fixed points related to a parameter alpha(G), taking into account the number of loops, edges, vertices as well as the minimum number of edges to remove from E in order to obtain a maximum bipartite graph. Roughly, alpha(G') < 0 for any G' subgraph of G implies the convergence to fixed points. Otherwise, cycles appear. Actually, for very simple networks (majority functions updated in a blocksequential scheme such that each block is of minimum cardinality two) we exhibit cycles with nonpolynomial periods. (C) 2014 Elsevier Ltd. All rights reserved.



Goles, E., MontalvaMedel, M., Mortveit, H., & RamirezFlandes, S. (2015). Block Invariance in Elementary Cellular Automata. J. Cell. Autom., 10(12), 119–135.
Abstract: Consider an elementary cellular automaton (ECA) under periodic boundary conditions. Given an arbitrary partition of the set of vertices we consider the block updating, i.e. the automaton's local function is applied from the first to the last set of the partition such that vertices belonging to the same set are updated synchronously. The automaton is said blockinvariant if the set of periodic configurations is independent of the choice of the block updating. When the sets of the partition are singletons we have the sequential updating: vertices are updated one by one following a permutation pi. In [5] the authors analyzed the piinvariance of the 2(8) = 256 possible ECA rules (or the 88 nonredundant rules subset). Their main result was that for all n > 3, exactly 41 of these nonredundant rules are piinvariant. In this paper we determine the subset of these 41 rules that are block invariant. More precisely, for all n > 3, exactly 15 of these rules are block invariant. Moreover, we deduce that block invariance also implies that the attractor structure itself is independent of the choice of the block update.



Hernandez, R., & Martin, M. J. (2015). Criteria for univalence and quasiconformal extension of harmonic mappings in terms of the Schwarzian derivative. Arch. Math., 104(1), 53–59.
Abstract: We prove that if the Schwarzian norm of a given complexvalued locally univalent harmonic mapping f in the unit disk is small enough, then f is, indeed, globally univalent in the unit disk and can be extended to a quasiconformal mapping in the extended complex plane.



Hernandez, R., & Martin, M. J. (2015). PreSchwarzian and Schwarzian Derivatives of Harmonic Mappings. J. Geom. Anal., 25(1), 64–91.
Abstract: In this paper we introduce a definition of the preSchwarzian and the Schwarzian derivatives of any locally univalent harmonic mapping f in the complex plane without assuming any additional condition on the (second complex) dilatation omega(f) of f. Using the new definition for the Schwarzian derivative of harmonic mappings, we prove theorems analogous to those by Chuaqui, Duren, and Osgood. Also, we obtain a Beckertype criterion for the univalence of harmonic mappings.



Hojman, S. A. (2015). Construction of Lagrangian and Hamiltonian structures starting from one constant of motion. Acta Mech., 226(3), 735–744.
Abstract: The problem of the construction of Lagrangian and Hamiltonian structures starting from two firstorder equations of motion is presented. This approach requires the knowledge of one (time independent) constant of motion for the dynamical system only. The Hamiltonian and Lagrangian structures are constructed, the HamiltonJacobi equation is then written and solved, and the second (time dependent) constant of the motion for the problem is explicitly exhibited.



Hojman, S. A., & Asenjo, F. A. (2015). Supersymmetric Majorana quantum cosmologies. Phys. Rev. D, 92(8), 7 pp.
Abstract: The Einstein equations for an isotropic and homogeneous FriedmannRobertsonWalker universe in the presence of a quintessence scalar field are shown to be described in a compact way, formally identical to the dynamics of a relativistic particle moving on a twodimensional spacetime. The correct Lagrangian for the system is presented and used to construct a spinor quantum cosmology theory using Breit's prescription. The theory is supersymmetric when written in the Majorana representation. The spinor field components interact through a potential that correlates the spacetime metric and the quintessence. An exact supersymmetric solution for k = 0 case is exhibited. This quantum cosmology model may be interpreted as a theory of interacting universes.



Kapitanov, G., Alvey, C., VogtGeisse, K., & Feng, Z. L. (2015). An AgeStructured Model For The Coupled Dynamics Of Hiv And Hsv2. Math. Biosci. Eng., 12(4), 803–840.
Abstract: Evidence suggests a strong correlation between the prevalence of HSV2 (genital herpes) and the perseverance of the HIV epidemic. HSV2 is an incurable viral infection, characterized by periodic reactivation. We construct a model of the coinfection dynamics between the two diseases by incorporating a timesinceinfection variable to track the alternating periods of infectiousness of HSV2. The model considers only heterosexual relationships and distinguishes three population groups: males, general population females, and female sex workers. We calculate the basic reproduction numbers for each disease that provide threshold conditions, which determine whether a disease dies out or becomes endemic in the absence of the other disease. We also derive the invasion reproduction numbers that determine whether or not a disease can invade into a population in which the other disease is endemic. The calculations of the invasion reproduction numbers suggest a new aspect in their interpretation – the class from which the initial disease carrier arises is important for understanding the invasion dynamics and biological interpretation of the expressions of the reproduction numbers. Sensitivity analysis is conducted to examine the role of model parameters in influencing the model outcomes. The results are discussed in the last section.



Kosowski, A., Li, B., Nisse, N., & Suchan, K. (2015). kChordal Graphs: From Cops and Robber to Compact Routing via Treewidth. Algorithmica, 72(3), 758–777.
Abstract: Cops and robber games, introduced by Winkler and Nowakowski (in Discrete Math. 43(23), 235239, 1983) and independently defined by Quilliot (in J. Comb. Theory, Ser. B 38(1), 8992, 1985), concern a team of cops that must capture a robber moving in a graph. We consider the class of kchordal graphs, i.e., graphs with no induced (chordless) cycle of length greater than k, ka parts per thousand yen3. We prove that k1 cops are always sufficient to capture a robber in kchordal graphs. This leads us to our main result, a new structural decomposition for a graph class including kchordal graphs. We present a polynomialtime algorithm that, given a graph G and ka parts per thousand yen3, either returns an induced cycle larger than k in G, or computes a treedecomposition of G, each bag of which contains a dominating path with at most k1 vertices. This allows us to prove that any kchordal graph with maximum degree Delta has treewidth at most (k1)(Delta1)+2, improving the O(Delta(Delta1) (k3)) bound of Bodlaender and Thilikos (Discrete Appl. Math. 79(13), 4561, 1997. Moreover, any graph admitting such a treedecomposition has small hyperbolicity). As an application, for any nvertex graph admitting such a treedecomposition, we propose a compact routing scheme using routing tables, addresses and headers of size O(klog Delta+logn) bits and achieving an additive stretch of O(klog Delta). As far as we know, this is the first routing scheme with O(klog Delta+logn)routing tables and small additive stretch for kchordal graphs.

