In this paper CMOS VLSI circuit solutions are suggested for on-chip learning and weight storage, which are simple and silicon area efficient. In particular a stochastic learning scheme, named Random Weight Change, and a multistable weight storage approach have been implemented. Additionally, the problems of the influence of technological variations on learning accuracy is discussed. Even though...

Many strategies for constructing different structures of sparse approximate inverse preconditioners for large linear systems have been proposed in the literature. In a more general framework, this paper analyzes the theoretical effectiveness of the optimal preconditioner (in the Frobenius norm) of a linear system over an arbitrary subspace of Mn (R). For this purpose, the spectral analysis of t...

We analyze some aspects of scan statistics, which have been proposed to help for the detection of weak signals in genetic linkage analysis. We derive approximate expressions for the power of a test based on moving averages of the identity by descent allele sharing proportions for pairs of relatives at several contiguous markers. We confirm these approximate formulae by simulation. The results s...

While stylistic variation in attention-based models has been foundational to sociolinguistic theory (Labov 1972a; Trudgill 1974), other studies (e.g. Coupland 1985; Eckert 1989; Drummond 2018; Snell 2018) conceptualise style as a resource used the context of identity construction. I synthesise these two approaches and consider social meaning variable attentional load. Informed by study lexical ...

This paper is motivated by the question to approximate the distribution of the completion time of a project network with random activity durations. In general, we consider the mixed zero-one linear optimization problem under objective uncertainty, and develop an approach to approximate the distribution of its optimal value when the random objective coefficients follow a multivariate normal dist...

The so-called multi-revolution methods were introduced in celestial mechanics as an efficient tool for the long-term numerical integration of nearly periodic orbits of artificial satellites around the Earth. A multi-revolution method is an algorithm that approximates the map φNT of N near-periods T in terms of the one near-period map φT evaluated at few s ≪ N selected points. More generally, mu...