Search results for "COMPUTATION"
showing 10 items of 7362 documents
Inattention and Uncertainty in the Predictive Brain
2021
Negative effects of inattention on task performance can be seen in many contexts of society and human behavior, such as traffic, work, and sports. In traffic, inattention is one of the most frequently cited causal factors in accidents. In order to identify inattention and mitigate its negative effects, there is a need for quantifying attentional demands of dynamic tasks, with a credible basis in cognitive modeling and neuroscience. Recent developments in cognitive science have led to theories of cognition suggesting that brains are an advanced prediction engine. The function of this prediction engine is to support perception and action by continuously matching incoming sensory input with to…
On the stability of some controlled Markov chains and its applications to stochastic approximation with Markovian dynamic
2015
We develop a practical approach to establish the stability, that is, the recurrence in a given set, of a large class of controlled Markov chains. These processes arise in various areas of applied science and encompass important numerical methods. We show in particular how individual Lyapunov functions and associated drift conditions for the parametrized family of Markov transition probabilities and the parameter update can be combined to form Lyapunov functions for the joint process, leading to the proof of the desired stability property. Of particular interest is the fact that the approach applies even in situations where the two components of the process present a time-scale separation, w…
Coupled conditional backward sampling particle filter
2020
The conditional particle filter (CPF) is a promising algorithm for general hidden Markov model smoothing. Empirical evidence suggests that the variant of CPF with backward sampling (CBPF) performs well even with long time series. Previous theoretical results have not been able to demonstrate the improvement brought by backward sampling, whereas we provide rates showing that CBPF can remain effective with a fixed number of particles independent of the time horizon. Our result is based on analysis of a new coupling of two CBPFs, the coupled conditional backward sampling particle filter (CCBPF). We show that CCBPF has good stability properties in the sense that with fixed number of particles, …
"Table 31" of "Search for photonic signatures of gauge-mediated supersymmetry in 8 TeV $pp$ collisions with the ATLAS detector"
2015
The total NLO cross sections with uncertainties for the electroweak production GGM signal grid for the photon+j analysis.
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
2017
[EN] The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods. If the vehicle gets closer than a certain distance to a meter, the receiver is able to record the gas, water, or electricity consumption. Therefore, the vehicle does not need to traverse every street, but only a few, to get close enough to each meter. We study an extension of this problem in which a fleet of vehicles is available. Given the characteristics of the mentioned application, the vehicles have no capacities but there is a maximum distan…
Pactos de carácter patrimonial en las uniones de hecho: un estudio de la cuestión desde la perspectiva de la experiencia jurídica española
2019
This paper studies the matter of the validity of patrimonial agreements in common-law relationships in Spanish Law
Distributed Clustering Algorithm for Spatial Field Reconstruction in Wireless Sensor Networks
2015
En este trabajo, consideramos el problema de la estimación espacial distribuida para la reconstrucción del campo radio en redes de sensores inalámbricos. Para estimar el campo, se utiliza una técnica geoestadística llamada kriging. La estimación espacial centralizada con un gran número de sensores conllevan un elevado coste computacional y gasto de energía. Presentamos un novedoso algoritmo de clustering distribuido para estimar mapas de interferencia espacial, que son esenciales para las operaciones y la gestión de las futuras redes inalámbricas. En este algoritmo, los clústeres de sensores se forman de forma adaptativa mediante la minimización de la varianza de kriging. El cálculo del sem…
El pensamiento computacional en contextos educativos: una aproximación desde la Tecnología Educativa
2019
El pensamiento computacional ha vivido un resurgir en los últimos años, en los que la comunidad científica y educativa ha puesto su foco de interés sobre él como un aspecto relevante a incorporar de manera curricular. No obstante, la falta de consenso respecto a qué es y cómo trabajarlo tiene como resultado que se aborde de diferentes formas en la educación, lo que repercute directamente en el aprendizaje del alumnado. Desde enfoques más técnicos, que tienen el riesgo de no permitir aprovechar el potencial que tiene de ser integrado en la estrategia didáctica del docente, a enfoques más transversales, que sí profundizan en las posibilidades que tiene en el ámbito de la didáctica, pero que a…
A low complexity distributed cluster based algorithm for spatial prediction
2017
Los mapas del entorno radioeléctrico (REM) pueden ser una herramienta esencial para numerosas aplicaciones en las futuras redes inalámbricas 5G. En este trabajo, empleamos un popular método geoestadístico llamado kriging ordinario para estimar el REM de un área cubierta por un eNodeB equipado con múltiples antenas. Los sensores inalámbricos se distribuyen por el área de interés y se organizan clústeres adaptativos de sensores para mejorar la calidad de la estimación del canal. En este trabajo, modificamos el algoritmo de clustering distribuido propuesto en un trabajo anterior para reducir la complejidad de la predicción de kriging. Se realizan simulaciones para detallar la técnica de formac…
An FPGA aligner for short read mapping
2012
The rapid growth of short read datasets poses a new challenge to the mapping of short reads to a reference genome in terms of sensitivity and execution speed. In this work, we present a parallel architecture for short read mapping utilizing field programmable gate array (FPGA)-based hardware. The computation intensive semi-global alignment and the hash table lookup operations are mapped onto an FPGA. The proposed Align Core is implemented with a parallel block structure to gain computational efficiency. We present a new parallel block-wise alignment structure to approximate the conventional dynamic programming algorithm. The performance of our FPGA aligner is compared to the GASSST and BWA …