Pub Date : 2020-10-12DOI: 10.34658/JACS.2020.28.1.39-49
M. Ostrowski
In this paper, we examine a simple algorithm for loading initial data into the quantum register. In order to perform the algorithm standard two input gates are used. The algorithm is tested for the Gaussian and sine wave states. In the Appendix full PyQuil code of the algorithm is attached.
{"title":"Loading Initial Data into the Quantum Register","authors":"M. Ostrowski","doi":"10.34658/JACS.2020.28.1.39-49","DOIUrl":"https://doi.org/10.34658/JACS.2020.28.1.39-49","url":null,"abstract":"In this paper, we examine a simple algorithm for loading initial data into the quantum register. In order to perform the algorithm standard two input gates are used. The algorithm is tested for the Gaussian and sine wave states. In the Appendix full PyQuil code of the algorithm is attached.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"107 1","pages":"39-49"},"PeriodicalIF":0.0,"publicationDate":"2020-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85588157","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-01-01DOI: 10.34658/JACS.2020.28.1.3-37
Barbara Morawska, Krzysztof Lichy, Piotr Koch, Jakub Nied´zwiedzki, Marcin Leplawy, Piotr Lipi´nski
This article describes methods for reducing the position measure-ment error of ultra-wideband localization system - DecaWave TREK1000. The static localization accuracy of this system can achieve 10cm. The local-ization algorithm introduced in this paper can improve it up to 1 centimeter. We could achieve such good accuracy, thanks to experiments that were car-ried out in various environmental conditions. This allowed us to identify the nature of the measurement error and design the correct set of filters.
{"title":"Error Reduction for Static Localization","authors":"Barbara Morawska, Krzysztof Lichy, Piotr Koch, Jakub Nied´zwiedzki, Marcin Leplawy, Piotr Lipi´nski","doi":"10.34658/JACS.2020.28.1.3-37","DOIUrl":"https://doi.org/10.34658/JACS.2020.28.1.3-37","url":null,"abstract":"This article describes methods for reducing the position measure-ment error of ultra-wideband localization system - DecaWave TREK1000. The static localization accuracy of this system can achieve 10cm. The local-ization algorithm introduced in this paper can improve it up to 1 centimeter. We could achieve such good accuracy, thanks to experiments that were car-ried out in various environmental conditions. This allowed us to identify the nature of the measurement error and design the correct set of filters.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"13 1","pages":"7-37"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74510498","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-12-31DOI: 10.34658/JACS.2019.27.2.7-16
Marcin Daszuta, E. Napieralska-Juszczak
3-dimensional scans captured in shape of point clouds are widely used in many di erent areas. Every such area use di erent kinds of sensors to ac-quire point clouds and do the analysis of the data but each of those needs some preanalysis to be done. One of the most important is segmentation and classification of points into types of objects. Such information considerably widens possibilities of usage for further purposes. There are many classifiers and many features based on which labeling can be done. In this paper few most commonly used approaches were chosen to check the influence of neighboring points acquisition on classification process. Results proof signif-icant relation between those two steps of point cloud analysis. Visualization of analyzed point cloud also shown that precision of predictions not always comes with better visibility of certain types of objects. Additionally, color-less analysis of geometrical features seems to be promising way for further research.
{"title":"Classification of Objects in a Point Cloud using Neural Networks","authors":"Marcin Daszuta, E. Napieralska-Juszczak","doi":"10.34658/JACS.2019.27.2.7-16","DOIUrl":"https://doi.org/10.34658/JACS.2019.27.2.7-16","url":null,"abstract":"3-dimensional scans captured in shape of point clouds are widely used in many di\u000berent areas. Every such area use di\u000berent kinds of sensors to ac-quire point clouds and do the analysis of the data but each of those needs some preanalysis to be done. One of the most important is segmentation and classification of points into types of objects. Such information considerably widens possibilities of usage for further purposes. There are many classifiers and many features based on which labeling can be done. In this paper few most commonly used approaches were chosen to check the influence of neighboring points acquisition on classification process. Results proof signif-icant relation between those two steps of point cloud analysis. Visualization of analyzed point cloud also shown that precision of predictions not always comes with better visibility of certain types of objects. Additionally, color-less analysis of geometrical features seems to be promising way for further research.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"34 1","pages":"7-16"},"PeriodicalIF":0.0,"publicationDate":"2019-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86860660","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}
The paper concentrates on data models that differ from the traditional relational one by Codd (1970). In particular, we are interested in processing graph databases (graph datasets) without any pre-configured structure, in which graph nodes may represent different objects and graph edges – relations between them. In this approach, the linguistic summarization methods for graph datasets are introduced, and differences for these methods with respect to traditional relational approach are shown, commented and improved in comparison to the preceding proposition (Strobin, Niewiadomski, 2016). The novelty of the paper is mostly the new form for summaries: Multi-Subject linguistic summaries of graph databases, previously introduced for relational databases (Superson, 2018).
{"title":"Linguistic Summaries of Graph Databases in Customer Relationship Management (CRM)","authors":"Monika Bartczak, A. Niewiadomski","doi":"10.34658/JACS.2019.27.1","DOIUrl":"https://doi.org/10.34658/JACS.2019.27.1","url":null,"abstract":"The paper concentrates on data models that differ from the traditional relational one by Codd (1970). In particular, we are interested in processing graph databases (graph datasets) without any pre-configured structure, in which graph nodes may represent different objects and graph edges – relations between them. In this approach, the linguistic summarization methods for graph datasets are introduced, and differences for these methods with respect to traditional relational approach are shown, commented and improved in comparison to the preceding proposition (Strobin, Niewiadomski, 2016). The novelty of the paper is mostly the new form for summaries: Multi-Subject linguistic summaries of graph databases, previously introduced for relational databases (Superson, 2018).","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"124 1","pages":"7-26"},"PeriodicalIF":0.0,"publicationDate":"2019-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88643525","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}
Abstract Firewalls are key elements of network security infrastructure. They should guarantee the proper level of security and, at the same time, the satisfying performance in order to not increase the packet delay in the network. In the paper, we present the comparative study on performance and security of a few firewall technologies including hardware, software and virtual solutions. Three important criteria are considered: the maximal throughput of firewall, the introduced delay and the ability to resist Denial of Service attacks. We report results of experiments, present analysis and formulate a few practical conclusions.
{"title":"Analysis of Performance and Efficiency of Hardware and Software Firewalls","authors":"W. Konikiewicz, M. Markowski","doi":"10.1515/jacsm-2017-0003","DOIUrl":"https://doi.org/10.1515/jacsm-2017-0003","url":null,"abstract":"Abstract Firewalls are key elements of network security infrastructure. They should guarantee the proper level of security and, at the same time, the satisfying performance in order to not increase the packet delay in the network. In the paper, we present the comparative study on performance and security of a few firewall technologies including hardware, software and virtual solutions. Three important criteria are considered: the maximal throughput of firewall, the introduced delay and the ability to resist Denial of Service attacks. We report results of experiments, present analysis and formulate a few practical conclusions.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"9 1","pages":"49 - 63"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41569620","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}
Abstract This paper describes a number of experiments to compare and validate the performance of machine learning classifiers. Creating machine learning models for data with wide varieties has huge applications in predictive modelling across multiple domain of science. This work reviews state of the art techniques in machine learning classifiers methods with several extent of magnitude in statistics and key findings that will be helpful in establishing best methodological practices for class predictions. Comprehensive comparative review analysis with statistical validations for various machine learning algorithm for SVM, Bagging, Boosting, Decision Trees and Nearest Neighborhood algorithm on multiple data sets is carried out. Focus on the statistical analysis of the results using Friedman-Test and Wilcoxon Test as well as other interpretative metrics like classification rate, ROC, F-measure are evaluated to benchmark results.
{"title":"Friedman and Wilcoxon Evaluations Comparing SVM, Bagging, Boosting, K-NN and Decision Tree Classifiers","authors":"V. Biju, C. Prashanth","doi":"10.1515/jacsm-2017-0002","DOIUrl":"https://doi.org/10.1515/jacsm-2017-0002","url":null,"abstract":"Abstract This paper describes a number of experiments to compare and validate the performance of machine learning classifiers. Creating machine learning models for data with wide varieties has huge applications in predictive modelling across multiple domain of science. This work reviews state of the art techniques in machine learning classifiers methods with several extent of magnitude in statistics and key findings that will be helpful in establishing best methodological practices for class predictions. Comprehensive comparative review analysis with statistical validations for various machine learning algorithm for SVM, Bagging, Boosting, Decision Trees and Nearest Neighborhood algorithm on multiple data sets is carried out. Focus on the statistical analysis of the results using Friedman-Test and Wilcoxon Test as well as other interpretative metrics like classification rate, ROC, F-measure are evaluated to benchmark results.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"9 1","pages":"23 - 47"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/jacsm-2017-0002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41709543","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}
Abstract In this paper we consider the problem of anomaly detection over time series metrics data took from one of corporate grade mail service cluster. We propose the algorithm based on one-sided median concept and present some results of experiments showing impact of parameters settings on algorithm performance. In addition we present short description of classes of anomalies discovered in monitored system. Proposed one-sided median based algorithm shows great robustness and good detection rate and can be considered as possible simple production ready solution.
{"title":"Anomaly detection in server metrics with use of one-sided median algorithm","authors":"S. Zacher, P. Ryba","doi":"10.1515/jacsm-2017-0001","DOIUrl":"https://doi.org/10.1515/jacsm-2017-0001","url":null,"abstract":"Abstract In this paper we consider the problem of anomaly detection over time series metrics data took from one of corporate grade mail service cluster. We propose the algorithm based on one-sided median concept and present some results of experiments showing impact of parameters settings on algorithm performance. In addition we present short description of classes of anomalies discovered in monitored system. Proposed one-sided median based algorithm shows great robustness and good detection rate and can be considered as possible simple production ready solution.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"9 1","pages":"22 - 5"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47513373","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}
Abstract Dynamic typing of R programming language may issue some quality problems in large scale data-science and machine-learning projects for which the language is used. Following our efforts on providing gradual typing library for Clojure we come with a package chR - a library that offers functionality of run-time type-related checks in R. The solution is not only a dynamic type checker, it also helps to systematize thinking about types in the language, at the same time offering high expressivenes and full adherence to functional programming style.
{"title":"ChR: Dynamic Functional Constraints Checking in R","authors":"K. Grzanek","doi":"10.1515/jacsm-2017-0004","DOIUrl":"https://doi.org/10.1515/jacsm-2017-0004","url":null,"abstract":"Abstract Dynamic typing of R programming language may issue some quality problems in large scale data-science and machine-learning projects for which the language is used. Following our efforts on providing gradual typing library for Clojure we come with a package chR - a library that offers functionality of run-time type-related checks in R. The solution is not only a dynamic type checker, it also helps to systematize thinking about types in the language, at the same time offering high expressivenes and full adherence to functional programming style.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"9 1","pages":"65 - 78"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66825004","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}
Abstract This article presents an application of moldflow simulation to optimize the injection molding process of charge air cooler plastic tank. The work shows the advantages of this kind of simulation software and information that it can provide. It also explains how big role today play simulation softwares and how they can improve product and reduce development cost.
{"title":"Application of Moldflow Simulation in Injection Molding of Plastic Tank","authors":"Piotr Tutak","doi":"10.1515/jacsm-2017-0005","DOIUrl":"https://doi.org/10.1515/jacsm-2017-0005","url":null,"abstract":"Abstract This article presents an application of moldflow simulation to optimize the injection molding process of charge air cooler plastic tank. The work shows the advantages of this kind of simulation software and information that it can provide. It also explains how big role today play simulation softwares and how they can improve product and reduce development cost.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"9 1","pages":"79 - 88"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47447610","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}
Abstract Software clustering is usually used for program understanding. Since the software clustering is a NP-complete problem, a number of Genetic Algorithms (GAs) are proposed for solving this problem. In literature, there are two wellknown GAs for software clustering, namely, Bunch and DAGC, that use the genetic operators such as crossover and mutation to better search the solution space and generating better solutions during genetic algorithm evolutionary process. The major drawbacks of these operators are (1) the difficulty of defining operators, (2) the difficulty of determining the probability rate of these operators, and (3) do not guarantee to maintain building blocks. Estimation of Distribution (EDA) based approaches, by removing crossover and mutation operators and maintaining building blocks, can be used to solve the problems of genetic algorithms. This approach creates the probabilistic models from individuals to generate new population during evolutionary process, aiming to achieve more success in solving the problems. The aim of this paper is to recast EDA for software clustering problems, which can overcome the existing genetic operators’ limitations. For achieving this aim, we propose a new distribution probability function and a new EDA based algorithm for software clustering. To the best knowledge of the authors, EDA has not been investigated to solve the software clustering problem. The proposed EDA has been compared with two well-known genetic algorithms on twelve benchmarks. Experimental results show that the proposed approach provides more accurate results, improves the speed of convergence and provides better stability when compared against existing genetic algorithms such as Bunch and DAGC.
{"title":"Software Systems Clustering Using Estimation of Distribution Approach","authors":"Mahjoubeh Tajgardan, Habib Izadkhah, S. Lotfi","doi":"10.1515/jacsm-2016-0007","DOIUrl":"https://doi.org/10.1515/jacsm-2016-0007","url":null,"abstract":"Abstract Software clustering is usually used for program understanding. Since the software clustering is a NP-complete problem, a number of Genetic Algorithms (GAs) are proposed for solving this problem. In literature, there are two wellknown GAs for software clustering, namely, Bunch and DAGC, that use the genetic operators such as crossover and mutation to better search the solution space and generating better solutions during genetic algorithm evolutionary process. The major drawbacks of these operators are (1) the difficulty of defining operators, (2) the difficulty of determining the probability rate of these operators, and (3) do not guarantee to maintain building blocks. Estimation of Distribution (EDA) based approaches, by removing crossover and mutation operators and maintaining building blocks, can be used to solve the problems of genetic algorithms. This approach creates the probabilistic models from individuals to generate new population during evolutionary process, aiming to achieve more success in solving the problems. The aim of this paper is to recast EDA for software clustering problems, which can overcome the existing genetic operators’ limitations. For achieving this aim, we propose a new distribution probability function and a new EDA based algorithm for software clustering. To the best knowledge of the authors, EDA has not been investigated to solve the software clustering problem. The proposed EDA has been compared with two well-known genetic algorithms on twelve benchmarks. Experimental results show that the proposed approach provides more accurate results, improves the speed of convergence and provides better stability when compared against existing genetic algorithms such as Bunch and DAGC.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"8 1","pages":"113 - 99"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66824988","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
扫码关注我们
求助内容：
应助结果提醒方式：