Comput. Sci. J. Moldova最新文献

筛选
英文 中文
A new type of digital signature algorithms with a hidden group 一种新型的隐群数字签名算法
Comput. Sci. J. Moldova Pub Date : 2023-04-01 DOI: 10.56415/csjm.v31.06
D. Moldovyan
{"title":"A new type of digital signature algorithms with a hidden group","authors":"D. Moldovyan","doi":"10.56415/csjm.v31.06","DOIUrl":"https://doi.org/10.56415/csjm.v31.06","url":null,"abstract":"The known designs of digital signature schemes with a hidden group, which use finite non-commutative algebras as algebraic support, are based on the computational complexity of the so-called hidden discrete logarithm problem. A similar design, used to develop a signature algorithm based on the difficulty of solving a system of many quadratic equations in many variables, is introduced. The significant advantage of the proposed method compared with multivariate-cryptography signature algorithms is that the said system of equations, which occurs as the result of performing the exponentiation operations in the hidden group, has a random look and is specified in a finite field of a higher order. This provides the ability to develop post-quantum signature schemes with significantly smaller public-key sizes at a given level of security.\u0000","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123400007","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
Image Description Generator using Residual Neural Network and Long Short-Term Memory 基于残差神经网络和长短期记忆的图像描述生成器
Comput. Sci. J. Moldova Pub Date : 2023-04-01 DOI: 10.56415/csjm.v31.01
Mahesh Kumar Morampudi, Nagamani Gonthina, Nuthanakanti Bhaskar, V. Reddy
{"title":"Image Description Generator using Residual Neural Network and Long Short-Term Memory","authors":"Mahesh Kumar Morampudi, Nagamani Gonthina, Nuthanakanti Bhaskar, V. Reddy","doi":"10.56415/csjm.v31.01","DOIUrl":"https://doi.org/10.56415/csjm.v31.01","url":null,"abstract":"Human beings can describe scenarios and objects in a picture through vision easily whereas performing the same task with a computer is a complicated one. Generating captions for the objects of an image helps everyone to understand the scenario of the image in a better way. Instinctively describing the content of an image requires the apprehension of computer vision as well as natural language processing. This task has gained huge popularity in the field of technology and there is a lot of research work being carried out. Recent works have been successful in identifying objects in the image but are facing many challenges in generating captions to the given image accurately by understanding the scenario. To address this challenge, we propose a model to generate the caption for an image. Residual Neural Network (ResNet) is used to extract the features from an image. These features are converted into a vector of size 2048. The caption generation for the image is obtained with Long Short-Term Memory (LSTM). The proposed model is experimented on the Flickr8K dataset and obtained an accuracy of 88.4%. The experimental results indicate that our model produces appropriate captions compared to the state of art models.\u0000","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128062382","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
Performance comparison of CPU and GPGPU calculations using three simple case studies CPU和GPGPU计算的性能比较使用三个简单的案例研究
Comput. Sci. J. Moldova Pub Date : 2023-04-01 DOI: 10.56415/csjm.v31.07
Branislav Lipovský, Slavomír Simonák
{"title":"Performance comparison of CPU and GPGPU calculations using three simple case studies","authors":"Branislav Lipovský, Slavomír Simonák","doi":"10.56415/csjm.v31.07","DOIUrl":"https://doi.org/10.56415/csjm.v31.07","url":null,"abstract":"In this work, we have prepared and analyzed three case studies comparing CPU and GPGPU calculations. After briefly introducing the topic of parallel programming by means of contemporary CPU and GPGPU technologies, we provide an overview of selected existing works closely related to the topic of the paper. For each of the case studies, a set of programs has been implemented using the following technologies: pure CPU, CPU SIMD, CPU multi-threaded, CPU multi-threaded with SIMD instructions, and GPU - Cuda. We also illustrate the basic idea of the operation of selected algorithms using code snippets. Subsequently, the particular implementations are compared, and obtained results are evaluated and discussed.\u0000","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131060040","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
A Neural Attention-Based Encoder-Decoder Approach for English to Bangla Translation 基于神经注意的英语到孟加拉语翻译编码器-解码器方法
Comput. Sci. J. Moldova Pub Date : 2023-04-01 DOI: 10.56415/csjm.v31.04
Abdullah Al Shiam, S. M. Redwan, Humaun Kabir, Jungpil Shin
{"title":"A Neural Attention-Based Encoder-Decoder Approach for English to Bangla Translation","authors":"Abdullah Al Shiam, S. M. Redwan, Humaun Kabir, Jungpil Shin","doi":"10.56415/csjm.v31.04","DOIUrl":"https://doi.org/10.56415/csjm.v31.04","url":null,"abstract":"Machine translation (MT) is the process of translating text from one language to another using bilingual data sets and grammatical rules. Recent works in the field of MT have popularized sequence-to-sequence models leveraging neural attention and deep learning. The success of neural attention models is yet to be construed into a robust framework for automated English-to-Bangla translation due to a lack of a comprehensive dataset that encompasses the diverse vocabulary of the Bangla language. In this study, we have proposed an English-to-Bangla MT system using an encoder-decoder attention model using the CCMatrix corpus. Our method shows that this model can outperform traditional SMT and RBMT models with a Bilingual Evaluation Understudy (BLEU) score of 15.68 despite being constrained by the limited vocabulary of the corpus. We hypothesize that this model can be used successfully for state-of-the-art machine translation with a more diverse and accurate dataset. This work can be extended further to incorporate several newer datasets using transfer learning techniques.\u0000","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125306905","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
Graph-based decision making for varying complexity multicriteria problems 基于图的复杂多准则问题决策
Comput. Sci. J. Moldova Pub Date : 2022-12-01 DOI: 10.56415/csjm.v30.21
O. Nesterenko, I. Netesin, V. Polischuk, Yurij Selin
{"title":"Graph-based decision making for varying complexity multicriteria problems","authors":"O. Nesterenko, I. Netesin, V. Polischuk, Yurij Selin","doi":"10.56415/csjm.v30.21","DOIUrl":"https://doi.org/10.56415/csjm.v30.21","url":null,"abstract":"In the modern world in various spheres of activity, the number of problems that need multi-criteria decision-making (MCDM) is constantly increasing. Researchers and experts offer a number of approaches to MCDM process in such tasks; in particular, most of them are based on expert methods. However, in practice, these methods require significant intellectual effort of experts and organizational and technical workload during the expert survey, and also usually take a long time. At the same time, it is not always possible for experts to use certain characteristics of alternatives, which also carries the risk of making decisions based on unfounded expert opinions. Therefore, such methods and tools should be clear and informative and at the same time easy to use to ensure the efficiency and effectiveness of their use. We offer a graph-based approach to expert decision-making and information visualization processes that meets these requirements and can significantly improve the efficiency of decision-making in multi-criteria selection tasks.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124170329","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
An Intelligent Detection of Malicious Intrusions in IoT Based on Machine Learning and Deep Learning Techniques 基于机器学习和深度学习技术的物联网恶意入侵智能检测
Comput. Sci. J. Moldova Pub Date : 2022-12-01 DOI: 10.56415/csjm.v30.16
Saman Iftikhar, Danish Khan, Daniah Al-Madani, K. Alheeti, Kiran Fatima
{"title":"An Intelligent Detection of Malicious Intrusions in IoT Based on Machine Learning and Deep Learning Techniques","authors":"Saman Iftikhar, Danish Khan, Daniah Al-Madani, K. Alheeti, Kiran Fatima","doi":"10.56415/csjm.v30.16","DOIUrl":"https://doi.org/10.56415/csjm.v30.16","url":null,"abstract":"The devices of the Internet of Things (IoT) are facing various types of attacks, and IoT applications present unique and new protection challenges. These security challenges in IoT must be addressed to avoid any potential attacks. Malicious intrusions in IoT devices are considered one of the most aspects required for IoT users in modern applications. Machine learning techniques are widely used for intelligent detection of malicious intrusions in IoT. This paper proposes an intelligent detection method of malicious intrusions in IoT systems that leverages effective classification of benign and malicious attacks. An ensemble approach combined with various machine learning algorithms and a deep learning technique, is used to detect anomalies and other malicious activities in IoT. For the consideration of the detection of malicious intrusions and anomalies in IoT devices, UNSW-NB15 dataset is used as one of the latest IoT datasets. In this research, malicious and normal intrusions in IoT devices are classified with the use of various models. %Moreover, improved results are provided and compared with CorrAuc [1] for training accuracies, cross-validation accuracies, execution time, precision, recall and F1 score.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131507169","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
Privacy and Reader-first Authentication in Vaudenay's RFID Model with Temporary State Disclosure Vaudenay具有临时状态披露的RFID模型中的隐私和读者优先认证
Comput. Sci. J. Moldova Pub Date : 2022-12-01 DOI: 10.56415/csjm.v30.18
F. Ţiplea, Cristian Hristea
{"title":"Privacy and Reader-first Authentication in Vaudenay's RFID Model with Temporary State Disclosure","authors":"F. Ţiplea, Cristian Hristea","doi":"10.56415/csjm.v30.18","DOIUrl":"https://doi.org/10.56415/csjm.v30.18","url":null,"abstract":"Privacy and mutual authentication under corruption with temporary state disclosure are two significant requirements for real-life applications of RFID schemes. This paper proposes two practical RFID schemes that meet these requirements. They differ from other similar schemes in that they provide reader-first authentication. Regarding privacy, our first scheme achieves destructive privacy, while the second one -- narrow destructive privacy in Vaudenay's model with temporary state disclosure. To achieve these privacy levels, we use Physically Unclonable Functions (PUFs) to assure that the internal secret of the tag remains hidden from an adversary with invasive capabilities. Both of our schemes avoid the use of random generators on tags. Detailed security and privacy proofs are provided.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122440494","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}
引用次数: 4
Wiener Index of Some Brooms 一些扫帚的维纳指数
Comput. Sci. J. Moldova Pub Date : 2022-12-01 DOI: 10.56415/csjm.v30.20
Julian D. Allagan
{"title":"Wiener Index of Some Brooms","authors":"Julian D. Allagan","doi":"10.56415/csjm.v30.20","DOIUrl":"https://doi.org/10.56415/csjm.v30.20","url":null,"abstract":"In the field of chemical graph theory, a Wiener (topological) index is a type of a molecular descriptor that is calculated based on the molecular graph of alkanes. It gives the sum of geodesic distances (or shortest paths) between all pairs of vertices of the graph. We found and prove the Wiener indices of some Brooms, which are Caterpillars, giving several unknown sequences that are now added to the collection of the largest Online Encyclopedia of Integer Sequences.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126323897","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
Kurtosis-Based Feature Selection Method using Symmetric Uncertainty to Predict the Air Quality Index 基于峰度的对称不确定性特征选择方法预测空气质量指数
Comput. Sci. J. Moldova Pub Date : 2022-12-01 DOI: 10.56415/csjm.v30.19
Usharani Bhimavarapu, M. Sreedevi
{"title":"Kurtosis-Based Feature Selection Method using Symmetric Uncertainty to Predict the Air Quality Index","authors":"Usharani Bhimavarapu, M. Sreedevi","doi":"10.56415/csjm.v30.19","DOIUrl":"https://doi.org/10.56415/csjm.v30.19","url":null,"abstract":"Feature selection is vital in data pre-processing in machine learning, and it is prominent in datasets with many features. Feature selection analyses the relevant, irrelevant, and redundant features in the dataset. Feature selection removes the irrelevant features, which improves both the accuracy and prediction performance. The significant advantages of reducing the number of features from the dataset are reducing the training time, reducing overfitting, decreasing the curse of dimensionality, and simplifying the prediction model. The filter feature selection techniques can handle the issues with the high number of features, and this paper uses the symmetric uncertainty coefficient to verify the relevance of the independent features. In this paper, a new feature selection method named as kurtosis-based feature selection has been proposed to select the relevant features which affect the air pollution. Kurtosis-based feature selection is compared with seven filter feature selection techniques on air pollution dataset and validated the performance of the proposed algorithm. It has been observed that the kurtosis-based feature selection extracts only PM2.5 as the key feature and has been compared to the accuracy of the five existing methods. The experimental results illustrate that the kurtosis-based feature selection algorithm reduces the original feature set up to 91.66%, but the existing filter feature selection techniques reduce the feature set to only 50%.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117262366","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
Residual Neural Network in Genomics 基因组学中的残差神经网络
Comput. Sci. J. Moldova Pub Date : 2022-12-01 DOI: 10.56415/csjm.v30.17
S. Sabba, M. Smara, Mehdi Benhacine, Loubna Terra, Zine Eddine Terra
{"title":"Residual Neural Network in Genomics","authors":"S. Sabba, M. Smara, Mehdi Benhacine, Loubna Terra, Zine Eddine Terra","doi":"10.56415/csjm.v30.17","DOIUrl":"https://doi.org/10.56415/csjm.v30.17","url":null,"abstract":"Residual neural network (ResNet) is a Deep Learning model introduced by He et al. in 2015 to enhance traditional convolutional neural networks proposed to solve computer vision problems. It uses skip connections over some layer blocks to avoid vanishing gradient problem. Currently, many researches are focused to test and prove the efficiency of the ResNet on different domains such as genomics. In fact, the study of human genomes provides important information on the detection of diseases and their best treatments. Therefore, most of the scientists opted for bioinformatics solutions to get results in a reasonable time. In this paper, our interest is to show the effectiveness of the ResNet model on genomics. For that, we propose two new ResNet models to enhance the results of two genomic problems previously resolved by CNN models. The obtained results are very promising and they proved the performance of our ResNet models compared to the CNN models.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124957660","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信