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

Distributed Truss Computation in Dynamic Graphs

Tsinghua science and Technology 2023年第5期28卷 873-887页

作者： Ziwei Mo Qi Luo Dongxiao Yu Hao Sheng Jiguo Yu Xiuzhen Cheng School of Computer Science and Technology Shandong UniversityQingdao 266200China State Key Laboratory of Software Development Environment School of Computer Science and Engineering and the Beijing Advanced Innovation Center for Big Data and Brain ComputingBeihang UniversityBeijing 100191China Big Data Institute Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China

Large-scale graphs usually exhibit global sparsity with local cohesiveness,and mining the representative cohesive subgraphs is a fundamental problem in graph *** k-truss is one of the most commonly studied cohesive subgraphs,in which each edge is formed in at least k 2 triangles.A critical issue in mining a k-truss lies in the computation of the trussness of each edge,which is the maximum value of k that an edge can be in a *** works mostly focus on truss computation in static graphs by sequential ***,the graphs are constantly changing dynamically in the real *** study distributed truss computation in dynamic graphs in this *** particular,we compute the trussness of edges based on the local nature of the k-truss in a synchronized node-centric distributed *** decomposing the trussness of edges by relying only on local topological information is possible with the proposed distributed decomposition ***,the distributed maintenance algorithm only needs to update a small amount of dynamic information to complete the *** experiments have been conducted to show the scalability and efficiency of the proposed algorithm.

关键词： distributed algorithm dynamic graph graph mining cohesive subgraph k-truss

来源：评论

学校读者我要写书评

暂无评论

Active Perception for Grasp Detection via Neural Graspness Field 38

Active Perception for Grasp Detection via Neural Graspness F...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Ma, Haoxiang Shi, Modi Gao, Boyang Huang, Di State Key Laboratory of Complex and Critical Software Environment School of Computer Science and Engineering Beihang University Beijing China Geometry Robotics

This paper tackles the challenge of active perception for robotic grasp detection in cluttered environments. Incomplete 3D geometry information can negatively affect the performance of learning-based grasp detection methods, and scanning the scene from multiple views introduces significant time costs. To achieve reliable grasping performance with efficient camera movement, we propose an active grasp detection framework based on the Neural Graspness Field (NGF), which models the scene incrementally and facilitates next-best-view planning. Constructed in real-time as the camera moves, the NGF effectively models the grasp distribution in 3D space by rendering graspness predictions from each view. For next-best-view planning, we aim to reduce the uncertainty of the NGF through a graspness inconsistency-guided policy, selecting views based on discrepancies between NGF outputs and a pre-trained graspness network. Additionally, we present a neural graspness sampling method that decodes graspness values from the NGF to improve grasp pose detection results. Extensive experiments on the GraspNet-1Billion benchmark demonstrate significant performance improvements compared to previous works. Real-world experiments show that our method achieves a superior trade-off between grasping performance and time costs. Code is available at https://***/mahaoxiang822/ActiveNGF. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PathActMarker:an R package for inferring pathway activity of complex diseases

引用

Frontiers of computer science 2025年第3期19卷 123-124页

作者： Xingyi LI Jun HAO Zhelin ZHAO Junming LI Xingyu LIAO Min LI Xuequn SHANG School of Computer Science Northwestern Polytechnical UniversityXi’an 710072China Research&Development Institute of Northwestern Polytechnical University in Shenzhen Shenzhen 518063China School of Software Northwestern Polytechnical UniversityXi’an 710072China Hunan Provincial Key Lab on Bioinformatics School of Computer Science and EngineeringCentral South UniversityChangsha 410083China

1 Introduction The process of complex diseases is closely linked to the disruption of key biological pathways,it is crucial to identify the dysfunctional pathways and quantify the degree of dysregulation at the indivi... 详细信息

关键词： pathway activity dysregulation complex diseases biological pathways disruption key biological pathwaysit identify dysfunctional pathways

来源：评论

学校读者我要写书评

暂无评论

A study on the impact of pre-trained model on Just-In-Time defect prediction 23

A study on the impact of pre-trained model on Just-In-Time d...

引用

23rd IEEE International Conference on software Quality, Reliability, and Security, QRS 2023

作者： Guo, Yuxiang Gao, Xiaopeng Zhang, Zhenyu Chan, W.K. Jiang, Bo Beihang University State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beijing China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China City University of Hong Kong Department of Computer Science Hong Kong

ISBN: (纸本)9798350319583

Previous researchers conducting Just-In-Time (JIT) defect prediction tasks have primarily focused on the performance of individual pre-trained models, without exploring the relationship between different pre-trained models as backbones. In this study, we build six models: RoBERTaJIT, CodeBERTJIT, BARTJIT, PLBARTJIT, GPT2JIT, and CodeGPTJIT, each with a distinct pre-trained model as its backbone. We systematically explore the differences and connections between these models. Specifically, we investigate the performance of the models when using Commit code and Commit message as inputs, as well as the relationship between training efficiency and model distribution among these six models. Additionally, we conduct an ablation experiment to explore the sensitivity of each model to inputs. Furthermore, we investigate how the models perform in zero-shot and few-shot scenarios. Our findings indicate that each model based on different backbones shows improvements, and when the backbone's pre-training model is similar, the training resources that need to be consumed are closer. We also observe that Commit code plays a significant role in defect detection, and different pre-trained models demonstrate better defect detection ability with a balanced dataset under few-shot scenarios. These results provide new insights for optimizing JIT defect prediction tasks using pre-trained models and highlight the factors that require more attention when constructing such models. Additionally, CodeGPTJIT and GPT2JIT achieved better performance than DeepJIT and CC2Vec on the two datasets respectively under 2000 training samples. These findings emphasize the effectiveness of transformer-based pre-trained models in JIT defect prediction tasks, especially in scenarios with limited training data. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Aster: Encoding Data Augmentation Relations into Seed Test Suites for Robustness Assessment and Fuzzing of Data-Augmented Deep Learning Models 23

Aster: Encoding Data Augmentation Relations into Seed Test S...

引用

23rd IEEE International Conference on software Quality, Reliability, and Security, QRS 2023

作者： Wang, Haipeng Wei, Zhengyuan Zhou, Qilin Jiang, Bo Chan, W.K. City University of Hong Kong Hong Kong Beihang University State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beijing China

ISBN: (纸本)9798350319583

Data-augmented deep learning models are widely used in real-world applications. However, many state-of the-art loss-based or coverage-based fuzzing techniques fail to produce fuzzing samples for them from many seeds. This paper proposes Aster, a novel technique to address this problem to enhance their fuzzing effectiveness for deep learning models trained with multi-sample data augmentation methods. Aster formulates a novel reachability-based strategy to encode the insights of every seed's direct and indirect data augmentation relation instances into the replacement seed of that seed systematically. Our experiment shows that Aster is highly effective. On average, loss-based and coverage-based fuzzing techniques can generate 166% and 110% more fuzzing samples and reduce 31% and 22% unsuccessful seeds, respectively, after adopting the replacement seeds generated by Aster to replace their original seeds. Their improved models also become up to 55% and 40% on average more robust against FGSM and PGD attacks in the experiment. © 2023 IEEE.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Light field super-resolution using complementary-view feature attention

引用

Computational Visual Media 2023年第4期9卷 843-858页

作者： Wei Zhang Wei Ke Da Yang Hao Sheng Zhang Xiong Faculty of Applied Sciences Macao Polytechnic UniversityMacao SAR 999078China State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang UniversityBeijing 100191Chinaand Beihang Hangzhou Innovation Institute YuhangXixi Octagon CityYuhang DistrictHangzhou 310023China

Light field(LF)cameras record multiple perspectives by a sparse sampling of real scenes,and these perspectives provide complementary *** information is beneficial to LF super-resolution(LFSR).Compared with traditional single-image super-resolution,LF can exploit parallax structure and perspective correlation among different LF ***,the performance of existing methods are limited as they fail to deeply explore the complementary information across LF *** this paper,we propose a novel network,called the light field complementary-view feature attention network(LF-CFANet),to improve LFSR by dynamically learning the complementary information in LF ***,we design a residual complementary-view spatial and channel attention module(RCSCAM)to effectively interact with complementary information between complementary ***,RCSCAM captures the relationships between different channels,and it is able to generate informative features for reconstructing LF images while ignoring redundant ***,a maximum-difference information supplementary branch(MDISB)is used to supplement information from the maximum-difference angular positions based on the geometric structure of LF *** branch also can guide the process of *** results on both synthetic and real-world datasets demonstrate the superiority of our *** proposed LF-CFANet has a more advanced reconstruction performance that displays faithful details with higher SR accuracy than state-of-the-art methods.

关键词： light field(LF) super-resolution(SR) attention

来源：评论

学校读者我要写书评

暂无评论

Research on key technologies of edge cache in virtual data space across WAN

引用

Frontiers of computer science 2023年第1期17卷 15-34页

作者： Jiantong HUO Yaowen XU Zhisheng HUO Limin XIAO Zhenxue HE State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China High Performance Computing Center Beihang UniversityBeijing 100191China College of Software Beihang UniversityBeijing 100191China Hebei Key Laboratory of Agricultural Big Data Hebei Agricultural UniversityBaoding 071001China College of Computer Science and Technology Zhejiang UniversityHangZhou 310013China

The authors of this paper have previously proposed the global virtual data space system (GVDS) to aggregate the scattered and autonomous storage resources in China’s national supercomputer grid (National Supercomputing Center in Guangzhou, National Supercomputing Center in Jinan, National Supercomputing Center in Changsha, Shanghai Supercomputing Center, and computer Network Information Center in Chinese Academy of sciences) into a storage system that spans the wide area network (WAN), which realizes the unified management of global storage resources in China. At present, the GVDS has been successfully deployed in the China National Grid environment. However, when accessing and sharing remote data in the WAN, the GVDS will cause redundant transmission of data and waste a lot of network bandwidth resources. In this paper, we propose an edge cache system as a supplementary system of the GVDS to improve the performance of upper-level applications accessing and sharing remote data. Specifically, we first designs the architecture of the edge cache system, and then study the key technologies of this architecture: the edge cache index mechanism based on double-layer hashing, the edge cache replacement strategy based on the GDSF algorithm, the request routing based on consistent hashing method, and the cluster member maintenance method based on the SWIM protocol. The experimental results show that the edge cache system has successfully implemented the relevant operation functions (read, write, deletion, modification, etc.) and is compatible with the POSIX interface in terms of function. Further, it can greatly reduce the amount of data transmission and increase the data access bandwidth when the accessed file is located at the edge cache system in terms of performance, i.e., its performance is close to the performance of the network file system in the local area network (LAN).

关键词： virtual data space system wide area network edge cache redundant data transmission

来源：评论

学校读者我要写书评

暂无评论

GCSS:a global collaborative scheduling strategy for wide-area high-performance computing

引用

Frontiers of computer science 2022年第5期16卷 1-15页

作者： Yao SONG Limin XIAO Liang WANG Guangjun QIN Bing WEI Baicheng YAN Chenhao ZHANG State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China Smart City College Beijing Union UniversityBeijing 100101China

Wide-area high-performance computing is widely used for large-scale parallel computing applications owing to its high computing and storage ***,the geographical distribution of computing and storage resources makes efficient task distribution and data placement more *** achieve a higher system performance,this study proposes a two-level global collaborative scheduling strategy for wide-area high-performance computing *** collaborative scheduling strategy integrates lightweight solution selection,redundant data placement and task stealing mechanisms,optimizing task distribution and data placement to achieve efficient computing in wide-area *** experimental results indicate that compared with the state-of-the-art collaborative scheduling algorithm HPS+,the proposed scheduling strategy reduces the makespan by 23.24%,improves computing and storage resource utilization by 8.28%and 21.73%respectively,and achieves similar global data migration costs.

关键词： high-performance computing scheduling strategy task scheduling data placement

来源：评论

学校读者我要写书评

暂无评论

Experiments and Analyses of Anonymization Mechanisms for Trajectory Data Publishing

引用

Journal of computer science & Technology 2022年第5期37卷 1026-1048页

作者： She Sun Shuai Ma Jing-He Song Wen-Hai Yue Xue-Lian Lin Tiejun Ma State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang UniversityBeijing 100191China Department of Decision Analytics and Risk Southampton Business SchoolUniversity of Southampton Southampton SO171BJU.K

With the advancing of location-detection technologies and the increasing popularity of mobile phones and other location-aware devices,trajectory data is continuously *** large-scale trajectories provide opportunities for various applications,the locations in trajectories pose a threat to individual ***,there has been an interesting debate on the reidentifiability of individuals in the science *** main finding of Sánchez et *** exactly opposite to that of De Montjoye et al.,which raises the first question:"what is the true situation of the privacy preservation for trajectories in terms of reidentification?''Furthermore,it is known that anonymization typically causes a decline of data utility,and anonymization mechanisms need to consider the trade-off between privacy and *** raises the second question:"what is the true situation of the utility of anonymized trajectories?''To answer these two questions,we conduct a systematic experimental study,using three real-life trajectory datasets,five existing anonymization mechanisms(i.e.,identifier anonymization,grid-based anonymization,dummy trajectories,k-anonymity andε-differential privacy),and two practical applications(i.e.,travel time estimation and window range queries).Our findings reveal the true situation of the privacy preservation for trajectories in terms of reidentification and the true situation of the utility of anonymized trajectories,and essentially close the debate between De Montjoye et *** Sánchez et *** the best of our knowledge,this study is among the first systematic evaluation and analysis of anonymized trajectories on the individual privacy in terms of unicity and on the utility in terms of practical applications.

关键词： anonymization privacy reidentification trajectory utility

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Task Offloading in UAV-Enabled MEC via Multi-agent Reinforcement Learning 18th

Energy-Efficient Task Offloading in UAV-Enabled MEC via Mu...

引用

18th International Conference on Green, Pervasive, and Cloud Computing, GPC 2023

作者： Gao, Jiakun Zhang, Jie Xu, Xiaolong Qi, Lianyong Yuan, Yuan Li, Zheng Dou, Wanchun School of Software Nanjing University of Information Science and Technology Nanjing210044 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China QingDao266580 China School of Computer Science and Engineering Beihang University Beijing100191 China State Key Laboratory of Software Development Environment Zhongguancun Laboratory Beihang University Beijing100191 China School of Computer Science Nanjing University of Information Science and Technology Nanjing210044 China

ISBN: (纸本)9789819998951

Nowadays, artificial intelligence-based tasks are imposing increasing demands on computation resources and energy consumption. Unmanned aerial vehicles (UAVs) are widely utilized in mobile edge computing (MEC) due to maneuverability and integration of MEC servers, providing computation assistance to ground terminals (GTs). The task offloading process from GTs to UAVs in UAV-enabled MEC faces challenges such as workload imbalance among UAVs due to uneven GT distribution and conflicts arising from the increasing number of GTs and limited communication resources. Additionally, the dynamic nature of communication networks and workload needs to be considered. To address these challenges, this paper proposes a Multi-Agent Deep Deterministic Policy Gradient based distributed offloading method, named DMARL, treating each GT as an independent decision-maker responsible for determining task offloading strategies and transmission power. Furthermore, a UAV-enabled MEC with Non-Orthogonal Multiple Access architecture is introduced, incorporating task computation and transmission queue models. In addition, a differential reward function that considers both system-level rewards and individual rewards for each GT is designed. Simulation experiments conducted in three different scenarios demonstrate that the proposed method exhibits superior performance in balancing latency and energy consumption. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：