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

Transaction transmission model for blockchain channels based on non-cooperative games

science China(Information sciences) 2023年第1期66卷 97-114页

作者： Peiyun ZHANG Chenxi LI Mengchu ZHOU Wenjun HUANG Abdullah ABUSORRAH Omaimah O.BAMASAG Engineering Research Center of Digital Forensics of Ministry of Education School of Computer and SoftwareNanjing University of Information Science and Technology School of Computer and Information Anhui Normal University Department of Electrical and Computer Engineering New Jersey Institute of Technology Center of Research Excellence in Renewable Energy and Power Systems Department of Electrical and Computer Engineering Faculty of Engineering and K.A.CARE Energy Research and Innovation CenterKing Abdulaziz University Department of Computer Science Faculty of Computing and Information Technology Center of Excellence in Smart Environment Research King Abdulaziz University

In blockchain networks, transactions can be transmitted through channels. The existing transmission methods depend on their routing information. If a node randomly chooses a channel to transmit a transaction, the transmission may be aborted due to insufficient funds(also called balance) or a low transmission rate. To increase the success rate and reduce transmission delay across all transactions, this work proposes a transaction transmission model for blockchain channels based on non-cooperative game *** balance, channel states, and transmission probability are fully considered. This work then presents an optimized channel transaction transmission algorithm. First, channel balances are analyzed and suitable channels are selected if their balance is sufficient. Second, a Nash equilibrium point is found by using an iterative sub-gradient method and its related channels are then used to transmit transactions. The proposed method is compared with two state-of-the-art approaches: Silent Whispers and Speedy Murmurs. Experimental results show that the proposed method improves transmission success rate, reduces transmission delay,and effectively decreases transmission overhead in comparison with its two competitive peers.

关键词： Blockchain channel transaction transmission channel balance channel state channel transmission probability non-cooperative game

来源：评论

学校读者我要写书评

暂无评论

Mixture of Experts for Audio-visual Learning 38

Mixture of Experts for Audio-Visual Learning

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Cheng, Ying Li, Yang He, Junjie Feng, Rui School of Computer Science Fudan University China Shanghai Key Laboratory of Intelligent Information Processing China Shanghai Collaborative Innovation Center of Intelligent Visual Computing China

With the rapid development of multimedia technology, audio-visual learning has emerged as a promising research topic within the field of multimodal analysis. In this paper, we explore parameter-efficient transfer learning for audio-visual learning and propose the Audio-visual Mixture of Experts (AVMoE) to inject adapters into pre-trained models flexibly. Specifically, we introduce unimodal and cross-modal adapters as multiple experts to specialize in intra-modal and inter-modal information, respectively, and employ a lightweight router to dynamically allocate the weights of each expert according to the specific demands of each task. Extensive experiments demonstrate that our proposed approach AVMoE achieves superior performance across multiple audio-visual tasks, including AVE, AVVP, AVS, and AVQA. Furthermore, visual-only experimental results also indicate that our approach can tackle challenging scenes where modality information is missing. The source code is available at https://***/yingchengy/AVMOE. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exploring Multiscale Navigation of Homogeneous and Dense Objects with Progressive Refinement in Virtual Reality 32

Exploring Multiscale Navigation of Homogeneous and Dense Obj...

引用

32nd IEEE Conference on Virtual Reality and 3D User Interfaces, VR 2025

作者： Pavanatto, Leonardo Giovannelli, Alexander Giera, Brian Bremer, Timo Miao, Haichao Bowman, Doug A. Virginia Tech Center for Human-Computer Interaction Department of Computer Science United States Lawrence Livermore National Laboratory Center for Applied Scientific Computing United States

ISBN: (纸本)9798331536459

Locating small features in a large, dense object in virtual reality (VR) poses a significant interaction challenge. While existing multiscale techniques support transitions between various levels of scale, they are not focused on handling dense, homogeneous objects with hidden features. We propose a novel approach that applies the concept of progressive refinement to VR navigation, enabling focused inspections. We conducted a user study where we varied two independent variables in our design, navigation style (STRUCTURED vs. UNSTRUCTURED) and display mode (SELECTION vs. EVERYTHING), to better understand their effects on efficiency and awareness during multiscale navigation. Our results showed that unstructured navigation can be faster than structured and that displaying only the selection can be faster than displaying the entire object. However, using an everything display mode can support better location awareness and object understanding. © 2025 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Elevating Localization Accuracy in Wireless Sensor Networks:A Refined DV-Hop Approach

引用

computers, Materials & Continua 2024年第10期81卷 1511-1528页

作者： Muhammad Aamer Ejaz Kamalrulnizam Abu Bakar Ismail Fauzi Bin Isnin Babangida Isyaku Taiseer Abdalla Elfadil Eisa Abdelzahir Abdelmaboud Asma Abbas Hassan Elnour Department of Computer Science Faculty of ComputingUniversiti Technologi MalaysiaJohor Bahru81310Malaysia Department of Computer Science Faculty of Computing and Information TechnologySule Lamido UniversityP.M.B.048Kafin Hausa741103Nigeria Department of Information Systems-Girls Section King Khalid UniversityMahayil62529Saudi Arabia Humanities Research Center Sultan Qaboos UniversityMuscat123Oman

Localization is crucial in wireless sensor networks for various applications,such as tracking objects in outdoor environments where GPS(Global Positioning System)or prior installed infrastructure is ***,traditional techniques involve many anchor nodes,increasing costs and reducing *** solutions do not address the selection of appropriate anchor nodes and selecting localized nodes as assistant anchor nodes for the localization process,which is a critical element in the localization ***,an inaccurate average hop distance significantly affects localization *** propose an improved DV-Hop algorithm based on anchor sets(AS-IDV-Hop)to improve the localization *** simulation analysis,we validated that the ASIDV-Hop proposed algorithm is more efficient in minimizing localization errors than existing *** ASIDV-Hop algorithm provides an efficient and cost-effective solution for localization in Wireless Sensor *** strategically selecting anchor and assistant anchor nodes and rectifying the average hop distance,AS-IDV-Hop demonstrated superior performance,achieving a mean accuracy of approximately 1.59,which represents about 25.44%,38.28%,and 73.00%improvement over other algorithms,*** estimated localization error is approximately 0.345,highlighting AS-IDV-Hop’s *** substantial reduction in localization error underscores the advantages of implementing AS-IDV-Hop,particularly in complex scenarios requiring precise node localization.

关键词： Localization anchor nodes collinearity connectivity hop based

来源：评论

学校读者我要写书评

暂无评论

3-Multi ranked encryption with enhanced security in cloud computing

引用

Digital Communications and Networks 2023年第2期9卷 313-326页

作者： YeEun Kim Junggab Son Reza M.Parizi Gautam Srivastava Heekuck Oh Major in Bio Artificial Intelligence Dept.of Computer Science and EngineeringHanyang UniversityAnsanRepublic of Korea Department of Computer Science Kennesaw State UniversityMariettaUSA Department of Software Engineering Kennesaw State UniversityMariettaUSA Department of Mathematics and Computer Science Brandon UniversityBrandonCanada Research Center for Interneural Computing China Medical UniversityTaichungTaiwanChina Dept.of Computer Science and Engineering Hanyang UniversityAnsanRepublic of Korea

Searchable Encryption(SE)enables data owners to search remotely stored ciphertexts selectively.A practical model that is closest to real life should be able to handle search queries with multiple keywords and multiple data owners/users,and even return the top-k most relevant search results when *** refer to a model that satisfies all of the conditions a 3-multi ranked search ***,SE schemes that have been proposed to date use fully trusted trapdoor generation centers,and several methods assume a secure connection between the data users and a trapdoor generation *** is,they assume the trapdoor generation center is the only entity that can learn the information regarding queried keywords,but it will never attempt to use it in any other manner than that requested,which is impractical in real *** this study,to enhance the security,we propose a new 3-multi ranked SE scheme that satisfies all conditions without these security *** proposed scheme uses randomized keywords to protect the interested keywords of users from both outside adversaries and the honest-but-curious trapdoor generation center,thereby preventing attackers from determining whether two different queries include the same ***,we develop a method for managing multiple encrypted keywords from every data owner,each encrypted with a different *** evaluation demonstrates that,despite the trade-off overhead that results from the weaker security assumption,the proposed scheme achieves reasonable performance compared to extant schemes,which implies that our scheme is practical and closest to real life.

关键词： Searchable encryption Multi-keyword search Multiple data owners/users Ranked search Enhanced security

来源：评论

学校读者我要写书评

暂无评论

P3DC:Reducing DRAM Cache Hit Latency by Hybrid Mappings

引用

Journal of computer science & Technology 2024年第6期39卷 1341-1360页

作者： Ye Chi Ren-Tong Guo Xiao-Fei Liao Hai-Kun Liu Jianhui Yue National Engineering Research Center for Big Data Technology and System Wuhan 430074China Services Computing Technology and System Laboratory Wuhan 430074China Cluster and Grid Computing Laboratory Wuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China School of Big Data and Internet Shenzhen Technology UniversityShenzhen 518118China Department of Computer Science Michigan Technological UniversityHoughton 49931-1295U.S.A.

Die-stacked dynamic random access memory(DRAM)caches are increasingly advocated to bridge the performance gap between the on-chip cache and the main *** fully realize their potential,it is essential to improve DRAM cache hit rate and lower its cache hit *** order to take advantage of the high hit-rate of set-association and the low hit latency of direct-mapping at the same time,we propose a partial direct-mapped die-stacked DRAM cache called *** design is motivated by a key observation,i.e.,applying a unified mapping policy to different types of blocks cannot achieve a high cache hit rate and low hit latency *** address this problem,P3DC classifies data blocks into leading blocks and following blocks,and places them at static positions and dynamic positions,respectively,in a unified set-associative *** also propose a replacement policy to balance the miss penalty and the temporal locality of different *** addition,P3DC provides a policy to mitigate cache thrashing due to block type *** results demonstrate that P3DC can reduce the cache hit latency by 20.5%while achieving a similar cache hit rate compared with typical set-associative caches.P3DC improves the instructions per cycle(IPC)by up to 66%(12%on average)compared with the state-of-the-art direct-mapped cache—BEAR,and by up to 19%(6%on average)compared with the tag-data decoupled set-associative cache—DEC-A8.

关键词： die-stacked dynamic random access memory(DRAM) cache set-associative direct-mapped hit latency

来源：评论

学校读者我要写书评

暂无评论

Neural Network-Based State Estimation for Nonlinear Systems With Denial-of-Service Attack Under Try-Once-Discard Protocol

引用

IEEE/CAA Journal of Automatica Sinica 2024年第10期11卷 2182-2184页

作者： Xueli Wang Shangwei Zhao Ming Yang Xin Wang Xiaoming Wu the Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science CenterQilu University of Technology(Shandong Academy of Sciences)Jinan 250014 Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan 250014China Department of Automation Shanghai Jiao Tong UniversityShanghai 200240China

Dear Editor,This letter deals with state estimation issues of discrete-time nonlinear systems subject to denial-of-service(DoS)attacks under the try-once-discard(TOD)*** specifically,to reduce the communication burden,a TOD protocol with novel update rules on protocol weights is designed for scheduling measurement *** addition,unknown nonlinear functions vulnerable to DoS attacks are considered due to the openness and vulnerability of the network.

关键词： Service DoS service

来源：评论

学校读者我要写书评

暂无评论

SEED-VII: A Multimodal Dataset of Six Basic Emotions with Continuous Labels for Emotion Recognition

引用

IEEE Transactions on Affective computing 2024年第2期16卷 969-985页

作者： Jiang, Wei-Bang Liu, Xuan-Hao Zheng, Wei-Long Lu, Bao-Liang Shanghai Jiao Tong University Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Brain Science and Technology Research Center Shanghai200240 China

Recognizing emotions from physiological signals is a topic that has garnered widespread interest, and research continues to develop novel techniques for perceiving emotions. However, the emergence of deep learning has highlighted the need for comprehensive and high-quality emotional datasets that enable the accurate decoding of human emotions. To systematically explore human emotions, we develop a multimodal dataset consisting of six basic (happiness, sadness, fear, disgust, surprise, and anger) emotions and the neutral emotion, named SEED-VII. This multimodal dataset includes electroencephalography (EEG) and eye movement signals. The seven emotions in SEED-VII are elicited by 80 different videos and fully investigated with continuous labels that indicate the intensity levels of the corresponding emotions. Additionally, we propose a novel Multimodal Adaptive Emotion Transformer (MAET), that can flexibly process both unimodal and multimodal inputs. Adversarial training is utilized in the MAET to mitigate subject discrepancies, which enhances domain generalization. Our extensive experiments, encompassing both subject-dependent and cross-subject conditions, demonstrate the superior performance of the MAET in terms of handling various inputs. Continuous labels are used to filter the data with high emotional intensity, and this strategy is proven to be effective for attaining improved emotion recognition performance. Furthermore, complementary properties between the EEG signals and eye movements and stable neural patterns of the seven emotions are observed. © 2010-2012 IEEE.

关键词： Eye movements

来源：评论

学校读者我要写书评

暂无评论

POSTER: Learning to Parallelize in a Shared-Memory Environment with Transformers 28

POSTER: Learning to Parallelize in a Shared-Memory Environme...

引用

28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, PPoPP 2023

作者： Harel, Re'Em Pinter, Yuval Oren, Gal Department of Computer Science Ben-Gurion University of the Negev Department of Physics Scientific Computing Center Nuclear Research Center Negev Israel Department of Computer Science Ben-Gurion University of the Negev Israel Department of Computer Science Technion - Israel Institute of Technology Scientific Computing Center Nuclear Research Center Negev Israel

ISBN: (纸本)9798400700156

In past years, the world has switched to multi and many core shared memory architectures. As a result, there is a growing need to utilize these architectures by introducing shared memory parallelization schemes, such as OpenMP, to applications. Nevertheless, introducing OpenMP work-sharing loop construct into code, especially legacy code, is challenging due to pervasive pitfalls in management of parallel shared memory. To facilitate the performance of this task, many source-to-source (S2S) compilers have been created over the years, tasked with inserting OpenMP directives into code automatically. In addition to having limited robustness to their input format, these compilers still do not achieve satisfactory coverage and precision in locating parallelizable code and generating appropriate directives. In this work, we propose leveraging recent advances in machine learning techniques, specifically in natural language processing (NLP), to suggest the need for an OpenMP work-sharing loop directive and data-sharing attributes clauses - the building blocks of concurrent programming. We train several transformer models, named PragFormer, for these tasks and show that they outperform statistically-trained baselines and automatic source-to-source (S2S) parallelization compilers in both classifying the overall need for an parallel for directive and the introduction of private and reduction clauses. In the future, our corpus can be used for additional tasks, up to generating entire OpenMP directives. The source code and database for our project can be accessed on GitHub 1 and HuggingFace 2. © 2023 Owner/Author.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Job Resumes Recommendation using Integration of Fuzzy Discernibility Matrix Feature Selection and Convolutional Neural Network Multi-label Text Classification

引用

Informatica (Slovenia) 2025年第13期49卷 49-58页

作者： Hayami, Regiolina Yusoff, Nooraini Daud, Kauthar Mohd Fatma, Yulia Department of Informatics Engineering Faculty Computer Science Universitas Muhammadiyah Riau Indonesia Faculty of Data Science and Computing Universiti Malaysia Kelantan 16100 Malaysia Center for Artificial Intelligence Technology Faculty of Information Science and Technology Universiti Kebangsaan Malaysia 43600 Malaysia

The manual analysis of job resumes poses specific challenges, including the time-intensive process and the high likelihood of human error, emphasizing the need for automation in content-based recommendations. Recent advancements in deep learning, particularly Convolutional Neural Networks (CNN) for Multi-label Text Classification (MLTC), offer a promising solution for addressing these challenges through artificial intelligence. While CNN is renowned for its robust feature extraction capabilities, it faces specific challenges such as managing high-dimensional data and poor data interpretability. To address these limitations, this study employs the Fuzzy Discernibility Matrix (FDM) feature selection technique to determine the relevance of skills for each job vacancy. FDM assigns weights to the features of each job category and ranks their relevance based on the highest scores, which are then utilized in the MLTC CNN model. The integration of FDM and MLTC CNN serves as the foundation for generating content-based recommendations derived from key features in job resumes. This study produces a content-based job recommendation system that displays the top three job categories, accompanied by explanations of the skills supporting each selected category. These recommendations also consider cosine similarity values between analyzed items and the integrated results of FDM and MLTC CNN. The application of FDM for feature weighting has been proven to enhance multi-label text classification outcomes by providing better insights during the feature selection process. With a recall of 97.26%, precision of 94.81%, and accuracy of 98.58%, the MLTC model integrating FDM feature selection and CNN demonstrates robust performance characteristics in content-based job recommendation tasks. © 2025 Slovene Society Informatika. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：