Search results for "Computational Mathematic"
showing 10 items of 987 documents
Experimental modeling for a natural landing of fuzzy sets in new domains
2015
In this paper we plan to touch upon (and briefly discuss) some (out of the many) contributions done by Enric Trillas to Fuzzy Sets Theory. We have carefully chosen, from the abundant panorama we have been allowed to gaze at in the years, two different but intertwined topics of a more methodological character, which—as such—are, obviously, not only outside the topics massively developed by the scientific community in this field but also not in the mainstream of Enric’s investigations. We picked up them, however, since we believe that they are related to a crucial problem for the further developments of fuzzy research in the subsequent years. In this perspective, they represent a very signifi…
Zero viscosity limit of the Oseen equations in a channel
2001
Oseen equations in the channel are considered. We give an explicit solution formula in terms of the inverse heat operators and of projection operators. This solution formula is used for the analysis of the behavior of the Oseen equations in the zero viscosity limit. We prove that the solution of Oseen equations converges in W1,2 to the solution of the linearized Euler equations outside the boundary layer and to the solution of the linearized Prandtl equations inside the boundary layer. © 2001 Society for Industrial and Applied Mathematics.
Network-Based Computational Techniques to Determine the Risk Drivers of Bank Failures During a Systemic Banking Crisis
2018
This paper employs a computational model of solvency and liquidity contagion assessing the vulnerability of banks to systemic risk. We find that the main risk drivers relate to the financial connections a bank has and the market concentration, apart from the size of the bank triggering the contagion, while balance sheets play only a minor role. We also find that market concentration might facilitate banks to withstand liquidity shocks better while exposing them to larger solvency chocks. Our results are validated through an out-of-sample forecasting that shows that both type I and type II prediction errors are reduced if we include network characteristics in our prediction model.
Cumulative-Sum-Based Localization of Sound Events in Low-Cost Wireless Acoustic Sensor Networks
2014
Wireless acoustic sensor networks (WASNs) are known for their potential applications in multiple areas, such as audio-based surveillance, binaural hearing aids or advanced acoustic monitoring. The knowledge of the spatial position of a source of interest is usually a requirement for many of these applications. Therefore, source localization is an important problem to be addressed in WASNs. Unfortunately, most localization algorithms need costly signal processing stages that prevent them from being implemented in low-cost sensor networks, requiring additional modules for signal acquisition and processing. This paper presents a low-complexity method for acoustic event detection and localizati…
First Experiences on an Accurate SPH Method on GPUs
2017
It is well known that the standard formulation of the Smoothed Particle Hydrodynamics is usually poor when scattered data distribution is considered or when the approximation near the boundary occurs. Moreover, the method is computational demanding when a high number of data sites and evaluation points are employed. In this paper an enhanced version of the method is proposed improving the accuracy and the efficiency by using a HPC environment. Our implementation exploits the processing power of GPUs for the basic computational kernel resolution. The performance gain demonstrates the method to be accurate and suitable to deal with large sets of data.
Performance potential for simulating spin models on GPU
2012
Graphics processing units (GPUs) are recently being used to an increasing degree for general computational purposes. This development is motivated by their theoretical peak performance, which significantly exceeds that of broadly available CPUs. For practical purposes, however, it is far from clear how much of this theoretical performance can be realized in actual scientific applications. As is discussed here for the case of studying classical spin models of statistical mechanics by Monte Carlo simulations, only an explicit tailoring of the involved algorithms to the specific architecture under consideration allows to harvest the computational power of GPU systems. A number of examples, ran…
Strengthened splitting methods for computing resolvents
2021
In this work, we develop a systematic framework for computing the resolvent of the sum of two or more monotone operators which only activates each operator in the sum individually. The key tool in the development of this framework is the notion of the “strengthening” of a set-valued operator, which can be viewed as a type of regularisation that preserves computational tractability. After deriving a number of iterative schemes through this framework, we demonstrate their application to best approximation problems, image denoising and elliptic PDEs. FJAA and RC were partially supported by the Ministry of Science, Innovation and Universities of Spain and the European Regional Development Fund …
Separatrix reconstruction to identify tipping points in an eco-epidemiological model
2018
Many ecological systems exhibit tipping points such that they suddenly shift from one state to another. These shifts can be devastating from an ecological point of view, and additionally have severe implications for the socio-economic system. They can be caused by overcritical perturbations of the state variables such as external shocks, disease emergence, or species removal. It is therefore important to be able to quantify the tipping points. Here we present a study of the tipping points by considering the basins of attraction of the stable equilibrium points. We address the question of finding the tipping points that lie on the separatrix surface, which partitions the space of system traj…
Traitpedia: a collaborative effort to gather species traits
2018
Abstract Summary Traitpedia is a collaborative database aimed to collect binary traits in a tabular form for a growing number of species. Availability and implementation Traitpedia can be accessed from http://cbdm-01.zdv.uni-mainz.de/~munoz/traitpedia. Supplementary information Supplementary data are available at Bioinformatics online.
BGSA: a bit-parallel global sequence alignment toolkit for multi-core and many-core architectures
2018
Abstract Motivation Modern bioinformatics tools for analyzing large-scale NGS datasets often need to include fast implementations of core sequence alignment algorithms in order to achieve reasonable execution times. We address this need by presenting the BGSA toolkit for optimized implementations of popular bit-parallel global pairwise alignment algorithms on modern microprocessors. Results BGSA outperforms Edlib, SeqAn and BitPAl for pairwise edit distance computations and Parasail, SeqAn and BitPAl when using more general scoring schemes for pairwise alignments of a batch of sequence reads on both standard multi-core CPUs and Xeon Phi many-core CPUs. Furthermore, banded edit distance perf…