Foundations of Computing and Decision Sciences最新文献

筛选
英文 中文
Acceptable-and-attractive Approximate Solution of a Continuous Non-Cooperative Game on a Product of Sinusoidal Strategy Functional Spaces 正弦策略函数空间乘积上连续非合作对策的可接受且有吸引力的近似解
IF 1.1
Foundations of Computing and Decision Sciences Pub Date : 2021-06-01 DOI: 10.2478/fcds-2021-0012
V. Romanuke
{"title":"Acceptable-and-attractive Approximate Solution of a Continuous Non-Cooperative Game on a Product of Sinusoidal Strategy Functional Spaces","authors":"V. Romanuke","doi":"10.2478/fcds-2021-0012","DOIUrl":"https://doi.org/10.2478/fcds-2021-0012","url":null,"abstract":"Abstract A problem of solving a continuous noncooperative game is considered, where the player’s pure strategies are sinusoidal functions of time. In order to reduce issues of practical computability, certainty, and realizability, a method of solving the game approximately is presented. The method is based on mapping the product of the functional spaces into a hyperparallelepiped of the players’ phase lags. The hyperparallelepiped is then substituted with a hypercubic grid due to a uniform sampling. Thus, the initial game is mapped into a finite one, in which the players’ payoff matrices are hypercubic. The approximation is an iterative procedure. The number of intervals along the player’s phase lag is gradually increased, and the respective finite games are solved until an acceptable solution of the finite game becomes sufficiently close to the same-type solutions at the preceding iterations. The sufficient closeness implies that the player’s strategies at the succeeding iterations should be not farther from each other than at the preceding iterations. In a more feasible form, it implies that the respective distance polylines are required to be decreasing on average once they are smoothed with respective polynomials of degree 2, where the parabolas must be having positive coefficients at the squared variable.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"173 - 197"},"PeriodicalIF":1.1,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42895319","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
A Statistical Evaluation of The Depth of Inheritance Tree Metric for Open-Source Applications Developed in Java 用Java开发的开源应用程序的继承树深度度量的统计评价
IF 1.1
Foundations of Computing and Decision Sciences Pub Date : 2021-06-01 DOI: 10.2478/fcds-2021-0011
S. Prykhodko, N. Prykhodko, T. Smykodub
{"title":"A Statistical Evaluation of The Depth of Inheritance Tree Metric for Open-Source Applications Developed in Java","authors":"S. Prykhodko, N. Prykhodko, T. Smykodub","doi":"10.2478/fcds-2021-0011","DOIUrl":"https://doi.org/10.2478/fcds-2021-0011","url":null,"abstract":"Abstract The Depth of Inheritance Tree (DIT) metric, along with other ones, is used for estimating some quality indicators of software systems, including open-source applications (apps). In cases involving multiple inheritances, at a class level, the DIT metric is the maximum length from the node to the root of the tree. At an application (app) level, this metric defines the corresponding average length per class. It is known, at a class level, a DIT value between 2 and 5 is good. At an app level, similar recommended values for the DIT metric are not known. To find the recommended values for the DIT mean of an app we have proposed to use the confidence and prediction intervals. A DIT mean value of an app from the confidence interval is good since this interval indicates how reliable the estimate is for the DIT mean values of all apps used for estimating the interval. A DIT mean value higher than an upper bound of prediction interval may indicate that some classes have a large number of the inheritance levels from the object hierarchy top. What constitutes greater app design complexity as more classes are involved. We have estimated the confidence and prediction intervals of the DIT mean using normalizing transformations for the data sample from 101 open-source apps developed in Java hosted on GitHub for the 0.05 significance level.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"159 - 172"},"PeriodicalIF":1.1,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45628978","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
Applying Data Envelopment Analysis Principle in Ordinal Multi Criteria Decision Analysis 数据包络分析原理在有序多准则决策分析中的应用
IF 1.1
Foundations of Computing and Decision Sciences Pub Date : 2021-06-01 DOI: 10.2478/fcds-2021-0010
M. Kress
{"title":"Applying Data Envelopment Analysis Principle in Ordinal Multi Criteria Decision Analysis","authors":"M. Kress","doi":"10.2478/fcds-2021-0010","DOIUrl":"https://doi.org/10.2478/fcds-2021-0010","url":null,"abstract":"Abstract We consider a multicriteria decision analysis (MCDA) problem where importance of criteria, and evaluations of alternatives with respect to the criteria, are expressed on a qualitative ordinal scale. Using the extreme-point principle of Data Envelopment Analysis (DEA), we develop a two-parameter method for obtaining overall ratings of the alternatives when preferences and evaluations are made on an ordinal scale. We assume no parametric setup other than the two parameters that reflect minimum intensities of discriminating among rank positions: one parameter for the alternatives’ ranking and one for the criteria ranking. These parameters are bounded by the ordinal input data, and they imply a universal tie among the alternatives when both parameters are selected to be zero. We describe the model, discuss its theoretical underpinning, and demonstrate its application.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"147 - 157"},"PeriodicalIF":1.1,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45519781","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
Using TeX Markup Language for 3D and 2D Geological Plotting TeX标记语言在三维和二维地质制图中的应用
IF 1.1
Foundations of Computing and Decision Sciences Pub Date : 2021-03-01 DOI: 10.2478/fcds-2021-0004
V. Lemenkov, Polina Lemenkova
{"title":"Using TeX Markup Language for 3D and 2D Geological Plotting","authors":"V. Lemenkov, Polina Lemenkova","doi":"10.2478/fcds-2021-0004","DOIUrl":"https://doi.org/10.2478/fcds-2021-0004","url":null,"abstract":"Abstract The paper presents technical application of TeX high-level, descriptive markup language for processing geological dataset from soil laboratory. Geotechnical measurements included equivalent soil cohesion, absolute and absolute deformation index, soil compressibility coefficient by time of immersion depth, exposure time to compressive strength to samples and physical and mechanical properties (humidity, density). Dataset was received from laboratory based experimental tests of the physical and mechanical properties of soils. Data were converted to csv table and processed by LaTeX. Methodology is based on LaTeX packages: {tikz}, {tikz-3dplot}, {tikzpicture}, {pgfplot}, {filecontetns}, {spy} for 3D plotting showing correlation in variables and descriptive statistical analysis based on the data array processing. Results demonstrated LaTeX scripts and graphics: 2D and 3D scatterplots, ternaries, bar charts, boxplots, zooming techniques detailing fragment of the plot, flowchart. Research novelty consists in technical approach of TeX language application for geo- logical data processing and graphical visualization. Engineering graphics by TeX was demonstrated with screenshots of the codes used for plotting.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"43 - 69"},"PeriodicalIF":1.1,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41936449","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}
引用次数: 32
An Integration of Neural Network and Shuffled Frog-Leaping Algorithm for CNC Machining Monitoring 神经网络与Shuffled Frog跳跃算法在数控加工监控中的集成
IF 1.1
Foundations of Computing and Decision Sciences Pub Date : 2021-03-01 DOI: 10.2478/fcds-2021-0003
A. Goli, E. B. Tirkolaee, G. Weber
{"title":"An Integration of Neural Network and Shuffled Frog-Leaping Algorithm for CNC Machining Monitoring","authors":"A. Goli, E. B. Tirkolaee, G. Weber","doi":"10.2478/fcds-2021-0003","DOIUrl":"https://doi.org/10.2478/fcds-2021-0003","url":null,"abstract":"Abstract This paper addresses Acoustic Emission (AE) from Computer Numerical Control (CNC) machining operations. Experimental measurements are performed on the CNC lathe sensors to provide the power consumption data. To this end, a hybrid methodology based on the integration of an Artificial Neural Network (ANN) and a Shuffled Frog-Leaping Algorithm (SFLA) is applied to the data resulting from these measurements for data fusion from the sensors which is called SFLA-ANN. The initial weights of ANN are selected using SFLA. The goal is to assess the potency of the signal periodic component among these sensors. The efficiency of the proposed SFLA-ANN method is analyzed compared to hybrid methodologies of Simulated Annealing (SA) algorithm and ANN (SA-ANN) and Genetic Algorithm (GA) and ANN (GA-ANN).","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"27 - 42"},"PeriodicalIF":1.1,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42629362","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}
引用次数: 9
An Algorithm for Choosing, Ordering a New Criteria of a Bi-Objective Flow Problem 双目标流问题新准则的选择、排序算法
IF 1.1
Foundations of Computing and Decision Sciences Pub Date : 2021-03-01 DOI: 10.2478/fcds-2021-0002
Salima Nait Belkacem
{"title":"An Algorithm for Choosing, Ordering a New Criteria of a Bi-Objective Flow Problem","authors":"Salima Nait Belkacem","doi":"10.2478/fcds-2021-0002","DOIUrl":"https://doi.org/10.2478/fcds-2021-0002","url":null,"abstract":"Abstract In this paper, we propose an algorithm which is based on many things: the notions well-known of the simplex network method, Ford Fulkerson’s algorithm and our new idea, which is << the gain cycles >>, applied on a bi-objective minimum cost flow problem. This algorithm permits us to have a good order of many criteria in a rapid and an efficient way; because this classification permits us to structure the optimal area, in which we can choose the best action among the others which exist in the objective space. From this one, we distinguish, that the resolution of this problem comes to find an under set of good actions, among which the decider can select an action of best compromise, or make a decision, in the case where reference indications of the deciders may change. A didactic example is done to illustrate our algorithm.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"11 - 26"},"PeriodicalIF":1.1,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46478078","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
Morgan-Voyce Polynomial Approach for Quaternionic Space Curves of Constant Width 常宽四元数空间曲线的Morgan—Voyce多项式解法
IF 1.1
Foundations of Computing and Decision Sciences Pub Date : 2021-03-01 DOI: 10.2478/fcds-2021-0005
Tuba Ağirman Aydin, R. Ayazoğlu, H. Kocayiğit
{"title":"Morgan-Voyce Polynomial Approach for Quaternionic Space Curves of Constant Width","authors":"Tuba Ağirman Aydin, R. Ayazoğlu, H. Kocayiğit","doi":"10.2478/fcds-2021-0005","DOIUrl":"https://doi.org/10.2478/fcds-2021-0005","url":null,"abstract":"Abstract The curves of constant width are special curves used in engineering, architecture and technology. In the literature, these curves are considered according to different roofs in different spaces and some integral characterizations of these curves are obtained. However, in order to examine the geometric properties of curves of constant width, more than characterization is required. In this study, firstly differential equations characterizing quaternionic space curves of constant width are obtained. Then, the approximate solutions of the differential equations obtained are calculated by the Morgan-Voyce polynomial approach.The geometric properties of this curve type are examined with the help of these solutions.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"71 - 83"},"PeriodicalIF":1.1,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45537129","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
Editorial – Preface to the Special Issue on Numerical Techniques Meet with OR 社论-《与OR相遇的数值技术》特刊序言
IF 1.1
Foundations of Computing and Decision Sciences Pub Date : 2021-03-01 DOI: 10.2478/fcds-2021-0001
Burcu Gürbüz, G. Weber
{"title":"Editorial – Preface to the Special Issue on Numerical Techniques Meet with OR","authors":"Burcu Gürbüz, G. Weber","doi":"10.2478/fcds-2021-0001","DOIUrl":"https://doi.org/10.2478/fcds-2021-0001","url":null,"abstract":"Abstract This special issue of the Foundations of Computing and Decision Sciences, titled ”Numerical Techniques Meet with OR”, is devoted to the numerical techniques and their applications in real-world phenomena. The special issue and its editorial present numerical algorithms as they meet with different research topics such as, e.g., from operational research, supply chain management, geometrical structures and Covid-19 effects on financial applications. Besides, the special issue covers instructional information about numerical techniques which are useful for OR research problems and real-world applications on such issues.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"3 - 10"},"PeriodicalIF":1.1,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43927737","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
Investigation of E-Cigarette Smoking Model with Mittag-Leffler Kernel 带有Mittag-Leffler核的电子烟吸烟模型研究
IF 1.1
Foundations of Computing and Decision Sciences Pub Date : 2021-03-01 DOI: 10.2478/fcds-2021-0007
Esmehan Uçar, Sümeyra Uçar, F. Evirgen, N. Özdemir
{"title":"Investigation of E-Cigarette Smoking Model with Mittag-Leffler Kernel","authors":"Esmehan Uçar, Sümeyra Uçar, F. Evirgen, N. Özdemir","doi":"10.2478/fcds-2021-0007","DOIUrl":"https://doi.org/10.2478/fcds-2021-0007","url":null,"abstract":"Abstract Smoking is the most lethal social poisoning event. The World Health Organization defines smoking as the most important preventable cause of disease. Around 4.9 million people worldwide die from smoking every year. In order to analysis this matter, we aim to investigate an e-cigarette smoking model with Atangana-Baleanu fractional derivative. We obtain the existence conditions of the solution for this fractional model utilizing fixed-point theory. After giving existence conditions, the uniqueness of the solution is proved. Finally, to show the effect of the Atangana-Baleanu fractional derivative on the model, we give some numerical results supported by illustrative graphics.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"97 - 109"},"PeriodicalIF":1.1,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46710422","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}
引用次数: 9
Understanding the Impact of COVID–19 on Global Financial Network Using Graph Based Algorithm: Minimum Spanning Tree Approach 使用基于图的算法理解COVID-19对全球金融网络的影响:最小生成树方法
IF 1.1
Foundations of Computing and Decision Sciences Pub Date : 2021-03-01 DOI: 10.2478/fcds-2021-0008
Veysel Fuat Hatipoğlu
{"title":"Understanding the Impact of COVID–19 on Global Financial Network Using Graph Based Algorithm: Minimum Spanning Tree Approach","authors":"Veysel Fuat Hatipoğlu","doi":"10.2478/fcds-2021-0008","DOIUrl":"https://doi.org/10.2478/fcds-2021-0008","url":null,"abstract":"Abstract In this paper effects of COVID–19 pandemic on stock market network are analyzed by an application of operational research with a mathematical approach. For this purpose two minimum spanning trees for each time period namely before and during COVID–19 pandemic are constructed. Dynamic time warping algorithm is used to measure the similarity between each time series of the investigated stock markets. Then, clusters of investigated stock markets are constructed. Numerical values of the topology evaluation for each cluster and time period is computed.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"46 1","pages":"111 - 123"},"PeriodicalIF":1.1,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48375851","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学术官方微信