Chain conditions for Leavitt path algebras

In this paper, results known about the artinian and noetherian conditions for the Leavitt path algebras of graphs with finitely many vertices are extended to all row-finite graphs. In our first main result, necessary and sufficient conditions on a row-finite graph E are given so that the corresponding (not necessarily unital) Leavitt path K-algebra L(E) is semisimple. These are precisely the algebras L(E)for which every corner is left (equivalently, right)artinian. They are also precisely the algebras L(E) for which every finitely generated left (equivalently, right) L(E)-module is artinian. In our second main result, we give necessary and sufficient conditions for every corner of L(E) to be left (equivalently, right) noetherian. They also turn out to be precisely those algebras L(E) for which every finitely generated left(equivalently, right) L(E)-module is noetherian. In both situations, isomorphisms between these algebras and appropriate direct sums of matrix rings over K or K[x, x−1] are provided. Likewise, in both situations, equivalent graph theoretic conditions on E are presented.

Orthogonal systems in finite grahps

To a finite graph there corresponds a free partially commutative group: with the given graph as commutation graph. In this paper we construct an orthogonality theory for graphs and their corresponding free partially commutative groups. The theory developed here provides tools for the study of the structure of partially commutative groups, their universal theory and automorphism groups. In particular the theory is applied in this paper to the centraliser lattice of such groups.

Parabolic and quasiparabolic subgroups of free partially commutative groups

Let Γ be a finite graph and G be the corresponding free partially commutative group. In this paper we study subgroups generated by vertices of the graph Γ, which we call canonical parabolic subgroups. A natural extension of the definition leads to canonical quasiparabolic subgroups. It is shown that the centralisers of subsets of G are the conjugates of canonical quasiparabolic centralisers satisfying certain graph theoretic conditions.

Dance movement patterns recognition

"Es tracta d'un projecte dividit en dues parts independents però complementàries, realitzades per autors diferents. Aquest document conté originàriament altre material i/o programari només consultable a la Biblioteca de Ciència i Tecnologia"

Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.

Internet au service du patrimoine. Cartographie dynamique de l'inventaire des géotopes d'importance nationale

L'inventaire des géotopes d'importance nationale, aujourd'hui proche de son état final, est le fruit d'un long travail de sélection, de documentation ainsi que de définition et de numérisation des périmètres des sites initié dans les années 1990 par le groupe de travail pour la protection des géotopes en Suisse (Strasser et al. 1995, Berger et al. 2008). Il représente un outil au service de la diffusion et à la promotion du géopatrimoine suisse, auprès de la population en général et des professionnels des géosciences en particulier, dans un but de valorisation patrimoniale et de protection et par une sensibilisation à la valeur particulière et à la vulnérabilité des géotopes.¦C'est dans cet objectif qu'a été développée une interface cartographique rendant accessible sur Internet le contenu de cet inventaire. L'outil de web mapping utilisé - GoogleMaps API - permet en effet d'enrichir une interface de navigation intuitive de diverses fonctions additionnelles offertes par la cartographie sur internet (Kraak 2004, Plewe 2007). La carte n'est donc pas seulement une représentation de la réalité permettant la localisation de différents objets, mais également un outil de recherche thématique et spatiale ainsi qu'un index reliant chaque objet cartographié à diverses informations.¦Porte d'accès aux données des site à une échelle individuelle ou globale, mais aussi outil d'exploration, cette interface propose plusieurs niveaux d'utilisation, correspondant aux diverses interactions possibles avec ces données : naviguer et découvrir les sites, réaliser des sélections multiples, comparer les géotopes à d'autres données, comme l'inventaire fédéral des paysages. L'utilisateur peut ainsi produire à chaque fois la carte qui répond à ses besoins et à ses questions. En donnant à tous accès au contexte et aux particularités de chaque site par delà la globalité abstraite de l'inventaire, cette application se veut avant tout un outil au service de la médiation du géopatrimoine.

Properties of functional brain networks correlate with frequency of psychogenic non-epileptic seizures.

Abnormalities in the topology of brain networks may be an important feature and etiological factor for psychogenic non-epileptic seizures (PNES). To explore this possibility, we applied a graph theoretical approach to functional networks based on resting state EEGs from 13 PNES patients and 13 age- and gender-matched controls. The networks were extracted from Laplacian-transformed time-series by a cross-correlation method. PNES patients showed close to normal local and global connectivity and small-world structure, estimated with clustering coefficient, modularity, global efficiency, and small-worldness (SW) metrics, respectively. Yet the number of PNES attacks per month correlated with a weakness of local connectedness and a skewed balance between local and global connectedness quantified with SW, all in EEG alpha band. In beta band, patients demonstrated above-normal resiliency, measured with assortativity coefficient, which also correlated with the frequency of PNES attacks. This interictal EEG phenotype may help improve differentiation between PNES and epilepsy. The results also suggest that local connectivity could be a target for therapeutic interventions in PNES. Selective modulation (strengthening) of local connectivity might improve the skewed balance between local and global connectivity and so prevent PNES events.

Procesamiento de imágenes biológicas

Este proyecto se ha desarrollado a petición del CSIC. El proyecto consiste en crear una aplicación que automatice la localización y obtención de la intensidad de unos puntos luminosos en las células que aparecen en el vídeo. También se desea identificar en qué estadio celular se encuentran las células y si los puntos hallados están en la zona del septim ring. Para ello, se ha hecho un estudio y probado dos métodos para la localización de los puntos y se ha realizado un filtro mediante Adaboost para la localización de las células. También se ha realizado una interfaz gráfica para el usuario final.

EEG-based functional brain networks: does the network size matter?

Functional connectivity in human brain can be represented as a network using electroencephalography (EEG) signals. These networks--whose nodes can vary from tens to hundreds--are characterized by neurobiologically meaningful graph theory metrics. This study investigates the degree to which various graph metrics depend upon the network size. To this end, EEGs from 32 normal subjects were recorded and functional networks of three different sizes were extracted. A state-space based method was used to calculate cross-correlation matrices between different brain regions. These correlation matrices were used to construct binary adjacency connectomes, which were assessed with regards to a number of graph metrics such as clustering coefficient, modularity, efficiency, economic efficiency, and assortativity. We showed that the estimates of these metrics significantly differ depending on the network size. Larger networks had higher efficiency, higher assortativity and lower modularity compared to those with smaller size and the same density. These findings indicate that the network size should be considered in any comparison of networks across studies.

Desenvolupament d'un servidor d'informació geogràfica

L'explosió d'aplicacions a Internet basades en oferir serveis de localització, com són portals web de mobilitat o aplicacions de seguiment de vehicles en línia han motivat aquest projecte. Google Maps ens permet afegir mapes fàcilment en un lloc web amb la seva API, però OpenLayers, una llibreria JavaScript lliure ens dóna l'opció de carregar cobertures de mapa i marcadors des de qualsevol font. OpenStreetMap proporciona dades geogràfiques de manera lliure, com per exemple mapes de carrers i carreteres. Un estudi acurat de l'estructura i agrupació de les dades en el format OSM i el desenvolupament d'un servidor basat en el model de tessel·les, són els principals elements de partida per crear la nostra pròpia font de dades cartogràfiques. En aquest projecte s'analitza i processa DXF Drawing eXchange Format passant al format OSM. Un fitxer OSM conté la informació geogràfica necessària per a la base de dades espaial a partir de la qual, entre d'altres aplicacions, es podran visualitzar els mapes propis en una aplicació de seguiment de vehicles o en un portal web.

Bioinformática: interfaz gráfica para comparación de genomas vía web

El proyecto consiste en un entorno gráfico cuyo fin es el de visualizar, estudiar e interpretar la conservación de código genético existente entre los diferentes genomas. Una interface que permite cargar hasta ocho genomas para ser comparados en detalle, por pares o entre todos ellos a la vez. El gráfico que se muestra en la interfaz, representa los Maximal Unique Matchings entre cada par de genomas, lo que significa coincidencias de la mayor longitud posible no repetidas, en las secuencias de ADN de las especies comparadas. La finalidad es el estudio de las evoluciones que han ido apareciendo entre diferentes organismos o los genes que comparten unas especies con otras.

Aplicación con Google Maps

El principal objetivo de este proyecto es realizar un aplicativo web que utilice API’s para que, a partir de un conjunto de rutas almacenadas en el sistema, éste sea capaz de generar nuevas rutas a partir de éstas, de modo que dicho sistema no se comporte como un mero "almacén" de rutas introducidas por los usuarios para poder ser utilizadas por los demás posteriormente, sino que podamos ser nosotros mismos los que decidamos ciertos aspectos de la ruta que deseamos que el sistema nos proporcione. Así, el aplicativo desarrollado, partiendo de un conjunto previo de rutas, será capaz de generar nuevas rutas pasando lo más cerca posible de un conjunto de puntos definidos por el usuario, pudiendo ser calculadas siguiendo diferentes parámetros de optimización tales como el menor número de rutas utilizadas en el cálculo o el menor número de intersecciones entre ellas. Estas rutas, posteriormente, pueden visualizarse en la aplicación mediante el API de Google Maps, o pueden ser descargadas para utilizarlas en nuestro dispositivo GPS portátil.

Desarrollo de una aplicación web para representación de datos de posicionamiento

En aquesta memòria s’explica el desenvolupament d’una eina útil que permet a l’usuari visualitzar en l’aplicació Google Maps les dades de posicionament captats en una sessió GPS. En aquest projecte, hem dissenyat una aplicació Web en la qual recollim les dades ingressades per l’usuari mitjançant un formulari. Un cop emmagatzemades aquestes dades en el servidor, la nostra eina hi executa l’aplicació encarregada del càlcul de les posicions. Aquesta és un script desenvolupat en MATLAB, que s’encarrega d’interpretar les dades subministrades per l’usuari, amb les quals es poden calcular les coordenades captades pel receptor GPS. Una vegada calculades, el software les emmagatzema en el servidor, en un arxiu .xml, que serà el que posteriorment interpretarà Google Maps gràcies al seu API. D’aquesta manera, l’usuari obtindrà el resultat visual de la sessió GPS que hagi decidit carregar sense necessitat des disposar de cap software específic per a la interpretació i el càlcul de les dades que hi ha capturat.

Reproducibility and feasibility of a 22 joints ultrasound score in rheumatoid arthritis: a study among rheumatologists with diverse expertise in musculoskeletal ultrasound

Objective: To assess reproducibility and feasibility of amusculoskeletal ultrasound (US) score for rheumatoid arthritis amongrheumatologist with diverse expertise in US, working in private orhospital practice.Methods: The Swiss Sonography in Arthritis and Rheumatism(SONAR) group has developed a semi-quantitative score for RA usingOMERACT criteria for synovitis and erosion. The score was taught torheumatologists trained in US through two workshops. Subsequently,they were encouraged to practice in their office. For the study, we used6 US machines of different quality, each with a different patient.19 readers randomly selected among rheumatologists who haveattended both workshops, were asked to score anonymously at leastone patient. To assess whether some factors influence the score, weasked each reader to answer questionnaire describing his experiencewith US.Results: 19 rheumatologists have performed 29 scans, each patienthaving been evaluated by 4 to 6 readers. Median time for examcompletion was 20 minutes (range 15 to 60 mn). 53% ofrheumatologists work in private practice. Graph 1 show the global greyscale score for each patient. Weighted kappa was calculated for eachpair of reader using stata11. Almost all kappa of poor agreement wereobtained with a low quality device or by an assessor who havepreviously performed less than 5 scores himself.Conclusions: This is the first study to show an US score for RAfeasible by rheumatologists with diverse expertise in US both in privateand hospital practice. Reproducibility seemed to be influenced by thequality of device and previous experience with the score.

Statistical properties of subgroups of free groups

The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations are determined) by randomly chosen k-tuples of reduced words, whose maximal length is allowed to tend to infinity. In this paper we adopt a different, though equally natural point of view: we investigate the statistical properties of the same objects, but with respect to the so-called graph-based distribution, recently introduced by Bassino, Nicaud and Weil. Here, subgroups (and finite presentations) are determined by randomly chosen Stallings graphs whose number of vertices tends to infinity. Our results show that these two distributions behave quite differently from each other, shedding a new light on which properties of finitely generated subgroups can be considered frequent or rare. For example, we show that malnormal subgroups of a free group are negligible in the raph-based distribution, while they are exponentially generic in the word-based distribution. Quite surprisingly, a random finite presentation generically presents the trivial group in this new distribution, while in the classical one it is known to generically present an infinite hyperbolic group.