Pub Date : 2023-03-18DOI: 10.14736/kyb-2023-1-0110
D. Gopal, J. Martínez-Moreno, N. Özgür
{"title":"On fixed figure problems in fuzzy metric spaces","authors":"D. Gopal, J. Martínez-Moreno, N. Özgür","doi":"10.14736/kyb-2023-1-0110","DOIUrl":"https://doi.org/10.14736/kyb-2023-1-0110","url":null,"abstract":"","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"113 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2023-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79325612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-03-10DOI: 10.14736/kyb-2023-1-0001
Xi Chen, Xinran Tao, Xuejun Wang
Complete f -moment convergence is much more general than complete convergence and complete moment convergence. In this work, we mainly investigate the complete f -moment convergence for weighted sums of widely orthant dependent (WOD, for short) arrays. A general result on Complete f -moment convergence is obtained under some suitable conditions, which generalizes the corresponding one in the literature. As an application, we establish the complete consistency for the weighted linear estimator in nonparametric regression models. Finally, some simulations are provided to show the numerical performance of theoretical results based on finite samples.
{"title":"Complete f-moment convergence for weighted sums of WOD arrays with statistical applications","authors":"Xi Chen, Xinran Tao, Xuejun Wang","doi":"10.14736/kyb-2023-1-0001","DOIUrl":"https://doi.org/10.14736/kyb-2023-1-0001","url":null,"abstract":"Complete f -moment convergence is much more general than complete convergence and complete moment convergence. In this work, we mainly investigate the complete f -moment convergence for weighted sums of widely orthant dependent (WOD, for short) arrays. A general result on Complete f -moment convergence is obtained under some suitable conditions, which generalizes the corresponding one in the literature. As an application, we establish the complete consistency for the weighted linear estimator in nonparametric regression models. Finally, some simulations are provided to show the numerical performance of theoretical results based on finite samples.","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"37 4","pages":""},"PeriodicalIF":0.5,"publicationDate":"2023-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72584550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-03-10DOI: 10.14736/kyb-2023-1-0045
Nermin Kartlı, E. Bostanci, Mehmet Serdar Guzel
Fixed charge transportation problem (FCTP) is a supply chain problem. In this problem, in addition to the cost per unit for each transported product, a fixed cost is also required. The aim is to carry out the transportation process at the lowest possible cost. As with all supply chain problems, this problem may have one, two, or three stages. An algorithm that can find the optimal solution for the problem in polynomial time is not known, even if it is a single-stage problem. For this reason, new algorithms have been proposed in recent years to provide an approximate solution for the problem. The vast majority of these algorithms are meta-heuristic algorithms. In this study, we propose a new heuristic algorithm to find an optimal solution for the 1-stage FCTP. We compare the results of our algorithm with the results of other existing algorithms.
{"title":"A new algorithm for optimal solution of fixed charge transportation problem","authors":"Nermin Kartlı, E. Bostanci, Mehmet Serdar Guzel","doi":"10.14736/kyb-2023-1-0045","DOIUrl":"https://doi.org/10.14736/kyb-2023-1-0045","url":null,"abstract":"Fixed charge transportation problem (FCTP) is a supply chain problem. In this problem, in addition to the cost per unit for each transported product, a fixed cost is also required. The aim is to carry out the transportation process at the lowest possible cost. As with all supply chain problems, this problem may have one, two, or three stages. An algorithm that can find the optimal solution for the problem in polynomial time is not known, even if it is a single-stage problem. For this reason, new algorithms have been proposed in recent years to provide an approximate solution for the problem. The vast majority of these algorithms are meta-heuristic algorithms. In this study, we propose a new heuristic algorithm to find an optimal solution for the 1-stage FCTP. We compare the results of our algorithm with the results of other existing algorithms.","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"19 5 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2023-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90313406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-03-10DOI: 10.14736/kyb-2023-1-0028
Ziming Wang, Yiming Xing, Xinghua Zhu
In this paper, we consider the parameter estimation problem for the multivariable system. A recursive least squares algorithm is studied by minimizing the accumulative prediction error. By employing the stochastic Lyapunov function and the martingale estimate methods, we provide the weakest possible data conditions for convergence analysis. The upper bound of accumulative regret is also provided. Various simulation examples are given, and the results demonstrate that the convergence rate of the algorithm depends on the parameter dimension and output dimension.
{"title":"Performance analysis of least squares algorithm for multivariable stochastic systems","authors":"Ziming Wang, Yiming Xing, Xinghua Zhu","doi":"10.14736/kyb-2023-1-0028","DOIUrl":"https://doi.org/10.14736/kyb-2023-1-0028","url":null,"abstract":"In this paper, we consider the parameter estimation problem for the multivariable system. A recursive least squares algorithm is studied by minimizing the accumulative prediction error. By employing the stochastic Lyapunov function and the martingale estimate methods, we provide the weakest possible data conditions for convergence analysis. The upper bound of accumulative regret is also provided. Various simulation examples are given, and the results demonstrate that the convergence rate of the algorithm depends on the parameter dimension and output dimension.","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"29 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2023-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84975757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-02-09DOI: 10.14736/kyb-2022-6-0903
P. Dostál
{"title":"Almost log-optimal trading strategies for small transaction costs in model with stochastic coefficients","authors":"P. Dostál","doi":"10.14736/kyb-2022-6-0903","DOIUrl":"https://doi.org/10.14736/kyb-2022-6-0903","url":null,"abstract":"","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"137 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2023-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75709578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-02-09DOI: 10.14736/kyb-2022-6-0960
E. E. Martínez-García, J. Minjárez‐Sosa, Óscar Vega-Amaya
{"title":"Partially observable Markov decision processes with partially observable random discount factors","authors":"E. E. Martínez-García, J. Minjárez‐Sosa, Óscar Vega-Amaya","doi":"10.14736/kyb-2022-6-0960","DOIUrl":"https://doi.org/10.14736/kyb-2022-6-0960","url":null,"abstract":"","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"25 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2023-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78367094","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-02-09DOI: 10.14736/kyb-2022-6-0984
A. Sheikhi, Fereshteh Arad, R. Mesiar
{"title":"On asymmetric distributions of copula related random variables which includes the skew-normal ones","authors":"A. Sheikhi, Fereshteh Arad, R. Mesiar","doi":"10.14736/kyb-2022-6-0984","DOIUrl":"https://doi.org/10.14736/kyb-2022-6-0984","url":null,"abstract":"","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"13 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2023-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85788821","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-02-05DOI: 10.14736/kyb-2022-6-0863
Funda Karaçal, T. Köroglu
{"title":"A principal topology obtained from uninorms","authors":"Funda Karaçal, T. Köroglu","doi":"10.14736/kyb-2022-6-0863","DOIUrl":"https://doi.org/10.14736/kyb-2022-6-0863","url":null,"abstract":"","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"30 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2023-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90610331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improved inference for the generalized Pareto distribution under linear, power and exponential normalization","authors":"Osama Mohareb Khaled, Haroon Mohamed Barakat, Nourhan Khalil Rakha","doi":"10.14736/kyb-2022-6-0883","DOIUrl":"https://doi.org/10.14736/kyb-2022-6-0883","url":null,"abstract":"","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"248 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2023-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83707209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：