Pub Date : 2020-09-19DOI: 10.14419/JACST.V9I1.30992
Y. Banadaki
As numerous Internet-of-Things (IoT) devices are deploying on a daily basis, network intrusion detection systems (NIDS) are among the most critical tools to ensure the protection and security of networks against malicious cyberattacks. This paper employs four machine learning algorithms: XGBoost, random forest, decision tree, and gradient boosting, and evaluates their performance in NIDS, considering the accuracy, precision, recall, and F-score. The comparative analysis conducted using the CICIDS2017 dataset reveals that the XGBoost performs better than the other algorithms reaching the predicted accuracy of 99.6% in detecting cyberattacks. XGBoost-based attack detectors also have the largest weighted metrics of F1-score, precision, and recall. The paper also studies the effect of class imbalance and the size of the normal and attack classes. The small numbers of some attacks in training datasets mislead the classifier to bias towards the majority classes resulting in a bottleneck to improving macro recall and macro F1 score. The results assist the network engineers in choosing the most effective machine learning-based NIDS to ensure network security for today’s growing IoT network traffic.
{"title":"Evaluating the performance of machine learning algorithms for network intrusion detection systems in the internet of things infrastructure","authors":"Y. Banadaki","doi":"10.14419/JACST.V9I1.30992","DOIUrl":"https://doi.org/10.14419/JACST.V9I1.30992","url":null,"abstract":"As numerous Internet-of-Things (IoT) devices are deploying on a daily basis, network intrusion detection systems (NIDS) are among the most critical tools to ensure the protection and security of networks against malicious cyberattacks. This paper employs four machine learning algorithms: XGBoost, random forest, decision tree, and gradient boosting, and evaluates their performance in NIDS, considering the accuracy, precision, recall, and F-score. The comparative analysis conducted using the CICIDS2017 dataset reveals that the XGBoost performs better than the other algorithms reaching the predicted accuracy of 99.6% in detecting cyberattacks. XGBoost-based attack detectors also have the largest weighted metrics of F1-score, precision, and recall. The paper also studies the effect of class imbalance and the size of the normal and attack classes. The small numbers of some attacks in training datasets mislead the classifier to bias towards the majority classes resulting in a bottleneck to improving macro recall and macro F1 score. The results assist the network engineers in choosing the most effective machine learning-based NIDS to ensure network security for today’s growing IoT network traffic.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125880855","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-07-25DOI: 10.14419/JACST.V9I1.30674
A. Hasan-Zadeh
In this paper, the problem of finding the shortest paths, one of the most important problems in science and technology has been geometrically studied. Shortest path algorithm has been generalized to the shortest cycles in each homotopy class on a surface with arbitrary topology, using the universal covering space notion in the algebraic topology. Then, a general algorithm has been presented to compute the shortest cycles (geometrically rather than combinatorial) in each homotopy class. The algorithm can handle surface meshes with the desired topology, with or without boundary. It also provides a fundamental framework for other algorithms based on universal coverage space due to the capacity and flexibility of the framework.
{"title":"Geometric Approach to Optimal Path Problem with Uncertain Arc Lengths","authors":"A. Hasan-Zadeh","doi":"10.14419/JACST.V9I1.30674","DOIUrl":"https://doi.org/10.14419/JACST.V9I1.30674","url":null,"abstract":"In this paper, the problem of finding the shortest paths, one of the most important problems in science and technology has been geometrically studied. Shortest path algorithm has been generalized to the shortest cycles in each homotopy class on a surface with arbitrary topology, using the universal covering space notion in the algebraic topology. Then, a general algorithm has been presented to compute the shortest cycles (geometrically rather than combinatorial) in each homotopy class. The algorithm can handle surface meshes with the desired topology, with or without boundary. It also provides a fundamental framework for other algorithms based on universal coverage space due to the capacity and flexibility of the framework.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"334 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131474071","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-06-14DOI: 10.14419/JACST.V9I1.30656
A. Hasan-Zadeh
Optimization methods in which one single criterion is considered cannot provide a comprehensive solution to various decisionmaking algorithms because they cannot consider the interchange of conflicting goals that sometimes conflict with one another. Multi-objective opti-mization is a suitable solution to this obstacle. Given the importance of multi-objective optimization problems in engineering and technology, adjusting the parameters of these types of problems will, in addition to the decision-making accuracy, facilitate the analysis of the results and makes it more applicable. For this purpose, multi-objective optimization using experimental design methods has been developed which can solve these problems by considering different objectives simultaneously. Mathematical modelling for the setting of the parameters of the considered problem with all the statistical details related to their prediction and optimization have been studied.
{"title":"Statistical adjustment of the parameters of multi-objective optimization problems with design expert method","authors":"A. Hasan-Zadeh","doi":"10.14419/JACST.V9I1.30656","DOIUrl":"https://doi.org/10.14419/JACST.V9I1.30656","url":null,"abstract":"Optimization methods in which one single criterion is considered cannot provide a comprehensive solution to various decisionmaking algorithms because they cannot consider the interchange of conflicting goals that sometimes conflict with one another. Multi-objective opti-mization is a suitable solution to this obstacle. Given the importance of multi-objective optimization problems in engineering and technology, adjusting the parameters of these types of problems will, in addition to the decision-making accuracy, facilitate the analysis of the results and makes it more applicable. For this purpose, multi-objective optimization using experimental design methods has been developed which can solve these problems by considering different objectives simultaneously. Mathematical modelling for the setting of the parameters of the considered problem with all the statistical details related to their prediction and optimization have been studied.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130521873","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-11DOI: 10.14419/JACST.V9I1.29908
O. Onifade, Paul Akinde, F. Isinkaye
Biometrics usage is growing daily and fingerprint-based recognition system is among the most effective and popular methods of personality identification. The conventional fingerprint sensor functions on total internal reflectance (TIR), which is a method that captures the external features of the finger that is presented to it. Hence, this opens it up to spoof attacks. Liveness detection is an anti-spoofing approach that has the potentials to identify physiological features in fingerprints. It has been demonstrated that spoof fingerprint made of gelatin, gummy and play-doh can easily deceive sensor. Therefore, the security of such sensor is not guaranteed. Here, we established a secure and robust fake-spoof fingerprint identification algorithm using Circular Gabor Wavelet for texture segmentation of the captured images. The samples were exposed to feature extraction processing using circular Gabor wavelet algorithm developed for texture segmentations. The result was evaluated using FAR which measures if a user presented is accepted under a false claimed identity. The FAR result was 0.03125 with an accuracy of 99.968% which showed distinct difference between live and spoof fingerprint.
{"title":"Circular Gabor wavelet algorithm for fingerprint liveness detection","authors":"O. Onifade, Paul Akinde, F. Isinkaye","doi":"10.14419/JACST.V9I1.29908","DOIUrl":"https://doi.org/10.14419/JACST.V9I1.29908","url":null,"abstract":"Biometrics usage is growing daily and fingerprint-based recognition system is among the most effective and popular methods of personality identification. The conventional fingerprint sensor functions on total internal reflectance (TIR), which is a method that captures the external features of the finger that is presented to it. Hence, this opens it up to spoof attacks. Liveness detection is an anti-spoofing approach that has the potentials to identify physiological features in fingerprints. It has been demonstrated that spoof fingerprint made of gelatin, gummy and play-doh can easily deceive sensor. Therefore, the security of such sensor is not guaranteed. Here, we established a secure and robust fake-spoof fingerprint identification algorithm using Circular Gabor Wavelet for texture segmentation of the captured images. The samples were exposed to feature extraction processing using circular Gabor wavelet algorithm developed for texture segmentations. The result was evaluated using FAR which measures if a user presented is accepted under a false claimed identity. The FAR result was 0.03125 with an accuracy of 99.968% which showed distinct difference between live and spoof fingerprint.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117209662","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-02-13DOI: 10.14419/JACST.V7I1.8827
M. Keshtkar
This study deals with thermodynamic investigation of a refrigeration compression cycle with carbon dioxide refrigerant and two stage compression. In this paper, the effect of intercooler in the two-stage compression system at different pressures of gas cooler is investigated. In addition, the performance of one stage compression cycle and two-stage compression cycle are compared and eventually, the performance of system is investigated under the influence of the change of variables such as gas cooler pressure, isentropic efficiency of the compressors, the intercooling rate between the two stages of compression, the refrigerant gas cooler outlet temperature is examined. Due to evaporation temperature in the evaporator 10 C and refrigeration capacity (kW) results show that the coefficient of performance in the two-stage compression with intercooler is increased compared to the single-stage compression cycle.
{"title":"Numerical analysis of transcritical carbon dioxide compression cycle: a case study","authors":"M. Keshtkar","doi":"10.14419/JACST.V7I1.8827","DOIUrl":"https://doi.org/10.14419/JACST.V7I1.8827","url":null,"abstract":"This study deals with thermodynamic investigation of a refrigeration compression cycle with carbon dioxide refrigerant and two stage compression. In this paper, the effect of intercooler in the two-stage compression system at different pressures of gas cooler is investigated. In addition, the performance of one stage compression cycle and two-stage compression cycle are compared and eventually, the performance of system is investigated under the influence of the change of variables such as gas cooler pressure, isentropic efficiency of the compressors, the intercooling rate between the two stages of compression, the refrigerant gas cooler outlet temperature is examined. Due to evaporation temperature in the evaporator 10 C and refrigeration capacity (kW) results show that the coefficient of performance in the two-stage compression with intercooler is increased compared to the single-stage compression cycle.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132773619","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 : 2017-11-24DOI: 10.14419/JACST.V6I2.8425
Yong Wang, B. Rawal
Abstract In this paper, we review security and usability scenarios. We propose security enhancements without losing usability and apply a new approach to popular application systems. Specifically, we analyze database security for access control, auditing, authentication, encryption, integrity control, backups, separation of environment, and secure configuration. Finally, we present our recommendations for system security and usability that work together.
{"title":"Usability meets security: a database case study","authors":"Yong Wang, B. Rawal","doi":"10.14419/JACST.V6I2.8425","DOIUrl":"https://doi.org/10.14419/JACST.V6I2.8425","url":null,"abstract":"Abstract In this paper, we review security and usability scenarios. We propose security enhancements without losing usability and apply a new approach to popular application systems. Specifically, we analyze database security for access control, auditing, authentication, encryption, integrity control, backups, separation of environment, and secure configuration. Finally, we present our recommendations for system security and usability that work together.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128456273","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 : 2017-06-04DOI: 10.14419/jacst.v6i2.7011
Kenmogne Edith Belise, Nkambou Roger, Tadmon Calvin, E. Nguifo
Sequential pattern mining is an efficient technique for discovering recurring structures or patterns from very large datasets, with a very large field of applications. It aims at extracting a set of attributes, shared across time among a large number of objects in a given database. Previous studies have developed two major classes of sequential pattern mining methods, namely, the candidate generation-and-test approach based on either vertical or horizontal data formats represented respectively by GSP and SPADE, and the pattern-growth approach represented by FreeSpan, PrefixSpan and their further extensions. The performances of these algorithms depend on how patterns grow. Because of this, we introduce a heuristic to predict the optimal pattern-growth direction, i.e. the pattern-growth direction leading to the best performance in terms of runtime and memory usage. Then, we perform a number of experimentations on both real-life and synthetic datasets to test the heuristic. The performance analysis of these experimentations show that the heuristic prediction is reliable in general.
{"title":"A heuristic to predict the optimal pattern-growth direction for the pattern growth-based sequential pattern mining approach","authors":"Kenmogne Edith Belise, Nkambou Roger, Tadmon Calvin, E. Nguifo","doi":"10.14419/jacst.v6i2.7011","DOIUrl":"https://doi.org/10.14419/jacst.v6i2.7011","url":null,"abstract":"Sequential pattern mining is an efficient technique for discovering recurring structures or patterns from very large datasets, with a very large field of applications. It aims at extracting a set of attributes, shared across time among a large number of objects in a given database. Previous studies have developed two major classes of sequential pattern mining methods, namely, the candidate generation-and-test approach based on either vertical or horizontal data formats represented respectively by GSP and SPADE, and the pattern-growth approach represented by FreeSpan, PrefixSpan and their further extensions. The performances of these algorithms depend on how patterns grow. Because of this, we introduce a heuristic to predict the optimal pattern-growth direction, i.e. the pattern-growth direction leading to the best performance in terms of runtime and memory usage. Then, we perform a number of experimentations on both real-life and synthetic datasets to test the heuristic. The performance analysis of these experimentations show that the heuristic prediction is reliable in general.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114713181","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 : 2017-02-26DOI: 10.14419/JACST.V6I1.6713
H. Al-Refai, K. Batiha
Lots of work have been attempted to enhance the SET protocol performance special attention is on E-payment phase. This paper thoroughly analyzes recent works on payment phase; it has been found that this subject requires considerable enhancements, since there are areas, which require further study such as: E-payment phase in SET protocol. E-payment phase is vast and complex phase it has long series of steps. The behavior of environment is assumed by the phase and is restricted to the rules built by their proposed protocol. This paper will follow Ph-Spi calculus for formalizing and analyzing enhanced payment phase of SET protocol by reducing the number of transactions with many additional operators. A new agent controller will be formally modeled, which we can rely upon to make automated decisions during interaction with a dynamic protocol environment. So, this agent controller is used to terminate the transaction process in any case of fraud or attack. This paper is conjunction between our previous works of E-payment phase in SET protocol and other works in Ph-Spi calculus in purpose of analyzing and proving the main security properties: authentication and privacy to evaluate the efficiency of the enhanced security of electronic payment phase for SET protocol (E-SET) using Ph-Spi calculus.
{"title":"Enhancing formal specification and verification of e-commerce protocol","authors":"H. Al-Refai, K. Batiha","doi":"10.14419/JACST.V6I1.6713","DOIUrl":"https://doi.org/10.14419/JACST.V6I1.6713","url":null,"abstract":"Lots of work have been attempted to enhance the SET protocol performance special attention is on E-payment phase. This paper thoroughly analyzes recent works on payment phase; it has been found that this subject requires considerable enhancements, since there are areas, which require further study such as: E-payment phase in SET protocol. E-payment phase is vast and complex phase it has long series of steps. The behavior of environment is assumed by the phase and is restricted to the rules built by their proposed protocol. This paper will follow Ph-Spi calculus for formalizing and analyzing enhanced payment phase of SET protocol by reducing the number of transactions with many additional operators. A new agent controller will be formally modeled, which we can rely upon to make automated decisions during interaction with a dynamic protocol environment. So, this agent controller is used to terminate the transaction process in any case of fraud or attack. This paper is conjunction between our previous works of E-payment phase in SET protocol and other works in Ph-Spi calculus in purpose of analyzing and proving the main security properties: authentication and privacy to evaluate the efficiency of the enhanced security of electronic payment phase for SET protocol (E-SET) using Ph-Spi calculus.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133389483","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 : 2017-02-08DOI: 10.14419/JACST.V6I1.6714
K. Batiha
As the developing use of web and intranet keep on expanding colossally, the issue to suit more clients and gadgets has been risen. Subsequently, a location range must be required to oblige the hurry. Sadly, IPv4 address region and alternatives are insufficient to meet this new necessity. A fresh out of the box new Protocol is expected to satisfy the developing interest. IPv6 is the best response to the above issues. We should have an early on study on IPv6 convention. IPv6 convention offers verity of advantages that incorporates a more extensive location region and upgraded choices and changes that are not beforehand be found in the IPv4. IPv6 in contrast with IPv4 have a wide address range, simple documentations for representation of a location, enhanced administrations and alternatives, upgraded header, propelled highlights, new choices and bolster, auto setup highlight, new convention bolster, Network Security, Virus and Worms Security, Support for different Operating frameworks and stage including Microsoft windows, Linux and MAC.
{"title":"The magic of internet protocol","authors":"K. Batiha","doi":"10.14419/JACST.V6I1.6714","DOIUrl":"https://doi.org/10.14419/JACST.V6I1.6714","url":null,"abstract":"As the developing use of web and intranet keep on expanding colossally, the issue to suit more clients and gadgets has been risen. Subsequently, a location range must be required to oblige the hurry. Sadly, IPv4 address region and alternatives are insufficient to meet this new necessity. A fresh out of the box new Protocol is expected to satisfy the developing interest. IPv6 is the best response to the above issues. We should have an early on study on IPv6 convention. IPv6 convention offers verity of advantages that incorporates a more extensive location region and upgraded choices and changes that are not beforehand be found in the IPv4. IPv6 in contrast with IPv4 have a wide address range, simple documentations for representation of a location, enhanced administrations and alternatives, upgraded header, propelled highlights, new choices and bolster, auto setup highlight, new convention bolster, Network Security, Virus and Worms Security, Support for different Operating frameworks and stage including Microsoft windows, Linux and MAC.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127187686","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 : 2016-07-19DOI: 10.14419/JACST.V5I2.6217
M. Keshtkar
In present work, effect of degrees of subcooling and superheating based on thermoeconomic optimization is investigated in two stage-cascade refrigeration system (TS-CRS). At the first step, by using R717 and R744 as refrigerants, a thermoeconomic analysis is applied to TS-CRS. Based on results of the first section and using the genetic algorithm (GA) optimizer implemented in MATLAB, the optimum operative conditions of a specific TS-CRS is determined. Finally, based on the Pareto frontier obtained from the GA optimization, a decision-making strategy is then used to determine a final solution by TOPSIS method. Two single-objective optimization strategies (SOS), i.e. exergetic optimization and cost optimization, are applied on TS-CRS. The aim of the first strategy is to maximize the exergetic efficiency and the aim of the second strategy is minimizing the total annual cost of the system. The case study results show that, compared to the base design, the use of SOS for maximizing of exergetic efficiency can be increases the exergetic efficiency 94.5%. In addition, the use of the second SOS can decrease the total system cost by 11%. Using MOS compared to base design, exergetic efficiency and the total system cost can be increase by 99.1% and 28.6% respectively.
{"title":"Effect of subcooling and superheating on performance of a cascade refrigeration system with considering thermo- economic analysis and multi-objective optimization","authors":"M. Keshtkar","doi":"10.14419/JACST.V5I2.6217","DOIUrl":"https://doi.org/10.14419/JACST.V5I2.6217","url":null,"abstract":"In present work, effect of degrees of subcooling and superheating based on thermoeconomic optimization is investigated in two stage-cascade refrigeration system (TS-CRS). At the first step, by using R717 and R744 as refrigerants, a thermoeconomic analysis is applied to TS-CRS. Based on results of the first section and using the genetic algorithm (GA) optimizer implemented in MATLAB, the optimum operative conditions of a specific TS-CRS is determined. Finally, based on the Pareto frontier obtained from the GA optimization, a decision-making strategy is then used to determine a final solution by TOPSIS method. Two single-objective optimization strategies (SOS), i.e. exergetic optimization and cost optimization, are applied on TS-CRS. The aim of the first strategy is to maximize the exergetic efficiency and the aim of the second strategy is minimizing the total annual cost of the system. The case study results show that, compared to the base design, the use of SOS for maximizing of exergetic efficiency can be increases the exergetic efficiency 94.5%. In addition, the use of the second SOS can decrease the total system cost by 11%. Using MOS compared to base design, exergetic efficiency and the total system cost can be increase by 99.1% and 28.6% respectively.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128096518","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
扫码关注我们
求助内容：
应助结果提醒方式：