Search results for "Computation"

On the application of the generalized means to construct multiresolution schemes satisfying certain inequalities proving stability

2021

Multiresolution representations of data are known to be powerful tools in data analysis and processing, and they are particularly interesting for data compression. In order to obtain a proper definition of the edges, a good option is to use nonlinear reconstructions. These nonlinear reconstruction are the heart of the prediction processes which appear in the definition of the nonlinear subdivision and multiresolution schemes. We define and study some nonlinear reconstructions based on the use of nonlinear means, more in concrete the so-called Generalized means. These means have two interesting properties that will allow us to get associated reconstruction operators adapted to the presence o…

tbg - a new file format for genomic data

2021

AbstractMotivationThe question of determining whether a Single-Nucleotide Polymorphism (SNP) or a variant in general leads to a change in the amino acid sequence of a protein coding gene is often a laborious and time-consuming challenge. Here, we introduce the tbg file format for storing genomic data and tbg-tools, a user-friendly toolbox for the faster analysis of SNPs. The file format stores information for each nucleotide in each gene, allowing to predict which change in the amino acid sequence will be caused by a variant in the nucleotide sequence. Our new tool therefore has the potential to make biological sense of the unprecedented amount of genome-wide genetic variation that research…

Erratum to: Scatter Search – Methodology and Implementations in C

2018

Boolean Networks: A Primer

2021

Abstract Autism Spectrum Disorders (ASDs) stand out as a relevant example where omics-data approaches have been extensively and successfully employed. For instance, an outstanding outcome of the Autism Genome Project relies in the identification of biomarkers and the mapping of biological processes potentially implicated in ASDs’ pathogenesis. Several of these mapped processes are related to molecular and cellular events (e.g., synaptogenesis and synapse function, axon growth and guidance, etc.) that are required for the development of a correct neuronal connectivity. Interestingly, these data are consistent with results of brain imaging studies of some patients. Despite these remarkable pr…

Transformations that preserve learnability

1996

We consider transformations (performed by general recursive operators) mapping recursive functions into recursive functions. These transformations can be considered as mapping sets of recursive functions into sets of recursive functions. A transformation is said to be preserving the identification type I, if the transformation always maps I-identifiable sets into I-identifiable sets.

A hybrid virtual–boundary element formulation for heterogeneous materials

2021

Abstract In this work, a hybrid formulation based on the conjoined use of the recently developed Virtual Element Method (VEM) and the Boundary Element Method (BEM) is proposed for the effective computational analysis of multi-region domains, representative of heterogeneous materials. VEM has been recently developed as a generalisation of the Finite Element Method (FEM) and it allows the straightforward employment of elements of general polygonal shape, maintaining a high level of accuracy. For its inherent features, it allows the use of meshes of general topology, including non-convex elements. On the other hand, BEM is an effective technique for the numerical solution of sets of boundary i…

Distributed Particle Metropolis-Hastings Schemes

2018

We introduce a Particle Metropolis-Hastings algorithm driven by several parallel particle filters. The communication with the central node requires the transmission of only a set of weighted samples, one per filter. Furthermore, the marginal version of the previous scheme, called Distributed Particle Marginal Metropolis-Hastings (DPMMH) method, is also presented. DPMMH can be used for making inference on both a dynamical and static variable of interest. The ergodicity is guaranteed, and numerical simulations show the advantages of the novel schemes.

CLUSTER MONTE CARLO ALGORITHMS IN STATISTICAL MECHANICS

1992

The cluster Monte Carlo method, where variables are updated in groups, is very efficient at second order phase transitions. Much better results can be obtained with less computer time. This article reviews the method of Swendsen and Wang and some of its applications.

Additive noise and multiplicative bias as disclosure limitation techniques for continuous microdata: A simulation study

2004

This paper focuses on a combination of two disclosure limitation techniques, additive noise and multiplicative bias, and studies their efficacy in protecting confidentiality of continuous microdata. A Bayesian intruder model is extensively simulated in order to assess the performance of these disclosure limitation techniques as a function of key parameters like the variability amongst profiles in the original data, the amount of users prior information, the amount of bias and noise introduced in the data. The results of the simulation offer insight into the degree of vulnerability of data on continuous random variables and suggests some guidelines for effective protection measures.

Decentralized Subspace Projection for Asymmetric Sensor Networks

2020

A large number of applications in Wireless Sensor Networks include projecting a vector of noisy observations onto a subspace dictated by prior information about the field being monitored. In general, accomplishing such a task in a centralized fashion, entails a large power consumption, congestion at certain nodes and suffers from robustness issues against possible node failures. Computing such projections in a decentralized fashion is an alternative solution that solves these issues. Recent works have shown that this task can be done via the so-called graph filters where only local inter-node communication is performed in a distributed manner using a graph shift operator. Most of the existi…