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

作者： Xia, Yang Zhu, Tianqing Ding, Xiaofeng Jin, Hai Zou, Deqing National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China Deakin University Victoria Australia

Existing privacy-preserving approaches are generally designed to provide privacy guarantee for individual data in a database, which reduces the utility of the database for data analysis. In this paper, we propose a novel differential privacy mechanism to preserve the heterogeneous privacy of a vertically partitioned database based on attributes. We first present the concept of privacy label, which characterizes the privacy information of the database and is instantiated by the classification. Then, we use an information-based method to systematically explore the dependencies between all attributes and the privacy label. We finally assign privacy weights to every attribute and design a heterogeneous mechanism according to the basic Laplace mechanism. Evaluations using real datasets demonstrate that the proposed mechanism achieves a balanced privacy and utility. © 2019 John Wiley & Sons, Ltd.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

Research on Classification label Denoising Algorithm Based on Granular Ball 7

Research on Classification Label Denoising Algorithm Based o...

引用

7th International Conference on Cloud Computing and big data Analytics, ICCCBDA 2022

作者： Kong, Weiyu Wu, Yanmin Qi, Jinli Chen, Yanyi Chongqing Key Lab. of Comp. Sci. and Technology Chongqing University of Posts and Telecommunications ChongQing China ChongQing College of Electronic Engineering Department of Artificial Intelligence and Big Data ChongQing China Chongqing University of Posts and Telecommunications Department of Software Engineering ChongQing China

ISBN: (纸本)9781665487115

This paper presents a granular ball denoising method (GBD) which can effectively improve the accuracy and robustness of classification algorithm. GBD method first uses the self-Adaptive hypersphere to cover the data space, then eliminates the data not contained in the hypersphere and the noise data in the sphere, and finally uses only the hypersphere data for training, so as to reduce the sample data and improve the data quality. Experiments show that using the data obtained by this method for training can greatly improve the accuracy of the classification algorithm. In addition, because the hypersphere has good adaptive ability, GBD also has excellent robustness. The experiment shows that GBD sampling data training can still get good results after adding noise to the data set. Therefore, GBD is an efficient and robust denoising method. © 2022 IEEE.

关键词： Training Cloud computing data integrity Noise reduction big data Robustness Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

Generalization-Enhanced Code Vulnerability Detection via Multi-Task Instruction Fine-Tuning

arXiv

引用

arXiv 2024年

作者： Du, Xiaohu Wen, Ming Zhu, Jiahao Xie, Zifan Ji, Bin Liu, Huijun Shi, Xuanhua Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China College of Computer National University of Defense Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab HUST Wuhan430074 China Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security HUST Wuhan430074 China JinYinHu Laboratory Wuhan430077 China Cluster and Grid Computing Lab HUST Wuhan430074 China

Code Pre-trained Models (CodePTMs) based vulnerability detection have achieved promising results over recent years. However, these models struggle to generalize as they typically learn superficial mapping from source code to labels instead of understanding the root causes of code vulnerabilities, resulting in poor performance in real-world scenarios beyond the training instances. To tackle this challenge, we introduce VulLLM, a novel framework that integrates multi-task learning with Large Language Models (LLMs) to effectively mine deep-seated vulnerability features. Specifically, we construct two auxiliary tasks beyond the vulnerability detection task. First, we utilize the vulnerability patches to construct a vulnerability localization task. Second, based on the vulnerability features extracted from patches, we leverage GPT-4 to construct a vulnerability interpretation task. VulLLM innovatively augments vulnerability classification by leveraging generative LLMs to understand complex vulnerability patterns, thus compelling the model to capture the root causes of vulnerabilities rather than overfitting to spurious features of a single task. The experiments conducted on six large datasets demonstrate that VulLLM surpasses seven state-of-the-art models in terms of effectiveness, generalization, and robustness. © 2024, CC BY.

关键词： Large datasets

来源：评论

学校读者我要写书评

暂无评论

Deep Geometry Handling and Fragment-wise Molecular 3D Graph Generation

arXiv

引用

arXiv 2024年

作者： Zhang, Odin Huang, Yufei Cheng, Shichen Yu, Mengyao Zhang, Xujun Lin, Haitao Zeng, Yundian Wang, Mingyang Wu, Zhenxing Zhao, Huifeng Zhang, Zaixi Hua, Chenqing Kang, Yu Cui, Sunliang Pan, Peichen Hsieh, Chang-Yu Hou, Tingjun College of Pharmaceutical Sciences Zhejiang University Zhejiang Hangzhou310058 China Zhejiang University Zhejiang Hangzhou310058 China Anhui Province Key Lab of Big Data Analysis and Application University of Science and Technology of China Anhui Hefei China Montreal Institute for Learning Algorithms McGill University MontrealQC Canada

3D structure-based molecular graph generation has attracted tremendous attention for its vast potential in designing potent drug candidates. Most earlier approaches follow an atom-wise paradigm, incrementally adding atoms to a partially built molecular fragment within protein pockets. These methods, while effective in designing tightly bound ligands, often overlook other essential properties such as synthesizability and drugability. The fragment-wise generation paradigm offers a promising solution by assembling chemically sensible fragments to reduce synthesis difficulty. However, a common challenge across both atom-wise and fragment-wise methods lies in their limited ability to co-design plausible chemical and geometrical structures, resulting in distorted conformations and inferior binding tendencies. In response to this challenge, we introduce the Deep Geometry Handling protocol, a more abstract design that decomposes the entire geometry into multiple sets of geometric variables, extending the design focus beyond the model architecture. Through a comprehensive review of existing geometry-related models, we identify and discuss six protocols, each with its own strengths and weaknesses. Building upon these insights, we propose a novel hybrid strategy, culminating in the development of FragGen - the first geometry-reliable, fragment-wise molecular generation method. FragGen marks a significant leap forward in the quality of generated geometry and the synthesis accessibility of molecules-addressing two major challenges in the application of molecular generation algorithms. The efficacy of FragGen is further validated by its successful application in designing type II kinase inhibitors at the nanomolar level, grounding its algorithmic advancements in real-world drug development. We believe that this concept-algorithm-application loop will not only inspire researchers working on other geometry-centric tasks to look beyond architecture design, but also offer a concrete

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Diabetes Mellitus Type 2 data Sharing System Based on Blockchain and Attribute-Encryption

Diabetes Mellitus Type 2 Data Sharing System Based on Blockc...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Weiqi Dai Zhenhui Lu Xia Xie Duoqiang Wang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology Hainan University Haikou China

Medical data sharing can improve the quality of medical care and promote progress in the field of public health. However, medical data has high confidentiality and complexity. Taking the clinical diagnosis and treatment data of Diabetes Mellitus Type 2 (T2DM) in medical treatment as an example, T2DM data often has the phenomenon of "multi-disease coexistence" and is insecure and inaccurate in the process of sharing. Based on Blockchain and Attribute- Encryption (ABE), we propose a T2DM data sharing system to solve the above problems. An Attribute-Encryption algorithm T2DM-CP-ABE is proposed to solve the problem of excessive sharing granularity. T2DM-CP-ABE, combined with the medical data contribution module, takes the contribution factor as an important consideration, to stimulate the power of T2DM data sharing and promote the development of national diabetes prevention. Based on the Blockchain, a medical data attribute authorization model is proposed, which provides a credible solution for multiple hospitals to realize medical data attribute authorization, and realizes the clinical diagnosis and treatment data sharing of T2DM among doctors. Based on Blockchain and ABE technology, a data sharing system for T2DM has been implemented on the Fabric platform. The result shows that the average time for the system to complete a single sharing is less than 1 second.

关键词： Authorization Hospitals Fabrics Blockchains Diabetes Encryption Security

来源：评论

学校读者我要写书评

暂无评论

SLMP: A Scientific Literature Management Platform Based on Large Language Models

SLMP: A Scientific Literature Management Platform Based on L...

引用

IEEE International Conference on big Knowledge (ICBK)

作者： Menghao Guo Jinling Jiang Fan Wu Shanxin Sun Chen Zhang Wenhui Li Zeyi Sun Guangyong Chen Xindong Wu Research Center for Life Sciences Computing Zhejiang Lab Hangzhou China Research Center for Data Hub and Security Zhejiang Lab Hangzhou China Research Center for High Efficiency Computing System Zhejiang Lab Hangzhou China Key Laboratory of Knowledge Engineering With Big Data Hefei University of Technology Hefei China

ISBN: (数字)9798331508821

ISBN: (纸本)9798331508838

This paper presents a Scientific Literature Management Platform (SLMP, demo link 1 ) based on large language models (LLMs). The platform consists of four modules: literature management, literature extraction, literature retrieval, and question answering. The core techniques used to support the four modules across the platform include a fine-tuned model PaperExtractGPT and a continual pre-training model ChatPaperGPT based on ChatGLM 2 using the data from scientific research literature, responsible for information extraction and communication, respectively. Due to their powerful capabilities in natural language understanding and generation, LLMs can understand complex scientific concepts based on the provided contexts, and thus generate high-quality texts and conduct in-depth information retrieval and question answering. Our platform can help researchers manage and utilize literature more effectively and efficiently for finding relevant literature, obtaining required information, and generating new knowledge.

关键词： Training Large language models Knowledge graphs Information retrieval data models Question answering (information retrieval)

来源：评论

学校读者我要写书评

暂无评论

Group RandAugment: Video Augmentation for Action Recognition 5

Group RandAugment: Video Augmentation for Action Recognition

引用

5th International Conference on data Science and Information technology, DSIT 2022

作者： An, Fengmin Zhang, Bingbing Wang, Zhenwei Dong, Wei Zhang, Jianxin School of Computer Science and Engineering Dalian Minzu University Dalian China Institute of Machine Intelligence and Bio-computing Dalian Minzu University Dalian China SEAC Key Lab of Big Data Applied Technology Dalian Minzu University Dalian China School of Information and Communication Engineering Dalian University of Technology Dalian China

ISBN: (数字)9781665498685

ISBN: (纸本)9781665498685

data augmentation, as a critical strategy in deep learning, well improves the sample diversity for network training, leading to the obvious improvement of model generalization ability. Besides, automatic data augmentation, while sparking in image tasks, has attracted too little attention in video recognition task. Therefore, this work explores a novel group random augmentation (GRA) that automatically augments video data for recognition. GRA first collects 21 augmentation transformations to enrich the sample diversity, and then divides these transformations into four groups (i.e., pixel-transform, rigidtransform, erasing-transform, environment-transform) to reduce the excessive regularization caused by similar augmentation. To reduce the computational cost of finding the optimal setting, GRA adopts the combination form to select the optimal situation. For frames in the same video clip, GRA uses synchronous GRA. Additionally, the proposed GRA can be integrated into any existing video frameworks. To prove the effectiveness of GRA, we conduct experiments on two commonly used video action recognition benchmarks (Something-Something V1 & V2) and three typical frameworks (TSM, GSM, and TEA), whose results demonstrate GRA can improve performance in all cases without adding additional computational cost. © 2022 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Shared Incentive System for Clinical Pathway Experience

Shared Incentive System for Clinical Pathway Experience

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Weiqi Dai Wenhao Zhao Xia Xie Song Wu Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology Hainan University Haikou China

The phenomenon of unbalanced regional medical resources has led to large differences in the implementation experience of clinical pathways in hospitals with different medical levels. However, due to the fear of privacy leakage and the lack of sharing motivation, there is a lack of effective collaborative communication channels for clinical pathways among medical institutions. In response to these problems, we propose a blockchain-based sharing incentive scheme for clinical pathway experience, which uses the clinical pathway implementation effect evaluation system to evaluate the quality of clinical pathway experience data. Specifically, we designe a two-phase cross-domain shared transaction model for the transaction of clinical pathway experience data. Moreover, we introduce the shared transaction alliance committee to verify and review the transaction, and solve the problems in the transaction in the arbitration phase. Finally, the functional test results show that the system meets the experience sharing incentive requirements, and the performance test results show that the TPS of sharing clinical pathway experience read and writed can reach around 600 and 1000, and the transaction latency of each phase is within 3 s.

关键词： Privacy Hospitals Collaboration Communication channels data models Security Incentive schemes

来源：评论

学校读者我要写书评

暂无评论

Automatic Life Event Tree Generation for Older Adults 1

引用

24th International Conference on Human-Computer Interaction, HCII 2022

作者： Gui, Fang Wu, Xi Hu, Min Yang, Jiaoyun School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

Studies have shown that learning personal stories could help provide individualized eldercare services. However, personal stories are often disordered because of the scattered collection, including informal interviews or daily interactions, which brings difficulties in acquiring valuable information quickly. One solution to this problem is to extract events from personal stories and automatically organize them in chronological order. Events extracted by current methods from social media or news corpus are mainly organized in a linear structure. These works usually focus on the event time and ignore the consistency of event contents when organizing events. This paper aims to organize events into a tree structure based on an event network, with stem nodes representing key event topics and branch nodes representing detailed events. Social workers or caregivers can clarify the life experience of the older adults quickly through the event tree and have a preliminary understanding of them. The experiments show that the event tree generated by our method has a better performance in consistency than current event organization methods. A survey study shows that our method achieves the highest logical coherence for the event tree branches compared with other algorithms. © 2022, Springer Nature Switzerland AG.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

RAHP: A Redundancy-aware Accelerator for High-performance Hypergraph Neural Network

RAHP: A Redundancy-aware Accelerator for High-performance Hy...

引用

IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： Hui Yu Yu Zhang Ligang He Yingqi Zhao Xintao Li Ruida Xin Jin Zhao Xiaofei Liao Haikun Liu Bingsheng He Hai Jin National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Computer Science University of Warwick United Kingdom National University of Singapore Singapore

ISBN: (数字)9798350350579

ISBN: (纸本)9798350350586

Hypergraph Neural Network (HyperGNN) has emerged as a potent methodology for dissecting intricate multilateral connections among various entities. Current software/hardware solutions leverage a sequential execution model that relies on hyperedge and vertex indices for conducting standard matrix operations for HyperGNN inference. Yet, they are impeded by the dual challenges of redundant computation and irregular memory access overheads. This is primarily due to the frequent and repetitive access and updating of a number of feature vectors corresponding to the same hyperedges and vertices. To address these challenges, we propose the first redundancy-aware accelerator, RAHP, which enables high performance execution of HyperGNN inference. Specifically, we present a redundancy-aware asynchronous execution approach into the accelerator design for HyperGNN to reduce redundant computations and off-chip memory accesses. To unveil opportunities for data reuse and unlock the parallelism that existing HyperGNN solutions fail to capture, it prioritizes vertices with the highest degree as roots, prefetching other vertices along the hypergraph structure to capture the common vertices among multiple hyperedges, and synchronizing the computations of hyperedges and vertices in real-time. By such means, this facilitates the concurrent processing of relevant hyperedge and vertex computations of the common vertices along the hypergraph topology, resulting in smaller redundant computations overhead. Furthermore, by efficiently caching intermediate results of the common vertices, it curtails memory traffic and off-chip communications. To fully harness the performance potential of our proposed approach in the accelerator, RAHP incorporates a topology-driven data loading mechanism to minimize off-chip memory accesses on the fly. It is also endowed with an adaptive data synchronization scheme to mitigate the effects of conflicting updates of both hyperedges and vertices. Moreover, RAHP emplo

关键词： Computational modeling Neural networks Memory management Loading Energy conservation Vectors Software Topology Synchronization Standards

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：