Reliable and Energy-efficient Diabetic Retinopathy Screening using Memristor-based Neural Networks

Diabetic retinopathy (DR) is a leading cause of permanent vision loss worldwide. It refers to irreversible retinal damage caused due to elevated glucose levels and blood pressure. Regular screening for DR can facilitate its early detection and timely treatment. Neural network-based DR classifiers can be leveraged to achieve such screening in...

Blocking sets, minimal codes and trifferent codes

We prove new upper bounds on the smallest size of affine blocking sets, that is, sets of points in a finite affine space that intersect every affine subspace of a fixed codimension. We show an equivalence between affine blocking sets with respect to codimension-2 subspaces that are generated by taking a union of lines through the origin, and...

Subspace coverings with multiplicities

We study the problem of determining the minimum number of affine subspaces of codimension that are required to cover all points of at least times while covering the origin at most times. The case is a classic result of Jamison, which was independently obtained by Brouwer and Schrijver for. The value of also follows from a well-known theorem...

Accurate and Energy-Efficient Bit-Slicing for RRAM-Based Neural Networks

Computation-in-memory (CIM) paradigm leverages emerging memory technologies such as resistive random access memories (RRAMs) to process the data within the memory itself. This alleviates the memory-processor bottleneck resulting in much higher hardware efficiency compared to von-Neumann architecture-based conventional hardware. Hence, CIM...

Covering grids with multiplicity

Given a finite grid in R², how many lines are needed to cover all but one point at least k times? Problems of this nature have been studied for decades, with a general lower bound having been established by Ball and Serra. We solve this problem for various types of grids, in particular showing the tightness of the Ball–Serra bound...

On the minimum degree of minimal Ramsey graphs for cliques versus cycles

A graph G is said to be q-Ramsey for a q-tuple of graphs (H₁,..., H_q), denoted by G →q (H₁,..., H_q), if every q-edge-coloring of G contains a monochromatic copy of Hi in color i for some i ε [q]. Let sq(H1,..., Hq) denote the smallest minimum degree of G over all graphs G that are minimal q-Ramsey...

Severity-based Hierarchical ECG Classification using Neural Networks

Timely detection of cardiac arrhythmia characterized by abnormal heartbeats can help in the early diagnosis and treatment of cardiovascular diseases. Wearable healthcare devices typically use neural networks to provide the most convenient way of continuously monitoring heart activity for arrhythmia detection. However, it is challenging to...

Defects, Fault Modeling, and Test Development Framework for RRAMs

Resistive RAM (RRAM) is a promising technology to replace traditional technologies such as Flash, because of its low energy consumption, CMOS compatibility, and high density. Many companies are prototyping this technology to validate its potential. Bringing this technology to the market requires high-quality tests to ensure customer...

A Survey on Memory-centric Computer Architectures

Faster and cheaper computers have been constantly demanding technological and architectural improvements. However, current technology is suffering from three technology walls: leakage wall, reliability wall, and cost wall. Meanwhile, existing architecture performance is also saturating due to three well-known architecture walls: memory wall,...

The minimum degree of minimal Ramsey graphs for cliques

We prove that (Formula presented.), where (Formula presented.) is the Ramsey parameter introduced by Burr, Erdős and Lovász in 1976, which is defined as the smallest minimum degree of a graph (Formula presented.) such that any (Formula presented.) -colouring of the edges of (Formula presented.) contains a monochromatic (Formula presented.),...

Report of RILEM TC 267-TRM phase 2: Optimization and testing of the robustness of the R3 reactivity tests for supplementary cementitious materials

The results of phase 1 of an interlaboratory test, coordinated by the RILEM TC 267-TRM “Tests for Reactivity of Supplementary Cementitious Materials” showed that the R³ (rapid, relevant, reliable) test method, by measurement of heat release or bound water, provided the most reliable and relevant determination of the chemical...

Ryser's Conjecture for t-intersecting hypergraphs

A well-known conjecture, often attributed to Ryser, states that the cover number of an r-partite r-uniform hypergraph is at most r−1 times larger than its matching number. Despite considerable effort, particularly in the intersecting case, this conjecture remains wide open, motivating the pursuit of variants of the original conjecture....

Microstructural modeling of early-age creep in hydrating cement paste

This paper presents a new approach to model the creep behavior of cement paste at early ages. The creep behavior is simulated by applying a time-varying generalized Maxwell model on the individual elements of a finite-element mesh of a simulated three-dimensional microstructure and compared with results in the literature. All mechanical...