04036nam 2200577I 450 991077459920332120230508103407.09780472903054047290305510.3998/mpub.12393633(CKB)5590000001271461(MiU)10.3998/mpub.12393633(ODN)ODN0010390561(EXLCZ)99559000000127146120230505h20232023 uy 0engurunu||||||||txtrdacontentcrdamediacrrdacarrierSecurity. Cooperation. Governance. the Canada-United States open border paradox /Christian Leuprecht and Todd Hataley editorsAnn Arbor :University of Michigan Press,2023.©20231 online resource (xvi, 209 pages) illustrationsTitle from eBook information screen..9780472075713 0472075713 Includes bibliographical references and index.Historically, national borders have evolved in ways that serve the interests of central states in security and the regulation of trade. Security. Cooperation. Governance. explores Canada-US border and security policies that have evolved from successive trade agreements since the 1950s, punctuated by new and emerging challenges to security in the twenty-first century. The sectoral and geographical diversity of cross-border interdependence of what remains the world's largest bilateral trade relationship makes the US-Canada border a living laboratory for studying the interaction of trade, security, and other border policies that challenge traditional centralized approaches to national security. The book's findings show that border governance straddles multiple regional, sectoral, and security scales in ways rarely documented in such detail. These developments have precipitated an Open Border Paradox: extensive, regionally varied flows of trade and people have resulted in a series of nested but interdependent security regimes that function on different scales and vary across economic and policy sectors. These realities have given rise to regional and sectoral specialization in related security regimes. For instance, just-in-time automotive production in the Great Lakes region varies considerably from the governance of maritime and intermodal trade (and port systems) on the Atlantic and Pacific coasts, which in turn is quite different from commodity-based systems that manage diverse agricultural and food trade in the Canadian Prairies and U.S. Great Plains. The paradox of open borders and their legitimacy is a function of robust bilateral and multilevel governance based on effective partnerships with substate governments and the private sector. Effective policy accounts for regional variation in integrated binational security and trade imperatives. At the same time, binational and continental policies are embedded in each country's trade and security relationships beyond North America.Border securityCanadian-American Border RegionBorder securityUnited StatesBorder securityCanadaCanadian-American Border RegionSecurity measuresCanadian-American Border RegionPolitics and governmentUnited StatesRelationsCanadaCanadaRelationsUnited StatesUnited StatesCommerceSecurity measuresCanadaCanadaCommerceSecurity measuresUnited StatesBorder securityBorder securityBorder securityPOL000000POL011000POL056000bisacshLeuprecht Christian1271350Leuprecht Christian1973-Hataley Todd S(Todd Steven),1963-EYMEYMBOOK9910774599203321Security. Cooperation. Governance4403335UNINA05901nam 22008655 450 991014360680332120250724091846.01-280-93816-197866109381623-540-44691-510.1007/3-540-44691-5(CKB)1000000000211387(EBL)3037329(SSID)ssj0000288521(PQKBManifestationID)11242700(PQKBTitleCode)TC0000288521(PQKBWorkID)10381494(PQKB)11196154(DE-He213)978-3-540-44691-0(MiAaPQ)EBC3037329(MiAaPQ)EBC6414108(PPN)155165887(EXLCZ)99100000000021138720121227d2001 u| 0engur|n|---|||||txtccrAlgorithm Engineering 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings /edited by Stefan Näher, Dorothea Wagner1st ed. 2001.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2001.1 online resource (250 p.)Lecture Notes in Computer Science,1611-3349 ;1982Description based upon print version of record.3-540-42512-8 Includes bibliographical references and index.Invited Lectures -- On the Differences between “Practical” and “Applied” -- Contributed Papers -- An Experimental Study of Online Scheduling Algorithms -- Implementation of O(nmlog n) Weighted Matchings in General Graphs. The Power of Data Structures -- Pushing the Limits in Sequential Sorting -- Efficient Sorting Using Registers and Caches -- Lattice Basis Reduction with Dynamic Approximation -- Clustering Data without Prior Knowledge -- Recognizing Bundles in Time Table Graphs - A Structural Approach -- Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks -- Portable List Ranking: An Experimental Study -- Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM -- Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms -- Visualizing Algorithms Over the Web with the Publication-Driven Approach -- Interchanging Tw Segments of an Array in a Hierarchical Memory System -- Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves -- Planar Point Location for Large Data Sets: To Seek or Not to Seek -- Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees -- Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees -- Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study -- New Algorithms for Examination Timetabling.This volume contains the papers accepted for the 4th Workshop on Algorithm Engineering (WAE 2000) held in Saarbruc ¨ ken, Germany, during 5–8 September 2000, together with the abstract of the invited lecture given by Karsten Weihe. The Workshop on Algorithm Engineering covers research on all aspects of the subject. The goal is to present recent research results and to identify and explore directions for future research. Previous meetings were held in Venice (1997), Saarbruc ¨ ken (1998), and London (1999). Papers were solicited describing original research in all aspects of algorithm engineering, including: – Development of software repositories and platforms which allow the use of and experimentation with e?cient discrete algorithms. – Novel uses of discrete algorithms in other disciplines and the evaluation of algorithms for realistic environments. – Methodological issues including standards in the context of empirical - search on algorithms and data structures. – Methodological issues regarding the process of converting user requirements into e?cient algorithmic solutions and implementations. The program committee accepted 16 from a total of 30 submissions. The program committee meeting was conducted electronically. The criteria for sel- tion were originality, quality, and relevance to the subject area of the workshop. Considerable e?ort was devoted to the evaluation of the submissions and to p- viding the authors with feedback. Each submission was reviewed by at least four program committee members (assisted by subreferees). A special issue of the ACM Journal of Experimental Algorithmics will be devoted to selected papers from WAE 2000.Lecture Notes in Computer Science,1611-3349 ;1982Computer programmingComputer scienceAlgorithmsNumerical analysisArtificial intelligenceData processingComputer networksProgramming TechniquesTheory of ComputationAlgorithmsNumerical AnalysisData ScienceComputer Communication NetworksComputer programming.Computer science.Algorithms.Numerical analysis.Artificial intelligenceData processing.Computer networks.Programming Techniques.Theory of Computation.Algorithms.Numerical Analysis.Data Science.Computer Communication Networks.005.1Näher StefanWagner Dorothea1957-International Workshop on Algorithm Engineering.MiAaPQMiAaPQMiAaPQBOOK9910143606803321Algorithm engineering1980326UNINA