International Journal of Foundations of Computer Science最新文献_第9页

The B-Prize-Collecting Multicut Problem in Paths, Spider Graphs and Rings 路径、蜘蛛图和环中的b奖收集多切问题

IF 0.8 4区计算机科学

International Journal of Foundations of Computer Science Pub Date : 2023-03-22 DOI: 10.1142/s0129054123460012

Xiaofei Liu, Weidong Li

{"title":"The B-Prize-Collecting Multicut Problem in Paths, Spider Graphs and Rings","authors":"Xiaofei Liu, Weidong Li","doi":"10.1142/s0129054123460012","DOIUrl":"https://doi.org/10.1142/s0129054123460012","url":null,"abstract":"Given a graph [Formula: see text], a set of [Formula: see text] source-sink pairs [Formula: see text] [Formula: see text] and a profit bound [Formula: see text], every edge [Formula: see text] has a cost [Formula: see text], and every source-sink pair [Formula: see text] has a profit [Formula: see text] and a penalty [Formula: see text]. The [Formula: see text]-prize-collecting multicut problem ([Formula: see text]-PCMP) is to find a multicut [Formula: see text] such that the objective cost, which consists of the total cost of the edges in [Formula: see text] and the total penalty of the pairs still connected after removing [Formula: see text], is minimized and the total profit of the disconnected pairs by removing [Formula: see text] is at least [Formula: see text]. In this paper, we firstly consider the [Formula: see text]-PCMP in paths, and prove that it is [Formula: see text]-hard even when [Formula: see text] for any [Formula: see text]. Then, we present a fully polynomial time approximation scheme (FPTAS) whose running time is [Formula: see text] for the [Formula: see text]-PCMP in paths. Based on this algorithm, we present an FPTAS whose running time is [Formula: see text] for the [Formula: see text]-PCMP in spider graphs, and an FPTAS whose running time is [Formula: see text] for the [Formula: see text]-PCMP in rings, respectively, where [Formula: see text] is the number of leaves of spider graph.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45350162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Node and Link Vulnerability in Complete Multipartite Networks 完全多方网络中的节点和链路漏洞

IF 0.8 4区计算机科学

International Journal of Foundations of Computer Science Pub Date : 2023-03-21 DOI: 10.1142/s0129054123500077

Zeynep Nihan Berberler, A. Aytaç

引用次数: 2

The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case 由级联积引起的语言状态复杂性的范围-一元情况

IF 0.8 4区计算机科学

International Journal of Foundations of Computer Science Pub Date : 2023-03-18 DOI: 10.1142/s0129054123430049

M. Holzer, C. Rauch

引用次数: 1

Linear Codes and Linear Complementary Pairs of Codes Over a Non-Chain Ring 非链环上的线性码和线性互补码对

IF 0.8 4区计算机科学

International Journal of Foundations of Computer Science Pub Date : 2023-03-14 DOI: 10.1142/s012905412350003x

Xiangdong Cheng, X. Cao, Liqin Qian

引用次数: 0

Ambiguity Hierarchies for Weighted Tree Automata 加权树自动机的歧义层次

4区计算机科学

International Journal of Foundations of Computer Science Pub Date : 2023-03-02 DOI: 10.1142/s0129054123430013

Andreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht

引用次数: 0

Preface 前言

IF 0.8 4区计算机科学

International Journal of Foundations of Computer Science Pub Date : 2023-02-23 DOI: 10.1142/s0129054123020021

Sebastian Maneth

引用次数: 0

Hamiltonian-Based Efficient Algorithms for Legalization with Neighbor Diffusion Effect 基于哈密顿量的具有邻居扩散效应的合法化有效算法

IF 0.8 4区计算机科学

International Journal of Foundations of Computer Science Pub Date : 2023-02-16 DOI: 10.1142/s0129054122460108

Hao Sun, Longkun Guo, Xiaoyan Zhang

{"title":"Hamiltonian-Based Efficient Algorithms for Legalization with Neighbor Diffusion Effect","authors":"Hao Sun, Longkun Guo, Xiaoyan Zhang","doi":"10.1142/s0129054122460108","DOIUrl":"https://doi.org/10.1142/s0129054122460108","url":null,"abstract":"Neighbor diffusion effect (NDE) is a crucial aspect in advanced technology node that is well-known for its infamous consequence of significant performance decrement of the circuit. In this paper, we observe that NDE is caused by different diffusion heights (the number of fins) between two adjacent cells, and consider reducing the number of height differences in single row to reduce NDE violations. Ignoring the movement of the cells, we first propose a Hamiltonian-completion-based algorithm that reorders the cells in the row such that the number of NDE violations is reduced to a near-optimal value. Then, for a given fixed integer [Formula: see text], we devise an algorithm to compute the new positions of cells, such that the number of NDE violations is bounded by [Formula: see text] and the maximum displacement is minimized. Moreover, we extend our algorithm for legalization in multiple rows against mixed-height cells. Experimental results show that our algorithm reduces the NDE violations to a near-optimal minimum without any area overheads while achieving a better practical running time compared to baselines conforming with the theoretical analysis.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44766452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Novel Image Clustering Algorithm Based on Supported Nearest Neighbors 一种新的基于支持近邻的图像聚类算法

IF 0.8 4区计算机科学

International Journal of Foundations of Computer Science Pub Date : 2023-02-08 DOI: 10.1142/s0129054122460017

Lin Li, Feng Zhang, Jiashuai Zhang, Qiang Hua, Chun-Ru Dong, C. Lim

{"title":"A Novel Image Clustering Algorithm Based on Supported Nearest Neighbors","authors":"Lin Li, Feng Zhang, Jiashuai Zhang, Qiang Hua, Chun-Ru Dong, C. Lim","doi":"10.1142/s0129054122460017","DOIUrl":"https://doi.org/10.1142/s0129054122460017","url":null,"abstract":"Unsupervised image clustering is a challenging task in computer vision. Recently, various deep clustering algorithms based on contrastive learning have achieved promising performance and some distinguishable features representation were obtained only by taking different augmented views of same image as positive pairs and maximizing their similarities, whereas taking other images’ augmentations in the same batch as negative pairs and minimizing their similarities. However, due to the fact that there is more than one image in a batch belong to the same class, simply pushing the negative instances apart will result in inter-class conflictions and lead to the clustering performance degradation. In order to solve this problem, we propose a deep clustering algorithm based on supported nearest neighbors (SNDC), which constructs positive pairs of current images by maintaining a support set and find its k nearest neighbors from the support set. By going beyond single instance positive, SNDC can learn more generalized features representation with inherent semantic meaning and therefore alleviating inter-class conflictions. Experimental results on multiple benchmark datasets show that the performance of SNDC is superior to the state-of-the-art clustering models, with accuracy improvement of 6.2% and 20.5% on CIFAR-10 and ImageNet-Dogs respectively.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48434727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Influential Node Identification of Network Based on Agglomeration Operation 基于聚集运算的网络影响节点识别

IF 0.8 4区计算机科学

International Journal of Foundations of Computer Science Pub Date : 2023-02-08 DOI: 10.1142/s0129054123500028

Baohua Niu, Shuming Zhou, Hong Zhang

引用次数: 0

Balanced Even-Variable Rotation Symmetric Boolean Functions with Optimal Algebraic Immunity, Maximum Algebraic Degree and Higher Nonlinearity 具有最优代数免疫、最大代数度和高非线性的平衡偶变旋转对称布尔函数

IF 0.8 4区计算机科学

International Journal of Foundations of Computer Science Pub Date : 2023-02-06 DOI: 10.1142/s0129054123500016

Fei Guo, Zilong Wang

{"title":"Balanced Even-Variable Rotation Symmetric Boolean Functions with Optimal Algebraic Immunity, Maximum Algebraic Degree and Higher Nonlinearity","authors":"Fei Guo, Zilong Wang","doi":"10.1142/s0129054123500016","DOIUrl":"https://doi.org/10.1142/s0129054123500016","url":null,"abstract":"Rotation symmetric Boolean functions are good candidates for stream ciphers because they have such advantages as simple structure, high operational speed and low implement cost. Recently, Mesnager et al. proposed for the first time an efficient method to construct balanced rotation symmetric Boolean functions with optimal algebraic immunity and good nonlinearity for an arbitrary even number of variables. However, the algebraic degree of their constructed [Formula: see text]-variable ([Formula: see text]) function is always less than the maximum value [Formula: see text]. In this paper, by modifying the support of Boolean functions from Mesnager et al.’s construction, we present two new constructions of balanced even-variable rotation symmetric Boolean functions with optimal algebraic immunity as well as higher algebraic degree and nonlinearity. The algebraic degree of Boolean functions in the first construction reaches the maximum value [Formula: see text] if [Formula: see text] is odd and [Formula: see text] or [Formula: see text] for integer [Formula: see text], while that of the second construction reaches the maximum value for all [Formula: see text]. Moreover, the nonlinearities of Boolean functions in both two constructions are higher than that of Mesnager et al.’s construction.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47867507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0