检索结果-内蒙古大学图书馆

One Earth 2025年

作者： Schaeffer, Roberto Schipper, E. Lisa F. Ospina, Daniel Mirazo, Paula Alencar, Ane Anvari, Mehrnaz Artaxo, Paulo Biresselioglu, Mehmet Efe Blome, Tanja Boeckmann, Melanie Brink, Ebba Broadgate, Wendy Bustamante, Mercedes Cai, Wenju Canadell, Josep G. Cardinale, Roberto Chidichimo, Maria Paz Ditlevsen, Peter Eicker, Ursula Feron, Sarah Fikru, Mahelet G. Fuss, Sabine Gaye, Amadou T. Gustafsson, Örjan Harring, Niklas He, Cheng Hebden, Sophie Heilemann, Adrian Hirota, Marina Janardhanan, Nandakumar Juhola, Sirkku Jung, Tae Yong Kejun, Jiang Kilkiș, Şiir Kumarasinghe, Nilushi Lapola, David Lee, June-Yi Levis, Carolina Lusambili, Adelaide Maasakkers, Joannes D. MacIntosh, Claire Mahmood, Jemilah Mankin, Justin S. Marchegiani, Pía Martin, Maria Mukherji, Aditi Muñoz-Erickson, Tischa A. Niazi, Zeenat Nyangon, Joseph Pandipati, Santosh Perera, Amarasinghage T.D. Persad, Geeta Persson, Åsa Redman, Aaron Riipinen, Ilona Rockström, Johan Roffe, Sarah Roy, Joyashree Sakschewski, Boris Samset, Bjørn H. Schlosser, Peter Sharifi, Ayyoob Shih, Wan-Yu Sioen, Giles B. Sokona, Youba Stammer, Detlef Suk, Sunhee Thiam, Djiby Thompson, Vikki Tullos, Erin van Westen, René M. Vargas Falla, Ana Maria Vecellio, Daniel J. Worden, John Wu, Henry C. Xu, Chi Yang, Yang Zachariah, Mariam Zhang, Zhen Ziervogel, Gina Federal University of Rio de Janeiro Rio de Janeiro Brazil University of Bonn Bonn Germany Future Earth Secretariat Stockholm Sweden Arizona State University Tempe AZ United States Amazon Environmental Research Institute (IPAM) Brasilia Brazil Fraunhofer Institute for Algorithms and Scientific Computing SCAI St. Augustin Germany Potsdam Institute for Climate Impact Research (PIK) Potsdam Germany University of São Paulo São Paulo Brazil İzmir University of Economics İzmir Turkey Climate Service Center Germany (GERICS) Helmholtz-Zentrum Hereon Hamburg Germany University of Bremen Bremen Germany Lund University Lund Sweden University of Brasilia Brasilia Brazil Ocean University of China Qingdao China Xiamen University Xiamen China Commonwealth Scientific and Industrial Research Organisation (CSIRO) Environment Canberra ACT Australia University College London London United Kingdom National Scientific and Technical Research Council (CONICET) Buenos Aires Argentina National University of San Martin Buenos Aires Argentina University of Copenhagen Copenhagen Denmark Concordia University Montreal QC Canada University of Groningen Groningen Netherlands Missouri University of Science and Technology Rolla MO United States Mercator Research Institute on Global Commons and Climate Change (MCC) Berlin Germany Humboldt-University of Berlin Berlin Germany Cheikh Anta Diop University Dakar Senegal Stockholm University Stockholm Sweden University of Gothenburg Gothenburg Sweden Institute of Epidemiology Helmholtz Zentrum München—German Research Center for Environmental Health (GmbH) Neuherberg Germany European Space Agency (ESA) - European Centre for Space Applications and Telecommunications (ECSAT) Oxford United Kingdom Federal University of Santa Catarina Florianopolis Brazil Institute for Global Environmental Strategies (IGES) Hayama Japan University of Helsinki Helsinki Finland Yonsei University Graduate Seoul South Korea Chinese Academy of Macroeconomic

The years 2023 and 2024 were characterized by unprecedented warming across the globe, underscoring the urgency of climate action. Robust science advice for decision makers on subjects as complex as climate change requires deep cross- and interdisciplinary understanding. However, navigating the ever-expanding and diverse peer-reviewed literature on climate change is enormously challenging for individual researchers. We elicited expert input through an online questionnaire (188 respondents from 45 countries) and prioritized 10 key advances in climate-change research with high policy relevance. The insights span a wide range of areas, from changes in methane and aerosol emissions to the factors shaping citizens’ acceptance of climate policies. This synthesis and communications effort forms the basis for a science-policy report distributed to party delegations ahead of the 29th session of the Conference of the Parties (COP29) to inform their positions and arguments on critical issues, including heat-adaptation planning, comprehensive mitigation strategies, and strengthened governance in energy-transition minerals value chains. © 2025 The Authors

关键词： adaptation climate policy climate science governance just transition mitigation resilience science policy

来源：评论

学校读者我要写书评

暂无评论

Solving SAT by P systems with active membranes in linear time in the number of variables

Solving SAT by P systems with active membranes in linear tim...

引用

14th International Conference on Membrane Computing, CMC 2013

作者： Gazdag, Zsolt Department of Algorithms and Their Applications Faculty of Informatics Ëotvos Loŕand University Hungary

ISBN: (纸本)9783642542381

In this paper we solve the SAT problem (the satisfiability problem of propositional formulas in conjunctive normal form) by two polynomially uniform families of P systems with active membranes. The novelty of these solutions is that these P systems can solve the SAT problem in linear time in the number of propositional variables occurring in the input. This means that the number of computation steps is independent form the number of clauses of the input. To achieve this efficiency our systems employ only the standard rules of P systems with active membranes plus membrane creation rules. Moreover, in the first solution the P systems do not use the polarizations of the membranes but use such membrane division rules which can change the labels of the involved membranes. In the second solution the P systems do not employ membrane label changing but use the polarizations of the membranes instead. © 2014 Springer-Verlag Berlin Heidelberg.

关键词： Membranes

来源：评论

学校读者我要写书评

暂无评论

Simulating turing machines with polarizationless P systems with active membranes

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8961卷 229-240页

作者： Gazdag, Zsolt Kolonits, Gábor Gutiérrez-Naranjo, Miguel A Department of Algorithms and Their Applications Eötvös Loránd University Budapest Hungary Research Group on Natural Computing Department of Computer Science and Artificial Intelligence University of Sevilla Sevilla41012 Spain

We prove that every single-tape deterministic Turing machine working in t(n) time, for some function t : N → N, can be simulated by a uniform family of polarizationless P systems with active membranes. Moreover, this is done without significant slowdown in the working time. Furthermore, if log t(n) is space constructible, then the members of the uniform family can be constructed by a family machine that uses O(log t(n)) space. ©Springer International Publishing Switzerland 2014.

关键词： Turing machines

来源：评论

学校读者我要写书评

暂无评论

Solving the ST-connectivity problem with pure membrane computing techniques

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8961卷 215-228页

作者： Gazdag, Zsolt Gutiérrez-Naranjo, Miguel A. Department of Algorithms and Their Applications Eötvös Loránd University Budapest Hungary Research Group on Natural Computing Department of Computer Science and Artificial Intelligence University of Sevilla Sevilla41012 Spain

In Membrane Computing, the solution of a decision problemX belonging to the complexity class P via a polynomially uniform familyof recognizer P systems is trivial, since the polynomial encoding of theinput can involve the solution of the problem. The design of such solutionhas one membrane, two objects, two rules and one computation *** sensu, it is a solution in the framework of Membrane Computing,but it does not use Membrane Computing strategies. In this paper, wepresent three designs of uniform families of P systems that solve the decisionproblem STCON by using Membrane Computing strategies (pureMembrane Computing techniques): P systems with membrane creation,P systems with active membranes with dissolution and without polarizationsand P systems with active membranes without dissolution andwith polarizations. Since STCON is NL-complete, such designs are constructiveproofs of the inclusion of NL in PMCMC, PMCAM0+d and PMCAM+−d. © Springer International Publishing Switzerland 2014.

关键词： Dissolution

来源：评论

学校读者我要写书评

暂无评论

On counter machines versus dP automata

On counter machines versus dP automata

引用

14th International Conference on Membrane Computing, CMC 2013

作者： Csuhaj-Varjú, Erzsébet Vaszil, György Department of Algorithms and Their Applications Faculty of Informatics Ëotvos Loŕand University Pazmany Peter setany 1/c 1117 Budapest Hungary Department of Computer Science Faculty of Informatics University of Debrecen P.O. Box 12 4010 Debrecen Hungary

ISBN: (纸本)9783642542381

Continuing the study of connections between classical and P automata variants, we show that dP automata, i.e., distributed systems of P automata, where the input multiset is mapped to the set of strings consisting of all permutations of its elements, are as powerful as the class of distributed systems of special counter machine acceptors. These variants of counter machines read multisets (represented as sets of all permutations of their elements) and manipulate counters in a conventional manner. © 2014 Springer-Verlag Berlin Heidelberg.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

VERCE Delivers a Productive E-science Environment for Seismology Research

VERCE Delivers a Productive E-science Environment for Seismo...

引用

IEEE International Conference on e-Science and Grid Computing

作者： Malcolm Atkinson Michele Carpené Emanuele Casarotti Steffen Claus Rosa Filgueira Anton Frank Michelle Galea Tom Garth André Gemünd Heiner Igel Iraklis Klampanos Amrey Krause Lion Krischer Siew Hoon Leong Federica Magnoni Jonas Matser Alberto Michelini Andreas Rietbrock Horst Schwichtenberg Alessandro Spinuso Jean-Pierre Vilotte University of Edinburgh UK Supercomputing Applications and Innovation Department (CINECA) Italy Istituto Nazionale di Geofisica e Vulcanologia (INGV) Italy Fraunhofer Institute for Algorithms and Scientific Computing (SCAI) Germany The University of Edinburgh Edinburgh Edinburgh GB Leibniz Supercomputing Centre Germany University of Liverpool UK Ludwig-Maximilians-University Germany Royal Netherlands Meteorological Institute (KNMI) The Netherlands Institut de Physique du Globe de Paris (IPGP) France

The VERCE project has pioneered an e-Infrastructure to support researchers using established simulation codes on high-performance computers in conjunction with multiple sources of observational data. This is accessed and organised via the VERCE science gateway that makes it convenient for seismologists to use these resources from any location via the Internet. Their data handling is made flexible and scalable by two Python libraries, ObsPy and dispel4py and by data services delivered by ORFEUS and EUDAT. Provenance driven tools enable rapid exploration of results and of the relationships between data, which accelerates understanding and method improvement. These powerful facilities are integrated and draw on many other e-Infrastructures. This paper presents the motivation for building such systems, it reviews how solid-Earth scientists can make significant research progress using them and explains the architecture and mechanisms that make their construction and operation achievable. We conclude with a summary of the achievements to date and identify the crucial steps needed to extend the capabilities for seismologists, for solid-Earth scientists and for similar disciplines.

关键词： Computational modeling Data models Logic gates Context Earthquakes Analytical models Libraries

来源：评论

学校读者我要写书评

暂无评论

Dynamic search in fireworks algorithm

Dynamic search in fireworks algorithm

引用

Congress on Evolutionary Computation

作者： Shaoqiu Zheng Andreas Janecek Junzhi Li Ying Tan Department of Machine Intelligence Peking University Beijing P.R. China Research Group Theory and Applications of Algorithms University of Vienna Vienna Austria

We propose an improved version of the recently developed Enhanced Fireworks Algorithm (EFWA) based on an adaptive dynamic local search mechanism. In EFWA, the explosion amplitude (i.e., search area around the current location) of each firework is computed based on the quality of the firework's current location. This explosion amplitude is limited by a lower bound which decreases with the number of iterations in order to avoid the explosion amplitude to be [close to] zero, and in order to enhance global search abilities at the beginning and local search abilities towards the later phase of the algorithm. As the explosion amplitude in EFWA depends solely on the fireworks' fitness and the current number of iterations, this procedure does not allow for an adaptive optimization process. To deal with these limitations, we propose the Dynamic Search Fireworks Algorithm (dynFWA) which uses a dynamic explosion amplitude for the firework at the currently best position. If the fitness of the best firework could be improved, the explosion amplitude will increase in order to speed up convergence. On the contrary, if the current position of the best firework could not be improved, the explosion amplitude will decrease in order to narrow the search area. In addition, we show that one of the EFWA operators can be removed in dynFWA without a loss in accuracy - this makes dynFWA computationally more efficient than EFWA. Experiments on 28 benchmark functions indicate that dynFWA is able to significantly outperform EFWA, and achieves better performance than the latest SPSO version SPSO2011.

关键词： Explosions Sparks Heuristic algorithms Optimization Convergence Sociology Statistics

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8493 LNCS卷 V-VIII页

作者： Beckmann, Arnold Csuhaj-Varjú, Erzsébet Meer, Klaus Swansea University Department of Computer Science Swansea United Kingdom Eötvös Loránd University Department of Algorithms and Their Applications Budapest Hungary Brandenburg University of Technology Cottbus-Senftenberg Computer Science Institute Cottbus Germany

来源：评论

学校读者我要写书评

暂无评论

Solving the Klein-Gordon equation using Fourier spectral methods: A benchmark test for computer performance 23

Solving the Klein-Gordon equation using Fourier spectral met...

引用

23rd High Performance Computing Symposium, HPC 2015, Part of the 2015 Spring Simulation Multi-Conference, SpringSim 2015

作者： Aseeri, S. Batrašev, O. Icardi, M. Leu, B. Liu, A. Li, N. Muite, B.K. Müller, E. Palen, B. Quell, M. Servat, H. Sheth, P. Speck, R. Van Moer, M. Vienne, J. KAUST Supcrcomputing Laboratory 4700 King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia Arvutitcaduse Instituut Tartu Ülikool Liivi 2 Tartu50409 Estonia Stochastic Numerics Group 4700 King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia Electrical and Computer Engineering University of Michigan Ann ArborMI48109-2122 United States Numerical Algorithms Group Wilkinson House Jordan Hill Road Oxford0X2 8DR United Kingdom Numerical Mathematics Group 4700 King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia Department of Mathematical Sciences University of Bath BathBA2 7 AY United Kingdom CAEN Advanced Computing University of Michigan Ann ArborMI48109-2094 United States Lnstitut für Analysis und Scientific Computing Technische Universität Wien Wiedner Haupstrasse 8-10 Wien1040 Austria Compulcr Sciences Department BSC UPC c/Jordi Girona Barcelona Calalunya08034 Spain Biomedical Engineering University of Michigan Ann ArborMI48109-2122 United States Jülich Supercomputing Centre Forschungszentrum Jülich GmbH Germany Germany National Center for Supercomputing Applications University of Illinois at Urbiina-Chanipaign UrbanaIL61801 United States Texas Advanced Computing Center University of Texas at Austin AustinTX78758-4497 United States

ISBN: (纸本)9781510810600

The cubic Klein-Gordon equation is a simple but non-trivial partial differential equation whose numerical solution has the main building blocks required for the solution of many other partial differential equations. In this study, the library 2DE-COMP&FFT is used in a Fourier spectral scheme to solve the Klein-Gordon equation and strong scaling of the code is examined on thirteen different machines for a problem size of 5123. The results are useful in assessing likely performance of other parallel fast Fourier transform based programs for solving partial differential equations. The problem is chosen to be large enough to solve on a workstation, yet also of interest to solve quickly on a supercomputer, in particular for parametric studies. Unlike the Linpack benchmark, a high ranking will not be obtained by simply building a bigger computer. © 2015 Aseeri et al.

关键词： Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

On the power of permitting features in cooperating context-free array grammar systems

On the power of permitting features in cooperating context-f...

引用

作者： Subramanian, K.G. Venkat, Ibrahim Csuhaj-Varjú, Erzsébet School of Computer Sciences Universiti Sains Malaysia 11800 Penang Malaysia Department of Algorithms and Applications Faculty of Informatics Eötvös Loránd University Budapest Hungary

Among many grammar models for picture description, cooperating context-free distributed array grammar systems utilize the mechanism of cooperation between component array grammars. Here, we endow these grammar systems with the feature of permitting symbols, and examine the generative capacity of the resulting permitting cooperating context-free distributed array grammar systems with certain other kinds of isometric and non-isometric array grammars. An advantage is that the number of components is reduced when this permitting feature is used in a cooperating context-free distributed array grammar system. © 2012 Elsevier B.V. All rights reserved.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：