Journal of Computer and System Sciences最新文献_第7页

The maximal coordination principle in regulatory Boolean networks 调控布尔网络中的最大协调原则

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2024-01-17 DOI: 10.1016/j.jcss.2024.103518

Alexis Poindron

引用次数: 0

On coresets for fair clustering in metric and Euclidean spaces and their applications 论公设空间和欧几里得空间中公平聚类的内核及其应用

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2024-01-11 DOI: 10.1016/j.jcss.2024.103506

Sayan Bandyapadhyay , Fedor V. Fomin , Kirill Simonov

{"title":"On coresets for fair clustering in metric and Euclidean spaces and their applications","authors":"Sayan Bandyapadhyay , Fedor V. Fomin , Kirill Simonov","doi":"10.1016/j.jcss.2024.103506","DOIUrl":"10.1016/j.jcss.2024.103506","url":null,"abstract":"<div>Fair clustering is a constrained clustering problem where we need to partition a set of colored points. The fraction of points of each color in every cluster should be more or less equal to the fraction of points of this color in the dataset. The problem was recently introduced by Chierichetti et al. (2017) [1]. We propose a new construction of coresets for fair clustering for Euclidean and general metrics based on random sampling. For the Euclidean space <math><msup><mrow><mi>R</mi></mrow><mrow><mi>d</mi></mrow></msup></math>, we provide the first coreset whose size does not depend exponentially on the dimension d. The question of whether such constructions exist was asked by Schmidt et al. (2019) [2] and Huang et al. (2019) [5]. For general metrics, our construction provides the first coreset for fair clustering. New coresets appear to be a handy tool for designing better approximation and streaming algorithms for fair and other constrained clustering variants.</div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"142 ","pages":"Article 103506"},"PeriodicalIF":1.1,"publicationDate":"2024-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0022000024000011/pdfft?md5=8effb294ac14fcc95086200a05194229&pid=1-s2.0-S0022000024000011-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139423640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) 第一届动态网络算法基础学术研讨会特刊(SAND 2022)

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2023-12-06 DOI: 10.1016/j.jcss.2023.103503

James Aspnes (Guest Editor and SAND 2022 Program Chair), Othon Michail

引用次数: 0

PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data 带有公共未标记数据的非交互式局部差分隐私模型中的PAC学习半空间

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2023-12-06 DOI: 10.1016/j.jcss.2023.103496

Jinyan Su , Jinhui Xu , Di Wang

引用次数: 0

Blackout-tolerant temporal spanners 耐受停电的时间扳手

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2023-12-04 DOI: 10.1016/j.jcss.2023.103495

Davide Bilò , Gianlorenzo D'Angelo , Luciano Gualà , Stefano Leucci , Mirko Rossi

{"title":"Blackout-tolerant temporal spanners","authors":"Davide Bilò , Gianlorenzo D'Angelo , Luciano Gualà , Stefano Leucci , Mirko Rossi","doi":"10.1016/j.jcss.2023.103495","DOIUrl":"10.1016/j.jcss.2023.103495","url":null,"abstract":"<div>We introduce the notions of blackout-tolerant temporal α-spanner of a temporal graph G which is a subgraph of G that preserves the distances between pairs of vertices of interest in G up to a multiplicative factor of α, even when the graph edges at a single time-instant become unavailable. In particular, we consider the single-source, single-pair, and all-pairs cases and, for each case we look at three quality requirements: exact distances (i.e., <math><mi>α</mi><mo>=</mo><mn>1</mn></math>), almost-exact distances (i.e., <math><mi>α</mi><mo>=</mo><mn>1</mn><mo>+</mo><mi>ε</mi></math> for an arbitrarily small constant <math><mi>ε</mi><mo>></mo><mn>0</mn></math>), and connectivity (i.e., unbounded α). We provide almost tight bounds on the size of such spanners for general temporal graphs and for temporal cliques, showing that they are either very sparse (i.e., they have <math><mover><mrow><mi>O</mi></mrow><mrow><mo>˜</mo></mrow></mover><mo>(</mo><mi>n</mi><mo>)</mo></math> edges) or they must have size <math><mi>Ω</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math> in the worst case, where n is the number of vertices of G. We also investigate multiple blackouts and k-edge fault-tolerant temporal spanners.</div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"141 ","pages":"Article 103495"},"PeriodicalIF":1.1,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0022000023001009/pdfft?md5=35a28914507288d7957b1fcfa27d6087&pid=1-s2.0-S0022000023001009-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138493942","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Lifting query complexity to time-space complexity for two-way finite automata 将双向有限自动机的查询复杂度提升为时空复杂度

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2023-12-04 DOI: 10.1016/j.jcss.2023.103494

Shenggen Zheng , Yaqiao Li , Minghua Pan , Jozef Gruska , Lvzhou Li

{"title":"Lifting query complexity to time-space complexity for two-way finite automata","authors":"Shenggen Zheng , Yaqiao Li , Minghua Pan , Jozef Gruska , Lvzhou Li","doi":"10.1016/j.jcss.2023.103494","DOIUrl":"10.1016/j.jcss.2023.103494","url":null,"abstract":"<div>Time-space tradeoff has been studied in a variety of models, such as Turing machines, branching programs, and finite automata, etc. While communication complexity as a technique has been applied to study finite automata, it seems it has not been used to study time-space tradeoffs of finite automata. We design a new technique showing that separations of query complexity can be lifted, via communication complexity, to separations of time-space complexity of two-way finite automata. As an application, one of our main results exhibits the first example of a language L such that the time-space complexity of two-way probabilistic finite automata with a bounded error (2PFA) is <math><mover><mrow><mi>Ω</mi></mrow><mrow><mo>˜</mo></mrow></mover><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math>, while of exact two-way quantum finite automata with classical states (2QCFA) is <math><mover><mrow><mi>O</mi></mrow><mrow><mo>˜</mo></mrow></mover><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>5</mn><mo>/</mo><mn>3</mn></mrow></msup><mo>)</mo></math>, that is, we demonstrate for the first time that exact quantum computing has an advantage in time-space complexity comparing to classical computing.</div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"141 ","pages":"Article 103494"},"PeriodicalIF":1.1,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138493943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Corrigendum to “Prediction, learning, uniform convergence, and scale-sensitive dimensions” [J. Comput. Syst. Sci. 56 (2) (1998) 174–190] “预测、学习、一致收敛和尺度敏感维度”的更正[J]。第一版。系统。科学56 (2)(1998)174-190]

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2023-11-09 DOI: 10.1016/j.jcss.2023.103465

Peter L. Bartlett , Philip M. Long

引用次数: 0

Solving problems on generalized convex graphs via mim-width 利用极小宽度求解广义凸图问题

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2023-11-07 DOI: 10.1016/j.jcss.2023.103493

Flavia Bonomo-Braberman , Nick Brettell , Andrea Munaro , Daniël Paulusma

{"title":"Solving problems on generalized convex graphs via mim-width","authors":"Flavia Bonomo-Braberman , Nick Brettell , Andrea Munaro , Daniël Paulusma","doi":"10.1016/j.jcss.2023.103493","DOIUrl":"https://doi.org/10.1016/j.jcss.2023.103493","url":null,"abstract":"<div>A bipartite graph <math><mi>G</mi><mo>=</mo><mo>(</mo><mi>A</mi><mo>,</mo><mi>B</mi><mo>,</mo><mi>E</mi><mo>)</mo></math> is <math><mi>H</mi></math>-convex for some family of graphs <math><mi>H</mi></math> if there exists a graph <math><mi>H</mi><mo>∈</mo><mi>H</mi></math> with <math><mi>V</mi><mo>(</mo><mi>H</mi><mo>)</mo><mo>=</mo><mi>A</mi></math> such that the neighbours in A of each <math><mi>b</mi><mo>∈</mo><mi>B</mi></math> induce a connected subgraph of H. Many <math><mi>NP</mi></math>-complete problems are polynomial-time solvable for <math><mi>H</mi></math>-convex graphs when <math><mi>H</mi></math> is the set of paths. The underlying reason is that the class has bounded mim-width. We extend this result to families of <math><mi>H</mi></math>-convex graphs where <math><mi>H</mi></math> is the set of cycles, or <math><mi>H</mi></math> is the set of trees with bounded maximum degree and a bounded number of vertices of degree at least 3. As a consequence, we strengthen many known results via one general and short proof. We also show that the mim-width of <math><mi>H</mi></math>-convex graphs is unbounded if <math><mi>H</mi></math> is the set of trees with arbitrarily large maximum degree or an arbitrarily large number of vertices of degree at least 3.</div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"140 ","pages":"Article 103493"},"PeriodicalIF":1.1,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0022000023000983/pdfft?md5=fde8f2dacccba7a95013faa87b835770&pid=1-s2.0-S0022000023000983-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134656790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Bounded incentives in manipulating the probabilistic serial rule 操纵概率序列规则的有限激励

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2023-10-28 DOI: 10.1016/j.jcss.2023.103491

Haoqiang Huang , Zihe Wang , Zhide Wei , Jie Zhang

引用次数: 0

Performance modeling and analysis for randomly walking mobile users with Markov chains 基于马尔可夫链的随机行走移动用户性能建模与分析

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2023-10-18 DOI: 10.1016/j.jcss.2023.103492

Keqin Li

引用次数: 0