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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

NeurDB: an AI-powered autonomous data system

引用

science China(Information sciences) 2024年第10期67卷 129-150页

作者： Beng Chin OOI Shaofeng CAI Gang CHEN Yanyan SHEN Kian-Lee TAN Yuncheng WU Xiaokui XIAO Naili XING Cong YUE Lingze ZENG Meihui ZHANG Zhanhao ZHAO School of Computing National University of Singapore College of Computer Science and Technology Zhejiang University Department of Computer Science and Engineering Shanghai Jiao Tong University School of Information Renmin University of China School of Computer Science and Technology Beijing Institute of Technology

In the wake of rapid advancements in artificial intelligence(AI), we stand on the brink of a transformative leap in data systems. The imminent fusion of AI and DB(AI×DB) promises a new generation of data systems, which will relieve the burden on end-users across all industry sectors by featuring AI-enhanced functionalities, such as personalized and automated in-database AI-powered analytics, and selfdriving capabilities for improved system performance. In this paper, we explore the evolution of data systems with a focus on deepening the fusion of AI and DB. We present NeurDB, an AI-powered autonomous data system designed to fully embrace AI design in each major system component and provide in-database AI-powered analytics. We outline the conceptual and architectural overview of NeurDB, discuss its design choices and key components, and report its current development and future plan.

关键词： AI$\times$DB in-database AI intelligent data system

来源：评论

学校读者我要写书评

暂无评论

When Software Security Meets Large Language Models:A Survey

引用

IEEE/CAA Journal of Automatica Sinica 2025年第2期12卷 317-334页

作者： Xiaogang Zhu Wei Zhou Qing-Long Han Wanlun Ma Sheng Wen Yang Xiang IEEE the School of Computer and Mathematical Sciences the University of Adelaide the School of Science Computing and Engineering Technologies Swinburne University of Technology

Software security poses substantial risks to our society because software has become part of our life. Numerous techniques have been proposed to resolve or mitigate the impact of software security issues. Among them, software testing and analysis are two of the critical methods, which significantly benefit from the advancements in deep learning technologies. Due to the successful use of deep learning in software security, recently,researchers have explored the potential of using large language models(LLMs) in this area. In this paper, we systematically review the results focusing on LLMs in software security. We analyze the topics of fuzzing, unit test, program repair, bug reproduction, data-driven bug detection, and bug triage. We deconstruct these techniques into several stages and analyze how LLMs can be used in the stages. We also discuss the future directions of using LLMs in software security, including the future directions for the existing use of LLMs and extensions from conventional deep learning research.

关键词： Large language models (LLMs) software analysis software security software testing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Towards High-Performance Graph Processing: From a Hardware/Software Co-Design Perspective

引用

Journal of computer science & technology 2024年第2期39卷 245-266页

作者：廖小飞赵文举金海姚鹏程黄禹王庆刚赵进郑龙张宇邵志远 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 Technology Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Zhejiang Lab Hangzhou 311121China

Graph processing has been widely used in many scenarios,from scientific computing to artificial *** processing exhibits irregular computational parallelism and random memory accesses,unlike traditional ***,running graph processing workloads on conventional architectures(e.g.,CPUs and GPUs)often shows a significantly low compute-memory ratio with few performance benefits,which can be,in many cases,even slower than a specialized single-thread graph *** domain-specific hardware designs are essential for graph processing,it is still challenging to transform the hardware capability to performance boost without coupled software *** article presents a graph processing ecosystem from hardware to *** start by introducing a series of hardware accelerators as the foundation of this ***,the codesigned parallel graph systems and their distributed techniques are presented to support graph ***,we introduce our efforts on novel graph applications and hardware *** results show that various graph applications can be efficiently accelerated in this graph processing ecosystem.

关键词： graph processing hardware accelerator software system high performance ecosystem

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Precise control of page cache for containers

引用

Frontiers of computer science 2024年第2期18卷 17-30页

作者： Kun WANG Song WU Shengbang LI Zhuo HUANG Hao FAN Chen YU Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Container-based virtualization isbecoming increasingly popular in cloud computing due to its efficiency and *** isolation is a fundamental property of *** works have indicated weak resource isolation could cause significant performance degradation for containerized applications and enhanced resource ***,current studies have almost not discussed the isolation problems of page cache which is a key resource for *** leverage memory cgroup to control page cache ***,existing policy introduces two major problems in a container-based ***,containers can utilize more memory than limited by their cgroup,effectively breaking memory ***,the Os kernel has to evict page cache to make space for newly-arrived memory requests,slowing down containerized *** paper performs an empirical study of these problems and demonstrates the performance impacts on containerized *** we propose pCache(precise control of page cache)to address the problems by dividing page cache into private and shared and controlling both kinds of page cache separately and *** do so,pCache leverages two new technologies:fair account(f-account)and evict on demand(EoD).F-account splits the shared page cache charging based on per-container share to prevent containers from using memory for free,enhancing memory *** EoD reduces unnecessary page cache evictions to avoid the performance *** evaluation results demonstrate that our system can effectively enhance memory isolation for containers and achieve substantial performance improvement over the original page cache management policy.

关键词： page cache memory cgroup container isolation cloud computing

来源：评论

学校读者我要写书评

暂无评论

Robust federated contrastive recommender system against targeted model poisoning attack

引用

science China(Information sciences) 2025年第4期68卷 50-65页

作者： Wei YUAN Chaoqun YANG Liang QU Guanhua YE Quoc Viet Hung NGUYEN Hongzhi YIN School of Electrical Engineering and Computer Science The University of Queensland School of Information and Communication Technology Griffith University Deep Neural Computing Company Limited

Federated recommender systems(FedRecs) have garnered increasing attention recently, thanks to their privacypreserving benefits. However, the decentralized and open characteristics of current FedRecs present at least two ***, the performance of FedRecs is compromised due to highly sparse on-device data for each client. Second, the system's robustness is undermined by the vulnerability to model poisoning attacks launched by malicious users. In this paper, we introduce a novel contrastive learning framework designed to fully leverage the client's sparse data through embedding augmentation, referred to as CL4FedRec. Unlike previous contrastive learning approaches in FedRecs that necessitate clients to share their private parameters, our CL4FedRec aligns with the basic FedRec learning protocol, ensuring compatibility with most existing FedRec implementations. We then evaluate the robustness of FedRecs equipped with CL4FedRec by subjecting it to several state-of-the-art model poisoning attacks. Surprisingly, our observations reveal that contrastive learning tends to exacerbate the vulnerability of FedRecs to these attacks. This is attributed to the enhanced embedding uniformity, making the polluted target item embedding easily proximate to popular items. Based on this insight, we propose an enhanced and robust version of CL4FedRec(rCL4FedRec) by introducing a regularizer to maintain the distance among item embeddings with different popularity levels. Extensive experiments conducted on four commonly used recommendation datasets demonstrate that rCL4FedRec significantly enhances both the model's performance and the robustness of FedRecs.

关键词： federated recommender system contrastive learning model poisoning attack and defense

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：