We introduce a new model – the Filter-Combiner model – for memoryless synchronous stream ciphers. The new model combines the best features of the classical models for memoryless synchronous stream ciphers – the Nonlinear-Combiner model and the Nonlinear-Filter model. In particular, we show that the Filter-Combiner model provides key length optimal resistance to correlation attacks and eliminate...

This paper proposes analytical synthesis of the minimum L2-sensitivity realizations of all-pass digital filters. We first prove that the L2-sensitivity minimization problem can be solved analytically if the all second-order modes of a digital filter are equal. We focus on the fact that the second-order modes of all-pass digital filters are all unity. As a result, it is clarified that the minimu...

Supporting advertisements in large publish/subscribe services has an improving influence on the system scalability. The additional application of event routing optimizations based on subscriptions further increases the event throughput and decreases the memory usage of publish/subscribe systems. However, also advertisement-based optimizations can improve these system properties but have been wi...

Boolean Query Mapping Across Heterogeneous Information Sources Kevin Chen-Chuan Chang, Hector Garcia-Molina, Andreas Paepcke* Abstract---Searching over heterogeneous information sources is difficult because of the non-uniform query languages. Our approach is to allow a user to compose Boolean queries in one rich front-end language. For each user query and target source, we transform the user qu...

We show that while the length ω iterated ultrapower by a normal ultrafilter is a Boolean ultrapower by the Boolean algebra of Př́ıkrý forcing, it is consistent that no iteration of length greater than ω (of the same ultrafilter and its images) is a Boolean ultrapower. For longer iterations, where different ultrafilters are used, this is possible, though, and we give Magidor forcing and a general...

The majority of nonlinear filters used in practise are stack filters. An algorithm is presented which calculates the output distribution of an arbitrary stack filter S from the disjunctive normal form (DNF) of its underlying positive Boolean function. The so called selection probabilities can be computed along the way.

Probabilistic membership filters are a type of data structure designed to quickly verify whether an element of a large data set belongs to a subset of the data. While false negatives are not possible, false positives are. Therefore, the main goal of any good probabilistic membership filter is to have a small false-positive rate while being memory efficient and fast to query. Although Bloom filt...

We present an implementation of a simplified scalable architecture for the efficient realization of 3-D adaptive LUM smoother in the Field Programmable Logic Devices (FPLDs). The proposed filter architecture takes advantages of a combination of recently provided Boolean LUM smoothers with bit-serial realization of stack filters. In order to decrease hardware requirements, we implemented a highl...

The filter/flow model is a graph-based query visualization capable of representing arbitrary Boolean expressions. However, the resulting graphs quickly become large and hard to handle when representing complex search queries. We developed an extended filter/flow model that allows the display of complex queries in a more compact form. This paper reports on a user study we conducted to evaluate t...

Possibility semantics. Possibility semantics for modal logic is a generalization of standard Kripke semantics. In this semantics, a possibility frame has a refinement relation which is a partial order between states, in addition to the accessibility relation for modalities. From an algebraic perspective, full possibility frames are dually equivalent to complete Boolean algebras with complete op...