检索结果-内蒙古大学图书馆

FEA-Sketch: flow entries assisted sketch for heavy flow detection in software-defined networking

science China(Information sciences) 2025年第3期68卷 80-94页

作者： Xiaocan WU He HUANG Yang DU Yu-E SUN Yifan HAN School of Computer Science and Technology Soochow University School of Rail Transportation Soochow University

Software-defined networking decouples the control plane from the data plane to enable centralized flow-level network management, while requiring periodically collecting traffic statistics from the data plane to enforce optimal management. As one of the most important traffic measurement tasks, heavy flow detection has received wide attention for its providing fundamental statistics in various practical applications. Existing studies have proposed sketch-based detection solutions to address the mismatch problem between massive traffic and limited high-speed memory resources for measurement in the data plane. However,they overlook the potential of integrating the flow table, where each entry simultaneously enforces forwarding rules for specific flows and records flow statistics into the sketch design, leading to redundant measurement between the flow table and sketch and being unable to utilize their statistics to jointly enhance estimation accuracy. We propose flow entries assisted sketch(FEA-Sketch) in this work, which employs a differentiated flow recording strategy to record flow statistics jointly using the flow table and sketch for memory-efficient and computationally efficient heavy flow detection. We also propose an optimization-based estimation algorithm to accurately recover per-flow sizes for the flows that only have aggregated statistics due to the sharing of entries in the table(or counters in the sketch). We extend the FEA-Sketch to the distributed measurement setting with a hop-based collaborative measurement strategy, which reduces the measurement workload on switches across the network by avoiding redundant measurements. The experimental results on real Internet traces show that the accuracy of heavy flow detection is improved up to 1.95 times, and the bias of flow size estimation is improved up to 2.99 times, demonstrating that integrating flow entries can significantly improve the performance of heavy flow detection.

关键词： software-defined networking traffic measurement heavy flow flow table sketch

来源：评论

学校读者我要写书评

暂无评论

Towards Reliable Configuration Management in Clouds: A Lightweight Consistency Validation Mechanism for Virtual Private Clouds

引用

Chinese Journal of Electronics 2025年第1期34卷 49-63页

作者： Yuhang Qiu Gongming Zhao Hongli Xu Long Li He Huang Liusheng Huang School of Computer Science and Technology University of Science and Technology of China Suzhou Institute for Advanced Research University of Science and Technology of China School of Computer Science and Technology Soochow University

The virtual private cloud service currently lacks a real-time end-to-end consistency validation mechanism, which prevents tenants from receiving immediate feedback on their requests. Existing solutions consume excessive communication and computational resources in such large-scale cloud environments, and suffer from poor timeliness. To address these issues, we propose a lightweight consistency validation mechanism that includes real-time incremental validation and periodic full-scale validation. The former leverages message layer aggregation to enable tenants to swiftly determine the success of their requests on hosts with minimal communication overhead. The latter utilizes lightweight validation checksums to compare the expected and actual states of hosts locally, while efficiently managing the checksums of various host entries using inverted indexing. This approach enables us to efficiently validate the complete local configurations within the limited memory of hosts. In summary, our proposed mechanism achieves closed-loop implementation for new requests and ensures their long-term effectiveness.

关键词： Cloud computing Memory management Configuration management Reliability engineering Real-time systems Indexing

来源：评论

学校读者我要写书评

暂无评论

Integrating element correlation with prompt-based spatial relation extraction

引用

Frontiers of computer science 2025年第2期19卷 59-69页

作者： Feng WANG Sheng XU Peifeng LI Qiaoming ZHU School of Computer Science and Technology Soochow UniversitySuzhou 215006China

Spatial relations in text refer to how a geographical entity is located in space in relation to a reference *** spatial relations from text is a fundamental task in natural language *** studies have only focused on generic fine-tuning methods with additional classifiers,ignoring the importance of the semantic correlation between different spatial elements and the large offset between the relation extraction task and the pre-trained *** address the above two issues,we propose a spatial relation extraction model based on Dual-view Prompt and Element Correlation(DPEC).Specifically,we first reformulate spatial relation extraction as a mask language model with a Dual-view Prompt(i.e.,Link Prompt and Confidence Prompt).Link Prompt can not only guide the model to incorporate more contextual information related to the spatial relation extraction task,but also better adapt to the original pre-training task of the language ***,Confidence Prompt can measure the confidence of candidate triplets in Link Prompt and work as a supplement to identify those easily confused examples in Link ***,we incorporate the element correlation to measure the consistency between different spatial elements,which is an effective cue for identifying the rationality of spatial *** results on the popular SpaceEval show that our DPEC significantly outperforms the SOTA baselines.

关键词： spatial relation extraction Dual-view Prompt spatial element correlation Link Prompt Confidence Prompt

来源：评论

学校读者我要写书评

暂无评论

Witness encryption with updatable ciphertexts

引用

science China(Information sciences) 2025年第3期68卷 181-196页

作者： Yuzhu WANG Mingwu ZHANG School of Computer Science and Information Security Guilin University of Electronic Technology School of Computer Science Hubei University of Technology

Witness encryption(WE) is a novel type of cryptographic primitive that enables a message to be encrypted via an NP instance. Anyone who possesses a solution to this instance(i.e., a witness) can then recover the message from the *** introduce a variant of WE that allows ciphertext updates, referred to as ciphertext updateable WE(CUWE). With CUWE,a user can encrypt a message using an instance x and a tag t, and those who possess a valid witness w for x and match the access policy defined by tag t can decrypt the message. Furthermore, CUWE allows for the use of an update token to change the tag t of ciphertext to a different tag. This feature enables fine-grained access control, even after the ciphertext has been created, thereby significantly increasing the usefulness of the WE scheme. We demonstrate that such a WE framework with an updatable ciphertext scheme can be constructed using our puncturable instance-based deterministic encryption(PIDE) and indistinguishability obfuscation(iO). We also propose an instantiation of PIDE utilizing puncturable pseudorandom functions(PRFs) that provide(selectively) indistinguishable security. Finally, we expand our CUWE to ciphertext-updatable functional WE(CUFWE), which offers enhanced data access control.

关键词： witness encryption NP relation updatable ciphertext access control indistinguishable obfuscation

来源：评论

学校读者我要写书评

暂无评论

PriChain: Efficient Privacy-Preserving Fine-Grained Redactable Blockchains in Decentralized Settings

引用

Chinese Journal of Electronics 2025年第1期34卷 82-97页

作者： Hongchen Guo Weilin Gan Mingyang Zhao Chuan Zhang Tong Wu Liehuang Zhu Jingfeng Xue School of Computer Science and Technology Beijing Institute of Technology School of Cyberspace Science and Technology Beijing Institute of Technology School of Computer and Communication Engineering University of Science and Technology Beijing

Recently, redactable blockchain has been proposed and leveraged in a wide range of real systems for its unique properties of decentralization, traceability, and transparency while ensuring controllable on-chain data redaction. However, the development of redactable blockchain is now obstructed by three limitations, which are data privacy breaches, high communication overhead, and low searching efficiency, respectively. In this paper, we propose PriChain, the first efficient privacy-preserving fine-grained redactable blockchain in decentralized settings. PriChain provides data owners with rights to control who can read and redact on-chain data while maintaining downward compatibility, ensuring the one who can redact will be able to read. Specifically, inspired by the concept of multi-authority attribute-based encryption, we utilize the isomorphism of the access control tree, realizing fine-grained redaction mechanism, downward compatibility, and collusion resistance. With the newly designed structure, PriChain can realize O（n） communication and storage overhead compared to prior O（n2） schemes. Furthermore, we integrate multiple access trees into a tree-based dictionary, optimizing searching efficiency. Theoretical analysis proves that PriChain is secure against the chosen-plaintext attack and has competitive complexity. The experimental evaluations show that PriChain realizes 10× efficiency improvement of searching and 100× lower communication and storage overhead on average compared with existing schemes.

关键词： Resistance Access control Data privacy Dictionaries Blockchains Encryption Complexity theory Usability Protection

来源：评论

学校读者我要写书评

暂无评论

Optimizing local search-based partial MaxSAT solving via initial assignment prediction

引用

science China(Information sciences) 2025年第2期68卷 59-73页

作者： Chanjuan LIU Guangyuan LIU Chuan LUO Shaowei CAI Zhendong LEI Wenjie ZHANG Yi CHU Guojing ZHANG School of Computer Science and Technology Dalian University of Technology School of Software Beihang University Institute of Software Chinese Academy of Sciences School of Computer Science Peking University

Partial maximum satisfiability(PMS) is a significant generalization of Boolean satisfiability(SAT) and maximum satisfiability(MaxSAT), by introducing hard clauses and soft clauses. Compared with SAT and MaxSAT, the PMS problem has more real-world applications where both hard and soft constraints are involved. Local search is an effective incomplete method for solving PMS and is useful for important domains where good-quality solutions are desired within reasonable *** local search PMS solvers, the approach for initial assignment generation is crucial because its effectiveness significantly affects practical performance. In this study, we propose a novel initial assignment prediction approach, called InitPMS. When predicting an assignment for PMS, InitPMS considers the specific structure of PMS instances, i.e., distinguishing hard and soft clauses. Our experiments on extensive PMS instances from MaxSAT evaluations(MSEs) 2020 and 2021 show that InitPMS significantly boosts the performance of five state-of-the-art local search PMS solvers, demonstrating its generality. In addition,our results indicate that incorporating InitPMS could improve the performance of one of the best incomplete PMS solvers in MaxSAT Evaluation 2021, indicating that InitPMS might help advance the state of the art in PMS solving.

关键词： MaxSAT local search initial assignment incomplete method assignment prediction

来源：评论

学校读者我要写书评

暂无评论

A recover-then-discriminate framework for robust anomaly detection

引用

science China(Information sciences) 2025年第4期68卷 300-318页

作者： Peng XING Dong ZHANG Jinhui TANG Zechao LI School of Computer Science and Engineering Nanjing University of Science and Technology Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology

Anomaly detection(AD) has been extensively studied and applied across various scenarios in recent years. However, gaps remain between the current performance and the desired recognition accuracy required for practical *** paper analyzes two fundamental failure cases in the baseline AD model and identifies key reasons that limit the recognition accuracy of existing approaches. Specifically, by Case-1, we found that the main reason detrimental to current AD methods is that the inputs to the recovery model contain a large number of detailed features to be recovered, which leads to the normal/abnormal area has not/has been recovered into its original state. By Case-2, we surprisingly found that the abnormal area that cannot be recognized in image-level representations can be easily recognized in the feature-level representation. Based on the above observations, we propose a novel recover-then-discriminate(ReDi) framework for *** takes a self-generated feature map(e.g., histogram of oriented gradients) and a selected prompted image as explicit input information to address the identified in Case-1. Additionally, a feature-level discriminative network is introduced to amplify abnormal differences between the recovered and input representations. Extensive experiments on two widely used yet challenging AD datasets demonstrate that ReDi achieves state-of-the-art recognition accuracy.

关键词： recovery network HOG prompt discriminative network self-correlation loss anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Labeling-based centrality approaches for identifying critical edges on temporal graphs

引用

Frontiers of computer science 2025年第2期19卷 89-104页

作者： Tianming ZHANG Jie ZHAO Cibo YU Lu CHEN Yunjun GAO Bin CAO Jing FAN Ge YU School of Computer Science and Technology Zhejiang University of TechnologyHangzhou 310023China School of Computer Science and Technology Zhejiang UniversityHangzhou 310013China Department of Computer Science Northeastern UniversityShenyang 110819China

Edge closeness and betweenness centralities are widely used path-based metrics for characterizing the importance of edges in *** general graphs,edge closeness centrality indicates the importance of edges by the shortest distances from the edge to all the other *** betweenness centrality ranks which edges are significant based on the fraction of all-pairs shortest paths that pass through the ***,extensive research efforts go into centrality computation over general graphs that omit time ***,numerous real-world networks are modeled as temporal graphs,where the nodes are related to each other at different time *** temporal property is important and should not be neglected because it guides the flow of information in the *** state of affairs motivates the paper’s study of edge centrality computation methods on temporal *** introduce the concepts of the label,and label dominance relation,and then propose multi-thread parallel labeling-based methods on OpenMP to efficiently compute edge closeness and betweenness centralities *** types of optimal temporal *** edge closeness centrality computation,a time segmentation strategy and two observations are presented to aggregate some related temporal edges for uniform *** edge betweenness centrality computation,to improve efficiency,temporal edge dependency formulas,a labeling-based forward-backward scanning strategy,and a compression-based optimization method are further proposed to iteratively accumulate centrality *** experiments using 13 real temporal graphs are conducted to provide detailed insights into the efficiency and effectiveness of the proposed *** with state-ofthe-art methods,labeling-based methods are capable of up to two orders of magnitude speedup.

关键词： temporal graph closeness centrality between-ness centrality temporal path

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Toolkit for Multi-grained Word Segmentation in Chinese 31

A Probabilistic Toolkit for Multi-grained Word Segmentation ...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Ma, Xi Hou, Yang Wang, Xuebin Li, Zhenghua School of Computer Science and Technology Soochow University China

ISBN: (纸本)9798891761988

It is practically useful to provide consistent and reliable word segmentation results from different criteria at the same time, which is formulated as the multi-grained word segmentation (MWS) task. This paper describes a probabilistic toolkit for MWS in Chinese. We propose a new MWS approach based on the standard MTL framework. We adopt semi-Markov CRF for single-grained word segmentation (SWS), which can produce marginal probabilities of words during inference. For sentences that contain conflicts among SWS results, we employ the CKY decoding algorithm to resolve conflicts. Our resulting MWS tree can provide the criteria information of words, along with the probabilities. Moreover, we follow the works in SWS, and propose a simple strategy to exploit naturally annotated data for MWS, leading to substantial improvement of MWS performance in the cross-domain scenario. ©2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Mining Word Boundaries from Speech-Text Parallel Data for Cross-domain Chinese Word Segmentation 31

Mining Word Boundaries from Speech-Text Parallel Data for Cr...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Wang, Xuebin Zhang, Lei Li, Zhenghua Zhou, Shilin Gong, Chen Hou, Yang School of Computer Science and Technology Soochow University China

ISBN: (纸本)9798891761964

Inspired by early research on exploring naturally annotated data for Chinese Word Segmentation (CWS), and also by recent research on integration of speech and text processing, this work for the first time proposes to explicitly mine word boundaries from speech-text parallel data. We employ the Montreal Forced Aligner (MFA) toolkit to perform character-level alignment on speech-text data, giving pauses as candidate word boundaries. Based on detailed analysis of collected pauses, we propose an effective probability-based strategy for filtering unreliable word boundaries. To more effectively utilize word boundaries as extra training data, we also propose a robust complete-then-train (CTT) strategy. We conduct cross-domain CWS experiments on two target domains, i.e., ZX and AISHELL2. We have annotated about 1,000 sentences as the evaluation data of AISHELL2. Experiments demonstrate the effectiveness of our proposed approach. © 2025 Association for Computational Linguistics.

关键词： Data assimilation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：