Pub Date : 2019-03-25DOI: 10.5604/01.3001.0013.1463
Karol Sosnowski
Nowadays, brain-computer interfaces are gaining more and more popularity. Research centers develop new methods of human communication with devices through thoughts. There are many methods used for this kind of interfaces, however, the most widespread is electroencephalography (EEG). There are many reasons for this fact, it is a method that is relatively cheap compared to other methods. Less complex technical tools and apparatus are required to operate it. Another advantage of this method, unlike others, is its non-invasiveness. Unfortunately, current brain-computer interfaces do not offer high data rates. However, time plays a smaller role when we are dealing with a disabled person who regains the ability to communicate with the world through the interface controlled by thoughts. This paper is the beginning of a series of papers in which the author will describe in detail the elements of brain-computer interfaces, as well as improvements that can be applied to them to improve their properties.
{"title":"The use of electroencephalography as a future-oriented brain-computer interface. Current concepts, solutions, technologies that allow communication through thoughts","authors":"Karol Sosnowski","doi":"10.5604/01.3001.0013.1463","DOIUrl":"https://doi.org/10.5604/01.3001.0013.1463","url":null,"abstract":"Nowadays, brain-computer interfaces are gaining more and more popularity. Research centers develop new methods of human communication with devices through thoughts. There are many methods used for this kind of interfaces, however, the most widespread is electroencephalography (EEG). There are many reasons for this fact, it is a method that is relatively cheap compared to other methods. Less complex technical tools and apparatus are required to operate it. Another advantage of this method, unlike others, is its non-invasiveness. Unfortunately, current brain-computer interfaces do not offer high data rates. However, time plays a smaller role when we are dealing with a disabled person who regains the ability to communicate with the world through the interface controlled by thoughts. This paper is the beginning of a series of papers in which \u0000the author will describe in detail the elements of brain-computer interfaces, as well as improvements that can be applied to them to improve their properties.\u0000\u0000","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"1 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":"115299876","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.1462
Paweł Ryszawa
This paper shows a simple computational scheme for determining whether a particular quantum state in a specific form is separable across two given sets of qubits. That is, given a set of qubits partitioned into two, it answers the question: does the original state have a separable form as a tensor product of some two other states, which are set up of the two given subsets of qubits?
{"title":"On some specific cases of quantum state in testing its separability","authors":"Paweł Ryszawa","doi":"10.5604/01.3001.0013.1462","DOIUrl":"https://doi.org/10.5604/01.3001.0013.1462","url":null,"abstract":"This paper shows a simple computational scheme for determining whether a particular quantum state in a specific form is separable across two given sets of qubits. That is, given a set of qubits partitioned into two, it answers the question: does the original state have a separable form as a tensor product of some two other states, which are set up of the two given subsets of qubits?","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"1 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":"131404112","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 : 2018-07-18DOI: 10.5604/01.3001.0012.2000
A. Ameljanczyk
The work deals with the examination of solutions similarity of similar conflicts, presented in the form of multiperson cooperative games. There is examined the similarity of the two most well-known in the literature concepts of the cooperative game solutions: Shapley solution and nucleolus (Schmeidler solution [9]). The work presents an idea of using a solution of the pattern conflict most similar to the considered conflict as a its solution.
{"title":"The solutions similarity of the similar conflicts","authors":"A. Ameljanczyk","doi":"10.5604/01.3001.0012.2000","DOIUrl":"https://doi.org/10.5604/01.3001.0012.2000","url":null,"abstract":"The work deals with the examination of solutions similarity of similar conflicts, presented in the form of multiperson cooperative games. There is examined the similarity of the two most well-known in the literature concepts of the cooperative game solutions: Shapley solution and nucleolus (Schmeidler solution [9]). \u0000The work presents an idea of using a solution of the pattern conflict most similar to the considered conflict as a its solution.\u0000\u0000","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133805793","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 : 2018-07-18DOI: 10.5604/01.3001.0012.2001
A. Horubała, D. Waszkiewicz, Michal Andrzejczak, P. Sapiecha
Cloud services are gaining interest and are very interesting option for public administration. Although, there is a lot of concern about security and privacy of storing personal data in cloud. In this work mathematical tools for securing data and hiding computations are presented. Data privacy is obtained by using homomorphic encryption schemes. Computation hiding is done by algorithm cryptographic obfuscation. Both primitives are presented and their application for public administration is discussed.
{"title":"Data confidentiality and computations hiding in cloud services for public administration","authors":"A. Horubała, D. Waszkiewicz, Michal Andrzejczak, P. Sapiecha","doi":"10.5604/01.3001.0012.2001","DOIUrl":"https://doi.org/10.5604/01.3001.0012.2001","url":null,"abstract":"Cloud services are gaining interest and are very interesting option for public administration. Although, there is a lot of concern about security and privacy of storing personal data in cloud. In this work mathematical tools for securing data and hiding computations are presented. Data privacy is obtained by using homomorphic encryption schemes. Computation hiding is done by algorithm cryptographic obfuscation. Both primitives are presented and their application for public administration is discussed.","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132567082","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 : 2018-07-18DOI: 10.5604/01.3001.0012.2003
Paweł Ryszawa
Implementing quantum-inspired algorithms on classical computers suffers trade-off between the necessity of saving operational memory and the amount of memory necessary to fully represent a quantum state with possible entanglement. The latter is well known to consume the memory exponentially in the number of qubits. This paper sketches out the idea on how to reduce significantly the amount of necessary memory while distorting the entanglement moderately or not at all. At present, considered are real nonnegative probability amplitudes.
{"title":"Modelling quantum register disentanglement","authors":"Paweł Ryszawa","doi":"10.5604/01.3001.0012.2003","DOIUrl":"https://doi.org/10.5604/01.3001.0012.2003","url":null,"abstract":"Implementing quantum-inspired algorithms on classical computers suffers trade-off between the necessity of saving operational memory and the amount of memory necessary to fully represent a quantum state with possible entanglement. The latter is well known to consume the memory exponentially in the number of qubits. This paper sketches out the idea on how to reduce significantly the amount of necessary memory while distorting the entanglement moderately or not at all. At present, considered are real nonnegative probability amplitudes.","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132347237","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 : 2018-07-18DOI: 10.5604/01.3001.0012.2004
B. Szafranski, M. Zieja, Jaroslaw Wójcik, Krzysztof Murawski
The article is devoted to the analysis of data coming from the operation process and collected in computer system TURAWA, which focuses on supporting the management of flight safety in the Polish Air Force. The Armed Forces are equipped with a system, which collects and processes data concerning the whole air crew, all performed flights and all aircraft. The increasing opportunities in obtaining data and the continuous development of data mining methods allow to extract information never been known before, which, together with conclusions obtained from the data analysis, will help to improve the level of flight safety.
{"title":"Data analysis of information system TURAWA in the aspect of data mining methods","authors":"B. Szafranski, M. Zieja, Jaroslaw Wójcik, Krzysztof Murawski","doi":"10.5604/01.3001.0012.2004","DOIUrl":"https://doi.org/10.5604/01.3001.0012.2004","url":null,"abstract":"The article is devoted to the analysis of data coming from the operation process and collected in computer system TURAWA, which focuses on supporting the management of flight safety in the Polish Air Force. The Armed Forces are equipped with a system, which collects and processes data concerning the whole air crew, all performed flights and all aircraft. The increasing opportunities in obtaining data and the continuous development of data mining methods allow to extract information never been known before, which, together with conclusions obtained from the data analysis, will help to improve the level of flight safety.","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130203699","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 : 2018-07-18DOI: 10.5604/01.3001.0012.2002
M. Miecznik, J. Mietelski, E. Łokas, K. Kleszcz
This paper contains the results of radionuclides transportation modeling under National Radioactive Waste Disposal (NRWD) grounds in Różan (northeast Poland). The disposal is of the low- and intermediate-level waste (LILW) type. We simulated the radionuclides transportation process through sandy soils. The simulation was performed in a self-written simulator in Scilab using the finite difference method. The model included diffusion, advection and radioactive decay. The model was tested according to convergence and stability. Assuming the hydrological gradient being 0.008, the contamination transportation time was 30–46 years depending on the modeled problem. The modeled distance of 600 m was from underneath the disposal to the exudation in the Narew ravine. Radioactive decay for both cesium (Cs137) and strontium (Sr90) had a significant impact on the results. The model proved to be a useful tool for performing simple scientific simulations. This survey was part of a PhD thesis.
{"title":"Modeling of the Cs137 and Sr90 contamination transportation process performed for the vicinity of National Radioactive Wastes Disposal in Różan (NE Poland)","authors":"M. Miecznik, J. Mietelski, E. Łokas, K. Kleszcz","doi":"10.5604/01.3001.0012.2002","DOIUrl":"https://doi.org/10.5604/01.3001.0012.2002","url":null,"abstract":"This paper contains the results of radionuclides transportation modeling under National Radioactive Waste Disposal (NRWD) grounds in Różan (northeast Poland). The disposal is of the low- and intermediate-level waste (LILW) type. We simulated the radionuclides transportation process through sandy soils. The simulation was performed in a self-written simulator in Scilab using the finite difference method. The model included diffusion, advection and radioactive decay. The model was tested according to convergence and stability. Assuming the hydrological gradient being 0.008, the contamination transportation time was 30–46 years depending on the modeled problem. The modeled distance of 600 m was from underneath the disposal to the exudation in the Narew ravine. Radioactive decay for both cesium (Cs137) and strontium (Sr90) had a significant impact on the results. The model proved to be a useful tool for performing simple scientific simulations. This survey was part of a PhD thesis.\u0000\u0000","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124453371","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
扫码关注我们
求助内容：
应助结果提醒方式：