Trace conditioning is a form of associative learning that can be induced by presenting a conditioned stimulus (CS) and an unconditioned stimulus (US) following each other, but separated by a temporal gap. This gap distinguishes trace conditioning from classical delay conditioning, where the CS and US overlap. To bridge the temporal gap between both stimuli and to form an association between CS ...

Branch predictors and processor front-ends have been the focus of a number of computer architecture studies. Typically they are evaluated separately from other components using trace-driven simulation based on instruction traces. To offer a faithful representation of processor’s workload the traces are very large, and hence difficult to manage if kept in uncompressed form. In order to reduce si...

A new 8-dimensional conformal gauging avoids the unphysical size change, third order gravitational field equations, and auxiliary fields that prevent taking the conformal group as a fundamental symmetry. We give the structure equations, gauge transformations and intrinsic metric structure for the new biconformal spaces. We prove that a torsion-free biconformal space with exact Weyl form, closed...

Interesting properties of the partitions of a finite field Fq induced by the combination of involutions and trace maps are studied. The special features of involutions of the form u z , u being a fixed element of Fq, are exploited to generate pseudorandom numbers, the randomness resting on the uniform distribution of the images of zero-trace elements among the sets of non-zero trace elements of...

This paper extends previous work on execution trace triaging. We examine the problem of trace triaging along three of the four views used in the study of temporal properties, namely the automata-theoretic view, the temporal logic view and the set-theoretic view. For each case, we propose several partitions of universe of possible traces into equivalence classes, which follow naturally from the ...

Let Fq be a finite field of cardinality q, where q is a power of a prime number p, t ≥ 2 an even number satisfying t 6≡ 1 (mod p) and Fqt an extension field of Fq with degree t. First, a new trace bilinear form on F n qt which is called ∆-bilinear form is given, where n is a positive integer coprime to q. Then according to this new trace bilinear form, bases and enumeration of cyclic ∆-self-ort...

We construct minimal polynomials of totally positive algebraic integers of small absolute trace by consideration of their reductions modulo auxiliary polynomials. Many new examples of such polynomials of minimal absolute trace (for given degree) are found. The computations are pushed to degrees that previously were unattainable, and one consequence is that the new examples form the majority of ...

A finite-dimensional representation of an algebraic group G gives a trace symmetric bilinear form on the Lie algebra of G. We give a criterion in terms of the root system data for this form to vanish. As a corollary, we show that a Lie algebra of type E8 over a field of characteristic 5 does not have a so-called “quotient trace form”, answering a question posed in the 1960s. Let G be an algebra...