Pub Date : 2022-08-17DOI: 10.14736/kyb-2022-3-0301
Haifeng Huo, Xian Wen
This paper considers an exponential cost optimality problem for finite horizon semi-Markov decision processes (SMDPs). The objective is to calculate an optimal policy with minimal exponential costs over the full set of policies in a finite horizon. First, under the standard regular and compact-continuity conditions, we establish the optimality equation, prove that the value function is the unique solution of the optimality equation and the existence of an optimal policy by using the minimum nonnegative solution approach. Second, we establish a new value iteration algorithm to calculate both the value function and the (cid:15) -optimal policy. Finally, we give a computable machine maintenance system to illustrate the convergence of the algorithm.
{"title":"The exponential cost optimality for finite horizon semi-Markov decision processes","authors":"Haifeng Huo, Xian Wen","doi":"10.14736/kyb-2022-3-0301","DOIUrl":"https://doi.org/10.14736/kyb-2022-3-0301","url":null,"abstract":"This paper considers an exponential cost optimality problem for finite horizon semi-Markov decision processes (SMDPs). The objective is to calculate an optimal policy with minimal exponential costs over the full set of policies in a finite horizon. First, under the standard regular and compact-continuity conditions, we establish the optimality equation, prove that the value function is the unique solution of the optimality equation and the existence of an optimal policy by using the minimum nonnegative solution approach. Second, we establish a new value iteration algorithm to calculate both the value function and the (cid:15) -optimal policy. Finally, we give a computable machine maintenance system to illustrate the convergence of the algorithm.","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"106 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80733620","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 : 2022-08-07DOI: 10.14736/kyb-2023-2-0234
Sarmad N. Mohammed, Semra Gunducc
In this work, Transition Probability Matrix (TPM) is proposed as a new method for extracting the features of nodes in the graph. The proposed method uses random walks to capture the connectivity structure of a node's close neighborhood. The information obtained from random walks is converted to anonymous walks to extract the topological features of nodes. In the embedding process of nodes, anonymous walks are used since they capture the topological similarities of connectivities better than random walks. Therefore the obtained embedding vectors have richer information about the underlying connectivity structure. The method is applied to node classification and link prediction tasks. The performance of the proposed algorithm is superior to the state-of-the-art algorithms in the recent literature. Moreover, the extracted information about the connectivity structure of similar networks is used to link prediction and node classification tasks for a completely new graph.
{"title":"TPM: Transition probability matrix -- Graph structural feature based embedding","authors":"Sarmad N. Mohammed, Semra Gunducc","doi":"10.14736/kyb-2023-2-0234","DOIUrl":"https://doi.org/10.14736/kyb-2023-2-0234","url":null,"abstract":"In this work, Transition Probability Matrix (TPM) is proposed as a new method for extracting the features of nodes in the graph. The proposed method uses random walks to capture the connectivity structure of a node's close neighborhood. The information obtained from random walks is converted to anonymous walks to extract the topological features of nodes. In the embedding process of nodes, anonymous walks are used since they capture the topological similarities of connectivities better than random walks. Therefore the obtained embedding vectors have richer information about the underlying connectivity structure. The method is applied to node classification and link prediction tasks. The performance of the proposed algorithm is superior to the state-of-the-art algorithms in the recent literature. Moreover, the extracted information about the connectivity structure of similar networks is used to link prediction and node classification tasks for a completely new graph.","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"7 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81814863","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 : 2022-08-04DOI: 10.14736/kyb-2023-1-0130
Martina Petr'akov'a
This paper generalizes a recent existence result for infinite-volume marked Gibbs point processes. We try to use the existence theorem for two models from stochastic geometry. First, we show the existence of Gibbs facet processes in $mathbb{R}^d$ with repulsive interactions. We also prove that the finite-volume Gibbs facet processes with attractive interactions need not exist. Afterwards, we study Gibbs-Laguerre tessellations of $mathbb{R}^2$. The mentioned existence result cannot be used, since one of its assumptions is not satisfied for tessellations, but we are able to show the existence of an infinite-volume Gibbs-Laguerre process with a particular energy function, under the assumption that we almost surely see a point.
{"title":"A note on the existence of Gibbs marked point processes with applications in stochastic geometry","authors":"Martina Petr'akov'a","doi":"10.14736/kyb-2023-1-0130","DOIUrl":"https://doi.org/10.14736/kyb-2023-1-0130","url":null,"abstract":"This paper generalizes a recent existence result for infinite-volume marked Gibbs point processes. We try to use the existence theorem for two models from stochastic geometry. First, we show the existence of Gibbs facet processes in $mathbb{R}^d$ with repulsive interactions. We also prove that the finite-volume Gibbs facet processes with attractive interactions need not exist. Afterwards, we study Gibbs-Laguerre tessellations of $mathbb{R}^2$. The mentioned existence result cannot be used, since one of its assumptions is not satisfied for tessellations, but we are able to show the existence of an infinite-volume Gibbs-Laguerre process with a particular energy function, under the assumption that we almost surely see a point.","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"28 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80315367","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 : 2022-07-29DOI: 10.14736/kyb-2022-2-0237
Ralph Gerard B. Sangalang, Diether Jhay S. Masangcay, Cleo Martin R. Torino, Diane Jelyn C. Gutierrez
A control system architecture design for an underwater ROV, primarily Class I - Pure Observation underwater ROV is presented in this paper. A non-linear plant model was designed using SolidWorks 3D modeling tool and is imported to MATLAB as a 3D model. The non-linear modeled plant is linearized using the MATLAB linear analysis toolbox to have a linear approximate model of the system. The authors designed controllers for the linear plant model of underwater ROV. PID controllers are utilized as a controller of the modeled plant. The PID tuning tools by MATLAB are utilized to tune the controller of the plant model of underwater ROV. The researchers test the control design of underwater ROV using MATLAB Simulink by analyzing the response of the system and troubleshoot the control design to achieve the objective parameters for the control design of underwater ROV.
{"title":"Design of a control architecture for an underwater remotely operated vehicle (ROV) used for search and rescue operations","authors":"Ralph Gerard B. Sangalang, Diether Jhay S. Masangcay, Cleo Martin R. Torino, Diane Jelyn C. Gutierrez","doi":"10.14736/kyb-2022-2-0237","DOIUrl":"https://doi.org/10.14736/kyb-2022-2-0237","url":null,"abstract":"A control system architecture design for an underwater ROV, primarily Class I - Pure Observation underwater ROV is presented in this paper. A non-linear plant model was designed using SolidWorks 3D modeling tool and is imported to MATLAB as a 3D model. The non-linear modeled plant is linearized using the MATLAB linear analysis toolbox to have a linear approximate model of the system. The authors designed controllers for the linear plant model of underwater ROV. PID controllers are utilized as a controller of the modeled plant. The PID tuning tools by MATLAB are utilized to tune the controller of the plant model of underwater ROV. The researchers test the control design of underwater ROV using MATLAB Simulink by analyzing the response of the system and troubleshoot the control design to achieve the objective parameters for the control design of underwater ROV.","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"46 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79221307","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 : 2022-07-29DOI: 10.14736/kyb-2022-2-0254
Jaime Martínez Sánchez, F. Baltazar-Larios
{"title":"Approximations of the ultimate ruin probability in the classical risk model using the Banach's fixed-point theorem and the continuity of the ruin probability","authors":"Jaime Martínez Sánchez, F. Baltazar-Larios","doi":"10.14736/kyb-2022-2-0254","DOIUrl":"https://doi.org/10.14736/kyb-2022-2-0254","url":null,"abstract":"","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"74 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78423634","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 : 2022-07-29DOI: 10.14736/kyb-2022-2-0277
Pelin Çetin, Şahin Emrah Amrahov
{"title":"A new overlapping community detection algorithm based on similarity of neighbors in complex networks","authors":"Pelin Çetin, Şahin Emrah Amrahov","doi":"10.14736/kyb-2022-2-0277","DOIUrl":"https://doi.org/10.14736/kyb-2022-2-0277","url":null,"abstract":"","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"88 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85591558","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":"Coordination control and analysis of TCSC devices to protect electrical power systems against disruptive disturbances","authors":"Zhaoxu Wang, Chao Zhai, Hehong Zhang, Gaoxi Xiao, G. Chen, Yulin Xu","doi":"10.14736/kyb-2022-2-0218","DOIUrl":"https://doi.org/10.14736/kyb-2022-2-0218","url":null,"abstract":"","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"40 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84888715","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 : 2022-05-23DOI: 10.14736/kyb-2022-2-0145
V. Stepanović, A. Tepavčević
{"title":"Fuzzy sets (in)equations with a complete codomain lattice","authors":"V. Stepanović, A. Tepavčević","doi":"10.14736/kyb-2022-2-0145","DOIUrl":"https://doi.org/10.14736/kyb-2022-2-0145","url":null,"abstract":"","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"12 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89230039","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 : 2022-04-07DOI: 10.14736/kyb-2022-1-0101
Jaicer López-Rivero, R. Cavazos-Cadena, H. Cruz-Suárez
{"title":"Risk-sensitive Markov stopping games with an absorbing state","authors":"Jaicer López-Rivero, R. Cavazos-Cadena, H. Cruz-Suárez","doi":"10.14736/kyb-2022-1-0101","DOIUrl":"https://doi.org/10.14736/kyb-2022-1-0101","url":null,"abstract":"","PeriodicalId":49928,"journal":{"name":"Kybernetika","volume":"110 1","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72863668","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
扫码关注我们
求助内容：
应助结果提醒方式：