DSpace Collection: Volume 6 Number 3
http://hdl.handle.net/10525/1930
The Collection's search engineSearch the Channelsearch
http://sci-gems.math.bas.bg/jspui/simple-search
An Analysis of Colour Semantics in Art Images
http://hdl.handle.net/10525/1937
Title: An Analysis of Colour Semantics in Art Images<br/><br/>Authors: Ivanova, Krassimira<br/><br/>Abstract: The article briefly presents the results achieved by the PhD project R-1875 “Search in Art Image Collections Based on Colour Semantics”, Hasselt University, which finished successfully. The main goals of this work were to provide a detailed analysis of the colour theories, especially on existing interconnections in successful colour combinations, as well as to formalize them in order to implement automated extraction from digitized artworks.<br/><br/>Description: This article presents the principal results of the Ph.D. thesis A Novel Method for Content-Based Image Retrieval in Art Image Collections Utilizing Colour Semantics by KrassimiraIvanova (Institute of Mathematics and Informatics, BAS), successfully defended at Hasselt Uni-versity in Belgium, Faculty of Science, on 15 November 2011.Variable Neighborhood Search for the File Transfer Scheduling Problem
http://hdl.handle.net/10525/1936
Title: Variable Neighborhood Search for the File Transfer Scheduling Problem<br/><br/>Authors: Dražić, Zorica<br/><br/>Abstract: In this paper a file transfer scheduling problem is considered.This problem is known to be NP-hard, and thus provides a challenging areafor metaheuristics. A variable neighborhood search algorithm is designedfor the transfer scheduling of files between various nodes of a network, bywhich the overall transfer times are to be minimized. Optimality of VNSsolutions on smaller size instances has been verified by total enumeration.For several larger instances optimality follows from reaching the elementarylower bound of a problem.<br/><br/>Description: ACM Computing Classification System (1998): I.2.8, G.1.6.An Algorithmic Approach to Inferring Cross-Ontology Links while Mapping Anatomical Ontologies
http://hdl.handle.net/10525/1935
Title: An Algorithmic Approach to Inferring Cross-Ontology Links while Mapping Anatomical Ontologies<br/><br/>Authors: Petrov, Peter; Krachounov, Milko; van Ophuizen, Ernest; Vassilev, Dimitar<br/><br/>Abstract: Automated and semi-automated mapping and the subsequentlymerging of two (or more) anatomical ontologies can be achieved by (at least)two direct procedures.The first concerns syntactic matching between the terms of the two ontologies; in this paper, we call this direct matching (DM). It relies on identitiesbetween the terms of the two input ontologies in order to establish cross-ontology links between them.The second involves consulting one or more external knowledge sourcesand utilizing the information available in them, thus providing additionalinformation as to how terms (concepts) from the two input ontologies arerelated/linked to each other. Each of the two ontologies is aligned to an external knowledge source and links representing synonymy, is-a parent-child,and part-of parent-child relations, are drawn between the ontology and theknowledge source. These links are then run through a set of simple logicalrules in order to come up with cross-ontology links between the two inputontologies. This method is known as semantic matching. It proves useful<br/><br/>Description: ACM Computing Classification System (1998): J.3.A New Method for Computing the Eccentric Connectivity Index of Fullerenes
http://hdl.handle.net/10525/1934
Title: A New Method for Computing the Eccentric Connectivity Index of Fullerenes<br/><br/>Authors: Ghorbani, Modjtaba; Malekjani, Khadijeh<br/><br/>Abstract: The eccentric connectivity index of the molecular graph G, ξ^c (G), was proposed by Sharma, Goswami and Madan. It is defined asξ^c (G) = Σu∈V(G)degG(u) ecc(u), where degG(x) denotes the degree of the vertex x in G and ecc(u) = Max{d(x, u) | x ∈ V (G)}. In this paper this graph invariant is computed for an infinite class of fullerenes by means of group action.<br/><br/>Description: ACM Computing Classification System (1998): G.2.2, G.2.3.A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs
http://hdl.handle.net/10525/1933
Title: A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs<br/><br/>Authors: Markov, Minko; Ionut Andreica, Mugurel; Manev, Krassimir; Tapus, Nicolae<br/><br/>Abstract: We propose an algorithm that computes the length of a longestpath in a cactus graph. Our algorithm can easily be modified to output alongest path as well or to solve the problem on cacti with edge or vertexweights. The algorithm works on rooted cacti and assigns to each vertexa two-number label, the first number being the desired parameter of thesubcactus rooted at that vertex. The algorithm applies the divide-and-conquer approach and computes the label of each vertex from the labels of its children. The time complexity of our algorithm is linear in the number of vertices, thus improving the previously best quadratic time algorithm.<br/><br/>Description: ACM Computing Classification System (1998): G.2.2.Application of Service-Oriented Architecture in Software Quality Management
http://hdl.handle.net/10525/1932
Title: Application of Service-Oriented Architecture in Software Quality Management<br/><br/>Authors: Marinova, Olga<br/><br/>Abstract: This article examines the quality management software processes and offers a model for their automation based on Service-orientedArchitecture. The prerequisites for creating such a solution are analyzed, asare existing automated tools in this area. The possibilities of service-orientedarchitecture are presented along with its advantages in the context of thisresearch on developing a quality management system that will operate effectively against defined requirements, consistently and regardless of the used platform, database management system (DBMS) and other technological features of the applications.<br/><br/>Description: ACM Computing Classification System (1998): D.2.5, D.2.9, D.2.11.A Necessary and Sufficient Condition for the Existence of an (n,r)-arc in PG(2,q) and Its Applications
http://hdl.handle.net/10525/1931
Title: A Necessary and Sufficient Condition for the Existence of an (n,r)-arc in PG(2,q) and Its Applications<br/><br/>Authors: Hamada, Noboru; Maruta, Tatsuya; Oya, Yusuke<br/><br/>Abstract: Let q be a prime or a prime power ≥ 3. The purpose of thispaper is to give a necessary and sufficient condition for the existence ofan (n, r)-arc in PG(2, q ) for given integers n, r and q using the geometricstructure of points and lines in PG(2, q ) for n > r ≥ 3. Using the geometric method and a computer, it is shown that there exists no (34, 3) arc inPG(2, 17), equivalently, there exists no [34, 3, 31] 17 code.<br/><br/>Description: ACM Computing Classification System (1998): E.4.