Rahmad Syah, P. Chetthamrongchai, Dao Chanh Thuc, Umi Yuminarti, S. Murtini, A. H. Iswanto, N. Vasilieva, N. Kireeva, S. Aravindhan
Abstract Over the course of the last decades, closed-loop supply chains (CLSC) and reverse logistics issues have attracted increasing attention owing to strict environmental laws, social responsibilities, economic interests, and customer awareness. Hence, the issue of closed-loop supply chain and reverse logistics has emerged as a field of research in the new era. This issue has received much attention because it allows recyclable products to return to their original cycle. Therefore, this study primarily intends to present a mathematical model for designing a supply chain network for recycled products. The multi-stage and multi-period objective function of the closed-loop supply chain is presented to meet that aim. In this chain, dismantling, recycling, and disposal centers are considered. The objective function is to reduce the total cost of the closed-loop supply chain. The results of optimizing the mathematical model demonstrate that this model has the necessary efficiency for use in recycled products.
{"title":"Design a Multi Period Closed-Loop Supply Chain Program to Supply Recycled Products","authors":"Rahmad Syah, P. Chetthamrongchai, Dao Chanh Thuc, Umi Yuminarti, S. Murtini, A. H. Iswanto, N. Vasilieva, N. Kireeva, S. Aravindhan","doi":"10.2478/fcds-2022-0009","DOIUrl":"https://doi.org/10.2478/fcds-2022-0009","url":null,"abstract":"Abstract Over the course of the last decades, closed-loop supply chains (CLSC) and reverse logistics issues have attracted increasing attention owing to strict environmental laws, social responsibilities, economic interests, and customer awareness. Hence, the issue of closed-loop supply chain and reverse logistics has emerged as a field of research in the new era. This issue has received much attention because it allows recyclable products to return to their original cycle. Therefore, this study primarily intends to present a mathematical model for designing a supply chain network for recycled products. The multi-stage and multi-period objective function of the closed-loop supply chain is presented to meet that aim. In this chain, dismantling, recycling, and disposal centers are considered. The objective function is to reduce the total cost of the closed-loop supply chain. The results of optimizing the mathematical model demonstrate that this model has the necessary efficiency for use in recycled products.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"163 - 176"},"PeriodicalIF":1.1,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48682803","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}
H. Budi, M. Elveny, P. Zhuravlev, A. Jalil, Samaher Al-Janabi, A. Alkaim, M. Saleh, R. Shichiyakh, Sutarto
Abstract The problem of unequal facility location involves determining the location of a set of production equipment whose dimensions are different, as well as the interrelationships between each of them. This paper presents an efficient method for optimizing the problem of unequal facility layouts. In this method, the genetic algorithm is improved and developed into an adaptive genetic algorithm. In this algorithm, the mutation operator is applied only when the similarity of chromosomes in each population reaches a certain level. This intelligence prevents jumps in situations where they are not needed and reduces computational time. In order to measure the performance of the proposed algorithm, its performance is compared with the performance of conventional genetic algorithms and refrigeration simulators. Computational results show that the adaptive genetic algorithm is able to achieve higher-quality solutions.
{"title":"Development of an Adaptive Genetic Algorithm to Optimize the Problem Of Unequal Facility Location","authors":"H. Budi, M. Elveny, P. Zhuravlev, A. Jalil, Samaher Al-Janabi, A. Alkaim, M. Saleh, R. Shichiyakh, Sutarto","doi":"10.2478/fcds-2022-0006","DOIUrl":"https://doi.org/10.2478/fcds-2022-0006","url":null,"abstract":"Abstract The problem of unequal facility location involves determining the location of a set of production equipment whose dimensions are different, as well as the interrelationships between each of them. This paper presents an efficient method for optimizing the problem of unequal facility layouts. In this method, the genetic algorithm is improved and developed into an adaptive genetic algorithm. In this algorithm, the mutation operator is applied only when the similarity of chromosomes in each population reaches a certain level. This intelligence prevents jumps in situations where they are not needed and reduces computational time. In order to measure the performance of the proposed algorithm, its performance is compared with the performance of conventional genetic algorithms and refrigeration simulators. Computational results show that the adaptive genetic algorithm is able to achieve higher-quality solutions.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"111 - 125"},"PeriodicalIF":1.1,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48430940","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}
Rahmad Syah, M. Elveny, Enni Soerjati, J. W. Guerrero, Rawya Read Jowad, Wanich Suksatan, S. Aravindhan, O. Voronkova, D. Mavaluru
Abstract Using hubs in distribution networks is an efficient approach. In this paper, a model for the location-allocation problem is designed within the framework of the queuing network in which services have several levels, and customers must go through these levels to complete the service. The purpose of the model is to locate an appropriate number of facilities among potential locations and allocate customers. The model is presented as a multi-objective nonlinear mixed-integer programming model. The objective functions include the summation of the customer and the waiting time in the system and the waiting time in the system and minimizing the maximum possibility of unemployment in the facility. To solve the model, the technique of accurate solution of the epsilon constraint method is used for multi-objective optimization, and Pareto solutions of the problem will be calculated. Moreover, the sensitivity analysis of the problem is performed, and the results demonstrate sensitivity to customer demand rate. Based on the results obtained, it can be concluded that the proposed model is able to greatly summate the customer and the waiting time in the system and reduce the maximum probability of unemployment at several levels of all facilities. The model can also be further developed by choosing vehicles for each customer.
{"title":"Optimizing the Multi-Level Location-Assignment Problem in Queue Networks Using a Multi-Objective Optimization Approach","authors":"Rahmad Syah, M. Elveny, Enni Soerjati, J. W. Guerrero, Rawya Read Jowad, Wanich Suksatan, S. Aravindhan, O. Voronkova, D. Mavaluru","doi":"10.2478/fcds-2022-0010","DOIUrl":"https://doi.org/10.2478/fcds-2022-0010","url":null,"abstract":"Abstract Using hubs in distribution networks is an efficient approach. In this paper, a model for the location-allocation problem is designed within the framework of the queuing network in which services have several levels, and customers must go through these levels to complete the service. The purpose of the model is to locate an appropriate number of facilities among potential locations and allocate customers. The model is presented as a multi-objective nonlinear mixed-integer programming model. The objective functions include the summation of the customer and the waiting time in the system and the waiting time in the system and minimizing the maximum possibility of unemployment in the facility. To solve the model, the technique of accurate solution of the epsilon constraint method is used for multi-objective optimization, and Pareto solutions of the problem will be calculated. Moreover, the sensitivity analysis of the problem is performed, and the results demonstrate sensitivity to customer demand rate. Based on the results obtained, it can be concluded that the proposed model is able to greatly summate the customer and the waiting time in the system and reduce the maximum probability of unemployment at several levels of all facilities. The model can also be further developed by choosing vehicles for each customer.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"177 - 192"},"PeriodicalIF":1.1,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46182580","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 A method of solving a three-person game defined on a product of staircase-function strategy spaces is presented. The spaces can be finite and continuous. The method is based on stacking equilibria of “short” three-person games, each defined on an interval where the pure strategy value is constant. In the case of finite three-person games, which factually are trimatrix games, the equilibria are considered in general terms, so they can be in mixed strategies as well. The stack is any interval-wise combination (succession) of the respective equilibria of the “short” trimatrix games. Apart from the stack, there are no other equilibria in this “long” trimatrix game. An example is presented to show how the stacking is fulfilled for a case of when every “short” trimatrix game has a pure-strategy equilibrium. The presented method, further “breaking” the initial “long” game defined on a product of staircase-function finite spaces, is far more tractable than a straightforward approach to solving directly the “long” trimatrix game would be.
{"title":"Equilibrium stacks for a three-person game on a product of staircase-function continuous and finite strategy spaces","authors":"V. Romanuke","doi":"10.2478/fcds-2022-0002","DOIUrl":"https://doi.org/10.2478/fcds-2022-0002","url":null,"abstract":"Abstract A method of solving a three-person game defined on a product of staircase-function strategy spaces is presented. The spaces can be finite and continuous. The method is based on stacking equilibria of “short” three-person games, each defined on an interval where the pure strategy value is constant. In the case of finite three-person games, which factually are trimatrix games, the equilibria are considered in general terms, so they can be in mixed strategies as well. The stack is any interval-wise combination (succession) of the respective equilibria of the “short” trimatrix games. Apart from the stack, there are no other equilibria in this “long” trimatrix game. An example is presented to show how the stacking is fulfilled for a case of when every “short” trimatrix game has a pure-strategy equilibrium. The presented method, further “breaking” the initial “long” game defined on a product of staircase-function finite spaces, is far more tractable than a straightforward approach to solving directly the “long” trimatrix game would be.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"27 - 64"},"PeriodicalIF":1.1,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42009211","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 Bat algorithm is an effective swarm intelligence optimization algorithm which is widely used to solve continuous optimization problems. But it still has some limitations in search process and can’t solve discrete optimization problems directly. Therefore, this paper introduces an unordered pair and proposes an unordered pair bat algorithm (UPBA) to make it more suitable for solving symmetric discrete traveling salesman problems. To verify the effectiveness of this method, the algorithm has been tested on 23 symmetric benchmarks and compared its performance with other algorithms. The results have shown that the proposed UPBA outperforms all the other alternatives significantly in most cases.
{"title":"An Improved Unordered Pair Bat Algorithm for Solving the Symmetrical Traveling Salesman Problem","authors":"Zhang Nan, Zhimin Lv, Qiao Shen, Li Ting","doi":"10.2478/fcds-2022-0004","DOIUrl":"https://doi.org/10.2478/fcds-2022-0004","url":null,"abstract":"Abstract Bat algorithm is an effective swarm intelligence optimization algorithm which is widely used to solve continuous optimization problems. But it still has some limitations in search process and can’t solve discrete optimization problems directly. Therefore, this paper introduces an unordered pair and proposes an unordered pair bat algorithm (UPBA) to make it more suitable for solving symmetric discrete traveling salesman problems. To verify the effectiveness of this method, the algorithm has been tested on 23 symmetric benchmarks and compared its performance with other algorithms. The results have shown that the proposed UPBA outperforms all the other alternatives significantly in most cases.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"87 - 103"},"PeriodicalIF":1.1,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46992834","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}
Dawid Wisniewski, Jedrzej Potoniec, A. Ławrynowicz
Abstract Glossary of Terms extraction from textual requirements is an important step in ontology engineering methodologies. Although initially it was intended to be performed manually, last years have shown that some degree of automatization is possible. Based on these promising approaches, we introduce a novel, human interpretable, rule-based method named ReqTagger, which can extract candidates for ontology entities (classes or instances) and relations (data or object properties) from textual requirements automatically. We compare ReqTagger to existing automatic methods on an evaluation benchmark consisting of over 550 requirements and tagged with over 1700 entities and relations expected to be extracted. We discuss the quality of ReqTagger and provide details showing why it outperforms other methods. We also publish both the evaluation dataset and the implementation of ReqTagger.
{"title":"ReqTagger: A Rule-Based Tagger for Automatic Glossary of Terms Extraction from Ontology Requirements","authors":"Dawid Wisniewski, Jedrzej Potoniec, A. Ławrynowicz","doi":"10.2478/fcds-2022-0003","DOIUrl":"https://doi.org/10.2478/fcds-2022-0003","url":null,"abstract":"Abstract Glossary of Terms extraction from textual requirements is an important step in ontology engineering methodologies. Although initially it was intended to be performed manually, last years have shown that some degree of automatization is possible. Based on these promising approaches, we introduce a novel, human interpretable, rule-based method named ReqTagger, which can extract candidates for ontology entities (classes or instances) and relations (data or object properties) from textual requirements automatically. We compare ReqTagger to existing automatic methods on an evaluation benchmark consisting of over 550 requirements and tagged with over 1700 entities and relations expected to be extracted. We discuss the quality of ReqTagger and provide details showing why it outperforms other methods. We also publish both the evaluation dataset and the implementation of ReqTagger.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"65 - 86"},"PeriodicalIF":1.1,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48973030","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 There has been a lot of software design concerns in recent years that come under the code smell. Android Applications Developments experiences more security issues related to code smells that lead to vulnerabilities in software. This research focuses on the vulnerability detection in Android applications which consists of code smells. A multi-layer perceptron-based ANN model is generated for detection of software vulnerabilities and has a precision value of 74.7% and 79.6% accuracy with 2 hidden layers. The focus is laid on 1390 Android classes and involves association mining of the software vulnerabilities with android code smells using APRIORI algorithm. The generated ANN model The findings represent that Member Ignoring Method (MIM) code smell shows an association with Bean Member Serialization (BMS) vulnerability having 86% confidence level and 0.48 support value. An algorithm has also been proposed that would help developers in detecting software vulnerability in the smelly source code of an android applications at early stages of development.
{"title":"ANN Modelling on Vulnerabilities Detection in Code Smells-Associated Android Applications","authors":"Aakanshi Gupta, Deepanshu Sharma, Kritika Phulli","doi":"10.2478/fcds-2022-0001","DOIUrl":"https://doi.org/10.2478/fcds-2022-0001","url":null,"abstract":"Abstract There has been a lot of software design concerns in recent years that come under the code smell. Android Applications Developments experiences more security issues related to code smells that lead to vulnerabilities in software. This research focuses on the vulnerability detection in Android applications which consists of code smells. A multi-layer perceptron-based ANN model is generated for detection of software vulnerabilities and has a precision value of 74.7% and 79.6% accuracy with 2 hidden layers. The focus is laid on 1390 Android classes and involves association mining of the software vulnerabilities with android code smells using APRIORI algorithm. The generated ANN model The findings represent that Member Ignoring Method (MIM) code smell shows an association with Bean Member Serialization (BMS) vulnerability having 86% confidence level and 0.48 support value. An algorithm has also been proposed that would help developers in detecting software vulnerability in the smelly source code of an android applications at early stages of development.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"3 - 26"},"PeriodicalIF":1.1,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47172741","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}
B. Davvaz, Dian Winda Setyawati, Soleha, I. Mukhlash, Subiono
Abstract Rough set theory is a mathematical approach to imperfect knowledge. The near set approach leads to partitions of ensembles of sample objects with measurable information content and an approach to feature selection. In this paper, we apply the previous results of Bagirmaz [Appl. Algebra Engrg. Comm. Comput., 30(4) (2019) 285-29] and [Davvaz et al., Near approximations in rings. AAECC (2020). https://doi.org/10.1007/s00200-020-00421-3] to module theory. We introduce the notion of near approximations in a module over a ring, which is an extended notion of a rough approximations in a module presented in [B. Davvaz and M. Mahdavipour, Roughness in modules, Information Sciences, 176 (2006) 3658-3674]. Then we define the lower and upper near submodules and investigate their properties.
摘要粗糙集理论是一种处理不完全知识的数学方法。近集方法导致具有可测量信息内容的样本对象的集合的划分以及特征选择方法。在本文中，我们应用了Bagirmaz[Appl.AlgebrageEngr.Comm.Comput.，30（4）（2019）285-29]和[Davaz et al.，环中的近似。AAECC（2020）的先前结果。https://doi.org/10.1007/s00200-020-00421-3]模块理论。我们引入了环上模中近似近似的概念，这是[B.Davivaz和M.Mahdavipour，Roughness in modules，Information Sciences，176（2006）3658-3674]中提出的模中近似的扩展概念。然后，我们定义了下近子模和上近子模，并研究了它们的性质。
{"title":"Near Approximations in Modules","authors":"B. Davvaz, Dian Winda Setyawati, Soleha, I. Mukhlash, Subiono","doi":"10.2478/fcds-2021-0020","DOIUrl":"https://doi.org/10.2478/fcds-2021-0020","url":null,"abstract":"Abstract Rough set theory is a mathematical approach to imperfect knowledge. The near set approach leads to partitions of ensembles of sample objects with measurable information content and an approach to feature selection. In this paper, we apply the previous results of Bagirmaz [Appl. Algebra Engrg. Comm. Comput., 30(4) (2019) 285-29] and [Davvaz et al., Near approximations in rings. AAECC (2020). https://doi.org/10.1007/s00200-020-00421-3] to module theory. We introduce the notion of near approximations in a module over a ring, which is an extended notion of a rough approximations in a module presented in [B. Davvaz and M. Mahdavipour, Roughness in modules, Information Sciences, 176 (2006) 3658-3674]. Then we define the lower and upper near submodules and investigate their properties.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"319 - 337"},"PeriodicalIF":1.1,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48334104","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 allocating resources among Decision Making Units (DMUs). Regarding the concept of overall (cost) efficiency, we consider three different scenarios and formulate three Resource Allocation (RA) models correspondingly. In the first scenario, we assume that overall efficiency of each unit remains unchanged. The second scenario is related to the case where none of overall efficiency scores is deteriorated. We improve the overall efficiencies by a pre-determined percentage in the last scenario. We formulate Linear Programming problems to allocate resources in all scenarios. All three scenarios are illustrated through numerical and empirical examples.
{"title":"A Scenario-based Model for Resource Allocation with Price Information","authors":"M. Ghiyasi, Akram Dehnokhalaji","doi":"10.2478/fcds-2021-0021","DOIUrl":"https://doi.org/10.2478/fcds-2021-0021","url":null,"abstract":"Abstract In this paper, we consider the problem of allocating resources among Decision Making Units (DMUs). Regarding the concept of overall (cost) efficiency, we consider three different scenarios and formulate three Resource Allocation (RA) models correspondingly. In the first scenario, we assume that overall efficiency of each unit remains unchanged. The second scenario is related to the case where none of overall efficiency scores is deteriorated. We improve the overall efficiencies by a pre-determined percentage in the last scenario. We formulate Linear Programming problems to allocate resources in all scenarios. All three scenarios are illustrated through numerical and empirical examples.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"339 - 360"},"PeriodicalIF":1.1,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46122664","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}
Pawel Wojciechowski, Karol Krause, P. Lukasiak, J. Błażewicz
Abstract Implementing a large genomic project is a demanding task, also from the computer science point of view. Besides collecting many genome samples and sequencing them, there is processing of a huge amount of data at every stage of their production and analysis. Efficient transfer and storage of the data is also an important issue. During the execution of such a project, there is a need to maintain work standards and control quality of the results, which can be difficult if a part of the work is carried out externally. Here, we describe our experience with such data quality analysis on a number of levels - from an obvious check of the quality of the results obtained, to examining consistency of the data at various stages of their processing, to verifying, as far as possible, their compatibility with the data describing the sample.
{"title":"The correctness of large scale analysis of genomic data","authors":"Pawel Wojciechowski, Karol Krause, P. Lukasiak, J. Błażewicz","doi":"10.2478/fcds-2021-0024","DOIUrl":"https://doi.org/10.2478/fcds-2021-0024","url":null,"abstract":"Abstract Implementing a large genomic project is a demanding task, also from the computer science point of view. Besides collecting many genome samples and sequencing them, there is processing of a huge amount of data at every stage of their production and analysis. Efficient transfer and storage of the data is also an important issue. During the execution of such a project, there is a need to maintain work standards and control quality of the results, which can be difficult if a part of the work is carried out externally. Here, we describe our experience with such data quality analysis on a number of levels - from an obvious check of the quality of the results obtained, to examining consistency of the data at various stages of their processing, to verifying, as far as possible, their compatibility with the data describing the sample.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"423 - 436"},"PeriodicalIF":1.1,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44740303","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
扫码关注我们
求助内容：
应助结果提醒方式：