A (k, ε)-biased sample space is a distribution over {0, 1}n that ε-fools every nonempty linear test of size at most k. Since they were introduced by Naor and Naor (SIAM J. Computing, 1993), these sample spaces have become a central notion in theoretical computer science with a variety of applications. When constructing such spaces, one usually attempts to minimize the seed length as a function ...

Gradual emerging patterns (GEPs) are gradual item sets that occur less frequently in one data set and more another. For instance, let ‘fan speed’ ‘temperature’ be attributes of two numerical sets. A “the higher the speed, lower temperature” (which correlates a set’s attributes) becomes GEP if it is frequent (in terms support as pattern mining) However, such do not indicate how time gap impacts ...

Elixir is a functional programming language with dynamic typing. We propose gradual type system that makes it possible to perform type-checking on significant fragment of the language. An important feature does not require any syntactic change Elixir. Type information provided by means function signatures which are declared in terms typespec directives. The proposed based subtyping and backward...

Overwhelming evidence from the cognitive sciences shows that, in simple discrimination tasks (determining what is louder, longer, brighter, or even which number larger) humans make more mistakes and decide slowly when stimuli are closer along relevant scale. We investigate to extent these effects for economic decisions a setting where optimal choices objectively known (and independent of attitu...

This paper explores the surprisingly rich design space for the simply typed lambda calculus with casts and a dynamic type. Such a calculus is the target intermediate language of the gradually typed lambda calculus but it is also interesting in its own right. In light of diverse requirements for casts, we develop a modular semantic framework, based on Henglein’s Coercion Calculus, that instantia...