发布求助
文献互助 智能选刊 最新文献

Comput. Sci. J. Moldova最新文献

筛选
英文 中文
Deep learning-based software for detecting population density of Antarctic birds 用于探测南极鸟类种群密度的深度学习软件
Comput. Sci. J. Moldova Pub Date : 2023-07-01 DOI: 10.56415/csjm.v31.11
S. Uğuz
{"title":"Deep learning-based software for detecting population density of Antarctic birds","authors":"S. Uğuz","doi":"10.56415/csjm.v31.11","DOIUrl":"https://doi.org/10.56415/csjm.v31.11","url":null,"abstract":"Monitoring populations of bird species living in Antarctica with current technologies is critical to the future of habitats on the continent. Studies of bird species living in Antarctica are limited due to climate, challenging geographic conditions, and transportation and logistical constraints. The goal of this study is to develop Deep Learning-based software to determine the population densities of Antarctic penguins and endangered albatrosses. Images of penguins and albatrosses obtained from internet sources were labeled using the segmentation technique. For this purpose, 4144 labeled data were trained with five different convolutional neural network architectures TOOD, YOLOv3, YOLOF, Mask R-CNN, and Sparse R-CNN. The performance of the obtained models was measured using the average precision (AP) metric. The experimental results show that the TOOD-ResNet50 model with 0.73 {$AP^{50}$} detects the Antarctic birds adequately compared to the other models. At the end of the study, a software was developed to detect penguins and albatrosses in real time","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115362368","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
Correcting Instruction Expression Logic Errors with GenExp: A Genetic Programming Solution 用GenExp修正指令表达式逻辑错误:一个遗传规划解决方案
Comput. Sci. J. Moldova Pub Date : 2023-07-01 DOI: 10.56415/csjm.v31.12
M. Bekkouche
{"title":"Correcting Instruction Expression Logic Errors with GenExp: A Genetic Programming Solution","authors":"M. Bekkouche","doi":"10.56415/csjm.v31.12","DOIUrl":"https://doi.org/10.56415/csjm.v31.12","url":null,"abstract":"Correcting logical errors in a program is not simple even with the availability of an error locating tool. In this article, we introduce GenExp, a genetic programming approach to automate the task of repairing instruction expressions from logical errors. correction{Starting} from an error location specified by the programmer, we search for a replacement instruction that passes all test cases. Specifically, we generate expressions that will substitute the selected instruction expression until correction{we} obtain one that correction{corrects} the input program. correction{The search space is exponentially large, making exhaustive methods inefficient.} correction{Therefore, we utilize a genetic programming meta-heuristic that organizes the search process into stages, with each stage producing a group of individuals.} The results showed that our approach can find at least one plausible patch for almost all cases considered in experiments and outperforms a notable state-of-the-art error repair approach correction{like} ASTOR. Although our tool is slower than ASTOR, it correction{provides} greater precision in detecting plausible repairs, making it a suitable option for users who prioritize accuracy over speed.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130966946","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
Comprehensive Performance Study of Hashing Functions 哈希函数的综合性能研究
Comput. Sci. J. Moldova Pub Date : 2023-07-01 DOI: 10.56415/csjm.v31.10
G. Sridevi, M. Ramakrishna, DV Ashoka
{"title":"Comprehensive Performance Study of Hashing Functions","authors":"G. Sridevi, M. Ramakrishna, DV Ashoka","doi":"10.56415/csjm.v31.10","DOIUrl":"https://doi.org/10.56415/csjm.v31.10","url":null,"abstract":"Most literature on hashing functions speaks in terms of hashing functions being either ‘good’ or ‘bad’. In this paper, we demonstrate how a hashing function that gives good results for one key set, performs badly for another. We also demonstrate that, for a single key set, we can find hashing functions that hash the keys with varying performances ranging from perfect to worst distributions. We present a study on the effect of changing the prime number ‘$p$’ on the performance of a hashing function from $H_1$ Class of Universal Hashing Functions. This paper then explores a way to characterize hashing functions by studying their performance over all subsets of a chosen Universe. We compare the performance of some popular hashing functions based on the average search performance and the number of perfect and worst-case distributions over different key sets chosen from a Universe. The experimental results show that the division-remainder method provides the best distribution for most key sets of the Universe when compared to other hashing functions including functions from $H_1$ Class of Universal Hashing Functions.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129355629","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 approach to Augmented Reality Classification and an example of its usage for application development with VAK learning styles Markers 增强现实分类的一种方法，以及使用VAK学习风格标记进行应用程序开发的一个示例
Comput. Sci. J. Moldova Pub Date : 2023-07-01 DOI: 10.56415/csjm.v31.13
Titchiev Inga, Caftanatov Olesea, Iamandi Veronica, Talambuta Dan, Daniela Caganovschi
{"title":"An approach to Augmented Reality Classification and an example of its usage for application development with VAK learning styles Markers","authors":"Titchiev Inga, Caftanatov Olesea, Iamandi Veronica, Talambuta Dan, Daniela Caganovschi","doi":"10.56415/csjm.v31.13","DOIUrl":"https://doi.org/10.56415/csjm.v31.13","url":null,"abstract":"Augmented reality (AR) encompasses both technology and the experience it provides, making it applicable in real-world contexts. The field of education is particularly suited for utilizing AR techniques as a novel means of engaging with students. Various classifications of AR techniques exist, each offering remarkable potential for educational purposes. This paper presents an approach to classifying augmented reality based on the characteristics of different techniques. Additionally, we demonstrate the application of a specific type of AR technology in the development of an educational application. Furthermore, we emphasize the importance of designing augmented learning scenarios that align with the VAK learning styles, aiming to deliver personalized and immersive learning experiences. The integration of AR and VAK learning styles shows the potential for creating educational tools that are both engaging and effective.%footnote{ This work was supported by Intelligent Information systems for solving ill structured problems, knowledge and Big Data processing project Ref. Nr. 20.80009.5007.22}","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131800254","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
PN2Maude: An automatic tool to generate Maude specification for Petri net models PN2Maude:为Petri网模型生成Maude规范的自动工具
Comput. Sci. J. Moldova Pub Date : 2023-07-01 DOI: 10.56415/csjm.v31.14
A. Boucherit, Messaoud Abbas, Mohammed Lamine Lamouri, Osman Hasan
{"title":"PN2Maude: An automatic tool to generate Maude specification for Petri net models","authors":"A. Boucherit, Messaoud Abbas, Mohammed Lamine Lamouri, Osman Hasan","doi":"10.56415/csjm.v31.14","DOIUrl":"https://doi.org/10.56415/csjm.v31.14","url":null,"abstract":"Currently, Model-Driven Engineering (MDE) plays a key role in the software development process as it aims to handle their increasing complexity and focuses on the automatic generation of code and/or specifications from system models. This paper presents a very useful tool for the automatic generation of Maude specifications from both Petri net PNML (Petri Net Markup Language) descriptions or incidence matrices. At the end of this paper, a simple but complete Petri net example will be presented to demonstrate the usefulness of the developed tool.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121262210","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
Identifying key players in a network of child exploitation websites using Principal Component Analysis 使用主成分分析法确定儿童剥削网站网络中的关键参与者
Comput. Sci. J. Moldova Pub Date : 2023-07-01 DOI: 10.56415/csjm.v31.08
F. Movahedi, Richard Frank
{"title":"Identifying key players in a network of child exploitation websites using Principal Component Analysis","authors":"F. Movahedi, Richard Frank","doi":"10.56415/csjm.v31.08","DOIUrl":"https://doi.org/10.56415/csjm.v31.08","url":null,"abstract":"One of the main objectives of this study is to help prioritize targets for law enforcement by analyzing online websites hosting child exploitation material and finding key players within. Key players are defined as websites that display a combination of high connectivity and a lot of hardcore material and would provide the most disruption in a network if they were to be removed. In this study, various strategies based on Principal Component Analysis are presented to identify those nodes that act as the key players in an online child exploitation network. For evaluating the results of these strategies, we consider the results of various attack strategies. The measures for evaluation are the density, clustering coefficient, average path length, diameter, and the number of connected components in the resulting network. The results show that the strategies proposed are more successful at reducing all of the outcome measures than existing strategies.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125316689","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
Total Italian domatic number of graphs 图的意大利国内总数
Comput. Sci. J. Moldova Pub Date : 2023-07-01 DOI: 10.56415/csjm.v31.09
S. M. Sheikholeslami, L. Volkmann
{"title":"Total Italian domatic number of graphs","authors":"S. M. Sheikholeslami, L. Volkmann","doi":"10.56415/csjm.v31.09","DOIUrl":"https://doi.org/10.56415/csjm.v31.09","url":null,"abstract":"Let $G$ be a graph with vertex set $V(G)$. An textit{Italian dominating function} (IDF) on a graph $G$ is a function $f:V(G)longrightarrow {0,1,2}$ such that every vertex $v$ with $f(v)=0$ is adjacent to a vertex $u$ with $f(u)=2$ or to two vertices $w$ and $z$ with $f(w)=f(z)=1$. An IDF $f$ is called a textit{total Italian dominating function} if every vertex $v$ with $f(v)ge 1$ is adjacent to a vertex $u$ with $f(u)ge 1$. A set ${f_1,f_2,ldots,f_d}$ of distinct total Italian dominating functions on $G$ with the property that $sum_{i=1}^df_i(v)le 2$ for each vertex $vin V(G)$, is called a textit{total Italian dominating family} (of functions) on $G$. The maximum number of functions in a total Italian dominating family on $G$ is the textit{total Italian domatic number} of $G$, denoted by $d_{tI}(G)$. In this paper, we initiate the study of the total Italian domatic number and present different sharp bounds on $d_{tI}(G)$. In addition, we determine this parameter for some classes of graphs.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131104581","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}
引用次数: 1
Bandwidth Allocation Algorithm for Makespan Optimization in a Fog-Cloud Environment: Monitoring Application 雾云环境下最大跨度优化的带宽分配算法:监控应用
Comput. Sci. J. Moldova Pub Date : 2023-04-01 DOI: 10.56415/csjm.v31.03
Bentabet Dougani, Abdeslem Dennai
{"title":"Bandwidth Allocation Algorithm for Makespan Optimization in a Fog-Cloud Environment: Monitoring Application","authors":"Bentabet Dougani, Abdeslem Dennai","doi":"10.56415/csjm.v31.03","DOIUrl":"https://doi.org/10.56415/csjm.v31.03","url":null,"abstract":"Fog computing technology has emerged to handle a large amount of data generated by the Internet of Things (IoT) terminals and cope with latency-sensitive application requests by allocating computation and storage resources at the edge of the Internet. In many IoT applications, the data acquisition procedures must apply the Directed Acyclic Graph (DAG) to get real-time results. The principal goal of DAG scheduling is to reduce total completion time without breaking priority constraints by properly allocating tasks to processors and arranging task execution sequencing. In this paper, we propose a bandwidth-aware workflow allocation (BW-AWA) that schedules tasks by priority to the resource and optimizes the total execution time (Makespan) in the entire computing system. The task allocation process needs to consider the dependency between tasks. The proposed approach is tested with a monitoring application case study, and the results are compared to well-known approaches to demonstrate its effectiveness in optimizing the Makespan.\u0000","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"22 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":"129279079","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
Prostate Cancer Classifier based on Three-Dimensional Magnetic Resonance Imaging and Convolutional Neural Networks 基于三维磁共振成像和卷积神经网络的前列腺癌分类器
Comput. Sci. J. Moldova Pub Date : 2023-04-01 DOI: 10.56415/csjm.v31.02
Ana-Maria Minda, Adrian C. Albu
{"title":"Prostate Cancer Classifier based on Three-Dimensional Magnetic Resonance Imaging and Convolutional Neural Networks","authors":"Ana-Maria Minda, Adrian C. Albu","doi":"10.56415/csjm.v31.02","DOIUrl":"https://doi.org/10.56415/csjm.v31.02","url":null,"abstract":"The main reason for this research is the worldwide existence of a large number of prostate cancers. This article underlines how necessary medical imaging is, in association with artificial intelligence, in early detection of this medical condition. The diagnosis of a patient with prostate cancer is conventionally made based on multiple biopsies, histopathologic tests and other procedures that are time consuming and directly dependent on the experience level of the radiologist. The deep learning algorithms reduce the investigation time and could help medical staff. This work proposes a binary classification algorithm which uses convolutional neural networks to predict whether a 3D MRI scan contains a malignant lesion or not. The provided result can be a starting point in the diagnosis phase. The investigation, however, should be finalized by a human expert.\u0000","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"21 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131588676","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 Secret Image Sharing Based on Logistic-Chebyshev Chaotic Map and Chinese Remainder Theorem 基于Logistic-Chebyshev混沌映射和中国剩余定理的秘密图像共享
Comput. Sci. J. Moldova Pub Date : 2023-04-01 DOI: 10.56415/csjm.v31.05
Asmaa Hilmi, Soufiane Mezroui, A. Oualkadi
{"title":"A Secret Image Sharing Based on Logistic-Chebyshev Chaotic Map and Chinese Remainder Theorem","authors":"Asmaa Hilmi, Soufiane Mezroui, A. Oualkadi","doi":"10.56415/csjm.v31.05","DOIUrl":"https://doi.org/10.56415/csjm.v31.05","url":null,"abstract":"Visual Cryptography, Logistic-Chebyshev map, Chinese Remainder Theorem, share.lves breaking up a secret image into $n$ secured components known as shares. The secret image is recovered with utmost secrecy when all of these shares are lined up and piled together. A (3, 3)-secret image sharing scheme (SIS) is provided in this paper by fusing the Chinese Remainder Theorem (CRT) and the Logistic-Chebyshev map (LC). Sharing a confidential image created with CRT has various benefits, including lossless recovery, the lack of further encryption, and minimal recovery calculation overhead. Firstly, we build a chaotic sequence using an LC map. The secret value pixel for the secret image is permuted in order to fend off differential attackers. To encrypt the scrambled image, we apply our CRT technique to create three shares. Finally, the security analysis of our (3, 3)-SIS scheme is demonstrated and confirmed by some simulation results.\u0000","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"21 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":"114923034","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学术官方微信