Pub Date : 2022-08-01DOI: 10.1007/978-3-030-89543-3_32
L. Faria, U. Souza
{"title":"On the Probe Problem for (r, ℓ )-Well-Coveredness","authors":"L. Faria, U. Souza","doi":"10.1007/978-3-030-89543-3_32","DOIUrl":"https://doi.org/10.1007/978-3-030-89543-3_32","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"56 1","pages":"56-68"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87162279","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 : 2022-07-31DOI: 10.48550/arXiv.2208.00482
T. Lidbetter, Yifan Xie
We consider a search and rescue game introduced recently by the first author. An immobile target or targets (for example, injured hikers) are hidden on a graph. The terrain is assumed to dangerous, so that when any given vertex of the graph is searched, there is a certain probability that the search will come to an end, otherwise with the complementary {em success probability} the search can continue. A Searcher searches the graph with the aim of finding all the targets with maximum probability. Here, we focus on the game in the case that the graph is a cycle. In the case that there is only one target, we solve the game for equal success probabilities, and for a class of games with unequal success probabilities. For multiple targets and equal success probabilities, we give a solution for an adaptive Searcher and a solution in a special case for a non-adaptive Searcher. We also consider a continuous version of the model, giving a full solution for an adaptive Searcher and approximately optimal solutions in the non-adaptive case.
{"title":"The Search and Rescue Game on a Cycle","authors":"T. Lidbetter, Yifan Xie","doi":"10.48550/arXiv.2208.00482","DOIUrl":"https://doi.org/10.48550/arXiv.2208.00482","url":null,"abstract":"We consider a search and rescue game introduced recently by the first author. An immobile target or targets (for example, injured hikers) are hidden on a graph. The terrain is assumed to dangerous, so that when any given vertex of the graph is searched, there is a certain probability that the search will come to an end, otherwise with the complementary {em success probability} the search can continue. A Searcher searches the graph with the aim of finding all the targets with maximum probability. Here, we focus on the game in the case that the graph is a cycle. In the case that there is only one target, we solve the game for equal success probabilities, and for a class of games with unequal success probabilities. For multiple targets and equal success probabilities, we give a solution for an adaptive Searcher and a solution in a special case for a non-adaptive Searcher. We also consider a continuous version of the model, giving a full solution for an adaptive Searcher and approximately optimal solutions in the non-adaptive case.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"43 1","pages":"114016"},"PeriodicalIF":0.0,"publicationDate":"2022-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80340838","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}
The Vietoris space of a Stone space plays an important role in the coalgebraic approach to modal logic. When generalizing this to positive modal logic, there is a variety of relevant hyperspace constructions based on various topologies on a Priestley space and mechanisms to topologize the hyperspace of closed sets. A number of authors considered hyperspaces of Priestley spaces and their application to the coalgebraic approach to positive modal logic. A mixture of techniques from category theory, pointfree topology, and Priestley duality have been employed. Our aim is to provide a unifying approach to this area of research relying only on a basic familiarity with Priestley duality and related free constructions of distributive lattices.
{"title":"Remarks on hyperspaces for Priestley spaces","authors":"G. Bezhanishvili, J. Harding, P. Morandi","doi":"10.2139/ssrn.4174877","DOIUrl":"https://doi.org/10.2139/ssrn.4174877","url":null,"abstract":"The Vietoris space of a Stone space plays an important role in the coalgebraic approach to modal logic. When generalizing this to positive modal logic, there is a variety of relevant hyperspace constructions based on various topologies on a Priestley space and mechanisms to topologize the hyperspace of closed sets. A number of authors considered hyperspaces of Priestley spaces and their application to the coalgebraic approach to positive modal logic. A mixture of techniques from category theory, pointfree topology, and Priestley duality have been employed. Our aim is to provide a unifying approach to this area of research relying only on a basic familiarity with Priestley duality and related free constructions of distributive lattices.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"36 1","pages":"187-202"},"PeriodicalIF":0.0,"publicationDate":"2022-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80515865","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 : 2022-07-06DOI: 10.7494/csci.2022.23.2.4339
Arnab Sadhu, B. Bhattacharyya, T. Mukhopadhyay
Differential gene expressional network determines the prominent genes under altered phenotypes. Traditional approach requires n(n-2)/2 comparisons for n phenotypes. We present a direct method for determining the differential network under multiple phenotypes. We explore the non-discrete nature of gene expression as a pattern in fuzzy rough set. An edge between a pair of genes represents positive region of fuzzy similarity relation upon a phenotypic change. We apply a weight ranking formula and obtain a directed ranked network; we term it as Phenotype Interweaved Network. Nodes with large in-degree connectivity bubble up as significant genes under respective phenotypic changes. We test the method on datasets of six diseases and achieve good corroboration with results of previous studies in two-step approach. The subgraphs of isolated genes achieve good significance upon validation through information theoretic approach. Top ranking genes determined in all our case studies have parity with genes reported by wet-lab tests.
{"title":"A single-shot determination of differential gene network on multiple disease subtypes","authors":"Arnab Sadhu, B. Bhattacharyya, T. Mukhopadhyay","doi":"10.7494/csci.2022.23.2.4339","DOIUrl":"https://doi.org/10.7494/csci.2022.23.2.4339","url":null,"abstract":" Differential gene expressional network determines the prominent genes under altered phenotypes. Traditional approach requires n(n-2)/2 comparisons for n phenotypes. We present a direct method for determining the differential network under multiple phenotypes. \u0000 We explore the non-discrete nature of gene expression as a pattern in fuzzy rough set. An edge between a pair of genes represents positive region of fuzzy similarity relation upon a phenotypic change. We apply a weight ranking formula and obtain a directed ranked network; we term it as Phenotype Interweaved Network. Nodes with large in-degree connectivity bubble up as significant genes under respective phenotypic changes. \u0000 We test the method on datasets of six diseases and achieve good corroboration with results of previous studies in two-step approach. The subgraphs of isolated genes achieve good significance upon validation through information theoretic approach. Top ranking genes determined in all our case studies have parity with genes reported by wet-lab tests.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"24 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74555418","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 : 2022-07-06DOI: 10.7494/csci.2022.23.2.4086
M. Cudak, Mateusz Piech, R. Marcjan
Point of Interest (POI) is a general term for objects describing places from the real world. The concept of POIs matching, i.e. determining whether two sets of attributes represent the same location, is not a trivial challenge due to the large variety of data sources. The representation of POIs may vary depending on the base in which they are stored. Manual comparison of objects with each other is not achievable in real-time, therefore there are multiple solutions to automatic merging. However there is no efficient solution that includes the deficiencies in the existence of attributes, has been proposed so far. In this paper, we propose the Multilayered Hybrid Classifier which is composed of machine learning and deep learning techniques, supported by the first-past-the-post voting system. We examined different weights for constituencies which were taken into consideration during the majority (or supermajority) decision. As a result, we achieved slightly higher accuracy than the current best model - Random Forest, which in its working also base on voting.
{"title":"Sparse data classifier based on the first-past-the-post voting system","authors":"M. Cudak, Mateusz Piech, R. Marcjan","doi":"10.7494/csci.2022.23.2.4086","DOIUrl":"https://doi.org/10.7494/csci.2022.23.2.4086","url":null,"abstract":"Point of Interest (POI) is a general term for objects describing places from the real world. The concept of POIs matching, i.e. determining whether two sets of attributes represent the same location, is not a trivial challenge due to the large variety of data sources. The representation of POIs may vary depending on the base in which they are stored. Manual comparison of objects with each other is not achievable in real-time, therefore there are multiple solutions to automatic merging. However there is no efficient solution that includes the deficiencies in the existence of attributes, has been proposed so far. In this paper, we propose the Multilayered Hybrid Classifier which is composed of machine learning and deep learning techniques, supported by the first-past-the-post voting system. We examined different weights for constituencies which were taken into consideration during the majority (or supermajority) decision. As a result, we achieved slightly higher accuracy than the current best model - Random Forest, which in its working also base on voting.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"75 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86412134","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 : 2022-07-06DOI: 10.7494/csci.2022.23.2.3776
Noorollah Karimtabar, Mohammad Javad Shayegan Fard
In the current paper, we use an intelligent method for improved the Apriori algorithm in order to extract frequent itemsets. PAA (proposed Apriori algorithm) is twofold. First, it is not necessary to take only one data item at each step. In fact, all possible combinations of the items could be generated at each step. Secondly, we can scan only some transactions instead of scanning all the transactions to obtain frequent itemset. For performance evaluation, we conducted three experiments with the traditional Apriori, BitTableFI, TDM-MFI, and MDC_Apriori algorithms. The results exhibit that due to the significant reduction in the number of transaction scans to obtain the itemset, the algorithm execution time is significantly reduced; as in the first experiment, the time spent to generate frequent items underwent a reduction by 52% compared to the algorithm in the first experiment. In the second experiment, the amount of time spent is equal to 65%, while in the third experiment, it is equal to 46%.
{"title":"Finding Frequent Items: A Novel Method for Improving the Apriori Algorithm","authors":"Noorollah Karimtabar, Mohammad Javad Shayegan Fard","doi":"10.7494/csci.2022.23.2.3776","DOIUrl":"https://doi.org/10.7494/csci.2022.23.2.3776","url":null,"abstract":"In the current paper, we use an intelligent method for improved the Apriori algorithm in order to extract frequent itemsets. PAA (proposed Apriori algorithm) is twofold. First, it is not necessary to take only one data item at each step. In fact, all possible combinations of the items could be generated at each step. Secondly, we can scan only some transactions instead of scanning all the transactions to obtain frequent itemset. For performance evaluation, we conducted three experiments with the traditional Apriori, BitTableFI, TDM-MFI, and MDC_Apriori algorithms. The results exhibit that due to the significant reduction in the number of transaction scans to obtain the itemset, the algorithm execution time is significantly reduced; as in the first experiment, the time spent to generate frequent items underwent a reduction by 52% compared to the algorithm in the first experiment. In the second experiment, the amount of time spent is equal to 65%, while in the third experiment, it is equal to 46%.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77973600","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 : 2022-07-06DOI: 10.7494/csci.2022.23.2.4071
Carynthia Kharkongor, B. Nath
The task of mining the association rule has become one of the most widely used discovery pattern methods in Knowledge Discovery in Databases (KDD). One such task is to represent the itemset in the memory. The representation of the itemset largely depend on the type of data structure that is used for storing them. Computing the process of mining the association rule im- pacts the memory and time requirement of the itemset. With the increase in the dimensionality of data and datasets, mining such large volume of datasets will be difficult since all these itemsets cannot be placed in the main memory. As representation of an itemset greatly affects the efficiency of the rule mining association, a compact and compress representation of an itemset is needed. In this paper, a set representation is introduced which is more memory and cost efficient. Bitmap representation takes one byte for an element but the set representation uses one bit. The set representation is being incorporated in Apriori Algorithm. Set representation is also being tested for different rule generation algorithms. The complexities of these different rule generation algorithms using set representation are being compared in terms of memory and time execution.
{"title":"Set Representation for Rule Generation Algorithms","authors":"Carynthia Kharkongor, B. Nath","doi":"10.7494/csci.2022.23.2.4071","DOIUrl":"https://doi.org/10.7494/csci.2022.23.2.4071","url":null,"abstract":"The task of mining the association rule has become one of the most widely used discovery pattern methods in Knowledge Discovery in Databases (KDD). One such task is to represent the itemset in the memory. The representation of the itemset largely depend on the type of data structure that is used for storing them. Computing the process of mining the association rule im- pacts the memory and time requirement of the itemset. With the increase in the dimensionality of data and datasets, mining such large volume of datasets will be difficult since all these itemsets cannot be placed in the main memory. As representation of an itemset greatly affects the efficiency of the rule mining association, a compact and compress representation of an itemset is needed. In this paper, a set representation is introduced which is more memory and cost efficient. Bitmap representation takes one byte for an element but the set representation uses one bit. The set representation is being incorporated in Apriori Algorithm. Set representation is also being tested for different rule generation algorithms. The complexities of these different rule generation algorithms using set representation are being compared in terms of memory and time execution.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"40 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81056707","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 : 2022-07-01DOI: 10.1016/j.tcs.2022.07.012
Peng Li, Jian-dong Shang, Yi Shi
{"title":"A simple linear time algorithm to solve the MIST problem on interval graphs","authors":"Peng Li, Jian-dong Shang, Yi Shi","doi":"10.1016/j.tcs.2022.07.012","DOIUrl":"https://doi.org/10.1016/j.tcs.2022.07.012","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"1 1","pages":"77-85"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82133375","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 : 2022-07-01DOI: 10.1016/j.tcs.2022.07.032
Xiang Liu, Jinyu Zou, Pengpeng Chen, P. Wan
{"title":"Gaussian downlink user selection subject to access limit, power budget, and rate demands","authors":"Xiang Liu, Jinyu Zou, Pengpeng Chen, P. Wan","doi":"10.1016/j.tcs.2022.07.032","DOIUrl":"https://doi.org/10.1016/j.tcs.2022.07.032","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"22 1","pages":"78-92"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83286174","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
扫码关注我们
求助内容：
应助结果提醒方式：