Institute of Mathematics and Informatics
Bulgarian Digital Mathematics Library at IMI-BASNot a member yet
3993 research outputs found
Sort by
Video Games for School Education
No full textReport published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, June, 2018The initial results from the implementation of the project APOGEE are presented. Its
goal is to create an open-source software platform to build adaptable, customisable according
to player 3D video maze-based games with intelligent virtual characters. The previous
experience on the subject has been examined and analysed. We conducted a study on the
needs of non-IT pedagogues on a platform for the easy generation of educational video games.
A structured interview was conducted among the users, in addition to an online survey of their
opinion on the key requirements to the platform and educational video games.Association for the Development of the Information Society, Institute of Mathematics and Informatics Bulgarian Academy of Sciences, Plovdiv University "Paisii Hilendarski
Nonoscillation, Asymptotic Properties and Stability of Second Order Delay Differential Equations
Get PDF2010 Mathematics Subject Classification: 34K11, 34K20, 34K25
A Fractional Inequality on Compact Manifolds and Lie Groups
Get PDF[Venkov George; Венков Георги]2010 Mathematics Subject Classification: 35B45, 53B20
Lagrange’s Bound on the Values of the Positive Roots of Polynomials
Get PDFIn this paper we present Lagrange's Joseph-Louis Lagrange,
born Giuseppe Lodovico Lagrangia (25 January 1736 - 10 April 1813):
Italian mathematician. theorem of 1767, for computing a bound on the
values of the positive roots of polynomials, along with its
interesting history and a short proof of it dating back to 1842. Since
the bound obtained by Lagrange's theorem is of linear complexity, in
the sequel it is called ''Lagrange Linear'', or LL for short.
Despite its average good performance, LL is endowed with the
weaknesses inherent in all bounds with linear complexity and,
therefore, the values obtained by it can be much bigger than those
obtained by our own bound ''Local Max Quadratic'', or LMQ for short.
To level the playing field, we incorporate Lagrange's theorem into our
LMQ and we present the new bound ''Lagrange Quadratic'',
or LQ for short, the quadratic complexity version of LL. It turns out that
LQ is one of the most efficient bounds available since, at best, the values
obtained by it are half of those obtained by LMQ.
Empirical results indicate that when LQ replaces LMQ
in the Vincent-Akritas-Strzeboński Continued Fractions
(VAS-CF) real root isolation method, the latter becomes
measurably slower for some classes of polynomials
Development of Mathematical Competences in Regression Models Through Metaprogramming in SAS
No full textReport published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, June, 2018Mathematics is a multi-faceted subject. People can develop competences which can
be grouped in two categories: competences concerning the ability to solve real world problems
by means of mathematical modeling and competences in the ability to use mathematical tools
through programming. This article describes an approach to discovering dependences based
on empirical data by means of linear regression models and metaprogramming in SAS.Association for the Development of the Information Society, Institute of Mathematics and Informatics Bulgarian Academy of Sciences, Plovdiv University "Paisii Hilendarski
In silico Prediction of C4-related Genes by Finding Duplications Causing Pattern Deviation and Comparative Analysis of Phylogenetic Trees
Get PDFThis study is focused on the development of a pattern-finding method for analyzing evolutionary trees to predict genes that may be involved in C4 photosynthesis. It relies on publicly available phylogenetic data which is processed with the authors’ own Python scripts and opensource software. The pattern recognition in the topology of the trees is an essential part of the process and the result is then validated by comparing the expression levels of the selected candidates. The same approach can be applied in studying the evolution of other important traits just by changing the type of pattern
A Simple Randomized 3-edge Connected Component Algorithm
Get PDFFinding the 3-edge connected components of a graph is a well-researched
problem for which many algorithms are known. In this paper, we present a new
linear-time randomized algorithm for the problem. To the best of our knowledge,
this is the first randomized algorithm for partitioning a graph into 3-edge connected
components. The algorithm is a composition of simple building blocks, it is easy to
understand and implement, and it has no corner cases
A Family of Recurrence Generated Parametric Functions Based on Volmer-Weber-Kaishew Activation Function
Get PDF[Kyurkchiev Nikolay; Кюркчиев Николай]The Volmer theory is correct in predicting a dependence of critical supersaturation on contact angle in heterogeneous nucleation. In this paper we consider dependence of supersaturation on contact angle by a family of recurrence generated parametric functions based on the Volmer–Weber–Kaishew activation function (VWKAF). 2010 Mathematics Subject Classification: 41A46
Challenges and Opportunities of Blockchain Technology in Industrial Applications
Get PDFDigital technology is changing the world, one industry at a time. It is still unclear if and to what extent the manufacturing industry is impacted by the innovative blockchain technology. Although a fairly new technology, it has many practical use cases and new applications of the technology are continuously introduced.
The paper presents an assessment of the current maturity phase of Blockchain and evaluates the challenges and benefits of potential applications in the manufacturing industry. Further the paper explores the potential use cases for the manufacturing industry by giving an overview of the existing blockchain solutions. Moreover, the highlights from the World Economic Forum 2017 are reported where a set of actions was given that will move this technology forward.
ACM Computing Classification System (1998): С.2.0, B.4.0, H.1.2, K.6.0
Learning Theories and Gamification in Education
No full textReport published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, June, 2018The reflection of core learning theories like behaviorism, cognitivism and
constructivism in the gamification in education is on the focus of the paper. The ethimology of
gamification and basic definitions are discussed. Comparative analysis of characteristics of
mentioned above learning theories and gamification is done. Similar and different
characteristics are outlined.Association for the Development of the Information Society, Institute of Mathematics and Informatics Bulgarian Academy of Sciences, Plovdiv University "Paisii Hilendarski