Pub Date : 2021-03-29DOI: 10.15625/1813-9663/37/1/15773
Vu-Tuan Dang, V. Vu, Hong-Quan Do, Thi Kieu Oanh Le
During the past few years, semi-supervised clustering has emerged as a new interesting direction in machine learning research. In a semi-supervised clustering algorithm, the clustering results can be significantly improved by using side information, which is available or collected from users. There are two main kinds of side information that can be learned in semi-supervised clustering algorithms including class labels(seeds) or pairwise constraints. In this paper, we propose a semisupervised graph based clustering algorithm that tries to use seeds and constraints in the clustering process, called MCSSGC. Moreover, we also introduce a simple but efficient active learning method to collect the constraints that can boost the performance of MCSSGC, named KMMFFQS. These obtained results show that the proposed algorithm can significantly improve the clustering process compared to some recent algorithms.
{"title":"GRAPH BASED CLUSTERING WITH CONSTRAINTS AND ACTIVE LEARNING","authors":"Vu-Tuan Dang, V. Vu, Hong-Quan Do, Thi Kieu Oanh Le","doi":"10.15625/1813-9663/37/1/15773","DOIUrl":"https://doi.org/10.15625/1813-9663/37/1/15773","url":null,"abstract":"During the past few years, semi-supervised clustering has emerged as a new interesting direction in machine learning research. In a semi-supervised clustering algorithm, the clustering results can be significantly improved by using side information, which is available or collected from users. There are two main kinds of side information that can be learned in semi-supervised clustering algorithms including class labels(seeds) or pairwise constraints. In this paper, we propose a semisupervised graph based clustering algorithm that tries to use seeds and constraints in the clustering process, called MCSSGC. Moreover, we also introduce a simple but efficient active learning method to collect the constraints that can boost the performance of MCSSGC, named KMMFFQS. These obtained results show that the proposed algorithm can significantly improve the clustering process compared to some recent algorithms.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"51 1","pages":"71-89"},"PeriodicalIF":0.0,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84452454","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}
Pub Date : 2021-03-29DOI: 10.15625/1813-9663/37/1/15852
Phạm Đình Phong
The fuzzy time series (FTS) forecasting models have been being studied intensively over the past few years. Most of the researches focus on improving the effectiveness of the FTS forecasting models using time-invariant fuzzy logical relationship groups proposed by Chen et al. In contrast to Chen’s model, a fuzzy set can be repeated in the right-hand side of the fuzzy logical relationship groups of Yu’s model. N. C. Dieu enhanced Yu’s forecasting model by using the time-variant fuzzy logical relationship groups instead of the time-invariant ones. The forecasting models mentioned above partition the historical data into subintervals and assign the fuzzy sets to them by the human expert’s experience. N. D. Hieu et al. proposed a linguistic time series by utilizing the hedge algebras quantification to converse the numerical time series data to the linguistic time series. Similar to the FTS forecasting model, the obtained linguistic time series can define the linguistic, logical relationships which are used to establish the linguistic, logical relationship groups and form a linguistic forecasting model. In this paper, we propose a linguistic time series forecasting model based on the linguistic forecasting rules induced from the linguistic, logical relationships instead of the linguistic, logical relationship groups proposed by N. D. Hieu. The experimental studies using the historical data of the enrollments of University of Alabama observed from 1971 to 1992 and the daily average temperature data observed from June 1996 to September 1996 in Taipei show the outperformance of the proposed forecasting models over the counterpart ones.
模糊时间序列(FTS)预测模型在过去的几年中得到了广泛的研究。大多数研究都集中在利用Chen等人提出的时不变模糊逻辑关系群来提高FTS预测模型的有效性。与Chen的模型相反，Yu模型的模糊逻辑关系组的右侧可以重复一个模糊集。N. C. Dieu用时变模糊逻辑关系群代替定常模糊逻辑关系群对Yu的预测模型进行了改进。上述预测模型将历史数据划分为子区间，并根据人类专家的经验对其进行模糊集的分配。N. D. Hieu等人利用套期代数量化将数值时间序列数据转换为语言时间序列，提出了语言时间序列。与FTS预测模型类似，得到的语言时间序列可以定义语言、逻辑关系，用于建立语言、逻辑关系组，形成语言预测模型。本文提出了一种基于语言逻辑关系而不是N. D. Hieu提出的语言逻辑关系组的语言预测规则的语言时间序列预测模型。利用1971 ~ 1992年阿拉巴马大学招生历史资料和1996年6月~ 1996年9月台北市日平均气温资料进行的实验研究表明，所提出的预测模型优于同类预测模型。
{"title":"A TIME SERIES FORECASTING MODEL BASED ON LINGUISTIC FORECASTING RULES","authors":"Phạm Đình Phong","doi":"10.15625/1813-9663/37/1/15852","DOIUrl":"https://doi.org/10.15625/1813-9663/37/1/15852","url":null,"abstract":"The fuzzy time series (FTS) forecasting models have been being studied intensively over the past few years. Most of the researches focus on improving the effectiveness of the FTS forecasting models using time-invariant fuzzy logical relationship groups proposed by Chen et al. In contrast to Chen’s model, a fuzzy set can be repeated in the right-hand side of the fuzzy logical relationship groups of Yu’s model. N. C. Dieu enhanced Yu’s forecasting model by using the time-variant fuzzy logical relationship groups instead of the time-invariant ones. The forecasting models mentioned above partition the historical data into subintervals and assign the fuzzy sets to them by the human expert’s experience. N. D. Hieu et al. proposed a linguistic time series by utilizing the hedge algebras quantification to converse the numerical time series data to the linguistic time series. Similar to the FTS forecasting model, the obtained linguistic time series can define the linguistic, logical relationships which are used to establish the linguistic, logical relationship groups and form a linguistic forecasting model. In this paper, we propose a linguistic time series forecasting model based on the linguistic forecasting rules induced from the linguistic, logical relationships instead of the linguistic, logical relationship groups proposed by N. D. Hieu. The experimental studies using the historical data of the enrollments of University of Alabama observed from 1971 to 1992 and the daily average temperature data observed from June 1996 to September 1996 in Taipei show the outperformance of the proposed forecasting models over the counterpart ones.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"46 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82131918","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}
Pub Date : 2021-03-29DOI: 10.15625/1813-9663/37/1/15418
Ngoc Quy Tran, Hong Quang Nguyen
Profiled side-channel attacks are now considered as a powerful form of side channel attacks used to break the security of cryptographic devices. A recent line of research has investigated a new profiled attack based on deep learning and many of them have used convolution neural network (CNN) as deep learning architecture for the attack. The effectiveness of the attack is greatly influenced by the CNN architecture. However, the CNN architecture used for current profiled attacks have often been based on image recognition fields, and choosing the right CNN architectures and parameters for adaption to profiled attacks is still challenging. In this paper, we propose an efficient profiled attack for unprotected and masking-protected cryptographic devices based on two CNN architectures, called CNNn, CNNd respectively. Both of CNN architecture parameters proposed in this paper are based on the property of points of interest on the power trace and further determined by the Grey Wolf Optimization (GWO) algorithm. To verify the proposed attacks, experiments were performed on a trace set collected from an Atmega8515 smart card when it performs AES-128 encryption, a DPA contest v4 dataset and the ASCAD public dataset.
{"title":"EFFICIENT CNN-BASED PROFILED SIDE CHANNEL ATTACKS","authors":"Ngoc Quy Tran, Hong Quang Nguyen","doi":"10.15625/1813-9663/37/1/15418","DOIUrl":"https://doi.org/10.15625/1813-9663/37/1/15418","url":null,"abstract":"Profiled side-channel attacks are now considered as a powerful form of side channel attacks used to break the security of cryptographic devices. A recent line of research has investigated a new profiled attack based on deep learning and many of them have used convolution neural network (CNN) as deep learning architecture for the attack. The effectiveness of the attack is greatly influenced by the CNN architecture. However, the CNN architecture used for current profiled attacks have often been based on image recognition fields, and choosing the right CNN architectures and parameters for adaption to profiled attacks is still challenging. In this paper, we propose an efficient profiled attack for unprotected and masking-protected cryptographic devices based on two CNN architectures, called CNNn, CNNd respectively. Both of CNN architecture parameters proposed in this paper are based on the property of points of interest on the power trace and further determined by the Grey Wolf Optimization (GWO) algorithm. To verify the proposed attacks, experiments were performed on a trace set collected from an Atmega8515 smart card when it performs AES-128 encryption, a DPA contest v4 dataset and the ASCAD public dataset.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"3 1","pages":"1-22"},"PeriodicalIF":0.0,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74271198","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}
Pub Date : 2021-03-29DOI: 10.15625/1813-9663/37/1/15858
Nguyen Thi My Binh, H. T. Thanh Binh, N. Ngoc, Mai Dang Quan Anh, N. Phuong
Barrier coverage in wireless camera sensor networks (WCSNs) has drawn the attention of research community since it promises an extremely large potential in applications involve movement detection and surveillance. As the battery resources are limited, improving the efficiency of energy is one of the key drivers for prolonging the lifetime of barrier coverage. However, most prior studies on this problem only worked on the networks with homogeneous sensors as well as omni-directional sensing coverage. This paper thus investigates the problem of maximizing the network lifetime to ensure strong barrier coverage for heterogeneous case (MLBC-HWCSN), that has not been taken into account in WCSNs research. We formulate the problem, and then propose a Modified Maximum Flow Algorithm (MMFA) consisting of three stages: constructing the flow-network, finding the maximum flow and refining the solution to solve this problem. Experimental results on extensive instances show that the proposed methodology is suitable for the studied problem and more efficient than existing algorithms.
{"title":"MAXIMIZING LIFETIME OF HETEROGENEOUS WIRELESS TURNABLE CAMERA SENSOR NETWORKS ENSURING STRONG BARRIER COVERAGE","authors":"Nguyen Thi My Binh, H. T. Thanh Binh, N. Ngoc, Mai Dang Quan Anh, N. Phuong","doi":"10.15625/1813-9663/37/1/15858","DOIUrl":"https://doi.org/10.15625/1813-9663/37/1/15858","url":null,"abstract":"Barrier coverage in wireless camera sensor networks (WCSNs) has drawn the attention of research community since it promises an extremely large potential in applications involve movement detection and surveillance. As the battery resources are limited, improving the efficiency of energy is one of the key drivers for prolonging the lifetime of barrier coverage. However, most prior studies on this problem only worked on the networks with homogeneous sensors as well as omni-directional sensing coverage. This paper thus investigates the problem of maximizing the network lifetime to ensure strong barrier coverage for heterogeneous case (MLBC-HWCSN), that has not been taken into account in WCSNs research. We formulate the problem, and then propose a Modified Maximum Flow Algorithm (MMFA) consisting of three stages: constructing the flow-network, finding the maximum flow and refining the solution to solve this problem. Experimental results on extensive instances show that the proposed methodology is suitable for the studied problem and more efficient than existing algorithms.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"6 1","pages":"57-70"},"PeriodicalIF":0.0,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87482044","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}
Pub Date : 2021-01-01DOI: 10.15625/1813-9663/37/3/16129
H. Ngo
I would like to dedicate this little exposition to Prof. Phan Dinh Dieu, one of the giants and pioneers of Mathematics in Computer Science in Vietnam. In the past 15 years or so, new and exciting connections between fundamental problems in database theory and information theory have emerged. There are several angles one can take to describe this connection. This paper takes one such angle, influenced by the author's own bias and research results. In particular, we will describe how the cardinality estimation problem -- a corner-stone problem for query optimizers -- is deeply connected to information theoretic inequalities. Furthermore, we explain how inequalities can also be used to derive a couple of classic geometric inequalities such as the Loomis-Whitney inequality. A purpose of the article is to introduce the reader to these new connections, where theory and practice meet in a wonderful way. Another objective is to point the reader to a research area with many new open questions.
{"title":"RECENT RESULTS ON CARDINALITY ESTIMATION AND INFORMATION THEORETIC INEQUALITIES","authors":"H. Ngo","doi":"10.15625/1813-9663/37/3/16129","DOIUrl":"https://doi.org/10.15625/1813-9663/37/3/16129","url":null,"abstract":"I would like to dedicate this little exposition to Prof. Phan Dinh Dieu, one of the giants and pioneers of Mathematics in Computer Science in Vietnam. In the past 15 years or so, new and exciting connections between fundamental problems in database theory and information theory have emerged. There are several angles one can take to describe this connection. This paper takes one such angle, influenced by the author's own bias and research results. In particular, we will describe how the cardinality estimation problem -- a corner-stone problem for query optimizers -- is deeply connected to information theoretic inequalities. Furthermore, we explain how inequalities can also be used to derive a couple of classic geometric inequalities such as the Loomis-Whitney inequality. A purpose of the article is to introduce the reader to these new connections, where theory and practice meet in a wonderful way. Another objective is to point the reader to a research area with many new open questions.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"150 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77396977","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}
Pub Date : 2021-01-01DOI: 10.15625/1813-9663/37/4/16151
Han Li, Yash Govind, Sidharth Mudgal, Theodoros Rekatsinas, A. Doan
Semantic matching finds certain types of semantic relationships among schema/data constructs. Examples include entity matching, entity linking, coreference resolution, schema/ontology matching, semantic text similarity, textual entailment, question answering, tagging, etc. Semantic matching has received much attention in the database, AI, KDD, Web, and Semantic Web communities. Recently, many works have also applied deep learning (DL) to semantic matching. In this paper we survey this fast growing topic. We define the semantic matching problem, categorize its variations into a taxonomy, and describe important applications. We describe DL solutions for important variations of semantic matching. Finally, we discuss future R&D directions.
{"title":"DEEP LEARNING FOR SEMANTIC MATCHING: A SURVEY","authors":"Han Li, Yash Govind, Sidharth Mudgal, Theodoros Rekatsinas, A. Doan","doi":"10.15625/1813-9663/37/4/16151","DOIUrl":"https://doi.org/10.15625/1813-9663/37/4/16151","url":null,"abstract":"Semantic matching finds certain types of semantic relationships among schema/data constructs. Examples include entity matching, entity linking, coreference resolution, schema/ontology matching, semantic text similarity, textual entailment, question answering, tagging, etc. Semantic matching has received much attention in the database, AI, KDD, Web, and Semantic Web communities. Recently, many works have also applied deep learning (DL) to semantic matching. In this paper we survey this fast growing topic. We define the semantic matching problem, categorize its variations into a taxonomy, and describe important applications. We describe DL solutions for important variations of semantic matching. Finally, we discuss future R&D directions.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"15 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82814121","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}
Pub Date : 2021-01-01DOI: 10.15625/1813-9663/37/4/16126
Đỗ Văn Tiến, C. Rotter
To save energy consumption of Ethernet switches, IEEE has standardized a new energy-efficient operation for Ethernet links with a low-power state and transition mechanisms between the high-power state for transporting traffic and the low-power state.In this paper, we propose a queueing model with the Markov Modulated Compound Poisson Process that is able to characterize backbone packet traffic. We derive a closed-form solution for the stationary distribution of the proposed queueing model. We show that our model can capture an entire system where the transition times are constant.
{"title":"A CLOSED-FORM SOLUTION FOR A QUEUEING MODEL OF ENERGY EFFICIENT ETHERNET LINKS","authors":"Đỗ Văn Tiến, C. Rotter","doi":"10.15625/1813-9663/37/4/16126","DOIUrl":"https://doi.org/10.15625/1813-9663/37/4/16126","url":null,"abstract":"To save energy consumption of Ethernet switches, IEEE has standardized a new energy-efficient operation for Ethernet links with a low-power state and transition mechanisms between the high-power state for transporting traffic and the low-power state.In this paper, we propose a queueing model with the Markov Modulated Compound Poisson Process that is able to characterize backbone packet traffic. We derive a closed-form solution for the stationary distribution of the proposed queueing model. We show that our model can capture an entire system where the transition times are constant.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"488 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86781785","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}
Pub Date : 2021-01-01DOI: 10.15625/1813-9663/37/3/16063
Nguyen Khoa Son, N. Le
This paper proposes a unified approach to study global exponential stability for a class of switched time-delay linear systems described by general linear functional differential equations. Several new delay-dependent criteria of exponential stability are established for this class of systems, under arbitrary switching which satisfies some assumptions on the minimum dwell time or the average dwell time. As particular cases, the obtained results are shown to include and improve many previously known results. An example is given to illustrate the proposed method.
{"title":"A UNIFIED APPROACH TO EXPONENTIAL STABILITY ANALYSIS FOR A GENERAL CLASS OF SWITCHED TIME-DELAY LINEAR SYSTEMS","authors":"Nguyen Khoa Son, N. Le","doi":"10.15625/1813-9663/37/3/16063","DOIUrl":"https://doi.org/10.15625/1813-9663/37/3/16063","url":null,"abstract":"This paper proposes a unified approach to study global exponential stability for a class of switched time-delay linear systems described by general linear functional differential equations. Several new delay-dependent criteria of exponential stability are established for this class of systems, under arbitrary switching which satisfies some assumptions on the minimum dwell time or the average dwell time. As particular cases, the obtained results are shown to include and improve many previously known results. An example is given to illustrate the proposed method.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"150 2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80390312","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}
Pub Date : 2021-01-01DOI: 10.15625/1813-9663/37/3/15955
J. Abe, K. Nakamatsu, A. Aharari, J. Filho
Annotated Logics are a category of non-classical logics that have recently appeared from a historical point of view. They are a type of paraconsistent, paracomplete and non-alethic logic. With the rapid development of AI and Automation and Robotics, more and more theory and techniques were coined to support the various issues that the themes were presenting. This expository work explores how to deal directly with conflicts (contradictions) and paracompleteness directly, without extra-logical devices. Support is given by the paraconsistent annotated evidential logic Et. Some applications are discussed.
{"title":"THE ROLE OF ANNOTATED LOGICS IN AI: A REVIEW PAPER","authors":"J. Abe, K. Nakamatsu, A. Aharari, J. Filho","doi":"10.15625/1813-9663/37/3/15955","DOIUrl":"https://doi.org/10.15625/1813-9663/37/3/15955","url":null,"abstract":"Annotated Logics are a category of non-classical logics that have recently appeared from a historical point of view. They are a type of paraconsistent, paracomplete and non-alethic logic. With the rapid development of AI and Automation and Robotics, more and more theory and techniques were coined to support the various issues that the themes were presenting. This expository work explores how to deal directly with conflicts (contradictions) and paracompleteness directly, without extra-logical devices. Support is given by the paraconsistent annotated evidential logic Et. Some applications are discussed.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"33 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78621906","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}
Pub Date : 2021-01-01DOI: 10.15625/1813-9663/37/2/15340
T. Tran
The aim of this note is considering a dynamical system expressed by a Langevin equation driven by a Volterra process. An Ornstein - Uhlenbeck process as the solution of this kind of equation is described and a problem of state estimation (filtering) for this dynamical system is investigated as well.
{"title":"ON A STOCHASTIC LINEAR DYNAMICAL SYSTEM DRIVEN BY A VOLTERRA PROCESS","authors":"T. Tran","doi":"10.15625/1813-9663/37/2/15340","DOIUrl":"https://doi.org/10.15625/1813-9663/37/2/15340","url":null,"abstract":"The aim of this note is considering a dynamical system expressed by a Langevin equation driven by a Volterra process. An Ornstein - Uhlenbeck process as the solution of this kind of equation is described and a problem of state estimation (filtering) for this dynamical system is investigated as well.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"85 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87455627","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：