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

Computer Science Journal of Moldova最新文献

筛选
英文 中文
Outer independent total double Italian domination number 外独立总双意大利支配数
IF 0.3
Computer Science Journal of Moldova Pub Date : 2024-04-01 DOI: 10.56415/csjm.v32.02
S. M. Sheikholeslami, L. Volkmann
{"title":"Outer independent total double Italian domination number","authors":"S. M. Sheikholeslami, L. Volkmann","doi":"10.56415/csjm.v32.02","DOIUrl":"https://doi.org/10.56415/csjm.v32.02","url":null,"abstract":"If $G$ is a graph with vertex set $V(G)$, then let $N[u]$ be the closed neighborhood of the vertex $uin V(G)$. A total double Italian dominating function (TDIDF) on a graph $G$ is a function $f:V(G)rightarrow{0,1,2,3}$ satisfying (i) $f(N[u])ge 3$ for every vertex $uin V(G)$ with $f(u)in{0,1}$ and (ii) the subgraph induced by the vertices with a non-zero label has no isolated vertices. A TDIDF is an outer-independent total double Italian dominating function (OITDIDF) on $G$ if the set of vertices labeled $0$ induces an edgeless subgraph. The weight of an OITDIDF is the sum of its function values over all vertices, and the outer independent total double Italian domination number $gamma_{tdI}^{oi}(G)$ is the minimum weight of an OITDIDF on $G$. In this paper, we establish various bounds on $gamma_{tdI}^{oi}(G)$, and we determine this parameter for some special classes of graphs.","PeriodicalId":42293,"journal":{"name":"Computer Science Journal of Moldova","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140761771","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 Binary Grey Wolf Optimizer with Mutation for Mining Association Rules 用于挖掘关联规则的带突变的二元灰狼优化器
IF 0.3
Computer Science Journal of Moldova Pub Date : 2024-04-01 DOI: 10.56415/csjm.v32.06
K. Heraguemi, Nadjet Kamel, Majdi M. Mafarja
{"title":"A Binary Grey Wolf Optimizer with Mutation for Mining Association Rules","authors":"K. Heraguemi, Nadjet Kamel, Majdi M. Mafarja","doi":"10.56415/csjm.v32.06","DOIUrl":"https://doi.org/10.56415/csjm.v32.06","url":null,"abstract":"In this decade, the internet becomes indispensable in companies and people life. Therefore, a huge quantity of data, which can be a source of hidden information such as association rules that help in decision-making, is stored. Association rule mining (ARM) becomes an attractive data mining task to mine hidden correlations between items in sizeable databases. However, this task is a combinatorial hard problem and, in many cases, the classical algorithms generate extremely large number of rules, that are useless and hard to be validated by the final user. In this paper, we proposed a binary version of grey wolf optimizer that is based on sigmoid function and mutation technique to deal with ARM issue, called BGWOARM. It aims to generate a minimal number of useful and reduced number of rules. It is noted from the several carried out experimentations on well-known benchmarks in the field of ARM, that results are promising, and the proposed approach outperforms other nature-inspired algorithms in terms of quality, number of rules, and runtime consumption.","PeriodicalId":42293,"journal":{"name":"Computer Science Journal of Moldova","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140786147","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
Optimizing Cervical Cancer Classification with SVM and Improved Genetic Algorithm on Pap Smear Images 利用 SVM 和改进遗传算法优化子宫颈抹片图像上的宫颈癌分类
IF 0.3
Computer Science Journal of Moldova Pub Date : 2024-04-01 DOI: 10.56415/csjm.v32.05
S. Umamaheswari, Y. Birnica, J. Boobalan, V. S. Akshaya
{"title":"Optimizing Cervical Cancer Classification with SVM and Improved Genetic Algorithm on Pap Smear Images","authors":"S. Umamaheswari, Y. Birnica, J. Boobalan, V. S. Akshaya","doi":"10.56415/csjm.v32.05","DOIUrl":"https://doi.org/10.56415/csjm.v32.05","url":null,"abstract":"This study presents an approach to optimize cervical cancer classification using Support Vector Machines (SVM) and an improved Genetic Algorithm (GA) on Pap smear images. The proposed methodology involves preprocessing the images, extracting relevant features, and employing a genetic algorithm for feature selection. An SVM classifier is trained using the selected features and optimized using the genetic algorithm. The performance of the optimized model is evaluated, demonstrating improved accuracy and efficiency in cervical cancer classification. The findings hold the potential for assisting healthcare professionals in early cervical cancer diagnosis based on Pap smear images.","PeriodicalId":42293,"journal":{"name":"Computer Science Journal of Moldova","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140780221","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
Formal Analysis of Medical Systems using Multi-Agent Systems with Information Sharing 利用信息共享多代理系统对医疗系统进行形式分析
IF 0.3
Computer Science Journal of Moldova Pub Date : 2024-04-01 DOI: 10.56415/csjm.v32.01
Bogdan Aman, Gabriel Ciobanu
{"title":"Formal Analysis of Medical Systems using Multi-Agent Systems with Information Sharing","authors":"Bogdan Aman, Gabriel Ciobanu","doi":"10.56415/csjm.v32.01","DOIUrl":"https://doi.org/10.56415/csjm.v32.01","url":null,"abstract":"Improving safety is a main objective for medical systems. To assist the modelling and formal analysis of medical systems, we define a language for multi-agent systems handling information, timed communication, and timed migration. We use a simplified airway laser surgery scenario to demonstrate our approach. An implementation in Maude is presented; we use the strategies allowed by Maude to guide the rules application in order to decrease substantially the number of possible executions and results in the highly nondeterministic and concurrent multi-agent systems. Finally, we present how the executable specifications can be verified with the model-checking tools in Maude to detect the behavioural problems or desired properties of the~agents.","PeriodicalId":42293,"journal":{"name":"Computer Science Journal of Moldova","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140769621","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
Efficient GPU Power Management through Advanced Framework Utilizing Optimization Algorithms 利用优化算法的先进框架实现高效的 GPU 电源管理
IF 0.3
Computer Science Journal of Moldova Pub Date : 2024-04-01 DOI: 10.56415/csjm.v32.08
Ramesha Rehman, Mashood Ul Haq Chishti, Hamza Yamin
{"title":"Efficient GPU Power Management through Advanced Framework Utilizing Optimization Algorithms","authors":"Ramesha Rehman, Mashood Ul Haq Chishti, Hamza Yamin","doi":"10.56415/csjm.v32.08","DOIUrl":"https://doi.org/10.56415/csjm.v32.08","url":null,"abstract":"The rapid rise in power usage by GPUs due to advances in machine and deep learning has led to an increase in power consumption of GPUs in Deep Learning workloads. To address this issue, a novel research project focuses on integrating Particle Swarm Optimization into a model training optimization framework to effectively reduce GPU power consumption during machine learning and deep learning training workloads. By utilizing the Particle Swarm Optimization (PSO)protecthyperlink{b1}{{[}1{]}} algorithm within the proposed framework, we show the effectiveness of PSO in creating a more efficient power management strategy while also maintaining the performance. Upon evaluation of the proposed framework, it shows a reduction of 15.8% to 75.8% in power consumption across multiple workloads, with little to no performance loss.","PeriodicalId":42293,"journal":{"name":"Computer Science Journal of Moldova","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140767020","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
Vector finite fields of characteristic two as algebraic support of multivariate cryptography 作为多元密码学代数支持的特征二向量有限域
IF 0.3
Computer Science Journal of Moldova Pub Date : 2024-04-01 DOI: 10.56415/csjm.v32.04
A. Moldovyan, N. Moldovyan
{"title":"Vector finite fields of characteristic two as algebraic support of multivariate cryptography","authors":"A. Moldovyan, N. Moldovyan","doi":"10.56415/csjm.v32.04","DOIUrl":"https://doi.org/10.56415/csjm.v32.04","url":null,"abstract":"The central issue of the development of the multivariate public key algorithms is the design of reversible non-linear mappings of $n$-dimensional vectors over a finite field, which can be represented in a form of a set of power polynomials. For the first time, finite fields $GFleft((2^d)^mright)$ of characteristic two, represented in the form of $m$-dimensional finite algebras over the fields $GF(2^d)$ are introduced for implementing the said mappings as exponentiation operation. This technique allows one to eliminate the use of masking linear mappings, usually used in the known approaches to the design of multivariate cryptography algorithms and causing the sufficiently large size of the public key. The issues of using the fields $GFleft((2^d)^mright)$ as algebraic support of non-linear mappings are considered, including selection of appropriate values of $m$ and $d$. In the proposed approach to development of the multivariate cryptography algorithms, a superposition of two non-linear mappings is used to define resultant hard-to-reverse mapping with a secret trap door. The used two non-linear mappings provide mutual masking of the corresponding reverse maps, due to which the size of the public key significantly reduces as compared with the known algorithms-analogues at a given security level.","PeriodicalId":42293,"journal":{"name":"Computer Science Journal of Moldova","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140797261","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
On the trees with maximum Cardinality-Redundance number 关于具有最大卡片冗余数的树
IF 0.3
Computer Science Journal of Moldova Pub Date : 2024-04-01 DOI: 10.56415/csjm.v32.03
Elham Mohammadi, N. J. Rad
{"title":"On the trees with maximum Cardinality-Redundance number","authors":"Elham Mohammadi, N. J. Rad","doi":"10.56415/csjm.v32.03","DOIUrl":"https://doi.org/10.56415/csjm.v32.03","url":null,"abstract":"A vertex $v$ is said to be over-dominated by a set $S$ if $|N[u]cap S|geq 2$. The cardinality--redundance of $S$, $CR(S)$, is the number of vertices of $G$ that are over-dominated by $S$. The cardinality--redundance of $G$, $CR(G)$, is the minimum of $CR(S)$ taken over all dominating sets $S$. A dominating set $S$ with $CR(S) = CR(G)$ is called a $CR(G)$-set. In this paper, we prove an upper bound for the cardinality--redundance in trees in terms of the order and the number of leaves, and characterize all trees achieving equality for the proposed bound.","PeriodicalId":42293,"journal":{"name":"Computer Science Journal of Moldova","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140761127","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 Coloured Petri Net-based approach and Genetic Algorithms for improving services in the Emergency Department 基于彩色 Petri 网的方法和遗传算法改善急诊科的服务
IF 0.3
Computer Science Journal of Moldova Pub Date : 2024-04-01 DOI: 10.56415/csjm.v32.07
Zouaoui Louhab, Fatma Boufera
{"title":"A Coloured Petri Net-based approach and Genetic Algorithms for improving services in the Emergency Department","authors":"Zouaoui Louhab, Fatma Boufera","doi":"10.56415/csjm.v32.07","DOIUrl":"https://doi.org/10.56415/csjm.v32.07","url":null,"abstract":"The Emergency Department (ED) plays an important role in the healthcare field, due to the nature of the services it provides, especially for patients with urgent cases. Therefore, good management of ED is very important in improving the quality of services. Good management depends on the effective use of material and human resources. One of the most common problems that the ED suffers from is the long waiting period and the length of the patient’s stay. Many researchers have proposed many solutions to reduce waiting time and length of stay (LOS). One of the best solutions for resource optimization is modeling and simulation based on inputs such as patient length of stay and door-to-doctor time (DTDT). In this study, the ED was modeled using a Coloured Petri Net, and to determine the number of resources needed, genetic algorithms were used. This study was conducted in the ED of Hassani Abdelkader Hospital in Sidi Bel Abbes, and several simulation models were evaluated, which reduced the waiting time and the length of stay for the patient.","PeriodicalId":42293,"journal":{"name":"Computer Science Journal of Moldova","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140772005","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学术官方微信