Results 1 to 10 of about 136,387 (282)

Porting HEP Parameterized Calorimeter Simulation Code to GPUs [PDF]

Frontiers in Big Data, 2021
The High Energy Physics (HEP) experiments, such as those at the Large Hadron Collider (LHC), traditionally consume large amounts of CPU cycles for detector simulations and data analysis, but rarely use compute accelerators such as GPUs.
Zhihua Dong, Heather Gray, Heather Gray, Charles Leggett, Meifeng Lin, Vincent R. Pascuzzi, Kwangmin Yu   +6 more
doaj   +6 more sources

Parameterized Codes over Cycles [PDF]

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2013
In this paper we will compute the main parameters of the parameterized codes arising from cycles. In the case of odd cycles the corresponding codes are the evaluation codes associated to the projective torus and the results are well known. In the case of
González Sarabia Manuel, Nava Lara Joel, Rentería Marquez Carlos, Sarmíento Rosales Eliseo   +3 more
doaj   +2 more sources

Projective parameterized linear codes [PDF]

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015
In this paper we estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We find the length of these codes and we give a formula for the dimension in terms of the Hilbert function associated to two ideals,
González Sarabia Manuel, Rentería Márquez Carlos, Sarmiento Rosales Eliseo   +2 more
doaj   +2 more sources

The minimum distance of parameterized codes on projective tori [PDF]

Applicable Algebra in Engineering, Communication and Computing, 2011
Let X be a subset of a projective space, over a finite field K, which is parameterized by the monomials arising from the edges of a clutter. Let I(X) be the vanishing ideal of X. It is shown that I(X) is a complete intersection if and only if X is a projective torus.
Sarmiento, Eliseo, Vaz Pinto, Maria, Villarreal, Rafael H.   +2 more
openaire   +4 more sources

Codes parameterized by the edges of a bipartite graph with a perfect matching

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023
In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.
Sarabia Manuel González, Villarreal Rafael H.   +1 more
doaj   +4 more sources

The Parameterized Complexity of Domination-type Problems and Application to Linear Codes [PDF]

, 2014
We study the parameterized complexity of domination-type problems. (sigma,rho)-domination is a general and unifying framework introduced by Telle: a set D of vertices of a graph G is (sigma,rho)-dominating if for any v in D, |N(v)\cap D| in sigma and for
D. Cattanéo, G. Galbiati, G. Gutin, H. Moser, J.A. Telle, J.A. Telle, M. Cesati, M. Cesati, M. Cesati, M.M. Halldórsson, M.R. Fellows, P.A. Golovach, R.G. Downey, R.G. Downey, R.G. Downey, S. Gravier   +15 more
core   +5 more sources

Bayesian Smoothing with Gaussian Processes Using Fourier Basis Functions in the spectralGP Package [PDF]

Journal of Statistical Software, 2007
The spectral representation of stationary Gaussian processes via the Fourier basis provides a computationally efficient specification of spatial surfaces and nonparametric regression functions for use in various statistical models.
Christopher J. Paciorek
doaj   +1 more source

No-code method for lithography template cell parameterization for faster design cycles

Micro and Nano Engineering
This work presents a Python-based architecture packaged as a standalone tool, to enable the parameterization of lithography structures without the need for scripting. By feeding a lithography template file obtained from an existing layout editor into the
T.P. Maslin, S. Gutschmidt
doaj   +2 more sources

LLMs augmented hierarchical reinforcement learning with action primitives for long-horizon manipulation tasks [PDF]

Scientific Reports
Deep reinforcement learning methods have shown promising results in learning specific tasks, but struggle to cope with the challenges of long horizon manipulation tasks.
Ning Zhang, Yongjia Zhao, Minghao Yang, Shuling Dai   +3 more
doaj   +2 more sources

SymPKF (v1.0): a symbolic and computational toolbox for the design of parametric Kalman filter dynamics [PDF]

Geoscientific Model Development, 2021
Recent research in data assimilation has led to the introduction of the parametric Kalman filter (PKF): an implementation of the Kalman filter, whereby the covariance matrices are approximated by a parameterized covariance model. In the PKF, the dynamics
O. Pannekoucke, O. Pannekoucke, O. Pannekoucke, P. Arbogast   +3 more
doaj   +1 more source