LEADER 06896nam 22008655 450 001 9910299442603321 005 20250609110109.0 010 $a3-319-14699-8 024 7 $a10.1007/978-3-319-14699-7 035 $a(CKB)3710000000379586 035 $a(EBL)2094299 035 $a(SSID)ssj0001465728 035 $a(PQKBManifestationID)11859804 035 $a(PQKBTitleCode)TC0001465728 035 $a(PQKBWorkID)11478111 035 $a(PQKB)11538454 035 $a(DE-He213)978-3-319-14699-7 035 $a(MiAaPQ)EBC2094299 035 $a(PPN)184889022 035 $a(MiAaPQ)EBC3109251 035 $a(EXLCZ)993710000000379586 100 $a20150330d2015 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aStrategies Towards the New Sustainability Paradigm $eManaging the Great Transition to Sustainable Global Democracy /$fedited by Odile Schwarz-Herion, Abdelnaser Omran 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (211 p.) 300 $aDescription based upon print version of record. 311 08$a3-319-14698-X 320 $aIncludes bibliographical references at the end of each chapters. 327 $aPart I: Scenarios of Raskin et al.: From Visions to Reality -- Introduction -- 1. From Conventional Worlds to a New Sustainability Paradigm (NSP): Raskin?s Model Scenarios in the Light of Current Trends -- 2. Seeking Realistic Pathways to the NSP: A Literature Review of Key Works in the Great Transition Initiative (GTI) Paper Series -- 3. Transitions and Transformations in Western Countries -- 4. From Neo-Stalinism to sluggish markets: Transition in Romania -- 5. Transitions in the Middle East: The Arabian Spring with Focus on Libya -- 6. Sustainable Strategies for Malaysia Economic Transitions -- 7. Lessons Learnt From History: Analysis of Past Transitions and Transformations -- 8. Performing the New Sustainability Paradigm: The Role of Culture and Education -- 9. The Role of Different Players for the Great Transition Towards the NSP -- Part II: Ecological Challenges for the New Sustainability Paradigm -- 10. The Ecological Pillar of Sustainability and its Significance for the NSP: Major Problems -- 11. Urgent Ecological Problems for the NSP -- 12.The Myth of Sustainable Food Supply and the Urgent Need for Radical Change from Competitive Corporatism to Sustainable Stewardship -- Part III: Dealing with Challenges in Developing and Threshold Countries to Facilitate the NSP -- 13.Innovative Sustainable Solid Waste Management in Nigeria -- 14. On Innovative Sustainable City Architecture Models for Sustainable Cities in Asia or in Europe -- Part IV: Summary of Problems and Strategies for the NSP -- 15. Summary of Problems and the Current State of Play -- 16. Implementation of the New Sustainability Paradigm: List of Recommendations. 330 $aOn a historical global turning point, this book offers a thorough exploration of the ?New Sustainability Paradigm?, originally developed by the Global Scenario Group (GSG) of the Stockholm Environmental Institute (SEI) as a starting point for analyzing real-life transitions and transformations. 11 contributors from 5 continents present detailed analyses of economic and political transitions in Western and Eastern Europe, the USA, the Middle East, and in Asia, discussing the role of different players in the implementation of the New Sustainability Paradigm. Part I offers an overview of the six scenarios developed by the GSG and a short discussion of significant papers published by the Great Transition Initiative (GTI) of the Tellus Institute. Next come examples of dramatic historical and current transitions in Western Europe, the USA, Eastern Europe, the Middle East (Arabian Spring), and Asia, as well as an analysis of the potential of humankind to manage a great transition to the new sustainability paradigm. Subsequent chapters highlight the role of culture and education and review the role of different players for the implementation of the new sustainability paradigm. The focus of Part II is on the ecological pillar of Sustainability. The discussion includes urgent ecological problems including climate engineering, eco-criminality, bioterrorism, biodiversity protection, water, energy, and food security. Part III deals with needed innovations in sustainable waste management and sustainable city architecture, especially big cities in developing and threshold countries, where a significant part of the world population is concentrated. The fourth and final section offers an analysis of insights developed throughout the book, and outlines recommendations for the implementation of the New Sustainability Paradigm by civil society, grass-root movements, scholars, politically neutral NGOs, sincere media players, and by open-minded and enlightened politicians to manage and steer the Great Transition towards sustainable global democracy. 606 $aSustainable development 606 $aApplied ecology 606 $aEconomics 606 $aEconomic policy 606 $aHistory 606 $aEducation and state 606 $aEducation and state 606 $aSustainable Development$3https://scigraph.springernature.com/ontologies/product-market-codes/U34000 606 $aApplied Ecology$3https://scigraph.springernature.com/ontologies/product-market-codes/L19023 606 $aInternational Political Economy$3https://scigraph.springernature.com/ontologies/product-market-codes/912140 606 $aEconomic Policy$3https://scigraph.springernature.com/ontologies/product-market-codes/W34010 606 $aHistory, general$3https://scigraph.springernature.com/ontologies/product-market-codes/700000 606 $aEducational Policy and Politics$3https://scigraph.springernature.com/ontologies/product-market-codes/O19000 615 0$aSustainable development. 615 0$aApplied ecology. 615 0$aEconomics. 615 0$aEconomic policy. 615 0$aHistory. 615 0$aEducation and state. 615 0$aEducation and state. 615 14$aSustainable Development. 615 24$aApplied Ecology. 615 24$aInternational Political Economy. 615 24$aEconomic Policy. 615 24$aHistory, general. 615 24$aEducational Policy and Politics. 676 $a333.7 676 $a338.9 676 $a338.927 676 $a339.5 676 $a379 676 $a577 676 $a900 702 $aSchwarz-Herion$b Odile$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aOmran$b Abdelnaser$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910299442603321 996 $aStrategies Towards the New Sustainability Paradigm$92535235 997 $aUNINA LEADER 08022nam 22008415 450 001 9910484703803321 005 20251226195859.0 010 $a3-540-73545-3 024 7 $a10.1007/978-3-540-73545-8 035 $a(CKB)1000000000490449 035 $a(SSID)ssj0000316940 035 $a(PQKBManifestationID)11251768 035 $a(PQKBTitleCode)TC0000316940 035 $a(PQKBWorkID)10288011 035 $a(PQKB)11077897 035 $a(DE-He213)978-3-540-73545-8 035 $a(MiAaPQ)EBC3063217 035 $a(MiAaPQ)EBC6709298 035 $a(Au-PeEL)EBL6709298 035 $a(PPN)123163625 035 $a(EXLCZ)991000000000490449 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputing and Combinatorics $e13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings /$fedited by Guohui Lin 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XII, 572 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4598 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-73544-5 320 $aIncludes bibliographical references and index. 327 $aThe Combinatorics of Sequencing the Corn Genome -- Online Frequency Assignment in Wireless Communication Networks -- Information Distance from a Question to an Answer -- A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy -- A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem -- Seed-Based Exclusion Method for Non-coding RNA Gene Search -- A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method -- Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data -- Improved Exact Algorithms for Counting 3- and 4-Colorings -- Connected Coloring Completion for General Graphs: Algorithms and Complexity -- Quadratic Kernelization for Convex Recoloring of Trees -- On the Number of Cycles in Planar Graphs -- An Improved Exact Algorithm for Cubic Graph TSP -- Geometric Intersection Graphs: Do Short Cycles Help? -- Dimension, Halfspaces, and the Density of Hard Sets -- Isolation Concepts for Enumerating Dense Subgraphs -- Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time -- Counting Minimum Weighted Dominating Sets -- Online Interval Scheduling: Randomized and Multiprocessor Cases -- Scheduling Selfish Tasks: About the Performance of Truthful Algorithms -- Volume Computation Using a Direct Monte Carlo Method -- Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks -- Generating Minimal k-Vertex Connected Spanning Subgraphs -- Finding Many Optimal Paths Without Growing Any Optimal Path Trees -- Enumerating Constrained Non-crossing Geometric Spanning Trees -- Colored Simultaneous Geometric Embeddings -- Properties of Symmetric Incentive Compatible Auctions -- Finding Equilibria in Games of No Chance -- Efficient Testing of Forecasts -- When Does Greedy Learning of Relevant Attributes Succeed? -- The Informational Content of Canonical Disjoint NP-Pairs -- On the Representations of NC and Log-Space Real Numbers -- Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals -- Streaming Algorithms Measured in Terms of the Computed Quantity -- A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem -- Optimal Offline Extraction of Irredundant Motif Bases -- Linear Algorithm for Broadcasting in Unicyclic Graphs -- An Improved Algorithm for Online Unit Clustering -- Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs -- Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions -- On the Hardness of Optimization in Power Law Graphs -- Can a Graph Have Distinct Regular Partitions? -- Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games -- Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates -- On the Complexity of Finding an Unknown Cut Via Vertex Queries -- ?Resistant? Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas -- An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity -- Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats -- Priority Algorithms for the Subset-Sum Problem -- Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families -- A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs -- Improved Algorithms for Weighted and Unweighted Set Splitting Problems -- An -Approximation Algorithm for a Hard Variant of Stable Marriage -- Approximation Algorithmsfor the Black and White Traveling Salesman Problem. 330 $aThe Annual International Computing and Combinatorics Conference is an annual forum for exploring research, development, and novel applications of computing and combinatorics. It brings together researchers, professionals and industrial practitioners to interact and exchange knowledge, ideas and progress. Thetopics covermost aspects oftheoreticalcomputer scienceand combinatorics related to computing. The 13th Annual International Computing and Com- natorics Conference (COCOON 2007) was held in Ban?, Alberta during July 16?19, 2007. This was the ?rst time that COCOON was held in Canada. We received 165 submissions, among which 11 were withdrawn for various reasons. The remaining 154 submissions under full consideration came from 33 countries and regions: Australia, Brazil, Canada, China, the Czech Republic, Denmark, Finland, France, Germany, Greece, Hong Kong, India, Iran, Ireland, Israel, Italy, Japan, the Netherlands, Norway, Pakistan, Poland, Romania, R- sia, Slovakia, South Korea, Spain, Sweden, Switzerland, Taiwan, Turkey, the UK, the USA, and the US minor outlying islands. Afterasixweekperiodofcarefulreviewinganddiscussions,theprogramc- mittee accepted 51 submissions for oral presentation at the conference. Based on the a?liations, 1. 08 of the accepted papers were from Australia, 7. 67 from Canada, 3. 08 from China, 1 from the Czech Republic, 2 from Denmark, 1 from France, 5. 42 from Germany, 0. 08 from Greece, 2. 18 from Hong Kong, 0. 33 from India, 0. 17 from Ireland, 1. 83 from Israel, 1. 5fromItaly,2. 9 from Japan, 0. 17 from the Netherlands, 2. 67 from Norway, 0. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4598 606 $aComputer science 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer networks 606 $aArtificial intelligence$xData processing 606 $aComputer graphics 606 $aTheory of Computation 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Communication Networks 606 $aData Science 606 $aComputer Graphics 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer networks. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer graphics. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Communication Networks. 615 24$aData Science. 615 24$aComputer Graphics. 676 $a004 702 $aLin$b Guohui 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484703803321 996 $aComputing and Combinatorics$9772278 997 $aUNINA LEADER 04588nam 22007695 450 001 9910483497603321 005 20251226202246.0 024 7 $a10.1007/11533719 035 $a(CKB)1000000000213157 035 $a(SSID)ssj0000316942 035 $a(PQKBManifestationID)11237051 035 $a(PQKBTitleCode)TC0000316942 035 $a(PQKBWorkID)10287315 035 $a(PQKB)10922844 035 $a(DE-He213)978-3-540-31806-4 035 $a(MiAaPQ)EBC3067777 035 $a(PPN)123096472 035 $a(BIP)12724499 035 $a(EXLCZ)991000000000213157 100 $a20100928d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputing and Combinatorics $e11th Annual International Conference, COCOON 2005, Kunming, China, August 16-19, 2005, Proceedings /$fedited by Lusheng Wang 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XVI, 1000 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3595 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$aPrinted edition: 9783540280613 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- Bioinformatics -- Networks -- String Algorithms -- Scheduling -- Complexity -- Steiner Trees -- Graph Drawing and Layout Design -- Quantum Computing -- Randomized Algorithms -- Geometry -- Codes -- Finance -- Facility Location -- Graph Theory -- Graph Algorithms -- Others. 330 $aThe papers in this volume were presented at the Eleventh Annual International ComputingandCombinatorics Conference(COCOON2005),heldAugust16-19, 2005,in Kunming, China. The topicscovermost aspects oftheoreticalcomputer science and combinatorics related to computing. Submissionstotheconferencethisyearwereconductedelectronically.Atotal of 353 papers were submitted, of which 96 were accepted. So the competition is very ?erce. The papers were evaluated by an international program committee consisting of Tatsuya Akutsu, Vineet Bafna, Zhi-Zhong Chen, Siu-Wing Cheng, Francis Chin, Sunghee Choi, Bhaskar DasGupta, Qizhi Fang, Martin Farach- Colton, Ra'aele Giancarlo, Mordecai Golin, Peter Hammer, Tsan-sheng Hsu, Sorin C. Istrail, Samir Khuller, Michael A. Langston, Jianping Li, Weifa Liang, GuohuiLin, BernardMans,SatoruMiyano,C.K.Poon,R.Ravi,DavidSanko?, Shang-Hua Teng, H. F. Ting, Seinosuke Toda, Takeshi Tokuyama, Peng-Jun Wan, Lusheng Wang, Todd Wareham, Jinhui Xu, Xizhong Zheng, Kaizhong Zhang and Binhai Zhu. The authors of submitted papers came from more than 25 countries and regions. In addition to the selected papers, the conference also included three invited presentations by Alberto Apostolico, Shang-Hua Teng, and Leslie G. Valiant. This year's Wang Hao Award (for young researchers) was given to the paperApproximatingtheLongestCycle Problem onGraphs with BoundedDegree by Guantao Chen, Zhicheng Gao, Xingxing Yu and Wenan Zang. I would like to thank all the people who made this meeting possible and - joyable:the authors for submitting papers and the programcommittee members andexternalrefereesfor their excellentwork.I wouldalsoliketo thank thethree invited speakers and the local organizers and colleagues for their assistance. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3595 606 $aAlgorithms 606 $aComputer networks 606 $aArtificial intelligence$xData processing 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aAlgorithms 606 $aComputer Communication Networks 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 615 0$aAlgorithms. 615 0$aComputer networks. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 14$aAlgorithms. 615 24$aComputer Communication Networks. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a004 701 $aWang$b Lusheng$f1962-$01702753 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483497603321 996 $aComputing and combinatorics$94204226 997 $aUNINA