DSpace Collection: Volume 3 Number 1
http://hdl.handle.net/10525/326
The Collection's search engineSearch the Channelsearch
http://sci-gems.math.bas.bg/jspui/simple-search
A Note on the “Constructing” of Nonstationary Methods for Solving Nonlinear Equations with Raised Speed of Convergence
http://hdl.handle.net/10525/364
Title: A Note on the “Constructing” of Nonstationary Methods for Solving Nonlinear Equations with Raised Speed of Convergence<br/><br/>Authors: Kyurkchiev, Nikolay; Iliev, Anton<br/><br/>Abstract: In this paper we give methodological survey of “contemporary methods” for solving the nonlinear equation f(x) = 0. The reason forthis review is that many authors in present days rediscovered such classical methods. Here we develop one methodological schema for constructing nonstationary methods with a preliminary chosen speed of convergence.<br/><br/>Description: This paper is partially supported by project ISM-4 of Department for Scientific Research,“Paisii Hilendarski” University of Plovdiv.Hausdorff Distances for Searching in Binary Text Images
http://hdl.handle.net/10525/363
Title: Hausdorff Distances for Searching in Binary Text Images<br/><br/>Authors: Andreev, Andrey; Kirov, Nikolay<br/><br/>Abstract: Hausdorff distance (HD) seems the most efficient instrumentfor measuring how far two compact non-empty subsets of a metric space arefrom each other. This paper considers the possibilities provided by HD andsome of its modifications used recently by many authors for resemblancebetween binary text images. Summarizing part of the existing word imagematching methods, relied on HD, we investigate a new similar parameterizedmethod which contains almost all of them as particular cases. Numericalexperiments for searching words in binary text images are carried out with333 pages of old Bulgarian typewritten text, 200 printed pages of BulgarianChrestomathy from year 1884, and 200 handwritten pages of Slavonic manuscriptfrom year 1574. They outline how the parameters must be set in orderto use the advantages of the proposed method for the purposes of wordmatching in scanned document images.<br/><br/>Description: This work has been partially supported by Grant No. DO 02-275, 16.12.2008, BulgarianNSF, Ministry of Education and Science.Isomerism as Manifestation of Intrinsic Symmetry of Molecules: Lunn–Senior’s Theory
http://hdl.handle.net/10525/362
Title: Isomerism as Manifestation of Intrinsic Symmetry of Molecules: Lunn–Senior’s Theory<br/><br/>Authors: Iliev, Valentin<br/><br/>Abstract: This paper is an extended review of our doctoral thesis “Isomerism as Intrinsic Symmetry of Molecules” in which we present, continue,generalize, and trace out Lunn–Senior’s theory of isomerism in organic chemistry.<br/><br/>Description: This article presents the principal results of the doctoral thesis “Isomerism as internal symmetry of molecules” by Valentin Vankov Iliev (Institute of Mathematics and Informatics), successfully defended before the Specialised Academic Council for Informatics and MathematicalModelling on 15 December, 2008.On some Optimal (n,t,1,2) and (n,t,1,3) Super Imposed Codes
http://hdl.handle.net/10525/361
Title: On some Optimal (n,t,1,2) and (n,t,1,3) Super Imposed Codes<br/><br/>Authors: Manev, Mladen<br/><br/>Abstract: One of the main problems in the theory of superimposed codesis to find the minimum length N for which an (N, T,w, r) superimposedcode exists for given values of T , w and r. Let N(T,w, r) be the minimumlength N for which an (N, T,w, r) superimposed code exists. The (N, T,w, r)superimposed code is called optimal when N = N(T,w, r). The values ofN(T, 1, 2) are known for T ≤ 12 and the values of N(T, 1, 3) are knownfor T ≤ 20. In this work the values of N(T, 1, 2) for 13 ≤ T ≤ 20 andthe value of N(21, 1, 3) are obtained. The optimal superimposed codes withparameters (9, 10, 1, 2), (10, 13, 1, 2), (11, 14, 1, 2), (11, 15, 1, 2), (11, 16, 1, 2)and (11, 17, 1, 2) are classified up to equivalence. The optimal (N, T, 1, 3)superimposed codes for T ≤ 20 are classified up to equivalence.<br/><br/>Description: Partially supported by the Technical University of Gabrovo under Grant C-801/2008Solving Ratio-Dependent Predator-Prey System with Constant Effort Harvesting using Variational Iteration Method
http://hdl.handle.net/10525/360
Title: Solving Ratio-Dependent Predator-Prey System with Constant Effort Harvesting using Variational Iteration Method<br/><br/>Authors: Barari, A.; Ghotbi, Abdoul R.; Omidvar, M.; Ganji, D. D.<br/><br/>Abstract: Due to wide range of interest in use of bio-economic modelsto gain insight into the scientific management of renewable resources likeﬁsheries and forestry,variational iteration method (VIM) is employed toapproximate the solution of the ratio-dependent predator-prey system withconstant eﬀort prey harvesting.The results are compared with the resultsobtained by Adomian decomposition method and reveal that VIM is veryeﬀective and convenient for solving nonlinear differential equations.