Assessment  of  grammatical  knowledge  is  a  rather  neglected  area  of  research  in  the  field with  many  open  questions  (Purpura,  2004).  The  present  research  incorporates  recent proposals  about  the  nature  of  grammatical  development  to  create  a  framework  consisting of dimensions of complexity, range and strength, and studies which dimension(s) can best predict the stat...

8:00 9:00 Conference Registration 9:00 9:45 Conference Welcome 10:00 11:00 Keynote speech: prof. Jaroslav Pokorny How to store and process Big Data: are today's databases sufficient? 11:00 11:20 Coffee Break 11:20 13:00 Algorithms (Chair: Vaclav Snasel)  Tien Lu, Bay Vo, Hien T. Nguyen, and Tzung-Pei Hong A New Method for Mining High Average Utility Itemsets  Ivan Zelinka, Petr Saloun, and Ro...

This paper examines the evolution of terminology verb complements in official texts published France from 1910 to present day: first through analysis debates and discussions that accompanied elaboration grammatical nomenclature, then by study short medium term reception this inaugural text, finally comparison nomenclatures terminologies 1975 onwards. highlights contrary trends language teaching...

Intrusion detection on mobile ad hoc networks (MANETs) is difficult. This is because of their dynamic nature, the lack of central points, and their highly resource-constrained nodes. In this paper we explore the use of evolutionary computation techniques, particularly genetic programming and grammatical evolution, to evolve intrusion detection programs for such challenging environments. Cogniza...

Since their conception in 1975, Genetic Algorithms have been an extremely popular approach to find exact or approximate solutions to optimization and search problems. Over the last years there has been an enhanced interest in the field with related techniques, such as grammatical evolution, being developed. Unfortunately, work on developing genetic optimizations for low-end embedded architectur...

Hoare’s logic helps with program state descriptions, but is difficult to manipulate. Model checking emerged as a new trend in program verifications is best applied to system designs rather than implementations. This paper is committed to establish a component-based verification framework that combines both of them. The method applied consists of two steps: regarding predicates as states and con...

Several grammar-based genetic programming algorithms have been proposed in the literature to automatically generate heuristics for hard optimization problems. These approaches specify the algorithmic building blocks and the way in which they can be combined in a grammar; the best heuristic for the problem being tackled is found by an evolutionary algorithm that searches in the algorithm design ...

In order to automatically generate high-quality game levels, one needs to be able to automatically verify that the levels are playable. The simulation-based approach to playability testing uses an artificial agent to play through the level, but building such an agent is not always an easy task and such an agent is not always readily available. We discuss this problem in the context of the physi...

A new method that employs grammatical evolution and a stopping rule for finding the global minimum of a continuous multidimensional, multimodal function is considered. The genetic algorithm used is a hybrid genetic algorithm in conjunction with a local search procedure. We list results from numerical experiments with a series of test functions and we compare with other established global optimi...

The genotype and phenotype have been separated to make genetic manipulation simpler. Each program is represented as a xed-length integer array and then mapped onto Backus-Naur Form (BNF). The program statements used are shown in Figure 1a. The BNF is designed to minimise the size of the genome that describes a program. The mapping, between the genotype and phenotype, is similar to Grammatical E...