We give a new, stronger proof that there are only finitely many $k$-vertex-critical ($P_5$,~gem)-free graphs for all $k$. Our proof further refines the structure of these graphs and allows for the implementation of a simple exhaustive computer search to completely list all $6$- and $7$-vertex-critical $(P_5$, gem)-free graphs. Our results imply the existence of polynomial-time certifying algorithms to decide the $k$-colourability of $(P_5$, gem)-free graphs for all $k$ where the certificate is either a $k$-colouring or a $(k+1)$-vertex-critical induced subgraph. Our complete lists for $kle 7$ allow for the implementation of these algorithms for all $kle 6$.
{"title":"A refinement on the structure of vertex-critical (P5, gem)-free graphs","authors":"B. Cameron, C. Hoàng","doi":"10.2139/ssrn.4303315","DOIUrl":"https://doi.org/10.2139/ssrn.4303315","url":null,"abstract":"We give a new, stronger proof that there are only finitely many $k$-vertex-critical ($P_5$,~gem)-free graphs for all $k$. Our proof further refines the structure of these graphs and allows for the implementation of a simple exhaustive computer search to completely list all $6$- and $7$-vertex-critical $(P_5$, gem)-free graphs. Our results imply the existence of polynomial-time certifying algorithms to decide the $k$-colourability of $(P_5$, gem)-free graphs for all $k$ where the certificate is either a $k$-colouring or a $(k+1)$-vertex-critical induced subgraph. Our complete lists for $kle 7$ allow for the implementation of these algorithms for all $kle 6$.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"101 1","pages":"113936"},"PeriodicalIF":0.0,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85901760","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}
{"title":"Game theory analysis of biometric systems market: Users choice VS service providers revenue","authors":"S. Nemmaoui, Mohamed Baslam, B. Bouikhalene","doi":"10.2139/ssrn.4230135","DOIUrl":"https://doi.org/10.2139/ssrn.4230135","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"67 1","pages":"142-152"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73994498","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}
{"title":"Tractability beyond β-acyclicity for conjunctive queries with negation and SAT","authors":"Matthias Lanzinger","doi":"10.2139/ssrn.4132993","DOIUrl":"https://doi.org/10.2139/ssrn.4132993","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"1 1","pages":"276-296"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78712081","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-11-08DOI: 10.7494/csci.2022.23.4.4491
Sunil B. Hebbale, V. Akula, Parashuram Baraki
In today’s world, the transmission of secured and noiseless image is a difficult task. Therefore, effective strategies are important to secure the data or secret image from the attackers. Besides, denoising approaches are important to obtain noise-free images. For this, an effective crypto-steganography method based on Lightweight Encryption Algorithm (LEA) and Modified Least Significant Bit (MLSB) method for secured transmission is proposed. Moreover, a bilateral filter-based Whale Optimization Algorithm (WOA) is used for image denoising. Before image transmission, the secret image is encrypted by the LEA algorithm and embedded into the cover image using Discrete Wavelet Transform (DWT) and MLSB technique. After the image transmission, the extraction process is performed to recover the secret image. Finally, a bilateral filter-WOA is used to remove the noise from the secret image. The Verilog code for the proposed model is designed and simulated in Xilinx software. Finally, the simulation results show that the proposed filtering technique has superior performance than conventional bilateral filter and Gaussian filter in terms of Peak Signal to Noise Ratio (PSNR) and Structural Similarity Index Measure (SSIM).
{"title":"FPGA based secure and noiseless image transmission using LEA and optimized bilateral filter","authors":"Sunil B. Hebbale, V. Akula, Parashuram Baraki","doi":"10.7494/csci.2022.23.4.4491","DOIUrl":"https://doi.org/10.7494/csci.2022.23.4.4491","url":null,"abstract":"In today’s world, the transmission of secured and noiseless image is a difficult task. Therefore, effective strategies are important to secure the data or secret image from the attackers. Besides, denoising approaches are important to obtain noise-free images. For this, an effective crypto-steganography method based on Lightweight Encryption Algorithm (LEA) and Modified Least Significant Bit (MLSB) method for secured transmission is proposed. Moreover, a bilateral filter-based Whale Optimization Algorithm (WOA) is used for image denoising. Before image transmission, the secret image is encrypted by the LEA algorithm and embedded into the cover image using Discrete Wavelet Transform (DWT) and MLSB technique. After the image transmission, the extraction process is performed to recover the secret image. Finally, a bilateral filter-WOA is used to remove the noise from the secret image. The Verilog code for the proposed model is designed and simulated in Xilinx software. Finally, the simulation results show that the proposed filtering technique has superior performance than conventional bilateral filter and Gaussian filter in terms of Peak Signal to Noise Ratio (PSNR) and Structural Similarity Index Measure (SSIM).","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74335039","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-11-08DOI: 10.7494/csci.2022.23.4.4642
Lukasz Opiola, Kamil Jarosz, L. Dutka, R. Słota, J. Kitowski
Scientific and commercial endeavors could benefit from cross-organizational, decentralized collaboration, which becomes the key to innovation. This work addresses one of its challenges, namely efficient access control to assets for distributed data processing among autonomous data centers. We propose a group membership management framework dedicated for realizing access control in decentralized environments. Its novelty lies in a synergy of two concepts: a decentralized knowledge base and an incremental indexing scheme, both assuming a P2P architecture, where each peer retains autonomy and has full control over the choice of peers it cooperates with. The extent of exchanged information is reduced to the minimum required for user collaboration and assumes limited trust between peers. The indexing scheme is optimized for read-intensive scenarios by offering fast queries -- look-ups in precomputed indices. The index precomputation increases the complexity of update operations, but their performance is arguably sufficient for large organizations, as shown by conducted tests. We believe that our framework is a major contribution towards decentralized, cross-organizational collaboration.
{"title":"Group Membership Management Framework for Decentralized Collaborative Systems","authors":"Lukasz Opiola, Kamil Jarosz, L. Dutka, R. Słota, J. Kitowski","doi":"10.7494/csci.2022.23.4.4642","DOIUrl":"https://doi.org/10.7494/csci.2022.23.4.4642","url":null,"abstract":"Scientific and commercial endeavors could benefit from cross-organizational, decentralized collaboration, which becomes the key to innovation. This work addresses one of its challenges, namely efficient access control to assets for distributed data processing among autonomous data centers. We propose a group membership management framework dedicated for realizing access control in decentralized environments. Its novelty lies in a synergy of two concepts: a decentralized knowledge base and an incremental indexing scheme, both assuming a P2P architecture, where each peer retains autonomy and has full control over the choice of peers it cooperates with. The extent of exchanged information is reduced to the minimum required for user collaboration and assumes limited trust between peers. The indexing scheme is optimized for read-intensive scenarios by offering fast queries -- look-ups in precomputed indices. The index precomputation increases the complexity of update operations, but their performance is arguably sufficient for large organizations, as shown by conducted tests. We believe that our framework is a major contribution towards decentralized, cross-organizational collaboration.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"23 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82779396","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-11-08DOI: 10.7494/csci.2022.23.4.4375
A. Aggoune, Mohamed Sofiane Namoune
The object-relational databases (ORDB) are powerful for managing complex data, but they suffer from problems of scalability and managing large-scale data. Therefore, the importance of the migration of ORDB to NoSQL derives from the fact that the large volume of data can be handled in the best way with high scalability and availability. This paper reports our metadata-driven approach for the migration of the ORDB to document-oriented NoSQL database. Our data migration approach involves three major stages: a preprocessing stage, to extract the data and the schema's components, a processing stage, to provide the data transformation, and a post-processing stage, to store the migrated data as BSON documents. The approach maintains the benefits of Oracle ORDB in NoSQL MongoDB by supporting integrity constraint checking. To validate our approach, we developed OR2DOD (Object Relational to Document-Oriented Databases) system, and the experimental results confirm the effectiveness of our proposal.
对象关系数据库(ORDB)在管理复杂数据方面非常强大，但它们存在可伸缩性和管理大规模数据的问题。因此，将ORDB迁移到NoSQL的重要性源于这样一个事实，即可以以具有高可伸缩性和可用性的最佳方式处理大量数据。本文报告了将ORDB迁移到面向文档的NoSQL数据库的元数据驱动方法。我们的数据迁移方法包括三个主要阶段:预处理阶段(提取数据和模式组件)、处理阶段(提供数据转换)和后处理阶段(将迁移的数据存储为BSON文档)。这种方法通过支持完整性约束检查，在NoSQL MongoDB中保持了Oracle ORDB的优势。为了验证我们的方法，我们开发了OR2DOD (Object Relational To Document-Oriented Databases)系统，实验结果证实了我们的建议的有效性。
{"title":"Metadata-driven Data Migration from Object-relational Database to NoSQL Document-oriented Database","authors":"A. Aggoune, Mohamed Sofiane Namoune","doi":"10.7494/csci.2022.23.4.4375","DOIUrl":"https://doi.org/10.7494/csci.2022.23.4.4375","url":null,"abstract":"The object-relational databases (ORDB) are powerful for managing complex data, but they suffer from problems of scalability and managing large-scale data. Therefore, the importance of the migration of ORDB to NoSQL derives from the fact that the large volume of data can be handled in the best way with high scalability and availability. This paper reports our metadata-driven approach for the migration of the ORDB to document-oriented NoSQL database. Our data migration approach involves three major stages: a preprocessing stage, to extract the data and the schema's components, a processing stage, to provide the data transformation, and a post-processing stage, to store the migrated data as BSON documents. The approach maintains the benefits of Oracle ORDB in NoSQL MongoDB by supporting integrity constraint checking. To validate our approach, we developed OR2DOD (Object Relational to Document-Oriented Databases) system, and the experimental results confirm the effectiveness of our proposal.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"242 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74971000","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-11-08DOI: 10.7494/csci.2022.23.4.4616
Obed Campos, Pablo Pancardo García, J. Hernández-Nolasco
The crime rates in Mexico have been increasing in recent years, every day there are news on social media and in the news where assaults and verbal aggressions by criminals can be seen. Public transportation units suffer from violence that authorities have not been able to reduce, despite their efforts. That is why we have developed a fuzzy logic model that can adapt to almost any scenario thanks to the dynamism that we have implemented in each one of its stages. We have obtained promising results that we believe will be of great help to the authorities in the police headquarters to detect in real time the exact moment in which a verbal aggression typical of a violent assault is happening. This is a tool to help the authorities, not a substitution; making use of the latest technologies available to us.
{"title":"Dynamic Fuzzy Model to Detect Verbal Violence in Real Time","authors":"Obed Campos, Pablo Pancardo García, J. Hernández-Nolasco","doi":"10.7494/csci.2022.23.4.4616","DOIUrl":"https://doi.org/10.7494/csci.2022.23.4.4616","url":null,"abstract":"The crime rates in Mexico have been increasing in recent years, every day there are news on social media and in the news where assaults and verbal aggressions by criminals can be seen. Public transportation units suffer from violence that authorities have not been able to reduce, despite their efforts. That is why we have developed a fuzzy logic model that can adapt to almost any scenario thanks to the dynamism that we have implemented in each one of its stages. We have obtained promising results that we believe will be of great help to the authorities in the police headquarters to detect in real time the exact moment in which a verbal aggression typical of a violent assault is happening. This is a tool to help the authorities, not a substitution; making use of the latest technologies available to us.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"15 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77981109","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-11-08DOI: 10.7494/csci.2022.23.4.4588
Hichem Debbi
Event-B is a formal method used in the development of safety critical systems. However, these systems may introduce uncertainty, and need also to meet real-time requirements, which make their modeling and analysis a challenging task. Existing works on extending Event-B with probability and time did not address both probability and time in a single framework. Besides, they did focus the most on extending the language itself, not on integrating the extended Event-B with verification. In this paper, we aim to represent both probability and time in the Event-B language, and we will show how such a representation can be automatically translated into Probabilistic Timed Automata (PTA) described in the language of the probabilistic model checker PRISM. This translation would allow us to analyze probabilistic, as well as time-bounded probabilistic reachability properties of probabilistic real-time systems through the Probabilistic Timed CTL (PTCTL) logic.
{"title":"Modeling and Analysis of Probabilistic Real-time Systems through Integrating Event-B and Probabilistic Model Checking","authors":"Hichem Debbi","doi":"10.7494/csci.2022.23.4.4588","DOIUrl":"https://doi.org/10.7494/csci.2022.23.4.4588","url":null,"abstract":"Event-B is a formal method used in the development of safety critical systems. However, these systems may introduce uncertainty, and need also to meet real-time requirements, which make their modeling and analysis a challenging task. Existing works on extending Event-B with probability and time did not address both probability and time in a single framework. Besides, they did focus the most on extending the language itself, not on integrating the extended Event-B with verification. In this paper, we aim to represent both probability and time in the Event-B language, and we will show how such a representation can be automatically translated into Probabilistic Timed Automata (PTA) described in the language of the probabilistic model checker PRISM. This translation would allow us to analyze probabilistic, as well as time-bounded probabilistic reachability properties of probabilistic real-time systems through the Probabilistic Timed CTL (PTCTL) logic.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"59 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77717940","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
扫码关注我们
求助内容：
应助结果提醒方式：