This paper describes Parallel Grammatical Evolution (PGE) that can be together with clustering used for a improvement of the throughput of computer networks. To increase the efficiency of Grammatical Evolution (GE) the influence of backward processing was tested. The significance of backward coding (BC) and the comparison with standard coding of GEs is presented. BC can speed up Grammatical Evo...

The Markovian nature follows readily from a mechanistic view, where complete knowledge of a system and sufficient computational resources will allow us to determine the state of the system – or distribution over possible states for stochastic systems – at any given point in the future. Markovian need not progress in time, in fact, for many bioinformatics applications the progression will be in ...

The computation of a minimal separating automaton (MSA) for regular languages has been studied from many different points of view, from synthesis of automata or Grammatical Inference to the minimization of incompletely specified machines or Compositional Verification. In the general case, the problem is NP-complete, but this drawback does not prevent the problem from having a real application i...

We propose and test several computational methods to automatically determine possible saliency cut-off points in Sketch Engine (Kilgarriff and Tugwell, 2001). Sketch Engine currently displays collocations in descending importance, as well as according to grammatical relations. However, Sketch Engine does not provide suggestions for a cut-off point such that any items above this cut-off point ma...

6 This paper critically explores the question of what it means for a 7 construction to be grammatical. The paper engages with some of the 8 observations made in the grammaticalisation literature that elements in 9 grammatical constructions undergo morphologization, and aims to show 10 that grammatical status and morphologization need not be aligned. A 11 number of parameters along which the gra...

In an artificial grammar learning (AGL) experiment, participants were trained with instances of one grammatical structure before completing a test phase in which they were required to discriminate grammatical from randomly created strings. Importantly, the underlying structure used to generate test strings was different from that used to generate the training strings. Despite the fact that gram...

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...

We present a web-based interface that automatically assesses reading difficulty of Chinese texts. The system performs word segmentation, part-of-speech tagging and dependency parsing on the input text, and then determines the difficulty levels of the vocabulary items and grammatical constructions in the text. Furthermore, the system highlights the words and phrases that must be simplified or re...

in this paper, using the best proximity theorems for an extensionof brosowski's theorem. we obtain other results on farthest points. finally, wedene the concept of e- farthest points. we shall prove interesting relationshipbetween the -best approximation and the e-farthest points in normed linearspaces (x; ||.||). if z in w is a e-farthest point from an x in x, then z is also a-best ...

In this paper, we describe two methods developed for sharing linguistic data between two free and open source rule based machine translation systems: Apertium, a shallow-transfer system; and Grammatical Framework (GF), which performs a deeper syntactic transfer. In the first method, we describe the conversion of lexical data from Apertium to GF, while in the second one we automatically extract ...