A Quantitative Framework for Assessing Vulnerability and Redundancy of Freight Transportation Networks

Freight transportation networks are an important component of everyday life in modern society. Disruption to these networks can make peoples’ daily lives extremely difficult as well as seriously cripple economic productivity. This dissertation develops a quantitative framework for assessing vulnerability and redundancy of freight transportation networks. The framework consists of three major contributions: (1) a two- stage approach for estimating a statewide truck origin-destination (O-D) trip table, (2) a decision support tool for assessing vulnerability of freight transportation networks, and (3) a quantitative approach for measuring redundancy of freight transportation networks.The dissertation first proposes a two-stage approach to estimate a statewide truck O-D trip table. The proposed approach is supported by two sequential stages: the first stage estimates a commodity-based truck O-D trip table using the commodity flows derived from the Freight Analysis Framework (FAF) database, and the second stage uses the path flow estimator (PFE) concept to refine the truck trip table obtained from the first stage using the truck counts from the statewide truck count program. The model allows great flexibility of incorporating data at different spatial levels for estimating the truck O- D trip table. The results from the second stage provide us a better understanding of truck flows on the statewide truck routes and corridors, and allow us to better manage the anticipated impacts caused by network disruptions.A decision support tool is developed to facilitate the decision making system through the application of its database management capabilities, graphical user interface, GIS-based visualization, and transportation network vulnerability analysis. The vulnerability assessment focuses on evaluating the statewide truck-freight bottlenecks/chokepoints. This dissertation proposes two quantitative measures: O-D connectivity (or detour route) in terms of distance and freight flow pattern change in terms of vehicle miles traveled (VMT). The case study adopts a “what-if” analysis approach by generating the disruption scenarios of the structurally deficient bridges in Utah due to earthquakes. In addition, the potential impacts of disruptions to multiple bridges in both rural and urban areas are evaluated and compared to the single bridge failure scenarios.This dissertation also proposes an approach to measure the redundancy of freight transportation networks based on two main dimensions: route diversity and network spare capacity. The route diversity dimension is used to evaluate the existence of multiple efficient routes available for users or the degree of connections between a specific O-D pair. The network spare capacity dimension is used to quantify the network- wide spare capacity with an explicit consideration of congestion effect. These two dimensions can complement each other by providing a two-dimensional characterization of freight transportation network redundancy. Case studies of the Utah statewide transportation network and coal multimodal network are conducted to demonstrate the features of the vulnerability and redundancy measures and the applicability of the quantitative assessment methodology

EFFICIENT DYNAMIC ADDRESSING BASED ROUTING FOR UNDERWATER WIRELESS SENSOR NETWORKS

This thesis presents a study about the problem of data gathering in the inhospitable underwater environment. Besides long propagation delays and high error probability, continuous node movement also makes it difficult to manage the routing information during the process of data forwarding. In order to overcome the problem of large propagation delays and unreliable link quality, many algorithms have been proposed and some of them provide good solutions for these issues, yet continuous node movements still need attention. Considering the node mobility as a challenging task, a distributed routing scheme called Hop-by-Hop Dynamic Addressing Based (H2- DAB) routing protocol is proposed where every node in the network will be assigned a routable address quickly and efficiently without any explicit configuration or any dimensional location information. According to our best knowledge, H2-DAB is first addressing based routing approach for underwater wireless sensor networks (UWSNs) and not only has it helped to choose the routing path faster but also efficiently enables a recovery procedure in case of smooth forwarding failure. The proposed scheme provides an option where nodes is able to communicate without any centralized infrastructure, and a mechanism furthermore is available where nodes can come and leave the network without having any serious effect on the rest of the network. Moreover, another serious issue in UWSNs is that acoustic links are subject to high transmission power with high channel impairments that result in higher error rates and temporary path losses, which accordingly restrict the efficiency of these networks. The limited resources have made it difficult to design a protocol which is capable of maximizing the reliability of these networks. For this purpose, a Two-Hop Acknowledgement (2H-ACK) reliability model where two copies of the same data packet are maintained in the network without extra burden on the available resources is proposed. Simulation results show that H2-DAB can easily manage during the quick routing changes where node movements are very frequent yet it requires little or no overhead to efficiently complete its tasks

Compilation of Abstracts, June 2016

NPS Class of June 2016This quarter’s Compilation of Abstracts summarizes cutting-edge, security-related research conducted by NPS students and presented as theses, dissertations, and capstone reports. Each expands knowledge in its field.http://archive.org/details/compilationofabs109454990

The Smugglers\u27 Landscape: Geography, Route Selection and the Global Heroin Trade

This study focuses on transnational smuggling, and puts forth an analytical framework from the smugglers\u27 perspective with respect to route selection, focusing primarily on aspects of economic, political, and human geography. It is predicated on three interconnected decision-making domains that constitute the smuggler\u27s operational landscape, namely access, risk and connectivity, which interact to drive the smugglers\u27 perceptions of route attractiveness. The first two domains operate reciprocally, primarily at the national level of analysis, and together both shape and are shaped by the third at the transnational level to form a feedback loop. With respect to connectivity, the convention of the smuggling vector is also introduced. As a benchmark commodity, heroin is used to demonstrate the utility of this approach with the primary aim of applying and validating the generic geographic smuggling model, meant to be extensible in terms of space, time and commodity. A review of the literature, focusing on the range of smuggled commodities, the nature and evolution of smuggling actors, the complex relationship between smuggling networks and nation-states, and potential modes of transportation by land, water and air. A discussion of the spatial parameters of the global heroin trade itself, with specific reference to the geography of supply and demand, is also undertaken. For case studies, Afghanistan has been chosen as one of the two largest opium cultivators worldwide, as well as by virtue of its recent and dramatic history. In addition to established cocaine smuggling routes and methods, Colombia has also become a primary heroin source country with respect to the U.S. market. Finally, Nigeria is a known transit hub without being a center of production, demonstrating that factors other than mere proximity can be decisive. Each case study first examines those geographic and historical factors that shape heroin smuggling at the national level, focusing on the themes of terrain, tradition and domestic turmoil, before considering the various sets of smuggling vectors that proceed outward via various modes and points of transit to their final destinations. This methodology not only highlights data gaps inherent in analyzing black markets, but also optimizes extant sources of information

Riverine sustainment 2012

Student Integrated ProjectIncludes supplementary materialThis technical report analyzed the Navy's proposed Riverine Force (RF) structure and capabilities for 2012. The Riverine Sustainment 2012 Team (RST) examined the cost and performance of systems of systems which increased RF sustainment in logistically barren environments. RF sustainment was decomposed into its functional areas of supply, repair, and force protection. The functional and physical architectures were developed in parallel and were used to construct an operational architecture for the RF. The RST used mathematical, agent-based and queuing models to analyze various supply, repair and force protection system alternatives. Extraction of modeling data revealed several key insights. Waterborne heavy lift connectors such as the LCU-2000 are vital in the re-supply of the RF when it is operating up river in a non-permissive environment. Airborne heavy lift connectors such as the MV-22 were ineffective and dominated by the waterborne variants in the same environment. Increase in manpower and facilities did appreciable add to the operational availability of the RF. Mean supply response time was the biggest factor effecting operational availability and should be kept below 24 hours to maintain operational availability rates above 80%. Current mortar defenses proposed by the RF are insufficient.N

Collective intelligence: creating a prosperous world at peace

XXXII, 612 p. ; 24 cmLibro ElectrónicoEn este documento se plantea un tema de interes general mas como lo es especificamente el tema de la evolucion de la sociedad en materia de industria y crecimiento de las actividades humanas en el aspecto de desarrollo de la creatividad enfocada a los mercadosedited by Mark Tovey ; foreword by Yochai Benkler (re-mixed by Hassan Masum) ; prefaces by Thomas Malone, Tom Atlee & Pierre Levy ; afterword by Paul Martin & Thomas Homer-Dixon.The era of collective intelligence has begun in earnest. While others have written about the wisdom of crowds, an army of Davids, and smart mobs, this collection of essays for the first time brings together fifty-five pioneers in the emerging discipline of collective intelligence. They provide a base of tools for connecting people, producing high-functioning teams, collaborating at multiple scales, and encouraging effective peer-production. Emerging models are explored for digital deliberative democracy, self-governance, legislative transparency, true-cost accounting, and the ethical use of open sources and methods. Collective Intelligence is the first of a series of six books, which will also include volumes on Peace Intelligence, Commercial Intelligence, Gift Intelligence, Cultural Intelligence, and Global Intelligence.Table of Contents Dedication i Publisher’s Preface iii Foreword by Yochai Benkler Remix Hassan Masum xi The Wealth of Networks: Highlights remixed Editor’s Preface xxi Table of Contents xxv A What is collective intelligence and what will we do 1 about it? (Thomas W. Malone, MIT Center for Collective Intelligence) B Co-Intelligence, collective intelligence, and conscious 5 evolution (Tom Atlee, Co-Intelligence Institute) C A metalanguage for computer augmented collective 15 intelligence (Prof. Pierre Lévy, Canada Research Chair in Collective Intelligence, FRSC) I INDIVIDUALS & GROUPS I-01 Foresight I-01-01 Safety Glass (Karl Schroeder, science fiction author 23 and foresight consultant) I-01-02 2007 State of the Future (Jerome C. Glenn & 29 Theodore J. Gordon, United Nations Millennium Project) I-02 Dialogue & Deliberation I-02-01 Thinking together without ego: Collective intelligence 39 as an evolutionary catalyst (Craig Hamilton and Claire Zammit, Collective-Intelligence.US) I-02-02 The World Café: Awakening collective intelligence 47 and committed action (Juanita Brown, David Isaacs and the World Café Community) I-02-03 Collective intelligence and the emergence of 55 wholeness (Peggy Holman, Nexus for Change, The Change Handbook) I-02-04 Knowledge creation in collective intelligence (Bruce 65 LaDuke, Fortune 500, HyperAdvance.com) I-02-05 The Circle Organization: Structuring for collective 75 wisdom (Jim Rough, Dynamic Facilitation & The Center for Wise Democracy) I-03 Civic Intelligence I-03-01 Civic intelligence and the public sphere (Douglas 83 Schuler, Evergreen State College, Public Sphere Project) I-03-02 Civic intelligence and the security of the homeland 95 (John Kesler with Carole and David Schwinn, IngeniusOnline) I-03-03 Creating a Smart Nation (Robert Steele, OSS.Net) 107 I-03-04 University 2.0: Informing our collective intelligence 131 (Nancy Glock-Grueneich, HIGHEREdge.org) I-03-05 Producing communities of communications and 145 foreknowledge (Jason “JZ” Liszkiewicz, Reconfigure.org) I-03-06 Global Vitality Report 2025: Learning to transform I-04 Electronic Communities & Distributed Cognition I-04-01 Attentional capital and the ecology of online social 163 conflict and think together effectively (Peter+Trudy networks (Derek Lomas, Social Movement Lab, Johnson-Lenz, Johnson-Lenz.com ) UCSD) I-04-02 A slice of life in my virtual community (Howard 173 Rheingold, Whole Earth Review, Author & Educator) I-04-03 Shared imagination (Dr. Douglas C. Engelbart, 197 Bootstrap) I-05 Privacy & Openness I-05-01 We’re all swimming in media: End-users must be able 201 to keep secrets (Mitch Ratcliffe, BuzzLogic & Tetriad) I-05-02 Working openly (Lion Kimbro, Programmer and 205 Activist) I-06 Integral Approaches & Global Contexts I-06-01 Meta-intelligence for analyses, decisions, policy, and 213 action: The Integral Process for working on complex issues (Sara Nora Ross, Ph.D. ARINA & Integral Review) I-06-02 Collective intelligence: From pyramidal to global 225 (Jean-Francois Noubel, The Transitioner) I-06-03 Cultivating collective intelligence: A core leadership 235 competence in a complex world (George Pór, Fellow at Universiteit van Amsterdam) II LARGE-SCALE COLLABORATION II-01 Altruism, Group IQ, and Adaptation II-01-01 Empowering individuals towards collective online 245 production (Keith Hopper, KeithHopper.com) II-01-02 Who’s smarter: chimps, baboons or bacteria? The 251 power of Group IQ (Howard Bloom, author) II-01-03 A collectively generated model of the world (Marko 261 A. Rodriguez, Los Alamos National Laboratory) II-02 Crowd Wisdom and Cognitive Bias II-02-01 Science of CI: Resources for change (Norman L 265 Johnson, Chief Scientist at Referentia Systems, former LANL) II-02-02 Collectively intelligent systems (Jennifer H. Watkins, 275 Los Alamos National Laboratory) II-02-03 A contrarian view (Jaron Lanier, scholar-in-residence, 279 CET, UC Berkeley & Discover Magazine) II-03 Semantic Structures & The Semantic Web II-03-01 Information Economy Meta Language (Interview with 283 Professor Pierre Lévy, by George Pór) II-03-02 Harnessing the collective intelligence of the World- 293 Wide Web (Nova Spivack, RadarNetworks, Web 3.0) II-03-03 The emergence of a global brain (Francis Heylighen, 305 Free University of Brussels) II-04 Information Networks II-04-01 Networking and mobilizing collective intelligence (G. Parker Rossman, Future of Learning Pioneer) II-04-02 Toward high-performance organizations: A strategic 333 role for Groupware (Douglas C. Engelbart, Bootstrap) II-04-03 Search panacea or ploy: Can collective intelligence 375 improve findability? (Stephen E. Arnold, Arnold IT, Inc.) II-05 Global Games, Local Economies, & WISER II-05-01 World Brain as EarthGame (Robert Steele and many 389 others, Earth Intelligence Network) II-05-02 The Interra Project (Jon Ramer and many others) 399 II-05-03 From corporate responsibility to Backstory 409 Management (Alex Steffen, Executive Editor, Worldchanging.com) II-05-04 World Index of Environmental & Social 413 Responsibility (WISER) By the Natural Capital Institute II-06 Peer-Production & Open Source Hardware II-06-01 The Makers’ Bill of Rights (Jalopy, Torrone, and Hill) 421 II-06-02 3D Printing and open source design (James Duncan, 423 VP of Technology at Marketingisland) II-06-03 REBEARTHTM: 425 II-07 Free Wireless, Open Spectrum, and Peer-to-Peer II-07-01 Montréal Community Wi-Fi (Île Sans Fil) (Interview 433 with Michael Lenczner by Mark Tovey) II-07-02 The power of the peer-to-peer future (Jock Gill, 441 Founder, Penfield Gill Inc.) Growing a world 6.6 billion people would want to live in (Marc Stamos, B-Comm, LL.B) II-07-03 Open spectrum (David Weinberger) II-08 Mass Collaboration & Large-Scale Argumentation II-08-01 Mass collaboration, open source, and social 455 entrepreneurship (Mark Tovey, Advanced Cognitive Engineering Lab, Institute of Cognitive Science, Carleton University) II-08-02 Interview with Thomas Homer-Dixon (Hassan 467 Masum, McLaughlin-Rotman Center for Global Health) II-08-03 Achieving collective intelligence via large-scale argumentation (Mark Klein, MIT Center for Collective Intelligence) II-08-04 Scaling up open problem solving (Hassan Masum & 485 Mark Tovey) D Afterword: The Internet and the revitalization of 495 democracy (The Rt. Honourable Paul Martin & Thomas Homer-Dixon) E Epilogue by Tom Atlee 513 F Three Lists 515 1. Strategic Reading Categories 2. Synopsis of the New Progressives 3. Fifty-Two Questions that Matter G Glossary 519 H Index 52

Wireless Network Design and Optimization: From Social Awareness to Security

abstract: A principal goal of this dissertation is to study wireless network design and optimization with the focus on two perspectives: 1) socially-aware mobile networking and computing; 2) security and privacy in wireless networking. Under this common theme, this dissertation can be broadly organized into three parts. The first part studies socially-aware mobile networking and computing. First, it studies random access control and power control under a social group utility maximization (SGUM) framework. The socially-aware Nash equilibria (SNEs) are derived and analyzed. Then, it studies mobile crowdsensing under an incentive mechanism that exploits social trust assisted reciprocity (STAR). The efficacy of the STAR mechanism is thoroughly investigated. Next, it studies mobile users' data usage behaviors under the impact of social services and the wireless operator's pricing. Based on a two-stage Stackelberg game formulation, the user demand equilibrium (UDE) is analyzed in Stage II and the optimal pricing strategy is developed in Stage I. Last, it studies opportunistic cooperative networking under an optimal stopping framework with two-level decision-making. For both cases with or without dedicated relays, the optimal relaying strategies are derived and analyzed. The second part studies radar sensor network coverage for physical security. First, it studies placement of bistatic radar (BR) sensor networks for barrier coverage. The optimality of line-based placement is analyzed, and the optimal placement of BRs on a line segment is characterized. Then, it studies the coverage of radar sensor networks that exploits the Doppler effect. Based on a Doppler coverage model, an efficient method is devised to characterize Doppler-covered regions and an algorithm is developed to find the minimum radar density required for Doppler coverage. The third part studies cyber security and privacy in socially-aware networking and computing. First, it studies random access control, cooperative jamming, and spectrum access under an extended SGUM framework that incorporates negative social ties. The SNEs are derived and analyzed. Then, it studies pseudonym change for personalized location privacy under the SGUM framework. The SNEs are analyzed and an efficient algorithm is developed to find an SNE with desirable properties.Dissertation/ThesisDoctoral Dissertation Electrical Engineering 201

Corridor Location: Generating Competitive and Efficient Route Alternatives

The problem of transmission line corridor location can be considered, at best, a "wicked" public systems decision problem. It requires the consideration of numerous objectives while balancing the priorities of a variety of stakeholders, and designers should be prepared to develop diverse non-inferior route alternatives that must be defensible under the scrutiny of a public forum. Political elements aside, the underlying geographical computational problems that must be solved to provide a set of high quality alternatives are no less easy, as they require solving difficult spatial optimization problems on massive GIS terrain-based raster data sets.Transmission line siting methodologies have previously been developed to guide designers in this endeavor, but close scrutiny of these methodologies show that there are many shortcomings with their approaches. The main goal of this dissertation is to take a fresh look at the process of corridor location, and develop a set of algorithms that compute path alternatives using a foundation of solid geographical theory in order to offer designers better tools for developing quality alternatives that consider the entire spectrum of viable solutions. And just as importantly, as data sets become increasingly massive and present challenging computational elements, it is important that algorithms be efficient and able to take advantage of parallel computing resources.A common approach to simplify a problem with numerous objectives is to combine the cost layers into a composite a priori weighted single-objective raster grid. This dissertation examines new methods used for determining a spatially diverse set of near-optimal alternatives, and develops parallel computing techniques for brute-force near-optimal path enumeration, as well as more elegant methods that take advantage of the hierarchical structure of the underlying path-tree computation to select sets of spatially diverse near optimal paths.Another approach for corridor location is to simultaneously consider all objectives to determine the set of Pareto-optimal solutions between the objectives. This amounts to solving a discrete multi-objective shortest path problem, which is considered to be NP-Hard for computing the full set of non-inferior solutions. Given the difficulty of solving for the complete Pareto-optimal set, this dissertation develops an approximation heuristic to compute path sets that are nearly exact-optimal in a fraction of the time when compared to exact algorithms. This method is then applied as an upper bound to an exact enumerative approach, resulting in significant performance speedups. But as analytic computing continues to moved toward distributed clusters, it is important to optimize algorithms to take full advantage parallel computing. To that extent, this dissertation develops a scalable parallel framework that efficiently solves for the supported/convex solutions of a biobjective shortest path problem. This framework is equally applicable to other biobjective network optimization problems, providing a powerful tool for solving the next generation of location analysis and geographical optimization models

EFFICIENT DYNAMIC ADDRESSING BASED ROUTING FOR UNDERWATER WIRELESS SENSOR NETWORKS

This thesis presents a study about the problem of data gathering in the inhospitable underwater environment. Besides long propagation delays and high error probability, continuous node movement also makes it difficult to manage the routing information during the process of data forwarding. In order to overcome the problem of large propagation delays and unreliable link quality, many algorithms have been proposed and some of them provide good solutions for these issues, yet continuous node movements still need attention. Considering the node mobility as a challenging task, a distributed routing scheme called Hop-by-Hop Dynamic Addressing Based (H2- DAB) routing protocol is proposed where every node in the network will be assigned a routable address quickly and efficiently without any explicit configuration or any dimensional location information. According to our best knowledge, H2-DAB is first addressing based routing approach for underwater wireless sensor networks (UWSNs) and not only has it helped to choose the routing path faster but also efficiently enables a recovery procedure in case of smooth forwarding failure. The proposed scheme provides an option where nodes is able to communicate without any centralized infrastructure, and a mechanism furthermore is available where nodes can come and leave the network without having any serious effect on the rest of the network. Moreover, another serious issue in UWSNs is that acoustic links are subject to high transmission power with high channel impairments that result in higher error rates and temporary path losses, which accordingly restrict the efficiency of these networks. The limited resources have made it difficult to design a protocol which is capable of maximizing the reliability of these networks. For this purpose, a Two-Hop Acknowledgement (2H-ACK) reliability model where two copies of the same data packet are maintained in the network without extra burden on the available resources is proposed. Simulation results show that H2-DAB can easily manage during the quick routing changes where node movements are very frequent yet it requires little or no overhead to efficiently complete its tasks