Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
164,266
result(s) for
"Travis, S"
Sort by:
Remote Sensing Methods for Flood Prediction: A Review
Floods are a major cause of loss of lives, destruction of infrastructure, and massive damage to a country’s economy. Floods, being natural disasters, cannot be prevented completely; therefore, precautionary measures must be taken by the government, concerned organizations such as the United Nations Office for Disaster Risk Reduction and Office for the coordination of Human Affairs, and the community to control its disastrous effects. To minimize hazards and to provide an emergency response at the time of natural calamity, various measures must be taken by the disaster management authorities before the flood incident. This involves the use of the latest cutting-edge technologies which predict the occurrence of disaster as early as possible such that proper response strategies can be adopted before the disaster. Floods are uncertain depending on several climatic and environmental factors, and therefore are difficult to predict. Hence, improvement in the adoption of the latest technology to move towards automated disaster prediction and forecasting is a must. This study reviews the adoption of remote sensing methods for predicting floods and thus focuses on the pre-disaster phase of the disaster management process for the past 20 years. A classification framework is presented which classifies the remote sensing technologies being used for flood prediction into three types, which are: multispectral, radar, and light detection and ranging (LIDAR). Further categorization is performed based on the method used for data analysis. The technologies are examined based on their relevance to flood prediction, flood risk assessment, and hazard analysis. Some gaps and limitations present in each of the reviewed technologies have been identified. A flood prediction and extent mapping model are then proposed to overcome the current gaps. The compiled results demonstrate the state of each technology’s practice and usage in flood prediction.
Journal Article
Bringers of hell
\"The war with the alien Chiata comes to a head as humanity prepares to take a stand against the advancing horde. Despite unprecedented victories on the part of humanity, the war with the alien Chiata Horde drags on. The Chiata may be bewildered by the cunning tenacity of General Alexander Moore and the men and women who fight at his side, but they have no intention of beating a hasty retreat. In fact, intelligence suggests that the Chiata Invasion is at hand, and with numbers sure to overwhelm humankind. But hope has come from an unlikely source: the Thgreet, long-dead inhabitants of a world ground under the heels of the Chiata millennia ago. In the crumbled ruins of their homeworld is a map--and it may lead to victory. Meanwhile, Alexander Moore's daughter, Deanna Moore, now known by the callsign \"Phoenix,\" wages a personal war on the Chiata. Grievously wounded in the battle for Thgreet and rebuilt with state-of-the-art cybernetics, she leads a group of mecha-suited Marines known as \"The Bringers of Hell.\" Once a tough-as-nails Marine, she has been reborn as an implacable scourge to the Chiata. And nothing will stand in the way of her mission: to make the aliens pay.\"-- Provided by publisher.
Book
Application of Quantum Annealing to Nurse Scheduling Problem
Quantum annealing is a promising heuristic method to solve combinatorial optimization problems, and efforts to quantify performance on real-world problems provide insights into how this approach may be best used in practice. We investigate the empirical performance of quantum annealing to solve the Nurse Scheduling Problem (NSP) with hard constraints using the D-Wave 2000Q quantum annealing device. NSP seeks the optimal assignment for a set of nurses to shifts under an accompanying set of constraints on schedule and personnel. After reducing NSP to a novel Ising-type Hamiltonian, we evaluate the solution quality obtained from the D-Wave 2000Q against the constraint requirements as well as the diversity of solutions. For the test problems explored here, our results indicate that quantum annealing recovers satisfying solutions for NSP and suggests the heuristic method is potentially achievable for practical use. Moreover, we observe that solution quality can be greatly improved through the use of reverse annealing, in which it is possible to refine returned results by using the annealing process a second time. We compare the performance of NSP using both forward and reverse annealing methods and describe how this approach might be used in practice.
Journal Article
Magnetic Evolution and the Disappearance of Sun-Like Activity Cycles
After decades of effort, the solar activity cycle is exceptionally well characterized, but it remains poorly understood. Pioneering work at the Mount Wilson Observatory demonstrated that other Sun-like stars also show regular activity cycles, and suggested two possible relationships between the rotation rate and the length of the cycle. Neither of these relationships correctly describes the properties of the Sun, a peculiarity that demands explanation. Recent discoveries have started to shed light on this issue, suggesting that the Sun’s rotation rate and magnetic field are currently in a transitional phase that occurs in all middle-aged stars. Motivated by these developments, we identify the manifestation of this magnetic transition in the best available data on stellar cycles. We propose a reinterpretation of previously published observations to suggest that the solar cycle may be growing longer on stellar evolutionary timescales, and that the cycle might disappear sometime in the next 0.8 – 2.4 Gyr. Future tests of this hypothesis will come from ground-based activity monitoring of
Kepler
targets that span the magnetic transition, and from asteroseismology with the
Transiting Exoplanet Survey Satellite
(TESS) mission to determine precise masses and ages for bright stars with known cycles.
Journal Article
Moon tracks
\"Barbara Winton and the rest of the Bright Sparks, Dr. Keegan Bright's team of young scientists, find themselves facing a challenge that will test all of their scientific skills and personal courage. They are competing in the first ever race to completely circle the Moon. The Sparks, and twenty-five other teams, have to count on one another as they face thousands of kilometers of unknown dangers, where even a simple accident can have fatal consequences. They form close friendships with racers from all over Earth, but also have to deal with former Spark, Pam, a mysterious and threatening figure whose departure from the Sparks program is shrouded in mystery\"-- Provided by publisher.
Book
A simple contagion process describes spreading of traffic jams in urban networks
The spread of traffic jams in urban networks has long been viewed as a complex spatio-temporal phenomenon that often requires computationally intensive microscopic models for analysis purposes. In this study, we present a framework to describe the dynamics of congestion propagation and dissipation of traffic in cities using a simple contagion process, inspired by those used to model infectious disease spread in a population. We introduce two macroscopic characteristics for network traffic dynamics, namely congestion propagation rate
β
and congestion dissipation rate
μ
. We describe the dynamics of congestion spread using these new parameters embedded within a system of ordinary differential equations, similar to the well-known susceptible-infected-recovered (SIR) model. The proposed contagion-based dynamics are verified through an empirical multi-city analysis, and can be used to monitor, predict and control the fraction of congested links in the network over time.
Predicting and controlling traffic congestion propagation is an ongoing challenge in most urban settings. Here, Seberi et al. apply a contagion model describing epidemic spread in population to model traffic jams, and verify its validity using large-scale data from six different cities around the world.
Journal Article
Batman by Grant Morrison omnibus
\"One of the greatest storytellers of his generation, Grant Morrison's arrival onto the Dark Knight was one of the most hyped debuts in industry history. This collection includes time-spanning epic graphic novels featuring the cataclysmic events of FINAL CRISIS and the introduction of Batman's son, Damian Wayne! These blockbuster stories featured a deconstruction of super hero comics like never before, with challenging, thought-provoking takes on the modern, four-color icons.\"-- Provided by publisher.
Book
Multi-angle quantum approximate optimization algorithm
The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution. In theory, the approximation improves with increasing ansatz depth but gate noise and circuit complexity undermine performance in practice. Here, we investigate a multi-angle ansatz for QAOA that reduces circuit depth and improves the approximation ratio by increasing the number of classical parameters. Even though the number of parameters increases, our results indicate that good parameters can be found in polynomial time for a test dataset we consider. This new ansatz gives a 33% increase in the approximation ratio for an infinite family of MaxCut instances over QAOA. The optimal performance is lower bounded by the conventional ansatz, and we present empirical results for graphs on eight vertices that one layer of the multi-angle anstaz is comparable to three layers of the traditional ansatz on MaxCut problems. Similarly, multi-angle QAOA yields a higher approximation ratio than QAOA at the same depth on a collection of MaxCut instances on fifty and one-hundred vertex graphs. Many of the optimized parameters are found to be zero, so their associated gates can be removed from the circuit, further decreasing the circuit depth. These results indicate that multi-angle QAOA requires shallower circuits to solve problems than QAOA, making it more viable for near-term intermediate-scale quantum devices.
Journal Article