Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleFebruary 2024
Recurrence Analysis for Automatic Parallelization of Subscripted Subscripts
PPoPP '24: Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel ProgrammingPages 80–93https://doi.org/10.1145/3627535.3638493Introducing correct and optimal OpenMP parallelization directives in applications is a challenge. To parallelize a loop in an input application code automatically, parallelizing compilers need to disprove dependences with respect to variables across ...
- research-articleFebruary 2024
Computational advantage in evaluating oscillatory integral using quadratic spline
International Journal of Computing Science and Mathematics (IJCSM), Volume 19, Issue 1Pages 28–38https://doi.org/10.1504/ijcsm.2024.136812The quadratic spline is used in the conventional Levin's method to evaluate the oscillatory integral. Generally, the Levin method requires O(n3) computations and can be unstable. Here, the quadratic spline interpolation method requires solving recurrence ...
- research-articleSeptember 2023
Enhancing LLVM Optimizations for Linear Recurrence Programs on RVV
ICPP Workshops '23: Proceedings of the 52nd International Conference on Parallel Processing WorkshopsPages 79–87https://doi.org/10.1145/3605731.3605904The RISC-V Vector Extension (RVV) has emerged as a promising vector architecture for high-performance computing. It enables parallel computing capability for RISC-V CPUs by introducing additional vector instructions and vector registers. To fully ...
- posterMay 2023
Attention-Based Recurrency for Multi-Agent Reinforcement Learning under State Uncertainty
AAMAS '23: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent SystemsPages 2839–2841State uncertainty poses a major challenge for decentralized coordination. However, state uncertainty is largely neglected in multi-agent reinforcement learning research due to a strong focus on state-based centralized training for decentralized execution ...
-
- research-articleJanuary 2023
An ant colony algorithm of recurrent target assignment for a group of control objects
International Journal of Advanced Intelligence Paradigms (IJAIP), Volume 25, Issue 3-4Pages 312–323https://doi.org/10.1504/ijaip.2023.132379In practice, to perform periodic monitoring of a territory under uncertain conditions when the current situation evolves unpredictably is a common problem. In this case, at each cycle, the routes of control objects must take into account the situation at ...
Revealing parallel scans and reductions in recurrences through function reconstruction
PACT '18: Proceedings of the 27th International Conference on Parallel Architectures and Compilation TechniquesArticle No.: 10, Pages 1–13https://doi.org/10.1145/3243176.3243204Many sequential loops are actually recurrences and can be parallelized across iterations as scans or reductions. Many efforts over the past 2+ decades have focused on parallelizing such loops by extracting and exploiting the hidden scan/reduction ...
- research-articleJanuary 2018
Suppression of Recurrence in the Hermite-Spectral Method for Transport Equations
SIAM Journal on Numerical Analysis (SINUM), Volume 56, Issue 5Pages 3144–3168https://doi.org/10.1137/17M1149298We study the unphysical recurrence phenomenon arising in the numerical simulation of the transport equations using the Hermite-spectral method. From a mathematical point of view, the suppression of this numerical artifact with filters is theoretically ...
- articleJune 2017
A Note on the Order of Iterated Line Digraphs
Given a digraph G, we propose a new method to find the recurrence equation for the number of vertices nk of the k-iterated line digraph LkG, for kï ź0, where L0G=G. We obtain this result by using the minimal polynomial of a quotient digraph πG of G.
- research-articleJune 2016
Translation validation of loop and arithmetic transformations in the presence of recurrences
LCTES 2016: Proceedings of the 17th ACM SIGPLAN/SIGBED Conference on Languages, Compilers, Tools, and Theory for Embedded SystemsPages 31–40https://doi.org/10.1145/2907950.2907954Compiler optimization of array-intensive programs involves extensive application of loop transformations and arithmetic transformations. Hence, translation validation of array-intensive programs requires manipulation of intervals of integers (...
Also Published in:
ACM SIGPLAN Notices: Volume 51 Issue 5 - research-articleMay 2015
On Transience and Recurrence in Irreducible Finite-State Stochastic Systems
ACM Transactions on Modeling and Computer Simulation (TOMACS), Volume 25, Issue 4Article No.: 25, Pages 1–19https://doi.org/10.1145/2699721Long-run stochastic stability is a precondition for applying steady-state simulation output analysis methods to a discrete-event stochastic system, and is of interest in its own right. We focus on systems whose underlying stochastic process can be ...
- research-articleJanuary 2014
Stability and Recurrence of Regime-Switching Diffusion Processes
SIAM Journal on Control and Optimization (SICON), Volume 52, Issue 6Pages 3496–3516https://doi.org/10.1137/140962905We provide some criteria on the stability of regime-switching diffusion processes. Both the state-independent and state-dependent regime-switching diffusion processes with switching in a finite state space and an infinite countable state space are studied ...
- research-articleJanuary 2014
Escape Rates for Rotor Walks in $\mathbb{Z}^d$
SIAM Journal on Discrete Mathematics (SIDMA), Volume 28, Issue 1Pages 323–334https://doi.org/10.1137/130908646Rotor walk is a deterministic analogue of random walk. We study its recurrence and transience properties on ${\mathbb Z}^d$ for the initial configuration of all rotors aligned. If $n$ particles in turn perform rotor walks starting from the origin, we show ...
- research-articleJanuary 2014
Convergence Analysis of a Discontinuous Galerkin/Strang Splitting Approximation for the Vlasov--Poisson Equations
SIAM Journal on Numerical Analysis (SINUM), Volume 52, Issue 2Pages 757–778https://doi.org/10.1137/120898620A rigorous convergence analysis of the Strang splitting algorithm with a discontinuous Galerkin approximation in space for the Vlasov--Poisson equations is provided. It is shown that under suitable assumptions the error is of order $\mathcal{O}(\tau^2+h^q +h^...
- articleJuly 2012
Analysis of methods of estimating objective function gradient during recurrent measurements of image parameters
Pattern Recognition and Image Analysis (SPPRIA), Volume 22, Issue 3Pages 399–405https://doi.org/10.1134/S1054661812020186Methods for estimating the objective function gradient in recurrent algorithms for parameter estimation are analyzed by the example of the problem of estimating the parameters of geometric interframe image deformations. The gradient is estimated from a ...
- research-articleJune 2012
Conceptual Recurrence Plots: Revealing Patterns in Human Discourse
IEEE Transactions on Visualization and Computer Graphics (ITVC), Volume 18, Issue 6Pages 988–997https://doi.org/10.1109/TVCG.2011.100Human discourse contains a rich mixture of conceptual information. Visualization of the global and local patterns within this data stream is a complex and challenging problem. Recurrence plots are an information visualization technique that can reveal ...
- ArticleMay 2012
Recurrent Refinement for Visual Saliency Estimation in Surveillance Scenarios
CRV '12: Proceedings of the 2012 Ninth Conference on Computer and Robot VisionPages 117–124https://doi.org/10.1109/CRV.2012.23In recent years, many different proposals for visual saliency computation have been put forth, that generally frame the determination of visual saliency as a measure of local feature contrast. There is however, a paucity of approaches that take into ...
- research-articleNovember 2010
Clifford support vector machines for classification, regression, and recurrence
IEEE Transactions on Neural Networks (TNN), Volume 21, Issue 11Pages 1731–1746https://doi.org/10.1109/TNN.2010.2060352This paper introduces the Clifford support vector machines (CSVM) as a generalization of the real and complex-valued support vector machines using the Clifford geometric algebra. In this framework, we handle the design of kernels involving the Clifford ...
- ArticleJune 2010
Prediction of bladder cancer recurrences using artificial neural networks
- Ekaitz Zulueta Guerrero,
- Naiara Telleria Garay,
- Jose Manuel Lopez-Guede,
- Borja Ayerdi Vilches,
- Eider Egilegor Iragorri,
- David Lecumberri Castaños,
- Ana Belén de la Hoz Rastrollo,
- Carlos Pertusa Peña
HAIS'10: Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part IPages 492–499https://doi.org/10.1007/978-3-642-13769-3_60Even if considerable advances have been made in the field of early diagnosis, there is no simple, cheap and non-invasive method that can be applied to the clinical monitorisation of bladder cancer patients Moreover, bladder cancer recurrences or the ...
- ArticleJune 2010
Mathematical models for analysing diatonic modes
The study herein aims to present two mathematical models for analysing heptachordic diatonic modes. We chose to approach the issue through a structuralist method, the first mathematical model being based on permuting some structures inside the octavian ...