The Case of Global Maritime Flows (1977–2008) César Ducruet
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Oracle Database 10G: Oracle Spatial Network Data Model
Oracle Database 10g: Oracle Spatial Network Data Model An Oracle Technical White Paper May 2005 Oracle Spatial Network Data Model Table of Contents Introduction ....................................................................................................... 3 Design Goals and Architecture ....................................................................... 4 Major Steps Using the Network Data Model................................................ 5 Network Modeling........................................................................................ 5 Network Analysis.......................................................................................... 6 Network Modeling ............................................................................................ 6 Metadata and Schema ....................................................................................... 6 Network Java Representation and API.......................................................... 7 Network Creation Using SQL and PL/SQL ................................................ 8 Creating a Logical Network......................................................................... 9 Creating a Spatial Network.......................................................................... 9 Creating an SDO Geometry Network ................................................ 10 Creating an LRS Geometry Network.................................................. 10 Creating a Topology Geometry Network........................................... 11 Network Creation -
A Network-Of-Networks Percolation Analysis of Cascading Failures in Spatially Co-Located Road-Sewer Infrastructure Networks
Physica A 538 (2020) 122971 Contents lists available at ScienceDirect Physica A journal homepage: www.elsevier.com/locate/physa A network-of-networks percolation analysis of cascading failures in spatially co-located road-sewer infrastructure networks ∗ ∗ Shangjia Dong a, , Haizhong Wang a, , Alireza Mostafizi a, Xuan Song b a School of Civil and Construction Engineering, Oregon State University, Corvallis, OR 97331, United States of America b Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, China article info a b s t r a c t Article history: This paper presents a network-of-networks analysis framework of interdependent crit- Received 26 September 2018 ical infrastructure systems, with a focus on the co-located road-sewer network. The Received in revised form 28 May 2019 constructed interdependency considers two types of node dynamics: co-located and Available online 27 September 2019 multiple-to-one dependency, with different robustness metrics based on their function Keywords: logic. The objectives of this paper are twofold: (1) to characterize the impact of the Co-located road-sewer network interdependency on networks' robustness performance, and (2) to unveil the critical Network-of-networks percolation transition threshold of the interdependent road-sewer network. The results Percolation modeling show that (1) road and sewer networks are mutually interdependent and are vulnerable Infrastructure interdependency to the cascading failures initiated by sewer system disruption; (2) the network robust- Cascading failure ness decreases as the number of initial failure sources increases in the localized failure scenarios, but the rate declines as the number of failures increase; and (3) the sewer network contains two types of links: zero exposure and severe exposure to liquefaction, and therefore, it leads to a two-phase percolation transition subject to the probabilistic liquefaction-induced failures. -
Sea Containers Ltd. Annual Report 1999 Sea Containers Ltd
Sea Containers Ltd. Annual Report 1999 Sea Containers Ltd. Front cover: The Amalfi Coast Sea Containers is a Bermuda company with operating seen from a terrace of the headquarters (through subsidiaries) in London, England. It Hotel Caruso in Ravello, Italy. is owned primarily by U.S. shareholders and its common Orient-Express Hotels acquired the Caruso in 1999 shares have been listed on the New York Stock Exchange and will reconstruct the prop- (SCRA and SCRB) since 1974. erty during 2000-2001 with a The Company engages in three main activities: passenger view to re-opening in the transport, marine container leasing and the leisure business. spring of 2002. Capri and Paestum are nearby. Demand Passenger transport includes 100% ownership of Hoverspeed for luxury hotel accommodation Ltd., cross-English Channel fast ferry operators, the Isle of on the Amalfi Coast greatly Man Steam Packet Company, operators of fast and conven- exceeds supply. tional ferry services to and from the Isle of Man, the Great North Eastern Railway, operators of train services between London and Scotland, and 50% ownership of Neptun Maritime Oyj whose subsidiary Silja Line operates Contents fast and conventional ferry services in Scandinavia. Company description 2 Marine container leasing is conducted primarily through GE SeaCo SRL, a Barbados company owned 50% by Financial highlights 3 Sea Containers and 50% by GE Capital Corporation. Directors and officers 4 GE SeaCo is the largest lessor of marine containers in the world with a fleet of 1.1 million units. President’s letter to shareholders 7 The leisure business is conducted through Orient-Express Discussion by Division: Hotels Ltd., also a Bermuda company, which is 100% owned by Sea Containers. -
The Rail Freight Challenge for Emerging Economies How to Regain Modal Share
The Rail Freight Challenge for Emerging Economies How to Regain Modal Share Bernard Aritua INTERNATIONAL DEVELOPMENT IN FOCUS INTERNATIONAL INTERNATIONAL DEVELOPMENT IN FOCUS The Rail Freight Challenge for Emerging Economies How to Regain Modal Share Bernard Aritua © 2019 International Bank for Reconstruction and Development / The World Bank 1818 H Street NW, Washington, DC 20433 Telephone: 202-473-1000; Internet: www.worldbank.org Some rights reserved 1 2 3 4 22 21 20 19 Books in this series are published to communicate the results of Bank research, analysis, and operational experience with the least possible delay. The extent of language editing varies from book to book. This work is a product of the staff of The World Bank with external contributions. The findings, interpre- tations, and conclusions expressed in this work do not necessarily reflect the views of The World Bank, its Board of Executive Directors, or the governments they represent. The World Bank does not guarantee the accuracy of the data included in this work. The boundaries, colors, denominations, and other information shown on any map in this work do not imply any judgment on the part of The World Bank concerning the legal status of any territory or the endorsement or acceptance of such boundaries. Nothing herein shall constitute or be considered to be a limitation upon or waiver of the privileges and immunities of The World Bank, all of which are specifically reserved. Rights and Permissions This work is available under the Creative Commons Attribution 3.0 IGO license (CC BY 3.0 IGO) http:// creativecommons.org/licenses/by/3.0/igo. -
Planarity As a Driver of Spatial Network Structure
DOI: http://dx.doi.org/10.7551/978-0-262-33027-5-ch075 Planarity as a driver of Spatial Network structure Garvin Haslett and Markus Brede Institute for Complex Systems Simulation, School of Electronics and Computer Science, University of Southampton, Southampton SO17 1BJ, United Kingdom [email protected] Downloaded from http://direct.mit.edu/isal/proceedings-pdf/ecal2015/27/423/1903775/978-0-262-33027-5-ch075.pdf by guest on 23 September 2021 Abstract include city science (Cardillo et al., 2006; Xie and Levin- son, 2007; Jiang, 2007; Barthelemy´ and Flammini, 2008; In this paper we introduce a new model of spatial network growth in which nodes are placed at randomly selected lo- Masucci et al., 2009; Chan et al., 2011; Courtat et al., 2011; cations in space over time, forming new connections to old Strano et al., 2012; Levinson, 2012; Rui et al., 2013; Gud- nodes subject to the constraint that edges do not cross. The mundsson and Mohajeri, 2013), electronic circuits (i Can- resulting network has a power law degree distribution, high cho et al., 2001; Bassett et al., 2010; Miralles et al., 2010; clustering and the small world property. We argue that these Tan et al., 2014), wireless networks (Huson and Sen, 1995; characteristics are a consequence of two features of our mech- anism, growth and planarity conservation. We further pro- Lotker and Peleg, 2010), leaf venation (Corson, 2010; Kat- pose that our model can be understood as a variant of ran- ifori et al., 2010), navigability (Kleinberg, 2000; Lee and dom Apollonian growth. -
Arxiv:2006.02870V1 [Cs.SI] 4 Jun 2020
The why, how, and when of representations for complex systems Leo Torres Ann S. Blevins [email protected] [email protected] Network Science Institute, Department of Bioengineering, Northeastern University University of Pennsylvania Danielle S. Bassett Tina Eliassi-Rad [email protected] [email protected] Department of Bioengineering, Network Science Institute and University of Pennsylvania Khoury College of Computer Sciences, Northeastern University June 5, 2020 arXiv:2006.02870v1 [cs.SI] 4 Jun 2020 1 Contents 1 Introduction 4 1.1 Definitions . .5 2 Dependencies by the system, for the system 6 2.1 Subset dependencies . .7 2.2 Temporal dependencies . .8 2.3 Spatial dependencies . 10 2.4 External sources of dependencies . 11 3 Formal representations of complex systems 12 3.1 Graphs . 13 3.2 Simplicial Complexes . 13 3.3 Hypergraphs . 15 3.4 Variations . 15 3.5 Encoding system dependencies . 18 4 Mathematical relationships between formalisms 21 5 Methods suitable for each representation 24 5.1 Methods for graphs . 24 5.2 Methods for simplicial complexes . 25 5.3 Methods for hypergraphs . 27 5.4 Methods and dependencies . 28 6 Examples 29 6.1 Coauthorship . 29 6.2 Email communications . 32 7 Applications 35 8 Discussion and Conclusion 36 9 Acknowledgments 38 10 Citation diversity statement 38 2 Abstract Complex systems thinking is applied to a wide variety of domains, from neuroscience to computer science and economics. The wide variety of implementations has resulted in two key challenges: the progenation of many domain-specific strategies that are seldom revisited or questioned, and the siloing of ideas within a domain due to inconsistency of complex systems language. -
Query Processing in Spatial Network Databases
Query Processing in Spatial Network Databases Dimitris Papadias Jun Zhang Department of Computer Science Department of Computer Science Hong Kong University of Science and Technology Hong Kong University of Science and Technology Clearwater Bay, Hong Kong Clearwater Bay, Hong Kong [email protected] [email protected] Nikos Mamoulis Yufei Tao Department of Computer Science and Information Systems Department of Computer Science University of Hong Kong City University of Hong Kong Pokfulam Road, Hong Kong Tat Chee Avenue, Hong Kong [email protected] [email protected] than their Euclidean distance. Previous work on spatial Abstract network databases (SNDB) is scarce and too restrictive Despite the importance of spatial networks in for emerging applications such as mobile computing and real-life applications, most of the spatial database location-based commerce. This necessitates the literature focuses on Euclidean spaces. In this development of novel and comprehensive query paper we propose an architecture that integrates processing methods for SNDB. network and Euclidean information, capturing Every conventional spatial query type (e.g., nearest pragmatic constraints. Based on this architecture, neighbors, range search, spatial joins and closest pairs) we develop a Euclidean restriction and a has a counterpart in SNDB. Consider, for instance, the network expansion framework that take road network of Figure 1.1, where the rectangles advantage of location and connectivity to correspond to hotels. If a user at location q poses the efficiently prune the search space. These range query "find the hotels within a 15km range", the frameworks are successfully applied to the most result will contain a, b and c (the numbers in the figure popular spatial queries, namely nearest correspond to network distance). -
Urban Street Network Analysis in a Computational Notebook
Urban Street Network Analysis in a Computational Notebook Geoff Boeing Department of Urban Planning and Spatial Analysis Sol Price School of Public Policy University of Southern California [email protected] Abstract: Computational notebooks offer researchers, practitioners, students, and educators the ability to interactively conduct analytics and disseminate re- producible workflows that weave together code, visuals, and narratives. This article explores the potential of computational notebooks in urban analytics and planning, demonstrating their utility through a case study of OSMnx and its tu- torials repository. OSMnx is a Python package for working with OpenStreetMap data and modeling, analyzing, and visualizing street networks anywhere in the world. Its official demos and tutorials are distributed as open-source Jupyter notebooks on GitHub. This article showcases this resource by documenting the repository and demonstrating OSMnx interactively through a synoptic tutorial adapted from the repository. It illustrates how to download urban data and model street networks for various study sites, compute network indicators, vi- sualize street centrality, calculate routes, and work with other spatial data such as building footprints and points of interest. Computational notebooks help in- troduce methods to new users and help researchers reach broader audiences in- terested in learning from, adapting, and remixing their work. Due to their utility and versatility, the ongoing adoption of computational notebooks in urban plan- ning, analytics, and related geocomputation disciplines should continue into the future.1 1 Introduction A traditional academic and professional divide has long existed between code creators and code users. The former would develop software tools and workflows for professional or research ap- plications, which the latter would then use to conduct analyses or answer scientific questions. -
Revisiting Port Capacity: a Practical Method for Investment and Policy Decisions
Revisiting Port Capacity: A practical method for Investment and Policy decisions Ioannis N. Lagoudis Head of R&D, XRTC Ltd, Business Consultants 95 Akti Miaouli Str., 18538, Piraeus, Greece & Adjunct Faculty, University of the Aegean – Department of Shipping trade and Transport 2A Korai Str., 82100, Chios, Greece and James B. Rice, Jr. Deputy Director, MIT – Center for Transportation and Logistics 1 Amherst Street, Second Floor,Cambridge, MA 02142 Abstract The paper revisits port capacity providing a more holistic approach via including immediate port connections from the seaside and the hinterland. The methodology provided adopts a systemic approach encapsulating the different port terminals along with the seaside and hinterland connections providing a holistic estimation of port capacity. Capacity is defined with the use of two dimensions; static and dynamic. Static capacity relates to land availability or in other words the available space for use. Dynamic capacity is determined by the available technology of equipment in combination to the skill of available labor. With the presentation of a case study from a container terminal the practical use of this methodology is illustrated. Based on the data provided by the terminal operator the results showed that there is still available space to be utilised at a static level and also room more improvement at a dynamic level. The benefits stemming from the above methodology are multidimensional with the key ones being the flexible framework adjusted to the needs of each port system for measuring capacity, the productivity estimation of the different business processes involved in the movement of goods and people and the evaluation of the financial performance of the different business units and the port as a whole. -
Experimenting with Spatial Networks to Save Time When Experimenting, It Can Be Useful to Create a Subset of the Airport Dataset
Experimenting with Spatial Networks To save time when experimenting, it can be useful to create a subset of the airport dataset, for instance keeping only the airports of larger degree. Note also that when computing deterrence function, it is sometimes useful to work with random samples instead of computing distances between all pairs of nodes. This dataset is small enough however to compute all values in less than 1 minute on an average personal computer. To the best of my knowledge, there is no good library to work with spatial networks. networkx has functions to generate random spatial graphs (called geometric graphs https://networkx.org/ documentation/stable/reference/generators.html), but they are not designed to fit deterrence functions, and are not adapted to work with geographical coordinates. 1. Deterrence Function on the airport dataset When studying a network with spatial information, a first step to check if it can indeed be considered as a spatial network is to compute its deterrence function. (a) We will need to discretize distances using bins(similar to a histogram). Choose b bins, for instance every 500 km from 0km to 10,000km. Write a function which, provided a list of distances, return a list with b values, the number of values in each bin. A convenient way is to use numpy.digitize and collections.Counter . (b) Write a function which compute the distance between two positions on Earth in km. You can use function haversine from the package of the same name( pip install haversine ). To obtain standard latitude and longitude from the data in the airport dataset, you need to divide latitude and longitude values by 3600. -
Port of the Future Concepts, Topics and Projects - Draft for Experts Validation.Docx
Ref. Ares(2018)5643872 - 05/11/2018 D1.5 Port of the Future concepts, topics and projects - draft for experts validation.docx Deliverable D1.5 Date: 5th November 2018 Document: D1.5 Port of the Future concepts, topics and projects - draft for experts validation Page 1 of 268 Print out date: 2018-11-05 Document status Deliverable lead PortExpertise Internal reviewer 1 Circle, Alexio Picco Internal reviewer 2 Circle, Beatrice Dauria Type Deliverable Work package 1 ID D1.5 Due date 31st August 2018 Delivery date 5th November 2018 Status final submitted Dissemination level Public Table 1: Document status Document history Contributions All partners Change description Update work from D1.1 by including additional assessments and update code lists. Update the definition of Ports Of the Future Integrate deliverables D1.2, D1.3 and D1.4 Final version 2018 11 05 Table 2: Document history D1.5 Port of the Future concepts, topics and projects - draft for experts validation Page 2/268 Print out date: 2018-11-05 Disclaimer The views represented in this document only reflect the views of the authors and not the views of Innovation & Networks Executive Agency (INEA) and the European Commission. INEA and the European Commission are not liable for any use that may be made of the information contained in this document. Furthermore, the information is provided “as is” and no guarantee or warranty is given that the information fit for any particular purpose. The user of the information uses it as its sole risk and liability D1.5 Port of the Future concepts, topics and projects - draft for experts validation Page 3 of 268 Print out date: 2018-11-05 Executive summary D1.5 Port of the Future concepts, topics and projects - draft for experts validation Page 4 of 268 Print out date: 2018-11-05 1 Executive summary The DocksTheFuture Project aims at defining the vision for the ports of the future in 2030, covering all specific issues that could define this concept. -
Osmnx: New Methods for Acquiring, Constructing, Analyzing, and Visualizing Complex Street Networks
OSMnx: New Methods for Acquiring, Constructing, Analyzing, and Visualizing Complex Street Networks Geoff Boeing Email: [email protected] Department of City and Regional Planning University of California, Berkeley May 2017 Abstract Urban scholars have studied street networks in various ways, but there are data availability and consistency limitations to the current urban planning/street network analysis literature. To address these challenges, this article presents OSMnx, a new tool to make the collection of data and creation and analysis of street networks simple, consistent, automatable and sound from the perspectives of graph theory, transportation, and urban design. OSMnx contributes five significant capabilities for researchers and practitioners: first, the automated downloading of political boundaries and building footprints; second, the tailored and automated downloading and constructing of street network data from OpenStreetMap; third, the algorithmic correction of network topology; fourth, the ability to save street networks to disk as shapefiles, GraphML, or SVG files; and fifth, the ability to analyze street networks, including calculating routes, projecting and visualizing networks, and calculating metric and topological measures. These measures include those common in urban design and transportation studies, as well as advanced measures of the structure and topology of the network. Finally, this article presents a simple case study using OSMnx to construct and analyze street networks in Portland, Oregon. This is a preprint. Download the published article at: http://geoffboeing.com/publications/osmnx-complex- street-networks/ Cite as: Boeing, G. 2017. “OSMnx: New Methods for Acquiring, Constructing, Analyzing, and Visualizing Complex Street Networks.” Computers, Environment and Urban Systems 65, 126-139. doi:10.1016/j.compenvurbsys.2017.05.004 BOEING 1.