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

Combining KNN with AutoEncoder for Outlier Detection

Journal of Computer Science & Technology 2024年第5期39卷 1153-1166页

作者： Shu-Zheng Liu Shuai Ma Han-Qing Chen Li-Zhen Cui Jie Ding State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Software Shandong UniversityJinan 250100China Joint SDU-NTU Centre for Artificial Intelligence Research Shandong UniversityJinan 250100China School of Computer Science Jiangsu University of Science and TechnologyZhenjiang 212003China

K-nearest neighbor(KNN)is one of the most fundamental methods for unsupervised outlier detection because of its various advantages,e.g.,ease of use and relatively high ***,most data analytic tasks need to deal with high-dimensional data,and the KNN-based methods often fail due to“the curse of dimensionality”.AutoEncoder-based methods have recently been introduced to use reconstruction errors for outlier detection on high-dimensional data,but the direct use of AutoEncoder typically does not preserve the data proximity relationships well for outlier *** this study,we propose to combine KNN with AutoEncoder for outlier ***,we propose the Nearest Neighbor AutoEncoder(NNAE)by persevering the original data proximity in a much lower dimension that is more suitable for performing ***,we propose the K-nearest reconstruction neighbors(K NRNs)by incorporating the reconstruction errors of NNAE with the K-distances of KNN to detect ***,we develop a method to automatically choose better parameters for optimizing the structure of ***,using five real-world datasets,we experimentally show that our proposed approach NNAE+K NRN is much better than existing methods,i.e.,KNN,Isolation Forest,a traditional AutoEncoder using reconstruction errors(AutoEncoder-RE),and Robust AutoEncoder.

关键词： outlier detection AutoEncoder K-nearest neighbor(KNN) unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Building a domain-specific compiler for emerging processors with a reusable approach

引用

Science China(Information Sciences) 2024年第1期67卷 20-38页

作者： Mingzhen LI Yi LIU Bangduo CHEN Hailong YANG Zhongzhi LUAN Depei QIAN State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University

High-performance computing and deep learning domains have been motivating the design of domain-specific *** these processors can provide promising computation capability,they are notorious for exotic programming *** improve programming productivity and fully exploit the performance potential of these processors,domain-specific compilers(DSCs) have been ***,building DSCs for emerging processors requires tremendous engineering efforts because the commonly used compilation stack is difficult to be *** to the advent of multilevel intermediate representation(MLIR),DSC developers can leverage reusable infrastructure to extend their customized functionalities without rebuilding the entire compilation *** this paper,we further demonstrate the effectiveness of MLIR by extending its reusable infrastructure to embrace a heterogeneous many-core processor(Sunway processor).In particular,we design a new Sunway dialect and corresponding backend for the Sunway processor,fully exploiting its architectural advantage and hiding its programming *** show the ease of building a DSC,we leverage the Sunway dialect and existing MLIR dialects to build a stencil compiler for the Sunway *** experimental results show that our stencil compiler,built with a reusable approach,can even perform better than state-of-the-art stencil compilers.

关键词： domain-specific compiler emerging processor reusable dialect performance optimization MLIR

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Towards optimized tensor code generation for deep learning on sunway many-core processor

引用

Frontiers of Computer Science 2024年第2期18卷 1-15页

作者： Mingzhen LI Changxi LIU Jianjin LIAO Xuegui ZHENG Hailong YANG Rujun SUN Jun XU Lin GAN Guangwen YANG Zhongzhi LUAN Depei QIAN State Key Laboratory of Software Development Environment Beijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China National University of Singapore Singapore 119077Singapore State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi 214000China Science and Technology on Special System Simulation Laboratory Beijing Simulation Center Beijing 100854China Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China

The flourish of deep learning frameworks and hardware platforms has been demanding an efficient compiler that can shield the diversity in both software and hardware in order to provide application *** the existing deep learning compilers,TVM is well known for its efficiency in code generation and optimization across diverse hardware *** the meanwhile,the Sunway many-core processor renders itself as a competitive candidate for its attractive computational power in both scientific computing and deep learning *** paper combines the trends in these two ***,we propose swTVM that extends the original TVM to support ahead-of-time compilation for architecture requiring cross-compilation such as *** addition,we leverage the architecture features during the compilation such as core group for massive parallelism,DMA for high bandwidth memory transfer and local device memory for data locality,in order to generate efficient codes for deep learning workloads on *** experiment results show that the codes generated by swTVM achieve 1.79x improvement of inference latency on average compared to the state-of-the-art deep learning framework on Sunway,across eight representative *** work is the first attempt from the compiler perspective to bridge the gap of deep learning and Sunway processor particularly with productivity and efficiency in *** believe this work will encourage more people to embrace the power of deep learning and Sunwaymany-coreprocessor.

关键词： sunway processor deep learning compiler code generation performance optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Predicting accepted pull requests in GitHub

引用

Science China(Information Sciences) 2021年第7期64卷 241-243页

作者： Jing JIANG Jiateng ZHENG Yun YANG Li ZHANG Jie LUO State Key Laboratory of Software Development Environment Beihang University

Dear editor,Various open source software hosting sites, such as Github,provide support for pull-based development and allow developers to flexibly and efficiently make contributions [1].

关键词： None1 None2 None3 None4 None5

来源：评论

学校读者我要写书评

暂无评论

Effective Training of PINNs by Combining CMA-ES with Gradient Descent 13

Effective Training of PINNs by Combining CMA-ES with Gradien...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Liu, Lin Yuan, Yuan School of Computer Science and Engineering Beihang University Beijing100191 China State Key Laboratory of Software Development Environment Zhongguancun Laboratory Beijing100191 China

ISBN: (纸本)9798350308365

Physics-Informed Neural Networks (PINNs) have recently received increasing attention, however, optimizing the loss function of PINNs is notoriously difficult, where the landscape of the loss function is often highly non-convex and rugged. Local optimization methods based on gradient information can converge quickly but are prone to being trapped in local minima for training PINNs. Evolutionary algorithms (EAs) are well known for the global search ability, which can help escape from local minima. It has been reported in the literature that EAs show some advantages over gradient-based methods in training PINNs. Inspired by the Memetic Algorithm, we combine global-search based EAs and local-search based batch gradient descent in order to make the best of both word. In addition, since the PINN loss function is composed of multiple terms, balancing these terms is also a challenging issue. Therefore, we also attempt to combine EAs with multiple-gradient descent algorithm for multi-objective optimization. Our experiments provide strong evidence for the superiority of the above algorithms. © 2024 IEEE.

关键词： Optimization 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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：