DSpace Collection: Volume 10 Number 1
http://hdl.handle.net/10525/2910
The Collection's search engineSearch the Channelsearch
http://sci-gems.math.bas.bg/jspui/simple-search
Conjugates for Finding the Automorphism Group and Isomorphism of Design Resolutions
http://hdl.handle.net/10525/2916
Title: Conjugates for Finding the Automorphism Group and Isomorphism of Design Resolutions<br/><br/>Authors: Topalova, Svetlana<br/><br/>Abstract: Consider a combinatorial design D with a full automorphism group G D.The automorphism group G of a design resolution R is a subgroup of G D.This subgroup maps each parallel class of R into a parallel class of R.Two resolutions R 1 and R 2 of D are isomorphic if some automorphismfrom G D maps each parallel class of R 1 to a parallel class of R 2. If G D isvery big, the computation of the automorphism group of a resolution and thecheck for isomorphism of two resolutions might be difficult.Such problems often arise when resolutions of geometric designs (the designs ofthe points and t-dimensional subspaces of projective or affine spaces) are considered.For resolutions with given automorphisms these problems can be solvedby using some of the conjugates of the predefined automorphisms.The method is explained in the present paper and an algorithm forconstruction of the necessary conjugates is presented.ACM Computing Classification System (1998): F.2.1, G.1.10, G.2.1.Fri, 01 Jan 2016 00:00:00 GMTAnalysis of Biochemical Mechanisms using Mathematica with Applications
http://hdl.handle.net/10525/2915
Title: Analysis of Biochemical Mechanisms using Mathematica with Applications<br/><br/>Authors: Kyurkchiev, Nikolay; Markov, Svetoslav; Mincheva, Maya<br/><br/>Abstract: Biochemical mechanisms with mass action kinetics are usually modeled assystems of ordinary differential equations (ODE) or bipartite graphs.We present a software module for the numerical analysis of ODE models ofbiochemical mechanisms of chemical species and elementary reactions(BMCSER) within the programming environment of CAS Mathematica.The module BMCSER also visualizes the bipartite graph of biochemicalmechanisms. Numerical examples, including a double phosphorylation model,are presented demonstrating the scientific applications and the visualizationproperties of the module.ACM Computing Classification System (1998): G.4.Fri, 01 Jan 2016 00:00:00 GMTEffectiveness of a Conceptual Model for Increased Mobile Banking Security
http://hdl.handle.net/10525/2914
Title: Effectiveness of a Conceptual Model for Increased Mobile Banking Security<br/><br/>Authors: Penchev, Bonimir<br/><br/>Abstract: Despite the advantages that mobile banking has for both banksand customers, its security level is one of the barriers that have a negativeinfluence on its large-scale adoption.In our previous research we identified a certain number of security attacks againstmobile banking security. Along with them, we found out that not all of the protectionstrategies and best practices are effective enough.Therefore we proposed a conceptual model for increased mobile banking security,which consists of five modules.In this report we aimed at researching the effectiveness of each of the proposedmodules. In order to achieve our objective we conducted five different experiments,each covering a module.The results confirmed the effectiveness and applicability of each of the five modulesthat are part of the proposed conceptual model for increased mobile banking security.ACM Computing Classification System (1998): K.4.4.Fri, 01 Jan 2016 00:00:00 GMTA Basic Result on the Theory of Subresultants
http://hdl.handle.net/10525/2913
Title: A Basic Result on the Theory of Subresultants<br/><br/>Authors: Akritas, Alkiviadis G.; Malaschonok, Gennadi I.; Vigklas, Panagiotis S.<br/><br/>Abstract: Given the polynomials f, g ∈ Z[x] the main result of our paper,Theorem 1, establishes a direct one-to-one correspondence between themodified Euclidean and Euclidean polynomial remainder sequences (prs’s) of f, gcomputed in Q[x], on one hand, and the subresultant prs of f, g computedby determinant evaluations in Z[x], on the other.An important consequence of our theorem is that the signs of Euclideanand modified Euclidean prs’s - computed either in Q[x] or in Z[x] -are uniquely determined by the corresponding signs of the subresultant prs’s.In this respect, all prs’s are uniquely "signed".Our result fills a gap in the theory of subresultant prs’s. In order to placeTheorem 1 into its correct historical perspective we present a brief historicalreview of the subject and hint at certain aspects that need - according toour opinion - to be revised.ACM Computing Classification System (1998): F.2.1, G.1.5, I.1.2.Fri, 01 Jan 2016 00:00:00 GMTA Method to Construct an Extension of Fuzzy Information Granularity Based on Fuzzy Distance
http://hdl.handle.net/10525/2912
Title: A Method to Construct an Extension of Fuzzy Information Granularity Based on Fuzzy Distance<br/><br/>Authors: Thien, Nguyen Van; Demetrovics, Janos; Thi, Vu Duc; Giang, Nguyen Long; Son, Nguyen Nhu<br/><br/>Abstract: In fuzzy granular computing, a fuzzy granular structure is the collection offuzzy information granules and fuzzy information granularity is used tomeasure the granulation degree of a fuzzy granular structure.In general, the fuzzy information granularity characterizes discernibility abilityamong fuzzy information granules in a fuzzy granular structure. In recent years,researchers have proposed some concepts of fuzzy information granularity basedon partial order relations. However, the existing forms of fuzzy information granularityhave some limitations when evaluating the fineness/coarseness between two fuzzygranular structures. In this paper, we propose an extension of fuzzy informationgranularity based on a fuzzy distance measure.We prove theoretically and experimentally that the proposed fuzzy informationgranularity is the best one to distinguish fuzzy granular structures.ACM Computing Classification System (1998): I.5.2, I.2.6.Fri, 01 Jan 2016 00:00:00 GMTQuasilinear Structures in Stochastic Arithmetic and their Application
http://hdl.handle.net/10525/2911
Title: Quasilinear Structures in Stochastic Arithmetic and their Application<br/><br/>Authors: Markov, Svetoslav; Alt, René; Lamotte, Jean-Luc<br/><br/>Abstract: Stochastic arithmetic has been developed as a model for computingwith imprecise numbers. In this model, numbers are representedby independent Gaussian variables with known mean value and standarddeviation and are called stochastic numbers.The algebraic properties of stochastic numbers have already been studied byseveral authors. Anyhow, in most life problems the variables are not independentand a direct application of the model to estimate the standard deviation onthe result of a numerical computation may lead to some overestimation ofthe correct value.In this work “quasilinear” algebraic structures based on standard stochastic arithmeticare studied and, from pure abstract algebraic considerations, new arithmetic operationscalled “inner stochastic addition and subtraction” are introduced.They appear to be stochastic analogues to the inner interval addition and subtractionused in interval arithmetic. The algebraic properties of these operations andthe involved algebraic structures are then studied.Finally, the connection of these inner operations to the correlation coefficient ofthe variables is developed and it is shown that they allow the computation withnon-independent variables. The corresponding methodology for the practicalapplication of the new structures in relation to problems analogous to “dependency problems”in interval arithmetic is given and some numerical experiments showing the interest ofthese new operations are presented.ACM Computing Classification System (1998): D.2.4, G.3, G.4.Fri, 01 Jan 2016 00:00:00 GMT