We present a data mining approach for reducing the search space of local search algorithms in large-scale set partitioning problems (SPPs). We construct a k-nearest neighbor graph by extracting variable associations from the instance to be solved, in order to identify promising pairs of flipping variables in the large neighborhood search. We incorporate the search space reduction technique into...

Totalistic cellular automata were introduced by Wolfram [1, 2] as a means of studying higher-color cellular automata within a reasonable space of possible rules. The underlying principle is to systematically construct a subset of rules within all the possible rules of the highercolor cellular automata, and the system in totalistic cellular automata is to add up the values of the cells within th...

Data clustering methods have been developed extensively in the data mining literature for detecting useful patterns in large datasets in the form of densely populated regions in a multi–dimensional Euclidean space. One of the challenges in dealing with these large databases is to obtain quality solutions within reasonable CPU time and memory requirements. Earlier partitioning methods such as PA...

The purpose of image encryption is to protect content from unauthorized access. Image encryption is usually done by pixel scrambling and confusion, so process is possible to reverse only by knowing secret information. In this paper we introduce a new method for digital image encryption, based on a 2D cellular automaton and pixel separation. Novelty in the proposed method lies in the application...

By a recent result of Livingston, it is known that if a knot has a prime power branched cyclic cover that is not a homology sphere, then there is an infinite family of nonconcordant knots having the same Seifert form as the knot. In this paper, we extend this result to the full extent. We show that if the knot has nontrivial Alexander polynomial, then there exists an infinite family of non-conc...

In the 1960s Indianapolis, Indiana’s near-Westside, was transformed by urban renewal projects that carved space for the Indiana University-Purdue University Indianapolis (IUPUI) campus out of a predominantly African-American neighborhood. Within two decades that longstanding community was totally displaced, and today the former neighborhood covering 300 acres is completely effaced and the commu...

Orthogonal Tensor Neighborhood Preserving Embedding (OTNPE) is an efficient dimensionality reduction algorithm for two-dimensional images. However, insufficiencies of the robustness performance and deficiencies of supervised discriminant information are remained. Motivated by the sparse learning, an algorithm called Orthogonal Tensor Sparse Neighborhood Embedding (OTSNPE) for two-dimensional im...

Many mathematical models, which try to capture emergent phenomena, are based on state transitions that depend on neighborhood relationships. Cellular Automata (CA) and Random Boolean Networks (RBN) are examples of such models, where connectivity patterns determine the flow of signals among interconnected units. Whereas neighborhoods in CA and RBNs remain static, the focus of our investigations ...

The design of course timetables for academic institutions is a very difficult job due to the huge number of possible feasible timetables with respect to the problem size. This process contains lots of constraints that must be taken into account and a large search space to be explored, even if the size of the problem input is not significantly large. Different heuristic approaches have been prop...

The main result is that, for any projective compact analytic subset Y of dimension q > 0 in a reduced complex space X , there is a neighborhood Ω of Y such that, for any covering space Υ: X̂ → X in which Ŷ ≡ Υ(Y ) has no noncompact connected analytic subsets of pure dimension q with only compact irreducible components, there exists a C∞ exhaustion function φ on X̂ which is strongly q-convex on Ω̂ ...