TAAC'2012, Section One: Computer Science and Software Engineering

Complex technical object (CTO) design is appeared the developed hierarchical structure with the large number of elements and internal connections. New information technologies (IT) which provide possibility of system approach and optimized design decisions are widely used in the CTO design. This article describes a methodology and features of graphs usage at the automatization of CTO design and its weight design domain.

The genetic algorithm proposed, its parameters defined and researched to solve optimal configurations searching problem for computing cluster with virtual machine nodes via dynamic cluster architecture reconfiguration; experimental data presented and approaches for genetic algorithm parameters quality evaluation suggested.

The paper introduces a new operating system named SamsonOS that intend to cover wide range of applications using non expensive low capabilities microcontrollers that provide multitasking and TCP/IP stack networking. It was developed from scratch as very small memory footprint not exceeding $8$Kb. Its successful work has been proven on real time application for automation of measuring in perfume industry.

Paper proposes software tool for automatic generation of autotuners --- special kind of applications to optimize running time of parallel applications in target computing environment. Traditional approach to autotuners creation is amplified by utilizing facilities of rule-based rewriting framework for code transformation purposes. Experimental results show effectiveness of this approach and exhibit ease of use of presented framework.

Various ways to describe the uncertain variable, namely: probabilistic presented by random variable; possibilistic presented by fuzzy variable and mixed presented by a fuzzy random variables. Apart from that some problem solutions are presented in which you can see the basic similarities and differences in the descriptive methods.

The paper highlights the question of the optimal GPU computers selection for kernels in OpenCL when they are starting on heterogeneous clusters where different types of GPU are used. The authors propose optimal GPU selection algorithm that helps to get the best efficiency while program execution using GPU.

Well-known Conway's Game of Life is usually played on the infinite plane board. We introduce it on finite surfaces without boundaries: the torus, the Klein bottle and the projective plane. An effective algorithm for the exhaustive search of stable and repeating patterns is suggested. We present patterns which have much longer periods of oscillating than patterns of the comparable size in the classic Game of Life.

The article describes the software platform, on the basis of which was created a distributed geo-information system, monitoring the roads of general assignments condition in Kherson region.

We present a solution for polynomial invariant generation problem for programs. We adopt iteration upper approximation method that was successfully applied on free algebras for polynomial algebras. Set of invariant is interpreted as an ideal over polynomial ring. Relationship, intersection problems solution are proposed. Intersection of Gr\"obner basis are used to solve intersection problem. Inverse obligatory is applied to solve relationship problem.

Algorithms are frequently taught procedural knowledge units in computer and humanitary education. Both design and implementation issues of a Task Oriented Environment for Constructing Algorithms are discussed in the paper. Its project mainly from the teacher's point of view is presented by means of use case, activity, and sequence diagrams. A subject-independent architecture is proposed consisting of standard and specialized tools, task base and students' models integrated in a data base. Implementation of the teacher's tool prototype in DELPHI 7.0 programming environment is described and illustrated by means of screenshots.

Genetic algorithm (GA) is a heuristic algorithm that use idea of natural evolution in order to solve optimization and search problems. One of the most popular selection method in GA is "Roulette wheel" method. Our approach use hybrid of this and Chromosome differential technique. In addition, switching between this two methods is dynamic. This paper contain research about efficiency of this method and examples of application.

This paper continues the previous one and discusses the learner’s support in the task-oriented environment for constructing algorithms. The common structure of the program and subprograms in ExerScript and AlgolScript languages is presented in the Bascus-Naur meta language. The focus of the paper is on an intelligent and adaptive algorithm for learner’s knowledge diagnostics and assessment respectively to the teacher’s performance. The student’s interface and the results of a preliminary study are given too.

This paper describes adequate mathematical model of cloud computing data center based on OpenFlow. The model represents cloud computing data center as weighted undirected graph. Its vertices are network devices including computing nodes, OpenFlow switches, data storages and OpenFlow controller. Edges represent network links between them. Proposed model can be used to implement efficient traffic routing schemes which localizes data flows between virtual machines in the groups, decreases network contention and increases overall cloud efficiency.

The system "Testing students' knowledge" was built. This system has the following features: easy to use, allows you not only to test students' knowledge, but also gives results for improvement the set of tests, has a relatively simple interface and doesn't require separate programs to work with databases (if your computer has Microsoft Office).

Mealy and Moore automata determined onto trajectories in some polynomially parametric variety in a finite ring are considered. Homomorphisms of investigated models are analyzed. Sets of deterministic and non-deterministic automata are characterized. Criteria for following sets of deterministic automata are established: group automata, automata with source-states, automata with flow-states, connected and strongly connected automata, automata with twins-states and automata with $1$-distinguishable states.

The rainbow connection number, $rc(G)$, of a connected graph $G$ is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which no two edges are colored the same. In this paper, we consider vertex version of the rainbow connection problem $rvc(G)$. We propose a new heuristic for the rainbow vertex connection and the algorithm is implemented in C++ language.

This paper describes the system of taxi service automation, which is based on the client-server model. Server represented as Web service. The client part is divided into two mobile applications for the Android OS: applications for the passenger and drivers. The server stores data about each vehicle and distributes orders between taxi drivers. Application for driver is used to accept orders and display the optimal route on the map. With the application for passenger customers can order a taxi.