Pub Date : 2023-01-01DOI: 10.33039/ami.2022.12.013
Mátyás Kiglics, Gábor Valasek, Csaba Bálint
. We propose an efficient algorithm to compute k-sided unbounding discrete oriented polytopes ( 𝑘 -UDOPs) in arbitrary dimensions. These convex polytopes are constructed for a fixed set of directions and a given center point. The interior of 𝑘 -UDOPs does not intersect the scene geometry. We discuss several types of general geometric queries on these constructs, such as intersection with rays, and provide an empirical investigation on the limit of these shapes as the number of sides increases. In the 2D case, we extend our construction to planar shapes enclosed by arbitrary parametric boundaries with known derivative bounds.
{"title":"Unbounding discrete oriented polytopes","authors":"Mátyás Kiglics, Gábor Valasek, Csaba Bálint","doi":"10.33039/ami.2022.12.013","DOIUrl":"https://doi.org/10.33039/ami.2022.12.013","url":null,"abstract":". We propose an efficient algorithm to compute k-sided unbounding discrete oriented polytopes ( 𝑘 -UDOPs) in arbitrary dimensions. These convex polytopes are constructed for a fixed set of directions and a given center point. The interior of 𝑘 -UDOPs does not intersect the scene geometry. We discuss several types of general geometric queries on these constructs, such as intersection with rays, and provide an empirical investigation on the limit of these shapes as the number of sides increases. In the 2D case, we extend our construction to planar shapes enclosed by arbitrary parametric boundaries with known derivative bounds.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79184725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.33039/ami.2023.08.009
Péter Hatvani, L. Laki, Yang Zijian Győző
. In today’s world, the volume of documents being generated is growing exponentially, making the protection of personal data an increasingly crucial task. Anonymization plays a vital role in various fields, but its implementation can be challenging. While advancements in natural language processing research have resulted in more accurate named entity recognition (NER) models, relying on an NER system to remove names from a text may compromise its fluency and coherence. In this paper, we introduce a novel approach to pseudonymization, specifically tailored for the Hungarian language, which addresses the challenges associated with maintaining text fluency and coherence. Our method employs a pipeline that integrates various NER models, morphological parsing, and generation modules. Instead of merely recognizing and removing named entities, as in conventional approaches, our pipeline utilizes a morphological generator to consistently replace names with alternative names throughout the document. This process ensures the preservation of both text coherence and anonymity. To assess the efficacy of our method, we conducted evaluations on multiple corpora, with results consistently indicating that our pipeline surpasses traditional approaches in performance. Our innovative approach paves the way for new pseudonymization possibilities across a diverse range of fields and applications.
{"title":"A pseudonymization tool for Hungarian","authors":"Péter Hatvani, L. Laki, Yang Zijian Győző","doi":"10.33039/ami.2023.08.009","DOIUrl":"https://doi.org/10.33039/ami.2023.08.009","url":null,"abstract":". In today’s world, the volume of documents being generated is growing exponentially, making the protection of personal data an increasingly crucial task. Anonymization plays a vital role in various fields, but its implementation can be challenging. While advancements in natural language processing research have resulted in more accurate named entity recognition (NER) models, relying on an NER system to remove names from a text may compromise its fluency and coherence. In this paper, we introduce a novel approach to pseudonymization, specifically tailored for the Hungarian language, which addresses the challenges associated with maintaining text fluency and coherence. Our method employs a pipeline that integrates various NER models, morphological parsing, and generation modules. Instead of merely recognizing and removing named entities, as in conventional approaches, our pipeline utilizes a morphological generator to consistently replace names with alternative names throughout the document. This process ensures the preservation of both text coherence and anonymity. To assess the efficacy of our method, we conducted evaluations on multiple corpora, with results consistently indicating that our pipeline surpasses traditional approaches in performance. Our innovative approach paves the way for new pseudonymization possibilities across a diverse range of fields and applications.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82352771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.33039/ami.2023.08.010
Dániel Ferenczi, M. Tóth
. Having applications accessible without downtime is no longer an exclusive requirement of mission-critical applications or traditional domains like communications. Running applications also require changes in the source code and upgrading live systems. Different approaches exist depending on the used technology. Systems implemented in Erlang can take the advantage of the underlying BEAM virtual machine and can be upgraded easily. However, source code has to be developed carefully once an upgrade is needed to not introduce run-time errors during the upgrade. We are developing a method to statically check the source code of Erlang applications for constructs that may lead to upgrading issues
{"title":"Static analysis for safe software upgrade","authors":"Dániel Ferenczi, M. Tóth","doi":"10.33039/ami.2023.08.010","DOIUrl":"https://doi.org/10.33039/ami.2023.08.010","url":null,"abstract":". Having applications accessible without downtime is no longer an exclusive requirement of mission-critical applications or traditional domains like communications. Running applications also require changes in the source code and upgrading live systems. Different approaches exist depending on the used technology. Systems implemented in Erlang can take the advantage of the underlying BEAM virtual machine and can be upgraded easily. However, source code has to be developed carefully once an upgrade is needed to not introduce run-time errors during the upgrade. We are developing a method to statically check the source code of Erlang applications for constructs that may lead to upgrading issues","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85675552","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.33039/ami.2022.12.001
I. Boda, E. Tóth, László T. Nagy
. In our paper we introduce a bilingual language learning material developed in the framework of the so-called three dimensional virtual library model (3DVLM). This model inspired by the history and organization of the famous ancient Library of Alexandria forms the basis of the virtual library project which started about eight years ago as part of the Cognitive Infocommunications (CogInfoCom) research. The current version of the 3DVLM uses the excellent 3D features of the MaxWhere Seminar System which makes it suitable for both individual learning and classroom use. In the following, we would like to introduce first the basic framework of our development, then describe in detail the data structure and organization of the developed bilingual language learning material. The basic idea of the material is to present selected phrases and contexts from classical literary works in English and from their parallel translations in Hungarian in order to improve both the language skills and background knowledge of Hungarian language learners at an advanced level. We found that using web technology was especially useful for developing the language learning material and the developed hypertext structure formed a scale-free network of interconnected nodes.
{"title":"Enhancing Hungarian students’ English language skills on the basis of literary texts in the three-dimensional space","authors":"I. Boda, E. Tóth, László T. Nagy","doi":"10.33039/ami.2022.12.001","DOIUrl":"https://doi.org/10.33039/ami.2022.12.001","url":null,"abstract":". In our paper we introduce a bilingual language learning material developed in the framework of the so-called three dimensional virtual library model (3DVLM). This model inspired by the history and organization of the famous ancient Library of Alexandria forms the basis of the virtual library project which started about eight years ago as part of the Cognitive Infocommunications (CogInfoCom) research. The current version of the 3DVLM uses the excellent 3D features of the MaxWhere Seminar System which makes it suitable for both individual learning and classroom use. In the following, we would like to introduce first the basic framework of our development, then describe in detail the data structure and organization of the developed bilingual language learning material. The basic idea of the material is to present selected phrases and contexts from classical literary works in English and from their parallel translations in Hungarian in order to improve both the language skills and background knowledge of Hungarian language learners at an advanced level. We found that using web technology was especially useful for developing the language learning material and the developed hypertext structure formed a scale-free network of interconnected nodes.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87036328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.33039/ami.2022.12.003
Viktória Padányi, T. Herendi
. In this paper, we generalize John von Neumann’s Middle-Square Method (MSM) to canonical number systems (CNS). Additionally, we present some observations and statistical tests of the sequences generated by the described generators
{"title":"Generalized Middle-Square Method","authors":"Viktória Padányi, T. Herendi","doi":"10.33039/ami.2022.12.003","DOIUrl":"https://doi.org/10.33039/ami.2022.12.003","url":null,"abstract":". In this paper, we generalize John von Neumann’s Middle-Square Method (MSM) to canonical number systems (CNS). Additionally, we present some observations and statistical tests of the sequences generated by the described generators","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82985338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.33039/ami.2023.08.005
Mihály Gencsi, B. G.-Tóth
. The Interval Branch and Bound (IBB) method is a good choice when a rigorous solution is required. This method handles computational errors in the calculations. Few IBB implementations use the Fritz-John (FJ) optimality condition to eliminate non-optimal boxes in a constrained non-linear programming problem. Applying the FJ optimality condition implies solving an interval-valued system of equations. In the best case, the solution is an empty set if the interval box does not contain an optimizer point. Solving this system of equations is complicated or unsuccessful in many cases. This problem can be caused by the interval box being too wide, the defined system of equations containing unnecessary constraints, or the solver being unsuccessful. These unsuccessful attempts have a negative outcome and only increase the computation time. In this study, we propose some modifications to reduce the running time and computational requirements of the Interval Branch and Bound method.
{"title":"The Fritz-John Condition System in Interval Branch and Bound method","authors":"Mihály Gencsi, B. G.-Tóth","doi":"10.33039/ami.2023.08.005","DOIUrl":"https://doi.org/10.33039/ami.2023.08.005","url":null,"abstract":". The Interval Branch and Bound (IBB) method is a good choice when a rigorous solution is required. This method handles computational errors in the calculations. Few IBB implementations use the Fritz-John (FJ) optimality condition to eliminate non-optimal boxes in a constrained non-linear programming problem. Applying the FJ optimality condition implies solving an interval-valued system of equations. In the best case, the solution is an empty set if the interval box does not contain an optimizer point. Solving this system of equations is complicated or unsuccessful in many cases. This problem can be caused by the interval box being too wide, the defined system of equations containing unnecessary constraints, or the solver being unsuccessful. These unsuccessful attempts have a negative outcome and only increase the computation time. In this study, we propose some modifications to reduce the running time and computational requirements of the Interval Branch and Bound method.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81772300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.33039/ami.2023.03.002
Dánel Lukács, Gabriella Tóth, M. Tejfel
There are many important tasks in a conventional software development process which can be supported by different analysis techniques. P4 is a high level domain-specific language for describing the data plane layer of packet processing algorithms. It has several uncommon language elements and concepts that often make the analysis of P4 programs a laborious task. The paper presents P4Query, an analysis framework for the P4 language that enables the specification of different P4-related analysis methods in a generic and data-centric way. The framework uses an internal graph representation which contains the results of applied analysis methods too. In this way, the framework supports the rapid implementation of new analysis methods in a way where the results will be also easily reusable by other methods.
{"title":"P4Query: Static analyser framework for P4","authors":"Dánel Lukács, Gabriella Tóth, M. Tejfel","doi":"10.33039/ami.2023.03.002","DOIUrl":"https://doi.org/10.33039/ami.2023.03.002","url":null,"abstract":"There are many important tasks in a conventional software development process which can be supported by different analysis techniques. P4 is a high level domain-specific language for describing the data plane layer of packet processing algorithms. It has several uncommon language elements and concepts that often make the analysis of P4 programs a laborious task. The paper presents P4Query, an analysis framework for the P4 language that enables the specification of different P4-related analysis methods in a generic and data-centric way. The framework uses an internal graph representation which contains the results of applied analysis methods too. In this way, the framework supports the rapid implementation of new analysis methods in a way where the results will be also easily reusable by other methods.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77800219","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.33039/ami.2023.04.002
B. Nagy, Khaled Abuhmaidan, M. Aldwairi
. Boolean logic is widely used in almost every discipline including linguistics, philosophy, mathematics, computer science and engineering. Boolean logic is characterized by the two possible truth values, and various logical connectives/operations allow us to make compound statements, conditions. Most of the programming languages, if not all, have some of the logic operations: conjunction, disjunction and negation. Actually, since the set of these three operations form a basis, any logical statement can be formed by them. However, on the one hand, there are smaller bases as well, i.e., one of the conjunction or disjunction is already superfluous. Moreover, there are bases with only one operation, e.g., by NAND. On the other hand, one may allow other operations helping the programmer/user to define the conditions of conditional statements and loops in a simpler manner. In this paper we
{"title":"Logical conditions in programming languages: review, discussion and generalization","authors":"B. Nagy, Khaled Abuhmaidan, M. Aldwairi","doi":"10.33039/ami.2023.04.002","DOIUrl":"https://doi.org/10.33039/ami.2023.04.002","url":null,"abstract":". Boolean logic is widely used in almost every discipline including linguistics, philosophy, mathematics, computer science and engineering. Boolean logic is characterized by the two possible truth values, and various logical connectives/operations allow us to make compound statements, conditions. Most of the programming languages, if not all, have some of the logic operations: conjunction, disjunction and negation. Actually, since the set of these three operations form a basis, any logical statement can be formed by them. However, on the one hand, there are smaller bases as well, i.e., one of the conjunction or disjunction is already superfluous. Moreover, there are bases with only one operation, e.g., by NAND. On the other hand, one may allow other operations helping the programmer/user to define the conditions of conditional statements and loops in a simpler manner. In this paper we","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87563922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.33039/ami.2022.12.008
R. Nekrasova
. We consider two-class retrial queueing system with constant retrial rate fed by Poisson input and apply regenerative confidence estimation for mean number of customers in the stable orbit, while the other orbit in-timately grows. The simulation results illustrate that partially stable case providing accurate confidence estimation, even the stability conditions, related for the whole system, are violated
{"title":"Regeneration estimation in partially stable two class retrial queue","authors":"R. Nekrasova","doi":"10.33039/ami.2022.12.008","DOIUrl":"https://doi.org/10.33039/ami.2022.12.008","url":null,"abstract":". We consider two-class retrial queueing system with constant retrial rate fed by Poisson input and apply regenerative confidence estimation for mean number of customers in the stable orbit, while the other orbit in-timately grows. The simulation results illustrate that partially stable case providing accurate confidence estimation, even the stability conditions, related for the whole system, are violated","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84580476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.33039/ami.2022.12.007
Dávid Kószó
. We show that it is decidable whether the language generated by a given context-free grammar over a tree alphabet is a tree language. Furthermore, if the answer to this question is “yes”, then we can even effectively construct a regular tree grammar which generates that tree language.
{"title":"Tree generating context-free grammars and regular tree grammars are equivalent","authors":"Dávid Kószó","doi":"10.33039/ami.2022.12.007","DOIUrl":"https://doi.org/10.33039/ami.2022.12.007","url":null,"abstract":". We show that it is decidable whether the language generated by a given context-free grammar over a tree alphabet is a tree language. Furthermore, if the answer to this question is “yes”, then we can even effectively construct a regular tree grammar which generates that tree language.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87986044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：