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

arXiv 2023年

作者： Li, Jiahang Zhang, Yikang Yun, Peng Zhou, Guangliang Chen, Qijun Fan, Rui The College of Electronics & Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems The State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai201804 China The Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong

The recent advancements in deep convolutional neural networks have shown significant promise in the domain of road scene parsing. Nevertheless, the existing works focus primarily on freespace detection, with little attention given to hazardous road defects that could compromise both driving safety and comfort. In this article, we introduce RoadFormer, a novel Transformer-based data-fusion network developed for road scene parsing. RoadFormer utilizes a duplex encoder architecture to extract heterogeneous features from both RGB images and surface normal information. The encoded features are subsequently fed into a novel heterogeneous feature synergy block for effective feature fusion and recalibration. The pixel decoder then learns multi-scale long-range dependencies from the fused and recalibrated heterogeneous features, which are subsequently processed by a Transformer decoder to produce the final semantic prediction. Additionally, we release SYN-UDTIRI, the first large-scale road scene parsing dataset that contains over 10,407 RGB images, dense depth images, and the corresponding pixel-level annotations for both freespace and road defects of different shapes and sizes. Extensive experimental evaluations conducted on our SYN-UDTIRI dataset, as well as on three public datasets, including KITTI road, CityScapes, and ORFD, demonstrate that RoadFormer outperforms all other state-of-the-art networks for road scene parsing. Specifically, RoadFormer ranks first on the KITTI road benchmark. Our source code, created dataset, and demo video are publicly available at ***/RoadFormer. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Enhanced Particle Swarm Optimization for Workflow Scheduling in Clouds

Enhanced Particle Swarm Optimization for Workflow Scheduling...

引用

Symposium of Image, Signal Processing, and Artificial Vision (STSIVA)

作者： Chang Lu Dayu Feng Jie Zhu Haiping Huang Nanjing University of Posts & Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing China

ISBN: (纸本)9781665426565

As a NP-hard problem, it is always baffling to figure out a scheduling strategy to arrange the interconnected tasks of a workflow on the infinite number of resources in the cloud environment so that the workflow can be addressed efficiently and robustly. This paper focuses on scheduling the workflow’s tasks on the cloud resources with less rental cost of resources while the whole schedule length (makespan) will not exceed the given deadline. As one of the most popular evolutionary algorithms, particle swarm optimization (PSO) has been successfully applied for the workflow scheduling problem. Inspired by the idea of multiple groups and the distributed parallel computing, we develop an enhanced PSO algorithm for the workflow scheduling problem in clouds. Besides, a pretreatment strategy is adopted to simplify the workflow’s structure. The experimental results demonstrate that our proposal has good performance on improving the algorithm’s searching ability and finding better solutions.

关键词： Schedules Costs Processor scheduling NP-hard problem Parallel processing Scheduling Proposals

来源：评论

学校读者我要写书评

暂无评论

Extracting Chinese abbreviation-definition pairs from anchor texts

Extracting Chinese abbreviation-definition pairs from anchor...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Li-Xing Xie Ya-Bin Zheng Zhi-Yuan Liu Mao-Song Sun Can-Hui Wang State Key Laboratory on Intelligent Technology and Systems Tsinghua National Laboratory of Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing China Research and Development center Sohu Inc. Beijing China

This paper proposes an automatic scheme to extract Chinese abbreviations and their corresponding definitions from large-scale anchor texts. This method is motivated by the observation that the more frequently two anchor texts point to the same web page, the more related they are. Since abbreviation-definition pairs are highly related, they can be extracted from these related words. Our method involves three steps. Firstly we utilize external statistical features to extract candidate abbreviation-definition pairs from anchor texts. Secondly we extract internal features from candidate pairs and adopt Conditional Random Fields (CRFs) to compute a score for each candidate pair. Finally we combine external and internal features to generate the final pairs. Experimental results show that this method can accurately extract Chinese abbreviation-definition pairs from anchor texts and combining both external and internal features is effective for extracting abbreviation-definition pairs.

关键词： Feature extraction Equations Bipartite graph Mathematical model Training Labeling Machine learning

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Fault Diagnosis Method with Uncertainty Quantification Using Bayesian Convolutional Neural Network

An Enhanced Fault Diagnosis Method with Uncertainty Quantifi...

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： Qihang Fang Gang Xiong Xiuqin Shang Sheng Liu Bin Hu Zhen Shen State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences School of Artificial Intelligence University of Chinese Academy of Sciences Beijing Engineering Research Center of Intelligent Systems and Technology Institute of Automation Guangdong Engineering Research Center of 3D Printing and Intelligent Manufacturing Cloud Computing Center Chinese Academy of Sciences China

ISBN: (数字)9781728169040

ISBN: (纸本)9781728169057

Fault diagnosis is a vital technique to pinpoint the machine malfunctions in manufacturing systems. In recent years, the deep learning techniques greatly improve the fault detection accuracy, but there still remain some problems. If one fault is absent in the training data or the fault signal is disturbed by severe noise interference, the fault classifier may misjudge the health state. This problem limits the reliability of the fault diagnosis in real applications. In this paper, we enhance the fault diagnosis method by using Bayesian Convolutional Neural Network (BCNN). A Shannon entropy-based method is presented to quantify the prediction uncertainty. The BCNN turns the deterministic predictions to probabilistic distributions and enhances the robustness of the fault diagnosis. The uncertainty quantification method helps to indicate the wrong predictions, detect unknown faults, and discover the strong disturbances. Then, a fine-tuning strategy is applied to enhance the model performance further. The potential usability of the proposed method in monitoring the motors of 3D printers is studied. And the experiment is conducted on a motor bearing dataset provided by Case Western Reserve University. The proposed BCNN achieves 99.82% fault classification accuracy over nine health conditions. Its robustness is verified by comparing the testing accuracy with three other methods on the noisy datasets. And the uncertainty quantification method successfully detects the outlier inputs.

关键词： Fault diagnosis Uncertainty Bayes methods Circuit faults Robustness Predictive models Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Sampling methods for efficient training of graph convolutional networks: A survey

arXiv

引用

arXiv 2021年

作者： Liu, Xin Yan, Mingyu Deng, Lei Li, Guoqi Ye, Xiaochun Fan, Dongrui State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing100086 China Department of Precision Instrument Center for Brain Inspired Computing Research Tsinghua University Beijing100084 China School of Computer Science and Technology University of Chinese Academy of Sciences

—Graph Convolutional Networks (GCNs) have received significant attention from various research fields due to the excellent performance in learning graph representations. Although GCN performs well compared with other methods, it still faces challenges. Training a GCN model for large-scale graphs in a conventional way requires high computation and storage costs. Therefore, motivated by an urgent need in terms of efficiency and scalability in training GCN, sampling methods have been proposed and achieved a significant effect. In this paper, we categorize sampling methods based on the sampling mechanisms and provide a comprehensive survey of sampling methods for efficient training of GCN. To highlight the characteristics and differences of sampling methods, we present a detailed comparison within each category and further give an overall comparative analysis for the sampling methods in all categories. Finally, we discuss some challenges and future research directions of the sampling methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Three-Filters-to-Normal+: Revisiting Discontinuity Discrimination in Depth-to-Normal Translation

arXiv

引用

arXiv 2023年

作者： Yang, Jingwei Xue, Bohuan Feng, Yi Wang, Deming Fan, Rui Chen, Qijun The College of Electronics & Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems The State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai201804 China The Department of Computer Science & Engineering The Hong Kong University of Science and Technology Hong Kong SAR Hong Kong

This article introduces three-filters-to-normal+ (3F2N+), an extension of our previous work three-filters-to-normal (3F2N), with a specific focus on incorporating discontinuity discrimination capability into surface normal estimators (SNEs). 3F2N+ achieves this capability by utilizing a novel discontinuity discrimination module (DDM), which combines depth curvature minimization and correlation coefficient maximization through conditional random fields (CRFs). To evaluate the robustness of SNEs on noisy data, we create a large-scale synthetic surface normal (SSN) dataset containing 20 scenarios (ten indoor scenarios and ten outdoor scenarios with and without random Gaussian noise added to depth images). Extensive experiments demonstrate that 3F2N+ achieves greater performance than all other geometry-based surface normal estimators, with average angular errors of 7.85◦, 8.95◦, 9.25◦, and 11.98◦ on the clean-indoor, clean-outdoor, noisy-indoor, and noisy-outdoor datasets, respectively. We conduct three additional experiments to demonstrate the effectiveness of incorporating our proposed 3F2N+ into downstream robot perception tasks, including freespace detection, 6D object pose estimation, and point cloud completion. Our source code and datasets are publicly available at https://***/3F2Nplus. Note to Practitioners—The primary motivation behind this work arises from the need to develop a high-performing surface normal estimator for practical robotics and computer vision applications. While geometry-based surface normal estimators have been widely used in these domains, the existing solutions focus merely on discontinuity discrimination. To tackle this problem, this article introduces a plug-and-play module that leverages both depth curvature and correlation coefficient to quantify discontinuity levels, thereby optimizing surface normal estimation, particularly near or on discontinuous regions. Moreover, this article also introduces a large-scale public dataset wit

关键词： Gaussian noise (electronic)

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous Graph Reasoning for Fact Checking over Texts and Tables

arXiv

引用

arXiv 2024年

作者： Gong, Haisong Xu, Weizhi Wu, Shu Liu, Qiang Wang, Liang Center for Research on Intelligent Perception and Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences China School of Artificial Intelligence University of Chinese Academy of Sciences China ByteDance Inc

Fact checking aims to predict claim veracity by reasoning over multiple evidence pieces. It usually involves evidence retrieval and veracity reasoning. In this paper, we focus on the latter, reasoning over unstructured text and structured table information. Previous works have primarily relied on fine-tuning pretrained language models or training homogeneous-graph-based models. Despite their effectiveness, we argue that they fail to explore the rich semantic information underlying the evidence with different structures. To address this, we propose a novel word-level Heterogeneous-graph-based model for Fact Checking over unstructured and structured information, namely HeterFC. Our approach leverages a heterogeneous evidence graph, with words as nodes and thoughtfully designed edges representing different evidence properties. We perform information propagation via a relational graph neural network, facilitating interactions between claims and evidence. An attention-based method is utilized to integrate information, combined with a language model for generating predictions. We introduce a multitask loss function to account for potential inaccuracies in evidence retrieval. Comprehensive experiments on the large fact checking dataset FEVEROUS demonstrate the effectiveness of HeterFC. Code will be released at: https://***/Deno-V/HeterFC. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Joint product numerical range and geometry of reduced density matrices

引用

Science China(Physics,Mechanics & Astronomy) 2017年第2期60卷 9-17页

作者： Jianxin Chen Cheng Guo Zhengfeng Ji Yiu-Tung Poon Nengkun YU Bei Zeng Jie Zhou Joint Center for Quantum Information and Computer Science University of Maryland College Park 20740 USA Institute for Advanced Study Tsinghua University Beijing 100084 China Centre for Quantum Computation ＆ Intelligent Systems School of Software Faculty of Engineering and Information Technology University of Technology Sydney Sydney 2007 Australia State Key Laboratory of Computer Science.Institute of Software Chinese Academy of Sciences Beijing 100084 China Department of Mathematics Iowa State University Ames 50011-2140 USA Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Canada Department of Mathematics ＆ Statistics University of Guelph Guelph N1G 2 W1 Canada Perimeter Institute for Theoretical Physics Waterloo N2L 2Y5 Canada

The reduced density matrices of a many-body quantum system form a convex set, whose three-dimensional projection is convex in R3. The boundary of may exhibit nontrivial geometry, in particular ruled surfaces. Two physical mechanisms are known for the origins of ruled surfaces： symmetry breaking and gapless. In this work, we study the emergence of ruled surfaces for systems with local Hamiltonians in infinite spatial dimension, where the reduced density matrices are known to be separable as a consequence of the quantum de Finetti＇s theorem. This allows us to identify the reduced density matrix geometry with joint product numerical range II of the Hamiltonian interaction terms. We focus on the case where the interaction terms have certain structures, such that a ruled surface emerges naturally when taking a convex hull of ∏. We show that, a ruled surface on sitting in ∏ has a gapless origin, otherwise it has a symmetry breaking origin. As an example, we demonstrate that a famous ruled surface, known as the oloid, is a possible shape of , with two boundary pieces of symmetry breaking origin separated by two gapless lines.

关键词： reduced density matrices quantum tomography numerical range quantum information oloid ruled surface

来源：评论

学校读者我要写书评

暂无评论

HDD4DBP: A Large-Scale Multi-Modal Benchmark on Driving Behavior Prediction

HDD4DBP: A Large-Scale Multi-Modal Benchmark on Driving Beha...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Qinghui Dong Zhang Zhang Yubo Chang Wentao Chen Liang Wang Center for Research on Intelligent Perception and Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Driving behavior prediction (DBP) plays an important role in autonomous driving. Accurately anticipating driving behaviors (e.g., left turn, right turn) of ego-vehicles 3–5 seconds before actual occurrences of maneuvers can help AI pilots planning safer trajectories or informing possible dangers to drivers. However, current DBP benchmark datasets, e.g., the Brain4Cars, are restricted by the limited amount of data samples and small number of behavior categories. Thus, there is an urgent need for creating a new larger-scale benchmark to help boost the studies of DBP. In this work, based on the annotations in the HRI Driving Dataset (HDD), we extract 5000+ clips from untrimmed multi-modal data sequences to form a new dataset, termed the HDD4DBP, as a convincing large-scale testbed for evaluating various DPB methods. Furthermore, inspired by the success of transformers on modeling long range dependence in sequences, we build a strong baseline with the vision transformer (ViT) backbone for predicting driving behaviors. Compared to previous representative baselines, a large margin performance gain can be achieved by our strong baseline on the HDD4DBP. Moreover, simply fine-tuning the pre-trained strong baseline can obtain the state-of-the-art performance on the Brain4Cars dataset, thereby futher confirming the benefits of the HDD4DBP. The dataset and source code will be released. Find data and code at https://***/HDD4DBP/MTL.

关键词： Accuracy Source coding Benchmark testing Predictive models Performance gain Transformers Trajectory Planning Driver behavior Vehicles

来源：评论

学校读者我要写书评

暂无评论

Notice of Retraction: An adaptive SVR modeling method based on VFS for robotic grinding

Notice of Retraction: An adaptive SVR modeling method based ...

引用

International Conference on computer Science and Information Technology (CSIT)

作者： Yang Yang Yixu Song Jiaxin Wang Zhongxue Gan Lizhe Qi State Key Laboratory of Intelligent Technology and System Department of Computer S&T Tsinghua University Beijing China Research and Development Center InterSmart Robotic Systems Company Limited Langfang Hebei China

This article has been retracted by the publisher.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：