SearcharxivSearch

arXiv subjects

Tamal Dey

Publications and source records attributed to Tamal Dey.

5 recordsLinked to original sources

Protonic Nickelate Device Networks for Spatiotemporal Neuromorphic Computing

Computation in biological neural circuits arises from the interplay of nonlinear temporal responses and spatially distributed dynamic network interactions. Replicating this richness in hardware has remained challenging, as most neuromorphic devices emulate only isolated neuron- or synapse-like functions. In this work, we introduce an integrated neuromorphic computing platform in which both nonlinear spatiotemporal processing and programmable memory are realized within a single perovskite nickelate material system. By engineering symmetric and asymmetric hydrogenated NdNiO3 junction devices on the same wafer, we combine ultrafast, proton-mediated transient dynamics with stable multilevel resistance states. Networks of symmetric NdNiO3 junctions exhibit emergent spatial interactions mediated by proton redistribution, while each node simultaneously provides short-term temporal memory, enabling nanoseconds scale operation with an energy cost of 0.2 nJ per input. When interfaced with asymmetric output units serving as reconfigurable long-term weights, these networks allow both feature transformation and linear classification in the same material system. Leveraging these emergent interactions, the platform enables real-time pattern recognition and achieves high accuracy in spoken-digit classification and early seizure detection, outperforming temporal-only or uncoupled architectures. These results position protonic nickelates as a compact, energy-efficient, CMOS-compatible platform that integrates processing and memory for scalable intelligent hardware.

cs.ET

ICML 2023 Topological Deep Learning Challenge : Design and Results

This paper presents the computational challenge on topological deep learning that was hosted within the ICML 2023 Workshop on Topology and Geometry in Machine Learning. The competition asked participants to provide open-source implementations of topological neural networks from the literature by contributing to the python packages TopoNetX (data processing) and TopoModelX (deep learning). The challenge attracted twenty-eight qualifying submissions in its two-month duration. This paper describes the design of the challenge and summarizes its main findings.

cs.LG

Solution Processed CMOS compatible Carbon Nano-dots Based Heterojunction for Enhanced UV Detector

Carbon nanostructures technology has recently emerged as a key enabler for next-generation optoelectronic devices including deep UV detectors and light sources which is promising in health and environment monitoring. Here, we report the fabrication of solution processed Carbon nano-dots (CNDs)/n-Si heterojunction showing broadband spectral response with a peak responsivity of ~ 1.25 A/W in UV (~300 nm) wavelength. The surface topography and chemical information of synthesized CNDs via a facile synthesis route have been characterized showing the presence of surface chemical states resulting broad optical emission. The CNDs/n-Si photo diodes exhibit very low dark current (~500 pA), excellent rectification ratio (~5*10^3), and very good photo-modulation in UV region. Given the solution-processing capability of the devices and extraordinary optical properties of CNDs, the use of CNDs will open up unique opportunities for future high-performance, low-cost DUV photo detectors.

physics.ins-det

Segmenting a Surface Mesh into Pants Using Morse Theory

A pair of pants is a genus zero orientable surface with three boundary components. A pants decomposition of a surface is a finite collection of unordered pairwise disjoint simple closed curves embedded in the surface that decompose the surface into pants. In this paper we present two Morse theory based algorithms for pants decomposition of a surface mesh. Both algorithms operates on a choice of an appropriate Morse function on the surface. The first algorithm uses this Morse function to identify handles that are glued systematically to obtain a pant decomposition. The second algorithm uses the Reeb graph of the Morse function to obtain a pant decomposition. Both algorithms work for surfaces with or without boundaries. Our preliminary implementation of the two algorithms shows that both algorithms run in much less time than an existing state-of-the-art method, and the Reeb graph based algorithm achieves the best time efficiency. Finally, we demonstrate the robustness of our algorithms against noise.

cs.GR

Emerging Challenges in Computational Topology

Here we present the results of the NSF-funded Workshop on Computational Topology, which met on June 11 and 12 in Miami Beach, Florida. This report identifies important problems involving both computation and topology.

cs.CG