Strongly distance-balanced graphs and graph products

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

Equal opportunity networks, distance-balanced graphs, and Wiener game

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.

Double-autoionization decay of resonantly excited single-electron states

Perturbation theory in the lowest non-vanishing order in interelectron interaction has been applied to the theoretical investigation of double-ionization decays of resonantly excited single-electron states. The formulae for the transition probabilities were derived in the LS coupling scheme, and the orbital angular momentum and spin selection rules were obtained. In addition to the formulae, which are exact in this order, three approximate expressions, which correspond to illustrative model mechanisms of the transition, were derived as limiting cases of the exact ones. Numerical results were obtained for the decay of the resonantly excited Kr 1 3d^{-1}5p[^1P] state which demonstrated quite clearly the important role of the interelectron interaction in double-ionization processes. On the other hand, the results obtained show that low-energy electrons can appear in the photoelectron spectrum below the ionization threshold of the 3d shell. As a function of the photon frequency, the yield of these low-energy electrons is strongly amplified by the resonant transition of the 3d electron to 5p (or to other discrete levels), acting as an intermediate state, when the photon frequency approaches that of the transition.

Two-photon decay of the 1s2s ^1S_0 state in _36Kr^34+ produced by resonant transfer and excitation

The doubly excited 2s2p ^1P_1 level of Kr^{34+} populated via resonant transfer and excitation (RTE) feeds selectively the metastable ls2s ^1 S_0 state which can only decay via simultaneous emission of two photons to the ground state 1s^2 ^1 S_0. X-ray/X-ray coincidence measurements in heavy ionatom collisions enable the direct measurement of the spectral distribution of the two-photon decay in He-like ions. In addition, we observe strong photon cascades indueed by radiative electron capture.

Adaptive intelligent agent approach to guide the web navigation on the PLAN-G distance learning platform

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

Racial and spatial interaction for neighborhood dynamics in Chicago

We look at at the empirical validity of Schelling’s models for racial residential segregation applied to the case of Chicago. Most of the empirical literature has focused exclusively the single neighborhood model, also known as the tipping point model and neglected a multineighborhood approach or a unified approach. The multi-neighborhood approach introduced spatial interaction across the neighborhoods, in particular we look at spatial interaction across neighborhoods sharing a border. An initial exploration of the data indicates that spatial contiguity might be relevant to properly analyse the so call tipping phenomena of predominately non-Hispanic white neighborhoods to predominantly minority neighborhoods within a decade. We introduce an econometric model that combines an approach to estimate tipping point using threshold effects and a spatial autoregressive model. The estimation results from the model disputes the existence of a tipping point, that is a discontinuous change in the rate of growth of the non-Hispanic white population due to a small increase in the minority share of the neighborhood. In addition we find that racial distance between the neighborhood of interest and it surrounding neighborhoods has an important effect on the dynamics of racial segregation in Chicago.

The impact of distance deterrence on the choice of field of study in vocational education in the Netherlands. 'El impacto de la disuasión por la distancia en la elección de un campo de estudios en la Formación Profesional en los Países Bajos'.

Resumen tomado de la publicación

Analysis of Spanish regions results in PISA 2006 using parametric distance functions. 'Análisis de los resultados de las regiones españolas en PISA 2006 utilizando funciones paramétricas de distancia'.

Resumen basado en el de la publicación

Las tecnologías de la información y la comunicación en los procesos de orientación para el estudio a distancia. 'Ict in the orientation processes for distance learning'.

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

Decidiendo a distancia con la UNED : organizaci??n de la tarea orientadora en un centro de educaci??n superior a distancia = Making decisions at distance at the UNED guidance provision in a distance education center

Resumen basado en el del autor

Issues in design, creation and production of distance-learning resources. 'Cuestiones en el diseño, creación y producción de recursos para la enseñanza a distancia'.

Resumen basado en el de la publicación

From elite to mass to universal higher education : from distance to open education

Resumen basado en el de la publicaci??n

Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces

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