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

arXiv 2024年

作者： Xiong, Qi Tang, Kai Ma, Minbo Zhang, Ji Xu, Jie Li, Tianrui School of Computing and Artificial Intelligence Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education National Engineering Laboratory of Integrated Transportation Big Data Application Technology Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China School of Computing The University of Leeds LeedsLS2 9JT United Kingdom

Long-term time series forecasting (LTSF) is a critical task across diverse domains. Despite significant advancements in LTSF research, we identify a performance bottleneck in existing LTSF methods caused by the inadequate modeling of Temporal Dependencies within the Target (TDT). To address this issue, we propose a novel and generic temporal modeling framework, Temporal Dependency Alignment (TDAlign), that equips existing LTSF methods with TDT learning capabilities. TDAlign introduces two key innovations: 1) a loss function that aligns the change values between adjacent time steps in the predictions with those in the target, ensuring consistency with variation patterns, and 2) an adaptive loss balancing strategy that seamlessly integrates the new loss function with existing LTSF methods without introducing additional learnable parameters. As a plug-and-play framework, TDAlign enhances existing methods with minimal computational overhead, featuring only linear time complexity and constant space complexity relative to the prediction length. Extensive experiments on six strong LTSF baselines across seven real-world datasets demonstrate the effectiveness and flexibility of TDAlign. On average, TDAlign reduces baseline prediction errors by 1.47% to 9.19% and change value errors by 4.57% to 15.78%, highlighting its substantial performance improvements. Copyright © 2024, The Authors. All rights reserved.

关键词： Time series analysis

来源：评论

学校读者我要写书评

暂无评论

FlashWalker: An In-Storage Accelerator for Graph Random Walks

FlashWalker: An In-Storage Accelerator for Graph Random Walk...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Fuping Niu Jianhui Yue Jiangqiu Shen Xiaofei Liao Haikun Liu Hai Jin 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 Department of Computer Science Michigan Technological University Houghton Michigan USA

Graph random walk is widely used in the graph processing as it is a fundamental component in graph analysis, ranging from vertices ranking to the graph embedding. Different from traditional graph processing workload, random walk features massive processing parallelisms and poor graph data reuse, being limited by low I/O efficiency. Prior designs for random walk mitigate slow I/O operations. However, the state-of-the-art random walk processing systems are bounded by slow disk I/O bandwidth, which is confirmed by our experiments with real-world graphs. To address this issue, we propose FlashWalker, an in-storage accelerator for random walk that moves walk updating close to graph data stored in flash memory, by exploiting significant parallelisms inside SSD. Featuring a heterogeneous and parallel processing system, FlashWalker includes a board-level accelerator, channel-level accelerators, and chip-level accelerators. To address challenges posed by the tight resource constraints for processing large-scale graphs, we propose novel designs: storing a few popular subgraphs in accelerators, the pre-walking for dense walks, two optimizations to search the subgraph mapping table, and a subgraph scheduling algorithm. We implement FlashWalker in RTL, showing small circuit area overhead. Our evaluation shows FlashWalker reduces the execution time of random walk algorithms by up to 660.50×, compared with GraphWalker, which is the state-of-the-art system for random walk algorithms.

关键词： Distributed processing Scheduling algorithms Bandwidth Parallel processing Distance measurement Flash memories Optimization

来源：评论

学校读者我要写书评

暂无评论

Study on an Adaptive Clamping Device for Passive Safety Delivery of Vascular Intervention Robot

Study on an Adaptive Clamping Device for Passive Safety Deli...

引用

IEEE International Conference on Mechatronics and Automation

作者： Sheng Cao Shuxiang Guo Jian Guo Jian Wang Chunying Li Huiyin Xu Bin Wang Mingchao Ding Aerospace Center Hospital & the Key Laboratory of Convergence Medical Engineering System and Healthcare Technology School of Life Science & Ministry of Industry and Information Technology Beijing Institute of Technology Beijing China Shenzhen Institute of Advanced Biomedical Robot Company Limited Shenzhen China Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen China National Engineering Laboratory of Computer Technology for Big Data Systems Shenzhen University Shenzhen China

ISBN: (数字)9798350388077

ISBN: (纸本)9798350388084

In practical clinical applications, vascular intervention surgical robots have developed sophisticated human-machine interaction systems, enabling assistance to physicians in performing remote surgeries and providing intelligent visual feedback. However, regarding surgical safety, current research predominantly focuses on force feedback and robot control logic, with clamping mechanisms targeting the locking of catheters and guide wires. Excessive clamping force may lead to surface damage to intervention instruments, while insufficient force delivery may result from slippery surfaces. Therefore, addressing these issues, this study proposed a passive, compliant safety strategy for an adaptive clamping device based on a vascular intervention surgical robot platform. This device can accommodate different diameter catheters and maintain a constant delivery force during the intervention process. Finally, through experimentation, the effectiveness, safety, and stability of the device were demonstrated.

关键词： Visualization Medical robotics Force Wires Robot control Surgery Safety

来源：评论

学校读者我要写书评

暂无评论

MDEC: Mamba-based Debiased Extended Contrast Learning in Sequential Recommendation

MDEC: Mamba-based Debiased Extended Contrast Learning in Seq...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Yan Huang Zhenyu Yang Baojie Xu Wenyue Hu Zhibo Zhang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798331513054

ISBN: (纸本)9798331513061

Recommender systems are critical for mitigating information overload, assisting users in uncovering their latent interests, and enhancing their overall experience. Sequential recommendation leverages users' historical interaction sequences to predict dynamic interests more effectively than traditional rec-ommendation approaches. However, existing models-including RNN-based and Transformer-based methods-face significant limitations. RNNs struggle with vanishing gradients and long-term dependency capture, while Transformers, though effective for long-range relationships, suffer from computational inefficiency due to their quadratic attention complexity. Recent advancements have employed contrastive learning for sequential recommendation, aiming to enhance the consistency between augmented views and improve self-supervised learning signals. Despite their promise, these methods often lack diversity in data augmentation strategies, which restricts their capacity for bias mitigation, resulting in augmented data that still retains inherent biases. To address these challenges, we propose MDEC, a novel sequential modeling framework that leverages State Space Models (SSM) combined with unbiased contrastive learning. MDEC utilizes Mamba to efficiently model user preferences as an alternative to Transformer-based models. Additionally, it integrates graph-based information, including item transition and co-interaction data, to improve data augmentation comprehensively. Finally, we introduce adaptive anchor-enhanced contrastive learning, which adaptively utilizes augmented samples to improve representation quality and bias mitigation. Extensive experiments on multiple datasets demonstrate that MDEC significantly out-performs existing models, showcasing improved efficiency, better mitigation of biases, and enhanced recommendation quality. Code is available at https://***/Echohuangyan/CSLP.

关键词： Adaptation models Federated learning Prevention and mitigation Computational modeling data visualization Contrastive learning Diversity methods Transformers data augmentation Recommender systems

来源：评论

学校读者我要写书评

暂无评论

AOCC-FL: Federated Learning with Aligned Overlapping via Calibrated Compensation

AOCC-FL: Federated Learning with Aligned Overlapping via Cal...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Haozhao Wang Wenchao Xu Yunfeng Fan Ruixuan Li Pan Zhou School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Computing The Hong Kong Polytechnic University Hong Kong Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China

Federated Learning enables collaboratively model training among a number of distributed devices with the coordination of a centralized server, where each device alternatively performs local gradient computation and communication to the server. FL suffers from significant performance degradation due to the excessive communication delay between the server and devices, especially when the network bandwidth of these devices is limited, which is common in edge environments. Existing methods overlap the gradient computation and communication to hide the communication latency to accelerate the FL training. However, the overlapping can also lead to an inevitable gap between the local model in each device and the global model in the server that seriously restricts the convergence rate of learning process. To address this problem, we propose a new overlapping method for FL, AOCC-FL, which aligns the local model with the global model via calibrated compensation such that the communication delay can be hidden without deteriorating the convergence performance. Theoretically, we prove that AOCC-FL admits the same convergence rate as the non-overlapping method. On both simulated and testbed experiments, we show that AOCC-FL achieves a comparable convergence rate relative to the non-overlapping method while outperforming the state-of-the-art overlapping methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Memory Architecture Supporting Fine-Grained data Migration

SSRN

引用

SSRN 2022年

作者： Chi, Ye Yue, Jianhui Liao, Xiaofei Liu, Haikun Jin, Hai 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 Wuhan430074 China Computer Science Michigan Technological University HoughtonMI United States

We propose Mocha, a non-hierarchical caching architecture that organizes DRAM and NVM in a flat address space physically, but manages DRAM/NVM in a cache/memory hierarchy in this paper. Since the commercial NVM device-Intel Optane DC Persist Memory Modules (DCPMM) actually access the physical media at a granularity of 256 bytes (an Optane block), we manage the DRAM cache at the 256-byte size to adapt to this device feature of Optane. This design not only enables fine-grained data migration and management for the DRAM cache, but also avoids write amplification for Optane DCPMM. We also create a the \textit{ Indirect Address Cache} (IAC) in \textit{Hybrid Memory Controller}(HMC) and propose a reverse address mapping table in the DRAM to speed up address translation and cache replacement. Besides, we exploit an utility-based caching mechanism to filter cold blocks in the NVM, and further improve DRAM cache effectiveness. We implement Mocha in an architecture simulator. Experimental results indicate that MOCHA can improve performance of applications by 8.2\% on average (up to 24.6\%), provide 6.9\% reduction in average energy consumption and 25.9\% reduction in average data migration traffic, compared to the most advanced hybrid memory architecture-HSCC. © 2022, The Authors. All rights reserved.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

DAGCL: Diversified Recommendation with Graph-Augmented Contrastive Learning

DAGCL: Diversified Recommendation with Graph-Augmented Contr...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Haozhi Xia Zhenyu Yang Ziyu Chen Xiaoyang Wang Xueli Chang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798331513054

ISBN: (纸本)9798331513061

In personalized recommendation systems, Graph Neural Networks (GNNs) have gained attention for their ability to effectively model complex user-item interactions. The core concept of GNNs is to leverage ample and high-quality training data, recursively performing message passing along user-item interaction edges to progressively refine embedding representations. However, the highly imbalanced nature of user interaction data often leads traditional GNN-based recommendation systems to experience information redundancy, concentrating recommendations on a few popular items. Additionally, the long-tail problem further limits the visibility of less popular items, reducing recommendation diversity and impairing the user experience. In this paper, we propose a novel Diversity Augmented Graph Contrastive Learning method (DAGCL), which aims to increase recommendation diversity by improving the embedding generation process, while maintaining a balance between accuracy and diversity. Specifically, we design two graph augmentation methods, including a diversified subset selection module based on Deterministic Point Process (DPP) and a long-tail item interaction augmentation module, to generate diversified embeddings. Moreover, DAGCL incorporates contrastive learning, leveraging augmented views to optimize the recommendation process, alleviate data sparsity issue and capture potential user-item relationships. Experiments on two real-world datasets demonstrate that DAGCL significantly improves diversity while preserving recommendation accuracy, achieving an effective balance between these two aspects and validating its effectiveness. The code is available on https://***/XiaHaoZhi/DAGCL.

关键词： Accuracy Heavily-tailed distribution Message passing Redundancy Training data Contrastive learning User experience Graph neural networks Recommender systems Optimization

来源：评论

学校读者我要写书评

暂无评论

Multilayer Feature Fusion and Joint Loss Optimization for Emotion Recognition in Conversations

Multilayer Feature Fusion and Joint Loss Optimization for Em...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Zhibo Zhang Zhenyu Yang Yan Huang Baojie Xu Wenyue Hu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798331513054

ISBN: (纸本)9798331513061

The goal of Emotion Recognition in Conversations (ERC) is to accurately identify the emotions expressed in each utterance within a dialogue. Despite advancements made by current ERC methods, particularly those using RNN-based and GCN-based models to capture emotional dynamics and model speaker relationships, there remain two primary limitations: first, an insufficient integration of multiple feature representations and commonsense knowledge, which hampers the model's ability for deep emotional understanding; and second, the reliance on a single cross-entropy loss for classification optimization, which restricts the accuracy and robustness of emotion recognition. To address these issues, we propose a method for ERC using Multilayer Feature Fusion and Joint Loss Optimization (MFFJL). This approach combines contextual information, speaker dependency, and commonsense knowledge features by extracting feature vectors through RoBERTa and COMET, utilizing bidirectional LSTM and attention mechanisms to capture conversational context, and applying a cross-fusion module to deeply integrate various features, thus enhancing comprehension of complex emotional expressions. Additionally, the feature classification module incorporates joint cross-entropy and KL divergence optimization, further improving classification accuracy and consistency. Experimental results demonstrate the effectiveness of our method, as evidenced by superior performance on the IEMOCAP and MELD datasets. Our code is available at https://***/r/MFFJL-D9D8.

关键词： Emotion recognition Accuracy Federated learning Computational modeling Feature extraction Nonhomogeneous media Vectors Robustness Optimization Commonsense reasoning

来源：评论

学校读者我要写书评

暂无评论

VulCNN: An Image-inspired Scalable Vulnerability Detection system

VulCNN: An Image-inspired Scalable Vulnerability Detection S...

引用

International Conference on Software engineering (ICSE)

作者： Yueming Wu Deqing Zou Shihan Dou Wei Yang Duo Xu Hai Jin Huazhong University of Science and Technology China Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering HUST Wuhan China Services Computing Technology and System Lab National Engineering Research Center for Big Data Technology and System HUST Wuhan China Fudan University China University of Texas at Dallas United States Cluster and Grid Computing Lab School of Computer Science and Technology HUST Wuhan China

ISBN: (纸本)9781665495899

Since deep learning (DL) can automatically learn features from source code, it has been widely used to detect source code vulnerability. To achieve scalable vulnerability scanning, some prior studies intend to process the source code directly by treating them as text. To achieve accurate vulnerability detection, other approaches consider distilling the program semantics into graph representations and using them to detect vulnerability. In practice, text-based techniques are scalable but not accurate due to the lack of program semantics. Graph-based methods are accurate but not scalable since graph analysis is typically time-consuming. In this paper, we aim to achieve both scalability and accuracy on scanning large-scale source code vulnerabilities. Inspired by existing DL-based image classification which has the ability to analyze millions of images accurately, we prefer to use these techniques to accomplish our purpose. Specifically, we propose a novel idea that can efficiently convert the source code of a function into an image while preserving the program details. We implement Vul-CNN and evaluate it on a dataset of 13,687 vulnerable functions and 26,970 non-vulnerable functions. Experimental results report that VulCNN can achieve better accuracy than eight state-of-the-art vul-nerability detectors (i.e., Checkmarx, FlawFinder, RATS, TokenCNN, VulDeePecker, SySeVR, VulDeeLocator, and Devign). As for scalability, VulCNN is about four times faster than VulDeePecker and SySeVR, about 15 times faster than VulDeeLocator, and about six times faster than Devign. Furthermore, we conduct a case study on more than 25 million lines of code and the result indicates that VulCNN can detect large-scale vulnerability. Through the scanning reports, we finally discover 73 vulnerabilities that are not reported in NVD.

关键词： Deep learning Codes Scalability Semantics Detectors Transforms Rats

来源：评论

学校读者我要写书评

暂无评论

Unique in the Metro system: The Likelihood to Re-Identify a Metro User with Limited Trajectory Points

SSRN

引用

SSRN 2023年

作者： Yang, Hongtai Ping, An Wei, Hongmin Zhai, Guocong School of Transportation and Logistics Institute of System Science and Engineering National Engineering Laboratory of Integrated Transportation Big Data Application Technology National United Engineering Laboratory of Integrated and Intelligent Transportation Southwest Jiaotong University Chengdu611756 China Guangdong–Hong Kong-Macau Joint Laboratory for Smart Cities Shenzhen518060 China School of Transportation and Logistics National Engineering Laboratory of Integrated Transportation Big Data Application Technology National United Engineering Laboratory of Integrated and Intelligent Transportation Southwest Jiaotong University Chengdu611756 China Department of Civil & Environmental Engineering Old Dominion University 129C Kaufman Hall NorfolkVA23529 United States

Though the collection of metro smart card data could help improve the operations of the metro system, the release of such data might lead to privacy issues. Few studies have quantified the probability to re-identify a user from the smart card data using very limited trajectory points. Thus, this study investigates this topic by analyzing eight-day metro smart card data of Chengdu, China. Results reveal that, on the macro level, three random trajectory points with a temporal resolution of one minute and one hour are enough to identify over 90% and 67% of the users. Even when the resolution is reduced to one day, 20% of the users could be still be identified by three points. On the individual level, three carefully selected points with a temporal resolution of one minute, one hour, and one day could lead to a re-identification risk no less than 0.5 for 99%, 89%, and 52% of the users. The effects of number of points, number of users, and other temporal resolutions are also thoroughly evaluated. These findings emphasize the great privacy issues involved in the release of metro smart card data and remind metro operators to take proactive measures to enhance privacy protection. © 2023, The Authors. All rights reserved.

关键词： Smart cards

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：