International Journal of Computing最新文献_第5页

Improving Continuous Hopfield Network Stability Using Runge-Kutta Method 利用龙格-库塔方法改进连续Hopfield网络的稳定性

International Journal of Computing Pub Date : 2023-03-29 DOI: 10.47839/ijc.22.1.2876

Mohammed El Alaoui, M. Ettaouil

引用次数: 3

Symmetrical Cryptosystems based on Cellular Automata 基于元胞自动机的对称密码系统

International Journal of Computing Pub Date : 2023-03-29 DOI: 10.47839/ijc.22.1.2874

Serhii Ostapov, Bohdan Diakonenko, Maksym Fylypiuk, K. Hazdiuk, Liliia Shumyliak, O.Yu. Tarnovetska

{"title":"Symmetrical Cryptosystems based on Cellular Automata","authors":"Serhii Ostapov, Bohdan Diakonenko, Maksym Fylypiuk, K. Hazdiuk, Liliia Shumyliak, O.Yu. Tarnovetska","doi":"10.47839/ijc.22.1.2874","DOIUrl":"https://doi.org/10.47839/ijc.22.1.2874","url":null,"abstract":"This paper deals with the development of two symmetric encryption algorithms on the basis of cellular automata: a block cipher, that is based on AES and uses three-dimensional cellular automata; a stream cipher, that exploits a hardware-software entropy generation (tracking of keystrokes and mouse pointer movement), as well as the developed hash function, based on “cryptographic sponge” architecture of SHA-3, modified by cellular automata transformations. The block cipher is designed in architecture of SP-network and uses the AES substitution block. Permutation layer and key generation is designed on the basis of cellular automata rules (rules “22”, “105” and “150”). The optimal number of rounds to achieve maximum crypto resistance is determined. The stream cipher is designed on the basis of hardware-software entropy generation and uses the cryptographic hash-function in the SHA-3 architecture. Permutation function is developed on the basis of cellular automata rules (rules “30” and “146”). The procedures of shift and permutation of rows and columns is used for better permutation. A final permutation of state elements is used to improve the avalanche effect. The received results are analyzed and summarized; the conclusions and justifications about cipher parameters (like number of rounds, where needed) are made.","PeriodicalId":37669,"journal":{"name":"International Journal of Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82014544","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}

引用次数: 0

Simulated Annealing – 2 Opt Algorithm for Solving Traveling Salesman Problem 求解旅行商问题的模拟退火- 2优算法

International Journal of Computing Pub Date : 2023-03-29 DOI: 10.47839/ijc.22.1.2878

P. H. Gunawan, I. Iryanto

{"title":"Simulated Annealing – 2 Opt Algorithm for Solving Traveling Salesman Problem","authors":"P. H. Gunawan, I. Iryanto","doi":"10.47839/ijc.22.1.2878","DOIUrl":"https://doi.org/10.47839/ijc.22.1.2878","url":null,"abstract":"The purpose of this article is to elaborate performance of the hybrid model of Simulated Annealing (SA) and 2 Opt algorithm for solving the traveling salesman problem (TSP). The SA algorithm used in this article is based on the outer and inner loop SA algorithm. The hybrid algorithm has promising results in solving small and medium-scale symmetric traveling salesman problem benchmark tests taken from the TSPLIB reference. Results of the optimal solution and standard deviation indicate that the hybrid algorithm shows good performance in terms of reliability and stability in finding the optimal solution from the TSP benchmark case. Values of average error and standard deviation for all simulations in the medium scale are 0.0267 and 644.12, respectively. Moreover, in some cases namely KroB100, Pr107, and Pr144, the hybrid algorithm finds a better solution compared with the best-known solution mentioned in the reference. Further, the hybrid algorithm is 1.207 – 5.692 times faster than the pure outer and inner loop-based SA algorithm. Additionally, the results show that the hybrid algorithm outperforms other hybrid algorithms such as SA – nearest neighbor (NN) and NN – 2 Opt.","PeriodicalId":37669,"journal":{"name":"International Journal of Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88106912","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}

引用次数: 0

Cross-Selection Based Evolution Strategies 基于交叉选择的进化策略

International Journal of Computing Pub Date : 2023-03-29 DOI: 10.47839/ijc.22.1.2881

L. Khilkova

引用次数: 0

Algorithm for Calculation the Carry and Borrow Signs in Multi-digit Operations in the Parallel Computational Model 并行计算模型中多位数运算进借号的计算算法

International Journal of Computing Pub Date : 2023-03-29 DOI: 10.47839/ijc.22.1.2875

A. Tereshchenko, V. Zadiraka

{"title":"Algorithm for Calculation the Carry and Borrow Signs in Multi-digit Operations in the Parallel Computational Model","authors":"A. Tereshchenko, V. Zadiraka","doi":"10.47839/ijc.22.1.2875","DOIUrl":"https://doi.org/10.47839/ijc.22.1.2875","url":null,"abstract":"The fast algorithm to calculate carry signs and borrow signs for implementation of fast multi-digit operations in the parallel computational model is proposed. The proposed algorithm also makes it possible to predict carry signs in the case of an addition operation and predict borrow signs for a subtraction operation. It is shown how the sign prediction algorithm is implemented in operations in which each parallel processor proceeds the separate group of words into which multi-digit numbers are divided. The iterative calculations of carry signs of grouped words are described. The sign calculation algorithm as component of new modifications of multi-digit addition, subtraction, comparison, the sum of three or more numbers in the parallel computational model is presented. The sign calculation algorithm provides general approach to the implementation of multiplication, division, multiplication by modulo, exponentiation by modulo in the parallel computational model. In the form of a table, a general analysis of the complexity of algorithms and an analysis of the complexity by the number of single-word operations per processor are given.","PeriodicalId":37669,"journal":{"name":"International Journal of Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89412082","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}

引用次数: 0

Practical Study on Software Requirements Specification and Modelling Techniques 软件需求规范与建模技术的实践研究

International Journal of Computing Pub Date : 2023-03-29 DOI: 10.47839/ijc.22.1.2882

Denys Gobov

引用次数: 3

Chains Defects Detection in a Printed Circuit Board Image by the Plane Partition and Flood-filling of Traces 基于平面分割和迹线填充的印刷电路板图像链缺陷检测

International Journal of Computing Pub Date : 2023-03-29 DOI: 10.47839/ijc.22.1.2877

R. Melnyk, Tetyana Korotyeyeva, Yevheniya Levus

引用次数: 0

An Automated Face-mask Detection System using YOLOv5 for Preventing Spread of COVID-19 基于YOLOv5的新型冠状病毒自动口罩检测系统

International Journal of Computing Pub Date : 2023-03-29 DOI: 10.47839/ijc.22.1.2880

Md Asifuzzaman Jishan, Md. Shahabub Alam, Imran Rashid Mazumder, K. Mahmud, Abul Kalam al Azad

引用次数: 0

Image Pair Comparison for Near-duplicates Detection 近重复检测的图像对比较

International Journal of Computing Pub Date : 2023-03-29 DOI: 10.47839/ijc.22.1.2879

O. Gorokhovatskyi, O. Peredrii

引用次数: 0

Performance Evaluation of Classification Algorithm for Movie Review Sentiment Analysis 电影评论情感分析分类算法的性能评价

International Journal of Computing Pub Date : 2023-03-29 DOI: 10.47839/ijc.22.1.2873

Sutriawan Sutriawan, P. Andono, Muljono Muljono, R. A. Pramunendar

{"title":"Performance Evaluation of Classification Algorithm for Movie Review Sentiment Analysis","authors":"Sutriawan Sutriawan, P. Andono, Muljono Muljono, R. A. Pramunendar","doi":"10.47839/ijc.22.1.2873","DOIUrl":"https://doi.org/10.47839/ijc.22.1.2873","url":null,"abstract":"The majority of the current research on sentiment analysis, which covers topics like political reviews, movie reviews, and product reviews, has developed quickly. The classification and clustering stage of sentiment analysis research involves a number of subjects. Some of them cover text classification comparison research and algorithm performance optimization. An intricate issue in sentiment analysis research is dealing with unstructured or semi-structured data. The sentiment analysis procedure and improving the efficacy of the classifier’s algorithm are both hampered by unstructured data. In order to manage unstructured data successfully and provide accurate and relevant information, unique strategies are required. The proposed classification model performance evaluation using Support Vector Machine, Naive Bayes, K-Nearest Neighbor, and Decision Tree is specifically covered in this paper. According to the study’s findings, SVM has an accuracy rate of 96% and Naive Bayes is 86%. While the decision tree’s gain accuracy is 78 percent and the kNN classification model’s gain accuracy is 78 percent, respectively. The test results demonstrate that SVM is superior to other classification models in terms of accuracy performance.","PeriodicalId":37669,"journal":{"name":"International Journal of Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90147686","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}

引用次数: 2