Data for the synthesis, characterization, and use of xerogels as adsorbents for the removal of fluoride and bromide in aqueous phase

NAHUM ANDRES MEDELLIN CASTILLO ELIZABETH DIANE ISAACS PAEZ Liliana Giraldo Gutiérrez JUAN CARLOS MORENO-PIRAJAN ITZIA RODRIGUEZ MENDEZ SIMON YOBANNY REYES LOPEZ JAIME REYES HERNANDEZ SONIA JUDITH SEGOVIA SANDOVAL (2022, [Artículo])

"Groundwater with high fluoride concentrations has been recognized as one of the serious concerns worldwide. Besides, the fluoride released into the groundwater by slow dissolution of fluoride-containing rocks, various industries also contribute to fluoride pollution [1]. Excess intake of fluoride leads to various health problems such as dental and skeletal fluorosis, cancer, infertility, brain damage, thyroid diseases, etc. [2]. On the other hand, bromide is naturally present in surface and groundwater sources. However, during the chlorination process, bromide can be oxidized to HOBr, which can react with natural organic matter in water to form brominated organic disinfection byproducts, which are very harmful to human health [3]. Among various methods for water treatment, the adsorption process has been widely used and seems to be an efficient and attractive method for the removal of many contaminants in water, such as anions, in terms of cost, simplicity of design, and operation [4,5]. In the past years, xerogels and carbon xerogels, a new type of adsorbents, which are synthesized by the sol-gel polycondensation of resorcinol and formaldehyde, have gained attention due to their moldable texture and chemical properties [6]. Moreover, melamine addition in resorcinol and formaldehyde xerogels adds basic groups on its surface, favouring Lewis acid-base interactions between xerogels and other components by adsorption [7]. In this data article, the synthesis of three resorcinolformaldehyde (R/F) xerogels with an increasing amount of melamine (M) was carried out by colloidal polymerization (molar ratios of M/R = 0.5, M/R = 1.0, and M/R = 2.0). Additionally, samples of M/R = 0.5 xerogel were carbonized at 400, 450, and 550 degrees C under an inert atmosphere to increase their specific area. Organic and carbon xerogels obtained were characterized by FTIR, TGA, SEM, Physisorption of N 2, and the pH at the point of zero charge (pH PZC). All organic xerogels were also tested as adsorbents on the removal of fluoride and bromide ions from aqueous phase. The Freundlich, Langmuir, and Radke-Prausnitz isotherm models were applied to interpret the experimental data from adsorption equilibrium. Additionally, the data of the mass of the xerogel needed to remove fluoride and bromide from groundwater and fulfill the maximum concentration levels are also included."

Xerogels Melamine Colloidal polymerization Fluoride and bromide ions Adsorption BIOLOGÍA Y QUÍMICA QUÍMICA QUÍMICA

The contribution of strong and weak ties to resilience: The case of small-scale maize farming systems in Mexico

Tania Carolina Camacho Villa Ernesto Adair Zepeda Villarreal Julio Díaz-José Roberto Rendon-Medel Bram Govaerts (2023, [Artículo])

Social Network Analysis Farm Typologies Social Ties Strong Ties CIENCIAS AGROPECUARIAS Y BIOTECNOLOGÍA INNOVATION NETWORKS PERSISTENCE SOCIAL NETWORK ANALYSIS MAIZE FARMING SYSTEMS

Adsorption and Photocatalytic Degradation of Methylene Blue in Carbon Nanotubes: A Review with Bibliometric Analysis

Hugo Albeiro Saldarriaga Noreña MARIO ALFONSO MURILLO TOVAR JOSEFINA VERGARA SANCHEZ JEANNETE RAMIREZ APARICIO Lorena Magallón Cacho MARIA LUISA GARCIA BETANCOURT (2023, [Artículo])

Wastewater-containing dyes are an environmental problem. The prime source of dye pollutants is the textile industry, such as paper manufacturing, food processing, leather, pigments, etc. Dye removal from wastewater using nanotechnology has received attention in recent decades thanks to efficient nanomaterials improving traditional technologies. In recent years, multiple research reports on carbon nanotubes for dye removal and photocatalytic dye degradation provided substantial insight into the comprehension of nanotechnology and remediation. This work presents a review and bibliometric analysis of carbon nanotubes for dye removal and photocatalytic dye degradation, which have an environmental impact today. The bibliometric study showed that the current research tendency on carbon nanotubes applied in dye removal and photocatalysis is still growing. According to research, this work observed that carbon nanotubes for dye removal exhibit high removal and efficient photocatalysis activity, indicating the functionality of nanotechnology for environmental remediation. The analysis of the parameters involved in the removal studies, such as temperature and pH, showed adsorption behavior. The photodegradation of methylene blue demonstrated the photocatalytic activity of carbon nanotubes attributed to the sp2 lattice of graphitic configuration.

BIOLOGÍA Y QUÍMICA QUÍMICA adsorption; carbon nanotubes; methylene blue; photocatalysis; photodegradation of methylene blue

Usando la descomposición de un grafo Halin para el diseño de algoritmos autoestabilizantes

Using Halin graph decomposition for the design of self-stabilizing algorithm

Daniel Uriel Orozco Lomelí (2023, [Tesis de maestría])

Sea G = (V, E) un grafo no dirigido. El problema de encontrar un conjunto independiente fuerte en G, es identificar un conjunto S ⊆ V , tal que dados dos vértices arbitrarios de S, éstos estén separados entre sí por el menos tres aristas. Encontrar un conjunto S de tamaño máximo pertenece a la clase NP-Difícil. Por otro lado, el problema de encontrar un conjunto dominante total en G es identificar un conjunto D ⊆ V , tal que cualquier vértice en V tenga al menos un vecino que pertenezca a D. Encontrar un conjunto D de tamaño mínimo también pertenece a la clase NP-Difícil. En este trabajo de tesis se diseñaron dos algoritmos, uno que resuelve el problema de encontrar un conjunto independiente fuerte maximal y otro que resuelve el problema de encontrar un conjunto dominante total minimal. Estos dos problemas son menos restrictivos que las versiones de optimización descritas al principio de este texto y se sabe que pertenecen a la clase P. Los algoritmos diseñados corren en un sistema distribuido, son autoestabilizantes, son tolerantes a fallas transitorias y funcionan para grafos Halin. Los grafos Halin pertenecen a la clase de grafos 2-outerplanares y tienen la propiedad de que se pueden partir en dos subgrafos muy conocidos, un árbol y un ciclo. Los algoritmos propuestos aprovechan la propiedad anterior para disminuir la complejidad de los mismos. Hasta donde tenemos conocimiento, los algoritmos propuestos, que corren en tiempo lineal en el número de vértices, son los algoritmos más rápidos existentes para los problemas del conjunto independiente fuerte maximal y el conjunto dominante total minimal.

Let G = (V, E) be an undirected graph. The problem of finding a strong stable set in G, is to identify a set S ⊆ V , such that given two arbitrary vertices of S, they are separated from each other by at least three edges. Finding a set S of maximum size belongs to the class NP-Hard. On the other hand, the problem of finding a total dominanting set in G is to identify a set D ⊆ V , such that any vertex in V has at least one neighbor belonging to D. Finding a set D of minimum size also belongs to the class NP-Hard. In this thesis work, two algorithms were designed, one that solves the problem of finding a maximal strong stable set and one that solves the problem of finding a minimal total dominanting set. These two problems are less restrictive than the optimization versions described at the beginning of this text and are known to belong to the P class. The designed algorithms run on a distributed system, are self-stabilizing, are transient fault tolerant, and work for Halin graphs. Halin graphs belong to the 2-outerplanar class of graphs and have the property that they can be split into two well-known subgraphs, a tree and a cycle. The proposed algorithms take advantage of the above property to decrease the complexity of the algorithms. To the best of our knowledge, the proposed algorithms, which run in linear time in the number of vertices, are the fastest existing algorithms for the maximal strong stable set and minimal total dominating set problems.

Grafo Halin, Sistemas Distribuidos, Autoestabilización, Conjunto Independiente Fuerte, Conjunto Dominante Total Halin Graph, Distributed Systems, Self-stabilizing, Strong Stable Set, Total Dominating Set INGENIERÍA Y TECNOLOGÍA CIENCIAS TECNOLÓGICAS TECNOLOGÍA DE LOS ORDENADORES LENGUAJES ALGORÍTMICOS LENGUAJES ALGORÍTMICOS