Pub Date : 2023-01-01DOI: 10.33039/ami.2022.12.002
J. Sztrik, Á. Tóth
. In this paper, a finite-source retrial queueing system with two-way communication is investigated with the help of a simulation program of own. If a randomly arriving request from the finite-source finds the single server idle its service starts immediately, otherwise it joins an orbit from where it generates retrial/repeated calls after a random time. To increase the utilization of the server when it becomes idle after a random time an outgoing request is called for service from an infinity source. Upon its arrival if the server is busy, it goes to a buffer and when the server becomes idle again its service starts immediately. requests arriving from the finite-source and orbit are referred to as primary or incoming ones while requests called from the infinite source are referred to as secondary or outgoing requests, respectively. The service times of the primary and secondary requests are supposed to be random variables having different distributions. However, randomly catastrophic failures may happen to all the requests in the system, that is from the orbit, the service unit, and the buffer. In this case, the primary requests return to the finite-source, and the secondary ones are lost. The operation of the system is restored after a random time. Until the restoration is finished no arrivals and service take place in the system. All the above-mentioned times are supposed to be independent random variables. The novelty of this paper is to perform a sensitivity analysis of the failure and restoration/repair times on the main characteristics to illustrate the effect of different distributions having the same average and variance value. Our
{"title":"Sensitivity analysis of a single server finite-source retrial queueing system with two-way communication and catastrophic breakdown using simulation","authors":"J. Sztrik, Á. Tóth","doi":"10.33039/ami.2022.12.002","DOIUrl":"https://doi.org/10.33039/ami.2022.12.002","url":null,"abstract":". In this paper, a finite-source retrial queueing system with two-way communication is investigated with the help of a simulation program of own. If a randomly arriving request from the finite-source finds the single server idle its service starts immediately, otherwise it joins an orbit from where it generates retrial/repeated calls after a random time. To increase the utilization of the server when it becomes idle after a random time an outgoing request is called for service from an infinity source. Upon its arrival if the server is busy, it goes to a buffer and when the server becomes idle again its service starts immediately. requests arriving from the finite-source and orbit are referred to as primary or incoming ones while requests called from the infinite source are referred to as secondary or outgoing requests, respectively. The service times of the primary and secondary requests are supposed to be random variables having different distributions. However, randomly catastrophic failures may happen to all the requests in the system, that is from the orbit, the service unit, and the buffer. In this case, the primary requests return to the finite-source, and the secondary ones are lost. The operation of the system is restored after a random time. Until the restoration is finished no arrivals and service take place in the system. All the above-mentioned times are supposed to be independent random variables. The novelty of this paper is to perform a sensitivity analysis of the failure and restoration/repair times on the main characteristics to illustrate the effect of different distributions having the same average and variance value. Our","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"35 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75851129","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.001
József Udvaros, Norbert Forman, Dóra Éva Dobák
. The market trends that are determining the electronics industry today point to a sharp increase in the use of IoT devices, sensors are collecting data around us, using wireless data transmission technologies to transmit the measured values to cloud-based databases, which are processed with various software. Low-power microcontrollers developed for battery power, which are widely used today, provide sensor data collection and data transfer control. In this article, we present a literature search on the technical IT teaching tools in use today, some of which are inherently educational and popular with students and teachers. We pay attention to the educational principles of technical IT methods. We show with examples how technical IT solutions can provide an appropriate experiential learning opportunity and background in programming education. We focus on teaching methods that use microcontrollers and various sensors to develop programming skills and acquire programming knowledge. By developing both computational and algorithmic thinking, we aim to develop both skills.
{"title":"Application and impact of electronic solutions in teaching programming","authors":"József Udvaros, Norbert Forman, Dóra Éva Dobák","doi":"10.33039/ami.2023.04.001","DOIUrl":"https://doi.org/10.33039/ami.2023.04.001","url":null,"abstract":". The market trends that are determining the electronics industry today point to a sharp increase in the use of IoT devices, sensors are collecting data around us, using wireless data transmission technologies to transmit the measured values to cloud-based databases, which are processed with various software. Low-power microcontrollers developed for battery power, which are widely used today, provide sensor data collection and data transfer control. In this article, we present a literature search on the technical IT teaching tools in use today, some of which are inherently educational and popular with students and teachers. We pay attention to the educational principles of technical IT methods. We show with examples how technical IT solutions can provide an appropriate experiential learning opportunity and background in programming education. We focus on teaching methods that use microcontrollers and various sensors to develop programming skills and acquire programming knowledge. By developing both computational and algorithmic thinking, we aim to develop both skills.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"50 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76004655","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.002
Balázs Fonyódi, Norbert Pataki, Ádám Révész
. The efficient code execution often requires concurrency, so many programming languages, libraries and framework aim at parallelism. Based on the granularity and abstraction level, many approaches of concurrency are available. However, concurrency carries difficulties but modern ways try to make it more convenient. A rather new solution is cloud computing which enhances the concurrency in a way that standalone virtual machines utilize the shared hardware. Con-tainerization takes advantage of lightweight virtual machines called containers because they use a shared kernel of the operating system. Conteiner orchestration (e.g. Kubernetes) enables containerization among multiple hosts. Serverless programming supports container orchestration for individual function so every trigerred function may run in a different container which is inside a cluster of hosts. In this paper, we briefly present the modern cloud computing ways of concurrency. This subtle distributed approach requires a comprehensive evaluation. We take advantage of the open source Fission serverless framework and implement some distributed algorithms in this realm using the Python programming language. For a deeper comprehension, we measure and evaluate the scalability of Fission framework and the entire system. We execute the distributed algorithms with different sizes of input and we fine-tune the configuration of the Fission framework.
{"title":"Evaluation of scalability in the Fission serverless framework","authors":"Balázs Fonyódi, Norbert Pataki, Ádám Révész","doi":"10.33039/ami.2023.08.002","DOIUrl":"https://doi.org/10.33039/ami.2023.08.002","url":null,"abstract":". The efficient code execution often requires concurrency, so many programming languages, libraries and framework aim at parallelism. Based on the granularity and abstraction level, many approaches of concurrency are available. However, concurrency carries difficulties but modern ways try to make it more convenient. A rather new solution is cloud computing which enhances the concurrency in a way that standalone virtual machines utilize the shared hardware. Con-tainerization takes advantage of lightweight virtual machines called containers because they use a shared kernel of the operating system. Conteiner orchestration (e.g. Kubernetes) enables containerization among multiple hosts. Serverless programming supports container orchestration for individual function so every trigerred function may run in a different container which is inside a cluster of hosts. In this paper, we briefly present the modern cloud computing ways of concurrency. This subtle distributed approach requires a comprehensive evaluation. We take advantage of the open source Fission serverless framework and implement some distributed algorithms in this realm using the Python programming language. For a deeper comprehension, we measure and evaluate the scalability of Fission framework and the entire system. We execute the distributed algorithms with different sizes of input and we fine-tune the configuration of the Fission framework.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"70 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81530223","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.010
K. Sebestyén, Gábor Csapó, M. Csernoch
,
，
{"title":"The effectiveness of the Webtable-Datatable Conversion approach","authors":"K. Sebestyén, Gábor Csapó, M. Csernoch","doi":"10.33039/ami.2022.12.010","DOIUrl":"https://doi.org/10.33039/ami.2022.12.010","url":null,"abstract":",","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"18 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87881592","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.06.001
Szilvia Petzné Tóth, Bernadett Éva Pápai, József Reider
. Learning is nowadays a continuous intellectual readiness to be able to cope with the current needs of the world of work. Students’ knowledge must be adapted accordingly and they must be capable of continuous development throughout their lives [8]. Changes in teaching-learning habits have already been observed at the beginning of the 21st century and those involved in education need to adapt to these changes with the appropriate transition to digital education what is more important today than ever before. We asked our teacher-candidate students in an online questionnaire at the beginning and at the end of the “Teaching Methods in Mathematics” course. Our non-representative survey provided valuable data for course development. The aim of the survey was to find out students’ perceptions of the methods and tools they had learned in education. In the questionnaire at the beginning of the semester, we inquired our students about the types of work and methods they were familiar with, and then they gave their opinions about the different ICT tools, educational programmes and applications and how they were used. At the end of the semester, we interwieved them again whether they still held similar views on the subject or they had managed to change their views during the course.
{"title":"Development opportunities for mobile and ICT learning in teacher education","authors":"Szilvia Petzné Tóth, Bernadett Éva Pápai, József Reider","doi":"10.33039/ami.2023.06.001","DOIUrl":"https://doi.org/10.33039/ami.2023.06.001","url":null,"abstract":". Learning is nowadays a continuous intellectual readiness to be able to cope with the current needs of the world of work. Students’ knowledge must be adapted accordingly and they must be capable of continuous development throughout their lives [8]. Changes in teaching-learning habits have already been observed at the beginning of the 21st century and those involved in education need to adapt to these changes with the appropriate transition to digital education what is more important today than ever before. We asked our teacher-candidate students in an online questionnaire at the beginning and at the end of the “Teaching Methods in Mathematics” course. Our non-representative survey provided valuable data for course development. The aim of the survey was to find out students’ perceptions of the methods and tools they had learned in education. In the questionnaire at the beginning of the semester, we inquired our students about the types of work and methods they were familiar with, and then they gave their opinions about the different ICT tools, educational programmes and applications and how they were used. At the end of the semester, we interwieved them again whether they still held similar views on the subject or they had managed to change their views during the course.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"3 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78507856","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.007
L. Szathmary
. In this paper we present an incremental algorithm for computing the transversal hypergraph. Our algorithm is an optimized version of Berge’s algorithm [2] for solving the transversal hypergraph problem. The original algorithm of Berge is the simplest and most direct scheme for generating all minimal transversals of a hypergraph. Here we present an optimized version of Berge’s algorithm that we call BergeOpt . We show that BergeOpt can significantly reduce the number of expensive inclusion tests
{"title":"An incremental algorithm for computing the transversal hypergraph","authors":"L. Szathmary","doi":"10.33039/ami.2023.08.007","DOIUrl":"https://doi.org/10.33039/ami.2023.08.007","url":null,"abstract":". In this paper we present an incremental algorithm for computing the transversal hypergraph. Our algorithm is an optimized version of Berge’s algorithm [2] for solving the transversal hypergraph problem. The original algorithm of Berge is the simplest and most direct scheme for generating all minimal transversals of a hypergraph. Here we present an optimized version of Berge’s algorithm that we call BergeOpt . We show that BergeOpt can significantly reduce the number of expensive inclusion tests","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"29 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89282541","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.008
Zijian Győző Yang, L. Laki
. In recent times, our research has focused on training large language models and exploring their potential. With the emergence of Chat-GPT, it has been demonstrated that it is possible to fine-tune language models in a task-agnostic way. The success of ChatGPT is attributed to the reinforcement learning method, which integrates human feedback into the language model fine-tuning process. As a part of our research, we initially adapted the method of reinforcement learning for a specific task, which is machine translation, respectively. In this paper, we propose a novel approach to enhance machine translation with reinforcement learning and quality estimation methods. Our proposed approach uses reinforcement learning to learn to adjust the machine translation output based on quality estimation feed-back, with the goal of improving the overall translation quality. We evaluated our approach on the WMT09 dataset for English-Hungarian language pair. We conducted an analysis to show how our approach improves the quality of machine translation output. Our approach offers a promising avenue for enhancing the quality of machine translation and demonstrates the potential of utilizing reinforcement learning to improve other natural language processing tasks.
{"title":"Enhancing machine translation with quality estimation and reinforcement learning","authors":"Zijian Győző Yang, L. Laki","doi":"10.33039/ami.2023.08.008","DOIUrl":"https://doi.org/10.33039/ami.2023.08.008","url":null,"abstract":". In recent times, our research has focused on training large language models and exploring their potential. With the emergence of Chat-GPT, it has been demonstrated that it is possible to fine-tune language models in a task-agnostic way. The success of ChatGPT is attributed to the reinforcement learning method, which integrates human feedback into the language model fine-tuning process. As a part of our research, we initially adapted the method of reinforcement learning for a specific task, which is machine translation, respectively. In this paper, we propose a novel approach to enhance machine translation with reinforcement learning and quality estimation methods. Our proposed approach uses reinforcement learning to learn to adjust the machine translation output based on quality estimation feed-back, with the goal of improving the overall translation quality. We evaluated our approach on the WMT09 dataset for English-Hungarian language pair. We conducted an analysis to show how our approach improves the quality of machine translation output. Our approach offers a promising avenue for enhancing the quality of machine translation and demonstrates the potential of utilizing reinforcement learning to improve other natural language processing tasks.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"2 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90571991","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.001
Gaurav Mittal, R. Sharma
. In this paper, we discuss the Wedderburn decompositions of the semisimple group algebras of all groups up to order 120. More precisely, we explicitly compute the Wedderburn decompositions of the semisimple group algebras of 26 non-metabelian groups
{"title":"Computation of the Wedderburn decomposition of semisimple group algebras of groups up to order 120","authors":"Gaurav Mittal, R. Sharma","doi":"10.33039/ami.2023.07.001","DOIUrl":"https://doi.org/10.33039/ami.2023.07.001","url":null,"abstract":". In this paper, we discuss the Wedderburn decompositions of the semisimple group algebras of all groups up to order 120. More precisely, we explicitly compute the Wedderburn decompositions of the semisimple group algebras of 26 non-metabelian groups","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"67 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83978924","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.05.001
K. Prasad, Hrishikesh Mahato
. In this paper, we study the generalized Fibonacci like sequences { 𝑡 𝑘,𝑛 } 𝑘 ∈{ 2 , 3 } ,𝑛 ∈ N with arbitrary initial seed and give some new and well- known identities like Binet’s formula, trace sequence, Catalan’s identity, generating function, etc. Further, we study various properties of these generalized sequences, establish a recursive matrix and relationships with Fibonacci and Lucas numbers and sequence of Fibonacci traces. In this study, we exam-ine the nature of identities and recursive matrices for arbitrary initial values.
{"title":"On the generalized Fibonacci like sequences and matrices","authors":"K. Prasad, Hrishikesh Mahato","doi":"10.33039/ami.2023.05.001","DOIUrl":"https://doi.org/10.33039/ami.2023.05.001","url":null,"abstract":". In this paper, we study the generalized Fibonacci like sequences { 𝑡 𝑘,𝑛 } 𝑘 ∈{ 2 , 3 } ,𝑛 ∈ N with arbitrary initial seed and give some new and well- known identities like Binet’s formula, trace sequence, Catalan’s identity, generating function, etc. Further, we study various properties of these generalized sequences, establish a recursive matrix and relationships with Fibonacci and Lucas numbers and sequence of Fibonacci traces. In this study, we exam-ine the nature of identities and recursive matrices for arbitrary initial values.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"54 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76000644","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.004
B. Nagy
. Watson-Crick automata are belonging to the natural computing paradigm as these finite automata are working on strings representing DNA molecules. Watson-Crick automata have two reading heads, and in the 5 ′ → 3 ′ models these two heads start from the two extremes of the input. This is well motivated by the fact that DNA strands have 5 ′ and 3 ′ ends based on the fact which carbon atoms of the sugar group is used in the covalent bonds to continue the strand. However, in the two stranded DNA, the directions of the strands are opposite, so that, if an enzyme would read the strand it may read each strand in its 5 ′ to 3 ′ direction, which means physically opposite directions starting from the two extremes of the molecule. On the other hand, enzymes may not have inner states, thus those Watson-Crick automata which are stateless (i.e. have exactly one state) are more realistic from this point of view. In this paper these stateless 5 ′ → 3 ′ Watson-Crick automata are studied and some properties of the language classes accepted by their variants are proven. We show hierarchy results, and also a “pumping”, i.e., iteration result for these languages that can be used to prove that some languages may not be in the class accepted by the class of stateless 5 ′ → 3 ′ Watson-Crick automata.
{"title":"On language classes accepted by stateless 5′ → 3′ Watson-Crick finite automata","authors":"B. Nagy","doi":"10.33039/ami.2023.08.004","DOIUrl":"https://doi.org/10.33039/ami.2023.08.004","url":null,"abstract":". Watson-Crick automata are belonging to the natural computing paradigm as these finite automata are working on strings representing DNA molecules. Watson-Crick automata have two reading heads, and in the 5 ′ → 3 ′ models these two heads start from the two extremes of the input. This is well motivated by the fact that DNA strands have 5 ′ and 3 ′ ends based on the fact which carbon atoms of the sugar group is used in the covalent bonds to continue the strand. However, in the two stranded DNA, the directions of the strands are opposite, so that, if an enzyme would read the strand it may read each strand in its 5 ′ to 3 ′ direction, which means physically opposite directions starting from the two extremes of the molecule. On the other hand, enzymes may not have inner states, thus those Watson-Crick automata which are stateless (i.e. have exactly one state) are more realistic from this point of view. In this paper these stateless 5 ′ → 3 ′ Watson-Crick automata are studied and some properties of the language classes accepted by their variants are proven. We show hierarchy results, and also a “pumping”, i.e., iteration result for these languages that can be used to prove that some languages may not be in the class accepted by the class of stateless 5 ′ → 3 ′ Watson-Crick automata.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87166769","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
扫码关注我们
求助内容：
应助结果提醒方式：