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

23rd USENIX Conference on File and Storage Technologies, FAST 2025

作者： Tian, Bing Liu, Haikun Tang, Yuhang Xiao, Shihai Duan, Zhuohui Liao, Xiaofei Jin, Hai Zhang, Xuecang Zhu, Junhua Zhang, Yu 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 China Huawei Technologies Co. Ltd. China

ISBN: (纸本)9781939133458

Approximate nearest neighbor search (ANNS) has emerged as a crucial component of database and AI infrastructure. Ever-increasing vector datasets pose significant challenges in terms of performance, cost, and accuracy for ANNS services. None of modern ANNS systems can address these issues simultaneously. In this paper, we present FusionANNS, a high-throughput, low-latency, cost-efficient, and high-accuracy ANNS system for billion-scale datasets using SSDs and only one entry-level GPU. The key idea of FusionANNS lies in CPU/GPU collaborative filtering and re-ranking mechanisms, which significantly reduce I/O operations across CPUs, GPU, and SSDs to break through the I/O performance bottleneck. Specifically, we propose three novel designs: (1) multi-tiered indexing to avoid data swapping between CPUs and GPU, (2) heuristic re-ranking to eliminate unnecessary I/Os and computations while guaranteeing high accuracy, and (3) redundant-aware I/O deduplication to further improve I/O efficiency. We implement FusionANNS and compare it with the state-of-the-art SSD-based ANNS system-SPANN and GPU-accelerated in-memory ANNS system-RUMMY. Experimental results show that FusionANNS achieves 1) 9.4-13.1× higher query per second (QPS) and 5.7-8.8× higher cost efficiency compared with SPANN;2) and 2-4.9× higher QPS and 2.3-6.8× higher cost efficiency compared with RUMMY, while guaranteeing low latency and high accuracy. © 2025 FAST. All Rights Reserved.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Attention boosted individualized regression 24

Attention boosted individualized regression

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Guang Yang Yuan Cao Long Feng Department of Data Science College of Computing City University of Hong Kong Department of Statistics and Actuarial Science School of Computing and Data Science The University of Hong Kong

ISBN: (纸本)9798331314385

Different from classical one-model-fits-all strategy, individualized models allow parameters to vary across samples and are gaining popularity in various fields, particularly in personalized medicine. Motivated by medical imaging analysis, this paper introduces a novel individualized modeling framework for matrix-valued data that does not require additional information on sample similarity for the individualized coefficients. Under our framework, the model individualization stems from an optimal internal relation map within the samples themselves. We refer to the proposed method as Attention boosted Individualized Regression, due to its close connections with the self-attention mechanism. Therefore, our approach provides a new interpretation for attention from the perspective of individualized modeling. Comprehensive numerical experiments and real brain MRI analysis using an ADNI dataset demonstrated the superior performance of our model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Method to Measure Distribution Consistency of Mixed-Attribute datasets

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第1期4卷 182-196页

作者： He, Yulin Ye, Xuan Huang, Defa Fournier-Viger, Philippe Huang, Joshua Zhexue College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Random sample partition (RSP) is a newly developed data management and processing model for Big data processing and analysis. To apply the RSP model for Big data computation tasks, it is very important to measure the distribution consistency of different datasets. Existing measurement methods for continuous-attribute and discrete-attribute datasets cannot directly deal with mixed-attribute datasets. In this article, we design a hybrid method to measure the distribution consistency among different mixed-attribute datasets by using a multilayer extreme learning machine (MLELM) and the generalized maximum mean discrepancy (GMMD) criterion, abbreviated as MLELM-GMMD. MLELM is first used to transform original mixed-attribute datasets into corresponding deep encoding datasets. Then, the GMMD criterion is applied to check the distribution consistency of the deep encoding datasets. Four experiments have been done to validate the feasibility and effectiveness of MLELM-GMMD, i.e., the impact of MLELM on the amount of information during mixed-attribute data transformation, the impact of MLELM on distributions of mixed-attribute data, the distribution consistencies of RSP and non-RSP data blocks, and the comparison with other measurement methods. Experimental results show that the proposed MLELM-GMMD method can measure the distribution consistency of mixed-attribute datasets more accurately than one-hot encoding-based methods. © 2022 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts 41

MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Exp...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Zhou, Jianan Cao, Zhiguang Wu, Yaoxin Song, Wen Ma, Yining Zhang, Jie Xu, Chi College of Computing and Data Science Nanyang Technological University Singapore School of Computing and Information Systems Singapore Management University Singapore Department of Information Systems Eindhoven University of Technology Netherlands Institute of Marine Science and Technology Shandong University China Singapore

Learning to solve vehicle routing problems (VRPs) has garnered much ***, most neural solvers are only structured and trained independently on a specific problem, making them less generic and *** this paper, we aim to develop a unified neural solver that can cope with a range of VRP variants ***, we propose a multi-task vehicle routing solver with mixture-of-experts (MVMoE), which greatly enhances the model capacity without a proportional increase in *** further develop a hierarchical gating mechanism for the MVMoE, delivering a good trade-off between empirical performance and computational ***, our method significantly promotes zero-shot generalization performance on 10 unseen VRP variants, and showcases decent results on the few-shot setting and real-world benchmark *** further conduct extensive studies on the effect of MoE configurations in solving VRPs, and observe the superiority of hierarchical gating when facing out-of-distribution *** source code is available at: https://***/RoyalSkye/Routing-MVMoE. Copyright 2024 by the author(s)

关键词： Vehicle routing

来源：评论

学校读者我要写书评

暂无评论

mVulPreter: A Multi-Granularity Vulnerability Detection System With Interpretations

引用

IEEE Transactions on Dependable and Secure computing 2022年 1-12页

作者： Zou, Deqing Hu, Yutao Li, Wenke Wu, Yueming Zhao, Haojun Jin, Hai 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 School of Computer Science and Engineering Nanyang Technological University Singapore 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

Due to the powerful automatic feature extraction, deep learning-based vulnerability detection methods have evolved significantly in recent years. However, almost all current work focuses on detecting vulnerabilities at a single granularity (i.e., slice-level or function-level). In practice, slice-level vulnerability detection is fine-grained but may contain incomplete vulnerability details. Function-level vulnerability detection includes full vulnerability semantics but may contain vulnerability-unrelated statements. Meanwhile, they pay more attention to predicting whether the source code is vulnerable and cannot pinpoint which statements are more likely to be vulnerable. In this paper, we design mVulPreter, a multi-granularity vulnerability detector that can provide interpretations of detection results. Specifically, we propose a novel technique to effectively blend the advantages of function-level and slice-level vulnerability detection models and output the detection results' interpretation only by the model itself. We evaluate mVulPreter on a dataset containing 5,310 vulnerable functions and 7,601 non-vulnerable functions. The experimental results indicate that mVulPreter outperforms existing state-of-the-art vulnerability detection approaches (i.e., Checkmarx, FlawFinder, RATS, TokenCNN, StatementLSTM, SySeVR, and Devign). IEEE

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Forest-based Evolutionary Algorithm for Reconstructing Boolean Gene Regulatory Networks 21

Forest-based Evolutionary Algorithm for Reconstructing Boole...

引用

21st IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology, CIBCB 2024

作者： Stranieri, Nicolò Buffa, Francesca M. Tangherloni, Andrea Bocconi University Department of Computing Sciences Milan Italy University of Oxford Department of Oncology Oxford United Kingdom Bocconi University Bocconi Institute for Data Science and Analytics Department of Computing Sciences Milan Italy

ISBN: (纸本)9798350356632

Gene Regulatory Networks (GRNs) play a fundamental role in orchestrating the expression of our genes through complex interactions between DNA, RNA, proteins, and other molecules. Accurately reconstructing such networks from gene expression data is a critical yet challenging task in Systems Biology due to their intricate nature and limited data availability. In this work, we introduce a novel Forest-based Evolutionary Algorithm (FP) designed for reconstructing Boolean GRNs from time series data of gene expressions. Unlike traditional methods that struggle with scalability and accurate representation of regulatory interactions, FP utilizes a forest structure where each tree represents the logical relationships between genes, enhancing the model's capacity to depict complex networks efficiently. Our comprehensive testing indicates that FP rapidly converges towards potential solutions within a limited number of generations, although a higher fitness score does not always equate to a more accurate GRN representation. Implementing mini-batching techniques, inspired by their effectiveness in gradient descent optimization, shows promise in improving computational efficiency without sacrificing performance. A comparative analysis against the main state-of-the-art approaches reveals FP's tendency towards conservative predictions, emphasizing precision over recall, making it particularly suitable for contexts where the cost of false positives is high. These initial results suggest that FP is a robust and efficient tool for GRN inference. © 2024 IEEE.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

Fast Parallel Recovery for Transactional Stream Processing on Multicores 40

Fast Parallel Recovery for Transactional Stream Processing o...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Zhao, Jianjun Liu, Haikun Zhang, Shuhao Duan, Zhuohui Liao, Xiaofei Jin, Hai Zhang, Yu School of Computer Science and Technology Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Engineering Nanyang Technological University Singapore

ISBN: (纸本)9798350317152

Transactional stream processing engines (TSPEs) have gained increasing attention due to their capability of processing real-time stream applications with transactional semantics. However, TSPEs remain susceptible to system failures and power outages. Existing TSPEs mainly focus on performance improvement, but still face a significant challenge to guarantee fault tolerance while offering high-performance services. We revisit commonly-used fault tolerance approaches in stream processing and database systems, and find that these approaches do not work well on TSPEs due to complex data dependencies. In this paper, we propose a novel TSPE called MorphStreamR to achieve fast failure recovery while guaranteeing low performance overhead at runtime. The key idea of MorphStreamR is to record intermediate results of resolved dependencies at runtime, and thus eliminate data dependencies to improve task parallelism during failure recovery. MorphStreamR further mitigates the runtime overhead by selectively tracking data dependencies and incorporating workload-aware log commitment. Experimental results show that MorphStreamR can significantly reduce the recovery time by up to 3.1 x while experiencing much less performance slowdown at runtime, compared with other applicable fault tolerance approaches. © 2024 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Dynamic Charging and Path Planning for UAV-Powered Rechargeable WSNs Using Multi-Agent Deep Reinforcement Learning

引用

IEEE Transactions on Automation science and Engineering 2025年 22卷 15610-15626页

作者： Betalo, Mesfin Leranso Leng, Supeng Seid, Abegaz Mohammed Abishu, Hayla Nahom Erbad, Aiman Bai, Xiaoshan Shenzhen University College of Mechatronics and Control Engineering Shenzhen518060 China University of Electronic Science and Technology of China School of Information and Communication Engineering Chengdu611731 China Hamad Bin Khalifa University Division of Information and Computing Technology College of Science and Engineering Doha Qatar Shenzhen University College of Mechatronics and Control Engineering National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China

Unmanned Aerial Vehicle (UAV)-powered 5G/6G networks integrated with rechargeable wireless sensor networks (RWSNs) offer promising solutions for extending system lifetime, collecting data, and providing computing services and power to sensor nodes (SNs). UAVs offer significant advantages, including exceptional mobility, cost-effective deployment, and the ability to be easily reprogrammed for a wide range of missions. However, the limited onboard power capacity of UAVs, coupled with the lack of dynamic and intelligent charging station (CS) management and inefficient path planning, can lead to SN failure in dynamic mobile environments. To address these challenges, we propose an energy-efficient laser-charged UAV (LCU)-enabled RWSN environment, wherein UAVs, powered by laser beams from ground-based stations, provide services, collect data, and transfer energy to SNs. We formulate a joint optimization problem involving power allocation, dynamic charging strategy (DCS), and path planning to minimize task completion time and sensor node death time. Given the NP-hard nature of the problem, we employ a stochastic game model based on a Markov decision process (MDP) for its solution. To solve this problem, we propose a deep reinforcement learning (DRL) based algorithm that enables real-time charging scheduling decisions while optimizing network performance. We introduce a multi-agent double deep Q-network (MA-DDQN) model to determine the optimal trajectories for all UAVs in large and complex environments. Simulation results demonstrate that the MA-DDQN approach outperforms state-of-the-art techniques, showing significant improvements in terms of average delay, energy consumption, and task completion time. © 2004-2012 IEEE.

关键词： Stochastic models

来源：评论

学校读者我要写书评

暂无评论

Building Flood Resilience: A 3D Simulation Game for Public Awareness

Building Flood Resilience: A 3D Simulation Game for Public A...

引用

2024 IEEE International Conference on computing, ICOCO 2024

作者： Kadir, Tuty Asmawaty Abdul Xuan, Desmond Yap Wen Nazri, Siti NurAishah Faculty of Computing Center of Artificial Intelligence and Data Science Universiti Malaysia Pahang Al-Sultan Abdullah Pahang Malaysia Faculty of Computing Universiti Malaysia Pahang Al-Sultan Abdullah Pahang Pekan Malaysia

ISBN: (纸本)9798331530303

This article presents the development and evaluation of "Flood," a 3D simulation game designed to enhance public awareness of flood safety measures. The game features two distinct phases: the Pre-flood phase, where players prepare for impending flood conditions, and the Evacuation phase, where they must navigate various hazards to reach safety. By utilizing the Unity platform, "Flood" immerses players in realistic scenarios that promote learning through engagement. Results from a survey of 20 participants indicate that the game successfully simulates flood situations, with 80% of respondents affirming its effectiveness in conveying essential flood awareness. The majority of players reported learning crucial safety measures, such as avoiding power lines and preparing emergency bags. Furthermore, feedback highlighted high levels of engagement, with 70% rating the game at the highest level of interest. ©2024 IEEE.

关键词： Disasters

来源：评论

学校读者我要写书评

暂无评论

RETIA: Relation-Entity Twin-Interact Aggregation for Temporal Knowledge Graph Extrapolation 39

RETIA: Relation-Entity Twin-Interact Aggregation for Tempora...

引用

39th IEEE International Conference on data Engineering, ICDE 2023

作者： Liu, Kangzheng Zhao, Feng Xu, Guandong Wang, Xianzhi Jin, Hai Huazhong University of Science and Technology 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 Wuhan China University of Technology Sydney Data Science and Machine Intelligence Lab Sydney Australia

ISBN: (纸本)9798350322279

Temporal knowledge graph (TKG) extrapolation aims to predict future unknown events (facts) based on historical information, and has attracted considerable attention due to its great practical significance. Accurate representations (embeddings) of entities and relations form the basis of TKG extrapolation. Recent work has been devoted to improving the rationality of entity representations. However, on the one hand, ignoring relation modeling results in incomplete relation representations;therefore, some approaches aggregate only immediately adjacent entities of relations, but this can lead to the "message islands"problem of relation modeling. On the other hand, ignoring the association constraints between relations and entities can make the embeddings of both relations and entities prone to overfitting. To address the abovementioned challenges, we propose an advanced method, namely, RETIA. For the former issue, we generate twin hyperrelation subgraphs for each historical subgraph and then aggregate both the adjacent entities and relations in the hyperrelation subgraphs through a graph convolutional network (GCN). About the latter concern, we propose a twin-interact module (TIM), which provides communication channels for relation aggregation and entity aggregation during the evolution of the historical sequence. Experiments conducted on five public datasets show that RETIA has made great improvements across several evaluation metrics. Our released code is available at https://***/CGCL-codes/RETIA. © 2023 IEEE.

关键词： Extrapolation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：