Differences brick facade design to horizontal loads between the Spanish and European standards

Brick facades are a construction type, strongly linked to local construction characteristics and methods. In Spain, particularly in Castilla, the facades have been built since the '80s with Castilian half foot (11.5 cm), resting on the edge of slabs. The design of these facades, to horizontal loads from wind, depending on the codes used, can lead to completely different valid solutions. Applying same loads, the facades studied with current European standard (Eurocode 6), have a maximum length of 7.1 m between supports, while the Spanish code, Technical Building Code - Structural Safety Masonry, (CTE SE-F), 8.4 m can be achieved. This represents an increase of flexural strength, depending on the calculation model used, which can reach until 8 times. This is due to the difference of the calculation method and the structural model in one and another standard, depending on if this facade is analyzed as a vertical or horizontal beam or by formation of a vertical or horizontal archh. This paper analyzes the constructive solution of the brick facades that results from applying Spanish or European standards and how it affects the model applied in the safety of the resulting facade.

Strong Connectivity in Directed Hypergraphs and its Application to the Atomic Decomposition of Ontologies

Los hipergrafos dirigidos se han empleado en problemas relacionados con lógica proposicional, bases de datos relacionales, linguística computacional y aprendizaje automático. Los hipergrafos dirigidos han sido también utilizados como alternativa a los grafos (bipartitos) dirigidos para facilitar el estudio de las interacciones entre componentes de sistemas complejos que no pueden ser fácilmente modelados usando exclusivamente relaciones binarias. En este contexto, este tipo de representación es conocida como hiper-redes. Un hipergrafo dirigido es una generalización de un grafo dirigido especialmente adecuado para la representación de relaciones de muchos a muchos. Mientras que una arista en un grafo dirigido define una relación entre dos de sus nodos, una hiperarista en un hipergrafo dirigido define una relación entre dos conjuntos de sus nodos. La conexión fuerte es una relación de equivalencia que divide el conjunto de nodos de un hipergrafo dirigido en particiones y cada partición define una clase de equivalencia conocida como componente fuertemente conexo. El estudio de los componentes fuertemente conexos de un hipergrafo dirigido puede ayudar a conseguir una mejor comprensión de la estructura de este tipo de hipergrafos cuando su tamaño es considerable. En el caso de grafo dirigidos, existen algoritmos muy eficientes para el cálculo de los componentes fuertemente conexos en grafos de gran tamaño. Gracias a estos algoritmos, se ha podido averiguar que la estructura de la WWW tiene forma de “pajarita”, donde más del 70% del los nodos están distribuidos en tres grandes conjuntos y uno de ellos es un componente fuertemente conexo. Este tipo de estructura ha sido también observada en redes complejas en otras áreas como la biología. Estudios de naturaleza similar no han podido ser realizados en hipergrafos dirigidos porque no existe algoritmos capaces de calcular los componentes fuertemente conexos de este tipo de hipergrafos. En esta tesis doctoral, hemos investigado como calcular los componentes fuertemente conexos de un hipergrafo dirigido. En concreto, hemos desarrollado dos algoritmos para este problema y hemos determinado que son correctos y cuál es su complejidad computacional. Ambos algoritmos han sido evaluados empíricamente para comparar sus tiempos de ejecución. Para la evaluación, hemos producido una selección de hipergrafos dirigidos generados de forma aleatoria inspirados en modelos muy conocidos de grafos aleatorios como Erdos-Renyi, Newman-Watts-Strogatz and Barabasi-Albert. Varias optimizaciones para ambos algoritmos han sido implementadas y analizadas en la tesis. En concreto, colapsar los componentes fuertemente conexos del grafo dirigido que se puede construir eliminando ciertas hiperaristas complejas del hipergrafo dirigido original, mejora notablemente los tiempos de ejecucion de los algoritmos para varios de los hipergrafos utilizados en la evaluación. Aparte de los ejemplos de aplicación mencionados anteriormente, los hipergrafos dirigidos han sido también empleados en el área de representación de conocimiento. En concreto, este tipo de hipergrafos se han usado para el cálculo de módulos de ontologías. Una ontología puede ser definida como un conjunto de axiomas que especifican formalmente un conjunto de símbolos y sus relaciones, mientras que un modulo puede ser entendido como un subconjunto de axiomas de la ontología que recoge todo el conocimiento que almacena la ontología sobre un conjunto especifico de símbolos y sus relaciones. En la tesis nos hemos centrado solamente en módulos que han sido calculados usando la técnica de localidad sintáctica. Debido a que las ontologías pueden ser muy grandes, el cálculo de módulos puede facilitar las tareas de re-utilización y mantenimiento de dichas ontologías. Sin embargo, analizar todos los posibles módulos de una ontología es, en general, muy costoso porque el numero de módulos crece de forma exponencial con respecto al número de símbolos y de axiomas de la ontología. Afortunadamente, los axiomas de una ontología pueden ser divididos en particiones conocidas como átomos. Cada átomo representa un conjunto máximo de axiomas que siempre aparecen juntos en un modulo. La decomposición atómica de una ontología es definida como un grafo dirigido de tal forma que cada nodo del grafo corresponde con un átomo y cada arista define una dependencia entre una pareja de átomos. En esta tesis introducimos el concepto de“axiom dependency hypergraph” que generaliza el concepto de descomposición atómica de una ontología. Un modulo en una ontología correspondería con un componente conexo en este tipo de hipergrafos y un átomo de una ontología con un componente fuertemente conexo. Hemos adaptado la implementación de nuestros algoritmos para que funcionen también con axiom dependency hypergraphs y poder de esa forma calcular los átomos de una ontología. Para demostrar la viabilidad de esta idea, hemos incorporado nuestros algoritmos en una aplicación que hemos desarrollado para la extracción de módulos y la descomposición atómica de ontologías. A la aplicación la hemos llamado HyS y hemos estudiado sus tiempos de ejecución usando una selección de ontologías muy conocidas del área biomédica, la mayoría disponibles en el portal de Internet NCBO. Los resultados de la evaluación muestran que los tiempos de ejecución de HyS son mucho mejores que las aplicaciones más rápidas conocidas. ABSTRACT Directed hypergraphs are an intuitive modelling formalism that have been used in problems related to propositional logic, relational databases, computational linguistic and machine learning. Directed hypergraphs are also presented as an alternative to directed (bipartite) graphs to facilitate the study of the interactions between components of complex systems that cannot naturally be modelled as binary relations. In this context, they are known as hyper-networks. A directed hypergraph is a generalization of a directed graph suitable for representing many-to-many relationships. While an edge in a directed graph defines a relation between two nodes of the graph, a hyperedge in a directed hypergraph defines a relation between two sets of nodes. Strong-connectivity is an equivalence relation that induces a partition of the set of nodes of a directed hypergraph into strongly-connected components. These components can be collapsed into single nodes. As result, the size of the original hypergraph can significantly be reduced if the strongly-connected components have many nodes. This approach might contribute to better understand how the nodes of a hypergraph are connected, in particular when the hypergraphs are large. In the case of directed graphs, there are efficient algorithms that can be used to compute the strongly-connected components of large graphs. For instance, it has been shown that the macroscopic structure of the World Wide Web can be represented as a “bow-tie” diagram where more than 70% of the nodes are distributed into three large sets and one of these sets is a large strongly-connected component. This particular structure has been also observed in complex networks in other fields such as, e.g., biology. Similar studies cannot be conducted in a directed hypergraph because there does not exist any algorithm for computing the strongly-connected components of the hypergraph. In this thesis, we investigate ways to compute the strongly-connected components of directed hypergraphs. We present two new algorithms and we show their correctness and computational complexity. One of these algorithms is inspired by Tarjan’s algorithm for directed graphs. The second algorithm follows a simple approach to compute the stronglyconnected components. This approach is based on the fact that two nodes of a graph that are strongly-connected can also reach the same nodes. In other words, the connected component of each node is the same. Both algorithms are empirically evaluated to compare their performances. To this end, we have produced a selection of random directed hypergraphs inspired by existent and well-known random graphs models like Erd˝os-Renyi and Newman-Watts-Strogatz. Besides the application examples that we mentioned earlier, directed hypergraphs have also been employed in the field of knowledge representation. In particular, they have been used to compute the modules of an ontology. An ontology is defined as a collection of axioms that provides a formal specification of a set of terms and their relationships; and a module is a subset of an ontology that completely captures the meaning of certain terms as defined in the ontology. In particular, we focus on the modules computed using the notion of syntactic locality. As ontologies can be very large, the computation of modules facilitates the reuse and maintenance of these ontologies. Analysing all modules of an ontology, however, is in general not feasible as the number of modules grows exponentially in the number of terms and axioms of the ontology. Nevertheless, the modules can succinctly be represented using the Atomic Decomposition of an ontology. Using this representation, an ontology can be partitioned into atoms, which are maximal sets of axioms that co-occur in every module. The Atomic Decomposition is then defined as a directed graph such that each node correspond to an atom and each edge represents a dependency relation between two atoms. In this thesis, we introduce the notion of an axiom dependency hypergraph which is a generalization of the atomic decomposition of an ontology. A module in the ontology corresponds to a connected component in the hypergraph, and the atoms of the ontology to the strongly-connected components. We apply our algorithms for directed hypergraphs to axiom dependency hypergraphs and in this manner, we compute the atoms of an ontology. To demonstrate the viability of this approach, we have implemented the algorithms in the application HyS which computes the modules of ontologies and calculate their atomic decomposition. In the thesis, we provide an experimental evaluation of HyS with a selection of large and prominent biomedical ontologies, most of which are available in the NCBO Bioportal. HyS outperforms state-of-the-art implementations in the tasks of extracting modules and computing the atomic decomposition of these ontologies.

Artisan procedures to generate uniform tilings

This paper try to prove how artisans c ould discover all uniform tilings and very interesting others us ing artisanal combinatorial pro cedures without having to use mathematical procedures out of their reac h. Plane Geometry started up his way through History by means of fundamental drawing tools: ruler and co mpass. Artisans used same tools to carry out their orna mental patterns but at some point they began to work manually using physical representations of fi gures or tiles previously drawing by means of ruler and compass. That is an important step for craftsman because this way provides tools that let him come in the world of symmetry opera tions and empirical knowledge of symmetry groups. Artisans started up to pr oduce little wooden, ceramic or clay tiles and began to experiment with them by means of joining pieces whether edge to edge or vertex to vertex in that way so it can c over the plane without gaps. Economy in making floor or ceramic tiles could be most important reason to develop these procedures. This empiric way to develop tilings led not only to discover all uniform tilings but later discovering of aperiodic tilings.

From residue matching patterns to protein folding topographies: General model and bovine pancreatic trypsin inhibitor

A coarse-grained model for protein-folding dynamics is introduced based on a discretized representation of torsional modes. The model, based on the Ramachandran map of the local torsional potential surface and the class (hydrophobic/polar/neutral) of each residue, recognizes patterns of both torsional conformations and hydrophobic-polar contacts, with tolerance for imperfect patterns. It incorporates empirical rates for formation of secondary and tertiary structure. The method yields a topological representation of the evolving local torsional configuration of the folding protein, modulo the basins of the Ramachandran map. The folding process is modeled as a sequence of transitions from one contact pattern to another, as the torsional patterns evolve. We test the model by applying it to the folding process of bovine pancreatic trypsin inhibitor, obtaining a kinetic description of the transitions between the contact patterns visited by the protein along the dominant folding pathway. The kinetics and detailed balance make it possible to invert the result to obtain a coarse topographic description of the potential energy surface along the dominant folding pathway, in effect to go backward or forward between a topological representation of the chain conformation and a topographical description of the potential energy surface governing the folding process. As a result, the strong structure-seeking character of bovine pancreatic trypsin inhibitor and the principal features of its folding pathway are reproduced in a reasonably quantitative way.

X-Ray Imaging of SAPO-34 Molecular Sieves at the Nanoscale: Influence of Steaming on the Methanol-to-Hydrocarbons Reaction

The effect of a severe steaming treatment on the physicochemical properties and catalytic performance of H-SAPO-34 molecular sieves during the methanol-to-hydrocarbons (MTH) reaction has been investigated with a combination of scanning transmission X-ray microscopy (STXM), catalytic testing, and bulk characterization techniques, including ammonia temperature programmed desorption and 27Al and 29Si magic angle spinning nuclear magnetic resonance. For this purpose, two samples, namely a calcined and a steamed H-SAPO-34 catalyst powder, have been compared. It has been found that calcined H-SAPO-34 displays a high selectivity towards light olefins, yet shows a poor stability as compared to a zeolite H-ZSM-5 catalyst. Moreover, in situ STXM at the carbon K-edge during the MTH reaction allows construction of nanoscale chemical maps of the hydrocarbon species formed within the H-SAPO-34 aggregates as a function of reaction time and steam post-treatment. It was found that there is an initial preferential formation of coke precursor species within the core of the H-SAPO-34 aggregates. For longer times on stream the formation of the coke precursor species is extended to the outer regions, progressively filling the entire H-SAPO-34 catalyst particle. In contrast, the hydrothermally treated H-SAPO-34 showed similar reaction selectivity, but decreased activity and catalyst stability with respect to its calcined counterpart. These variations in MTH performance are related to a faster and more homogeneous formation of coke precursor species filling up the entire steamed H-SAPO-34 catalyst particle. Finally, the chemical imaging capabilities of the STXM method at the Al and Si K-edge are illustrated by visualizing the silicon islands at the nanoscale before and after steaming H-SAPO-34.

Quantum anomalous Hall effect in graphene coupled to skyrmions

Skyrmions are topologically protected spin textures, characterized by a topological winding number N, that occur spontaneously in some magnetic materials. Recent experiments have demonstrated the capability to grow graphene on top Fe/Ir, a system that exhibits a two-dimensional skyrmion lattice. Here we show that a weak exchange coupling between the Dirac electrons in graphene and a two-dimensional skyrmion lattice withN = ±1 drives graphene into a quantum anomalous Hall phase, with a band gap in bulk, a Chern number C = 2N, and chiral edge states with perfect quantization of conductance G = 2N e2 h . Our findings imply that the topological properties of the skyrmion lattice can be imprinted in the Dirac electrons of graphene.

A connectionist computational method for face recognition

In this work, a modified version of the elastic bunch graph matching (EBGM) algorithm for face recognition is introduced. First, faces are detected by using a fuzzy skin detector based on the RGB color space. Then, the fiducial points for the facial graph are extracted automatically by adjusting a grid of points to the result of an edge detector. After that, the position of the nodes, their relation with their neighbors and their Gabor jets are calculated in order to obtain the feature vector defining each face. A self-organizing map (SOM) framework is shown afterwards. Thus, the calculation of the winning neuron and the recognition process are performed by using a similarity function that takes into account both the geometric and texture information of the facial graph. The set of experiments carried out for our SOM-EBGM method shows the accuracy of our proposal when compared with other state-of the-art methods.

Various Shiite devotional texts to be recited in religious assemblies (majālis) commemorating the events leading to the martyrdom of the Shii Imam Ḥusain b. ʻAlī (d. 860)] : manuscript, 1900?

Various Shiite devotional texts to be recited in religious assemblies (majālis) commemorating the events leading to the martyrdom of the Shii Imam Ḥusain b. ʻAlī (d. 680). Each majlis (there is twenty) begins with a synoptic heading. The beginning of 17th majlis suggests that some of these texts are based on Mahdī b. Abī Zarr al-Kāshānī an-Niraqī's "Muḥarriq al-qulub (a Shiite history of the martyrs of the Prophet's family).

The European Union as a Mediator in Israel-Palestine: Operations Cast Lead and Protective Edge. EU Diplomacy Paper 01/2016

The European Union (EU) has played an important, yet inconsistent role in the Israel-Palestine conflict since the1980 Venice Declaration. This paper analyses how the EU’s role as a mediator has changed more recently in the Israel-Gaza conflict. Specifically, it examines how the ‘Concept on Strengthening EU Mediation and Dialogue Capacities’ adopted in 2009 and the creation of the European External Action Service and the High Representative by the Lisbon Treaty have changed the EU’s resources and strategies as a mediator as well as how these developments improved cooperation and coordination with other mediators. This analysis is done through a comparison of the EU’s role in the Israeli Operation Cast Lead in 2008/2009 and Operation Protective Edge in 2014. It is argued that the aforementioned changes made the EU a more capable mediator and facilitated internal coordination. However, these changes did not create more resources for the EU as a mediator, rather they changed how the EU used its resources.

Routine histological technique applied to a biological model for environmental studies

Introduction and aim Earthworms are an important test organisms used in several standard ecotoxicological tests (e.g. ISO, 2008, 2012; OECD, 2004, 1094) and they are also model organisms to test soil structure and permeability, as well as for important soil services as the degradation organic matter. Although histopathological changes have been demonstrated to be good biomarkers to assess the exposure of these animals to different physical and chemical stress agents, studies with clear and high quality images describing normal tissue conditions are scarce in the literature, so the aim of this work was to better characterize this biological model. Material and Methods Eight adult earthworms exposed to an artificial standard soil (OECD, 2004) for 28 days, were extracted and placed in a plastic box to depurate their gut content, fixed in 10% neutral-buffered formalin and processed for routine histopathological diagnosis. Results and discussion Satisfactory histological sections were obtained. Some difficulties were faced related with microtome sectioning, resulting in artefacts, namely lines across sections produced by a nick in the cutting edge of the microtome knife cutting tear, motivated by the presence of sand and other solid particles that persisted in the gut of earthworms. Nevertheless, it was possible to obtain representative figures from different earthworm sections. Conclusion Routine histological technique was effective for obtaining satisfactory histological sections and the knowledge of the histology of earthworms could be very useful for future application in environmental studies, using this biological model.

Edge city and ISTEA - examining the transportation implications of suburban development patterns. Summary of proceedings: seminar on edge city and ISTEA - so what?.

Mode of access: Internet.