检索结果-南通市图书馆

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

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Rendering acceleration method based on JND and sample gradient

引用

Optoelectronics Letters 2025年第3期21卷 177-182页

作者： ZHANG Ripei CHEN Chunyi school of computer science and Technology Qinghai Normal University school of computer science and Technology Changchun University of Science and Technology

Currently, the main idea of iterative rendering methods is to allocate a fixed number of samples to pixels that have not been fully rendered by calculating the completion rate. It is obvious that this strategy ignores the changes in pixel values during the previous rendering process, which may result in additional iterative operations.

关键词： Pixels

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Privacy-preserving explainable AI: a survey

引用

science China(Information sciences) 2025年第1期68卷 23-56页

作者： Thanh Tam NGUYEN Thanh Trung HUYNH Zhao REN Thanh Toan NGUYEN Phi Le NGUYEN Hongzhi YIN Quoc Viet Hung NGUYEN school of Information and Communication Technology Griffith University school of computer and Communication sciences Ecole Polytechnique Federale de Lausanne Faculty of Mathematics and computer science University of Bremen Faculty of Information Technology HUTECH University Department of computer science Hanoi University of Science and Technology school of Electrical Engineering and computer science The University of Queensland

As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.

关键词： privacy-preserving explainable AI privacy attacks privacy defences PrivEx PPXAI

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Deep learning-based software engineering: progress,challenges, and opportunities

引用

science China(Information sciences) 2025年第1期68卷 57-144页

作者： Xiangping CHEN Xing HU Yuan HUANG He JIANG Weixing JI Yanjie JIANG Yanyan JIANG Bo LIU Hui LIU Xiaochen LI Xiaoli LIAN Guozhu MENG Xin PENG Hailong SUN Lin SHI Bo WANG Chong WANG Jiayi WANG Tiantian WANG Jifeng XUAN Xin XIA Yibiao YANG Yixin YANG Li ZHANG Yuming ZHOU Lu ZHANG school of Journalism and Communication Sun Yat-sen University school of Software Technology Zhejiang University school of Software Engineering Sun Yat-sen University school of Software Dalian University of Technology school of computer science and Technology Beijing Institute of Technology Key Laboratory of High Confidence Software Technologies (Peking University) Ministry of EducationSchool of Computer Science Peking University State Key Laboratory for Novel Software Technology Nanjing University school of computer science and Engineering Beihang University Institute of Information Engineering Chinese Academy of Sciences school of computer science Fudan University State Key Laboratory of Complex & Critical Software Environment (CCSE) School of Software Beihang University school of computer and Information Technology Beijing Jiaotong University school of computer science and Technology Harbin Institute of Technology school of computer science Wuhan University Huawei Technologies

Researchers have recently achieved significant advances in deep learning techniques, which in turn has substantially advanced other research disciplines, such as natural language processing, image processing, speech recognition, and software engineering. Various deep learning techniques have been successfully employed to facilitate software engineering tasks, including code generation, software refactoring, and fault localization. Many studies have also been presented in top conferences and journals, demonstrating the applications of deep learning techniques in resolving various software engineering tasks. However,although several surveys have provided overall pictures of the application of deep learning techniques in software engineering,they focus more on learning techniques, that is, what kind of deep learning techniques are employed and how deep models are trained or fine-tuned for software engineering tasks. We still lack surveys explaining the advances of subareas in software engineering driven by deep learning techniques, as well as challenges and opportunities in each subarea. To this end, in this study, we present the first task-oriented survey on deep learning-based software engineering. It covers twelve major software engineering subareas significantly impacted by deep learning techniques. Such subareas spread out through the whole lifecycle of software development and maintenance, including requirements engineering, software development, testing, maintenance, and developer collaboration. As we believe that deep learning may provide an opportunity to revolutionize the whole discipline of software engineering, providing one survey covering as many subareas as possible in software engineering can help future research push forward the frontier of deep learning-based software engineering more systematically. For each of the selected subareas,we highlight the major advances achieved by applying deep learning techniques with pointers to the available datasets i

关键词： deep learning software engineering software benchmark software artifact representation survey

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Predefined-Time Constrained Optimization of Multi-Agent Systems Under Impulsive Effects

引用

IEEE/CAA Journal of Automatica Sinica 2025年第1期12卷 255-257页

作者： Zhuyan Jiang Xiaoyang Liu Xiang Jiang Jinde Cao the school of computer science and Technology Jiangsu Normal University IEEE the school of Mathematics Southeast University

Dear Editor,This letter investigates predefined-time optimization problems(OPs) of multi-agent systems(MASs), where the agent of MASs is subject to inequality constraints, and the team objective function accounts for impulse effects. Firstly, to address the inequality constraints,the penalty method is introduced. Then, a novel optimization strategy is developed, which only requires that the team objective function be strongly convex.

关键词： Constrained optimization

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Aligning enhanced feature representation for generalized zero-shot learning

引用

science China(Information sciences) 2025年第2期68卷 74-88页

作者： Zhiyu FANG Xiaobin ZHU Chun YANG Hongyang ZHOU Jingyan QIN Xu-Cheng YIN school of computer & Communication Engineering University of Science and Technology Beijing

Constructing an effective common latent embedding by aligning the latent spaces of cross-modal variational autoencoders（VAEs） is a popular strategy for generalized zero-shot learning（GZSL）. However, due to the lack of fine-grained instance-wise annotations, existing VAE methods can easily suffer from the posterior collapse problem. In this paper, we propose an innovative asymmetric VAE network by aligning enhanced feature representation（AEFR） for GZSL. Distinguished from general VAE structures, we designed two asymmetric encoders for visual and semantic observations and one decoder for visual reconstruction. Specifically, we propose a simple yet effective gated attention mechanism（GAM） in the visual encoder for enhancing the information interaction between observations and latent variables, alleviating the possible posterior collapse problem effectively. In addition, we propose a novel distributional decoupling-based contrastive learning（D2-CL） to guide learning classification-relevant information while aligning the representations at the taxonomy level in the latent representation space. Extensive experiments on publicly available datasets demonstrate the state-of-the-art performance of our method. The source code is available at https://***/seeyourmind/AEFR.

关键词： generalized zero-shot learning gated attention mechanism contrastive learning multi-modal alignment

来源：

同方期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Enhanced Acceleration for Generalized Nonconvex Low-Rank Matrix Learning

引用

Chinese Journal of Electronics 2025年第1期34卷 98-113页

作者： Hengmin Zhang Jian Yang Wenli Du Bob Zhang Zhiyuan Zha Bihan Wen school of Electrical and Electronic Engineering Nanyang Technological University school of computer science and Engineering Nanjing University of Science and Technology school of Information science and Engineering East China University of Science and Technology Department of Electrical and computer Engineering University of Macau

Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inherent biases and computational burdens, especially when used to relax the rank function, making them less effective and efficient in real-world scenarios. To address these challenges, our research focuses on generalized nonconvex rank regularization problems in robust matrix completion, low-rank representation, and robust matrix regression. We introduce innovative approaches for effective and efficient low-rank matrix learning, grounded in generalized nonconvex rank relaxations inspired by various substitutes for the ?0-norm relaxed functions. These relaxations allow us to more accurately capture low-rank structures. Our optimization strategy employs a nonconvex and multi-variable alternating direction method of multipliers, backed by rigorous theoretical analysis for complexity and *** algorithm iteratively updates blocks of variables, ensuring efficient convergence. Additionally, we incorporate the randomized singular value decomposition technique and/or other acceleration strategies to enhance the computational efficiency of our approach, particularly for large-scale constrained minimization problems. In conclusion, our experimental results across a variety of image vision-related application tasks unequivocally demonstrate the superiority of our proposed methodologies in terms of both efficacy and efficiency when compared to most other related learning methods.

关键词： Learning systems Image recognition Minimization Computational efficiency Complexity theory Matrix decomposition Optimization Image reconstruction Singular value decomposition Convergence

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

GPS: graph contrastive learning via multi-scale augmented views from adversarial pooling

引用

science China(Information sciences) 2025年第1期68卷 145-158页

作者： Wei JU Yiyang GU Zhengyang MAO Ziyue QIAO Yifang QIN Xiao LUO Hui XIONG Ming ZHANG school of computer science National Key Laboratory for Multimedia Information ProcessingPeking University Artificial Intelligence Thrust The Hong Kong University of Science and Technology Department of computer science University of California

Self-supervised graph representation learning has recently shown considerable promise in a range of fields, including bioinformatics and social networks. A large number of graph contrastive learning approaches have shown promising performance for representation learning on graphs, which train models by maximizing agreement between original graphs and their augmented views(i.e., positive views). Unfortunately, these methods usually involve pre-defined augmentation strategies based on the knowledge of human experts. Moreover, these strategies may fail to generate challenging positive views to provide sufficient supervision signals. In this paper, we present a novel approach named graph pooling contrast(GPS) to address these *** by the fact that graph pooling can adaptively coarsen the graph with the removal of redundancy, we rethink graph pooling and leverage it to automatically generate multi-scale positive views with varying emphasis on providing challenging positives and preserving semantics, i.e., strongly-augmented view and weakly-augmented view. Then, we incorporate both views into a joint contrastive learning framework with similarity learning and consistency learning, where our pooling module is adversarially trained with respect to the encoder for adversarial robustness. Experiments on twelve datasets on both graph classification and transfer learning tasks verify the superiority of the proposed method over its counterparts.

关键词： graph representation learning graph neural networks graph contrastive learning graph augmentations graph pooling

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

LoRa Sense:Sensing and Optimization of LoRa Link Behavior Using Path-Loss Models in Open-Cast Mines

引用

computer Modeling in Engineering & sciences 2025年第1期142卷 425-466页

作者： Bhanu Pratap Reddy Bhavanam Prashanth Ragam school of computer science and Engineering VIT-AP UniversityAmaravati52237India

The Internet of Things(IoT)has orchestrated various domains in numerous applications,contributing significantly to the growth of the smart world,even in regions with low literacy rates,boosting socio-economic *** study provides valuable insights into optimizing wireless communication,paving the way for a more connected and productive future in the mining *** IoT revolution is advancing across industries,but harsh geometric environments,including open-pit mines,pose unique challenges for reliable *** advent of IoT in the mining industry has significantly improved communication for critical operations through the use of Radio Frequency(RF)protocols such as Bluetooth,Wi-Fi,GSM/GPRS,Narrow Band(NB)-IoT,SigFox,ZigBee,and Long Range Wireless Area Network(LoRaWAN).This study addresses the optimization of network implementations by comparing two leading free-spreading IoT-based RF protocols such as ZigBee and *** field tests are conducted in various opencast mines to investigate coverage potential and signal *** is tested in the Tadicherla open-cast coal mine in ***,LoRaWAN field tests are conducted at one of the associated cement companies(ACC)in the limestone mine in Bargarh,India,covering both Indoor-toOutdoor(I2O)and Outdoor-to-Outdoor(O2O)environments.A robust framework of path-loss models,referred to as Free space,Egli,Okumura-Hata,Cost231-Hata and Ericsson models,combined with key performance metrics,is employed to evaluate the patterns of signal *** field testing and careful data analysis revealed that the Egli model is the most consistent path-loss model for the ZigBee protocol in an I2O environment,with a coefficient of determination(R^(2))of 0.907,balanced error metrics such as Normalized Root Mean Square Error(NRMSE)of 0.030,Mean Square Error(MSE)of 4.950,Mean Absolute Percentage Error(MAPE)of 0.249 and Scatter Index(SI)of *** the O2O scenario,the Ericsson model

关键词： Internet of things long range wireless area network ZigBee mining environments path-loss models coefficient of determination mean square error

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：