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

A Novel High-Efficiency Transaction Verification Scheme for Blockchain Systems

computer Modeling in Engineering & sciences 2024年第5期139卷 1613-1633页

作者： Jingyu Zhang Pian Zhou Jin Wang Osama Alfarraj Saurabh Singh Min Zhu School of Computer&Communication Engineering Changsha University of Science&TechnologyChangsha410015China Science and Technology on Information Systems Engineering Laboratory School of Systems EngineeringNational University of Defense TechnologyChangsha410073China Computer Science Department King Saud UniversityRiyadh11437Saudi Arabia Department of Artificial Intelligence and Big Data Woosong UniversityDaejeon34606South Korea College of Information Science and Technology Zhejiang Shuren UniversityHangzhou310015China

Blockchain can realize the reliable storage of a large amount of data that is chronologically related and verifiable within the *** technology has been widely used and has developed rapidly in big data systems across various *** increasing number of users are participating in application systems that use blockchain as their underlying *** the number of transactions and the capital involved in blockchain grow,ensuring information security becomes *** the verification of transactional information security and privacy has emerged as a critical ***-based verification methods can effectively eliminate the need for centralized third-party ***,the efficiency of nodes in storing and verifying blockchain data faces unprecedented *** address this issue,this paper introduces an efficient verification scheme for transaction ***,it presents a node evaluation module to estimate the activity level of user nodes participating in transactions,accompanied by a probabilistic analysis for all ***,this paper optimizes the conventional transaction organization form,introduces a heterogeneous Merkle tree storage structure,and designs algorithms for constructing these heterogeneous *** analyses and simulation experiments conclusively demonstrate the superior performance of this *** verifying the same number of transactions,the heterogeneous Merkle tree transmits less data and is more efficient than traditional *** findings indicate that the heterogeneous Merkle tree structure is suitable for various blockchain applications,including the Internet of *** scheme can markedly enhance the efficiency of information verification and bolster the security of distributed systems.

关键词： Blockchain architecture transaction verification information security heterogeneous Merkle tree distributed systems

来源：评论

学校读者我要写书评

暂无评论

Harnessing Large Language Models for Text-Rich Sequential Recommendation 24

Harnessing Large Language Models for Text-Rich Sequential Re...

引用

33rd ACM Web Conference, WWW 2024

作者： Zheng, Zhi Chao, WenShuo Qiu, Zhaopeng Zhu, Hengshu Xiong, Hui School of Data Science University of Science and Technology of China China Career Science Lab BOSS Zhipin China China China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

ISBN: (纸本)9798400701719

Recent advances in Large Language Models (LLMs) have been changing the paradigm of Recommender Systems (RS). However, when items in the recommendation scenarios contain rich textual information, such as product descriptions in online shopping or news headlines on social media, LLMs require longer texts to comprehensively depict the historical user behavior sequence. This poses significant challenges to LLM-based recommenders, such as over-length limitations, extensive time and space overheads, and suboptimal model performance. To this end, in this paper, we design a novel framework for harnessing Large Language Models for Text-Rich Sequential Recommendation (LLM-TRSR). Specifically, we first propose to segment the user historical behaviors and subsequently employ an LLM-based summarizer for summarizing these user behavior blocks. Particularly, drawing inspiration from the successful application of Convolutional Neural Networks (CNN) and Recurrent Neural Networks (RNN) models in user modeling, we introduce two unique summarization techniques in this paper, respectively hierarchical summarization and recurrent summarization. Then, we construct a prompt text encompassing the user preference summary, recent user interactions, and candidate item information into an LLM-based recommender, which is subsequently fine-tuned using Supervised Fine-Tuning (SFT) techniques to yield our final recommendation model. We also use Low-Rank Adaptation (LoRA) for Parameter-Efficient Fine-Tuning (PEFT). We conduct experiments on two public datasets, and the results clearly demonstrate the effectiveness of our approach. © 2024 ACM.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Monte Carlo Tree Search-Based Agent Negotiation Framework for Shared Decision-Making 5

Monte Carlo Tree Search-Based Agent Negotiation Framework fo...

引用

5th International Conference on Big data and Artificial Intelligence and Software Engineering, ICBASE 2024

作者： Chen, Xin Liu, Yong Lu, Ping Lin, Kai-Biao Xiamen Institute of Technology School of Data Science and Computer Science Xiamen361021 China Xiamen University of Technology School of Economic and Management Xiamen361024 China Xiamen University of Technology Department of Computer Science and Technology Xiamen361024 China

ISBN: (纸本)9798331506612

Shared Decision-Making (SDM) is a collaborative process in which patients and healthcare providers jointly make medical decisions, integrating clinical evidence with the patient's preferences and values. Although previous research has focused on SDM through decision-support tools or manual negotiations, these methods have been limited by time and cost constraints. To overcome these challenges, this study introduces an automated SDM negotiation framework using Monte Carlo Tree Search (MCTS) to support decision-making for both doctors and patients. The proposed MCTSAN model demonstrates superior performance across various scenarios with differing issue complexities. Notably, it maintains high overall satisfaction and reduces satisfaction disparities between patients and healthcare providers, even as negotiation complexity increases. The model typically reaches agreements within 7 to 15 negotiation rounds, effectively enhancing satisfaction and social welfare while minimizing the time and space costs associated with negotiations. This negotiation framework proves to be a valuable tool in facilitating and promoting SDM in clinical settings. © 2024 IEEE.

关键词： Clinical research

来源：评论

学校读者我要写书评

暂无评论

Intelligent Chatbot for Hospital Recommendation System 2

Intelligent Chatbot for Hospital Recommendation System

引用

2nd International Conference on Disruptive Technologies, ICDT 2024

作者： Rajkumar, K. Ragupathi, T. Karthikeyan, S. School of Computing Srm Institute of Science and Technology Department of Data Science and Business Systems Tamil Nadu Kattankulathur India Department of Computer Science and Engineering Bangalore562112 India

ISBN: (纸本)9798350371055

The main objective of this project is to create a user-friendly intelligent chatbot for Medical guidance and support. This application has been classified into two different modes based on user preference, those are Online and Offline modes of interaction. In the Online mode of interaction, there is no need for any automation, there will be a real person at the other end answering user queries. Users can even ask for untrained data and will receive instant replies. This application is similar to a normal chat application, but the main disadvantage is that a real person is needed at the other end at all times. In the Offline mode of conversation which is entirely automated the user will be performing an interaction with the chatbot itself. The chatbot must consist of data sets and trained data collection, in this process there is no need for any real person, the chatbot itself will reply instantly based on the trained data. The chatbot will be more accurate when a large number of data is trained. This application is compatible with working in various browsers and varied networks. The Admin of the application plays a significant role. Admin can access all the given functions and is responsible for data training. data training plays a vital role in this application, the trained data will be used by the chatbot while answering user queries i.e. Offline mode. This chatbot application can be accessed by several users at the same time, where IP address plays the main role. The main function of this application is that user can post their corresponding queries and the application will be providing relevant information based on queries. The Latest Modern chatbots are used in applications where simple interaction is needed, for example, service and marketing technology to provide answers such as products, services, and consultancy. If the customer's queries don't match with the trained data sets, the customer will be escalated to manual interaction i.e. Online mode. © 2024 IE

关键词： Automated Intelligent Chat IP Address Offline mode Online mode Trained data

来源：评论

学校读者我要写书评

暂无评论

PRESS: Defending Privacy in Retrieval-Augmented Generation via Embedding Space Shifting

PRESS: Defending Privacy in Retrieval-Augmented Generation v...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： He, Jiaming Liu, Cheng Hou, Guanyu Jiang, Wenbo Li, Jiachen School of Computer Science and Engineering University of Electronic Science and Technology of China China College of Computer Science and Cyber Security Oxford Brookes College Chengdu University of Technology China School of Data Science The Chinese University of Hong Kong Shenzhen China School of Computer Science and Artificial Intelligence Wuhan University of Technology China

ISBN: (纸本)9798350368741

Retrieval-augmented generation (RAG) expands the capabilities of large language models (LLMs) in various applications by integrating relevant information retrieved from external data sources. However, the RAG systems are exposed to substantial privacy risks during the information retrieval process, leading to potential data leakage of private information. In this work, we present a Privacy-preserving Retrieval-augmented generation via Embedding Space Shifting (PRESS), systematically exploring how to protect privacy in RAG systems. Specifically, we first conduct proximal policy optimization (PPO) based training on pre-trained language models to generate target training samples. Then we employ a purposive shift fine-tuning on the text embedding model with the generated samples for guiding the RAG system to map potential privacy leaking queries to safe target in embedding space. Extensive experimental results on representative models and datasets demonstrate that our protection method achieves high defense performance with high efficiency while keeping the normal functionality of the RAG system. © 2025 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Drawing Order Diagrams Through Two-Dimension Extension

引用

Journal of Graph Algorithms and Applications 2023年第9期27卷 783-802页

作者： Dürrschnabel, Dominik Hanika, Tom Stumme, Gerd Knowledge & Data Engineering Group Research Center for Information System Design & Department of Electrical Engineering and Computer Science University of Kassel Germany Institute of Computer Science University of Hildesheim Germany Berlin School of Library and Information Science Humboldt-Universität zu Berlin Germany

Ordinal real-world data such as concept hierarchies, ontologies, genealogies, or task dependencies in scheduling often has the property to not only contain pairwise comparable, but also incomparable elements. Order diagrams provide an important tool for understanding and thus discovering knowledge in such data. Easily readable drawings of such order diagrams are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work, we present the novel algorithm DimDraw to decompose an ordered set (e.g., a concept hierarchy) in linear orders and to produce a corresponding order diagram. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of its transitive incompatibility graph. To evaluate the quality of the algorithm, a user study was conducted where generated drawings were compared with ones from state-of-the-art drawing algorithms. © 2023 Brown University. All rights reserved.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

Fitness Sharing Chaotic Particle Swarm Optimization (FSCPSO): A Metaheuristic Approach for Allocating Dynamic Virtual Machine (VM) in Fog Computing Architecture

引用

computers, Materials & Continua 2024年第8期80卷 2557-2578页

作者： Prasanna Kumar Kannughatta Ranganna Siddesh Gaddadevara Matt Chin-Ling Chen Ananda Babu Jayachandra Yong-Yuan Deng Department of Computer Science&Engineering Ramaiah Institute of TechnologyBangalore560054India Department of Artificial Intelligence&Data Science Ramaiah Institute of TechnologyBangalore560054India School of Information Engineering Changchun Sci-Tech UniversityChangchun130600China Department of Computer Science and Information Engineering Chaoyang University of TechnologyTaichung41349Taiwan Department of Information Science and Engineering Malnad College of EngineeringHassan573202India

In recent decades,fog computing has played a vital role in executing parallel computational tasks,specifically,scientific workflow *** cloud data centers,fog computing takes more time to run workflow ***,it is essential to develop effective models for Virtual Machine(VM)allocation and task scheduling in fog computing *** task scheduling,VM migration,and allocation,altogether optimize the use of computational resources across different fog *** process ensures that the tasks are executed with minimal energy consumption,which reduces the chances of resource *** this manuscript,the proposed framework comprises two phases:(i)effective task scheduling using a fractional selectivity approach and(ii)VM allocation by proposing an algorithm by the name of Fitness Sharing Chaotic Particle Swarm Optimization(FSCPSO).The proposed FSCPSO algorithm integrates the concepts of chaos theory and fitness sharing that effectively balance both global exploration and local *** balance enables the use of a wide range of solutions that leads to minimal total cost and makespan,in comparison to other traditional optimization *** FSCPSO algorithm’s performance is analyzed using six evaluation measures namely,Load Balancing Level(LBL),Average Resource Utilization(ARU),total cost,makespan,energy consumption,and response *** relation to the conventional optimization algorithms,the FSCPSO algorithm achieves a higher LBL of 39.12%,ARU of 58.15%,a minimal total cost of 1175,and a makespan of 85.87 ms,particularly when evaluated for 50 tasks.

关键词： Fog computing fractional selectivity approach particle swarm optimization algorithm task scheduling virtual machine allocation

来源：评论

学校读者我要写书评

暂无评论

Cavity-agnostic acoustofluidic manipulations enabled by guided flexural waves on a membrane acoustic waveguide actuator

引用

Microsystems & Nanoengineering 2024年第2期10卷 153-171页

作者： Philippe Vachon Srinivas Merugu Jaibir Sharma Amit Lal Eldwin J.Ng Yul Koh Joshua E.-Y.Lee Chengkuo Lee Department of Electrical and Computer Engineering National University of SingaporeSingaporeSingapore Institute of Microelectronics Agency for ScienceTechnology and Research(A*STAR)SingaporeSingapore SonicMEMS Laboratory School of Electrical and Computer EngineeringCornell UniversityIthacaNYUSA School of Electrical and Data Engineering University of Technology SydneyUltimoNSWAustralia

This article presents an in-depth exploration of the acoustofluidic capabilities of guided flexural waves(GFWs)generated by a membrane acoustic waveguide actuator(MAWA).By harnessing the potential of GFWs,cavity-agnostic advanced particle manipulation functions are achieved,unlocking new avenues for microfluidic systems and lab-on-a-chip *** localized acoustofluidic effects of GFWs arising from the evanescent nature of the acoustic fields they induce inside a liquid medium are numerically investigated to highlight their unique and promising *** traditional acoustofluidic technologies,the GFWs propagating on the MAWA’s membrane waveguide allow for cavity-agnostic particle manipulation,irrespective of the resonant properties of the fluidic ***,the acoustofluidic functions enabled by the device depend on the flexural mode populating the active region of the membrane *** demonstrations using two types of particles include in-sessile-droplet particle transport,mixing,and spatial separation based on particle diameter,along with streaming-induced counter-flow virtual channel generation in microfluidic PDMS *** experiments emphasize the versatility and potential applications of the MAWA as a microfluidic platform targeted at lab-on-a-chip development and showcase the MAWA’s compatibility with existing microfluidic systems.

关键词： waveguide fluid cavity

来源：评论

学校读者我要写书评

暂无评论

SARA: A Sparsity-Aware Efficient Oblivious Aggregation Service for Federated Matrix Factorization 25th

SARA: A Sparsity-Aware Efficient Oblivious Aggregation Servi...

引用

25th International Conference on Web Information Systems Engineering, WISE 2024

作者： Zheng, Yifeng Xiong, Tianchen Ouyang, Huajie Wang, Songlei Hua, Zhongyun Gao, Yansong School of Computer Science and Technology Harbin Institute of Technology Shenzhen China Data61 CSIRO Sydney Australia

ISBN: (纸本)9789819605668

Federated matrix factorization (FedMF) has recently emerged as a privacy-friendly paradigm which runs matrix factorization (MF) in a federated learning (FL) setting and enables users to keep their individual rating data local in the training process. In FedMF, users only need to share out item gradients for aggregation. However, prior work has shown that the item gradients, if directly exposed, can still leak users’ rating data. Meanwhile, the rating data are typically sparse and simply uploading the gradients of rated items will leak which and how many items a user rates. In light of the above, in this paper, we present SARA, a new sparsity-aware efficient oblivious aggregation service for FedMF. SARA protects the confidentiality of item gradients as well as hides which and how many items a user rates, through a custom sparsity-aware design that delicately builds on differential privacy and lightweight cryptography. Extensive experiments over real-world datasets demonstrate that SARA is utility-preserving and can bring the users significant savings (up to 98.28%) in the number of transmitted item gradients, compared to the baseline of fully transmitting gradients for all possible items. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

An Amalgamated CNN-Transformer Network for Lightweight Image Super-Resolution

Journal of Network Intelligence

引用

Journal of Network Intelligence 2024年第3期9卷 1376-1387页

作者： Fang, Jinsheng Lin, Hanjiang Zeng, Kun School of Computer Science and Engineering Minnan Normal University Zhangzhou363000 China Key Laboratory of Data Science and Intelligence Application Fujian Province University Fujian Zhangzhou363000 China School of Computer and Control engineering Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou350108 China

Recently, Transformer-based methods for single image super-resolution (SISR) have achieved better performance advantages than the methods based on convolutional neural network (CNN). Exploiting self-attention mechanism to model global context definitely improves the SR results. However, the neglect of local information will bring inevitable reduction of the network performance. In this work, we propose an Amalgamated CNN-Transformer network for lightweight SR, namely ACTSR. Specifically, an amalgamated CNN-Transformer block (ACTB) is developed to extract the useful information of both local and global features. By employing stacked ACTBs, our ACTSR extracts more informative deep features beneficially for super-resolution reconstruction to improve network performance while keeps lightweight and flexible enough. Extensive experiments on commonly used benchmark datasets validate our ACTSR outperforms the advanced competitors. Our codes are available at: https://***/ginsengf/ACTSR. © 2024, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：