Vertex

Each complex network (or class of networks) presents specific topological features which characterize its connectivity and highly influence the dynamics of processes executed on the network. The analysis, discrimination, and synthesis of complex networks therefore rely on the use of measurements capable of expressing the most relevant topological features. This article presents a survey of such measurements. It includes general considerations about complex network characterization, a brief review of the principal models, and the ...

The cinematographic version of the science fiction classical book by Isaac Asimov (I, Robot) is used as a starting point, from the Artificial Intelligence perspective, in order to analyze what it is to have a self. Uniqueness or the exchange impossibility and the continuity of being one self are put forward to understand the movie's characters as well as the possibilities of feeling self conscious.

Abstract: There are several applications in VLSI technology that require high-speed shortest-path computations. The shortest path is a path between two nodes (or points) in a graph such that the sum of the weights of its constituent edges is minimum. Floyd-Warshall algorithm provides fastest computation of shortest path between all pair of nodes present in the graph. With rapid advances in VLSI technology, Field Programmable Gate Arrays (FPGAs) are receiving the attention of the Parallel and High Performance Computing community. This paper gives implementation outcome of Floyd-Warshall algorithm to solve the all pairs shortest-paths problem for directed graph in Verilog.

A subset of vertices in a graph is called a dissociation set if it induces a subgraph with a vertex degree of at most 1. The maximum dissociation set problem, i.e., the problem of finding a dissociation set of maximum size in a given graph is known to be NP-hard for bipartite graphs. We show that the maximum dissociation set

466 Resumen Introducción: Se estima que la población chilena geriátrica (≥ 65 años) alcanzará al 16% en el 2030. Se han descrito mayores tiem-pos de estadía en unidades psiquiátricas para ≥ 65 años vs. < 65 años. Buscamos describir comparativamente las características asociadas a tiempos de estadía en nuestra unidad psiquiátrica. Métodos: Revisión retrospectiva de 3112 admisiones entre Julio de 2001 y Junio de 2010, en el servicio de psiquiatría general de la Pontificia Universidad Católica de Chile. Resultados: El 5.1% de las admisiones (n=132) corresponde a pacientes geriátricos. El tiempo de estadía promedio para este grupo fue de 12.4 días (p=0.41). En población geriátrica, como no-geriátrica, encontramos alta prevalencia de trastornos afectivos (63.7% y 55.1%, res-pectivamente). En el grupo geriátrico, se encontró mayor presencia de trastorno bipolar (27.3% vs. 19.5%; p<0.05) y demencia (16.7% vs. 0.5%). Al contrario, en ≥ 65 años hubo significativamente menor prevalencia...

Each complex network (or class of networks) presents specific topological features which characterize its connectivity and highly influence the dynamics of processes executed on the network. The analysis, discrimination, and synthesis of complex networks therefore rely on the use of measurements capable of expressing the most relevant topological features. This article presents a survey of such measurements. It includes general considerations about complex network characterization, a brief review of the principal models, and the ...

We explore some second-order amplitudes in loop quantum gravity. In particular, we compute some second-order contributions to diagonal components of the graviton propagator in the large distance limit, using the old version of the Barrett-Crane vertex amplitude. We illustrate the geometry associated to these terms. We find some peculiar phenomena in the large distance behavior of these amplitudes, related with the geometry of the generalized triangulations dual to the Feynman graphs of the corresponding group field theory. In particular, we point out a possible further difficulty with the old Barrett-Crane vertex: it appears to lead to flatness instead of Ricci-flatness, at least in some situations. The observation raises the question whether this difficulty remains with the new version of the vertex.

In this paper, we introduce the one-two descriptor. The one-two descriptors is the sum of the vertex contributions such that each pendant vertex contributes 1, each vertex of degree two adjacent to pendant vertex contributes 2, and each vertex of degree higher than two also contributes 2. We test this descriptor on the benchmark data set of the octane isomers proposed by the International Academy of Mathematical Chemistry. We show that this descriptor is a good predictor of the heat capacity at P constant (CP) and of the total surface area (TSA). Linear model predictions for both these properties are better then predictions of any of the benchmark descriptors proposed by International Academy of Mathematical Chemistry. Linear model predictions of TSA are also better then predictions of any of Adriatic descriptors, while linear model predictions of CP are not as good as predictions by Adriatic descriptor called inverse sum lordeg index. We also analyze the mathematical properties of this descriptor and we find tight upper and lower bounds in the families of the trees with n vertices and the chemical trees with n vertices.