We define and study the notion of min-wise independent families of permutations. We say that F ⊆ Sn is min-wise independent if for any set X ⊆ [n] and any x ∈ X, when π is chosen at random in F we have Pr(min{π(X)} = π(x)) = 1 |X| . In other words we require that all the elements of any fixed set X have an equal chance to become the minimum element of the image of X under π. Our research was mo...

We prove a version of the Ray-Chaudhuri–Wilson and Frankl–Wilson theorems for k-wise intersections and also generalize a classical code-theoretic result of Delsarte for k-wise Hamming distances. A set of code-words a; a; . . . ; ak of length n have k-wise Hamming-distance ‘; if there are exactly ‘ such coordinates, where not all of their coordinates coincide (alternatively, exactly n ‘ of their...

We prove a version of the Ray-Chaudhuri{Wilson and Frankl-Wilson theorems for kwise intersections and also generalize a classical code-theoretic result of Delsarte for k-wise Hamming distances. A set of code-words a1; a2; : : : ; ak of length n have k-wise Hamming-distance `, if there are exactly ` such coordinates, where not all of their coordinates coincide (alternatively, exactly n ` of thei...

In this paper, we study the behavior of individuals when facing two different, but incentive-wise identical, institutions. We pair the first price auction with an equivalent lottery. Once a subject is assigned a value for the auctioned object, the first price auction can be modeled as a lottery in which the individual faces a given probability of winning a certain payoff. This set up allows us ...

Major advances in languages, tools and methodologies have improved our ability to develop reactive systems, but the task remains difficult, expensive and error prone. One of the key reasons is the growing complexity of many kinds of reactive systems, which increasingly prevents the human mind from managing a comprehensive picture of all their relevant elements and behaviors. We present a vision...

Abstract Natural gradient descent (NGD) helps to accelerate the convergence of dynamics, but it requires approximations in large-scale deep neural networks because its high computational cost. Empirical studies have confirmed that some NGD methods with approximate Fisher information converge sufficiently fast practice. Nevertheless, remains unclear from theoretical perspective why and under wha...

Currently, an increasing number of model pruning methods are proposed to resolve the contradictions between computer powers required by deep learning models and resource-constrained devices. However, for simple tasks like robotic detection, most traditional rule-based network can not reach a sufficient compression ratio with low accuracy loss time-consuming as well laborious. In this paper, we ...

The use of wind turbines to generate electricity has increased in recent years. One of the most important parts of a wind turbine is the foundation, which should be designed accurately because it is influenced by difference forces. Soil cannot carry tension stress; thus, when a wind turbine foundation is applied eccentricity forces, a gap appears between the soil and foundation. The gap will ha...

The principle of physical causal closure makes the problem ontology consciousness insoluble since rejects possibility mental causation. However, this is based on linear causality model foundation which connection material events with each other. article deals causation non-material events, reflecting influence probability probability, and not an event event. A hypothetical considered, in one st...