On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

Application for fault location in electrical power distribution systems

Fault location has been studied deeply for transmission lines due to its importance in power systems. Nowadays the problem of fault location on distribution systems is receiving special attention mainly because of the power quality regulations. In this context, this paper presents an application software developed in Matlabtrade that automatically calculates the location of a fault in a distribution power system, starting from voltages and currents measured at the line terminal and the model of the distribution power system data. The application is based on a N-ary tree structure, which is suitable to be used in this application due to the highly branched and the non- homogeneity nature of the distribution systems, and has been developed for single-phase, two-phase, two-phase-to-ground, and three-phase faults. The implemented application is tested by using fault data in a real electrical distribution power system

Introduction to Network Mathematics

Introduction to Network Mathematics provides college students with basic graph theory to better understand the Internet

Efectividad del tratamiento farmacológico de la agresividad en pacientes con trastorno límite de la personalidad. Revisión sistemática

Introducción: el Trastorno Límite de la Personalidad afecta del 2% al 6% de los adultos en Estados Unidos. Es una condición de alta relevancia dentro de las patologías psiquiátricas debido a características como impulsividad, inestabilidad en las relaciones interpersonales, disregulación en el estado de ánimo y comportamiento agresivo. Esto determina un impacto negativo en la funcionalidad del individuo siendo la agresividad contra sí mismo o contra otras personas uno de sus componentes claves. Métodos: Revisión sistemática de la literatura de artículos de bases de datos y búsqueda manual de revistas relacionadas que aportaran la mejor evidencia con el fin de encontrar estudios que evaluaran, con instrumentos objetivos, los tratamientos farmacológicos disponibles para el manejo de la agresividad en el TLP .Se evaluó calidad metodológica y los estudios se organizaron en tablas de evidencia. Resultados: La búsqueda arrojo 1081 artículos de los cuales se seleccionaron 52 como potenciales y cinco fueron incluidos en esta revisión. Se clasificaron como nivel de evidencia Ib. El topiramato, el aripiprazol, el divalproato y la fluoxetina mostraron mejores resultados que el placebo especialmente en agresividad e impulsividad. El topiramato fue asociado con pérdida de peso. Los medicamentos fueron seguros y bien tolerados. Discusión: Los medicamentos evaluados mostraron ser mejores que placebo. La diversidad en las escalas utilizadas genera complejidad en la interpretación de resultados. Conclusión: La evidencia sugiere que el tratamiento farmacológico es efectivo en síntomas como agresividad e impulsividad comparado con placebo. Deben considerarse estudios que evalúen combinaciones de fármacos y psicoterapia.

WAIS seminar:Mathematics for Web Science Part3-1

ABSTRACT In the first two seminars we looked at the evolution of Ontologies from the current OWL level towards more powerful/expressive models and the corresponding hierarchy of Logics that underpin every stage of this evolution. We examined this in the more general context of the general evolution of the Web as a mathematical (directed and weighed) graph and the archetypical “living network” In the third seminar we will analyze further some of the startling properties that the Web has as a graph/network and which it shares with an array of “real-life” networks as well as some key elements of the mathematics (probability, statistics and graph theory) that underpin all this. No mathematical prerequisites are assumed or required. We will outline some directions that current (2005-now) research is taking and conclude with some illustrations/examples from ongoing research and applications that show great promise.

WAIS seminar:Mathematics for Web Science Part 3-2

ABSTRACT In the first two seminars we looked at the evolution of Ontologies from the current OWL level towards more powerful/expressive models and the corresponding hierarchy of Logics that underpin every stage of this evolution. We examined this in the more general context of the general evolution of the Web as a mathematical (directed and weighed) graph and the archetypical “living network” In the third seminar we will analyze further some of the startling properties that the Web has as a graph/network and which it shares with an array of “real-life” networks as well as some key elements of the mathematics (probability, statistics and graph theory) that underpin all this. No mathematical prerequisites are assumed or required. We will outline some directions that current (2005-now) research is taking and conclude with some illustrations/examples from ongoing research and applications that show great promise.

WAIS seminar: Mathematics for Web Science: Part 3-3

ABSTRACT In the first two seminars we looked at the evolution of Ontologies from the current OWL level towards more powerful/expressive models and the corresponding hierarchy of Logics that underpin every stage of this evolution. We examined this in the more general context of the general evolution of the Web as a mathematical (directed and weighed) graph and the archetypical “living network” In the third seminar we will analyze further some of the startling properties that the Web has as a graph/network and which it shares with an array of “real-life” networks as well as some key elements of the mathematics (probability, statistics and graph theory) that underpin all this. No mathematical prerequisites are assumed or required. We will outline some directions that current (2005-now) research is taking and conclude with some illustrations/examples from ongoing research and applications that show great promise.

Impacto de la apertura en la conectividad e integración de Colombia en la red mundial de comercio

La liberalización colombiana es analizada, con frecuencia, con los coeficientes de apertura, este documento, en cambio, presenta un análisis complementario a través de algoritmos usados en la teoría de redes para caracterizar sistemas complejos. Esta nueva aproximación devela estructuras de la red mundial de comercio antes y después de la apertura, así como cambios en la posición colombiana.

Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces

We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a possibly non-convex polyhedral surface in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) on a polyhedral surface with obstacles. To obtain the discrete Voronoi diagrams our algorithms, exploiting hardware graphics capabilities, compute shortest path distances defined by the sites

Large-Scale Surface registration

The first part of this work presents an accurate analysis of the most relevant 3D registration techniques, including initial pose estimation, pairwise registration and multiview registration strategies. A new classification has been proposed, based on both the applications and the approach of the methods that have been discussed. The main contribution of this thesis is the proposal of a new 3D multiview registration strategy. The proposed approach detects revisited regions obtaining cycles of views that are used to reduce the inaccuracies that may exist in the final model due to error propagation. The method takes advantage of both global and local information of the registration process, using graph theory techniques in order correlate multiple views and minimize the propagated error by registering the views in an optimal way. The proposed method has been tested using both synthetic and real data, in order to show and study its behavior and demonstrate its reliability.

Molecular quantum similarity in QSAR: applications in computer-aided molecular design

La present tesi està centrada en l'ús de la Teoria de Semblança Quàntica per a calcular descriptors moleculars. Aquests descriptors s'utilitzen com a paràmetres estructurals per a derivar correlacions entre l'estructura i la funció o activitat experimental per a un conjunt de compostos. Els estudis de Relacions Quantitatives Estructura-Activitat són d'especial interès per al disseny racional de molècules assistit per ordinador i, en particular, per al disseny de fàrmacs. Aquesta memòria consta de quatre parts diferenciades. En els dos primers blocs es revisen els fonaments de la teoria de semblança quàntica, així com l'aproximació topològica basada en la teoria de grafs. Ambdues teories es fan servir per a calcular els descriptors moleculars. En el segon bloc, s'ha de remarcar la programació i implementació de programari per a calcular els anomenats índexs topològics de semblança quàntica. La tercera secció detalla les bases de les Relacions Quantitatives Estructura-Activitat i, finalment, el darrer apartat recull els resultats d'aplicació obtinguts per a diferents sistemes biològics.

Atypical neural self-representation in autism

The 'self' is a complex multidimensional construct deeply embedded and in many ways defined by our relations with the social world. Individuals with autism are impaired in both self-referential and other-referential social cognitive processing. Atypical neural representation of the self may be a key to understanding the nature of such impairments. Using functional magnetic resonance imaging we scanned adult males with an autism spectrum condition and age and IQ-matched neurotypical males while they made reflective mentalizing or physical judgements about themselves or the British Queen. Neurotypical individuals preferentially recruit the middle cingulate cortex and ventromedial prefrontal cortex in response to self compared with other-referential processing. In autism, ventromedial prefrontal cortex responded equally to self and other, while middle cingulate cortex responded more to other-mentalizing than self-mentalizing. These atypical responses occur only in areas where self-information is preferentially processed and does not affect areas that preferentially respond to other-referential information. In autism, atypical neural self-representation was also apparent via reduced functional connectivity between ventromedial prefrontal cortex and areas associated with lower level embodied representations, such as ventral premotor and somatosensory cortex. Furthermore, the magnitude of neural self-other distinction in ventromedial prefrontal cortex was strongly related to the magnitude of early childhood social impairments in autism. Individuals whose ventromedial prefrontal cortex made the largest distinction between mentalizing about self and other were least socially impaired in early childhood, while those whose ventromedial prefrontal cortex made little to no distinction between mentalizing about self and other were the most socially impaired in early childhood. These observations reveal that the atypical organization of neural circuitry preferentially coding for self-information is a key mechanism at the heart of both self-referential and social impairments in autism.

Verification and FPGA circuits of a block-2 fast path-based predictor

This paper formally derives a new path-based neural branch prediction algorithm (FPP) into blocks of size two for a lower hardware solution while maintaining similar input-output characteristic to the algorithm. The blocked solution, here referred to as B2P algorithm, is obtained using graph theory and retiming methods. Verification approaches were exercised to show that prediction performances obtained from the FPP and B2P algorithms differ within one mis-prediction per thousand instructions using a known framework for branch prediction evaluation. For a chosen FPGA device, circuits generated from the B2P algorithm showed average area savings of over 25% against circuits for the FPP algorithm with similar time performances thus making the proposed blocked predictor superior from a practical viewpoint.

Limiting factors in the restoration of UK grassland beetle assemblages

Grasslands restoration is a key management tool contributing to the long-term maintenance of insect populations, providing functional connectivity and mitigating against extinction debt across landscapes. As knowledge of grassland insect communities is limited, the lag between the initiation of restoration and the ability of these new habitats to contribute to such processes is unclear. Using ten data sets, ranging from 3 to 14 years, we investigate the lag between restoration and the establishment of phytophagous beetle assemblages typical of species rich grasslands. We used traits and ecological characteristics to determine factors limiting beetle colonisation, and also considered how food-web structure changed during restoration. For sites where seed addition of host-plants occurred the success in replicating beetle assemblages increased over time following a negative exponential function. Extrapolation beyond the existing data set tentatively suggested that success would plateau after 20 years, representing a c. 60% increase in assemblage similarity to target grasslands. In the absence of seed addition, similarity to the target grasslands showed no increase over time. Where seed addition was used the connectance of plant-herbivore food webs decreased over time, approaching values typical of species rich grasslands after c. 7 years. This trend was, however, dependent on the inclusion of a single site containing data in excess of 6 years of restoration management. Beetles not capable of flight, those showing high degrees of host-plant specialisation and species feeding on nationally rare host plants take between 1 and 3 years longer to colonise. Successful grassland restoration is underpinned by the establishment of host-plants, although individual species traits compound the effects of poor host-plant establishment to slow colonisation. The use of pro-active grassland restoration to mitigate against future environmental change should account for lag periods in excess of 10 years if the value of these habitats is to be fully realised.