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

Acta Universitatis Sapientiae Informatica最新文献

筛选
英文 中文
Reproducibility in the technical debt domain 技术债务领域的再现性
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2021-12-01 DOI: 10.2478/ausi-2021-0016
Kristóf Szabados, Izabella Ingrid Farkas, Attila Kovács
{"title":"Reproducibility in the technical debt domain","authors":"Kristóf Szabados, Izabella Ingrid Farkas, Attila Kovács","doi":"10.2478/ausi-2021-0016","DOIUrl":"https://doi.org/10.2478/ausi-2021-0016","url":null,"abstract":"Abstract Context It is crucial to understand how reproducible the measurement results in the scientific publications are, as reproducibility is one of the cornerstones of engineering. Objective The goal of this study is to investigate the scientific publications presented at the premier technical debt conferences by understanding how reproducible the reported findings are. Method We conducted a systematic literature review of 135 unique papers published at the “International Workshop on Managing Technical Debt” and the “International Conference on Managing Technical Debt”, the premier scientific conference series on technical debt. Results Only 44 of the investigated 135 papers presented numerical evidence and only 5 papers listed the tools, the availability of the tools, and the version of the tools used. For the rest of the papers additional information would have been needed for the potential reproducibility. One of the published papers even referred to a pornographic site as a source of a toolset for empirical research.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"30 1","pages":"335 - 360"},"PeriodicalIF":0.3,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90557153","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
Trading sparse, mean reverting portfolios using VAR(1) and LSTM prediction 使用VAR(1)和LSTM预测交易稀疏均值回归投资组合
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2021-12-01 DOI: 10.2478/ausi-2021-0013
Attila Rácz, N. Fogarasi
{"title":"Trading sparse, mean reverting portfolios using VAR(1) and LSTM prediction","authors":"Attila Rácz, N. Fogarasi","doi":"10.2478/ausi-2021-0013","DOIUrl":"https://doi.org/10.2478/ausi-2021-0013","url":null,"abstract":"Abstract We investigated the predictability of mean reverting portfolios and the VAR(1) model in several aspects. First, we checked the dependency of the accuracy of VAR(1) model on different data types including the original data itself, the return of prices, the natural logarithm of stock and on the log return. Then we compared the accuracy of predictions of mean reverting portfolios coming from VAR(1) with different generative models such as VAR(1) and LSTM for both online and o ine data. It was eventually shown that the LSTM predicts much better than the VAR(1) model. The conclusion is that the VAR(1) assumption works well in selecting the mean reverting portfolio, however, LSTM is a better choice for prediction. With the combined model a strategy with positive trading mean profit was successfully developed. We found that online LSTM outperforms all VAR(1) predictions and results in a positive expected profit when used in a simple trading algorithm.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"31 1","pages":"288 - 302"},"PeriodicalIF":0.3,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80624047","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
On A-energy and S-energy of certain class of graphs 论某类图的a能和s能
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2021-12-01 DOI: 10.2478/ausi-2021-0009
H. Ramane, B. Parvathalu, K. Ashoka, Daneshwari Patil
{"title":"On A-energy and S-energy of certain class of graphs","authors":"H. Ramane, B. Parvathalu, K. Ashoka, Daneshwari Patil","doi":"10.2478/ausi-2021-0009","DOIUrl":"https://doi.org/10.2478/ausi-2021-0009","url":null,"abstract":"Abstract Let A and S be the adjacency and the Seidel matrix of a graph G respectively. A-energy is the ordinary energy E(G) of a graph G defined as the sum of the absolute values of eigenvalues of A. Analogously, S-energy is the Seidel energy ES(G) of a graph G defined to be the sum of the absolute values of eigenvalues of the Seidel matrix S. In this article, certain class of A-equienergetic and S-equienergetic graphs are presented. Also some linear relations on A-energies and S-energies are given.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"46 1","pages":"195 - 219"},"PeriodicalIF":0.3,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87352908","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
Vertex stress related parameters for certain Kneser graphs 某些Kneser图的顶点应力相关参数
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2021-12-01 DOI: 10.2478/ausi-2021-0015
J. Kok
{"title":"Vertex stress related parameters for certain Kneser graphs","authors":"J. Kok","doi":"10.2478/ausi-2021-0015","DOIUrl":"https://doi.org/10.2478/ausi-2021-0015","url":null,"abstract":"Abstract This paper presents results for some vertex stress related parameters in respect of specific subfamilies of Kneser graphs. Kneser graphs for which diam(KG(n, k)) = 2 and k ≥ 2 are considered. The note establishes the foundation for researching similar results for Kneser graphs for which diam(KG(n, k)) ≥ 3. In addition some important vertex stress related properties are stated. Finally some results for specific bipartite Kneser graphs i.e. BK(n, 1), n ≥ 3 will be presented. In the conclusion some worthy research avenues are proposed.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"56 2","pages":"324 - 334"},"PeriodicalIF":0.3,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72396000","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
Incremental methods for community detection in both fully and growing dynamic networks 完全动态网络和增长动态网络中社区检测的增量方法
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2021-12-01 DOI: 10.2478/ausi-2021-0010
Fariza Bouhatem, Ali Aït El Hadj, F. Souam, A. Dafeur
{"title":"Incremental methods for community detection in both fully and growing dynamic networks","authors":"Fariza Bouhatem, Ali Aït El Hadj, F. Souam, A. Dafeur","doi":"10.2478/ausi-2021-0010","DOIUrl":"https://doi.org/10.2478/ausi-2021-0010","url":null,"abstract":"Abstract In recent years, community detection in dynamic networks has received great interest. Due to its importance, many surveys have been suggested. In these surveys, the authors present and detail a number of methods that identify a community without taking into account the incremental methods which, in turn, also take an important place in dynamic community detection methods. In this survey, we provide a review of incremental approaches to community detection in both fully and growing dynamic networks. To do this, we have classified the methods according to the type of network. For each type of network, we describe three main approaches: the first one is based on modularity optimization; the second is based on density; finally, the third is based on label propagation. For each method, we list the studies available in the literature and state their drawbacks and advantages.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"20 1","pages":"220 - 250"},"PeriodicalIF":0.3,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89422152","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
Nonlinearity of the non-Abelian lattice gauge field theory according to the spectrum of Kolmogorov-Sinai entropy and complexity 基于Kolmogorov-Sinai熵谱和复杂度的非阿贝尔格规范场理论的非线性
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2021-12-01 DOI: 10.2478/ausi-2021-0018
Á. Fülöp
{"title":"Nonlinearity of the non-Abelian lattice gauge field theory according to the spectrum of Kolmogorov-Sinai entropy and complexity","authors":"Á. Fülöp","doi":"10.2478/ausi-2021-0018","DOIUrl":"https://doi.org/10.2478/ausi-2021-0018","url":null,"abstract":"Abstract The quark-gluon plasma is written by the non-Abelian gauge theory. The dynamics of the gauge SU(2) are given by the Hamiltonian function, which contains the quadratic part of the field strength tensor Fμva {rm{F}}_{mu v}^{rm{a}} expressed in Minkowski space. The homogeneous Yang-Mills equations are solved on lattice Nd considering classical approximation, which exhibits chaotic dynamics. We research the time-dependent entropy-energy relation, which can be shown by the energy spectrum of Kolmogorov-Sinai entropy and the spectra of the statistical complexity.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"21 1","pages":"373 - 400"},"PeriodicalIF":0.3,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82590550","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
Dual quaternion-based osculating circle algorithm for finding intersection curves 基于对偶四元数的密切圆算法求交曲线
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2021-12-01 DOI: 10.2478/ausi-2021-0014
Vahide Bulut
{"title":"Dual quaternion-based osculating circle algorithm for finding intersection curves","authors":"Vahide Bulut","doi":"10.2478/ausi-2021-0014","DOIUrl":"https://doi.org/10.2478/ausi-2021-0014","url":null,"abstract":"Abstract The intersection of surfaces is a fundamental process in computational geometry and computer-aided design applications to build and interrogate complex shapes in the computer. This paper presents a novel and simple dual quaternion-based osculating circle DQOC algorithm to find the intersection curve of two regular surfaces based on the osculating circle concept and dual quaternions. Additionally, we expressed the natural equations of the intersection curve. We have also demonstrated the superiority of our method through numerical examples.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"96 1","pages":"303 - 323"},"PeriodicalIF":0.3,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76025937","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
DP-solver: automating dynamic programming dp求解器:自动动态规划
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2021-12-01 DOI: 10.2478/ausi-2021-0017
Z. Kátai, Attila Elekes
{"title":"DP-solver: automating dynamic programming","authors":"Z. Kátai, Attila Elekes","doi":"10.2478/ausi-2021-0017","DOIUrl":"https://doi.org/10.2478/ausi-2021-0017","url":null,"abstract":"Abstract Dynamic programming (DP) is a widely used optimization method with several applications in various fields of science. The DP problem solving process can be divided in two phases: mathematical part and programming part. There are a number of researchers for whom the mathematical part is available, but they are not familiar with computer programming. In this paper we present a software tool that automates the programming part of DP and allows users to solve problems based only on their mathematical approach. The application builds up the “d-graph model” of the problem to be solved and applies the “d-variant” of the corresponding single source shortest path algorithm. In addition, we report experimental results regarding the e ciency of the tool relative to the Matlab implementation.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"10 1","pages":"361 - 372"},"PeriodicalIF":0.3,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88789903","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 Laplacian spectrum of unitary Cayley graphs 关于酉Cayley图的拉普拉斯谱
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2021-12-01 DOI: 10.2478/ausi-2021-0011
S. Pirzada, Z. Barati, M. Afkhami
{"title":"On Laplacian spectrum of unitary Cayley graphs","authors":"S. Pirzada, Z. Barati, M. Afkhami","doi":"10.2478/ausi-2021-0011","DOIUrl":"https://doi.org/10.2478/ausi-2021-0011","url":null,"abstract":"Abstract Let R be a commutative ring with unity 1 ≠ 0 and let R× be the set of all unit elements of R. The unitary Cayley graph of R, denoted by GR = Cay(R, R×), is a simple graph whose vertex set is R and there is an edge between two distinct vertices x and y of R if and only if x − y ∈ R×. In this paper, we determine the Laplacian and signless Laplacian eigenvalues for the unitary Cayley graph of a commutative ring. Also, we compute the Laplacian and signless Laplacian energy of the graph GR and its line graph.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"97 1","pages":"251 - 264"},"PeriodicalIF":0.3,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87161671","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
Bitcoin daily close price prediction using optimized grid search method 比特币日收盘价预测采用优化的网格搜索方法
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2021-12-01 DOI: 10.2478/ausi-2021-0012
M. Rostami, Mahdi Bahaghighat, M. M. Zanjireh
{"title":"Bitcoin daily close price prediction using optimized grid search method","authors":"M. Rostami, Mahdi Bahaghighat, M. M. Zanjireh","doi":"10.2478/ausi-2021-0012","DOIUrl":"https://doi.org/10.2478/ausi-2021-0012","url":null,"abstract":"Abstract Cryptocurrencies are digital assets that can be stored and transferred electronically. Bitcoin (BTC) is one of the most popular cryptocurrencies that has attracted many attentions. The BTC price is considered as a high volatility time series with non-stationary and non-linear behavior. Therefore, the BTC price forecasting is a new, challenging, and open problem. In this research, we aim the predicting price using machine learning and statistical techniques. We deploy several robust approaches such as the Box-Jenkins, Autoregression (AR), Moving Average (MA), ARIMA, Autocorrelation Function (ACF), Partial Autocorrelation Function (PACF), and Grid Search algorithms to predict BTC price. To evaluate the performance of the proposed model, Forecast Error (FE), Mean Forecast Error (MFE), Mean Absolute Error (MAE), Mean Squared Error (MSE), as well as Root Mean Squared Error (RMSE), are considered in our study.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"11 1","pages":"265 - 287"},"PeriodicalIF":0.3,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90408588","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
首页 上一页 下一页 尾页
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学术官方微信