Applied Abstract Algebra

Lidl, Rudolf; Pilz, Günter

doi:10.1007/978-1-4615-6465-2

Cited by 82 publications

(100 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…More formally, the agglutination procedure described above is a simple algorithm for computing the transitive closure (Lidl and Pilz 1997) of the overlap relation ℛ between cones. For cone 1 in the fast chain and cone 2 in the slow chain, ℛ( cone 1 , cone 2 ) is true if and only if swapping cone 1 out of the fast chain would require swapping cone 2 out of the slow chain in order to preserve cone exclusion.…”

Section: Adaptive Simulated Temperingmentioning

confidence: 99%

Monte Carlo methods for localization of cones given multielectrode retinal ganglion cell recordings

Sadeghi

Gauthier

Field

et al. 2012

Network: Computation in Neural Systems

View full text Add to dashboard Cite

It has recently become possible to identify cone photoreceptors in primate retina from multi-electrode recordings of ganglion cell spiking driven by visual stimuli of sufficiently high spatial resolution. In this paper we present a statistical approach to the problem of identifying the number, locations, and color types of the cones observed in this type of experiment. We develop an adaptive Markov Chain Monte Carlo (MCMC) method that explores the space of cone configurations, using a Linear-Nonlinear-Poisson (LNP) encoding model of ganglion cell spiking output, while analytically integrating out the functional weights between cones and ganglion cells. This method provides information about our posterior certainty about the inferred cone properties, and additionally leads to improvements in both the speed and quality of the inferred cone maps, compared to earlier “greedy” computational approaches.

show abstract

Section: Adaptive Simulated Temperingmentioning

confidence: 99%

Monte Carlo methods for localization of cones given multielectrode retinal ganglion cell recordings

Sadeghi

Gauthier

Field

et al. 2012

Network: Computation in Neural Systems

View full text Add to dashboard Cite

show abstract

“…It is known from cyclic codes [1] that the columns of Q contain successive states of a linear feedback shift register (LFSR), based on a prime polynomial and therefore with maximum length 2 1 µ − .…”

Section: Residual Polynomial System Over Gf(2)mentioning

confidence: 99%

Fast and Low Cost HW Bit Map for Memory Test Based on Residue Polynomial System over GF(2)

Rivoir¹

2007

16th Asian Test Symposium (ATS 2007)

View full text Add to dashboard Cite

At-speed memory test demands increasing address rates from ATE bit maps. Today, the effective address rate is multiplied using multiple costly time-interleaved bit map copies. For the first time, address permutation is investigated for memory test in an attempt to multiply the address rate without increasing the overall memory size. However all published schemes create conflicts for some addresses sequences or require too many memories. This paper introduces a novel address partitioning scheme for arbitrarily few memoriesat the expense of an increased buffer per memory. For relevant address sequences which are based on powers of two, analytical considerations and exhaustive simulations prove that the effective address rate is increased by a factor of M , with zero memory size overhead.

show abstract

“…The second edition [1] containing a survey of results on near-rings and their applications appeared in 1983. By now, several monographs have been published, in particular [2] and [3]. The book [3] contains some applications of near-rings.…”

Section: Introductionmentioning

confidence: 99%

On the finite near-rings generated by endomorphisms of an extra-special 2-group

Garipova¹,

Kazarin²

2010

Discrete Mathematics and Applications

View full text Add to dashboard Cite

We consider the near-rings generated by endomorphisms of some extra-special 2-groups. The most essential difference of a near-ring from a usual ring is the absence of the second distributivity. In this paper, we prove that the near-ring E.G/ generated by endomorphisms of an extra-special 2-group G of order 2 2nC1 has the order which divides 2 2 2n C4n 2 and that the near-ring E.G/ of the extra-special 2-group G of type of order 2 2nC1 has the order divided by 2 2 2n C4n 2 2 . In this case, for n D 1 and n D 2 the upper bound is attainable: the near-ring E.G/ of the group D 8 has the order 2 8 , and the near-ring E.G/ of an extra-special 2-group D 8 Q 8 has the order 2 32 .

show abstract

Applied Abstract Algebra

Cited by 82 publications

References 0 publications

Monte Carlo methods for localization of cones given multielectrode retinal ganglion cell recordings

Monte Carlo methods for localization of cones given multielectrode retinal ganglion cell recordings

Fast and Low Cost HW Bit Map for Memory Test Based on Residue Polynomial System over GF(2)

On the finite near-rings generated by endomorphisms of an extra-special 2-group

Contact Info

Product

Resources

About