Searcharxiv⌕ Search

arXiv subjects

Alexandru Ionita

Publications and source records attributed to Alexandru Ionita.

3 recordsLinked to original sources

An Optimization Framework for Automated Assessment of Biological Plausibility of Spiking Neurons

Biological plausibility is a key concept in neuromorphic computing and spiking neural networks, yet it remains inconsistently defined and difficult to quantify. In this work, we present an open-source framework for the automated assessment of biological plausibility in spiking neuron models. Our method builds on the idea of evaluating a model's ability to replicate canonical neuronal firing patterns observed in biological systems, following the classification proposed by Izhikevich. By encoding these patterns into objective functions and optimizing model parameters accordingly, our framework enables empirical assessment without requiring prior analytical modeling. Treating neuron models as black boxes, it provides a practical and flexible means of characterizing their dynamic capabilities. We demonstrate the effectiveness of the framework on several established models and a previously unexplored custom model. Implemented in Python and compatible with PyTorch and the Norse library, the framework is tailored for machine learning contexts. It is intended as a starting point for systematic research into the relationship between biological plausibility and network-level performance metrics such as accuracy, energy efficiency, robustness, and adaptability.

cs.NE↗

Stacked Josephson junctions for quantum circuit applications

Low-loss inductors are essential components in various superconducting circuits, such as qubits or digital electronics. In this study, we investigate highly compact inductors formed by vertical stacking of Josephson junctions. Our implementation employs multiple layers of aluminum separated by tunnel barriers. Individual stacks are connected by suspended superconducting bridges, which are free of additional dielectric materials and therefore should not contribute significantly to losses. We present implementation details, fabrication results, and device characterization measurements.

cond-mat.supr-con↗

Heuristics Optimization of Boolean Circuits with application in Attribute Based Encryption

We propose a method of optimizing monotone Boolean circuits by re-writing them in a simpler, equivalent form. We use in total six heuristics: Hill Climbing, Simulated Annealing, and variations of them, which operate on the representation of the circuit as a logical formula. Our main motivation is to improve performance in Attribute-Based Encryption (ABE) schemes for Boolean circuits. Therefore, we show how our heuristics improve ABE systems for Boolean circuits. Also, we run tests to evaluate the performance of our heuristics, both as a standalone optimization for Boolean circuits and also inside ABE systems.

cs.CC↗