Pub Date : 2022-08-11DOI: 10.1142/s0129054122420096
M. Nadeem, Waqar Ali, H. M. A. Siddiqui
A biswapped network is an interconnection network in multiprocessor systems. These are networks of devices or processors and connections of these devices or processors. Here network can be expressed in the form of a graph. Devices or processors represent vertices, and the connection of devices or processors represents edges. The subset of the nodes set is called the resolving set if all the representations or codes are different w.r.t. this subset gives the information about the complete network. The minimum cardinality of the resolving set is called the locating number. In this article, we find the locating number of biswapped interconnection networks. In this paper, We compute the exact values of locating numbers for biswapped networks generated by different families of underlying basis networks like path, cycle, power of path, and complete. We have also given the bounds of locating number of any biswapped network generated by any underlying basis network that consists of its clusters.
{"title":"Locating Number of Biswapped Networks","authors":"M. Nadeem, Waqar Ali, H. M. A. Siddiqui","doi":"10.1142/s0129054122420096","DOIUrl":"https://doi.org/10.1142/s0129054122420096","url":null,"abstract":"A biswapped network is an interconnection network in multiprocessor systems. These are networks of devices or processors and connections of these devices or processors. Here network can be expressed in the form of a graph. Devices or processors represent vertices, and the connection of devices or processors represents edges. The subset of the nodes set is called the resolving set if all the representations or codes are different w.r.t. this subset gives the information about the complete network. The minimum cardinality of the resolving set is called the locating number. In this article, we find the locating number of biswapped interconnection networks. In this paper, We compute the exact values of locating numbers for biswapped networks generated by different families of underlying basis networks like path, cycle, power of path, and complete. We have also given the bounds of locating number of any biswapped network generated by any underlying basis network that consists of its clusters.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130767314","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-28DOI: 10.1142/s0129054122500204
H. Yildirim, Zeynep Nihan Berberler
Computer networks are prone to targeted attacks and random failures. Robustness is a measure of an ability of a network to continue functioning when part of the network is either naturally damaged or targeted for attack. The study of network robustness is a critical tool in the characterization and understanding of complex interconnected systems. There are several proposed graph metrics that predicates network resilience against such attacks. Isolated rupture degree is a novel graph-theoretic concept defined as a measure of network vulnerability. Isolated rupture degree is argued as an appropriate measure for modelling the robustness of network topologies in the face of possible node destruction. In this paper, the relationships between isolated rupture degree and some other graph parameters such as connectivity, covering number, minimum vertex degree are established. The isolated rupture degrees of [Formula: see text]-free graphs, middle graphs, corona graphs of a middle graph and a complete graph [Formula: see text] on two vertices are evaluated, then compared and the more stable graph types are reported. A sharp upper bound for the isolated rupture degree of middle graphs is established.
{"title":"Isolated Rupture in Composite Networks","authors":"H. Yildirim, Zeynep Nihan Berberler","doi":"10.1142/s0129054122500204","DOIUrl":"https://doi.org/10.1142/s0129054122500204","url":null,"abstract":"Computer networks are prone to targeted attacks and random failures. Robustness is a measure of an ability of a network to continue functioning when part of the network is either naturally damaged or targeted for attack. The study of network robustness is a critical tool in the characterization and understanding of complex interconnected systems. There are several proposed graph metrics that predicates network resilience against such attacks. Isolated rupture degree is a novel graph-theoretic concept defined as a measure of network vulnerability. Isolated rupture degree is argued as an appropriate measure for modelling the robustness of network topologies in the face of possible node destruction. In this paper, the relationships between isolated rupture degree and some other graph parameters such as connectivity, covering number, minimum vertex degree are established. The isolated rupture degrees of [Formula: see text]-free graphs, middle graphs, corona graphs of a middle graph and a complete graph [Formula: see text] on two vertices are evaluated, then compared and the more stable graph types are reported. A sharp upper bound for the isolated rupture degree of middle graphs is established.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"111 3S 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133704641","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-22DOI: 10.1142/s0129054122500198
Lan Lin, Yixun Lin
The bipartization problem for a graph [Formula: see text] asks for finding a subset [Formula: see text] of [Formula: see text] such that the induced subgraph [Formula: see text] is bipartite and [Formula: see text] is maximized. This problem has significant applications in the via minimization of VLSI design. The problem has been proved NP-complete and the fixed parameter solvability has been known in the literature. This paper presents several polynomial-time algorithms for special graph families, such as split graphs, co-bipartite graphs, chordal graphs, and permutation graphs.
{"title":"Graph Bipartization Problem with Applications to Via Minimization in VLSI Design","authors":"Lan Lin, Yixun Lin","doi":"10.1142/s0129054122500198","DOIUrl":"https://doi.org/10.1142/s0129054122500198","url":null,"abstract":"The bipartization problem for a graph [Formula: see text] asks for finding a subset [Formula: see text] of [Formula: see text] such that the induced subgraph [Formula: see text] is bipartite and [Formula: see text] is maximized. This problem has significant applications in the via minimization of VLSI design. The problem has been proved NP-complete and the fixed parameter solvability has been known in the literature. This paper presents several polynomial-time algorithms for special graph families, such as split graphs, co-bipartite graphs, chordal graphs, and permutation graphs.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134535229","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-18DOI: 10.1142/s0129054122500162
V. Aytaç, T. Turacı
In several different applications and contexts, networks are essential frameworks and appear.Vulnerability value is a measure of the network’s durability in the face of damage that may lead to a reduction or complete loss of the network’s particular functionality. The domination number and it’s types can be used network vulnerability parameters. Recently, the disjunctive total domination number has been defined by Henning and Naicker. In this paper, the disjunctive total domination numbers of the transformation graph [Formula: see text] when [Formula: see text] of some graphs [Formula: see text] have been obtained. Furthermore, some new general results have been given for the parameter mentioned above.
{"title":"Analysis of Vulnerability of Some Transformation Networks","authors":"V. Aytaç, T. Turacı","doi":"10.1142/s0129054122500162","DOIUrl":"https://doi.org/10.1142/s0129054122500162","url":null,"abstract":"In several different applications and contexts, networks are essential frameworks and appear.Vulnerability value is a measure of the network’s durability in the face of damage that may lead to a reduction or complete loss of the network’s particular functionality. The domination number and it’s types can be used network vulnerability parameters. Recently, the disjunctive total domination number has been defined by Henning and Naicker. In this paper, the disjunctive total domination numbers of the transformation graph [Formula: see text] when [Formula: see text] of some graphs [Formula: see text] have been obtained. Furthermore, some new general results have been given for the parameter mentioned above.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126430345","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-04DOI: 10.1142/s0129054122420084
Feng Shi, X. Hu
This paper uses multi-sensor data fusion technology to design and develop a multi-sensor based basketball robot’s target recognition and positioning system in an unknown environment. We establish the movement model of the basketball robot, and combine the hardware configuration of the basketball robot, analyse the methods of speed control, position control, and direction control, propose a fuzzy obstacle avoidance strategy in the basketball robot movement process, and simulate the obstacle avoidance strategy. The simulation results show that the proposed fuzzy obstacle avoidance strategy is effective. Carry out the experiment of basketball robot target calibration, build the basketball robot monitoring system, and realize data transmission and real-time image processing. Experiments show that the basketball robot can achieve target recognition and positioning tasks in an unknown environment (obstacle comparison rules). It proves the effectiveness and robustness of the proposed following algorithm. It illustrates the effectiveness of the system designed in this paper.
{"title":"Fuzzy Dynamic Obstacle Avoidance Algorithm for Basketball Robot Based on Multi-Sensor Data Fusion Technology","authors":"Feng Shi, X. Hu","doi":"10.1142/s0129054122420084","DOIUrl":"https://doi.org/10.1142/s0129054122420084","url":null,"abstract":"This paper uses multi-sensor data fusion technology to design and develop a multi-sensor based basketball robot’s target recognition and positioning system in an unknown environment. We establish the movement model of the basketball robot, and combine the hardware configuration of the basketball robot, analyse the methods of speed control, position control, and direction control, propose a fuzzy obstacle avoidance strategy in the basketball robot movement process, and simulate the obstacle avoidance strategy. The simulation results show that the proposed fuzzy obstacle avoidance strategy is effective. Carry out the experiment of basketball robot target calibration, build the basketball robot monitoring system, and realize data transmission and real-time image processing. Experiments show that the basketball robot can achieve target recognition and positioning tasks in an unknown environment (obstacle comparison rules). It proves the effectiveness and robustness of the proposed following algorithm. It illustrates the effectiveness of the system designed in this paper.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125015066","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-06-30DOI: 10.1142/s0129054122500150
Mingzu Zhang, Hongxi Liu, Pingping Li
In the contemporary world, to meet the increasing need to deal with massive data, the interconnection networks for large-scale parallel and distributed systems need to expand for stronger scalability requirements. Let [Formula: see text] be a recursive [Formula: see text]-dimensional network. Since the presence of faulty links or processors may disconnect the entire network, one hopes that every remaining processor lies in an undamaged lower-dimensional subnetwork. Under this circumstance, in 2012, Yang and Wang first proposed the conception of [Formula: see text]-embedded edge-connectivity [Formula: see text] of [Formula: see text], which is defined as the minimum number of links whose removal results in several disconnected components, and each processor is contained in an [Formula: see text]-dimensional subnetwork [Formula: see text]. The augmented cube, denoted by [Formula: see text], proposed by Choudum and Sunitha, is a momentous variant of the hypercube as an interconnection topology of parallel computing. It retains many favorable properties of the hypercube and possesses several embedded properties that the hypercube and other variations do not have. For [Formula: see text] and [Formula: see text], this paper determines [Formula: see text]-embedded edge-connectivity of [Formula: see text]-dimensional augmented cube, [Formula: see text], and shows exact values [Formula: see text], where [Formula: see text] if [Formula: see text], and [Formula: see text] otherwise. The parameters can provide more accurate measurements for the reliability and fault-tolerance of the corresponding systems.
{"title":"Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks","authors":"Mingzu Zhang, Hongxi Liu, Pingping Li","doi":"10.1142/s0129054122500150","DOIUrl":"https://doi.org/10.1142/s0129054122500150","url":null,"abstract":"In the contemporary world, to meet the increasing need to deal with massive data, the interconnection networks for large-scale parallel and distributed systems need to expand for stronger scalability requirements. Let [Formula: see text] be a recursive [Formula: see text]-dimensional network. Since the presence of faulty links or processors may disconnect the entire network, one hopes that every remaining processor lies in an undamaged lower-dimensional subnetwork. Under this circumstance, in 2012, Yang and Wang first proposed the conception of [Formula: see text]-embedded edge-connectivity [Formula: see text] of [Formula: see text], which is defined as the minimum number of links whose removal results in several disconnected components, and each processor is contained in an [Formula: see text]-dimensional subnetwork [Formula: see text]. The augmented cube, denoted by [Formula: see text], proposed by Choudum and Sunitha, is a momentous variant of the hypercube as an interconnection topology of parallel computing. It retains many favorable properties of the hypercube and possesses several embedded properties that the hypercube and other variations do not have. For [Formula: see text] and [Formula: see text], this paper determines [Formula: see text]-embedded edge-connectivity of [Formula: see text]-dimensional augmented cube, [Formula: see text], and shows exact values [Formula: see text], where [Formula: see text] if [Formula: see text], and [Formula: see text] otherwise. The parameters can provide more accurate measurements for the reliability and fault-tolerance of the corresponding systems.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"53 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123878100","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-06-11DOI: 10.1142/s0129054122420023
Salisu Ibrahim
In 2020 world commonly faced a kind of epidemic virus, which is known as COVID-19 and it was the reason of many people’s death in the world that leads to hard economic situation all over the country, also Iraq was part of the infected country most especially Erbil. Data was collected for the months of July, August, and September regarding the test, positive, recovery, and dead results for covid-19 cases in Erbil, Iraq. Based on the obtained data’s, new modified Lagrange Interpolating polynomial method was derived and proof. The modified Lagrange interpolation polynomial method is very important tool for analyzing, predicting, forecasting, and interpolating high-order polynomials. Moreover, we model, predict, and investigate the test, positive, recovery, and dead results for covid-19 cases in Erbil, Iraq within certain period of time. Our results are well validated and supported by MATLAB.
{"title":"Mathematical Modelling and Computational Analysis of Covid-19 Epidemic in Erbil Kurdistan Using Modified Lagrange Interpolating Polynomial","authors":"Salisu Ibrahim","doi":"10.1142/s0129054122420023","DOIUrl":"https://doi.org/10.1142/s0129054122420023","url":null,"abstract":"In 2020 world commonly faced a kind of epidemic virus, which is known as COVID-19 and it was the reason of many people’s death in the world that leads to hard economic situation all over the country, also Iraq was part of the infected country most especially Erbil. Data was collected for the months of July, August, and September regarding the test, positive, recovery, and dead results for covid-19 cases in Erbil, Iraq. Based on the obtained data’s, new modified Lagrange Interpolating polynomial method was derived and proof. The modified Lagrange interpolation polynomial method is very important tool for analyzing, predicting, forecasting, and interpolating high-order polynomials. Moreover, we model, predict, and investigate the test, positive, recovery, and dead results for covid-19 cases in Erbil, Iraq within certain period of time. Our results are well validated and supported by MATLAB.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128613849","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-06-10DOI: 10.1142/s0129054122500149
C. Dangalchev
The additional closeness is a very important characteristic of graphs. It measures the maximal closeness of a graph after adding a new link and it is an indication of the growth potential of graphs’ closeness. Most of the time calculating the additional closeness requires solving nontrivial optimization problems. In this article, the additional closenesses of cycles, gear, and some other graphs are calculated. Bounds for additional closeness of graphs are discussed.
{"title":"Additional Closeness of Cycle Graphs","authors":"C. Dangalchev","doi":"10.1142/s0129054122500149","DOIUrl":"https://doi.org/10.1142/s0129054122500149","url":null,"abstract":"The additional closeness is a very important characteristic of graphs. It measures the maximal closeness of a graph after adding a new link and it is an indication of the growth potential of graphs’ closeness. Most of the time calculating the additional closeness requires solving nontrivial optimization problems. In this article, the additional closenesses of cycles, gear, and some other graphs are calculated. Bounds for additional closeness of graphs are discussed.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115511749","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-06-10DOI: 10.1142/s0129054122420060
Kun Li, Yanjun Chen
This paper is based on fuzzy clustering algorithm on financial data, design of financial data mining system and analysis of financial data, analysis of financial data on the financial decision-making mechanism, from financial data how to enhance the information base of the forecast, financial data how to improve the pertinence of decision-making, financial data how to build a new competitive advantage, financial data how to promote the dynamic decision-making of four, through the analysis of data in financial decision-making specific implementation cases, focusing on the real-life problems faced by the management and the effect of financial data platform to solve problems; finally, through this paper, we hope to provide reference and reference for other similar enterprises to apply financial data for financial decision-making. This paper first describes the theory of financial data, analyzes the mechanism of financial data and financial decision-making, how financial data enhance the information base of forecasting, how financial data improve the pertinence of decision-making, how financial data build a new competitive advantage, how financial data promote dynamic decision-making four dimensions to summarize.
{"title":"Fuzzy Clustering-Based Financial Data Mining System Analysis and Design","authors":"Kun Li, Yanjun Chen","doi":"10.1142/s0129054122420060","DOIUrl":"https://doi.org/10.1142/s0129054122420060","url":null,"abstract":"This paper is based on fuzzy clustering algorithm on financial data, design of financial data mining system and analysis of financial data, analysis of financial data on the financial decision-making mechanism, from financial data how to enhance the information base of the forecast, financial data how to improve the pertinence of decision-making, financial data how to build a new competitive advantage, financial data how to promote the dynamic decision-making of four, through the analysis of data in financial decision-making specific implementation cases, focusing on the real-life problems faced by the management and the effect of financial data platform to solve problems; finally, through this paper, we hope to provide reference and reference for other similar enterprises to apply financial data for financial decision-making. This paper first describes the theory of financial data, analyzes the mechanism of financial data and financial decision-making, how financial data enhance the information base of forecasting, how financial data improve the pertinence of decision-making, how financial data build a new competitive advantage, how financial data promote dynamic decision-making four dimensions to summarize.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125592650","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-06-10DOI: 10.1142/s0129054122420035
Aldosary Saad, Abdullah Alharbi
Cyber-physical systems in a smart city environment offer secure computations in addition to robust resources and secure information exchanges. From the security aspect, the selection of legitimate computing resources is considered the most trustworthy measure for preserving user and data privacy. However, the outlier information results in false computations and time-consuming privacy measures for smart city users. This article introduces the Computation Annealed Selection Process (CASP) for combating outlier information in cyber-physical system networks. This process is assimilated with different infrastructure units in the smart city in an adaptable fashion. The adaptive measure administers information and user privacy through mutual time-key-based authentication. Information privacy is endured until the smart city provider provides a valid service interval. W2The service interval is evaluated for its consistency in maintaining the privacy and is validated using decision-tree learning. The decision tree performs interval classification and key assignment recommendations. Based on the decisions, the privacy is either prolonged or withdrawn for the information exchanged between the users and service providers. This process is repeated until the end of the service interval, identifying the outlier information in legitimate intervals. The proposed process improves detection, legitimacy rate, interval time, and interval rate by 7.57%, 10.4%, 13.15%, and 7.59%, respectively.
{"title":"Securing Smart City Services in Cyber-Physical Systems Using the Computation Annealed Selection Process","authors":"Aldosary Saad, Abdullah Alharbi","doi":"10.1142/s0129054122420035","DOIUrl":"https://doi.org/10.1142/s0129054122420035","url":null,"abstract":"Cyber-physical systems in a smart city environment offer secure computations in addition to robust resources and secure information exchanges. From the security aspect, the selection of legitimate computing resources is considered the most trustworthy measure for preserving user and data privacy. However, the outlier information results in false computations and time-consuming privacy measures for smart city users. This article introduces the Computation Annealed Selection Process (CASP) for combating outlier information in cyber-physical system networks. This process is assimilated with different infrastructure units in the smart city in an adaptable fashion. The adaptive measure administers information and user privacy through mutual time-key-based authentication. Information privacy is endured until the smart city provider provides a valid service interval. W2The service interval is evaluated for its consistency in maintaining the privacy and is validated using decision-tree learning. The decision tree performs interval classification and key assignment recommendations. Based on the decisions, the privacy is either prolonged or withdrawn for the information exchanged between the users and service providers. This process is repeated until the end of the service interval, identifying the outlier information in legitimate intervals. The proposed process improves detection, legitimacy rate, interval time, and interval rate by 7.57%, 10.4%, 13.15%, and 7.59%, respectively.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125181526","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
扫码关注我们
求助内容：
应助结果提醒方式：