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

29th International Conference on Computational Linguistics, COLING 2022

作者： Zhang, Chong Zhu, He Peng, Xingyu Wu, Junran Xu, Ke State Key Lab of Software Development Environment Beihang University Beijing100191 China

Text classification is a primary task in natural language processing (NLP). Recently, graph neural networks (GNNs) have developed rapidly and been applied to text classification tasks. As a special kind of graph data, the tree has a simpler data structure and can provide rich hierarchical information for text classification. Inspired by the structural entropy, we construct the coding tree of the graph by minimizing the structural entropy and propose HINT, which aims to make full use of the hierarchical information contained in the text for the task of text classification. Specifically, we first establish a dependency parsing graph for each text. Then we designed a structural entropy minimization algorithm to decode the key information in the graph and convert each graph to its corresponding coding tree. Based on the hierarchical structure of the coding tree, the representation of the entire graph is obtained by updating the representation of non-leaf nodes in the coding tree layer by layer. Finally, we present the effectiveness of hierarchical information in text classification. Experimental results show that HINT outperforms the state-of-the-art methods on popular benchmarks while having a simple structure and few parameters. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

CAPS: An Efficient Whole-Program Critical Paths Search Framework for Large-Scale software 35

CAPS: An Efficient Whole-Program Critical Paths Search Frame...

引用

35th International Conference on software Engineering and Knowledge Engineering, SEKE 2023

作者： Li, Peiyang Liu, Zixin Su, Yuening Wang, Hao Jiang, Bo State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University China

Tracking the flow of external inputs in a program with taint-analysis techniques can help developers better identify potential security vulnerabilities in the software. However, directly using the static taint analysis provided by Clang Static Analyzer is inefficient for large-scale software due to the huge but redundant ExplodedGraph generated. Therefore, we propose an efficient Whole-Program Critical Paths Search (CAPS) framework. It first performs a set of optimizations to reduce the ExplodedGraph of each function. Then, it constructs a global exploded graph by inserting call edges among the reduced ExplodedGraphs for each function within the Neo4j graph database. Finally, it proposes loop removal and graph segmentation to optimize the search process for critical paths on the global exploded graph. Our experiments on 3 large-scale software show that CAPS can significantly improve the efficiency of critical path search for large-scale software. © 2023 Knowledge Systems Institute Graduate School. All rights reserved.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

SMEC:Scene Mining for E-Commerce

引用

Journal of Computer Science & Technology 2024年第1期39卷 192-210页

作者：王罡李翔郭子义殷大伟马帅 State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Data Science and Engineering East China Normal UniversityShanghai 200062China *** Inc.Beijing 100176China Baidu Inc.Beijing 100085China

Scene-based recommendation has proven its usefulness in E-commerce,by recommending commodities based on a given ***,scenes are typically unknown in advance,which necessitates scene discovery for *** this article,we study scene discovery for E-commerce *** first formalize a scene as a set of commodity cate-gories that occur simultaneously and frequently in real-world situations,and model an E-commerce platform as a heteroge-neous information network(HIN),whose nodes and links represent different types of objects and different types of rela-tionships between objects,*** then formulate the scene mining problem for E-commerce as an unsupervised learning problem that finds the overlapping clusters of commodity categories in the *** solve the problem,we pro-pose a non-negative matrix factorization based method SMEC(Scene Mining for E-Commerce),and theoretically prove its *** six real-world E-commerce datasets,we finally conduct an extensive experimental study to evaluate SMEC against 13 other methods,and show that SMEC consistently outperforms its competitors with regard to various evaluation measures.

关键词： graph clustering E-commerce heterogeneous information network(HIN) scene mining

来源：评论

学校读者我要写书评

暂无评论

A meaningful learning method for zero-shot semantic segmentation

引用

Science China(Information Sciences) 2023年第11期66卷 35-53页

作者： Xianglong LIU Shihao BAI Shan AN Shuo WANG Wei LIU Xiaowei ZHAO Yuqing MA State Key Lab of Software Development Environment Beihang University JD Health International Inc.

Zero-shot semantic segmentation, which is developed to segment unseen categories, has attracted increasing attention due to its strong practicability. Previous approaches usually applied semantic-visual mapping based on seen categories to unseen categories, and thus failed to generate meaningful unseen visual representations and struggled to balance the seen and unseen concepts in the classifier. To overcome the above limitations, we propose a novel meaningful learning method that could be embedded into any generationbased zero-shot semantic segmentation model, borrowing the idea from the educational psychology field. The proposed meaningful learning method refers to the process that the new concepts could be learned by relating to existing comprehensible concepts and harmoniously incorporated into the concept schema. Specifically, we introduce a generator with conjugate conceptual correlation(G3C) which generates meaningful unseen visual information through anchoring into existing concepts. Moreover, simulating the rational thinking mechanism,we introduce a fast-slow concept modulator to alleviate the noisy over-correlation problem introduced by G3C and further construct a comprehensive concept schema. Extensive experiments conducted on three benchmarks demonstrate the superior performance of our method, especially according to the commonlyacknowledged h-m Io U(e.g., 4% improvement on the Pascal-VOC dataset).

关键词： meaningful learning zero-shot learning semantic segmentation conjugate conceptual correlation fast-slow conceptual modulator

来源：评论

学校读者我要写书评

暂无评论

Flow-Graph Based Optimization of Containerized Resource Scheduling: An Efficient Scheduling Algorithm for Kubernetes Clusters

Flow-Graph Based Optimization of Containerized Resource Sche...

引用

2024 International Conference on Intelligent Computing and Robotics, ICICR 2024

作者： Zhang, Le Ji, Xin Peng, Fang Li, Junting Chen, Yiting Zhang, Kui Big Data Center State Grid Corporation of China Beijing China State Key Laboratory of Software Development Environment Beihang University Beijing China

ISBN: (纸本)9798350372274

With the widespread adoption of containerization technology and the evolution of cloud computing, efficient scheduling of containerized applications in cluster environments has become an increasingly important area of research. Kubernetes, as a mainstream container orchestration tool, faces several challenges with its default queue-based and greedy scheduling algorithm, especially in large-scale deployments, such as high latency and low scheduling robustness. This paper introduces a flow-graph-based optimization method for containerized resource scheduling, modeling the scheduling problem as a Minimum Cost Maximum Flow problem to achieve global optimization. Comparative experiments with traditional queue-based and random scheduling algorithms demonstrate the superiority of the proposed method in terms of balanced resource utilization, robustness of scheduling outcomes, and reduced algorithmic latency. This study provides a more efficient resource scheduling strategy for container orchestration tools like Kubernetes and offers a new perspective on resource management in large-scale containerized application environments. ©2024 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

ICCG:low-cost and efficient consistency with adaptive synchronization for metadata replication

引用

Frontiers of Computer Science 2025年第1期19卷 53-70页

作者： Chenhao ZHANG Liang WANG Jing SHANG Zhiwen XIAO Limin XIAO Meng HAN Bing WEI Runnan SHEN Jinquan WANG State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China School of Cyberspace Security Hainan UniversityHaikou 570228China China Mobile Information Technology Center Beijing 100033China

The rapid growth in the storage scale of wide-area distributed file systems (DFS) calls for fast and scalable metadata management. Metadata replication is the widely used technique for improving the performance and scalability of metadata management. Because of the POSIX requirement of file systems, many existing metadata management techniques utilize a costly design for the sake of metadata consistency, leading to unacceptable performance overhead. We propose a new metadata consistency maintenance method (ICCG), which includes an incremental consistency guaranteed directory tree synchronization (ICGDT) and a causal consistency guaranteed replica index synchronization (CCGRI), to ensure system performance without sacrificing metadata consistency. ICGDT uses a flexible consistency scheme based on the state of files and directories maintained through the conflict state tree to provide an incremental consistency for metadata, which satisfies both metadata consistency and performance requirements. CCGRI ensures low latency and consistent access to data by establishing a causal consistency for replica indexes through multi-version extent trees and logical time. Experimental results demonstrate the effectiveness of our methods. Compared with the strong consistency policies widely used in modern DFSes, our methods significantly improve the system performance. For example, in file creation, ICCG can improve the performance of directory tree operations by at least 36.4 times.

关键词： metadata management metadata replication consistency directory tree replica index

来源：评论

学校读者我要写书评

暂无评论

A Virtual Hand Based Manipulation Learning Framework for Dexterous Hand 14

A Virtual Hand Based Manipulation Learning Framework for Dex...

引用

14th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2023

作者： Zhou, Luyue Hu, Yumeng Lin, Mengxiang State Key Laboratory of Software Development Environment China Beihang University School of Mechanical Engineering and Automation China

ISBN: (纸本)9798350324228

Dexterous hand programming is considered to be generally difficult suffering from high degree of freedom. Vision-based manipulation learning provides an efficient way to support automatic programming by human demonstration. However, complex visual perception is tightly coupled with the kinematics structure of dexterous hand in existing solutions, which makes it hard to migrate the developed algorithm from one kind of dexterous hand to another due to their kinematic difference. To address the issue, we introduce an intermediary called virtual hand and a new paradigm of motion mapping, serving as the link between human hand and dexterous hand. The virtual hand is generated in real time by hand pose estimation to track the motion of human hand. Then the joint configurations of dexterous hand and robotic arm can be calculated using geometry and optimization method based on the motion mapping paradigm we proposed. The method we introduced decouples the visual perception and kinematics calculation, which brings flexibility and low cost. The results of our preliminary experiments show the effectiveness of our method. © 2023 IEEE.

关键词： Kinematics

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic Graph Neural Network for Temporal Knowledge Graph Completion 30

Hyperbolic Graph Neural Network for Temporal Knowledge Graph...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Li, Yancong Zhang, Xiaoming Cui, Ying Ma, Shuai School of Cyber Science and Technology Beihang University Beijing China State Key Laboratory of Software Development Environment Beihang University Beijing China

ISBN: (纸本)9782493814104

Temporal Knowledge Graphs (TKGs) represent a crucial source of structured temporal information and exhibit significant utility in various real-world applications. However, TKGs are susceptible to incompleteness, necessitating Temporal Knowledge Graph Completion (TKGC) to predict missing facts. Existing models have encountered limitations in effectively capturing the intricate temporal dynamics and hierarchical relations within TKGs. To address these challenges, HyGNet is proposed, leveraging hyperbolic geometry to effectively model temporal knowledge graphs. The model comprises two components: the Hyperbolic Gated Graph Neural Network (HGGNN) and the Hyperbolic Convolutional Neural Network (HCNN). HGGNN aggregates neighborhood information in hyperbolic space, effectively capturing the contextual information and dependencies between entities. HCNN interacts with embeddings in hyperbolic space, effectively modeling the complex interactions between entities, relations, and timestamps. Additionally, a consistency loss is introduced to ensure smooth transitions in temporal embeddings. The extensive experimental results conducted on four benchmark datasets for TKGC highlight the effectiveness of HyGNet. It achieves state-of-the-art performance in comparison to previous models, showcasing its potential for real-world applications that involve temporal reasoning and knowledge prediction. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

MDS: A Fine-Grained Dataset for Multi-Modal Dialogue Summarization 30

MDS: A Fine-Grained Dataset for Multi-Modal Dialogue Summari...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Liu, Zhipeng Zhang, Xiaoming Zhang, Litian Yu, Zelong School of Cyber Science and Technology Beihang University Beijing China State Key Laboratory of Software Development Environment Beihang University Beijing China

ISBN: (纸本)9782493814104

Due to the explosion of various dialogue scenes, summarizing the dialogue into a short message has drawn much attention recently. In the multi-modal dialogue scene, people tend to use tone and body language to illustrate their intentions. While traditional dialogue summarization has predominantly focused on textual content, this approach may overlook vital visual and audio information essential for understanding multi-modal interactions. Recognizing the established field of multi-modal dialogue summarization, we develop a new multi-modal dialogue summarization dataset (MDS), which aims to enhance the variety and scope of data available for this research area. MDS provides a demanding testbed for multi-modal dialogue summarization. Subsequently, we conducted a comparative analysis of various summarization techniques on MDS and found that the existing methods tend to produce redundant and incoherent summaries. All of the models generate unfaithful facts to some degree, suggesting future research directions. MDS is available at https://***/R00kkie/MDS. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Dialogue Summarization Language Resources Multi-Modal Learning

来源：评论

学校读者我要写书评

暂无评论

Research on performance optimization of virtual data space across WAN

引用

Frontiers of Computer Science 2024年第6期18卷 167-187页

作者： Jiantong HUO 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 Hebei Key Laboratory of Agricultural Big Data Hebei Agricultural UniversityBaoding 071001China

For the high-performance computing in a WAN environment,the geographical locations of national supercomputing centers are scattered and the network topology is complex,so it is difficult to form a unified view of *** aggregate the widely dispersed storage resources of national supercomputing centers in China,we have previously proposed a global virtual data space named GVDS in the project of“High Performance Computing Virtual Data Space”,a part of the National key Research and development Program of *** GVDS enables large-scale applications of the high-performance computing to run efficiently across ***,the applications running on the GVDS are often data-intensive,requiring large amounts of data from multiple supercomputing centers across *** this regard,the GVDS suffers from performance bottlenecks in data migration and access across *** solve the above-mentioned problem,this paper proposes a performance optimization framework of GVDS including the multitask-oriented data migration method and the request access-aware IO proxy resource allocation *** a WAN environment,the framework proposed in this paper can make an efficient migration decision based on the amount of migrated data and the number of multiple data sources,guaranteeing lower average migration latency when multiple data migration tasks are running in *** addition,it can ensure that the thread resource of the IO proxy node is fairly allocated among different types of requests(the IO proxy is a module of GVDS),so as to improve the application’s performance across *** experimental results show that the framework can effectively reduce the average data access delay of GVDS while improving the performance of the application greatly.

关键词： storage aggregation across WANs large-scale applications GVDS data migration allocation of IO proxy resource

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：