A generic framework for context-sensitive analysis of modular programs
Context-sensitive analysis provides information which is potentially more accurate than that provided by context-free analysis. Such information can then be applied in order to validate/debug the program and/or to specialize the program obtaining ...
Stuckey, P.J. +14 more
core +1 more source
On the Numerical Computation of Modular Forms [PDF]
This thesis presents a fast method for the numerical computation of modular forms. Our method significantly improves the performance of previous methods by using mixed-precision iterative solving techniques to reduce the number of iterations, and by ...
Berghaus, David
core
Enzymatic Computation and Cognitive Modularity [PDF]
Currently, there is widespread skepticism that higher cognitive processes, given their apparent flexibility and globality, could be carried out by specialized computational devices, or modules. This skepticism is largely due to Fodor's influential definition of modularity.
openaire +2 more sources
A Sensorimotor Model for Computing Intended Reach Trajectories. [PDF]
The presumed role of the primate sensorimotor system is to transform reach targets from retinotopic to joint coordinates for producing motor output. However, the interpretation of neurophysiological data within this framework is ambiguous, and has led to
Cevat Üstün
doaj +1 more source
Finite State Automata Evolution Using Modular Architecture
The automatic creation of finite automata has long been a goal of the evolutionary computation community. The previous works in the evolution of finite state automata were limited to the evolution of strictly non-modular FSA. Here, a modular architecture
Rajni Jindal, Shraddha Singhai
doaj +1 more source
A Multiprocessor Architecture Using Modular Arithmetic for Very High Precision Computation
We outline a multiprocessor architecture that uses modular arithmetic to implement numerical computation with 900 bits of intermediate precision.
Wu, Henry M., Henry M. Wu
core +1 more source
Two algorithms based on modular arithmetic: lattice basis reduction and Hermite normal form computation [PDF]
We verify two algorithms for which modular arithmetic plays an essential role: Storjohann's variant of the LLL lattice basis reduction algorithm and Kopparty's algorithm for computing the Hermite normal form of a matrix.
Jose Divasón [0000-0002-5173-128X] +2 more
core
Bio-Inspired Constant-Time Arithmetic Kernels in Hybrid Membrane–Neural Spiking P Systems
This work introduces Hybrid Membrane–Neural P systems (HMN P systems), a computational model that integrates principles from membrane computing and spiking neural P systems. The resulting framework offers a versatile foundation for the development of bio-
Eduardo Vázquez +7 more
doaj +1 more source
Exact Inference with Approximate Computation for Differentially Private Data via Perturbations
This paper discusses how two classes of approximate computation algorithms can be adapted, in a modular fashion, to achieve exact statistical inference from differentially private data products.
Ruobin Gong
doaj
PipeFL: Hardware/Software co-Design of an FPGA Accelerator for Federated Learning
Federated learning has solved the problems of data silos and data fragmentation on the premise of satisfying privacy. However, cryptographic algorithms in federated learning brought significant increase in computational complexity, which limited the ...
Zixiao Wang +6 more
doaj +1 more source

