A Method for Classification of Doubly Resolvable Designs and Its Application

This article presents the principal results of the Ph.D. thesis Investigation and classification of doubly resolvable designs by Stela Zhelezova (Institute of Mathematics and Informatics, BAS), successfully defended at the Specialized Academic Council for Informatics and Mathematical Modeling on 22 February 2010.

Distance Distributions and Energy of Designs in Hamming Spaces

We obtain new combinatorial upper and lower bounds for the potential energy of designs in q-ary Hamming space. Combined with results on reducing the number of all feasible distance distributions of such designs this gives reasonable good bounds. We compute and compare our lower bounds to recently obtained universal lower bounds. Some examples in the binary case are considered.

Parallel Class Intersection Matrices of Orthogonal Resolutions

This work was partially supported by the Bulgarian National Science Fund under Contract No MM 1405. Part of the results were announced at the Fifth International Workshop on Optimal Codes and Related Topics (OCRT), White Lagoon, June 2007, Bulgaria

Classification of Paintings by Artist, Movement, and Indoor Setting Using MPEG-7 Descriptor Features

ACM Computing Classification System (1998): I.4.9, I.4.10.

Наука и Изкуство: История на взаимно вдъхновение

Science and art are considered as two distinct areas in the spectrum of human activities. Many scientists are inspired by art and many artists embed science in their work. This paper presents a one-year experiment, which started with benchmark tests of a compiler, passed through dynamic systems based on complex numbers and ended as a scientific art exhibition. The paper demonstrates that it is possible to blend science and art in a mutually beneficial way. It also shows how science can inspire the creation of artistic works, as well as how these works can inspire further scientific research.

Orthogonal Resolutions and Latin Squares

Resolutions which are orthogonal to at least one other resolution (RORs) and sets of m mutually orthogonal resolutions (m-MORs) of 2-(v, k, λ) designs are considered. A dependence of the number of nonisomorphic RORs and m-MORs of multiple designs on the number of inequivalent sets of v/k − 1 mutually orthogonal latin squares (MOLS) of size m is obtained. ACM Computing Classification System (1998): G.2.1.

About the Concept "e-Panel"

Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, May, 2016