Search results for " computing"

A Battery-free Asset Monitoring System based on RF Wireless Power Transfer

2020

In the Internet of Things (IoT) era, asset monitoring represents an appealing implementation of Wireless Sensor Networks due to the enormous benefits associated with being able to monitor and record the exact position and transportation conditions of assets, personal objects, and the like. This kind of infrastructure enables the provision of increasingly advanced services, including the ability to measure the movement speed of a monitored asset using relatively inexpensive nodes with sensing capabilities and wireless transmission and reception. These nodes would ideally employ battery-free sensors that do not require any maintenance, but conventional power supply management systems cannot s…

Improved heuristics for the regenerator location problem

2014

Telecommunication systems use optical signals to transmit information. The strength of a signal in an optical network deteriorates and loses power as it goes farther from the source, mainly due to attenuation. Therefore, to enable the signal to arrive its intended destination with good quality, it is necessary to regenerate the signal periodically using regenerators. These components are relatively expensive and therefore it is desirable to deploy as few of them as possible in the network. In the regenerator location problem (RLP), we are given an undirected graph, positive edge lengths, and a parameter specifying the maximum length that a signal can travel before its quality deteriorates a…

On solving separable block tridiagonal linear systems using a GPU implementation of radix-4 PSCR method

2018

Partial solution variant of the cyclic reduction (PSCR) method is a direct solver that can be applied to certain types of separable block tridiagonal linear systems. Such linear systems arise, e.g., from the Poisson and the Helmholtz equations discretized with bilinear finite-elements. Furthermore, the separability of the linear system entails that the discretization domain has to be rectangular and the discretization mesh orthogonal. A generalized graphics processing unit (GPU) implementation of the PSCR method is presented. The numerical results indicate up to 24-fold speedups when compared to an equivalent CPU implementation that utilizes a single CPU core. Attained floating point perfor…

Fast Poisson solvers for graphics processing units

2013

Two block cyclic reduction linear system solvers are considered and implemented using the OpenCL framework. The topics of interest include a simplified scalar cyclic reduction tridiagonal system solver and the impact of increasing the radix-number of the algorithm. Both implementations are tested for the Poisson problem in two and three dimensions, using a Nvidia GTX 580 series GPU and double precision floating-point arithmetic. The numerical results indicate up to 6-fold speed increase in the case of the two-dimensional problems and up to 3- fold speed increase in the case of the three-dimensional problems when compared to equivalent CPU implementations run on a Intel Core i7 quad-core CPU…

Vertical grid refinement for stratocumulus clouds in the radiation scheme of a global climate model

2021

Abstract. In this study, we implement a vertical grid refinement scheme in the radiation routine of the global aerosol-climate model ECHAM-HAM, aiming to improve the representation of stratocumulus clouds and address the underestimation of their cloud cover. The scheme is based on a reconstruction of the temperature inversion as a physical constraint for the cloud top. On the refined grid, the boundary layer and the free troposphere are separated and the cloud's layer is made thinner. The cloud cover is re-calculated either by conserving the cloud volume (SC-VOLUME) or by using the Sundqvist cloud cover routine on the new grid representation (SC-SUND). In global climate simulations, we find…

2021

Abstract. In this study, we implement a vertical grid refinement scheme in the radiation routine of the global aerosol–climate model ECHAM-HAM, aiming to improve the representation of stratocumulus clouds and address the underestimation of their cloud cover. The scheme is based on a reconstruction of the temperature inversion as a physical constraint for the cloud top. On the refined grid, the boundary layer and the free troposphere are separated and the cloud's layer is made thinner. The cloud cover is recalculated either by conserving the cloud volume (SC-VOLUME) or by using the Sundqvist cloud cover routine on the new grid representation (SC-SUND). In global climate simulations, we find …

Effects of model configuration for superparametrised long-term simulations – Implementation of a cloud resolving model in EMAC (v2.50)

2019

Abstract. A new module has been implemented in the ECHAM5/MESSy Atmospheric Chemistry (EMAC) Model that simulates cloud related processes on a much smaller grid. This so called superparametrisation acts as a replacement for the convection parametrisation and large-scale cloud scheme. The concept of embedding an ensemble of cloud resolving models (CRMs) inside of each grid box of a general circulation model leads to an explicit representation of cloud dynamics. The new model component is evaluated against observations and the conventional usage of EMAC using a convection parametrisation. In particular, effects of applying different configurations of the superparametrisation are analyzed in a…

Trust-enhanced data integrity model

2012

In this paper we propose an enhancement of data integrity model. The proposed model is based on the idea of Biba integrity model but uses more elaborated integrity measurements. Since integrity can be seen as “trustworthiness of data and resources”, we propose to utilize trustworthiness opinions from subjective logic and express levels of integrity as levels of trustworthiness.

Logic, Computing and Biology

2015

Logic and Computing are appropriate formal languages for Biology, and we may well be surprised by the strong analogy between software and DNA, and between hardware and the protein machinery of the cell. This chapter examines to what extent any biological entity can be described by an algorithm and, therefore, whether the Turing machine and the halting problem concepts apply. Last of all, I introduce the concepts of recursion and algorithmic complexity, both from the field of computer science, which can help us understand and conceptualise biological complexity.

Rational design and modelling of f-block molecular nanomagnets

2016

Los imanes monomoleculares o moléculas imán, por sus siglas en inglés SMMs, han suscitado una gran atención en los últimos años debido a sus extraordinarias propiedades físicas. Los cristales de este tipo de moléculas se caracterizan por presentar relajación lenta de la magnetización a baja temperatura, así como curvas de histeresis magnética. Estas moléculas se encuentran entre las entidades con comportamiento magnético más complejas, mostrando fenómenos cuánticos tales como efecto túnel en la magnetización, coherencia cuántica o interferencia cuántica. Por esto, se han postulado como candidatos prometedores para el diseño de bits cuánticos (qubits) de espín en computación cuántica. La pri…