This proof of concept study examines the possibility of specifying the construction of programs using a Particle Swarm algorithm, and represents a new form of automatic programming based on Social Learning, Social Programming or Swarm Programming. Each individual particle represents choices of program construction rules, where these rules are specified using a Backus-Naur Form grammar. The resu...

Starting from a clarification concerning the notion of distributed grammar engineering, we present options of distributed grammar engineering as are supported by the ALEP grammar development platform and as were instantiated in the LS-GRAM project. The notion of distributed grammar engineering being grounded in the concepts of grammar modularization and grammar module integration, we focus on A...

This study examines the potential of Grammatical Evolution to uncover a series of useful rules which can assist in predicting corporate failure using information drawn from financial statements. A sample of 178 publically quoted, failed and non-failed US firms, drawn from the period 1991 to 2000 are used to train and test the model. The preliminary findings indicate that the methodology has muc...

A proof is presented that shows that the number of directions determined by a function over a finite field GF (q) is either 1, at least (q+3)/2, or between q/s+1 and (q − 1)/(s − 1) for some s where GF (s) is a subfield of GF (q). Moreover the graph of those functions that determine less than half the directions is GF (s)−linear. This completes the unresolved cases s = 2 and s = 3 of the main t...

weight distribution of linear codes over GF (q l) having generator matrices over GF (q)," \New upper bound on the rate of a code via the Delsarte-MacWilliams inequalities," IEEE Trans.

the verb in russian language is a part of speech which involves several grammatical features. regarding methods of expressing the person, we can classify it in two major groups: personal verbs and non-personal verbs. the difference of these two groups is in their expression and inexpression of the person as a grammatical category. the purpose of this research is to consider ways of declaring th...

A partition u of [k] = f1; 2; : : : ; kg is contained in another partition v of [l] if [l] has a k-subset on which v induces u. We are interested in counting partitions v not containing a given partition u or a given set of partitions R. This concept is related to that of forbidden permutations. A strengthening of Stanley{Wilf conjecture is proposed. We prove that the GF counting v is rational ...