This work is a study of neutrality in the context of Evolutionary Computation systems. In particular, we introduce the use of explicit neutrality with an integer string coding scheme to allow neutrality to be measured during evolution. We tested this method on a Boolean benchmark problem. The experimental results indicate that there is a positive relationship between neutrality and evolvability...

The theory of optimal stack filtering has been used in the difference of estimates (DoE) approach to the detection of intensity edges in noisy images. The DoE approach is modified by imposing a symmetry condition on the data used to train the two stack filters. Under this condition, the stack filters obtained are duals of each other. Only one filter must therefore be trained; the other is simpl...

By analyzing how one obtains the Stone space of the reduced product of an indexed collection of Boolean algebras from the Stone spaces of those algebras, we derive a topological construction, the "reduced coproduct", which makes sense for indexed collections of arbitrary Tichonov spaces. When the filter in question is an ultrafilter, we show how the "ultracoproduct" can be obtained from the usu...

The four different types of stack filters, type-0 through type-3, are determined by four different shapes of the on-set of the positive Boolean function from which the stack filter is constructed. Under all three appending strategies commonly considered in the literature---first and last value carry-on strategy, constant value carry-on strategy, and the circular approach--stack filters of type-...

This paper focuses on the binary analysis of the center-weighted median (CWM) filters. This subclass of nonlinear stack filters is based on minimal positive Boolean functions (PBFs), the complexity of which depends on two parameters only, such as a window size and a weight of the central sample. It can be easily seen that the complexity of PBFs corresponding with CWMs increases with the increas...

ABSTRACT In this research paper, it is shown that the class of all Boolean rank order filters are represented using the class of all Positive Symmetric Boolean functions. Using this result, it is shown that the class of all permutation invariant filters are equivalent to the class of rank order filters. The algebraic structure of Positive Boolean symmetric functions and Positive Boolean functio...

The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a condition in the relevant generic filter. We show that both the definability (and, in fact, even the amenability) of the forcing relation and the truth lemma ca...

The water crisis is harmful effects on human life. Also one of the most problems in the human society is water resources management. In this study, site selection of most suitable areas for artificial recharge using Boolean model. Criteria used to select the most suitable area for artificial recharge included: infiltration, slope, aquifer thickness, aquifer quality.  The layers were produced an...