821 resultados para Distance runners


Relevância:

20.00% 20.00%

Publicador:

Resumo:

A sensitive method based on the principle of photothermal phenomena to study the energy transfer processes in organic dye mixtures is presented. A dual beam thermal lens method can be very effectively used as an alternate technique to determine the molecular distance between donor and acceptor in fluorescein–rhodamine B mixture using optical parametric oscillator.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A graph G is strongly distance-balanced if for every edge uv of G and every i 0 the number of vertices x with d.x; u/ D d.x; v/ 1 D i equals the number of vertices y with d.y; v/ D d.y; u/ 1 D i. It is proved that the strong product of graphs is strongly distance-balanced if and only if both factors are strongly distance-balanced. It is also proved that connected components of the direct product of two bipartite graphs are strongly distancebalanced if and only if both factors are strongly distance-balanced. Additionally, a new characterization of distance-balanced graphs and an algorithm of time complexity O.mn/ for their recognition, wheremis the number of edges and n the number of vertices of the graph in question, are given

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Given a graph G and a set X ⊆ V(G), the relative Wiener index of X in G is defined as WX (G) = {u,v}∈X 2  dG(u, v) . The graphs G (of even order) in which for every partition V(G) = V1 +V2 of the vertex set V(G) such that |V1| = |V2| we haveWV1 (G) = WV2 (G) are called equal opportunity graphs. In this note we prove that a graph G of even order is an equal opportunity graph if and only if it is a distance-balanced graph. The latter graphs are known by several characteristic properties, for instance, they are precisely the graphs G in which all vertices u ∈ V(G) have the same total distance DG(u) = v∈V(G) dG(u, v). Some related problems are posed along the way, and the so-called Wiener game is introduced.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Hypermedia systems based on the Web for open distance education are becoming increasingly popular as tools for user-driven access learning information. Adaptive hypermedia is a new direction in research within the area of user-adaptive systems, to increase its functionality by making it personalized [Eklu 961. This paper sketches a general agents architecture to include navigational adaptability and user-friendly processes which would guide and accompany the student during hislher learning on the PLAN-G hypermedia system (New Generation Telematics Platform to Support Open and Distance Learning), with the aid of computer networks and specifically WWW technology [Marz 98-1] [Marz 98-2]. The PLAN-G actual prototype is successfully used with some informatics courses (the current version has no agents yet). The propased multi-agent system, contains two different types of adaptive autonomous software agents: Personal Digital Agents {Interface), to interacl directly with the student when necessary; and Information Agents (Intermediaries), to filtrate and discover information to learn and to adapt navigation space to a specific student

Relevância:

20.00% 20.00%

Publicador:

Resumo:

La participación en carreras atléticas de calle ha aumentado; esto requiere detectar riesgos previos al esfuerzo físico. Objetivo. Identificar factores de riesgo del comportamiento y readiness de inscritos a una carrera. Método. Estudio transversal en aficionados de 18-64 años. Encuesta digital con módulos de IPAQ, PARQ+ y STEP. Muestreo aleatorio sistemático con n=510, para una inactividad física esperada de 35% (±5%). Se evaluó nivel de actividad física, consumo de alcohol (peligroso), de fruta, verdura, tabaco y sal, y readiness. Resultados. El cumplimiento de actividad física fue 97,4%; 2,4% consume nivel óptimo de fruta o verdura (diferencias por edad, sexo y estrato), 3,7% fuma y 44,1% consumo peligroso de alcohol. El 19,8% reportó PARQ+ positivo y 5,7% requiere supervisión. Hay diferencias por trabajo y estudio. Discusión. Los aficionados cumplen el nivel de actividad física; pero no de otros factores. Una estrategia de seguridad en el atletismo de calle es evaluar los factores de riesgo relacionados con el estilo de vida así como el readiness.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Resumen tomado de la publicación. Con el apoyo económico del departamento MIDE de la UNED. Incluye anexos

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Resumen basado en el de la publicaci??n

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present algorithms for computing approximate distance functions and shortest paths from a generalized source (point, segment, polygonal chain or polygonal region) on a weighted non-convex polyhedral surface in which obstacles (represented by polygonal chains or polygons) are allowed. We also describe an algorithm for discretizing, by using graphics hardware capabilities, distance functions. Finally, we present algorithms for computing discrete k-order Voronoi diagrams

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The identification, tracking, and statistical analysis of tropical convective complexes using satellite imagery is explored in the context of identifying feature points suitable for tracking. The feature points are determined based on the shape of complexes using the distance transform technique. This approach has been applied to the determination feature points for tropical convective complexes identified in a time series of global cloud imagery. The feature points are used to track the complexes, and from the tracks statistical diagnostic fields are computed. This approach allows the nature and distribution of organized deep convection in the Tropics to be explored.