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

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

来源：评论

学校读者我要写书评

暂无评论

CCM-FL:Covert communication mechanisms for federated learning in crowd sensing IoT

引用

Digital Communications and Networks 2024年第3期10卷 597-608页

作者： Hongruo Zhang Yifei Zou Haofei Yin Dongxiao Yu Xiuzhen Cheng Institute of Intelligent Computing School of Computer Science and TechnologyShandong UniversityQingdao266237China

The past decades have witnessed a wide application of federated learning in crowd sensing,to handle the numerous data collected by the sensors and provide the users with precise and customized ***,how to protect the private information of users in federated learning has become an important research *** with the differential privacy(DP)technique and secure multiparty computation(SMC)strategy,the covert communication mechanism in federated learning is more efficient and energy-saving in training the ma-chine learning *** this paper,we study the covert communication problem for federated learning in crowd sensing Internet-of-Things *** from the previous works about covert communication in federated learning,most of which are considered in a centralized framework and experimental-based,we firstly proposes a centralized covert communication mechanism for federated learning among n learning agents,the time complexity of which is O(log n),approximating to the optimal ***,for the federated learning without parameter server,which is a harder case,we show that solving such a problem is NP-hard and prove the existence of a distributed covert communication mechanism with O(log logΔlog n)times,approximating to the optimal solution.Δis the maximum distance between any pair of learning *** analysis and nu-merical simulations are presented to show the performance of our covert communication *** hope that our covert communication work can shed some light on how to protect the privacy of federated learning in crowd sensing from the view of communications.

关键词： Covert communications Federated learning Crowd sensing SINR model

来源：评论

学校读者我要写书评

暂无评论

RE-SEGNN:recurrent semantic evidence-aware graph neural network for temporal knowledge graph forecasting

引用

science China(Information sciences) 2025年第2期68卷 103-119页

作者： Wenyu CAI Mengfan LI Xuanhua SHI Yuanxin FAN Quntao ZHU Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and Technology

Temporal knowledge graph(TKG) reasoning, has seen widespread use for modeling real-world events, particularly in extrapolation settings. Nevertheless, most previous studies are embedded models, which require both entity and relation embedding to make predictions, ignoring the semantic correlations among different entities and relations within the same timestamp. This can lead to random and nonsensical predictions when unseen entities or relations occur. Furthermore, many existing models exhibit limitations in handling highly correlated historical facts with extensive temporal depth. They often either overlook such facts or overly accentuate the relationships between recurring past occurrences and their current counterparts. Due to the dynamic nature of TKG, effectively capturing the evolving semantics between different timestamps can be *** address these shortcomings, we propose the recurrent semantic evidenceaware graph neural network(RE-SEGNN), a novel graph neural network that can learn the semantics of entities and relations simultaneously. For the former challenge, our model can predict a possible answer to missing quadruples based on semantics when facing unseen entities or relations. For the latter problem, based on an obvious established force, both the recency and frequency of semantic history tend to confer a higher reference value for the current. We use the Hawkes process to compute the semantic trend, which allows the semantics of recent facts to gain more attention than those of distant facts. Experimental results show that RE-SEGNN outperforms all SOTA models in entity prediction on 6 widely used datasets, and 5 datasets in relation prediction. Furthermore, the case study shows how our model can deal with unseen entities and relations.

关键词： knowledge graph reasoning temporal knowledge graph Hawkes process semantic evidence

来源：评论

学校读者我要写书评

暂无评论

Fast Cross-Platform Binary Code Similarity Detection Framework Based on CFGs Taking Advantage of NLP and Inductive GNN

引用

Chinese Journal of Electronics 2024年第1期33卷 128-138页

作者： Jinxue PENG Yong WANG Jingfeng XUE Zhenyan LIU School of Computer Science and Technology Beijing Institute of Technology

Cross-platform binary code similarity detection aims at detecting whether two or more pieces of binary code are similar or not. Existing approaches that combine control flow graphs(CFGs)-based function representation and graph convolutional network(GCN)-based similarity analysis are the best-performing ones. Due to a large amount of convolutional computation and the loss of structural information, the use of convolution networks will inevitably bring problems such as high overhead and sometimes inaccuracy. To address these issues, we propose a fast cross-platform binary code similarity detection framework that takes advantage of natural language processing(NLP)and inductive graph neural network(GNN) for basic blocks embedding and function representation respectively by simulating extracting structural features and temporal features. GNN's node-centric and small batch is a suitable training way for large CFGs, it can greatly reduce computational overhead. Various NLP basic block embedding models and GNNs are evaluated. Experimental results show that the scheme with long short term memory(LSTM)for basic blocks embedding and inductive learning-based Graph SAGE(GAE) for function representation outperforms the state-of-the-art works. In our framework, we can take only 45% overhead. Improve efficiency significantly with a small performance trade-off.

关键词： Control flow graph Natural language processing Inductive graph neural network Binary code similarity detection

来源：评论

学校读者我要写书评

暂无评论

TPpred-SC: multi-functional therapeutic peptide prediction based on multi-label supervised contrastive learning

引用

science China(Information sciences) 2024年第11期67卷 136-147页

作者： Ke YAN Hongwu LV Jiangyi SHAO Shutao CHEN Bin LIU School of Computer Science and Technology Beijing Institute of Technology

Therapeutic peptides contribute significantly to human health and have the potential for personalized medicine. The prediction for the therapeutic peptides is beneficial and emerging for the discovery of drugs. Although several computational approaches have emerged to discern the functions of therapeutic peptides, predicting multi-functional therapeutic peptide types is challenging. In this research, a novel approach termed TPpred-SC has been introduced. This method leverages a pretrained protein language model alongside multi-label supervised contrastive learning to predict multi-functional therapeutic *** framework incorporates sequential semantic information directly from large-scale protein sequences in TAPE. Then, TPpred-SC exploits multi-label supervised contrastive learning to enhance the representation of peptide sequences for imbalanced multi-label therapeutic peptide prediction. The experimental findings demonstrate that TPpred-SC achieves superior performance compared to existing related methods. To serve our work more efficiently, the web server of TPpred-SC can be accessed at http://***/TPpred-SC.

关键词： therapeutic peptide prediction multi-label classification pretrained protein language model multi-label supervised contrastive learning

来源：评论

学校读者我要写书评

暂无评论

Priority Encoder Based on DNA Strand Displacement

引用

Chinese Journal of Electronics 2024年第6期33卷 1538-1544页

作者： Fang WANG Xinjian ZHANG Xin CHEN Shuying LYU Congzhou CHEN Xiaolong SHI Institution of Computing Science and Technology Guangzhou University Beijing University of Technology School of Computer Science Peking University

The slow development of traditional computing has prompted the search for new materials to replace silicon-based computers. Bio-computers, which use molecules as the basis of computation, are highly parallel and information capable, attracting a lot of attention. In this study, we designed a NAND logic gate based on the DNA strand displacement mechanism. We assembled a molecular calculation model, a 4-wire-2-wire priority encoder logic circuit, by cascading the proposed NAND gates. Different concentrations of input DNA chains were added into the system, resulting in corresponding output, through DNA hybridization and strand displacement. Therefore, it achieved the function of a priority encoder. Simulation results verify the effectiveness and accuracy of the molecular NAND logic gate and the priority coding system presented in this study. The unique point of this proposed circuit is that we cascaded only one kind of logic gate, which provides a beneficial exploration for the subsequent development of complex DNA cascade circuits and the realization of the logical coding function of information.

关键词： Visualization Accuracy Logic circuits Simulation DNA Logic gates Encoding Software Logic Integrated circuit modeling

来源：评论

学校读者我要写书评

暂无评论

Automatic lung cancer detection using hybrid particle snake swarm optimization with optimized mask RCNN

引用

Multimedia Tools and Applications 2024年第31期83卷 76807-76831页

作者： Sudha, R. Maheswari, K. M. Uma Department of Computer Science and Engineering School of computing College of engineering and technology SRM Institute of Science and Technology Kattankulathur India Department of Computing Technologies School of Computing College of engineering and technology SRM Institute of Science and Technology Kattankulathur India

As a result of its aggressive nature and late identification at advanced stages, lung cancer is one of the leading causes of cancer-related deaths. Lung cancer early diagnosis is a serious and difficult challenge that is crucial to a person's survival. The first diagnosis of the malignant nodules is typically made using chest radiography (X-rays) and computed tomography (CT) scans;however, the potential presence of benign nodules results in incorrect conclusions. The early phases of both benign and malignant nodules exhibit striking similarities. In this paper, a novel deep learning-based model is proposed for the precise diagnosis of malignant nodules. The proposed approach consists of two stages namely, pre-processing and lung nodule detection. Initially, the Lung CT scan images are collected from the dataset. Then, to remove the noise present in the input image, we apply an adaptive median filter. Then, to enhance the image, Contrast Limited Adaptive Histogram Equalization (CLAHE) is applied. After pre-processing, the image is given to the optimized mask RCNN classifier to detect the malignant and benign nodules. To enhance the performance of the Mask RCNN classifier, the hyper-parameters are optimally selected using hybrid particle snake swarm optimization (PS2OA). The proposed PS2OA is a hybridization of particle swarm optimization (PSO) and snake swarm optimization (SSO). The performance of the proposed approach is analyzed based on different metrics and effectiveness compared with state-of-the-art works. The proposed approach attained the maximum accuracy of 97.67%. This work aimed at assisting radiologists to detect and diagnose small-size pulmonary nodules more accurately. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Minimal Context-Switching Data Race Detection with Dataflow Tracking

引用

Journal of computer science & technology 2024年第1期39卷 211-226页

作者：郑龙李洋辛杰刘海峰郑然廖小飞金海 National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Data race is one of the most important concurrent anomalies in multi-threaded *** con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by any oth-er sound race ***,this constraint-based approach has serious limitations on helping programmers analyze and understand data ***,it may report a large number of false positives due to the unrecognized dataflow propa-gation of the ***,it recommends a wide range of thread context switches to schedule the reported race(in-cluding the false one)whenever this race is exposed during the constraint-solving *** ad hoc recommendation imposes too many context switches,which complicates the data race *** address these two limitations in the state-of-the-art constraint-based race detection,this paper proposes DFTracker,an improved constraint-based race detec-tor to recommend each data race with minimal thread context ***,we reduce the false positives by ana-lyzing and tracking the dataflow in the *** this means,DFTracker thus reduces the unnecessary analysis of false race *** further propose a novel algorithm to recommend an effective race schedule with minimal thread con-text switches for each data *** experimental results on the real applications demonstrate that 1)without removing any true data race,DFTracker effectively prunes false positives by 68%in comparison with the state-of-the-art constraint-based race detector;2)DFTracker recommends as low as 2.6-8.3(4.7 on average)thread context switches per data race in the real world,which is 81.6%fewer context switches per data race than the state-of-the-art constraint based race ***,DFTracker can be used as an effective tool to understand the data race for programmers.

关键词： data race satisfiability modulo theory multi-threaded program dynamic detection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Deep Guided Attention Network for Joint Denoising and Demosaicing in Real Image

引用

Chinese Journal of Electronics 2024年第1期33卷 303-312页

作者： Tao ZHANG Ying FU Jun ZHANG School of Computer Science and Technology Beijing Institute of Technology Advanced Reasearch Institute of Multidisciplinary Science Beijing Institute of Technology

Denoising(DN) and demosaicing(DM) are the first crucial stages in the image signal processing pipeline. Recently, researches pay more attention to solve DN and DM in a joint manner, which is an extremely undetermined inverse problem. Existing deep learning methods learn the desired prior on synthetic dataset, which limits the generalization of learned network to the real world data. Moreover, existing methods mainly focus on the raw data property of high green information sampling rate for DM, but occasionally exploit the high intensity and signalto-noise(SNR) of green channel. In this work, a deep guided attention network(DGAN) is presented for real image joint DN and DM(JDD), which considers both high SNR and high sampling rate of green information for DN and DM, respectively. To ease the training and fully exploit the data property of green channel, we first train DN and DM sub-networks sequentially and then learn them jointly, which can alleviate the error accumulation. Besides, in order to support the real image JDD, we collect paired raw clean RGB and noisy mosaic images to conduct a realistic dataset. The experimental results on real JDD dataset show the presented approach performs better than the state-of-the-art methods, in terms of both quantitative metrics and qualitative visualization.

关键词： Image denoising Image demosaicing Joint processing Guided attention Paired real dataset

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：