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...

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...

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 ...

1 Deenitions Consider a distribution D on n bits x = x 1 x n. D is k-wise independent ii for all sets of k indices S = fi 1 x ik = a 1 a k ] = 1 2 k : The idea is that if we restrict our attention to any k positions in x, no matter how many times we sample from D, we cannot distinguish D from the uniform distribution over n bits. We can get a Fourier interpretation of k-wise independence by vie...

In this paper we investigate the extent to which Katz backoff language models can be compressed through a combination of parameter quantization (width-wise compression) and parameter pruning (length-wise compression) methods while preserving performance. We compare the compression and performance that is achieved using entropy-based pruning against that achieved using only parameter quantizatio...