Pub Date : 2023-01-01DOI: 10.58245/ipsi.tir.2301.05
Endre Fulop, Attila Gyen, Norbert Pataki
Exception handling is a beneficial language construct in modern programming languages. However, C++’s type system does not really conform to these elements. As a consequence, developers have to pay attention to avoid mistakes because of the missing compiler support. Moreover, C++11 provides an approach in which exceptions appear in the function’s signature in an inverse manner compared to the earlier standards. Static analysis is an approach in which we reason about a program based on the source with no execution of the analyzed code. It can be used for many purposes, for instance, finding bugs, refactoring the code, or measuring code complexity. In this paper, we analyze how the older style exception specifications can be rejuvenated for modern idioms. Explicitly marking the functions as having a guaranteed exception-free execution is the primary way since C++11. We develop a static analyzer tool for providing hints for these specifications. We evaluate our method with the analysis of open-source projects. Based on the previous evaluation, not using the strictest possible exception-specification is a problem that occurred in every analyzed project. We would like to assist developers in identifying instances of this problem by providing an integrated comprehension tool, that enables them to make use of the exception analysis results in an interactive way in their IDEs.
{"title":"Monaco Support for an Improved Exception Specification in C++","authors":"Endre Fulop, Attila Gyen, Norbert Pataki","doi":"10.58245/ipsi.tir.2301.05","DOIUrl":"https://doi.org/10.58245/ipsi.tir.2301.05","url":null,"abstract":"Exception handling is a beneficial language construct in modern programming languages. However, C++’s type system does not really conform to these elements. As a consequence, developers have to pay attention to avoid mistakes because of the missing compiler support. Moreover, C++11 provides an approach in which exceptions appear in the function’s signature in an inverse manner compared to the earlier standards. Static analysis is an approach in which we reason about a program based on the source with no execution of the analyzed code. It can be used for many purposes, for instance, finding bugs, refactoring the code, or measuring code complexity. In this paper, we analyze how the older style exception specifications can be rejuvenated for modern idioms. Explicitly marking the functions as having a guaranteed exception-free execution is the primary way since C++11. We develop a static analyzer tool for providing hints for these specifications. We evaluate our method with the analysis of open-source projects. Based on the previous evaluation, not using the strictest possible exception-specification is a problem that occurred in every analyzed project. We would like to assist developers in identifying instances of this problem by providing an integrated comprehension tool, that enables them to make use of the exception analysis results in an interactive way in their IDEs.","PeriodicalId":41192,"journal":{"name":"IPSI BgD Transactions on Internet Research","volume":"38 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85754306","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.58245/ipsi.tir.2301.03
Marek Kvet, J. Janáček
Determination of the Pareto front of location problem solutions represents one of the very complex and computational time demanding tasks, when solved by exact means of mathematical programming. This paper is motivated by possible application of the metaheuristic simulated annealing to the process of obtaining a close approximation of the Pareto front by a set of non-dominated solutions of the p-location problem. Contrary to the other approaches, the suggested method is based on minimization of non-dominated solution set area, which directly describes quality of the approximation. Elements of the simulated annealing method are used for random breaking some limits imposed on local characteristics of the improving process. The presented results of the numerical experiments give an insight to relations among the simulated annealing parameters and optimization process efficiency.
{"title":"Elements of simulated annealing in Pareto front search","authors":"Marek Kvet, J. Janáček","doi":"10.58245/ipsi.tir.2301.03","DOIUrl":"https://doi.org/10.58245/ipsi.tir.2301.03","url":null,"abstract":"Determination of the Pareto front of location problem solutions represents one of the very complex and computational time demanding tasks, when solved by exact means of mathematical programming. This paper is motivated by possible application of the metaheuristic simulated annealing to the process of obtaining a close approximation of the Pareto front by a set of non-dominated solutions of the p-location problem. Contrary to the other approaches, the suggested method is based on minimization of non-dominated solution set area, which directly describes quality of the approximation. Elements of the simulated annealing method are used for random breaking some limits imposed on local characteristics of the improving process. The presented results of the numerical experiments give an insight to relations among the simulated annealing parameters and optimization process efficiency.","PeriodicalId":41192,"journal":{"name":"IPSI BgD Transactions on Internet Research","volume":"22 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82670987","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.58245/ipsi.tir.2301.10
P. Voštinár, Michal Šrobár
Electroencephalography (EEG) and a braincomputer interface (BCI) are relatively young technologies, that in some cases could replace the classic computer mouse control. We are using EEG and BCI to control computer games, which have always been very popular with people of all ages. In the paper, we focus on using the Epoc helmet for controlling two games, which we created in the Unity game engine. In the first game "Ball and Mind" the player's task is to navigate a ball from start to finish through a maze. The second game, "Objector of Mind“, is focused on avoiding obstacles with an Epoc helmet. The player controls a cube and he has to avoid obstacles that come to him with a gap.
脑电图(EEG)和脑机接口(BCI)是相对年轻的技术，在某些情况下可以取代传统的电脑鼠标控制。我们正在使用脑电图和脑机接口来控制电脑游戏，这些游戏一直很受各个年龄段的人的欢迎。在本文中，我们专注于使用Epoc头盔来控制我们在Unity游戏引擎中创建的两款游戏。在第一款游戏“Ball and Mind”中，玩家的任务是在迷宫中从头到尾引导一个球。第二个游戏，“心灵的反对者”，重点是用一个时代头盔避开障碍物。玩家控制着一个立方体，他必须避开带有空隙的障碍物。
{"title":"Creating computer games that are controlled by EEG helmets","authors":"P. Voštinár, Michal Šrobár","doi":"10.58245/ipsi.tir.2301.10","DOIUrl":"https://doi.org/10.58245/ipsi.tir.2301.10","url":null,"abstract":"Electroencephalography (EEG) and a braincomputer interface (BCI) are relatively young technologies, that in some cases could replace the classic computer mouse control. We are using EEG and BCI to control computer games, which have always been very popular with people of all ages. In the paper, we focus on using the Epoc helmet for controlling two games, which we created in the Unity game engine. In the first game \"Ball and Mind\" the player's task is to navigate a ball from start to finish through a maze. The second game, \"Objector of Mind“, is focused on avoiding obstacles with an Epoc helmet. The player controls a cube and he has to avoid obstacles that come to him with a gap.","PeriodicalId":41192,"journal":{"name":"IPSI BgD Transactions on Internet Research","volume":"64 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90623896","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.58245/ipsi.tir.2301.09
Filip Gurbáľ, J. Poruban
When testers design test cases based only on specification, they can introduce significant redundancies into them and also create gaps of untested software. More insight into the impact of test cases on implementation can guide testers to design more effective test cases to cover implementation and prevent redundancies to save time. In this paper we describe challenges of UI tester and how we can help them using coverage analysis of UI source code. We prepared infrastructure to automatically collect code coverage data from UI testing for further analysis.
{"title":"Collecting Code Coverage from UI Testing","authors":"Filip Gurbáľ, J. Poruban","doi":"10.58245/ipsi.tir.2301.09","DOIUrl":"https://doi.org/10.58245/ipsi.tir.2301.09","url":null,"abstract":"When testers design test cases based only on specification, they can introduce significant redundancies into them and also create gaps of untested software. More insight into the impact of test cases on implementation can guide testers to design more effective test cases to cover implementation and prevent redundancies to save time. In this paper we describe challenges of UI tester and how we can help them using coverage analysis of UI source code. We prepared infrastructure to automatically collect code coverage data from UI testing for further analysis.","PeriodicalId":41192,"journal":{"name":"IPSI BgD Transactions on Internet Research","volume":"2 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89282931","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.58245/ipsi.tir.2301.02
Michal Kvet
Ensuring data integrity stored in a database requires change encapsulation in a transaction. Transaction maintains consistency by shifting the database from one consistent state to another, protected by atomicity, isolation, and durability. This paper focuses on the isolation and parallelism allowing distributed access to the data tuple across multiple transactions. Access to the data tuple is marked by the locks applied on the row level. Locks can be shared expressing data retrieval process or exclusive intended to change the values of the columns. The general locking rule takes the lock before the operation and releases it just after the operation or at the end of the transaction. Oracle database, however, does not release the lock physically, whereas the data block access would be necessary to be reloaded during the transaction approval. Therefore, this paper aims in optimizing the process of unlocking data before the data retrieval process using multiple strategies.
{"title":"Concept of Select Unlocking Optimization","authors":"Michal Kvet","doi":"10.58245/ipsi.tir.2301.02","DOIUrl":"https://doi.org/10.58245/ipsi.tir.2301.02","url":null,"abstract":"Ensuring data integrity stored in a database requires change encapsulation in a transaction. Transaction maintains consistency by shifting the database from one consistent state to another, protected by atomicity, isolation, and durability. This paper focuses on the isolation and parallelism allowing distributed access to the data tuple across multiple transactions. Access to the data tuple is marked by the locks applied on the row level. Locks can be shared expressing data retrieval process or exclusive intended to change the values of the columns. The general locking rule takes the lock before the operation and releases it just after the operation or at the end of the transaction. Oracle database, however, does not release the lock physically, whereas the data block access would be necessary to be reloaded during the transaction approval. Therefore, this paper aims in optimizing the process of unlocking data before the data retrieval process using multiple strategies.","PeriodicalId":41192,"journal":{"name":"IPSI BgD Transactions on Internet Research","volume":"7 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85151636","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.58245/ipsi.tir.2301.08
William Steingartner, D. Radaković, Richard Zsiga
In this article, we present a practical way to visualize natural semantics calculations for a selected domain-specific language for motion control of a robot in an orthogonal grid. Natural semantics is important from the point of view of verifying the properties of the language and for expressing the dynamics of the calculation and the construction of a set of states during the calculation. Domain-specific languages are used more and more in practice, therefore their inclusion in the curriculum of the subject Semantics of Programming Languages is a significant innovation of the traditional way of teaching the semantics of (mostly) imperative languages. In the article, we present the basics of the natural semantics of the robot language and its software visualization. For this, we have developed an application, the use of which is of great importance in the teaching itself and allows students to easily understand the basics of formal semantics thanks to interactivity.
{"title":"Some Aspects about Visualization of Natural Semantics for a Selected Domain-Specific Language","authors":"William Steingartner, D. Radaković, Richard Zsiga","doi":"10.58245/ipsi.tir.2301.08","DOIUrl":"https://doi.org/10.58245/ipsi.tir.2301.08","url":null,"abstract":"In this article, we present a practical way to visualize natural semantics calculations for a selected domain-specific language for motion control of a robot in an orthogonal grid. Natural semantics is important from the point of view of verifying the properties of the language and for expressing the dynamics of the calculation and the construction of a set of states during the calculation. Domain-specific languages are used more and more in practice, therefore their inclusion in the curriculum of the subject Semantics of Programming Languages is a significant innovation of the traditional way of teaching the semantics of (mostly) imperative languages. In the article, we present the basics of the natural semantics of the robot language and its software visualization. For this, we have developed an application, the use of which is of great importance in the teaching itself and allows students to easily understand the basics of formal semantics thanks to interactivity.","PeriodicalId":41192,"journal":{"name":"IPSI BgD Transactions on Internet Research","volume":"30 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90872743","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.58245/ipsi.tir.2301.06
Sergej Chodarev, Sharoon Ilyas
Most of the parser tools are concentrated on concrete syntax and grammar definition. This paper describes a language definition tool that uses a metamodel specification instead of grammar as the basis of the language definition. Inspired by a similar Java tool known as YAJCo, the metamodel is defined using usual object-oriented techniques—as classes in the Python programming language, and the result of the parsing process is a graph of objects. The tool is demonstrated in a case study of a simple imperative programming language. We explain our design decisions and also demonstrate the suitability of a dynamic language such, as Python, for this task.
{"title":"Metamodel-based Language Definition with Python","authors":"Sergej Chodarev, Sharoon Ilyas","doi":"10.58245/ipsi.tir.2301.06","DOIUrl":"https://doi.org/10.58245/ipsi.tir.2301.06","url":null,"abstract":"Most of the parser tools are concentrated on concrete syntax and grammar definition. This paper describes a language definition tool that uses a metamodel specification instead of grammar as the basis of the language definition. Inspired by a similar Java tool known as YAJCo, the metamodel is defined using usual object-oriented techniques—as classes in the Python programming language, and the result of the parsing process is a graph of objects. The tool is demonstrated in a case study of a simple imperative programming language. We explain our design decisions and also demonstrate the suitability of a dynamic language such, as Python, for this task.","PeriodicalId":41192,"journal":{"name":"IPSI BgD Transactions on Internet Research","volume":"9 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76200900","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.58245/ipsi.tir.2301.11
Vitalii Tsimbolynets, J. Perháč
We teach the subject of the semantics of programming languages at the graduate level, where we present different approaches to the definition of formal semantics for imperative languages. In this paper, we present a new teaching tool for visualization of semantics computation of a toy imperative language by the small-step semantic method. We have developed a responsive web application that simulates a computation of a program’s semantics as is done by hand on a blackboard.
{"title":"Visualization Tool for Structural Operational Semantics of Simple Imperative Language","authors":"Vitalii Tsimbolynets, J. Perháč","doi":"10.58245/ipsi.tir.2301.11","DOIUrl":"https://doi.org/10.58245/ipsi.tir.2301.11","url":null,"abstract":"We teach the subject of the semantics of programming languages at the graduate level, where we present different approaches to the definition of formal semantics for imperative languages. In this paper, we present a new teaching tool for visualization of semantics computation of a toy imperative language by the small-step semantic method. We have developed a responsive web application that simulates a computation of a program’s semantics as is done by hand on a blackboard.","PeriodicalId":41192,"journal":{"name":"IPSI BgD Transactions on Internet Research","volume":"149 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76825560","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.58245/ipsi.tir.2301.04
A. Dudáš, J. Škrinárová
Methods of data manipulation in combination with sturcture of the data and integrity constraints define data model used in the relational databases. This article focuses on the methods and processes of operation sets which are used for selection of data from relational database and translation between various formats of this manipulation. The article presents the design, implementation and experimental evaluation of tool for translating between relational algebra, tuple relational calculus, Structured Query Language and unrestricted natural language in all directions. Presented software tool translates from natural language with the use of artificial intelligence methods for natural language processing, syntactic analysis and parsing. Generative pretrained transformer of third generation (GPT3) based Codex – Davinci translation model was used as an artificial intelligence method used in the workflow of translation from English language to relational languages.
{"title":"Natural Language Processing in Translation of Relational Languages","authors":"A. Dudáš, J. Škrinárová","doi":"10.58245/ipsi.tir.2301.04","DOIUrl":"https://doi.org/10.58245/ipsi.tir.2301.04","url":null,"abstract":"Methods of data manipulation in combination with sturcture of the data and integrity constraints define data model used in the relational databases. This article focuses on the methods and processes of operation sets which are used for selection of data from relational database and translation between various formats of this manipulation. The article presents the design, implementation and experimental evaluation of tool for translating between relational algebra, tuple relational calculus, Structured Query Language and unrestricted natural language in all directions. Presented software tool translates from natural language with the use of artificial intelligence methods for natural language processing, syntactic analysis and parsing. Generative pretrained transformer of third generation (GPT3) based Codex – Davinci translation model was used as an artificial intelligence method used in the workflow of translation from English language to relational languages.","PeriodicalId":41192,"journal":{"name":"IPSI BgD Transactions on Internet Research","volume":"73 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87534875","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.58245/ipsi.tir.2301.07
Petr Šaloun, M. Kolářová, Milan Klement, Kvetoslav Bartek, David Andresic, M. Malčík
The text focuses on dangerous phenomena in communication via online platforms. It defines the key terms for this area and informs about the selected research conducted in the Czech Republic. In our own research, we focused on the issue of teenage sexting on a specific communication platform - Instagram. This platform is very popular among Czech teenagers, as it is worldwide. The platform very often ranks among the top 3 most popular platforms, it allows sending and sharing both text and graphic messages - pictures, gifs and video sequences. In 2021, we conducted an online research survey among nearly 3,500 respondents aged 15 - 20. We were interested in whether and to what extent the respondents have experienced sexting, what is the ratio of male to female recipients of sexting or sexual content, who is the most frequent sender of sexting content etc. We were also interested in the topic of safety in social networks. The results of the survey then show a greater need to promote information literacy, computational thinking and safe behavior on social networks as well as safe use of ICT.
{"title":"Czech teens’ experiences with sexting on Instagram","authors":"Petr Šaloun, M. Kolářová, Milan Klement, Kvetoslav Bartek, David Andresic, M. Malčík","doi":"10.58245/ipsi.tir.2301.07","DOIUrl":"https://doi.org/10.58245/ipsi.tir.2301.07","url":null,"abstract":"The text focuses on dangerous phenomena in communication via online platforms. It defines the key terms for this area and informs about the selected research conducted in the Czech Republic. In our own research, we focused on the issue of teenage sexting on a specific communication platform - Instagram. This platform is very popular among Czech teenagers, as it is worldwide. The platform very often ranks among the top 3 most popular platforms, it allows sending and sharing both text and graphic messages - pictures, gifs and video sequences. In 2021, we conducted an online research survey among nearly 3,500 respondents aged 15 - 20. We were interested in whether and to what extent the respondents have experienced sexting, what is the ratio of male to female recipients of sexting or sexual content, who is the most frequent sender of sexting content etc. We were also interested in the topic of safety in social networks. The results of the survey then show a greater need to promote information literacy, computational thinking and safe behavior on social networks as well as safe use of ICT.","PeriodicalId":41192,"journal":{"name":"IPSI BgD Transactions on Internet Research","volume":"28 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82273369","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
扫码关注我们
求助内容：
应助结果提醒方式：