Sedative-like effect of intraperitoneal GABA administration in the open field test

Gamma-Amino Butyric Acid (GABA) is the main inhibitor neurotransmitter of the Central Nervous System (CNS). Its peripheral administration has been matter of discussion. On the one hand, it has been reported that it does not cross the Blood-Brain Barrier (BBB), and, on the other hand, it has been associated with multiple therapeutic regimens and supplements by peripheral administration. The aim of the present study is to elucidate the possibility of a central sedative effect when administered peripherally. An experimental cohort of 90-day-old Holtzman male rats weighing 240-270 g was used. It was divided into 2 groups: saline-controls (n = 9) and GABA treated rats (12.5 mg/kg, n = 9). Both groups were intraperitoneally injected. The motor behavioral patterns displayed in the Opto Varimex (OVM) were studied. Vertical, horizontal, ambulatory and non-ambulatory movements and the number of movements were recorded in an automated way. Horizontal movements constitute the integration of ambulatory and non-ambulatory movements. Student t test was used comparing groups. In this experiment, there were non-significant downward trends in vertical, ambulatory, non-ambulatory and number of movements. Ambulatory and non-ambulatory tendencies acquired significance when treated together as horizontal movements (p < 0.05). We may conclude that peripheral administration of GABA produced a decrease of the horizontal movements in the open field test. It may be interpreted as a sedative effect, suggesting a passage of GABA through BBB, with central effects. However, there are several alternative possibilities to explain present findings. Other experiments will elucidate the implications or scope of the present findings.Fil: Gargiulo, Augusto Pascual Ítalo. Laboratorio de Neurociencias y Psicología Experimental; Argentina. Universidad Católica de Cuyo - Sede San Juan. Facultad de Ciencias Médicas; ArgentinaFil: Marquez Herrero, Santiago. Laboratorio de Neurociencias y Psicología Experimental; Argentina. Universidad Católica de Cuyo - Sede San Juan. Facultad de Ciencias Médicas; ArgentinaFil: Romanowicz, Esteban Alejandro. Laboratorio de Neurociencias y Psicología Experimental; Argentina. Universidad Católica de Cuyo - Sede San Juan. Facultad de Ciencias Médicas; ArgentinaFil: Guevara, Manuel Alejandro. Laboratorio de Neurociencias y Psicología Experimental; Argentina. Universidad Católica de Cuyo - Sede San Juan. Facultad de Ciencias Médicas; ArgentinaFil: Landa, Adriana Inés. Laboratorio de Neurociencias y Psicología Experimental; Argentina. Universidad Católica de Cuyo - Sede San Juan. Facultad de Ciencias Médicas; ArgentinaFil: Lafuente, José Vicente. Universidad del País Vasco; EspañaFil: Mesones, Humberto Luis. Laboratorio de Neurociencias y Psicología Experimental; Argentina. Fundación Instituto de Neurobiología; Argentina. Universidad Católica de Cuyo - Sede San Juan. Facultad de Ciencias Médicas; ArgentinaFil: Gargiulo, Pascual Angel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Laboratorio de Neurociencias y Psicología Experimental; Argentina. Universidad Católica de Cuyo - Sede San Juan. Facultad de Ciencias Médicas; Argentin

New results on production matrices for geometric graphs

We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another way of counting the number of such objects. For instance, a formula for the number of connected geometric graphs with given root degree, drawn on a set of n points in convex position in the plane, is presented. Further, we find the characteristic polynomials and we provide a characterization of the eigenvectors of the production matrices.Postprint (author's final draft

Coloración en triangulaciones

Some of the most studied problems in Graph Theory are those referring to the coloring of the graph, being one of the most famous the Three Color Problem. A color set D for a graph G is said to be a 3-coloring if adjacent vertex has a different color of D making the graph 3-coloreable. It seems to be obvious to wonder which graphs are 3-coloreable. Nevertheless, the problem of finding sufficient conditions for a graph to be 3-coloreable in a general graph has been shown by L. Stockmayer in 1979 in his book “Planar 3-colorability is polynomial complete" to be NP-complete. That is why different bounds for x(G) are studied and stated for both arbitrary graphs and for those with a particular structure. Nonetheless, the interest in this parameter is not only to establish new bounds, but also once the bounds have been obtained, either upper or bottom, this naturally brings us the question of knowing if there exists any graph which verifies the equality. Throughout these months, the results achieved about the 3-coloring problem for arbitrary graphs have been studied and, specifically, those results referring to the variants of the 3-coloration problem attending to the sum of colors, the distance between vertex or the parity among the apparition of certain color. This research has been performed not only from a combinatorial point of view but also from an algorithmic point of view and has been restricted to a particular kind of graph, known as maximal outerplanar graphs and denoted by its acronym as MOP's, graph of high importance in both the field of chemistry and polygon triangulations. This project has a double purpose: on the one hand, it seeks to collect those results in the literature which have been observed to be more significant in a review paper or sur- vey; on the other hand, it seeks to established tight combinatorial bounds for some variants of the 3-coloration concept for any n-vertex maximal outerplanar graph. Thus, as main contributions, we will prove several new tight combinatorial bounds for the following variants of coloration concept attending to the sum of the colors been used: sum-coloring, as well as the following variants attending to the existence of a rainbow path: rainbow coloring.---ABSTRACT---Algunos de los problemas más estudiados en Teoría de Grafos son aquellos problemas que hacen referencia a la coloración del mismo, siendo uno de los más clásicos el problema de los Tres Colores. Un conjunto D de colores de un grafo G se dice que es una 3-coloración si vértices adyacentes tienen un color distinto de D haciendo el grafo 3-coloreable. Parece entonces obvio preguntarse qué grafos son 3-coloreables. Sin embargo, ya en 1979 L. Stockmayer en su artículo “Planar 3-colorability is polynomial complete" probó que este problema es NP-completo. Es por ello por lo que se estudian y establecen cotas para x(G) para el caso de grafos cualesquiera o para grafos con cierta estructura. Sin embargo, el interés en este parámetro no sólo radica en establecer una cota, sino que una vez obtenida dicha cota, ya sea superior o inferior, quedaría comprobar la existencia de algún grafo que verifique la igualdad. A lo largo de estos meses de trabajo, se han estudiado los resultados obtenidos hasta la fecha en el problema de la 3-coloración de grafos en general y más concretamente sobre aquellas variantes de 3-coloración que atienden a la suma de los colores, la distancia entre vértices o la paridad en la aparición de cierto color. Este estudio se ha llevado a cabo tanto desde el punto de vista combinatorio como algorítmico y se ha restringido a un tipo particular de grafos, conocidos como grafos periplanos maximales y de nominados a partir de ahora por sus siglas en inglés MOP's (maximal outerplanar graphs), grafos de gran importancia tanto en el ámbito de la química como en el de triangulaciones de polígonos. Con este proyecto se persigue un doble objetivo: por un lado, se pretende recopilar aque- llos resultados más significativos de la bibliografía en un artículo de tipo "survey"; por otro, obtener nuevos resultados sobre variantes de dominación para MOP's. Así, como aporte de nuestro trabajo, probaremos nuevas cotas que se han establecido tanto para los criterios de 3-coloración que atienden a la suma de colores utilizados en la coloración: sum-coloring, como para variantes que atienden a la existencia de caminos irisados en la coloración del grafo: coloración irisada

Deportes alternativos: propuesta de intervención sobre el kin-ball en cuarto de primaria

El presente Trabajo de Fin de Grado (TFG) ha sido diseñado para incorporar los deportes alternativos, concretamente el Kin-ball en la asignatura de Educación física. Surge como la búsqueda de una alternativa a los deportes convencionales, ya que son los que estamos acostumbrados a realizar en la escuela. Por esta razón, con esta propuesta quiero dar a conocer un nuevo deporte en el ámbito escolar a través de metodologías activas. Para el desarrollo de este trabajo me he basado en la propuesta de intervención sobre el kin-ball que se llevó a cabo en un colegio de la provincia de Segovia con alumnos de cuarto de Educación Primaria. En primer lugar, se ha buscado información sobre el tema elegido y después se ha elaborado la unidad didáctica. Por último, se han sacado unos resultados y conclusiones sobre ella, enfatizando los valores positivos que transmite este deporte.Grado en Educación Primari

El Tercer Sector en la economía española

Este trabajo va a tratar sobre el Tercer Sector en España, la conceptualización y contextualización del mismo con la definición de las figuras que lo conforman, esto es, entre otras, fundaciones, asociaciones y entidades singulares. Además se expondrán las teorías que definen al Tercer Sector desde el lado de la oferta y desde el lado de la demanda. Por otro lado, se desarrolla el término economía social así como las figuras jurídicas que lo componen, con los diferentes problemas históricos de definición a nivel mundial. Así mismo, las consecuencias económicas generales del Tercer Sector en la economía española y su comparativa con sus homónimos extranjeros será un punto a destacarThe following project will regard the Third Sector in Spain, its conceptualization and contextualization through the definition of several figures that conform it, such as foundations, associations and singular entities. In addition, theories defining the Third Sector will be exposed, both from the offer and the demand sides. On the other hand, the term “social economy” will be developed, and also the different legal entities that conform it, along with the different historical definition problems that appeared on a global scale. What is more, general economic consequences of the Third Sector in Spanish economy, and its comparison with foreign homonyms will be a highlighted point.Departamento de Organización de Empresas y Comercialización e Investigación de MercadosGrado en Derecho y Grado en Administración y Dirección de Empresa

Estrategias de afrontamiento del estrés de los padres con hijos con discapacidad intelectual

Se estudian las diferentes estrategias de afrontamiento del estrés que utilizan los padres con hijos con discapacidad, así como los diversos comportamientos y estados de ánimo de las familias. La metodología se basa en la realización de una encuesta a partir de una muestra de 20 progenitores utilizando el Inventario de Estrategias de Afrontamiento (CSI), con el fin de analizar los recursos apropiados para la mejora de la calidad de vida de las familias y así como su bienestar. El trabajo plantea también la necesidad de fomentar el vínculo familia-escuela mediante actividades que están orientadas a la adquisición de herramientas útiles para afrontar de manera adecuada el estrés.Grado en Educación Primari

On approximating shortest paths in weighted triangular tessellations

© 2023 Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/We study the quality of weighted shortest paths when a continuous 2-dimensional space is discretized by a weighted triangular tessellation. In order to evaluate how well the tessellation approximates the 2-dimensional space, we study three types of shortest paths: a weighted shortest path , which is a shortest path from s to t in the space; a weighted shortest vertex path , which is an any-angle shortest path; and a weighted shortest grid path , which is a shortest path whose edges are edges of the tessellation. Given any arbitrary weight assignment to the faces of a triangular tessellation, thus extending recent results by Bailey et al. (2021) [6], we prove upper and lower bounds on the ratios , , , which provide estimates on the quality of the approximation. It turns out, surprisingly, that our worst-case bounds are independent of any weight assignment. Our main result is that in the worst case, and this is tight. As a corollary, for the weighted any-angle path we obtain the approximation result .P. B. is partially supported by NSERC. G. E., D. O. and R. I. S. are partially supported by H2020-MSCA-RISE project 734922 - CONNECT and project PID2019-104129GB-I00 funded by MCIN/AEI/10.13039/501100011033. G. E. and D. O. are also supported by PIUAH21/IA-062 and CM/JIN/2021-004. G. E. is also funded by an FPU of the Universidad de Alcalá.Peer ReviewedPostprint (published version

On approximating shortest paths in weighted triangular tessellations

We study the quality of weighted shortest paths when a continuous 2-dimensional space is discretized by a weighted triangular tessellation. In order to evaluate how well the tessellation approximates the 2-dimensional space, we study three types of shortest paths: a weighted shortest path SPw(s,t) , which is a shortest path from s to t in the space; a weighted shortest vertex path SVPw(s,t) , which is a shortest path where the vertices of the path are vertices of the tessellation; and a weighted shortest grid path SGPw(s,t) , which is a shortest path whose edges are edges of the tessellation. The ratios ¿SGPw(s,t)¿¿SPw(s,t)¿ , ¿SVPw(s,t)¿¿SPw(s,t)¿ , ¿SGPw(s,t)¿¿SVPw(s,t)¿ provide estimates on the quality of the approximation. Given any arbitrary weight assignment to the faces of a triangular tessellation, we prove upper and lower bounds on the estimates that are independent of the weight assignment. Our main result is that ¿SGPw(s,t)¿¿SPw(s,t)¿=23v˜1.15 in the worst case, and this is tight.Peer ReviewedPostprint (author's final draft

Transferring Axial Molecular Chirality Through a Sequence of On-Surface Reactions

Fine management of chiral processes on solid surfaces has progressed over the years, yet still faces the need for the controlled and selective production of advanced chiral materials. Here, we report on the use of enantiomerically enriched molecular building blocks to demonstrate the transmission of their intrinsic chirality along a sequence of on-surface reactions. Triggered by thermal annealing, the on-surface reac-tions induced in this experiment involve firstly the coupling of the chiral reactants into chiral polymers and subsequently their transformation into planar prochiral graphene nanoribbons. Our study reveals that the axial chirality of the reactant is not only transferred to the polymers, but also to the planar chirality of the graphene nanoribbon end products. Such chirality transfer consequently allows, starting from ad-equate enantioenriched reactants, for the controlled production of chiral and prochiral organic nanoarchi-tectures with pre-defined handedness