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

Comput. Sci. J. Moldova最新文献

筛选
英文 中文
Interactive System for Algorithm and Data Structure Visualization 算法与数据结构可视化交互系统
Comput. Sci. J. Moldova Pub Date : 2022-02-01 DOI: 10.56415/csjm.v30.02
Patrik Perhác, Slavomír Simonák
{"title":"Interactive System for Algorithm and Data Structure Visualization","authors":"Patrik Perhác, Slavomír Simonák","doi":"10.56415/csjm.v30.02","DOIUrl":"https://doi.org/10.56415/csjm.v30.02","url":null,"abstract":"This work is dedicated to the design, implementation and evaluation of a new algorithm visualization system. The currently available systems and libraries are briefly compared with each other based on the visualizations and functionalities they provide. Since the analyzed tools didn't meet all of the given requirements, we decided that the development of a new system for algorithm and data structure visualizations would be beneficial for use in teaching the subject Data Structures and Algorithms. The new system was designed to be easily usable, extensible, available and to cover the basic functionalities available in similar systems and other useful features. The proposed system provides three types of visualizations: predefined visualizations, to explain how each data structure and algorithm works; interactive visualizations, to let the user interact with the visualization directly; and interactive exercises, to let the users test their knowledge. These three types of visualizations cover the whole learning process, provide theoretical and practical knowledge, and also a way to test their knowledge. The system is implemented in the form of a web application and, for the visualizations, the JSAV library is used. The system was also evaluated by the users via a survey and several improvements were implemented in the system based on the feedback provided by the users.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"357 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123339256","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
Approach for the development of mobile applications based on migrant objects 基于迁移对象的移动应用程序开发方法
Comput. Sci. J. Moldova Pub Date : 2022-02-01 DOI: 10.56415/csjm.v30.01
Aissa ElMahdi Bourahla, M. Bourahla
{"title":"Approach for the development of mobile applications based on migrant objects","authors":"Aissa ElMahdi Bourahla, M. Bourahla","doi":"10.56415/csjm.v30.01","DOIUrl":"https://doi.org/10.56415/csjm.v30.01","url":null,"abstract":"Software engineering principles are very required for the development of mobile applications, which are necessary for many life applications. In this paper, we present a development process based on transformation of UML models, which describe mobile applications based on migrant objects to Mobile Maude language that extends the Maude language and implements the Rewriting Logic (RL). The generated rewriting theories will be executed for simulation using located configurations, which are produced from UML object diagrams. State transition models may be built during simulation to describe behaviours of mobile applications based on migrant objects, which will be verified against LTL properties with the technique of model-checking. The verified model of mobile application based on migrant objects can be used to generate Android application to be deployed on mobile devices.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125324644","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
The response time analysis of queuing model in cloud computing environment 云计算环境下排队模型的响应时间分析
Comput. Sci. J. Moldova Pub Date : 2022-02-01 DOI: 10.56415/csjm.v30.04
A. Madankan
{"title":"The response time analysis of queuing model in cloud computing environment","authors":"A. Madankan","doi":"10.56415/csjm.v30.04","DOIUrl":"https://doi.org/10.56415/csjm.v30.04","url":null,"abstract":"In this paper, the queuing theory is used to model cloud computing environment. The aim of this job is to analyze the response time as a measure of the Quality of Service (QoS) of computer services. In the cloud computing, multi resources need to be allocated simultaneously to multiple customers. When a customer requests for a service, if servers are busy, the requested job enters into the waiting line until a server completes its service. So, this may lead to a bottleneck in the network. By modeling cloud platforms by a queuing network, it can be easy to determine and to measure the QoS. The arrival rate and the service rate of processing servers are two main parameters that can affect the performance of the model; so, they are used to analyze the performance of the model. This paper proposes a queuing model which is applied at multiple servers in order to analyze the response time and also to improve the network performance and QoS effectively in a cloud computing environment.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134499427","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
Solving the non-linear multi-index transportation problems with genetic algorithms 用遗传算法求解非线性多指标运输问题
Comput. Sci. J. Moldova Pub Date : 2022-02-01 DOI: 10.56415/csjm.v30.05
Tatiana Pasa
{"title":"Solving the non-linear multi-index transportation problems with genetic algorithms","authors":"Tatiana Pasa","doi":"10.56415/csjm.v30.05","DOIUrl":"https://doi.org/10.56415/csjm.v30.05","url":null,"abstract":"In this paper we study the non-linear multi-index transporta-tion problem with concave cost functions. We solved the non-linear transportation problem on a network with 5 indices (NTPN5I) described by sources, destinations, intermediate nodes, types of products, and types of transport, that is formulated as a non-linear transportation problem on a network with 3 indices (NTPN3I) described by arcs, types of products, and types of transport. We propose a genetic algorithm for solving the large-scale problems in reasonable amount of time, which was proven by the various tests shown in this paper. The convergence theorem of the algorithm is formulated and proved. The algorithm was implemented in Wolfram Language and tested in Wolfram Mathematica.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116923824","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
Triple Roman domination subdivision number in graphs 三罗马统治在图中的细分数
Comput. Sci. J. Moldova Pub Date : 2022-02-01 DOI: 10.56415/csjm.v30.07
J. Amjadi, H. Sadeghi
{"title":"Triple Roman domination subdivision number in graphs","authors":"J. Amjadi, H. Sadeghi","doi":"10.56415/csjm.v30.07","DOIUrl":"https://doi.org/10.56415/csjm.v30.07","url":null,"abstract":"For a graph $G=(V, E)$, a triple Roman domination function is a function $f: V(G)longrightarrow{0, 1, 2, 3, 4}$ having the property that for any vertex $vin V(G)$, if $f(v)<3$, then $f(mbox{AN}[v])geq|mbox{AN}(v)|+3$, where $mbox{AN}(v)={win N(v)mid f(w)geq1}$ and $mbox{AN}[v]=mbox{AN}(v)cup{v}$. The weight of a triple Roman dominating function $f$ is the value $omega(f)=sum_{vin V(G)}f(v)$. The triple Roman domination number of $G$, denoted by $gamma_{[3R]}(G)$, equals the minimum weight of a triple Roman dominating function on $G$. {em The triple Roman domination subdivision number} $mbox{sd}_{gamma_{[3R]}}(G)$ of a graph $G$ is the minimum number of edges that must be subdivided (each edge in $G$ can be subdivided at most once) in order to increase the triple Roman domination number. In this paper, we first show that the decision problem associated with $mbox{sd}_{gamma_{[3R]}}(G)$ is NP-hard and then establish upper bounds on the triple Roman domination subdivision number for arbitrary graphs.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121682671","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
Post-quantum commutative encryption algorithm 后量子交换加密算法
Comput. Sci. J. Moldova Pub Date : 2019-11-28 DOI: 10.1007/978-3-030-34365-1_16
A. Moldovyan, D. Moldovyan, N. Moldovyan
{"title":"Post-quantum commutative encryption algorithm","authors":"A. Moldovyan, D. Moldovyan, N. Moldovyan","doi":"10.1007/978-3-030-34365-1_16","DOIUrl":"https://doi.org/10.1007/978-3-030-34365-1_16","url":null,"abstract":"","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"26 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132760894","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}
引用次数: 3
Minimal Parallelism and Number of Membrane Polarizations 最小平行度和膜极化数
Comput. Sci. J. Moldova Pub Date : 2018-06-28 DOI: 10.17345/triangle6.1-17
A. Alhazov
{"title":"Minimal Parallelism and Number of Membrane Polarizations","authors":"A. Alhazov","doi":"10.17345/triangle6.1-17","DOIUrl":"https://doi.org/10.17345/triangle6.1-17","url":null,"abstract":"It is known that the satisfiability problem (SAT) can be efficiently solved by a uniform family of P systems with active membranes that have two polarizations working in a maximally parallel way. We study P systems with active membranes without non-elementary membrane division, working in minimally parallel way. The main question we address is what number of polarizations is sufficient for an efficient computation depending on the types of rules used.In particular, we show that it is enough to have four polarizations, sequential evolution rules changing polarizations, polarizationless non-elementary membrane division rules and polarizationless rules of sending an object out. The same problem is solved with the standard evolution rules, rules of sending an object out and polarizationless non-elementary membrane division rules, with six polarizations. It is an open question whether these numbers are optimal.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116579626","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}
引用次数: 8
Three models for gene assembly in ciliates: a comparison 纤毛虫基因组装的三种模式:比较
Comput. Sci. J. Moldova Pub Date : 2008-11-25 DOI: 10.4108/ICST.BIONETICS2008.4689
M. Langille, I. Petre, V. Rogojin
{"title":"Three models for gene assembly in ciliates: a comparison","authors":"M. Langille, I. Petre, V. Rogojin","doi":"10.4108/ICST.BIONETICS2008.4689","DOIUrl":"https://doi.org/10.4108/ICST.BIONETICS2008.4689","url":null,"abstract":"We survey in this paper the main differences among three variants of an intramolecular model for gene assembly: the general, the simple, and the elementary models. We present all of them in terms of sorting signed permutations and compare their behavior with respect to: (i) completeness, (ii) confluence (with the notion defined in three different setups), (iii) decidability, (iv) characterization of the sortable permutations in each model, (v) sequential complexity, and (vi) experimental validation.","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117318658","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}
引用次数: 8
Structural synthesis of parallel programs (Methodology and Tools) 并行程序的结构综合(方法和工具)
Comput. Sci. J. Moldova Pub Date : 1987-06-22 DOI: 10.1007/3-540-18740-5_21
G. E. Cejtlin, E. L. Jushchenko
{"title":"Structural synthesis of parallel programs (Methodology and Tools)","authors":"G. E. Cejtlin, E. L. Jushchenko","doi":"10.1007/3-540-18740-5_21","DOIUrl":"https://doi.org/10.1007/3-540-18740-5_21","url":null,"abstract":"","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115702771","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
Digital signature scheme with doubled verification equation 具有双重验证方程的数字签名方案
Comput. Sci. J. Moldova Pub Date : 1900-01-01 DOI: 10.52190/2073-2600_2021_2_30
D. Moldovyan, A. Moldovyan, N. Moldovyan
{"title":"Digital signature scheme with doubled verification equation","authors":"D. Moldovyan, A. Moldovyan, N. Moldovyan","doi":"10.52190/2073-2600_2021_2_30","DOIUrl":"https://doi.org/10.52190/2073-2600_2021_2_30","url":null,"abstract":"","PeriodicalId":262087,"journal":{"name":"Comput. Sci. J. Moldova","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131531949","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术官方微信