This paper shows how genetic programming (GP) can help in nd-ing generalizing Boolean functions when only a small part of the function values are given. The selection pressure favours functions having as few subfunctions as possible while only using essential variables, so the resulting functions should have good generalization properties. For eeciency no S-expressions are used for representati...

This paper shows how genetic programming (GP) can help in nding generalizing Boolean functions when only a small part of the function values are given. The selection pressure favours functions having as few subfunctions as possible while only using essential variables, so the resulting functions should have good generalization properties. For e ciency no S-expressions are used for representatio...

We propose a suitable substitute for the classical Grothendieck ring of an algebraically closed field, in which any quasi-projective scheme is represented, while maintaining its non-reduced structure. This yields a more subtle invariant, called the schemic Grothendieck ring, in which we can formulate a form of integration resembling Kontsevich’s motivic integration via arc schemes. In view of i...

Four experiments examined whether generalization to unfamiliar views was better under stereo viewing as opposed to nonstereo viewing across different tasks and stimuli. The first three experiments used a sequential matching task in which observers matched the identity of shaded tube-like objects. Across Experiments 1-3, we manipulated the presentation method of the nonstereo stimuli (eye-patch ...

Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid M . Our main result is that these polynomials are determined by Betti numbers associated with N0-graded minimal free resolutions of the Stanley-Reisner ideals of M and so-called elongations of M . Generalizing Greene’s theorem from coding theory, we show that ...