47 research outputs found

    On the relationship between PageRank and automorphisms of a graph

    Get PDF
    PageRank is an algorithm used in Internet search to score the importance of web pages. The aim of this paper is demonstrate some new results concerning the relationship between the concept of PageRank and automorphisms of a graph. In particular, we show that if vertices u and v are similar in a graph G (i.e., there is an automorphism mapping u to v), then u and v have the same PageRank score. More generally, we prove that if the PageRanks of all vertices in G are distinct, then the automorphism group of G consists of the identity alone. Finally, the PageRank entropy measure of several kinds of real-world networks and all trees of orders 10โ€“13 and 22 is investigated.acceptedVersionPeer reviewe

    Advances in Public Transport Platform for the Development of Sustainability Cities

    Get PDF
    Modern societies demand high and varied mobility, which in turn requires a complex transport system adapted to social needs that guarantees the movement of people and goods in an economically efficient and safe way, but all are subject to a new environmental rationality and the new logic of the paradigm of sustainability. From this perspective, an efficient and flexible transport system that provides intelligent and sustainable mobility patterns is essential to our economy and our quality of life. The current transport system poses growing and significant challenges for the environment, human health, and sustainability, while current mobility schemes have focused much more on the private vehicle that has conditioned both the lifestyles of citizens and cities, as well as urban and territorial sustainability. Transport has a very considerable weight in the framework of sustainable development due to environmental pressures, associated social and economic effects, and interrelations with other sectors. The continuous growth that this sector has experienced over the last few years and its foreseeable increase, even considering the change in trends due to the current situation of generalized crisis, make the challenge of sustainable transport a strategic priority at local, national, European, and global levels. This Special Issue will pay attention to all those research approaches focused on the relationship between evolution in the area of transport with a high incidence in the environment from the perspective of efficiency

    A Survey on Graph Neural Networks in Intelligent Transportation Systems

    Full text link
    Intelligent Transportation System (ITS) is vital in improving traffic congestion, reducing traffic accidents, optimizing urban planning, etc. However, due to the complexity of the traffic network, traditional machine learning and statistical methods are relegated to the background. With the advent of the artificial intelligence era, many deep learning frameworks have made remarkable progress in various fields and are now considered effective methods in many areas. As a deep learning method, Graph Neural Networks (GNNs) have emerged as a highly competitive method in the ITS field since 2019 due to their strong ability to model graph-related problems. As a result, more and more scholars pay attention to the applications of GNNs in transportation domains, which have shown excellent performance. However, most of the research in this area is still concentrated on traffic forecasting, while other ITS domains, such as autonomous vehicles and urban planning, still require more attention. This paper aims to review the applications of GNNs in six representative and emerging ITS domains: traffic forecasting, autonomous vehicles, traffic signal control, transportation safety, demand prediction, and parking management. We have reviewed extensive graph-related studies from 2018 to 2023, summarized their methods, features, and contributions, and presented them in informative tables or lists. Finally, we have identified the challenges of applying GNNs to ITS and suggested potential future directions

    Methods and Measures for Analyzing Complex Street Networks and Urban Form

    Full text link
    Complex systems have been widely studied by social and natural scientists in terms of their dynamics and their structure. Scholars of cities and urban planning have incorporated complexity theories from qualitative and quantitative perspectives. From a structural standpoint, the urban form may be characterized by the morphological complexity of its circulation networks - particularly their density, resilience, centrality, and connectedness. This dissertation unpacks theories of nonlinearity and complex systems, then develops a framework for assessing the complexity of urban form and street networks. It introduces a new tool, OSMnx, to collect street network and other urban form data for anywhere in the world, then analyze and visualize them. Finally, it presents a large empirical study of 27,000 street networks, examining their metric and topological complexity relevant to urban design, transportation research, and the human experience of the built environment.Comment: PhD thesis (2017), City and Regional Planning, UC Berkele

    ๋ชจ๋ฐ”์ผ ์†Œ์…œ๋„คํŠธ์›Œํฌ์—์„œ ์‚ฌ์šฉ์ž๊ฐ„ ๊ธฐํšŒ์ ์ธ ๊ณต์œ ๊ธฐ๋ฐ˜ํŠธ๋ž˜ํ”ฝ ์˜คํ”„๋กœ๋”ฉ

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (๋ฐ•์‚ฌ)-- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ์ „๊ธฐยท์ปดํ“จํ„ฐ๊ณตํ•™๋ถ€, 2013. 8. ์ตœ์–‘ํฌ.์ตœ๊ทผ ๋ชจ๋ฐ”์ผ ํŠธ๋ž˜ํ”ฝ์˜ ๋น ๋ฅธ ์ฆ๊ฐ€๋Š” ์ด๋™ํ†ต์‹  ์‚ฌ์—…์ž์—๊ฒŒ ์‹ฌ๊ฐํ•œ ๋ฌธ์ œ๊ฐ€ ๋˜๊ณ  ์žˆ๋‹ค. ์ด๋Ÿฌํ•œ ๋ฌธ์ œ๋ฅผ ํ•ด๊ฒฐํ•˜๊ธฐ ์œ„ํ•ด ๋‹จ๊ฑฐ๋ฆฌ ํ†ต์‹  ๊ธฐ์ˆ  ๋ฐ ๋ชจ๋ฐ”์ผ ์†Œ์…œ ๋„คํŠธ์›Œํฌ ๋“ฑ์„ ์ด์šฉํ•˜์—ฌ ์‚ฌ์šฉ์ž๊ฐ„ ์ง์ ‘ ๋ฐ์ดํ„ฐ๋ฅผ ์ฃผ๊ณ  ๋ฐ›๋Š” ์˜คํ”„๋กœ๋”ฉ ๊ธฐ๋ฒ•์„ ์‚ฌ์šฉํ•˜๋Š” ๊ฒƒ์— ๋Œ€ํ•œ ์—ฐ๊ตฌ๊ฐ€ ์ด๋ฃจ์–ด์ง€๊ณ  ์žˆ๋‹ค. ๋ณธ ๋…ผ๋ฌธ์—์„œ๋Š” ์‚ฌ์šฉ์ž๊ฐ„ ์ง์ ‘ ํ†ต์‹ ์„ ํ†ตํ•œ ํšจ์œจ์ ์ธ ์ฝ˜ํ…์ธ  ๊ณต์œ  ๋ฐ ์˜คํ”„๋กœ๋”ฉ ๊ธฐ๋ฒ•์„ ์ œ์•ˆํ•˜๊ณ ์ž ํ•œ๋‹ค. ์ฒซ๋ฒˆ์งธ ์—ฐ๊ตฌ๋กœ, ๋ชจ๋ฐ”์ผ ์†Œ์…œ ๋„คํŠธ์›Œํฌ์—์„œ ์‚ฌ์šฉ์ž๊ฐ„ ์ง์ ‘ ์ „์†ก๊ธฐํšŒ๋ฅผ ํ™œ์šฉํ•ด ๋ฐ์ดํ„ฐ๋ฅผ ๊ณต์œ ํ•˜๋Š” ๋ชจ๋ฐ”์ผ ํŠธ๋ž˜ํ”ฝ ์˜คํ”„๋กœ๋”ฉ์˜ ํ•ต์‹ฌ ๊ธฐ์ˆ ์ธ TOSS๋ฅผ ์ œ์•ˆ ํ•˜์˜€๋‹ค. TOSS์—์„œ๋Š” ์…€๋ฃฐ๋Ÿฌ ๋„คํŠธ์›Œํฌ์—์„œ ๊ธ‰์†ํžˆ ์ฆ๊ฐ€ํ•˜๊ณ  ์žˆ๋Š” ํŠธ๋ž˜ํ”ฝ์œผ๋กœ ์ธํ•œ ๋„คํŠธ์›Œํฌ ๊ณผ๋ถ€ํ•˜๋ฅผ ๊ฒฝ๊ฐ์‹œํ‚ค๊ธฐ ์œ„ํ•ด ์˜จ๋ผ์ธ ์†Œ์…œ ๋„คํŠธ์›Œํฌ์—์„œ ์‚ฌ์šฉ์ž์˜ ์—ฐ๊ฒฐ์„ฑ ๋ฐ ์˜คํ”„๋ผ์ธ ๋„คํŠธ์›Œํฌ์—์„œ ์‚ฌ์šฉ์ž์˜ ์ด๋™์„ฑ์„ ๊ณ ๋ คํ•˜์—ฌ ์ฝ˜ํ…์ธ ๋ฅผ ์ „๋‹ฌํ•  ์‚ฌ์šฉ์ž๋ฅผ ๊ฒฐ์ •ํ•˜๊ณ  ๋ธ”๋ฃจํˆฌ์Šค๋‚˜ ์™€์ดํŒŒ์ด ๋‹ค์ด๋ ‰ํŠธ ๋“ฑ์˜ ๊ธฐ์ˆ ์„ ์ด์šฉํ•ด ์ฝ˜ํ…์ธ ๋ฅผ ์ง์ ‘ ์ „๋‹ฌ ํ•˜์˜€๋‹ค. ๋˜ํ•œ ์†Œ์…œ๋„คํŠธ์›Œํฌ ์„œ๋น„์Šค ์‚ฌ์šฉ์ž์˜ ์„œ๋กœ ๋‹ค๋ฅธ ์ฝ˜ํ…์ธ  ์ ‘๊ทผ ํŒจํ„ด, ์ฆ‰ ๊ฐ ์‚ฌ์šฉ์ž๊ฐ€ ์ฝ˜ํ…์ธ  ์ƒ์„ฑ์œผ๋กœ๋ถ€ํ„ฐ ์˜คํ”„๋กœ๋”ฉ์„ ์œ„ํ•ด ์ฝ˜ํ…์ธ ์— ์ ‘๊ทผํ•˜๊ธฐ๊นŒ์ง€์˜ ์‹œ๊ฐ„์„ ๊ณ ๋ ค ํ•˜์˜€๋‹ค. ๋ณธ ์—ฐ๊ตฌ์—์„œ๋Š” ์ด๋Ÿฌํ•œ ์š”๊ฑด์„ ๊ณ ๋ คํ•˜์—ฌ ํŠธ๋ž˜ํ”ฝ ์˜คํ”„๋กœ๋”ฉ๊ณผ ์ฝ˜ํ…์ธ  ํ™•์‚ฐ์„ ๋ชจ๋ธ๋งํ•˜๊ณ  ๋ถ„์„ ํ•˜์˜€๋‹ค. ๋ชจ๋ฐ”์ผ ์†Œ์…œ ๋„คํŠธ์›Œํฌ์˜ ๋ฐ์ดํƒ€ ์…‹์„ ๊ธฐ๋ฐ˜์œผ๋กœ ๋ถ„์„ ๊ฒฐ๊ณผ์—์„œ TOSS๋Š” ๋ชจ๋“  ์‚ฌ์šฉ์ž์˜ ๋”œ๋ ˆ์ด ์š”๊ตฌ์กฐ๊ฑด์„ ๋งŒ์กฑ์‹œํ‚ค๋ฉด์„œ ์ตœ๋Œ€ 86.5์˜ ์…€๋ฃฐ๋Ÿฌ ํŠธ๋ž˜ํ”ฝ์„ ๊ฒฝ๊ฐ์‹œํ‚ค๋Š” ๊ฒƒ์„ ๋ณด์˜€๋‹ค. ๋‘๋ฒˆ์งธ์˜ ์—ฐ๊ตฌ์—์„œ๋Š” ๋ชจ๋ฐ”์ผ ๋„คํŠธ์›Œํฌ์—์„œ ๋ฉ€ํ‹ฐ์…€์„ ๊ณ ๋ คํ•˜์—ฌ ์ฝ˜ํ…์ธ ๋ฅผ ๋ฐฐํฌํ•˜๋Š” ํ”„๋ ˆ์ž„์›Œํฌ์— ๋Œ€ํ•œ ์—ฐ๊ตฌ๋ฅผ ์ง„ํ–‰ ํ•˜์˜€๋‹ค. ํ•ด๋‹น ํ”„๋ ˆ์ž„์›Œํฌ์—์„œ ์ฝ˜ํ…์ธ ๋Š” ์…€๋ฃฐ๋Ÿฌ ๋งํฌ์™€ ๋ชจ๋ฐ”์ผ ์‚ฌ์šฉ์ž๊ฐ„ ๋กœ์ปฌ ๋งํฌ๋ฅผ ํ†ตํ•ด ํ‘ธ์‹œ-๊ณต์œ  ๊ธฐ๋ฐ˜์˜ ํ†ต์‹ ์œผ๋กœ ์ „๋‹ฌ ๋˜์˜€๋‹ค. ์ด๋Ÿฌํ•œ ๊ธฐ๋ฒ•์„ ๋ฐ”ํƒ•์œผ๋กœ multi-compartment ๋ชจ๋ธ์„ ์ด์šฉํ•˜์—ฌ ์…€ ๊ฐ„ ํ•ธ๋“œ์˜ค๋ฒ„ ๋ฐ ์ฝ˜ํ…์ธ  ์ „๋‹ฌ์„ ๋ชจ๋ธ๋ง ๋ฐ ๋ถ„์„ํ•˜๊ณ , ์ฝ˜ํ…์ธ  ์ „๋‹ฌ ๋”œ๋ ˆ์ด์™€ ์—๋„ˆ์ง€ ์†Œ๋ชจ ์‚ฌ์ด์˜ trade-off๋ฅผ ์ˆ˜ํ•™์ ์ธ ์ตœ์ ํ™” ๊ธฐ๋ฒ•์„ ์‚ฌ์šฉํ•˜์—ฌ ํ•ด๊ฒฐ ํ•˜์˜€๋‹ค. ๋ณธ ๋…ผ๋ฌธ์—์„œ๋Š” ์ด์™€ ๊ฐ™์ด ๊ธฐ์กด์˜ ์ธก์ • ์—ฐ๊ตฌ์— ๊ธฐ๋ฐ˜ํ•œ trace-driven ๋ถ„์„, ๋ชจ๋ธ๋ง ๋ฐ ์‹œ์Šคํ…œ ์ตœ์ ํ™”์— ๋Œ€ํ•œ ์—ฐ๊ตฌ๋ฅผ ํ†ตํ•ด ๋ชจ๋ฐ”์ผ ์†Œ์…œ ๋„คํŠธ์›Œํฌ์—์„œ ์‚ฌ์šฉ์ž๊ฐ„ ์ง์ ‘ ์ „์†ก์„ ํ†ตํ•œ ์˜คํ”„๋กœ๋”ฉ ๊ธฐ๋ฒ•์ด ๊ณ ํšจ์œจ์ ์ž„์„ ๋ณด์˜€๋‹ค. ๋˜ํ•œ ๋ณธ ๋…ผ๋ฌธ์€ ์ œ์•ˆ๋œ ๊ธฐ๋ฒ•์˜ ์ƒ์šฉํ™” ์ „๋ง ๋ฐ ์ด๋ฅผ ์œ„ํ•œ ์ด์Šˆ๋“ค์— ๋Œ€ํ•œ ๋…ผ์˜๋„ ํฌํ•จ ํ•˜์˜€๋‹ค.The fast increasing traffic demand becomes a serious concern of mobile network operators. To solve this traffic explosion problem, there have been efforts to offload the traffic from cellular links to local short-range communications among mobile users that are moving around and forming mobile social networks. In my thesis, I mainly focus on the user-to-user opportunistic sharing and try to elaborate its effectiveness and efficiency for to offload mobile traffic. In the first work, I propose the Traffic Offloading assisted by Social network services via opportunistic Sharing in mobile social networks, TOSS. In TOSS, initially a subset of mobile users are selected as initial seeds depending on their content spreading impact in online social network services (SNSs) and their mobility patterns in offline mobile social networks (MSNs). Then users share the content via opportunistic local connectivity (e.g., Bluetooth, Wi-Fi Direct) with each other. Due to the distinct access patterns of individual SNS users, TOSS further exploits the user-dependent access delay between the content generation time and each user's access time for the purpose of traffic offloading. I model and analyze process of the traffic offloading and content spreading by taking into account various options in linking SNS and MSN data sets. The trace-driven evaluation shows that TOSS can reduce up to 86.5% of the cellular traffic while satisfying the access delay requirements of all users. In the second work, I focus on the analytical research on Push-Share framework for content disseminating in mobile networks. One content is firstly pushed the to a subset of subscribers via cellular links, and mobile users spread the content via opportunistic local connectivity. I theoretically model and analyze how the content can be disseminated, where handovers are modeled based on the multi-compartment model. I also formulate the mathematical optimization framework, by which the trade-off between the dissemination delay and the energy cost is explored. Based on the measurement study, trace-driven analysis, theoretical modeling and system optimization in above papers, the traffic offloading by user-to-user opportunistic sharing in mobile social networks is proved to be effective and efficient. Additionally, further discussions on the practical deployment, future vision, and open issues are discussed as well.Abstract i I. Introduction 1 II. RelatedWork 7 2.1 Opportunistic Sharing in DTNs/MSNs 7 2.2 Mobile Traffic Offloading 9 2.3 Information/Content Spreading in SNSs 10 III. TOSS 13 3.1 Framework Details 13 3.1.1 Preliminaries 13 3.1.2 Spreading Impact in the Online SNS 16 3.1.3 Access Delays of Users in the SNS 18 3.1.4 Mobility Impact in the Offline MSN 21 3.2 System Optimization 25 3.3 Trace-Driven Measurement 26 3.3.1 Measurement of the Online SNS 26 3.3.2 Measurement of Offline MSNs, ฮปi j and IM 33 3.3.3 Content Obtaining Delays 36 3.3.4 How C Impacts the Obtaining Delay 38 3.4 Performance Evaluation 39 3.4.1 How C Impacts the Total Access Utility 39 3.4.2 Satisfying 100%, 90%, and 80% of Users 44 3.4.3 On-Demand Delivery 47 3.5 Conclusion 48 IV. Push-Share 50 4.1 Framework Details 50 4.2 System Model 53 4.3 Content Dissemination in Single Cell 56 4.3.1 Content Dissemination by Sharing Only 57 4.3.2 Content Dissemination with Initial Push and Final Push 59 4.3.3 Content Dissemination Energy Cost 62 4.4 Content Dissemination in Multiple Cells 63 4.4.1 Non-steady-state Modeling of MSs in Multiple Cells 66 4.4.2 Steady-State Modeling of MSs in Multiple Cells 66 4.4.3 How Handovers Affect the Content Dissemination 67 4.5 Optimization Framework 69 4.5.1 Minimum Dissemination Completion Delay 69 4.5.2 Minimum Dissemination Completion Cost 70 4.5.3 Conjunctive Minimization of Delay and Cost 71 4.6 Evaluation Results 73 4.6.1 Content Dissemination within One Single Cell 74 4.6.2 Content Dissemination within Multiple Cells 77 4.6.3 Optimization Framework 80 4.7 Conclusion 82 V. Summary and Future Work 84 5.1 A Comparison with Traffic Offloading based on Wi-Fi APs 85 5.2 Practical Deployment and Application 86 5.3 Future Work and Vision 88 Bibliography 90Docto

    Estimating Footfall From Passive Wi-Fi Signals: Case Study with Smart Street Sensor Project

    Get PDF
    Measuring the distribution and dynamics of the population at granular level both spatially and temporally is crucial for understanding the structure and function of the built environment. In this era of big data, there have been numerous attempts to undertake this using the preponderance of unstructured, passive and incidental digital data which are generated from day-to-day human activities. In attempts to collect, analyse and link these widely available datasets at a massive scale, it is easy to put the privacy of the study subjects at risk. This research looks at one such data source - Wi-Fi probe requests generated by mobile devices - in detail, and processes it into granular, long-term information on number of people on the retail high streets of the United Kingdom (UK). Though this is not the first study to use this data source, the thesis specifically targets and tackles the uncertainties introduced in recent years by the implementation of features designed to protect the privacy of the users of Wi-Fi enabled mobile devices. This research starts with the design and implementation of multiple experiments to examine Wi-Fi probe requests in detail, then later describes the development of a data collection methodology to collect multiple sets of probe requests at locations across London. The thesis also details the uses of these datasets, along with the massive dataset generated by the โ€˜Smart Street Sensorโ€™ project, to devise novel data cleaning and processing methodologies which result in the generation of a high quality dataset which describes the volume of people on UK retail high streets with a granularity of 5 minute intervals since August 2015 across 1000 locations (approx.) in 115 towns. This thesis also describes the compilation of a bespoke โ€˜Medium data toolkitโ€™ for processing Wi-Fi probe requests (or indeed any other data with a similar size and complexity). Finally, the thesis demonstrates the value and possible applications of such footfall information through a series of case studies. By successfully avoiding the use of any personally identifiable information, the research undertaken for this thesis also demonstrates that it is feasible to prioritise the privacy of users while still deriving detailed and meaningful insights from the data generated by the users
    corecore