Computer Mathematics with MuPAD in School Years 6. To 9

Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, May, 2014

Accent Recognition for Noisy Audio Signals

It is well established that accent recognition can be as accurate as up to 95% when the signals are noise-free, using feature extraction techniques such as mel-frequency cepstral coefficients and binary classifiers such as discriminant analysis, support vector machine and k-nearest neighbors. In this paper, we demonstrate that the predictive performance can be reduced by as much as 15% when the signals are noisy. Specifically, in this paper we perturb the signals with different levels of white noise, and as the noise become stronger, the out-of-sample predictive performance deteriorates from 95% to 80%, although the in-sample prediction gives overly-optimistic results. ACM Computing Classification System (1998): C.3, C.5.1, H.1.2, H.2.4., G.3.

Representing Equivalence Problems for Combinatorial Objects

Methods for representing equivalence problems of various combinatorial objects as 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 combinatorial objects. Moreover, there already exist well tested algorithms for the graph isomorphism problem (nauty) and the binary matrix isomorphism problem as well (Q-Extension). ACM Computing Classification System (1998): F.2.1, G.4.

Classification of Maximal Optical Orthogonal Codes of Weight 3 and Small Lengths

Dedicated to the memory of the late professor Stefan Dodunekov on the occasion of his 70th anniversary. We classify up to multiplier equivalence maximal (v, 3, 1) optical orthogonal 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 dis tance 4, (v, 3; ⌊(v − 1)/6⌋) difference packings, and maximal (v, 3, 1) binary cyclically permutable constant weight codes. Therefore the classification of (v, 3, 1) OOCs holds for them too. Some of the classified (v, 3, 1) OOCs are perfect and they are equivalent to cyclic Steiner triple systems of order v and (v, 3, 1) cyclic difference families.

Solvability of an Infinite System of Singular Integral Equations

2000 Mathematics Subject Classification: 45G15, 26A33, 32A55, 46E15.

Linear Colligations and Dynamic System Corresponding to Operators in the Banach Space

2000 Mathematics Subject Classification: Primary 47A48, 93B28, 47A65; Secondary 34C94.

Asymptotic Analysis of a Schrödinger-Poisson System with Quantum Wells and Macroscopic Nonlinearities in Dimension 1

2000 Mathematics Subject Classification: 35Q02, 35Q05, 35Q10, 35B40.

Remarks on blow up time for solutions of a nonlinear diffusion system with time dependent coefficients

2000 Mathematics Subject Classification: 35K55, 35K60.

Improving the Quality of Education by Using a System for Development and Generation of Personalized Educational Materials

Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, May, 2016

The extent of the population paradox in the Hungarian electoral system

The Hungarian mixed-member electoral system, adopted in 1989, is one of the world’s most complicated electoral systems, and, as this paper demonstrates, it suffers from the "population paradox". In particular, the governing coalition may lose as many as 8 seats either by getting more votes or by the opposition obtaining fewer votes on each territorial list.

The existence of an inverse limit of inverse system of measure spaces - a purely measurable case

The existence of an inverse limit of an inverse system of (probability) measure spaces has been investigated since the very beginning of the birth of the modern probability theory. Results from Kolmogorov [10], Bochner [2], Choksi [5], Metivier [14], Bourbaki [3] among others have paved the way of the deep understanding of the problem under consideration. All the above results, however, call for some topological concepts, or at least ones which are closely related topological ones. In this paper we investigate purely measurable inverse systems of (probability) measure spaces, and give a sucient condition for the existence of a unique inverse limit. An example for the considered purely measurable inverse systems of (probability) measure spaces is also given.

Adómorál és adócsalás - társadalmi preferenciák és korlátozott racionalitás = Tax morale and tax system: social preferences and bounded rationality

Az adócsalásnak egy olyan modellcsaládját vizsgáljuk, ahol az egykulcsos adó kizárólag a közjavakat finanszírozza. Két megközelítés összehasonlítására összpontosítunk. Az elsőben minden dolgozó jövedelme azonos, és ebből minden évben annyit vall be, amennyi maximalizálja a nála maradó jövedelemből fedezhető fogyasztás nyújtotta hasznosság és a jövedelembevallásból fakadó hasznosság összegét. A második hasznosság három tényező szorzata: a dolgozó exogén adómorálja, a környezetében előző évben megfigyelt átlagos jövedelembevallás és saját bevallásából fakadó endogén hasznossága. A második megközelítésben az ágensek egyszerű heurisztikus szabályok szerint cselekszenek. Míg az optimalizáló modellben hagyományos Laffer-görbékkel találkozunk, addig a heurisztikán alapuló modellekben (lineárisan) növekvő Laffer-görbék jönnek létre. E különbség oka, hogy a heurisztikán alapuló modellben egy sajátos viselkedésfajta jelentkezik: számos ágens ingatag helyzetbe kerül, amelyben altruizmus és önzés között ingadozik. ________ The authors study a family of models of tax evasion, where a flat-rate tax only finances the provision of public goods and audits and wage differences are ne-glected. The paper focuses on comparing two modelling approaches. The first is based on optimizing agents, endowed with social preferences, their utility being the sum of private consumption and moral utility. The second approach involves agents acting according to simple heuristics. While the traditionally shaped Laffer curves are encountered in the optimizing model, the heuristics models exhibit (linearly) increasing Laffer curves. This difference is related to a peculiar type of behaviour: within the agent-based approach lurk a number of agents in a moral state of limbo, alternating between altruism and selfishness.

An agro-ecological simulation model system

In this paper five different models, as five modules of a complex agro-ecosystem are investigated. The water and nutrient flow in soil is simulated by the nutrient-in-soil model while the biomass change according to the seasonal weather aspects, the nutrient content of soil and the biotic interactions amongst the other terms of the food web are simulated by the food web population dynamical model that is constructed for a piece of homogeneous field. The food web model is based on the nutrient-in-soil model and on the activity function evaluator model that expresses the effect of temperature. The numbers of individuals in all phenological phases of the different populations are given by the phenology model. The food web model is extended to an inhomogeneous piece of field by the spatial extension model. Finally, as an additional module, an application of the above models for multivariate state-planes, is given. The modules built into the system are closely connected to each other as they utilize each other’s outputs, nevertheless, they work separately, too. Some case studies are analysed and a summarized outlook is given.

Svájci rendszerű sakk csapatversenyek rangsorolása (Ranking in Swiss system chess team tournaments)

A cikk a páros összehasonlításokon alapuló pontozási eljárásokat alkalmazza svájci rendszerű sakk csapatversenyek eredményének meghatározására. Bemutatjuk a nem körmérkőzéses esetben felmerülő kérdéseket, az egyéni és csapatversenyek jellemzőit, valamint a hivatalos lexikografikus rendezések hibáit. Axiomatikus alapokon rangsorolási problémaként modellezzük a bajnokságokat, definícióinkat összekapcsoljuk a pontszám, az általánosított sorösszeg és a legkisebb négyzetek módszerének tulajdonságaival. A javasolt eljárást két sakkcsapat Európa-bajnokság részletes elemzésével illusztráljuk. A végső rangsorok összehasonlítását távolságfüggvények segítségével végezzük el, majd a sokdimenziós skálázás révén ábrázoljuk azokat. A hivatalos sorrendtől való eltérés okait a legkisebb négyzetek módszerének dekompozíciójával tárjuk fel. A sorrendeket három szempont, az előrejelző képesség, a mintailleszkedés és a robusztusság alapján értékeljük, és a legkisebb négyzetek módszerének alkalmas eredménymátrixszal történő használata mellett érvelünk. ____ The paper uses paired comparison-based scoring procedures in order to determine the result of Swiss system chess team tournaments. We present the main challenges of ranking in these tournaments, the features of individual and team competitions as well as the failures of official lexicographical orders. The tournament is represented as a ranking problem, our model is discussed with respect to the properties of the score, generalised row sum and least squares methods. The proposed method is illustrated with a detailed analysis of the two recent chess team European championships. Final rankings are compared through their distances and visualized by multidimensional scaling (MDS). Differences to official ranking are revealed due to the decomposition of least squares method. Rankings are evaluated by prediction accuracy, retrodictive performance, and stability. The paper argues for the use of least squares method with an appropriate generalised results matrix favouring match points.

Ranking in Swiss system chess team tournaments

The paper uses paired comparison-based scoring procedures for ranking the participants of a Swiss system chess team tournament. We present the main challenges of ranking in Swiss system, the features of individual and team competitions as well as the failures of official lexicographical orders. The tournament is represented as a ranking problem, our model is discussed with respect to the properties of the score, generalized row sum and least squares methods. The proposed procedure is illustrated with a detailed analysis of the two recent chess team European championships. Final rankings are compared by their distances and visualized with multidimensional scaling (MDS). Differences to official ranking are revealed by the decomposition of least squares method. Rankings are evaluated by prediction accuracy, retrodictive performance, and stability. The paper argues for the use of least squares method with a results matrix favoring match points.