Hyperbolic Embedding for Efficient Computation of Path Centralities and Adaptive Routing in Large-Scale Complex Commodity Networks

2017 ◽  
Vol 4 (3) ◽  
pp. 140-153 ◽  
Author(s):  
Eleni Stai ◽  
Konstantinos Sotiropoulos ◽  
Vasileios Karyotis ◽  
Symeon Papavassiliou
2016 ◽  
Author(s):  
Janek Meyer ◽  
Hannes Renzsch ◽  
Kai Graf ◽  
Thomas Slawig

While plain vanilla OpenFOAM has strong capabilities with regards to quite a few typical CFD-tasks, some problems actually require additional bespoke solvers and numerics for efficient computation of high-quality results. One of the fields requiring these additions is the computation of large-scale free-surface flows as found e.g. in naval architecture. This holds especially for the flow around typical modern yacht hulls, often planing, sometimes with surface-piercing appendages. Particular challenges include, but are not limited to, breaking waves, sharpness of interface, numerical ventilation (aka streaking) and a wide range of flow phenomenon scales. A new OF-based application including newly implemented discretization schemes, gradient computation and rigid body motion computation is described. In the following the new code will be validated against published experimental data; the effect on accuracy, computational time and solver stability will be shown by comparison to standard OF-solvers (interFoam / interDyMFoam) and Star CCM+. The code’s capabilities to simulate complex “real-world” flows are shown on a well-known racing yacht design.


Author(s):  
Youcef Touati ◽  
Arab Ali-Chérif ◽  
Boubaker Daachi
Keyword(s):  

2010 ◽  
Vol 2 (2) ◽  
pp. 53-63 ◽  
Author(s):  
Amitabha Chakrabarty ◽  
Martin Collier ◽  
Sourav Mukhopadhyay

This paper proposes an adaptive unicast routing algorithm for large scale symmetric networks comprising 2 × 2 switch elements such as Bene?s networks. This algorithm trades off the probability of blocking against algorithm execution time. Deterministic algorithms exploit the rearrangeability property of Bene?s networks to ensure a zero blocking probability for unicast connections, at the expense of extensive computation. The authors’ algorithm makes its routing decisions depending on the status of each switching element at every stage of the network, hence the name adaptive routing. This method provides a low complexity solution, but with much better blocking performance than random routing algorithms. This paper presents simulation results for various input loads, demonstrating the tradeoffs involved.


Author(s):  
Venkata Ramana Sarella ◽  
Deshai Nakka ◽  
Sekhar B. V. D. S. ◽  
Krishna Rao Sala ◽  
Sameer Chakravarthy V. V. S. S.

Designing various energy-saving routing protocols for real-time internet of things (IoT) applications in modern secure wireless sensor networks (MS-WSN) is a tough task. Many hierarchical protocols for WSNs were not well scalable to large-scale IoT applications. Low energy adaptive two-level-CH clustering hierarchy (LEATCH) is an optimized technique reduces the energy-utilization of few cluster heads, but the LEATCH is not suitable for scalable and dynamic routing. For dynamic routing in MS-WSN, energy efficiency and event clustering adaptive routing protocol (EEECARP) with event-based dynamic clustering and relay communication by selecting intermediates nodes as relay-nodes is necessary. However, EEECARP cannot consider the hop-count, different magnitude ecological conditions, and energy wastage in cluster formation while collisions occur. So, the authors propose the modified EEECARP to address these issues for better dynamic event clustering adaptive routing to improve the lifetime of MS-WSNs. The experimental outcomes show that proposed protocol achieves better results than EEECARP and LEATCH.


2019 ◽  
Vol 293 (1) ◽  
pp. 123-140
Author(s):  
Marco Gribaudo ◽  
Illés Horváth ◽  
Daniele Manini ◽  
Miklós Telek

Abstract The performance of service units may depend on various randomly changing environmental effects. It is quite often the case that these effects vary on different timescales. In this paper, we consider small and large scale (short and long term) service variability, where the short term variability affects the instantaneous service speed of the service unit and a modulating background Markov chain characterizes the long term effect. The main modelling challenge in this work is that the considered small and long term variation results in randomness along different axes: short term variability along the time axis and long term variability along the work axis. We present a simulation approach and an explicit analytic formula for the service time distribution in the double transform domain that allows for the efficient computation of service time moments. Finally, we compare the simulation results with analytic ones.


2020 ◽  
Vol 2020 ◽  
pp. 1-13 ◽  
Author(s):  
Jordan Ott ◽  
Mike Pritchard ◽  
Natalie Best ◽  
Erik Linstead ◽  
Milan Curcic ◽  
...  

Implementing artificial neural networks is commonly achieved via high-level programming languages such as Python and easy-to-use deep learning libraries such as Keras. These software libraries come preloaded with a variety of network architectures, provide autodifferentiation, and support GPUs for fast and efficient computation. As a result, a deep learning practitioner will favor training a neural network model in Python, where these tools are readily available. However, many large-scale scientific computation projects are written in Fortran, making it difficult to integrate with modern deep learning methods. To alleviate this problem, we introduce a software library, the Fortran-Keras Bridge (FKB). This two-way bridge connects environments where deep learning resources are plentiful with those where they are scarce. The paper describes several unique features offered by FKB, such as customizable layers, loss functions, and network ensembles. The paper concludes with a case study that applies FKB to address open questions about the robustness of an experimental approach to global climate simulation, in which subgrid physics are outsourced to deep neural network emulators. In this context, FKB enables a hyperparameter search of one hundred plus candidate models of subgrid cloud and radiation physics, initially implemented in Keras, to be transferred and used in Fortran. Such a process allows the model’s emergent behavior to be assessed, i.e., when fit imperfections are coupled to explicit planetary-scale fluid dynamics. The results reveal a previously unrecognized strong relationship between offline validation error and online performance, in which the choice of the optimizer proves unexpectedly critical. This in turn reveals many new neural network architectures that produce considerable improvements in climate model stability including some with reduced error, for an especially challenging training dataset.


Sign in / Sign up

Export Citation Format

Share Document