Realising Global Water Futures: a Summary of Progress in Delivering Solutions to Water Threats in an Era of Global Change

Canada First Research Excellence FundNon-Peer ReviewedOver the past six years the Global Water Futures program has produced a wide range of scientific findings and engagements with multiple types of potential users of the research. This briefing book provides a snapshot of some of the science advancements and user engagement that have taken place to date. Annual reports to the funding agency are the most up to date source of information: this compilation has been created from reports submitted by projects in 2022, representing both completed and current project work. The briefing book aims to provide quick access to information about GWF projects in a single place for GWF’s User Advisory Panel: we hope that knowing more about the research being produced will spark conversations about how to make the best use of the new knowledge in both policy and practice

Florida Undergraduate Research Conference

FURC serves as a multi-disciplinary conference through which undergraduate students from the state of Florida can present their research. February 16-17, 2024https://digitalcommons.unf.edu/university_events/1006/thumbnail.jp

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words

Third International Symposium on Space Mission Operations and Ground Data Systems, part 1

Under the theme of 'Opportunities in Ground Data Systems for High Efficiency Operations of Space Missions,' the SpaceOps '94 symposium included presentations of more than 150 technical papers spanning five topic areas: Mission Management, Operations, Data Management, System Development, and Systems Engineering. The papers focus on improvements in the efficiency, effectiveness, productivity, and quality of data acquisition, ground systems, and mission operations. New technology, techniques, methods, and human systems are discussed. Accomplishments are also reported in the application of information systems to improve data retrieval, reporting, and archiving; the management of human factors; the use of telescience and teleoperations; and the design and implementation of logistics support for mission operations