Pub Date : 2022-06-30DOI: 10.5604/01.3001.0015.8607
Jaroslaw Wilk
Integration platforms are the solution increasingly used by the public administration in Poland in order to make public tasks available and implement the tasks on these platforms (in the form of electronic services). In earlier publications, the author proposed a mathematical model based on lattice mechanisms that ensures the secure provision of these services (from a confidentiality perspective). In the following publication the author's model was cited (its main elements) and then the analysis of a time efficiency of the approach with using lattice mechanisms with the general model was performed. The efficiency examined concerned both the implementation of public tasks – and more precisely the verification of their correctness from the security perspective before the implementation as well as concerned an expansion of the process of handling the public task. The author has demonstrated that in both cases it is appropriate to use the lattice solution, as its time efficiency is better.
{"title":"Efficiency of lattice-based security mechanisms supporting public tasks on digital integration platforms","authors":"Jaroslaw Wilk","doi":"10.5604/01.3001.0015.8607","DOIUrl":"https://doi.org/10.5604/01.3001.0015.8607","url":null,"abstract":"Integration platforms are the solution increasingly used by the public administration in Poland in order to make public tasks available and implement the tasks on these platforms (in the form of electronic services). \u0000In earlier publications, the author proposed a mathematical model based on lattice mechanisms that ensures the secure provision of these services (from a confidentiality perspective). In the following publication the author's model was cited (its main elements) and then the analysis of a time efficiency of the approach with using lattice mechanisms with the general model was performed. The efficiency examined concerned both \u0000the implementation of public tasks – and more precisely the verification of their correctness from the security perspective before the implementation as well as concerned an expansion of the process of handling the public task. The author has demonstrated that in both cases it is appropriate to use the lattice solution, as its time efficiency is better.\u0000\u0000","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125416730","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 : 2022-06-30DOI: 10.5604/01.3001.0015.8614
B. Szafranski, Jaroslaw Wójcik
The results of the analysis of factors influencing the emergence of dangerous situations in the air (in short, aviation incidents) in the Polish Army show a significant negative impact of the environment on the flight operations performed. The most common cause of an aviation incident in the area of the environment is the collision of the aircraft with birds. The lack of methods for the continuous monitoring and forecasting of the level of risk of collision between aircraft and birds makes a significant gap in a proactive approach to the safety of flights in the Air Force of the Republic of Poland. This paper presents an overview of the most important methods for detection and forecasting of bird flight intensity, which have been used for construction of systems aiming to prevent collisions with birds and which are employed by the air forces of the United States, the Netherlands, Belgium and Israel. An accurate analysis of the models and algorithms used in the selected methods shows contemporary trends in research on the negative impact of the environment on flight safety. These methods show incomplete usefulness in Poland’s conditions, which justifies the need to develop a more appropriate method.
{"title":"Analysis of models and algorithms used operationally in methods for the continuous monitoring of bird collision hazards","authors":"B. Szafranski, Jaroslaw Wójcik","doi":"10.5604/01.3001.0015.8614","DOIUrl":"https://doi.org/10.5604/01.3001.0015.8614","url":null,"abstract":"The results of the analysis of factors influencing the emergence of dangerous situations in the air (in short, aviation incidents) in the Polish Army show a significant negative impact of the environment on the flight operations performed. The most common cause of an aviation incident in the area of the environment is the collision of the aircraft with birds. The lack of methods for the continuous monitoring and forecasting of the level of risk of collision between aircraft and birds makes a significant gap in a proactive approach to the safety of flights in the Air Force of the Republic of Poland. This paper presents an overview of the most important methods for detection and forecasting of bird flight intensity, which have been used for construction of systems aiming to prevent collisions with birds and which are employed by the air forces of the United States, the Netherlands, Belgium and Israel. An accurate analysis of the models and algorithms used in the selected methods shows contemporary trends in research on the negative impact of the environment on flight safety. These methods show incomplete usefulness in Poland’s conditions, which justifies the need to develop a more appropriate method.\u0000\u0000","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123845647","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 : 2021-06-30DOI: 10.5604/01.3001.0015.2733
Michał Gałusza
Article provides review on current most popular text processing technics; sketches their evolution and compares sequence and dependency models in detecting semantic relationship between words.
{"title":"Rewiev of current text representation technics for semantic relationship extraction","authors":"Michał Gałusza","doi":"10.5604/01.3001.0015.2733","DOIUrl":"https://doi.org/10.5604/01.3001.0015.2733","url":null,"abstract":"Article provides review on current most popular text processing technics; sketches their evolution and compares sequence and dependency models in detecting semantic relationship between words.\u0000\u0000","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133597315","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 : 2021-06-30DOI: 10.5604/01.3001.0015.2732
A. Ameljanczyk
The paper presents a several new definitions of concepts regarding the properties of fuzzy sets in the aspect of their use in decision support processes. These are concepts such as the image and counter – image of the fuzzy set, the proper fuzzy set, the fuzzy support and the ranking of fuzzy set. These concepts can be important in construction decision support algorithms. Particularly a lot of space was devoted to the study of the properties of membership function of the fuzzy set as a result of operations on fuzzy sets. Two additional postulates were formulated that should be fulfilled by the membership function product of fuzzy sets in decision making.
{"title":"The role of properties of the membership function in construction of fuzzy sets ranking","authors":"A. Ameljanczyk","doi":"10.5604/01.3001.0015.2732","DOIUrl":"https://doi.org/10.5604/01.3001.0015.2732","url":null,"abstract":"The paper presents a several new definitions of concepts regarding the properties of fuzzy sets in the aspect of their use in decision support processes. These are concepts such as the image and counter – image of the fuzzy set, the proper fuzzy set, the fuzzy support and the ranking of fuzzy set. These concepts can be important in construction decision support algorithms. Particularly a lot of space was devoted to the study of the properties of membership function of the fuzzy set as a result of operations on fuzzy sets. Two additional postulates were formulated that should be fulfilled by the membership function product of fuzzy sets in decision making.\u0000\u0000","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130625317","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 : 2021-06-30DOI: 10.5604/01.3001.0015.2735
M. Mazurek, Mateusz Romaniuk
This paper describes the issue of authorship attribution based on the content of conversations originating from instant messaging software applications. The results presented in the paper refer to the corpus of conversations conducted in Polish. On the basis of a standardised model of the corpus of conversations, stylometric features were extracted, which were divided into four groups: word and message length distributions, character frequencies, tf-idf matrix and features extracted on the basis of turns (conversational features). The vectors of users’ stylometric features were compared in pairs by using Euclidean, cosine and Manhattan metrics. CMC curves were used to analyse the significance of the feature groups and the effectiveness of the metrics for identifying similar speech styles. The best results were obtained by the group of features being the tf-idf matrix compared with the use of cosine distance and the group of features extracted on the basis of turns compared with the use of the Manhattan metric.
{"title":"Attribution of authorship in instant messaging software applications, based on similarity measures of the stylometric features’ vector","authors":"M. Mazurek, Mateusz Romaniuk","doi":"10.5604/01.3001.0015.2735","DOIUrl":"https://doi.org/10.5604/01.3001.0015.2735","url":null,"abstract":"This paper describes the issue of authorship attribution based on the content of conversations originating \u0000from instant messaging software applications. The results presented in the paper refer to the corpus of conversations conducted in Polish. On the basis of a standardised model of the corpus of conversations, stylometric features were extracted, which were divided into four groups: word and message length distributions, character frequencies, tf-idf matrix and features extracted on the basis of turns (conversational features). The vectors of users’ stylometric features were compared in pairs by using Euclidean, cosine and Manhattan metrics. CMC curves were used to analyse the significance of the feature groups and the effectiveness of the metrics for identifying similar speech styles. The best results were obtained by the group of features being the tf-idf matrix compared with the use of cosine distance and the group of features extracted on the basis of turns compared with the use of the Manhattan metric.\u0000\u0000","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114795201","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 : 2021-06-30DOI: 10.5604/01.3001.0015.2734
Kacper Lenkiewicz, J. Wiśniewska
The paper is based on a thesis with the same title. The purpose of this thesis is to analyse D-Wave devices using quantum effects. The research focuses on demonstrating the advantages and disadvantages of a company moving away from the circuit model in its computers. The subject of the research is the used adiabatic model of quantum computing based on the mechanism of quantum annealing. The research is based on publicly available, comprehensive documentation of D-Wave Systems. On the basis of scientific papers, conferences and information contained in websites, controversies, disadvantages and advantages of the solutions adopted have been described.
{"title":"The D-Wave quantum computer – advantages and disadvantages of moving away from the circuit model","authors":"Kacper Lenkiewicz, J. Wiśniewska","doi":"10.5604/01.3001.0015.2734","DOIUrl":"https://doi.org/10.5604/01.3001.0015.2734","url":null,"abstract":"The paper is based on a thesis with the same title. The purpose of this thesis is to analyse D-Wave devices using quantum effects. The research focuses on demonstrating the advantages and disadvantages of a company moving away from the circuit model in its computers. The subject of the research is the used adiabatic model of quantum computing based on the mechanism of quantum annealing. The research is based on publicly available, comprehensive documentation of D-Wave Systems. On the basis of scientific papers, conferences and information contained in websites, controversies, disadvantages and advantages of the solutions adopted have been described.\u0000\u0000","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133314096","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 : 2020-09-30DOI: 10.5604/01.3001.0014.4437
Chung-Nguyen Tran, A. Ameljanczyk
The paper presents a proposal of a new method for clustering search results. The method uses an external knowledge resource, which can be, for example, Wikipedia. Wikipedia – the largest encyclopedia, is a free and popular knowledge resource which is used to extract topics from short texts. Similarities between documents are calculated based on the similarities between these topics. After that, affinity propagation clustering algorithm is employed to cluster web search results. Proposed method is tested by AMBIENT dataset and evaluated within the experimental framework provided by a SemEval-2013 task. The paper also suggests new method to compare global performance of algorithms using multi – criteria analysis.
{"title":"Clustering web search results using Wikipedia resource","authors":"Chung-Nguyen Tran, A. Ameljanczyk","doi":"10.5604/01.3001.0014.4437","DOIUrl":"https://doi.org/10.5604/01.3001.0014.4437","url":null,"abstract":"The paper presents a proposal of a new method for clustering search results. The method uses an external knowledge resource, which can be, for example, Wikipedia. Wikipedia – the largest encyclopedia, is a free and popular knowledge resource which is used to extract topics from short texts. Similarities between documents are calculated based on the similarities between these topics. After that, affinity propagation clustering algorithm is employed to cluster web search results. Proposed method is tested by AMBIENT dataset and evaluated within the experimental framework provided by a SemEval-2013 task. The paper also suggests new method to compare global performance of algorithms using multi – criteria analysis.\u0000\u0000","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134502802","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 : 2019-03-25DOI: 10.5604/01.3001.0013.1458
Maciej Jankowski
Topic models are very popular methods of text analysis. The most popular algorithm for topic modelling is LDA (Latent Dirichlet Allocation). Recently, many new methods were proposed, that enable the usage of this model in large scale processing. One of the problem is, that a data scientist has to choose the number of topics manually. This step, requires some previous analysis. A few methods were proposed to automatize this step, but none of them works very well if LDA is used as a preprocessing for further classification. In this paper, we propose an ensemble approach which allows us to use more than one model at prediction phase, at the same time, reducing the need of finding a single best number of topics. We have also analyzed a few methods of estimating topic number.
{"title":"Ensemble Methods for Improving Classification of Data Produced by Latent Dirichlet Allocation","authors":"Maciej Jankowski","doi":"10.5604/01.3001.0013.1458","DOIUrl":"https://doi.org/10.5604/01.3001.0013.1458","url":null,"abstract":"Topic models are very popular methods of text analysis. The most popular algorithm for topic modelling is LDA (Latent Dirichlet Allocation). Recently, many new methods were proposed, that enable the usage of this model in large scale processing. One of the problem is, that a data scientist has to choose the number of topics manually. This step, requires some previous analysis. A few methods were proposed to automatize this step, but none of them works very well if LDA is used as a preprocessing for further classification. In this paper, we propose an ensemble approach which allows us to use more than one model at prediction phase, at the same time, reducing the need of finding a single best number of topics. We have also analyzed a few methods of estimating topic number.","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131528717","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 : 2019-03-25DOI: 10.5604/01.3001.0013.1460
Dariusz Pierzchala, Przemyslaw Czuba
The paper proposes the multiagent techniques for approximation of agent’s state in the multiresolution multiagent simulation. The key methods we have used for state aggregation and disaggregation are: consensus algorithm and formation control. The idea of the coordination of multiple agents has emerged from both observation and simulation of a collective behavior of biological entities. The consensus algorithms are commonly used for the cooperative control problems in the multiagent systems, whilst the formation control is the most popular and fundamental motion coordination problem in the multiagent systems, where agents converge to predefined geometric shapes. The presented approach shows that multiagent methods seem to be very promising in multiresolution simulation. Consensus and formation control algorithms remove necessity to specify the much more complex algorithms for the aggregation and disaggregation needs.
{"title":"Method of agents’ state estimation in multiresolution multiagent simulation","authors":"Dariusz Pierzchala, Przemyslaw Czuba","doi":"10.5604/01.3001.0013.1460","DOIUrl":"https://doi.org/10.5604/01.3001.0013.1460","url":null,"abstract":"The paper proposes the multiagent techniques for approximation of agent’s state in the multiresolution multiagent simulation. The key methods we have used for state aggregation and disaggregation are: consensus algorithm and formation control. The idea of the coordination of multiple agents has emerged from both observation and simulation of a collective behavior of biological entities. The consensus algorithms are commonly used for the cooperative control problems in the multiagent systems, whilst the formation control is the most popular and fundamental motion coordination problem in the multiagent systems, where agents converge to predefined geometric shapes. The presented approach shows that multiagent methods seem to be very promising in multiresolution simulation. Consensus and formation control algorithms remove necessity to specify the much more complex algorithms for the aggregation and disaggregation needs.","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133234331","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 : 2019-03-25DOI: 10.5604/01.3001.0013.1457
F. Darnowski, A. Chojnacki
The goal of this article was to present detailed information about writing and deleting process on the NTFS (New Technology File System) formatted drives. The most important are the algorithms used by computer to write data BFA (Best Fit Algorithm) and FFA (First-Free Algorithm) to update $MFT (Master File Table). The naming convention of the areas of the drive is presented. The proposed rules of writing and deleting algorithm were successfully validated with real NTFS volume.
本文的目的是提供有关NTFS(新技术文件系统)格式化驱动器上的写入和删除过程的详细信息。其中最重要的是计算机用来写数据的算法BFA (Best Fit Algorithm)和FFA (First-Free Algorithm)来更新主文件表。提出了驱动器区域的命名约定。在实际NTFS卷中成功验证了所提出的写入和删除规则算法。
{"title":"Writing and Deleting files on hard drives with NTFS","authors":"F. Darnowski, A. Chojnacki","doi":"10.5604/01.3001.0013.1457","DOIUrl":"https://doi.org/10.5604/01.3001.0013.1457","url":null,"abstract":"The goal of this article was to present detailed information about writing and deleting process on the NTFS (New Technology File System) formatted drives. The most important are the algorithms used by computer to write data BFA (Best Fit Algorithm) and FFA (First-Free Algorithm) to update $MFT (Master File Table). The naming convention of the areas of the drive is presented. The proposed rules of writing and deleting algorithm were successfully validated with real NTFS volume.","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123982977","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
扫码关注我们
求助内容：
应助结果提醒方式：