1 I n t r o d u c t i o n It is well known that the resistance of a product cipher to modern cryptanalytic attacks such as linear and differential cryptanalysis [10,1] depends critically upon the nonlinearity of the Boolean functions comprising the round function. Typically these functions must be balanced, so there is considerable interest in the design of highly nonlinear balanced Boolean fun...

In this study, we developed an appropriate calorie tracking algorithm for children and compared it with the current commercial product. The results of the developed algorithm showed 94.2% accuracy in the classification of intermittent activities: sitting down, standing up, turning around and jumping; and 92.9% accuracy in the classification of continuous activities: walking, running, stair clim...

Combinations of metaheuristics to solve highly constrained combinatorial optimisation problems have recently become a promising research area. Some combinations emerge from integrating evolutionary algorithms and local based algorithms to strike the right balance between global exploration of the search region and local exploitation of promising regions. This study presents hybridization betwee...

There are estimated to be on the order of 10 single nucleotide polymorphisms (SNPs) existing as standing variation in the human genome. Certain combinations of these SNPs can interact in complex ways to predispose individuals for a variety of common diseases, even though individual SNPs may have no ill effects. Detecting these epistatic combinations is a computationally daunting task. Trying to...

Classification Association Rule Mining (CARM) systems operate by applying an Association Rule Mining (ARM) method to obtain classification rules from a training set of previously-classified data. The rules thus generated will be influenced by the choice of ARM parameters employed by the algorithm (typically support and confidence threshold values). In this paper we examine the effect that this ...

We present a hill-climbing algorithm to solve planning problems with temporal uncertainty. First an optimistic plan that is valid when all actions complete quickly is found. Then temporal reasoning techniques are used to determine when the plan may fail. At time points that cause an unsafe situation, contingency branches are inserted. We describe our planner PHOCUS-HC, give preliminary results,...

Task reallocation in a multi-robot organization is a process that distributes a decomposed global task to individual robots. This process must be distributed and dynamic because it relies on critical information that can only be obtained during mission execution. This paper presents a representation for this challenging problem and proposes an algorithm that allows member robots to trade tasks ...

ACTIVEMATH is a web-based intelligent tutoring system (ITS) for studying mathematics. Its course generator, which assembles content to personalized books, strongly depends on the underlying student model. Therefore, a student model is important to make an ITS adaptive. The more accurate it is, the better could be the adaptation. Here we present which parameters can be optimized and how they can...

In this article, Hill Climbing (HC) and Estimation of Distribution Algorithm (EDA) are integrated to produce a hybrid intelligent algorithm for design of endlessly Single Mode Photonic Crystal Fibers (SMPCFs) structure with desired properties over the C communication band. In order to analyzing the fiber components, Finite Difference Frequency Domain (FDFD) solver is applied. In addition, a spe...

Our system for the Novelty Track at TREC 2004 looks beyond sentence boundaries as well as within sentences to identify novel, nonduplicative passages. It tries to identify text spans of two or more sentences that encompass mini-segments of new information. At the same time, we avoid any pairwise comparison of sentences, but rely on the presence of previously unseen terms to provide evidence of ...