bluuebunny/crossref_metadata_2025 huggingface dataset:
Current Global Perspectives on the Pharmacotherapy of Helicobacter Pylori Infection: Therapeutic Implications for Sub-saharan Africa
Authors: Ezeala Christian Chinyere , Akapelwa Tumelo Muyenga
Published: November 2022

Helicobacter pylori is associated with many clinical conditions including gastric and extra-gastric pathologies. Prevalence is high in most Sub-Saharan African countries where data is available.Its association with diseases is not fully established in the region. Due to emergence of antibiotic resistance, the conventional triple and quadruple therapies using proton pump inhibitors and antimicrobial agents are now obsolete. Many Western countries have revised their therapeutic guidelines with a common recommendation to determine prior patient exposure to antibiotics, determine local drug resistance patterns and eradication rates, use higher doses of  proton pump inhibitors, and include bismuth sub-citrate if clarithromycin resistance is suspected. Sub-Saharan African countries lack data on these making it difficult to apply these recommendations. The countries in Sub-Saharan Africa need to recognize the growing clinical importance of H. pylori and initiate programs to determine its local epidemiology, drug resistance, and its association with diseases in the region. Collaborative effort is required to achieve these goals and establishment of regional reference laboratories for monitoring drug resistance may be helpful.
Amitraz poisoning – A case report of a common but highly misconstrued cause of poisoning in Zambia
Authors: Mutengo Katongo Hope , Chiyenu Kaseya OR , Mutete Frighton Brighton , Bweupe Nicola
Published: November 2022

Amitraz is a widely available insecticide but whose human poisoning is highly under-recognized and mistaken for organophosphate poisoning. As a result, it is often mismanaged possibly resulting in suboptimal clinical outcomes. We present a case of a 55-year-old man who ingested Amitraz pesticide 3 hours prior to admission following a suicide attempt.His clinical condition rapidly deteriorated necessitating admission to the Intensive Care Unit. As there is no known effective antidote for human Amitraz poisoning in current medical practice, he was managed supportively but with excellent clinical outcome. Despite the lack of an effective antidote for human Amitraz poisoning, appropriatesupportive management yields excellent clinical outcomes. However, misdiagnosis and incorrect treatment may result in severe effects on the body systems causing coma and respiratory failure which often yields fatal outcome especially in resource limited settings like Zambia.
血液与神志关系剖析
Authors:   北京中医药大学, 孟 红林
Published: November 2022

中医认为心主神志，西医认为脑主神志。本文专注剖析血液对神志的影响。本文基于古今医学文献以及临床实例论证血液对神志的影响，并进行分析，探讨血液影响神志的临床意义。通过对文献的分析，以及基于对生理和病理的分析，加上对疾病的诊断与治疗，以及中医理法方药的分析与论证，本文认为“血主神志”具有一定的道理。
Non-Neoplastic Disorders of the Endocrine System
Authors: Gill Anthony J. , Erickson Lori A. , Fuchs Talia L.
Published: November 2022

In endocrine pathology, surgical pathologists often concentrate on neoplasms at the expense of non-neoplastic disease processes. This is unfortunate as non-neoplastic endocrine disorders are many times more common in the population. As in all fields of medicine, non-neoplastic endocrine diseases can closely mimic the neoplastic; an awareness of all aspects of pathology underpins routine clinical practice. This 5th Series Fascicle offers pathologists and clinicians an opportunity to develop an increased understanding of nontumor endocrine pathology in order to inform patient care.
Syntagme qualificatif en akwá, langue bantu (C22) parlée en République du Congo
Authors:   Université Marien Ngouabi, Congo, Gombé-Apondza Guy-Roger Cyriac
Published: November 2022

The present work describes, based on European structuralism, the qualifying phrase in Akwá, a language classified by the linguistic literature in zone C and group C20. The qualifying phrase is obviously a phrase with qualifying determination, fundamentally constituted around two elements, which are the qualified, and the qualifying. Depending on whether it is unmarked or marked, this syntagm can be made up of elements, which follow one another without a relator or can belinked to one another by means of a copula verb or a functional of the prepositive type. Keywords: phrase, qualifying phrase, qualified, qualifying, akwá.
Analysis of the Distributions of Color Characteristics in Art Painting Images
Authors: Ivanova Krassimira , Stanchev Peter L. , Dimitrov Boyan
Published: November 2022

In this paper we study some of the characteristics of the art painting image color semantics. We analyze the color features of differ- ent artists and art movements. The analysis includes exploration of hue, saturation and luminance. We also use quartile’s analysis to obtain the dis- tribution of the dispersion of defined groups of paintings and measure the degree of purity for these groups. A special software system “Art Paint- ing Image Color Semantics” (APICSS) for image analysis and retrieval was created. The obtained result can be used for automatic classification of art paintings in image retrieval systems, where the indexing is based on color characteristics.
Efficient Computing of some Vector Operations over GF(3) and GF(4)
Authors: Bouyukliev Iliya , Bakoev Valentin
Published: November 2022

The problem of efficient computing of the affine vector operations (addition of two vectors and multiplication of a vector by a scalar over GF (q)), and also the weight of a given vector, is important for many problems in coding theory, cryptography, VLSI technology etc. In this paper we propose a new way of representing vectors over GF (3) and GF (4) and we describe an efficient performance of these affine operations. Computing weights of binary vectors is also discussed.
On the Asymptotic Behavior of the Ratio between the Numbers of Binary Primitive and Irreducible Polynomials
Authors: Borissov Yuri , Ho Lee Moon , Nikova Svetla
Published: November 2022

In this paper, we study the ratio θ(n) = λ2 (n) / ψ2 (n), where λ2 (n) is the number of primitive polynomials and ψ2 (n) is the number of irreducible polynomials in GF (2)[x] of degree n. Let n = ∏ pi^ri, i=1,..l be the prime factorization of n. We show that, for fixed l and ri , θ(n) is close to 1 and θ(2n) is not less than 2/3 for sufficiently large primes pi . We also describe an infinite series of values ns such that θ(ns ) is strictly less than 1/2.
Essential Arity Gap of Boolean Functions
Authors: Shtrakov Slavcho
Published: November 2022

In this paper we investigate the Boolean functions with maximum essential arity gap. Additionally we propose a simpler proof of an important theorem proved by M. Couceiro and E. Lehtonen in [3]. They use Zhegalkin’s polynomials as normal forms for Boolean functions and describe the functions with essential arity gap equals 2. We use to instead Full Conjunctive Normal Forms of these polynomials which allows us to simplify the proofs and to obtain several combinatorial results concerning the Boolean functions with a given arity gap. The Full Conjunctive Normal Forms are also sum of conjunctions, in which all variables occur.
The Computational Analysis of Bulgarian Dialect Pronunciation
Authors: Prokić Jelena , Nerbonne John , Zhobov Vladimir , Osenova Petya , Simov Kiril , Zastrow Thomas , Hinrichs Erhard
Published: November 2022

The paper presents a computational analysis of Bulgarian dialect variation, concentrating on pronunciation differences. It describes the phonetic data set compiled during the project* ‘Measuring Linguistic Unity and Diversity in Europe’ that consists of the pronunciations of 157 words collected at 197 sites from all over Bulgaria. We also present the results of analyzing this data set using various quantitative methods and compare them to the traditional scholarship on Bulgarian dialects. The results have shown that various dialectometrical techniques clearly identify east-west division of the country along the ‘jat’ border, as well as the third group of varieties in the Rodopi area. The rest of the groups specified in the traditional atlases either were not confirmed or were confirmed with a low confidence.
Quadratic Time Computable Instances of MaxMin and MinMax Area Triangulations of Convex Polygons
Authors: Mirzoev Tigran , Vassilev Tzvetalin S.
Published: November 2022

We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programming in cubic time [2]. Later, Keil and Vassilev devised an algorithm that runs in O(n^2 log n) time [1]. In this paper we describe new geometric findings on the structure of MaxMin and MinMax Area triangulations of convex polygons in two dimensions and their algorithmic implications. We improve the algorithm’s running time to quadratic for large classes of convex polygons. We also present experimental results on MaxMin area triangulation.
Generalized Priority Systems. Analytical Results and Numerical Algorithms
Authors: Mishkoy Gheorghe
Published: November 2022

A class of priority systems with non-zero switching times, referred as generalized priority systems, is considered. Analytical results regarding the distribution of busy periods, queue lengths and various auxiliary characteristics are presented. These results can be viewed as generalizations of the Kendall functional equation and the Pollaczek-Khintchin transform equation, respectively. Numerical algorithmsfor systems’ busy periods and traffic coefficients are developed.ACM Computing Classification System (1998): 60K25.
Representing Equivalence Problems for Combinatorial Objects
Authors: Bouyukliev Iliya , Dzhumalieva-Stoeva Mariya
Published: November 2022

Methods for representing equivalence problems of various combinatorial objectsas graphs or binary matrices are considered. Such representations can be used for isomorphism testing in classification or generation algorithms. Often it is easier to consider a graph or a binary matrix isomorphism problem than to implement heavy algorithms depending especially on particular combinatorialobjects. Moreover, there already exist well tested algorithms for the graph isomorphismproblem (nauty) and the binary matrix isomorphism problem as well (Q-Extension).ACM Computing Classification System (1998): F.2.1, G.4.
An Adaptation of the Hoshen-Kopelman Cluster Counting Algorithm for Honeycomb Networks
Authors: Popova Hristina
Published: November 2022

We develop a simplified implementation of the Hoshen-Kopelman cluster countingalgorithm adapted for honeycomb networks.In our implementation of the algorithm we assume that all nodes in the networkare occupied and links between nodes can be intact or broken. The algorithm counts how many clusters there are in the network and determineswhich nodes belong to each cluster. The network information is stored intotwo sets of data. The first one is related to the connectivity of the nodes andthe second one to the state of links. The algorithm finds all clusters in onlyone scan across the network and thereafter cluster relabeling operates on avector whose size is much smaller than the size of the network. Countingthe number of clusters of each size, the algorithm determines the clustersize probability distribution from which the mean cluster size parameter canbe estimated. Although our implementation of the Hoshen-Kopelman algorithmworks only for networks with a honeycomb (hexagonal) structure, itcan be easily changed to be applied for networks with arbitrary connectivitybetween the nodes (triangular, square, etc.).The proposed adaptation of  the Hoshen-Kopelman cluster counting algorithmis applied to studying the thermal degradation of a graphene-like honeycombmembrane by means of Molecular Dynamics simulation with a Langevin thermostat.ACM Computing Classification System (1998): F.2.2, I.5.3.
VisibleZ: A Mainframe Architecture Emulator for Computing Education
Authors: Woolbright David , Zanev Vladimir , Rogers Neal
Published: November 2022

This paper describes a PC-based mainframe computer emulatorcalled VisibleZ and its use in teaching mainframe Computer Organizationand Assembly Programming classes. VisibleZ models IBM’s z/Architectureand allows direct interpretation of mainframe assembly language objectcode in a graphical user interface environment that was developed in Java.The VisibleZ emulator acts as an interactive visualization tool to simulateenterprise computer architecture. The provided architectural componentsinclude main storage, CPU, registers, Program Status Word (PSW), andI/O Channels. Particular attention is given to providing visual clues tothe user by color-coding screen components, machine instruction execution,and animation of the machine architecture components. Students interact with VisibleZ by executing machine instructions in a step-by-stepmode, simultaneously observing the contents of memory, registers, and changes inthe PSW during the fetch-decode-execute machine instruction cycle. Theobject-oriented design and implementation of VisibleZ allows students todevelop their own instruction semantics by coding Java for existing specificz/Architecture machine instructions or design and implement new machineinstructions. The use of VisibleZ in lectures, labs, and assignments is describedin the paper and supported by a website that hosts an extensivecollection of related materials. VisibleZ has been proven a useful tool inmainframe Assembly Language Programming and Computer Organizationclasses. Using VisibleZ, students develop a better understanding of mainframe concepts, components, and how the mainframe computer works.ACM Computing Classification System (1998): C.0, K.3.2.
An Approach for a more Objective Evaluation of Practical Projects, Used in the Training Process
Authors: Delinov Emil , Eskenazi Avram
Published: November 2022

Well–prepared, adaptive and sustainably developing specialistsare an important competitive advantage, but also one of the main challengesfor businesses. One option of the education system for creation and development of staff adequate to the needs is the development of pro jects withtopics from real economy ("Practical Projects"). The objective assessment is an essential driver and motivator, and is based ona system of well-chosen, well-defined and specific criteria and indicators. An approach to a more objective evaluation of practical projects is finding moreobjective weights of the criteria.A natural and reasonable approach is the accumulation of opinions of proven experts and subsequent bringing out the weights from the accumulated data.The preparation and conduction of a survey among recognized experts in the fieldof project-based learning in mathematics, informatics and information technologiesis described. The processing of the data accumulated by applying AHP, allowed usto objectively determine weights of evaluation criteria and hence to achieve the desired objectiveness.ACM Computing Classification System (1998): K.3.2.
Three New Methods for Computing Subresultant Polynomial Remainder Sequences (PRS’S)
Authors: Akritas Alkiviadis
Published: November 2022

Given the polynomials f, g ∈ Z[x] of degrees n, m, respectively,with n > m, three new, and easy to understand methods — along withthe more efficient variants of the last two of them — are presented for thecomputation of their subresultant polynomial remainder sequence (prs).All three methods evaluate a single determinant (subresultant) of anappropriate sub-matrix of sylvester1, Sylvester’s widely known and usedmatrix of 1840 of dimension (m + n) × (m + n), in order to compute thecorrect sign of each polynomial in the sequence and — except for the secondmethod — to force its coefficients to become subresultants.Of interest is the fact that only the first method uses pseudo remainders. The second method uses regular remainders and performs operationsin Q[x], whereas the third one triangularizes sylvester2, Sylvester’s littleknown and hardly ever used matrix of 1853 of dimension 2n × 2n.All methods mentioned in this paper (along with their supporting functions) have been implemented in Sympy and can be downloaded from the link http://inf-server.inf.uth.gr/~akritas/publications/subresultants.py
An Algorithm to Mine Normalized Weighted Sequential Patterns Using a Prefix-projected Database
Authors: Demetrovics János , Thi Vu Duc , Duong Tran Huy
Published: November 2022

Sequential pattern mining is an important subject in data mining with broad applications in many different areas. However, previous sequential mining algorithms mostly aimed to calculate the number of occurrences (the support) without regard to the degree of importance of different data items. In this paper, we propose to explore the search space of subsequences with normalized weights. We are not only interested in the numberof occurrences of the sequences (supports of sequences), but also concernedabout importance of sequences (weights). When generating subsequencecandidates we use both the support and the weight of the candidates whilemaintaining the downward closure property of these patterns which allowsto accelerate the process of candidate generation.
On the Remainders Obtained in Finding the Greatest Common Divisor of Two Polynomials
Authors: Akritas Alkiviadis G. , Malaschonok Gennadi I. , Vigklas Panagiotis S.
Published: November 2022

In 1917 Pell (1) and Gordon used sylvester2, Sylvester’s littleknown and hardly ever used matrix of 1853, to compute(2)the coefficients of a Sturmian remainder — obtained in applying in Q[x], Sturm’s algorithm on two polynomials f, g ∈ Z[x] of degree n — in terms of the determinants (3) of the corresponding submatrices of sylvester2. Thus, they solved a problem that had eluded both J. J. Sylvester, in 1853,and E. B. Van Vleck, in 1900. (4)In this paper we extend the work by Pell and Gordon and show how to compute (2)the coefficients of an Euclidean remainder — obtained in finding in Q[x], the greatest common divisor of f, g ∈ Z[x] of degree n — in terms of the determinants (5) of the corresponding submatrices of sylvester1,Sylvester’s widely known and used matrix of 1840.(1) See the link http://en.wikipedia.org/wiki/Anna_Johnson_Pell_Wheeler for her biography(2) Both for complete and incomplete sequences, as defined in the sequel.(3) Also known as modified subresultants.(4) Using determinants Sylvester and Van Vleck were able to compute the coefficients of Sturmian remainders only for the case of complete sequences.(5) Also known as (proper) subresultants.
Distance Distributions and Energy of Designs in Hamming Spaces
Authors: Boyvalenkov Peter , Marinova Tanya , Stoyanova Maya , Sukalinska Mila
Published: November 2022

We obtain new combinatorial upper and lower bounds for thepotential energy of designs in q-ary Hamming space. Combined with resultson reducing the number of all feasible distance distributions of such designsthis gives reasonable good bounds. We compute and compare our lowerbounds to recently obtained universal lower bounds. Some examples in thebinary case are considered.
On the Time Complexity of the Problem Related to Reducts of Consistent Decision Tables
Authors: Demetrovics János , Thi Vu Duc , Giang Nguyen Long , Duong Tran Huy
Published: November 2022

In recent years, rough set approach computing issues concerning reducts of decision tables have attracted the attention of many researchers. In this paper, we present the time complexity of an algorithmcomputing reducts of decision tables by relational database approach. LetDS = (U, C ∪ {d}) be a consistent decision table, we say that A ⊆ C is arelative reduct of DS if A contains a reduct of DS. Let s = be a relation schema on the attribute set C ∪ {d}, we say that A ⊆ C isa relative minimal set of the attribute d if A contains a minimal set of d.Let Qd be the family of all relative reducts of DS, and Pd be the family ofall relative minimal sets of the attribute d on s. We prove that the problem whether Qd ⊆ Pd is co-NP-complete. However, the problem whether Pd ⊆ Qd is in P .
Human Impact Factor in the Research and Development of Educational Software
Authors: Boytchev Pavel
Published: November 2022

This paper presents the long-term impact factor which a singleperson may have on a researcher. This is a description of the author’sresearch topics and the creation of educational software, which were eitherdirectly or indirectly affected by Prof. Edward Friedman.ACM Computing Classification System (1998): A.0, D.2.6, I.3.4, I.6.8, J.2, J.6, K.3.1.
Extending the Class of Mathematical Problems Solvable in School
Authors: Kenderov Petar S. , Chehlarova Toni K.
Published: November 2022

The problems of practical importance which are considered in school today necessarily have to lead to a mathematical model that can be solved by school mathematics knowledge. This includes systems of equations of at most second degree, some simple trigonometry and/or some basic geometry.This restricts severely the class of such problems and conveys theimpression that mathematics is not applicable enough. We provide examples ofproblems related to practice which are difficult to solve by means of traditional schoolmathematics but are amenable for solving (at least with a certain precision) with the use of software systems dealing with mathematical problems.We also present the results of an experiment with such problems that were given toschool students participating in the second round of the competition “VIVA Mathematics with Computer”.ACM Computing Classification System (1998): K.3.1.
On Learning in a Smart City Environment
Authors: Nikolov Roumen , Shoikova Elena , Krumova Milena , Kovatcheva Eugenia , Dimitrov Velian , Chikalanov Alexander
Published: November 2022

Advances in technology in recent years have changed the learningbehaviours of learners and reshaped teaching methods and learningenvironments. This paper overviews a foundational framework and providesmodels for planning and implementing smart learning environments. Gartner’s 2015 Hype Cycle for Emerging Technologies identifies the computinginnovations such as Internet of Things, Advanced Analytics, Machine Learning,Wearables, etc., that organisations should monitor. Learners and students, being the future drivers of these industries, are the main human resource tofulfil the vacancies of these work forces. Constant improvements and re-evaluationof the curriculum has to be done regularly to keep the learners up-to-date inmeeting the requirements of these industries and corporations. Universities benefit from these thinking-outside-the-box practices by equippingstudents with work force experience that involves more hands-on tasks with real-life infrastructures. The introduction is focused on analysis of emerging industries and new types of jobs that require futurepersonnel to be well equipped to meet the expansion requirements of theseindustries and keep up with their development needs. Section 2 looks atthe future Internet domain landscape that comprises a great diversity oftechnology related topics involved in the implementation of Smart Learning Environments. The purpose of section 3 is to overview a foundational framework and major considerations for the planning and implementation of smart learning environments, behind which is the convergence of advances and developments in social constructivism,psychology, and technology. Section 4 introduces the smart learning models which are developed to reflect the dynamic knowledge conversion processes in technologyenabled smart learning environments.The last section presents a case study of a learning scenario entitled “Monitoring the environmental parameters in a Smart City” as an illustration of experimental learning on Internet of Things, which proofs the power of the FORGE(Forging Online Education through FIRE) FP7 project methodology and infrastructurefor building remote labs and delivering them to students.ACM Computing Classification System (1998): K.3.2.
Supporting the Bulgarian Young Talent in the Field of Informatics
Authors: Asenova Petya
Published: November 2022

Dedicated to Edward Friedman on the occasion of his 80 th anniversaryIn this paper I share some impressions from my short communication with an exceptional person—Professor Edward Friedman fromStevens University of Technology, USA. Working in the field of integratingICT in education in the early 1990s, he launched several joint projects withBulgarian educators. The essentials of these activities were real projects inthe school. This idea was recently implemented at the university level as wellin the context of IT. I discuss this matter in the final sections of the paper.ACM Computing Classification System (1998): K.3.2.
On the Critical Points of Kyurkchiev’s Method for Solving Algebraic Equations
Authors: Valchanov Nikola , Golev Angel , Iliev Anton
Published: November 2022

This paper is dedicated to Prof. Nikolay Kyurkchievon the occasion of his 70th anniversaryThis paper gives sufficient conditions for kth approximations ofthe zeros of polynomial f (x) under which Kyurkchiev’s method fails on thenext step. The research is linked with an attack on the global convergencehypothesis of this commonly used in practice method (as correlate hypothesisfor Weierstrass–Dochev’s method). Graphical examples are presented.
Information Society for Enlightened Voting
Authors: Passy Solomon
Published: November 2022

Among the millions of words uttered and written on the subject of democracy,Winston Churchill’s are among the most famous:“Democracy is the worst form of government except all those other forms thathave been tried from time to time.” [4] The occasion of the remark – it was madeon 11 November 1947, when the great wartime leader spoke for the oppositionin Britain’s House of Commons – is a reminder of how far the world has sincetravelled. Yet the passing of six decades notwithstanding, mankind is stillsubservient to the classical dogma embodied in Churchill’s phrase: that democracyis synonymous with universal suffrage.It was always open to question. But today, new and evolving technologiesenable us to discard it – not to abolish democracy (who would want to do that?),but to enrich democracy with more effective, more innovative and more moralforms of enlightened government across the world.
Edison and St. Cyril: Seeking Common Ground. Presentation at Honorary Degree Award Ceremony
Authors: Friedman Edward A.
Published: November 2022

Rector Biolchev, Dean Mitev, and distinguished guests:I have been trying hard in recent months to avoid listening to pompouspronouncements about a new millennium. My instincts as a scientist and as amathematician tell me that this view of the passage of time is relative. Afterall, this is year 1420 in the Islamic calendar, thus placing us in the 15th century,while the Jewish calendar notes that the year is 5760 which is in the 58th century,not the 21st.
Model Mining and Efficient Verification of Software Product Lines
Authors: Soleimanifard Siavash , Gurov Dilian , Schaefer Ina , Østvold Bjarte M. , Markov Minko
Published: November 2022

Software product line modeling aims at capturing a set of software productsin an economic yet meaningful way. We introduce a class of variability modelsthat capture the sharing between the software artifacts forming the productsof a software product line (SPL) in a hierarchical fashion, in terms of commonalitiesand orthogonalities. Such models are useful when analyzing and verifying all productsof an SPL, since they provide a scheme for divide-and-conquer-style decompositionof the analysis or  verification problem at hand. We define an abstract class of SPLsfor which variability models can be constructed that are optimal w.r.t. the chosen representation of sharing. We show how the constructed models can be fed into a previously developedalgorithmic technique for compositional verification of control-flow temporal safetyproperties, so that the properties to be verified are iteratively decomposed intosimpler ones over orthogonal parts of the SPL, and are not re-verified over the shared parts. We provide tool support for our technique, and evaluate our tool on a small but realistic SPL of cash desks.
Classification of Maximal Optical Orthogonal Codes of Weight 3 and Small Lengths
Authors: Baicheva Tsonka , Topalova Svetlana
Published: November 2022

Dedicated to the memory of the late professor Stefan Dodunekovon the occasion of his 70th anniversary.We classify up to multiplier equivalence maximal (v, 3, 1) opticalorthogonal codes (OOCs) with v ≤ 61 and maximal (v, 3, 2, 1) OOCs with v ≤ 99.There is a one-to-one correspondence between maximal (v, 3, 1) OOCs,maximal cyclic binary constant weight codes of weight 3 and minimum distance 4, (v, 3; ⌊(v − 1)/6⌋) difference packings, and maximal (v, 3, 1) binarycyclically permutable constant weight codes. Therefore the classification of(v, 3, 1) OOCs holds for them too. Some of the classified (v, 3, 1) OOCs areperfect and they are equivalent to cyclic Steiner triple systems of order vand (v, 3, 1) cyclic difference families.
On the Approximation of the Generalized Cut Function of Degree p+1 By Smooth Sigmoid Functions
Authors: Kyurkchiev Nikolay , Markov Svetoslav
Published: November 2022

We introduce a modification of the familiar cut function byreplacing the linear part in its definition by a polynomial of degree p + 1obtaining thus a sigmoid function called generalized cut function of degreep + 1 (GCFP). We then study the uniform approximation of the (GCFP)by smooth sigmoid functions such as the logistic and the shifted logisticfunctions. The limiting case of the interval-valued Heaviside step functionis also discussed which imposes the use of Hausdorff metric. Numericalexamples are presented using CAS MATHEMATICA.
Quasilinear Structures in Stochastic Arithmetic and their Application
Authors: Markov Svetoslav , Alt René , Lamotte Jean-Luc
Published: November 2022

Stochastic arithmetic has been developed as a model for computing with 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 on the result of a numerical computation may lead to some overestimation of the 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 and the 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 with non-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.
A Unique Monument of Russian Book Culture
Authors: Pavlovska Elena
Published: November 2022

This paper presents a project for the creation of digital andfacsimile copies of a unique monument of the Russian book culture– The Illuminated Chronicle Code of the 16th century – produced in a singlecopy by the order of Tsar Ivan the Terrible.The Illuminated Codecontains 10,000 handwritten sheets and more than 17,000 colorfulminiatures created by the bestRussian scribes and icon painters of thattime. The Code features a presentation of the Biblical history, abstractsof history ofAncient Rome and Byzantium, and the 400-year history of Russia, from 1114 till Ivan the Terrible’s death in 1584.The history ofthe creation of the Code, the contents of its parts (volumes), the fate ofthis monument of culture in timeshard for Russia, and the problemsfacing scholars when developing the project are briefly described.The execution of the projectof digitalization of the Chronicle Code and the creation of its facsimile copy have allowed not only tocollect its individual parts thatwere stored in various state repositories,but also to make this monument of culture available to scholars, specialists, library staff,schoolchildren and students in Slavic and other European countries.
A Method to Construct an Extension of Fuzzy Information Granularity Based on Fuzzy Distance
Authors: Thien Nguyen Van , Demetrovics Janos , Thi Vu Duc , Giang Nguyen Long , Son Nguyen Nhu
Published: November 2022

In fuzzy granular computing, a fuzzy granular structure is the collection offuzzy information granules and fuzzy information granularity is used to measure 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 information granularity based on a fuzzy distance measure. We prove theoretically and experimentally that the proposed fuzzy information granularity is the best one to distinguish fuzzy granular structures.ACM Computing Classification System (1998): I.5.2, I.2.6.
Modern Trends in the Automatic Generation of Content for Video Games
Authors: Bontchev Boyan
Published: November 2022

Attractive and realistic content has always played a crucialrole in the penetration and popularity of digital games, virtualenvironments, and other multimedia applications. Procedural contentgeneration enables the automatization of production of any type of gamecontent including not only landscapes and narratives but also gamemechanics and generation of whole games. The article offers acomparative analysis of the approaches to automatic generation ofcontent for video games proposed in last five years. It suggests a newtypology of the use of procedurally generated game content comprising ofcategories structured in three groups: content nature, generation process,and game dependence. Together with two other taxonomies – one ofcontent type and the other of methods for content generation – thistypology is used for comparing and discussing some specific approaches toprocedural content generation in three promising research directionsbased on applying personalization and adaptation, descriptive languages,and semantic specifications.
Toward Pedagogy-Driven Personalized Learning Experiences in Cultural Digital Libraries
Authors: Arapi Polyxeni
Published: November 2022

Cultural heritage institutions hold a vast amount ofmultimedia digital content forming a rich source of knowledge aboutcultural heritage, natural history, and biodiversity that could be used toserve various educational contexts and scenarios. However, due to anumber of barriers, this knowledge remains largely unexploited. Thispaper addresses the problem and presents a framework and a service-oriented architecture for supporting personalized learning in culturaldigital collections/libraries allowing: a) accessing and re-purposingexisting multimedia digital content/archives for cultural digital objects,learning objects and higher learning units, and b) constructing pedagogy-driven personalized learning experiences in cultural digital collectionsstatically or dynamically, taking into account different learner needs andpreferences and instructional strategies encoded in educational templates.The proposed architecture also supports interoperability and sharing ofcultural digital objects, learning objects and learning experiences withexisting eLearning systems and large repositories/aggregators.
Subresultant Polynomial Remainder Sequences Obtained by Polynomial Divisions in Q[x] or in Z[x]
Authors: Akritas Alkiviadis G. , Malaschonok Gennadi I. , Vigklas Panagiotis S.
Published: November 2022

In this paper we present two new methods for computing thesubresultant polynomial remainder sequence (prs) of two polynomials f, g ∈ Z[x]. We are now able to also correctly compute the Euclidean and modifiedEuclidean prs of f, g by using either of the functions employed by ourmethods to compute the remainder polynomials.Another innovation is that we are able to obtain subresultant prs’s inZ[x] by employing the function rem(f, g, x) to compute the remainderpolynomials in [x]. This is achieved by our method subresultants_amv_q(f, g, x), which is somewhat slow due to the inherent higher cost of com-putations in the field of rationals.To improve in speed, our second method, subresultants_amv(f, g,x), computes the remainder polynomials in the ring Z[x] by employing thefunction rem_z(f, g, x); the time complexity and performance of thismethod are very competitive.Our methods are two different implementations of Theorem 1 (Section 3),which establishes a one-to-one correspondence between the Euclidean andmodified Euclidean prs of f, g, on one hand, and the subresultant prs of f, g,on the other.By contrast, if – as is currently the practice – the remainder polynomi-als are obtained by the pseudo-remainders function prem(f, g, x) 3 , thenonly subresultant prs’s are correctly computed. Euclidean and modified Eu-clidean prs’s generated by this function may cause confusion with the signsand conflict with Theorem 1.ACM Computing Classification System (1998): F.2.1, G.1.5, I.1.2.
What is Genselfdual?
Authors: Bouyukliev Iliya , Bouyuklieva Stefka , Dzhumalieva-Stoeva Maria , Monev Venelin
Published: November 2022

This paper presents developed software in the area of CodingTheory. Using it, all binary self-dual codes with given properties can beclassified. The programs have consequent and parallel implementations.ACM Computing Classification System (1998): G.4, E.4.
Algorithms for Computing the Linearity and Degree of Vectorial Boolean Functions
Authors: Bouyuklieva Stefka , Bouyukliev Iliya
Published: November 2022

In this article, we study two representations of a Boolean function which are very important in the context of cryptography. We describeMöbius and Walsh Transforms for Boolean functions in details and presenteffective algorithms for their implementation. We combine these algorithmswith the Gray code to compute the linearity, nonlinearity and algebraic degree of a vectorial Boolean function. Such a detailed consideration will bevery helpful for students studying the design of block ciphers, including PhDstudents in the beginning of their research.ACM Computing Classification System (1998): F.2.1, F.2.2.
Community-Sourcing in Virtual Societies
Authors: Branzov Todor
Published: November 2022

The paper studies the approaches to development of goodswith active participation of virtual community members. The concept ofcommunity-sourcing is presented as an alternative to the open source modeland crowdsourcing. On that foundation a conceptual model of resourcemanagement system that use some current good practices of the IT industryis proposed. Results obtained in a virtual community implementing themodel are presented as a validation attempt.ACM Computing Classification System (1998): H.5.3., H.3.5., J.4., K.3.1., K.4.3., K.6.1.
Basic Algorithms for Manipulation of Modules over Finite Chain Rings
Authors: Georgieva Nevyana
Published: November 2022

In this paper, we present some basic algorithms for manipulation of finitely generated modules over finite chain rings. We start with analgorithm that generates the standard form of a matrix over a finite chainring, which is an analogue of the row reduced echelon form for a matrix overa field. Furthermore we give an algorithm for the generation of the union oftwo modules, an algorithm for the generation of the orthogonal module to agiven module, as well as an algorithm for the generation of the intersectionof two modules. Finally, we demonstrate how to generate all submodules offixed shape of a given module.ACM Computing Classification System (1998): G.1.3, G.4.
Effectiveness of a Conceptual Model for Increased Mobile Banking Security
Authors: Penchev Bonimir
Published: November 2022

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.
Analysis of Biochemical Mechanisms using Mathematica with Applications
Authors: Kyurkchiev Nikolay , Markov Svetoslav , Mincheva Maya
Published: November 2022

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 biochemical mechanisms. 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.
Conjugates for Finding the Automorphism Group and Isomorphism of Design Resolutions
Authors: Topalova Svetlana
Published: November 2022

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.
Mobile Exploring of Bulgarian Cultural and Scientific Assets
Authors: Márkus Zsolt László , Kaposi Gábor , Szántó György , Szkaliczki Tibor , Veres Miklós , Weisz Zsolt , Luchev Detelin , Paneva-Marinova Desislava , Pavlov Radoslav , Pavlova Lilia
Published: November 2022

The paper introduces an ecosystem of digital libraries andmobile applications for presenting Bulgarian cultural and science assets.The digital libraries concerned constitute valuable sources of culturalheritage and related scientific results. They include the BulgarianIconographical Digital Library (BIDL), the BellKnow multimedia archiveon bells and the web site of the International Conference on DigitalPresentation and Preservation of Cultural and Scientific Heritage (DIPP).These digital libraries can be accessed online through a Web interface.Due to the spread of mobile devices, there is a need to present thecontents through mobile platforms as well. The GUIDE@HANDapplication family was integrated with the digital libraries for presenting the cultural and scientific assets offline in mobile applications. Interactivemultimedia components (e. g., games, panorama pictures, maps etc.)make the presentation more attractive. The developed mobile applicationsfacilitate learning, presentation and preservation of cultural and scientificobjects.
Serdica Journal of Computing : The First Ten Years
Authors: Derzhanski Ivan , Siruk Olena
Published: November 2022

Serdica Journal of Computing has completed its first decade.On this occasion we offer some notes, statistical and otherwise, on the firstten volumes of the journal, concerning the number of authors and papers,the geographical and institutional distribution of authors’ affiliations, thestructural semantic makeup, the dynamics of the editorial board, and variousimportant developments in this period.ACM Computing Classification System (1998): A.0.
Workflows in Dynamic Software Systems
Authors: Yonchev Hristo , Bontchev Boyan
Published: November 2022

Business software systems and applications use businessprocess management concepts to organize and automate processes.Incorporating a business process management system in existing businessapplications is a pretty complex task and, as well, is very expensive interms of time and human resources. The article presents a newlyconceived Framework for Dynamic Business Applications - a softwareplatform that allows business users (domain experts) to defne at runtime all business objects that they will work with, their properties,relationships, and restrictions of their business/domain model. This isvery similar to what can be done with business ontologies regardingrepresentation of entities, ideas, and events, along with their propertiesand relations. After defning them, business users can use them topopulate data in the application and later apply this data for dataextraction, analysis, visualization, and reporting.ACM Computing Classifiation Sstem (1998): D.2.2, D.4.1, H.4.1.
How to Account for the Uncertainty in The QoS Selection Task
Authors: Georgieva Olga
Published: November 2022

The paper presents an approach to QoS selection of webservices. It introduces a theoretical frame and respective applicableselection procedures, in which the solution accounts for the uncertainty ofthe existing metrics data and client preference. Methods of two generalcases are revealed in detail. The first method considers a selection basedon one service quality. The second method assesses the integrated QoS ofinteresting properties. The theoretical analysis is validated throughexperimental investigation of real data of services’ quality metrics.ACM Computing Classification System (1998): H.3.7, K.3.1.* The author acknowledges the financial support of the National Science Fund, BulgarianMinistry of Education and Science, under project grant DN 02/11 and the Science Fund ofthe St. Kliment Ohridski University of Sofia under project grant No 80-10-196/24.04.2017.
A Web Application for Text Document Classification Based on K-Nearest Neighbor Algorithm
Authors: Aleksieva-Petrova Adelina , Minkov Emilyan , Petrov Milen
Published: November 2022

The paper gives insight on how the text document categorizationproblem can be solved and implemented in a software product. On that score, itspecifies how input data are provided, processed and transformed into outputdata. The goal of the paper is not only to suggest a simple theoretical solution tothe text document categorization problem but to provide a real-lifeimplementation as part of a software system.ACM Computing Classication System (1998): H.3.3, H.3.5, I.7.5.* The research presented in this paper was partially supported by the project FNI-SU-2017/80 10-128 (St. Kliment Ohridski University of Sofia, Bulgaria) Secure and re-usablesoftware architectures for Technology-enhanced learning.