DSpace Collection: Volume 5 Number 2
http://hdl.handle.net/10525/1613
The Collection's search engineSearch the Channelsearch
http://sci-gems.math.bas.bg/jspui/simple-search
Processing of Byzantine Neume Notation in Ancient Historical Manuscripts
http://hdl.handle.net/10525/1619
Title: Processing of Byzantine Neume Notation in Ancient Historical Manuscripts<br/><br/>Authors: Laskov, Lasko<br/><br/>Abstract: Byzantine neume notation is a specific form of note script, usedby the Orthodox Christian Church since ancient times until nowadays forwriting music and musical forms in sacred documents. Such documents arean object of extensive scientific research and naturally with the developmentof computer and information technologies the need of a software tool whichcan assist these efforts is needed. In this paper a set of algorithms forprocessing and analysis of Byzantine neume notation are presented whichinclude document image segmentation, character feature vector extraction,classifier learning and character recognition. The described algorithms areimplemented as an integrated scientific software system.<br/><br/>Description: This article presents the principal results of the doctoral thesis “Recognition of neumenotation in historical documents” by Lasko Laskov (Institute of Mathematics and Informatics atBulgarian Academy of Sciences), successfully defended before the Specialized Academic Councilfor Informatics and Mathematical Modelling on 07 June 2010.Ontological Presentation of East-Christian Iconographical Art Domain
http://hdl.handle.net/10525/1618
Title: Ontological Presentation of East-Christian Iconographical Art Domain<br/><br/>Authors: Pavlova-Draganova, Lilia; Paneva-Marinova, Desislava; Pavlov, Radoslav<br/><br/>Abstract: In the recent years the East-Christian iconographical art workshave been digitized providing a large volume of data. The need for effectiveclassification, indexing and retrieval of iconography repositories was the motivation of the design and development of a systemized ontological structurefor description of iconographical art objects. This paper presents the ontology of the East-Christian iconographical art, developed to provide contentannotation in the Virtual encyclopedia of Bulgarian iconography multimedia digital library. The ontology’s main classes, relations, facts, rules, andproblems appearing during the design and development are described. Thepaper also presents an application of the ontology for learning analysis onan iconography domain implemented during the SINUS project “SemanticTechnologies for Web Services and Technology Enhanced Learning”.On the Mathematical Modelling of Microbial Growth: Some Computational Aspects
http://hdl.handle.net/10525/1617
Title: On the Mathematical Modelling of Microbial Growth: Some Computational Aspects<br/><br/>Authors: Markov, Svetoslav<br/><br/>Abstract: We propose a new approach to the mathematical modelling ofmicrobial growth. Our approach differs from familiar Monod type models byconsidering two phases in the physiological states of the microorganisms andmakes use of basic relations from enzyme kinetics. Such an approach maybe useful in the modelling and control of biotechnological processes, wheremicroorganisms are used for various biodegradation purposes and are oftenput under extreme inhibitory conditions. Some computational experimentsare performed in support of our modelling approach.Two-Language, Two-Paradigm Introductory Computing Curriculum Model and its Implementation
http://hdl.handle.net/10525/1616
Title: Two-Language, Two-Paradigm Introductory Computing Curriculum Model and its Implementation<br/><br/>Authors: Zanev, Vladimir; Radenski, Atanas<br/><br/>Abstract: This paper analyzes difficulties with the introduction of object-oriented concepts in introductory computing education and then proposes atwo-language, two-paradigm curriculum model that alleviates such difficulties. Our two-language, two-paradigm curriculum model begins with teaching imperative programming using Python programming language, continues with teaching object-oriented computing using Java, and concludes with teaching object-oriented data structures with Java.The Nonexistence of [132, 6, 86]3 Codes and [135, 6, 88]3 Codes
http://hdl.handle.net/10525/1615
Title: The Nonexistence of [132, 6, 86]3 Codes and [135, 6, 88]3 Codes<br/><br/>Authors: Oya, Yusuke<br/><br/>Abstract: We prove the nonexistence of [g3(6, d), 6, d]3 codes for d = 86, 87, 88, where g3(k, d) = ∑⌈d/3i⌉ and i=0 ... k−1. This determines n3(6, d) for d = 86, 87, 88, where nq(k, d) is the minimum length n for which an [n, k, d]q code exists.The Eccentric Connectivity Polynomial of some Graph Operations
http://hdl.handle.net/10525/1614
Title: The Eccentric Connectivity Polynomial of some Graph Operations<br/><br/>Authors: Ashrafi, A.; Ghorbani, M.; Hossein-Zadeh, M.<br/><br/>Abstract: The eccentric connectivity index of a graph G, ξ^C, was proposedby Sharma, Goswami and Madan. It is defined as ξ^C(G) =∑ u ∈ V(G) degG(u)εG(u), where degG(u) denotes the degree of the vertex xin G and εG(u) = Max{d(u, x) | x ∈ V (G)}. The eccentric connectivitypolynomial is a polynomial version of this topological index. In this paper, exact formulas for the eccentric connectivity polynomial of Cartesianproduct, symmetric difference, disjunction and join of graphs are presented.