105 resultados para De Bruijn-Erdos


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Atmospheric conditions at the site of a cosmic ray observatory must be known for reconstructing observed extensive air showers. The Global Data Assimilation System (GDAS) is a global atmospheric model predicated on meteorological measurements and numerical weather predictions. GDAS provides altitude-dependent profiles of the main state variables of the atmosphere like temperature, pressure, and humidity. The original data and their application to the air shower reconstruction of the Pierre Auger Observatory are described. By comparisons with radiosonde and weather station measurements obtained on-site in Malargue and averaged monthly models, the utility of the GDAS data is shown. (C) 2012 Elsevier B.V. All rights reserved.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The Pierre Auger Observatory is exploring the potential of the radio detection technique to study extensive air showers induced by ultra-high energy cosmic rays. The Auger Engineering Radio Array (AERA) addresses both technological and scientific aspects of the radio technique. A first phase of AERA has been operating since September 2010 with detector stations observing radio signals at frequencies between 30 and 80 MHz. In this paper we present comparative studies to identify and optimize the antenna design for the final configuration of AERA consisting of 160 individual radio detector stations. The transient nature of the air shower signal requires a detailed description of the antenna sensor. As the ultra-wideband reception of pulses is not widely discussed in antenna literature, we review the relevant antenna characteristics and enhance theoretical considerations towards the impulse response of antennas including polarization effects and multiple signal reflections. On the basis of the vector effective length we study the transient response characteristics of three candidate antennas in the time domain. Observing the variation of the continuous galactic background intensity we rank the antennas with respect to the noise level added to the galactic signal.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The Pierre Auger Observatory is a facility built to detect air showers produced by cosmic rays above 10(17) eV. During clear nights with a low illuminated moon fraction, the UV fluorescence light produced by air showers is recorded by optical telescopes at the Observatory. To correct the observations for variations in atmospheric conditions, atmospheric monitoring is performed at regular intervals ranging from several minutes (for cloud identification) to several hours (for aerosol conditions) to several days (for vertical profiles of temperature, pressure, and humidity). In 2009, the monitoring program was upgraded to allow for additional targeted measurements of atmospheric conditions shortly after the detection of air showers of special interest, e. g., showers produced by very high-energy cosmic rays or showers with atypical longitudinal profiles. The former events are of particular importance for the determination of the energy scale of the Observatory, and the latter are characteristic of unusual air shower physics or exotic primary particle types. The purpose of targeted (or "rapid") monitoring is to improve the resolution of the atmospheric measurements for such events. In this paper, we report on the implementation of the rapid monitoring program and its current status. The rapid monitoring data have been analyzed and applied to the reconstruction of air showers of high interest, and indicate that the air fluorescence measurements affected by clouds and aerosols are effectively corrected using measurements from the regular atmospheric monitoring program. We find that the rapid monitoring program has potential for supporting dedicated physics analyses beyond the standard event reconstruction.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

For fixed positive integers r, k and E with 1 <= l < r and an r-uniform hypergraph H, let kappa(H, k, l) denote the number of k-colorings of the set of hyperedges of H for which any two hyperedges in the same color class intersect in at least l elements. Consider the function KC(n, r, k, l) = max(H epsilon Hn) kappa(H, k, l), where the maximum runs over the family H-n of all r-uniform hypergraphs on n vertices. In this paper, we determine the asymptotic behavior of the function KC(n, r, k, l) for every fixed r, k and l and describe the extremal hypergraphs. This variant of a problem of Erdos and Rothschild, who considered edge colorings of graphs without a monochromatic triangle, is related to the Erdos-Ko-Rado Theorem (Erdos et al., 1961 [8]) on intersecting systems of sets. (C) 2011 Elsevier Ltd. All rights reserved.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The surface detector array of the Pierre Auger Observatory can detect neutrinos with energy E-nu between 10(17) eV and 10(20) eV from point-like sources across the sky south of +55 degrees and north of -65 degrees declinations. A search has been performed for highly inclined extensive air showers produced by the interaction of neutrinos of all flavors in the atmosphere (downward-going neutrinos), and by the decay of tau leptons originating from tau neutrino interactions in Earth's crust (Earth-skimming neutrinos). No candidate neutrinos have been found in data up to 2010 May 31. This corresponds to an equivalent exposure of similar to 3.5 years of a full surface detector array for the Earth-skimming channel and similar to 2 years for the downward-going channel. An improved upper limit on the diffuse flux of tau neutrinos has been derived. Upper limits on the neutrino flux from point-like sources have been derived as a function of the source declination. Assuming a differential neutrino flux k(PS) . E-nu(-2). from a point-like source, 90% confidence level upper limits for k(PS) at the level of approximate to 5x10(-7) and 2.5x10(-6) GeV cm(-2) s(-1) have been obtained over a broad range of declinations from the searches for Earth-skimming and downward-going neutrinos, respectively.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A thorough search of the sky exposed at the Pierre Auger Cosmic Ray Observatory reveals no statistically significant excess of events in any small solid angle that would be indicative of a flux of neutral particles from a discrete source. The search covers from -90 degrees to +15 degrees in declination using four different energy ranges above 1 EeV (10(18) eV). The method used in this search is more sensitive to neutrons than to photons. The upper limit on a neutron flux is derived for a dense grid of directions for each of the four energy ranges. These results constrain scenarios for the production of ultrahigh energy cosmic rays in the Galaxy.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A thorough search for large-scale anisotropies in the distribution of arrival directions of cosmic rays detected above 10(18) eV at the Pierre Auger Observatory is presented. This search is performed as a function of both declination and right ascension in several energy ranges above 10(18) eV, and reported in terms of dipolar and quadrupolar coefficients. Within the systematic uncertainties, no significant deviation from isotropy is revealed. Assuming that any cosmic-ray anisotropy is dominated by dipole and quadrupole moments in this energy range, upper limits on their amplitudes are derived. These upper limits allow us to test the origin of cosmic rays above 10(18) eV from stationary Galactic sources densely distributed in the Galactic disk and predominantly emitting light particles in all directions.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We report a measurement of the proton-air cross section for particle production at the center-of-mass energy per nucleon of 57 TeV. This is derived from the distribution of the depths of shower maxima observed with the Pierre Auger Observatory: systematic uncertainties are studied in detail. Analyzing the tail of the distribution of the shower maxima, a proton-air cross section of [505 +/- 22(stat)(-36)(+28)(syst)] mb is found.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

BACKGROUND: Atypical myopathy is an acute, severe rhabdomyolysis occurring in grazing horses. In the beginning of October 2009, a new outbreak occurred in several European countries. Geographic, demographic and clinical data of the reported cases in the month October 2009 are described. KEY FINDINGS: The survival rate in this outbreak was 25%. The most frequently observed clinical signs were congested mucous membranes, dyspnea, tachycardia, depression, weakness, stiffness, recumbency, trembling, sweating, and myoglobinuria. Nonsurvivors were significantly more likely to be recumbent than survivors. Prognostic factors, symptomatic treatment, and preventive measures are discussed. SIGNIFICANCE: Differences were encountered during the described outbreak of atypical myopathy in October 2009 compared with previous outbreaks reported. Equine practitioners should be aware that previous epidemiological studies have shown that after a high prevalence in the autumn, new cases are likely to occur in the following spring.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We have previously shown that proteins can be incorporated into the latticework of calcium phosphate layers when biomimetically coprecipitated with the inorganic components, upon the surfaces of titanium-alloy implants. In the present study, we wished to ascertain whether recombinant human bone morphogenetic protein 2 (rhBMP-2) thus incorporated retained its bioactivity as an osteoinductive agent. Titanium alloy implants were coated biomimetically with a layer of calcium phosphate in the presence of different concentrations of rhBMP-2 (0.1-10 microg/mL). rhBMP-2 was successfully incorporated into the crystal latticework, as revealed by protein blot staining. rhBMP-2 was taken up by the calcium phosphate coatings in a dose-dependent manner, as determined by ELISA. Rat bone marrow stromal cells were grown directly on these coatings for 8 days. Their osteogenicity was then assessed quantitatively by monitoring alkaline phosphatase activity. This parameter increased as a function of rhBMP-2 concentrations within the coating medium. rhBMP-2 incorporated into calcium phosphate coatings was more potent in stimulating the alkaline phosphatase activity of the adhering cell layer than was the freely suspended drug in stimulating that of cell layers grown on a plastic substratum. This system may be of osteoinductive value in orthopedic and dental implant surgery.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

ANTECEDENTES: La mayoría de las islas en West Indies no tienen leyes liberales sobre el aborto, ni programas para la prevención del embarazo (contracepción). El presente trabajo presenta los resultados de una revisión de la literatura sobre la actitud de los proveedores del cuidado de la salud y las mujeres hacia la contracepción y el aborto inducido (emergencia), prevalencia, métodos y aspectos jurídicos del aborto inducido y políticas de prevención. MÉTODOS: Se obtuvieron artículos de PubMed, EMBASE, MEDLINE, PsychINFO y SocIndex (1999 a 2010) que usaban como palabras claves contracepción, aborto inducido, terminación de embarazo, aborto médico y West Indies. RESULTADOS: Treinta y siete artículos correspondían al criterio de inclusión: 18 sobre contracepción, 17 sobre aborto inducido y 2 sobre ambos asuntos. Los resultados principales indicaron que los conocimientos de los proveedores de cuidado de la salud acerca de la contracepción de emergencia, eran pobres. Los estudios mostraron un conocimiento pobre de la contracepción, pero las sesiones de counseling aumentaron su efectividad. No se encontraron números exactos sobre la prevalencia del aborto. Se estima que el número total de abortos por año en West Indies es de 300 000. Uno de cada cuatro embarazos termina en aborto. El uso de misoprostol disminuyó las complicaciones de abortos inseguros.La legislación sobre el aborto varía ampliamente en las diferentes islas del Caribe: Cuba, Puerto Rico, Martinica, Guadalupe y San Martín tienen abortos legales. Barbados fue la primera isla angloparlante con legislación liberal para el aborto. Todas las otras islas tienen leyes restrictivas. CONCLUSIÓN: A pesar del alto número de abortos, según se estima, no hay investigaciones sobre la prevalencia del aborto. Los estudios mostraron un pobre conocimiento de la contracepción y un uso bajo entre los adolescentes. La mayoría de las islas del Caribe tienen leyes restrictivas contra el aborto.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

En este trabajo se da un ejemplo de un conjunto de n puntos situados en posición general, en el que se alcanza el mínimo número de puntos que pueden formar parte de algún k-set para todo k con 1menor que=kmenor quen/2. Se generaliza también, a puntos en posición no general, el resultado de Erdõs et al., 1973, sobre el mínimo número de puntos que pueden formar parte de algún k-set. The study of k- sets is a very relevant topic in the research area of computational geometry. The study of the maximum and minimum number of k-sets in sets of points of the plane in general position, specifically, has been developed at great length in the literature. With respect to the maximum number of k-sets, lower bounds for this maximum have been provided by Erdõs et al., Edelsbrunner and Welzl, and later by Toth. Dey also stated an upper bound for this maximum number of k-sets. With respect to the minimum number of k-set, this has been stated by Erdos el al. and, independently, by Lovasz et al. In this paper the authors give an example of a set of n points in the plane in general position (no three collinear), in which the minimum number of points that can take part in, at least, a k-set is attained for every k with 1 ≤ k < n/2. The authors also extend Erdos’s result about the minimum number of points in general position which can take part in a k-set to a set of n points not necessarily in general position. That is why this work complements the classic works we have mentioned before.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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.