40,439 Hits in 3.4 sec

Clustering model responses in the frequency space for improved simulation‐based flood risk studies: The role of a cluster number

Anna E. Sikorska‐Senoner
2021 Journal of Flood Risk Management  
Hydrologic models are often employed in flood risk studies to simulate possible hydrologic responses.  ...  Based on a small Swiss catchment with 10,000 years of daily pseudo-discharge simulations, it was found that clustering the ensemble of 1000 members into 5-7 groups is optimal to derive reliable flood prediction  ...  The results are presented for one demonstration (median) scenario that for rare floods (with a return period ≥10 years), the simulation ensemble should be clustered into 3-7 clusters, with 3-5 for common  ... 
doi:10.1111/jfr3.12772 fatcat:uhqzxwckw5dwzfkaqw54zjlqdm

Parallelizing Flood Model for Linux Clusters with MPI [chapter]

Viet D. Tran, Ladislav Hluchy, Dave Froehlich, William Castaings
2004 Lecture Notes in Computer Science  
This paper focuses on parallelization process of DaveF, a new two-dimensional depth-averaged flow and sediment transport model that allows breach development and the resulting flood wave to be simulated  ...  For critical situations, e.g. when an advancing flood is simulated in order to predict which areas will be threatened so that necessary prevention measures can be implemented in time, long computation  ...  Simulating river floods is an extremely computation-intensive undertaking. Several days of CPU-time may be needed to simulate floods along large sections of rivers.  ... 
doi:10.1007/978-3-540-24669-5_68 fatcat:nywqoe4hvbha7jqduzellyuiqq

Topological data analysis distinguishes parameter regimes in the Anderson-Chaplain model of angiogenesis

John T. Nardini, Bernadette J. Stolz, Kevin B. Flores, Heather A. Harrington, Helen M. Byrne, Mark Chaplain
2021 PLoS Computational Biology  
TDA is a vibrant and relatively new field of computational mathematics for studying the shape of data.  ...  We compute topological and standard descriptors of model simulations generated by different parameter values.  ...  The topological descriptor vectors that we compute for each model simulation are β i (K v ), PIO i (K v ), Simulation clustering We use an unsupervised algorithm, k-means clustering, to group the quantitative  ... 
doi:10.1371/journal.pcbi.1009094 pmid:34181657 fatcat:3vueauy5azcrdhv4etxnhkflay

Cluster Computation for Flood Simulations1 [chapter]

Ladislav Hluchy, Giang T. Nguyen, Ladislav Halada, Viet D. Tran
2001 Lecture Notes in Computer Science  
Therefore, the parallel simulation is essential for water flood study with satisfactory accuracy.  ...  Simulation of the water flood problems often leads to solving of large sparse systems of partial differential equations. For such systems, the numerical method is very CPU-time consuming.  ...  The contribution of this paper is to present parallel numerical methods for flood simulations and to study behaviors of a parallel programming models for distributed memory cluster computation [12] ,  ... 
doi:10.1007/3-540-48228-8_43 fatcat:v7slsobodnblfeeizftl2nlvl4

Scalable AODV with efficient flooding based on on-demand clustering

Yunjung Yi, Mario Gerla
2002 ACM SIGMOBILE Mobile Computing and Communications Review  
We present that AODV with passive clustering performs better and is scalable with increasing offered load compared with AODV without passive clustering.  ...  For simulation, we increase the offered load using the number of CBR (Constant Bit Rate) sessions from 10 to 50.  ...  Each simulation runs for 600 seconds (10 minutes). The results are averaged over 20 randomly generated node topologies. N ≥ 20) .  ... 
doi:10.1145/581291.581308 fatcat:dlzwkg6kznd5lh4plbi2inllva

Downsizing parameter ensembles for simulations of rare floods

Anna E. Sikorska-Senoner, Bettina Schaefli, Jan Seibert
2020 Natural Hazards and Earth System Sciences  
Here, we propose three methods for reducing the computational requirements for the hydrological simulations for extreme-flood estimation so that long streamflow time series can be analysed at a reduced  ...  Our results demonstrate the reliability of the proposed downsizing methods for robust simulations of rare floods with uncertainty.  ...  The ScienceCloud provided by S3IT at the University of Zurich enabled the computation-intensive simulations to be run on virtual machines.  ... 
doi:10.5194/nhess-20-3521-2020 fatcat:maree4z5dzb6pctrymud7eb3gu

Computer Real-Time Location Forensics Method for Network Intrusion Crimes

Yingsu Qi
2019 International Journal of Network Security  
The results demonstrated that the improved algorithm is more suitable for detecting the first kind of characteristic data; and compared with the traditional clustering algorithm, under the three flood  ...  In this study, the improved K-means clustering algorithm was adopted to obtain computer real-time evidence of network intrusion crimes.  ...  It can be seen that the improved clustering algorithm has better detection performance for ICMP flood attack mode.  ... 
dblp:journals/ijnsec/Qi19 fatcat:k4ybhkoar5ccfd76xv4pmtvdbe

Parallel Flood Modeling Systems [chapter]

L. Hluchy, V. D. Tran, J. Astalos, M. Dobrucky, G. T. Nguyen, D. Froehlich
2002 Lecture Notes in Computer Science  
In this paper, the architecture and results of the ANFAS (Data Fusion for Flood Analysis and Decision Support) project is presented.  ...  This paper also focuses on the parallel numerical solutions of flood modeling module that are the most computational-intensive part of the whole ANFAS architecture.  ...  Therefore, using HPCN platforms to reduce the computational time of flood simulation is imperative [4] [12] .  ... 
doi:10.1007/3-540-46043-8_55 fatcat:crjwuppp7zadrcjzi42y7fqc74

Sensor Networks + Grid Computing = A New Challenge for the Grid?

Geoff Coulson, Dean Kuo, John Brooke
2006 IEEE Distributed Systems Online  
sensor network that feeds real-time sensor data (for example, on water depth, spread, and flow rates) to a computationally intensive flood-prediction algorithm running on a general-purpose computational  ...  An interesting technical aspect of this system is that it supports selectively and dynamically assigning computation tasks to either the sensor network itself or the remote cluster.  ...  sensor network that feeds real-time sensor data (for example, on water depth, spread, and flow rates) to a computationally intensive flood-prediction algorithm running on a general-purpose computational  ... 
doi:10.1109/mdso.2006.72 fatcat:45vgmki6lrcy5jbdmhw6e7affm

Improving Probabilistic Flooding Using Topological Indexes

Dawit Kifle, Gabriele Gianini, Mulugeta Libsie
2019 2019 15th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)  
The algorithm pays a price in terms of computation time for discovering the clustering coefficient, however reduces unnecessary and redundant control messages and achieves a significant improvements in  ...  We compare by simulation the performance of this algorithm with the one of the most representative competing algorithms.  ...  We show that, although the algorithm pays a price in terms of computation time for discovering the clustering coefficient, it reduces unnecessary and redundant control messages and achieves a significant  ... 
doi:10.1109/sitis.2019.00067 dblp:conf/sitis/KifleGL19 fatcat:pp7jmnvmubbwdoaxt3toldymky

Run Watchers: Automatic Simulation-Based Decision Support in Flood Management

Artem Konev, Jurgen Waser, Bernhard Sadransky, Daniel Cornel, Rui A.P. Perdigao, Zsolt Horvath, M. Eduard Groller
2014 IEEE Transactions on Visualization and Computer Graphics  
Abstract-In this paper, we introduce a simulation-based approach to design protection plans for flood events.  ...  Based on flood simulations, Run Watchers automatically compute whether a response plan exists that protects the important infrastructure and, possibly, other buildings.  ...  To compute the initial perimeter, Run Watchers initiate a first, single simulation of the breach event with no barriers placed. The flood is simulated for the specified event duration.  ... 
doi:10.1109/tvcg.2014.2346930 pmid:26356901 fatcat:j75jwt25kbcw5ka63ecs7lrtyy

Evaluation of the Power Consumption of Routing Protocols for Wireless Sensor Networks

G. Santhosh Kumar, Lino Abraham Varghese, Jose Mathew K, K. Poulose Jacob
2006 2006 International Symposium on Ad Hoc and Ubiquitous Computing  
implosion problem experienced by Flooding as only one copy Sensor networks are one of the fastest growing areas in broad of a packet is in transit at any one time.  ...  Energy saving is one certain level it will increase the depth to discourage trafiE of the critical issue for sensor networks since most sensors through it are equipped with non-rechargeable batteries that  ...  Cluster head nodes allocate each work, four routing protocols for wireless sensor networks viz. Flooding, Gossiping, GBR and LEACH have been simulated lefndthtcncstoiatmelttoomuct.  ... 
doi:10.1109/isahuc.2006.4290675 fatcat:vmpy3o5uqvbrpjwzb3gae2ho6q

Secured Clustered Internet of Things Wireless Sensor Network

Prabhjot Kaur, Rupinder Singh, Rachhpal Singh
2022 International journal of computer science and mobile computing  
This work employs AS-LEACH (Abundant Secure LEACH) as an extension to the LEACH protocol to protect cluster heads from Hello flood attacks.  ...  WSN employs Low Energy Adaptive Clustering Hierarchy (LEACH) to create an energy-efficacious network that is vulnerable to a wide range of assaults, including the HELLO flood.  ...  SIMULATION RESULTS The simulation results for the AS-LEACH protocol are presented in this section of the paper to illustrate the effectiveness of the proposed work.  ... 
doi:10.47760/ijcsmc.2022.v11i06.003 fatcat:e22oido43vcezindeeha24s65y

An Optimized Ant Colony Algorithm to Reduce the Impact of Flooding using Clustering in Ad Hoc Network

Rajdeep SinghChauhan, Jasbir Singh Saini, Harwinder Singh Sohal
2013 International Journal of Computer Applications  
So rather then using the flooding technique for all the neighbor nodes, the flooding is used only among the clusters which reduces the network congestion and results in the increase of throughput & decrease  ...  Whenever the topology in adhoc network changes the node has to perform the flooding technique to get the shortest path for neighborhood nodes.  ...  the flooding is performed in the clusters only.  ... 
doi:10.5120/14581-2810 fatcat:h3xfcbqa35hyxoodhw33qiiaha

Design and Simulation of a Blacklisting Technique for Detection of Hello flood Attack on LEACH Protocol

Madhura Mahajan, K.T.V. Reddy, Manita Rajput
2016 Procedia Computer Science  
The Hello flood attack is explained and a novel algorithm for defense against Hello flood attack is proposed and simulated using Matlab. .  ...  Wireless sensor networks consist of number of small, low power nodes with limited computational capabilities.  ...  Simulations and results Assumptions: All nodes have complete knowledge of their location. Matlab (version 7.8) simulator has been used for simulation purpose.  ... 
doi:10.1016/j.procs.2016.03.086 fatcat:5cjmcdp7nnegjk6y6lomc7waza
« Previous Showing results 1 — 15 out of 40,439 results