Образованието по информатика и ролята на преподавателя в условията на безплатни електронни средства за обучение

Report published in the Proceedings of the National Conference on "Education in the Information Society", Plovdiv, May, 2013Open Educational Resources (OER) are a new phenomenon that may significantly impact higher education, and may even potentially lead to the disappearance of the occupation of university professor. On the other hand, OER have a number of advantages, including adaptive learning and an automatic analysis of the learning process data and thus improvement of the curriculum. The article examines the current state-of-art in education and the related problems. It brings reflections on the impact of the new means on the education in general and on the education in computer science and its specifics in Bulgaria, in particular.Association for the Development of the Information Society, Institute of Mathematics and Informatics Bulgarian Academy of Science

Big Data and Education in the Information Society

Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, June, 2017The big data issue is relatively recent. Under this term are meant data that cannot be processed with the traditional algorithms and software. There are many predictions that big data analysis will become necessary in every field of computer activity, as nowadays it is important to possess abilities to use computer and communication technology. The article discusses ways to educate specialists to analyze big data, with a focus on life-long learning, graduate, undergraduate, and secondary education.Association for the Development of the Information Society, Institute of Mathematics and Informatics Bulgarian Academy of Sciences, Plovdiv University "Paisii Hilendarski

A Class of Fibonacci Matrices, Graphs, and Games

In this paper, we define a class of Fibonacci graphs as graphs whose adjacency matrices are obtained by alternating binary Fibonacci words. We show that Fibonacci graphs are close in size to Turán graphs and that their size-stability tradeoff defined as the product of their size and stability number is very close to the maximum possible over all bipartite graphs. We also consider a combinatorial game based on sequential vertex deletions and show that the Fibonacci graphs are extremal regarding the number of rounds in which the game can terminate

A Class of Fibonacci Matrices, Graphs, and Games

In this paper, we define a class of Fibonacci graphs as graphs whose adjacency matrices are obtained by alternating binary Fibonacci words. We show that Fibonacci graphs are close in size to Turán graphs and that their size-stability tradeoff defined as the product of their size and stability number is very close to the maximum possible over all bipartite graphs. We also consider a combinatorial game based on sequential vertex deletions and show that the Fibonacci graphs are extremal regarding the number of rounds in which the game can terminate

Digital Geometry AlgorithmsTheoretical Foundations and Applications to Computational Imaging /

X, 430 p.online resource

Analytical properties of discrete planes

Some classes of medical images can be represented by meshes of discrete polygons that are portions of discrete planes, while the polygon edges are segments of discrete lines. Classically, the discrete planes and lines are defined algorithmically. While being quite satisfactory regarding various practical purposes, these definitions are not always easy to use for obtaining deep structural results. Moreover, storing big volumetric images might be problematic. This may happen, for instance, if a 3D object is represented “slicewisely ” (similar to the “Visible Human ” representation). Furthermore, sometimes it may be non-trivial to perform certain elementary image processing operations, such as verifying if a voxel (or a set of voxels) belong to a discrete plane, or to the intersection or the union of several discrete planes, etc. A promising approach which may help overcome some of the above mentioned difficulties is the one based on the analytical description of an object. In 1991 Reveilles proposed an analytical definition of a discrete straight line [1], which extends to a discrete plane. According to it, a discrete line L(a, b,   ¡, ) is the set of integer points satisfying a double linear Diophantine inequality of the form 0 ax + by +    ¥ ¤ ¢£ ¡ ¦. Here ¦ ¡ the ¤¨ § line with respect to is the arithmetic thickness of the line. Respectively, is an internal translation constant measuring the shift o