arXiv subjects

Iztok Fister Jr.

Publications and source records attributed to Iztok Fister Jr..

23 records · Page 2Linked to original sources

arXiv2012

Measuring Time in Sporting Competitions with the Domain-Specific Language EasyTime

Measuring time in mass sporting competitions is unthinkable manually today because of their long duration and unreliability. Besides, automatic timing devices based on the RFID technology have become cheaper. However, these devices cannot operate stand-alone. To work efficiently, they need a computer timing system for monitoring results. Such system should be capable of processing the incoming events, encoding and assigning results to a individual competitor, sorting results according to the achieved time and printing them. In this paper, a domain-specific language named EasyTime will be defined. It enables controlling an agent by writing events to a database. Using the agent, the number of measuring devices can be reduced. Also, EasyTime is of a universal type that can be applied to many different sporting competitions

cs.PL↗

arXiv2012

Upgrading EasyTime: from a textual to a visual language

Measuring time in mass sports competitions is usually performed using expensive measuring devices. Unfortunately, these solutions are not acceptable by many organizers of sporting competitions. In order to make the measuring time as cheap as possible, the domain-specific language (DSL) EasyTime was proposed. In practice, it has been proven to be universal, flexible, and efficient. It can even reduce the number of required measuring devices. On the other hand, programming in EasyTime is not easy, because it requires a domain-expert to program in a textual manner. In this paper, the domain-specific modeling language (DSML) EasyTime II is proposed, which simplifies the programming of the measuring system. First, the DSL EasyTime domain analysis is presented. Then, the development of DSML is described in detail. Finally, the DSML was tested by regular organizers of a sporting competition. This test showed that DSML can be used by end-users without any previous programming knowledge.

cs.PL↗

arXiv2012

Implementation of EasyTime Formal Semantics using a LISA Compiler Generator

A manual measuring time tool in mass sporting competitions would not be imaginable nowadays, because many modern disciplines, such as IRONMAN, last a long-time and, therefore, demand additional reliability. Moreover, automatic timing-devices based on RFID technology, have become cheaper. However, these devices cannot operate as stand-alone because they need a computer measuring system that is capable of processing incoming events, encoding the results, assigning them to the correct competitor, sorting the results according to the achieved times, and then providing a printout of the results. This article presents the domain-specific language EasyTime, which enables the controlling of an agent by writing the events within a database. It focuses, in particular, on the implementation of EasyTime with a LISA tool that enables the automatic construction of compilers from language specifications, using Attribute Grammars.

cs.PL↗

arXiv2012

Memetic Artificial Bee Colony Algorithm for Large-Scale Global Optimization

Memetic computation (MC) has emerged recently as a new paradigm of efficient algorithms for solving the hardest optimization problems. On the other hand, artificial bees colony (ABC) algorithms demonstrate good performances when solving continuous and combinatorial optimization problems. This study tries to use these technologies under the same roof. As a result, a memetic ABC (MABC) algorithm has been developed that is hybridized with two local search heuristics: the Nelder-Mead algorithm (NMA) and the random walk with direction exploitation (RWDE). The former is attended more towards exploration, while the latter more towards exploitation of the search space. The stochastic adaptation rule was employed in order to control the balancing between exploration and exploitation. This MABC algorithm was applied to a Special suite on Large Scale Continuous Global Optimization at the 2012 IEEE Congress on Evolutionary Computation. The obtained results the MABC are comparable with the results of DECC-G, DECC-G*, and MLCC.

cs.NE↗

arXiv2012

A Hybrid Artificial Bee Colony Algorithm for Graph 3-Coloring

The Artificial Bee Colony (ABC) is the name of an optimization algorithm that was inspired by the intelligent behavior of a honey bee swarm. It is widely recognized as a quick, reliable, and efficient methods for solving optimization problems. This paper proposes a hybrid ABC (HABC) algorithm for graph 3-coloring, which is a well-known discrete optimization problem. The results of HABC are compared with results of the well-known graph coloring algorithms of today, i.e. the Tabucol and Hybrid Evolutionary algorithm (HEA) and results of the traditional evolutionary algorithm with SAW method (EA-SAW). Extensive experimentations has shown that the HABC matched the competitive results of the best graph coloring algorithms, and did better than the traditional heuristics EA-SAW when solving equi-partite, flat, and random generated medium-sized graphs.

cs.NE↗