A new betweenness centrality measure based on an algorithm for ranking the nodes of a network

We propose and discuss a new centrality index for urban street patterns represented as networks in geographical space. This centrality measure, that we call ranking-betweenness centrality, combines the idea behind the random-walk betweenness centrality measure and the idea of ranking the nodes of a network produced by an adapted PageRank algorithm. We initially use a PageRank algorithm in which we are able to transform some information of the network that we want to analyze into numerical values. Numerical values summarizing the information are associated to each of the nodes by means of a data matrix. After running the adapted PageRank algorithm, a ranking of the nodes is obtained, according to their importance in the network. This classification is the starting point for applying an algorithm based on the random-walk betweenness centrality. A detailed example of a real urban street network is discussed in order to understand the process to evaluate the ranking-betweenness centrality proposed, performing some comparisons with other classical centrality measures.

Analyzing the commercial activities of a street network by ranking their nodes: a case study in Murcia, Spain

Urban researchers and planners are often interested in understanding how economic activities are distributed in urban regions, what forces influence their special pattern and how urban structure and functions are mutually dependent. In this paper, we want to show how an algorithm for ranking the nodes in a network can be used to understand and visualize certain commercial activities of a city. The first part of the method consists of collecting real information about different types of commercial activities at each location in the urban network of the city of Murcia, Spain. Four clearly differentiated commercial activities are studied, such as restaurants and bars, shops, banks and supermarkets or department stores, but obviously we can study other. The information collected is then quantified by means of a data matrix, which is used as the basis for the implementation of a PageRank algorithm which produces a ranking of all the nodes in the network, according to their significance within it. Finally, we visualize the resulting classification using a colour scale that helps us to represent the business network.

On Logical Correction of Neural Network Algorithms for Pattern Recognition

The paper is devoted to the description of hybrid pattern recognition method developed by research groups from Russia, Armenia and Spain. The method is based upon logical correction over the set of conventional neural networks. Output matrices of neural networks are processed according to the potentiality principle which allows increasing of recognition reliability.

Building a bicycle suitability map for Coimbra

The adoption of faster modes of transportation (mainly the private car) has changed profoundly the spatial organisation of cities. The increase in distance covered due to increased speed of travel and to urban sprawl leads to an increase in energy consumption, being the transportation sector a huge consumer responsible for 61.5% of total world oil consumption and a global final energy consumption of 31.6% in EU-27 (2007). Due to unsustainable transportation conditions, many cities suffer from congestion and various other traffic problems. Such situations get worse with solutions mostly seen in the development of new infrastructure for motorized modes of transportation, and construction of car parking structures. The bicycle, considered the most efficient among all modes of transportation including walking, is a travel mode that can be adopted in most cities contributing for urban sustainability given the associated environmental, economic and social advantages. In many nations a large number of policy initiatives have focused on discouraging the use of private cars, encouraging the use of sustainable modes of transportation, like public transportation and other forms such as bicycling. Given the importance of developing initiatives that favour the use of bicycle as an urban transportation mode, an analysis of city suitability, including distances and slopes of street network, is crucial in order to help decision-makers to plan the city for bicycle. In this research Geographical Information Systems (GIS) technology was used for this purpose and some results are presented concerning the city of Coimbra.

Helsingin seudun liikenteenhallinnan kärkihankkeiden päivitys 2011

Työn tavoitteena oli kokonaisnäkemyksen luominen Helsingin seudun liikenteenhallinnan tilasta ja kehitysnäkymistä sekä seuraavien tärkeimpien kehittämispolkujen tunnistaminen ja konkretisointi toimenpiteiksi. Työssä keskityttiin seuraaviin painopistealueisiin 1. Liityntäpysäköinnin informaation ja maksujärjestelmien kehittäminen 2. Liikenteenhallintakeskuksen toiminnan kehittäminen ja laajentaminen 3. Liikennejärjestelmän reaaliaikainen tilannekuva ja lyhyen aikavälin ennusteet 4. Pääkaupunkiseudun pääväylien ruuhkien ja häiriöiden hallinta 5. Joukkoliikenteen ajantasaisen matkustajainformaation kehittäminen. Työssä laadittiin katsaus kullakin painopistealueella jo tapahtuneeseen sekä käynnissä olevaan kehitystyöhön, kuvattiin esiin nousseita ongelmia ja laadittiin esitys vuoteen 2020 ulottuvasta toiminnallisesta tavoitetilasta sekä konkreettisista kehittämistoimista. Työssä järjestettiin myös tulevaisuustyöpaja, johon pyydettiin alustuksia valikoiduilta viranomaistahoilta, tutkijoilta ja palveluntuottajilta. Näiden keskustelujen kautta kirkastettiin seudun toimijoiden näkemystä älyliikenteen toimialan kehitysnäkymistä ja –tarpeista. Työn lopputuloksena syntyneeseen toimenpideohjelmaan kirjattiin yhteensä 30 hanketta. Näistä viisi hanketta valittiin työpajatyöskentelyn kautta varsinaisiksi kärkihankkeiksi, joiden toteutus on kriittistä liikkujien ja viranomaistyön palvelutason kannalta ja joka edellyttää usean toimijan yhteistyötä. Lisäksi tunnistettiin joukko seurattavia hankkeita. Valitut kärkihankkeet, käynnistämisen vastuutaho sekä tavoitteellinen käynnistysvuosi ovat seuraavat: 1. Liityntäpysäköinnin dynaamisen informaatiojärjestelmän pilotointi Hämeenlinnanväylän käytävässä Kehäradan asemilla (HSL 2012) 2. HSL:n alueen joukkoliikenteen häiriönhallinnan uudelleenorganisointi (HSL, Liikennevirasto 2012) 3. Seudullisen liikenteenhallintasuunnitelman laadinta verkollisen operoinnin kehittämiseksi häiriötilanteissa (ELY-keskus, Liikennevirasto 2013) 4. Reaaliaikaisen sujuvuustiedon tuottaminen ruuhkautuvalta pääkatu- ja alempiasteiselta maantieverkolta (Liikennevirasto, kunnat 2012) 5. Liikenteen vaihtuvan ohjauksen ja tiedottamisen hyödyntäminen pääväylien ruuhkautumisen ja häiriöiden hallinnassa. (ELY-keskus 2012) Kärkihankkeisiin ei liity sellaisia riippuvuuksia, että niitä ei voitaisi käynnistää ennen päätöksentekoa jostakin muusta investoinnista. Merkittävimmät riippuvuudet liittyvät LIJ2014-järjestelmän ajoneuvojen paikannuksen ja muiden työkalujen valmistumiseen. Johtoryhmän linjauksen mukaan kärkihankkeissa ja muissakin toimijoiden omissa hankkeissa syntyvien tietojärjestelmien rajapinnat avataan soveltuvasti kaupallisten toimijoiden käyttöön, jolloin syntyvien kaupallisten loppukäyttäjäpalveluiden kautta voidaan parantaa tietopalvelujen tavoittavuutta. Kärkihankkeiden valinta ja sisältö on rakennettu pitkälti sen lähtökohdan varaan, että liikenteen tietopalveluissa julkistoimijoiden roolina on pääasiassa lähtötietojen tuottaminen ja jakaminen varsinaisille palveluntuottajille. Vuoteen 2016 mennessä uusien rajapintojen kautta jaettavien tietojen määrä on nykyiseen verrattuna huomattavasti laajempi, ja odotukset uusien ja innovatiivisten palvelujen syntymiselle ovat korkeat. HLH-johtoryhmä nimeää jokaisen kärkihankkeen läpiviennistä vastaavan työryhmän, joiden työskentelyä ohjataan nykyisen kaltaisessa johtoryhmätyössä. Johtoryhmätyön organisointi on todettu toimivaksi, sillä ryhmä koostuu seudun 14 kunnan alueen keskeisistä julkisista toimijoista ja sen kautta on olemassa vahvat kytkennät sekä seudun liikennejärjestelmätyöhön (HLJ) että valtakunnalliseen älyliikenteen kehitystyöhön.

Joukkoliikenteen koontikannan prosessien kehittäminen

Vuoden 2009 lopulla voimaan astuneet EU:n palvelusopimusasetus (PSA) ja kansallinen joukkoliikennelaki (869/2009) pakottavat avaamaan joukkoliikenteen markkinat kilpailulle koko Suomen alueella. Tästä johtuen Liikenne- ja viestintäministeriö on velvoittanut Liikenneviraston hankkimaan riittävän informaatiopohjan joukkoliikenteen kilpailutusten pohjaksi. Tämä pakottaa viraston uudistamaan bussipysäkkitiedon hallintansa ja -prosessinsa lähes kokonaan. Tämän työn tavoitteena oli selvittää, millaiset prosessit Liikenneviraston tulisi muodostaa, jotta tiedot jokaisen Suomen kunnan ja kaupungin katuverkon bussipysäkeistä saataisiin siirrettyä uuteen, kansalliseen joukkoliikenteen koontitietokantaan. Työssä tutkitaan, tarkastellaan ja kategorisoidaan Suomen kunnat ja kaupungit pysäkkitiedon hallinnoijan näkökulmasta. Tämän perusteella kehitetään vanhoja pysäkkitiedon prosesseja sekä luodaan uusia prosessimalleja pysäkkitiedon siirrolle ja päivitykselle. Jaottelun apuna käytetään kyselytutkimusta ja puhelinhaastatteluja. Kirjallisuusosa sisältää yleistä teoriaa prosesseista, niiden vaiheista ja kehittämisestä. Työn keskeisempänä tuloksena ovat prosessimallit siitä, miten pysäkkitiedon tulisi jatkossa siirtyä eri joukkoliikenneviranomaisilta Liikenneviraston kansalliseen koontikantaan. Lisäksi työssä huomattiin, että aktiivinen johtaminen ja yhteydenpito Liikenneviraston suunnalta ovat tärkeimmät edellytykset sille, että pysäkkitieto liikkuu ja tiedonsiirto paranee eri toimijoiden välillä.

Dispersion Experiments in Central London: The 2007 DAPPLE project

In the event of a release of toxic gas in the center of London, the emergency services would need to determine quickly the extent of the area contaminated. The transport of pollutants by turbulent flow within the complex street and building architecture of cities is not straightforward, and we might wonder whether it is at all possible to make a scientifically-reasoned decision. Here we describe recent progress from a major UK project, ‘Dispersion of Air Pollution and its Penetration into the Local Environment’ (DAPPLE, www.dapple.org.uk). In DAPPLE, we focus on the movement of airborne pollutants in cities by developing a greater understanding of atmospheric flow and dispersion within urban street networks. In particular, we carried out full-scale dispersion experiments in central London (UK) during 2003, 2004, 2007, and 2008 to address the extent of the dispersion of tracers following their release at street level. These measurements complemented previous studies because (i) our focus was on dispersion within the first kilometer from the source, when most of the material was expected to remain within the street network rather than being mixed into the boundary layer aloft, (ii) measurements were made under a wide variety of meteorological conditions, and (iii) central London represents a European, rather than North American, city geometry. Interpretation of the results from the full-scale experiments was supported by extensive numerical and wind tunnel modeling, which allowed more detailed analysis under idealized and controlled conditions. In this article, we review the full-scale DAPPLE methodologies and show early results from the analysis of the 2007 field campaign data.

Evaluating a new LISFLOOD-FP formulation with data from the summer 2007 floods in Tewkesbury, UK

Two-dimensional flood inundation modelling is a widely used tool to aid flood risk management. In urban areas, where asset value and population density are greatest, the model spatial resolution required to represent flows through a typical street network (i.e. < 10m) often results in impractical computational cost at the whole city scale. Explicit diffusive storage cell models become very inefficient at such high resolutions, relative to shallow water models, because the stable time step in such schemes scales as a quadratic of resolution. This paper presents the calibration and evaluation of a recently developed new formulation of the LISFLOOD-FP model, where stability is controlled by the Courant–Freidrichs–Levy condition for the shallow water equations, such that, the stable time step instead scales linearly with resolution. The case study used is based on observations during the summer 2007 floods in Tewkesbury, UK. Aerial photography is available for model evaluation on three separate days from the 24th to the 31st of July. The model covered a 3.6 km by 2 km domain and was calibrated using gauge data from high flows during the previous month. The new formulation was benchmarked against the original version of the model at 20 m and 40 m resolutions, demonstrating equally accurate performance given the available validation data but at 67x faster computation time. The July event was then simulated at the 2 m resolution of the available airborne LiDAR DEM. This resulted in a significantly more accurate simulation of the drying dynamics compared to that simulated by the coarse resolution models, although estimates of peak inundation depth were similar.

A new linear initialization in SOM for biomolecular data

In the past decade, the amount of data in biological field has become larger and larger; Bio-techniques for analysis of biological data have been developed and new tools have been introduced. Several computational methods are based on unsupervised neural network algorithms that are widely used for multiple purposes including clustering and visualization, i.e. the Self Organizing Maps (SOM). Unfortunately, even though this method is unsupervised, the performances in terms of quality of result and learning speed are strongly dependent from the neuron weights initialization. In this paper we present a new initialization technique based on a totally connected undirected graph, that report relations among some intersting features of data input. Result of experimental tests, where the proposed algorithm is compared to the original initialization techniques, shows that our technique assures faster learning and better performance in terms of quantization error.

Neural networks for linear control: an analysis

This paper considers the use of radial basis function and multi-layer perceptron networks for linear or linearizable, adaptive feedback control schemes in a discrete-time environment. A close look is taken at the model structure selected and the extent of the resulting parameterization. A comparison is made with standard, nonneural network algorithms, e.g. self-tuning control.

Evaluating a new LISFLOOD-FP formulation with data from the summer 2007 floods in Tewkesbury, UK

Two-dimensional flood inundation modelling is a widely used tool to aid flood risk management. In urban areas, the model spatial resolution required to represent flows through a typical street network often results in an impractical computational cost at the city scale. This paper presents the calibration and evaluation of a recently developed formulation of the LISFLOOD-FP model, which is more computationally efficient at these resolutions. Aerial photography was available for model evaluation on 3 days from the 24 to the 31 of July. The new formulation was benchmarked against the original version of the model at 20 and 40 m resolutions, demonstrating equally accurate simulation, given the evaluation data but at a 67 times faster computation time. The July event was then simulated at the 2 m resolution of the available airborne LiDAR DEM. This resulted in more accurate simulation of the floodplain drying dynamics compared with the coarse resolution models, although maximum inundation levels were simulated equally well at all resolutions tested.

Processes controlling atmospheric dispersion through city centres

We develop a process-based model for the dispersion of a passive scalar in the turbulent flow around the buildings of a city centre. The street network model is based on dividing the airspace of the streets and intersections into boxes, within which the turbulence renders the air well mixed. Mean flow advection through the network of street and intersection boxes then mediates further lateral dispersion. At the same time turbulent mixing in the vertical detrains scalar from the streets and intersections into the turbulent boundary layer above the buildings. When the geometry is regular, the street network model has an analytical solution that describes the variation in concentration in a near-field downwind of a single source, where the majority of scalar lies below roof level. The power of the analytical solution is that it demonstrates how the concentration is determined by only three parameters. The plume direction parameter describes the branching of scalar at the street intersections and hence determines the direction of the plume centreline, which may be very different from the above-roof wind direction. The transmission parameter determines the distance travelled before the majority of scalar is detrained into the atmospheric boundary layer above roof level and conventional atmospheric turbulence takes over as the dominant mixing process. Finally, a normalised source strength multiplies this pattern of concentration. This analytical solution converges to a Gaussian plume after a large number of intersections have been traversed, providing theoretical justification for previous studies that have developed empirical fits to Gaussian plume models. The analytical solution is shown to compare well with very high-resolution simulations and with wind tunnel experiments, although re-entrainment of scalar previously detrained into the boundary layer above roofs, which is not accounted for in the analytical solution, is shown to become an important process further downwind from the source.

Identificação fuzzy-multimodelos para sistemas não lineares

This paper presents a new multi-model technique of dentification in ANFIS for nonlinear systems. In this technique, the structure used is of the fuzzy Takagi-Sugeno of which the consequences are local linear models that represent the system of different points of operation and the precursors are membership functions whose adjustments are realized by the learning phase of the neuro-fuzzy ANFIS technique. The models that represent the system at different points of the operation can be found with linearization techniques like, for example, the Least Squares method that is robust against sounds and of simple application. The fuzzy system is responsible for informing the proportion of each model that should be utilized, using the membership functions. The membership functions can be adjusted by ANFIS with the use of neural network algorithms, like the back propagation error type, in such a way that the models found for each area are correctly interpolated and define an action of each model for possible entries into the system. In multi-models, the definition of action of models is known as metrics and, since this paper is based on ANFIS, it shall be denominated in ANFIS metrics. This way, ANFIS metrics is utilized to interpolate various models, composing a system to be identified. Differing from the traditional ANFIS, the created technique necessarily represents the system in various well defined regions by unaltered models whose pondered activation as per the membership functions. The selection of regions for the application of the Least Squares method is realized manually from the graphic analysis of the system behavior or from the physical characteristics of the plant. This selection serves as a base to initiate the linear model defining technique and generating the initial configuration of the membership functions. The experiments are conducted in a teaching tank, with multiple sections, designed and created to show the characteristics of the technique. The results from this tank illustrate the performance reached by the technique in task of identifying, utilizing configurations of ANFIS, comparing the developed technique with various models of simple metrics and comparing with the NNARX technique, also adapted to identification

Statistical Physics and Modeling of Human Mobility

In this thesis, we extend some ideas of statistical physics to describe the properties of human mobility. By using a database containing GPS measures of individual paths (position, velocity and covered space at a spatial scale of 2 Km or a time scale of 30 sec), which includes the 2% of the private vehicles in Italy, we succeed in determining some statistical empirical laws pointing out "universal" characteristics of human mobility. Developing simple stochastic models suggesting possible explanations of the empirical observations, we are able to indicate what are the key quantities and cognitive features that are ruling individuals' mobility. To understand the features of individual dynamics, we have studied different aspects of urban mobility from a physical point of view. We discuss the implications of the Benford's law emerging from the distribution of times elapsed between successive trips. We observe how the daily travel-time budget is related with many aspects of the urban environment, and describe how the daily mobility budget is then spent. We link the scaling properties of individual mobility networks to the inhomogeneous average durations of the activities that are performed, and those of the networks describing people's common use of space with the fractional dimension of the urban territory. We study entropy measures of individual mobility patterns, showing that they carry almost the same information of the related mobility networks, but are also influenced by a hierarchy among the activities performed. We discover that Wardrop's principles are violated as drivers have only incomplete information on traffic state and therefore rely on knowledge on the average travel-times. We propose an assimilation model to solve the intrinsic scattering of GPS data on the street network, permitting the real-time reconstruction of traffic state at a urban scale.

Data dissemination over complex networks through gossip

This thesis offers a practical and theoretical evaluations about gossip-epidemic algorithms, comparing those most common in the literature with new proposed algorithms and analyzing their behavior. Tests have been executed using one hundred graphs that has been randomly generated by Large Unstructured NEtwork Simulator (LUNES), a simulation software provided by Parallel and Distributed Simulation Research Group (PADS), of the Department of Computer Science, Università di Bologna and simulated using Advanced RTI System (ARTÌS), based on the High Level Architecture standard. Literatures algorithms have been analyzed and taken as base for new algorithms.