Pub Date : 2023-01-01DOI: 10.33039/ami.2023.08.001
Zoltán Gál, G. Terdik
. Nowadays expectations against modern communication services involve not just Quality of Service (QoS) enhancement for real-time applications but also increased transmission rate between the storing and processing of Big Data nodes. Transmission Control Protocol (TCP) has strict flow con-trol of the data stream providing automatic adaptation to the path load of the process-to-process communication. User Datagram Protocol (UDP) based solutions are proposed to settle the communication efficiency. In this paper, we analyse the effect of three independent communication parameters on the efficiency of looped UDP communication: the size of the Maximum Transfer Unit (MTU), the bandwidth of the end-to-end session, and the segment size of the UDP protocol data unit. The usage of nonstationary multi-resolution methods helps to identify three characteristic patterns offering identification of the objective qualitative features of the looped datagram communication services.
{"title":"On the patterns of the nonstationary datagram based fast communication processes","authors":"Zoltán Gál, G. Terdik","doi":"10.33039/ami.2023.08.001","DOIUrl":"https://doi.org/10.33039/ami.2023.08.001","url":null,"abstract":". Nowadays expectations against modern communication services involve not just Quality of Service (QoS) enhancement for real-time applications but also increased transmission rate between the storing and processing of Big Data nodes. Transmission Control Protocol (TCP) has strict flow con-trol of the data stream providing automatic adaptation to the path load of the process-to-process communication. User Datagram Protocol (UDP) based solutions are proposed to settle the communication efficiency. In this paper, we analyse the effect of three independent communication parameters on the efficiency of looped UDP communication: the size of the Maximum Transfer Unit (MTU), the bandwidth of the end-to-end session, and the segment size of the UDP protocol data unit. The usage of nonstationary multi-resolution methods helps to identify three characteristic patterns offering identification of the objective qualitative features of the looped datagram communication services.","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":"87305122","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.11.001
Zijian Győző Yang, L. Laki
,
，
{"title":"Solving Hungarian natural language processing tasks with multilingual generative models","authors":"Zijian Győző Yang, L. Laki","doi":"10.33039/ami.2022.11.001","DOIUrl":"https://doi.org/10.33039/ami.2022.11.001","url":null,"abstract":",","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":"73778981","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.005
Prathamesh Berde, M. Kumar, C.S.R.C. Murthy, Lalit Dagre, Seervi Tejaram
C.S.R.C
C.S.R.C
{"title":"A psychometric approach to email authorship assertion in an organization","authors":"Prathamesh Berde, M. Kumar, C.S.R.C. Murthy, Lalit Dagre, Seervi Tejaram","doi":"10.33039/ami.2022.12.005","DOIUrl":"https://doi.org/10.33039/ami.2022.12.005","url":null,"abstract":"C.S.R.C","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":"91255766","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.004
E. Morozov, S. Rogozin
. We consider a multiclass retrial system with classical retrials, and present a new short proof of the sufficient stability (positive recurrence) condition of the system. The proof is based on the analysis of the departures from the system and a balance equation between the arrived and departed work. Moreover, we apply the asymptotic results from the theory of renewal and regenerative processes. This analysis is then extended to the system with the outgoing calls. A few numerical examples illustrate theoretical analysis.
{"title":"Stability condition of multiclass classical retrials: a revised regenerative proof","authors":"E. Morozov, S. Rogozin","doi":"10.33039/ami.2022.12.004","DOIUrl":"https://doi.org/10.33039/ami.2022.12.004","url":null,"abstract":". We consider a multiclass retrial system with classical retrials, and present a new short proof of the sufficient stability (positive recurrence) condition of the system. The proof is based on the analysis of the departures from the system and a balance equation between the arrived and departed work. Moreover, we apply the asymptotic results from the theory of renewal and regenerative processes. This analysis is then extended to the system with the outgoing calls. A few numerical examples illustrate theoretical analysis.","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":"75803150","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.012
T. Herendi, Sándor Roland Major
. A method is presented for generating random numbers with uniform distribution using linear recurrence sequences with very large period lengths. This method requires an irreducible polynomial modulo 2 to define the sequence. A suitable method for generating an infinite number of such polynomials is presented. The polynomials generated in this way can have an arbitrarily large degree, and a large enough order to make them suitable for practical applications
{"title":"Using irreducible polynomials for random number generation","authors":"T. Herendi, Sándor Roland Major","doi":"10.33039/ami.2022.12.012","DOIUrl":"https://doi.org/10.33039/ami.2022.12.012","url":null,"abstract":". A method is presented for generating random numbers with uniform distribution using linear recurrence sequences with very large period lengths. This method requires an irreducible polynomial modulo 2 to define the sequence. A suitable method for generating an infinite number of such polynomials is presented. The polynomials generated in this way can have an arbitrarily large degree, and a large enough order to make them suitable for practical 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":"72490393","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.012
A. Németh, T. Kozsik, Z. Zimborás
. In addition to the exciting fundamental questions of quantum computing and implementation possibilities of quantum computers, it is important to look for application areas of quantum computing, to point out practical cases which justify the need for this technology. Besides the well-known qubit-based quantum computers, there are also devices based on other foundations that can surpass the capabilities of classical computers. Among these, devices operating on the basis of boson sampling have a naturally occurring application: the approximate calculation of the vibrational spectrum of molecules. Two separate research groups, Huh et al. [14] and Wang et al. [22] created quantum simulators based on boson sampling, which were successfully used to calculate the transition probabilities between specific states of small molecules. Following the methodology found in these two articles, this paper presents how the calculations of transition probabilities can be performed on a classical computer using a quantum computer simulator which is based on Gaussian boson sampling.
{"title":"Vibronic spectra of molecules – an experiment with a quantum computer simulator","authors":"A. Németh, T. Kozsik, Z. Zimborás","doi":"10.33039/ami.2023.08.012","DOIUrl":"https://doi.org/10.33039/ami.2023.08.012","url":null,"abstract":". In addition to the exciting fundamental questions of quantum computing and implementation possibilities of quantum computers, it is important to look for application areas of quantum computing, to point out practical cases which justify the need for this technology. Besides the well-known qubit-based quantum computers, there are also devices based on other foundations that can surpass the capabilities of classical computers. Among these, devices operating on the basis of boson sampling have a naturally occurring application: the approximate calculation of the vibrational spectrum of molecules. Two separate research groups, Huh et al. [14] and Wang et al. [22] created quantum simulators based on boson sampling, which were successfully used to calculate the transition probabilities between specific states of small molecules. Following the methodology found in these two articles, this paper presents how the calculations of transition probabilities can be performed on a classical computer using a quantum computer simulator which is based on Gaussian boson sampling.","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":"76309945","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.006
Mustafa Alzaidi, Anikó Vágner
. The Not Structured Query Language (NoSQL) databases have become more relevant to applications developers as the need for scalable and flexible data storage for online applications has increased. Each NoSQL database system provides features that fit particular types of applications. Thus, the developer must carefully select according to the application’s needs. Redis is a key-value NoSQL database that provides fast data access. On the other hand, the Apache HBase database is a column-oriented database that offers scalability and fast data access, is a promising alternative to Redis in some types of applications. In this research paper, the goal is to use the Yahoo Cloud Serving Benchmark (YCSB) to compare the performance of two databases (Redis and HBase). The YCSB platform has been developed to determine the throughput of both databases against different workloads. This paper evaluates these NoSQL databases with six workloads and varying threads.
{"title":"Benchmarking Redis and HBase NoSQL Databases using Yahoo Cloud Service Benchmarking tool","authors":"Mustafa Alzaidi, Anikó Vágner","doi":"10.33039/ami.2022.12.006","DOIUrl":"https://doi.org/10.33039/ami.2022.12.006","url":null,"abstract":". The Not Structured Query Language (NoSQL) databases have become more relevant to applications developers as the need for scalable and flexible data storage for online applications has increased. Each NoSQL database system provides features that fit particular types of applications. Thus, the developer must carefully select according to the application’s needs. Redis is a key-value NoSQL database that provides fast data access. On the other hand, the Apache HBase database is a column-oriented database that offers scalability and fast data access, is a promising alternative to Redis in some types of applications. In this research paper, the goal is to use the Yahoo Cloud Serving Benchmark (YCSB) to compare the performance of two databases (Redis and HBase). The YCSB platform has been developed to determine the throughput of both databases against different workloads. This paper evaluates these NoSQL databases with six workloads and varying threads.","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":"78212051","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.003
Endre Fülöp, Attila Gyen, Norbert Pataki
. The Read-Copy-Update (RCU) mechanism is a way of synchronizing concurrent access to variables with the goal of prioritizing read performance over strict consistency guarantees. The main idea behind this mechanism is that RCU avoids the use of lock primitives while multiple threads try to read and update elements concurrently. In this case, elements are linked together through pointers in a shared data structure. RCU is used in the Linux kernel, but there are user-space libraries which implement the technique as well. One of the user-space solutions is liburcu that is a C language library. Earlier, we defined our code comprehension framework for easing the development of RCU solutions. In this paper, we present our visualization techniques for the Microsoft’s Monaco Editor.
{"title":"Visualization of Read-Copy-Update synchronization contexts in C code","authors":"Endre Fülöp, Attila Gyen, Norbert Pataki","doi":"10.33039/ami.2023.08.003","DOIUrl":"https://doi.org/10.33039/ami.2023.08.003","url":null,"abstract":". The Read-Copy-Update (RCU) mechanism is a way of synchronizing concurrent access to variables with the goal of prioritizing read performance over strict consistency guarantees. The main idea behind this mechanism is that RCU avoids the use of lock primitives while multiple threads try to read and update elements concurrently. In this case, elements are linked together through pointers in a shared data structure. RCU is used in the Linux kernel, but there are user-space libraries which implement the technique as well. One of the user-space solutions is liburcu that is a C language library. Earlier, we defined our code comprehension framework for easing the development of RCU solutions. In this paper, we present our visualization techniques for the Microsoft’s Monaco Editor.","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":"79730271","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.07.002
Ruben Frisch, Dóra Éva Dobák, József Udvaros
. Blockchain technology and smart contracts have huge potential which has not been exploited fully yet. The main objective of this paper is to showcase the powerful attributes of blockchain technology and smart contracts, showcasing our unique and powerful use case of document verification in the field of higher education using the Ethereum protocol. Our smart contract use case will take advantage of the main attributes of blockchain technology to solve the problem of document forgery. These amazing attributes are immutability, censorship resistance, extreme robusticity, trans-parency, and neutrality, in addition to near-perfect availability and decentralization. Ethereum enables developers to create decentralized applications without having to invest in expensive infrastructure. Document forgery has a very long track record in the education sector and academia. In this digital age, it has become frighteningly simple and inexpensive to acquire fake university diplomas, certificates, and many other types of credentials. This has a long-term negative effect on higher-level education because it damages the healthy competitive environment of students and the reputation and credibility of institutions. The most problematic version of the diploma which is the most susceptible to forgery is physical diplomas. Even with relatively expensive and difficult-to-replicate security elements, such as holograms and special security markings, these are not efficient enough to keep bad actors away from trying to forge them and replicate them. The more complex meth-ods we use for preventing
{"title":"Blockchain diploma authenticity verification system using smart contract technology","authors":"Ruben Frisch, Dóra Éva Dobák, József Udvaros","doi":"10.33039/ami.2023.07.002","DOIUrl":"https://doi.org/10.33039/ami.2023.07.002","url":null,"abstract":". Blockchain technology and smart contracts have huge potential which has not been exploited fully yet. The main objective of this paper is to showcase the powerful attributes of blockchain technology and smart contracts, showcasing our unique and powerful use case of document verification in the field of higher education using the Ethereum protocol. Our smart contract use case will take advantage of the main attributes of blockchain technology to solve the problem of document forgery. These amazing attributes are immutability, censorship resistance, extreme robusticity, trans-parency, and neutrality, in addition to near-perfect availability and decentralization. Ethereum enables developers to create decentralized applications without having to invest in expensive infrastructure. Document forgery has a very long track record in the education sector and academia. In this digital age, it has become frighteningly simple and inexpensive to acquire fake university diplomas, certificates, and many other types of credentials. This has a long-term negative effect on higher-level education because it damages the healthy competitive environment of students and the reputation and credibility of institutions. The most problematic version of the diploma which is the most susceptible to forgery is physical diplomas. Even with relatively expensive and difficult-to-replicate security elements, such as holograms and special security markings, these are not efficient enough to keep bad actors away from trying to forge them and replicate them. The more complex meth-ods we use for preventing","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":"87996572","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.011
Gábor Kusper, Yang Zijian Győző, B. Nagy
. In this paper, we study how to represent a directed graph as a SAT problem. We study those directed graphs which consists of two strongly connected components (SCC). We reuse the SAT models which are known as the Black-and-White SAT representations. We present the so-called 3rd Solution Lemma: If a directed graph consists of two SCCs, A and B , and there is an edge from A to B , then the corresponding SAT representation has 3 solutions: the black assignment, the white assignment, and the 3rd solution can be written as ¬ A union B . Using this result, we present an important negative result: We cannot represent all SAT problems as directed graphs using the Black-and-White SAT representations. Furthermore, we study the question how to represent an SCC by one Boolean variable to maintain the 3rd Solution Lemma. For that we use extended resolution.
{"title":"Using extended resolution to represent strongly connected components of directed graphs","authors":"Gábor Kusper, Yang Zijian Győző, B. Nagy","doi":"10.33039/ami.2023.08.011","DOIUrl":"https://doi.org/10.33039/ami.2023.08.011","url":null,"abstract":". In this paper, we study how to represent a directed graph as a SAT problem. We study those directed graphs which consists of two strongly connected components (SCC). We reuse the SAT models which are known as the Black-and-White SAT representations. We present the so-called 3rd Solution Lemma: If a directed graph consists of two SCCs, A and B , and there is an edge from A to B , then the corresponding SAT representation has 3 solutions: the black assignment, the white assignment, and the 3rd solution can be written as ¬ A union B . Using this result, we present an important negative result: We cannot represent all SAT problems as directed graphs using the Black-and-White SAT representations. Furthermore, we study the question how to represent an SCC by one Boolean variable to maintain the 3rd Solution Lemma. For that we use extended resolution.","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":"88407085","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
扫码关注我们
求助内容：
应助结果提醒方式：