Theor. Comput. Sci.最新文献_第2页

Quantitative estimates for the size of an intersection of sparse automatic sets 稀疏自动集交点大小的定量估计

Theor. Comput. Sci. Pub Date : 2023-04-18 DOI: 10.48550/arXiv.2304.09223

Seda Albayrak, J. Bell

引用次数: 1

Variety of mutual-visibility problems in graphs 图中各种互可见性问题

Theor. Comput. Sci. Pub Date : 2023-04-03 DOI: 10.48550/arXiv.2304.00864

Searfino Cicerone, G. Stefano, Lara Drozek, J. Hedžet, S. Klavžar, I. Yero

引用次数: 4

Parameterized Complexity of Perfectly Matched Sets 完全匹配集的参数化复杂度

Theor. Comput. Sci. Pub Date : 2023-04-01 DOI: 10.2139/ssrn.4289703

A. Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, Abhishek Sahu

{"title":"Parameterized Complexity of Perfectly Matched Sets","authors":"A. Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, Abhishek Sahu","doi":"10.2139/ssrn.4289703","DOIUrl":"https://doi.org/10.2139/ssrn.4289703","url":null,"abstract":"For an undirected graph G , a pair of vertex disjoint subsets p A, B q is a pair of perfectly matched sets if each vertex in A (resp. B ) has exactly one neighbor in B (resp. A ). In the above, the size of the pair is | A | ( “ | B | ). Given a graph G and a positive integer k , the Perfectly Matched Sets problem asks whether there exists a pair of perfectly matched sets of size at least k in G . This problem is known to be NP -hard on planar graphs and W[1] -hard on general graphs, when parameterized by k . However, little is known about the parameterized complexity of the problem in restricted graph classes. In this work, we study the problem parameterized by k , and design FPT algorithms for: i) apex-minor-free graphs running in time 2 O p? k q ¨ n O p 1 q , and ii) K b,b -free graphs. We obtain a linear kernel for planar graphs and k O p d q -sized kernel for d -degenerate graphs. It is known that the problem is W[1] -hard on chordal graphs, in fact on split graphs, parameterized by k . We complement this hardness result by designing a polynomial-time algorithm for interval graphs. 2012 ACM Subject Classification Theory of computation Ñ Fixed parameter tractability","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"208 1","pages":"113861"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76425477","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}

引用次数: 0

Combining decomposition approaches for the Maximum Weight Stable Set problem 最大权稳定集问题的组合分解方法

Theor. Comput. Sci. Pub Date : 2023-04-01 DOI: 10.2139/ssrn.4055778

A. Brandstädt, R. Mosca

引用次数: 0

Transformation and Classification of Ordinal Survey Data 有序测量数据的转换与分类

Theor. Comput. Sci. Pub Date : 2023-03-10 DOI: 10.7494/csci.2023.24.2.4871

Roopam Sadh, Rajeev Kumar

引用次数: 0

Hybrid End-to-End Approach Integrating Online Learning with Face-identification System 集成在线学习与人脸识别系统的混合端到端方法

Theor. Comput. Sci. Pub Date : 2023-03-10 DOI: 10.7494/csci.2023.24.2.4840

Son Van Nguyen, S. T. Nguyen, Anh Pham Thi Hong, Thao Thu Hoang, Ta Minh Thanh

{"title":"Hybrid End-to-End Approach Integrating Online Learning with Face-identification System","authors":"Son Van Nguyen, S. T. Nguyen, Anh Pham Thi Hong, Thao Thu Hoang, Ta Minh Thanh","doi":"10.7494/csci.2023.24.2.4840","DOIUrl":"https://doi.org/10.7494/csci.2023.24.2.4840","url":null,"abstract":"To date, facial recognition has been one of the most intriguing, interesting research topics over years. It requires some specific face-based algorithms such as facial detection, facial alignment, facial representation, and facial recognition as well; however, all of these algorithms derive from heavy deep learning architectures that cause limitations for development, scalability, flawed accuracy, and deployment into publicity with mere CPU servers. It also calls for large datasets containing hundreds of thousands of records for training purposes. In this paper, we propose a full pipeline for an effective face recognition application which only uses a small Vietnamese celebrity dataset and CPU for training that can solve the leakage of data and the need for GPU devices. It is based on a face vector-to-string tokens algorithm then saves face’s properties into Elasticsearch for future retrieval, so the problem of online learning in Facial Recognition is also tackled. Comparison with another popular algorithm on the dataset, our proposed pipeline not only outweighs the accuracy counterpart, but it also achieves a very speedy time inference for a real-time face recognition application.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"13 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85661986","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}

引用次数: 0

Deep Convolutional Neural Network using a New Dataset for Berber Language 基于柏柏尔语新数据集的深度卷积神经网络

Theor. Comput. Sci. Pub Date : 2023-03-10 DOI: 10.7494/csci.2023.24.2.4783

Mokrane Kemiche, Malika Sadou

引用次数: 0

Learning-Free Deep Features for Multispectral Palm-Print Classification 多光谱掌纹分类的免学习深度特征

Theor. Comput. Sci. Pub Date : 2023-03-10 DOI: 10.7494/csci.2023.24.2.4685

H. Bendjenna, Asma Aoun Allah, A. Meraoumia

引用次数: 0

Securing Centralized SDN control with Distributed Blockchain Technology 利用分布式区块链技术确保集中式SDN控制

Theor. Comput. Sci. Pub Date : 2023-03-06 DOI: 10.7494/csci.2023.24.1.4605

Suhail Ahmad, A. H. Mir

{"title":"Securing Centralized SDN control with Distributed Blockchain Technology","authors":"Suhail Ahmad, A. H. Mir","doi":"10.7494/csci.2023.24.1.4605","DOIUrl":"https://doi.org/10.7494/csci.2023.24.1.4605","url":null,"abstract":"Software Defined Networks (SDN) advocates segregation of network control logic, forwarding functions and management applications into different planes to achieve network programmability, automated and dynamic flow control in next generation networks. It promotes deployment of novel and augmented network management functions to have flexible, robust, scalable and cost-effective network deployments. All these features introduce new research challenges and require secure communication protocols among the segregated network planes. This manuscript focuses on the security issue of southbound interface which operates between the SDN control and data plane. We have highlighted the security threats associated with an unprotected southbound interface and the issues related with the existing TLS based security solution. A lightweight blockchain based decentralized security solution is proposed for southbound interface to secure the resources of logically centralized SDN controllers and distributed forwarding devices from opponents. The proposed mechanism can operate in multi-domain SDN deployment and can be used with wide range of network controllers and data plane devices. In addition to it, the proposed security solution is analyzed in terms of security features, communication and reauthentication overhead.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"49 5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76573691","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}

引用次数: 0

Complexity of (arc)-connectivity problems involving arc-reversals or deorientations 涉及电弧反转或定向的(电弧)连通性问题的复杂性

Theor. Comput. Sci. Pub Date : 2023-03-06 DOI: 10.2139/ssrn.4399506

J. Bang-Jensen, Florian Hörsch, M. Kriesell

{"title":"Complexity of (arc)-connectivity problems involving arc-reversals or deorientations","authors":"J. Bang-Jensen, Florian Hörsch, M. Kriesell","doi":"10.2139/ssrn.4399506","DOIUrl":"https://doi.org/10.2139/ssrn.4399506","url":null,"abstract":"By a well known theorem of Robbins, a graph $G$ has a strongly connected orientation if and only if $G$ is 2-edge-connected and it is easy to find, in linear time, either a cut edge of $G$ or a strong orientation of $G$. A result of Durand de Gevigny shows that for every $kgeq 3$ it is NP-hard to decide if a given graph $G$ has a $k$-strong orientation. Thomassen showed that one can check in polynomial time whether a given graph has a 2-strong orientation. This implies that for a given digraph $D$ we can determine in polynomial time whether we can reorient (=reverse) some arcs of $D=(V,A)$ to obtain a 2-strong digraph $D'=(V,A')$. This naturally leads to the question of determining the minimum number of such arcs to reverse before the resulting graph is 2-strong. In this paper we show that finding this number is NP-hard. If a 2-connected graph $G$ has no 2-strong orientation, we may ask how many of its edges we may orient so that the resulting mixed graph is still 2-strong. Similarly, we may ask for a 2-edge-connected graph $G$ how many of its edges we can orient such that the resulting mixed graph remains 2-arc-strong. We prove that when restricted to graphs satisfying suitable connectivity conditions, both of these problems are equivalent to finding the minimum number of edges we must double in a 2-edge-connected graph in order to obtain a 4-edge-connected graph. Using this, we show that all these three problems are NP-hard. Finally, we consider the operation of deorienting an arc $uv$ of a digraph $D$ meaning replacing it by an undirected edge between the same vertices. In terms of connectivity properties, this is equivalent to adding the opposite arc $vu$ to $D$. We prove that for every $ellgeq 3$ it is NP-hard to find the minimum number of arcs to deorient in a digraph $D$ in order to obtain an $ell$-strong digraph $D'$.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"45 1","pages":"114097"},"PeriodicalIF":0.0,"publicationDate":"2023-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87541928","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}

引用次数: 1