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

Sensing, Measurement & Data Analytics in the era of Artificial Intelligence (ICSMD), International Conference on

作者： Jiefei Yu Zicheng Cao Siyi He Zuyi Gu Yingcheng Xu Kai Zhong Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Anhui University Anhui China Data Science and Big Data Technology School of Big Data and Statistics Anhui University Anhui China

ISBN: (数字)9798331529192

ISBN: (纸本)9798331529208

Capturing the root cause and propagation path of the fault is critical to ensuring the safety and efficiency of industrial processes, especially those that inadequately utilize process knowledge and data. To address this issue, a unified framework integrating knowledge and data for collaborative root cause identification is proposed. First, the knowledge causal graph (KCG) is constructed using expert knowledge and industrial flow charts, providing a preliminary reference for subsequent causality analysis. Next, by replacing the traditional vector autoregression (VAR) model in Granger Causality (GC) with the gated recurrent unit (GRU), a more reliable causal relationship between variables is obtained. Additionally, a causality fusion propagation path identification method (CF-PPI) is designed to identify the root cause and propagation path of the fault, so that the obtained fault propagation path has less redundancy and higher accuracy. Finally, the method is validated using data from the ASHRAE RP-1043 centrifugal chiller.

关键词： Fault diagnosis Knowledge engineering Reactive power Analytical models Delay effects Redundancy Collaboration Cause effect analysis Vectors Safety

来源：评论

学校读者我要写书评

暂无评论

Research on patent recommendation method based on graph neural network

Research on patent recommendation method based on graph neur...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Enchao Zhang Weidong Liu Shi Liu Yan Cao College of Computer Science Inner Mongolia University China Institute of Scientific and Technical Information of China China National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China Inner Mongolia Key Laboratory of Social Computing and Data Processing China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

Intellectual property transactions have shown a strong growth momentum in recent years, but the patent transaction market has been plagued by the matching degree of consumers and sellers, resulting in frequent problems such as low patent transformation efficiency and poor transaction quality. This paper proposes a method of recommending patents to consumers by experts to improve the environment of patent transactions. Through the analysis of the past transaction information of the patent, the effective path information of the target is extracted. The graph neural network is used to describe the characteristics and semantics among experts, patents and consumers, and then capture the potential weight among them through the common attention mechanism, and then dynamically integrate them to predict the occurrence of recommendation behavior. The paper makes reasonable use of social information and expert information in the transaction, which significantly improves the rationality and accuracy of expert recommendation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Acceleration method for target HRRP generation based on DDPM

Acceleration method for target HRRP generation based on DDPM

引用

Signal, information and Data processing (ICSIDP), IEEE International Conference on

作者： Xitai Shen Qiang Zhou Bingqian Yu Xin Zhang Yanhua Wang Liang Zhang Radar Technology Research Institute Beijing Institute of Technology Beijing China Zhengzhou Academy of Intelligent Technology Beijing Institute of Technology Zhengzhou China Beijing Key Laboratory of Embedded Real-Time Information: Processing Technology Beijing China Chongqing Innovation Center Beijing Institute of Technology Chongqing China

ISBN: (数字)9798331515669

ISBN: (纸本)9798331515676

The target high resolution range profile (HRRP) is the sum of the vector projected on the radar line of sight of the target scatters, which can reflect the radial structure characteristics of the target and is one of the important means of radar target recognition. Existing HRRP-based target recognition methods adopt the idea of machine learning classification, which usually require sufficient training samples to obtain satisfactory recognition performance. To solve the dilemma of insufficient radar HRRP data caused by factors such as non-cooperative target and complexity of data acquisition process, this paper uses denoising diffusion probabilistic models (DDPM) to generate HRRP data. Furthermore, to solve the problem that the DDPM generation speed is too slow to meet the actual needs, this paper designs a fast DDPM HRRP (FDH) data generation method based on progressive knowledge distillation. Finally, the experimental results show that the generation speed is increased by about 25 times compared with the initial model under the premise of losing 7.6% similarity.

关键词： Training Target recognition Noise reduction Radar Radar scattering Data collection Feature extraction Sampling methods Diffusion models Vectors

来源：评论

学校读者我要写书评

暂无评论

Fast-StrucTexT: An Efficient Hourglass Transformer with Modality-guided Dynamic Token Merge for Document Understanding

arXiv

引用

arXiv 2023年

作者： Zhai, Mingliang Li, Yulin Qin, Xiameng Yi, Chen Xie, Qunyi Zhang, Chengquan Yao, Kun Wu, Yuwei Jia, Yunde Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Baidu Inc. China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China

Transformers achieve promising performance in document understanding because of their high effectiveness and still suffer from quadratic computational complexity dependency on the sequence length. General efficient transformers are challenging to be directly adapted to model document. They are unable to handle the layout representation in documents, e.g. word, line and paragraph, on different granularity levels and seem hard to achieve a good trade-off between efficiency and performance. To tackle the concerns, we propose Fast-StrucTexT, an efficient multi-modal framework based on the StrucTexT algorithm with an hourglass transformer architecture, for visual document understanding. Specifically, we design a modality-guided dynamic token merging block to make the model learn multi-granularity representation and prunes redundant tokens. Additionally, we present a multi-modal interaction module called Symmetry Cross Attention (SCA) to consider multi-modal fusion and efficiently guide the token mergence. The SCA allows one modality input as query to calculate cross attention with another modality in a dual phase. Extensive experiments on FUNSD, SROIE, and CORD datasets demonstrate that our model achieves the state-of-the-art performance and almost 1.9× faster inference time than the state-of-the-art methods. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

A Time-Efficient Distributed Constant Conditional Functional Dependency Discovery Algorithm for Data Consistency

A Time-Efficient Distributed Constant Conditional Functional...

引用

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Junchao Chen Jian-tao Zhou Xinyu Hao Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology College of Computer Science Inner Mongolia University Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Hohhot China

ISBN: (数字)9798350376968

ISBN: (纸本)9798350376975

The accuracy of data analysis depends on data quality, and addressing data consistency issues is a key challenge to improve it. Constant Conditional Functional Dependency (CCFD) is an effective approach that ensures data consistency by enforcing bindings of semantically related values, thus providing quality assurance for data analysis and decision-making processes. However, with the growth of data scale, especially the increasing number of data tuples and attributes, existing single-machine CCFD discovery algorithms face issues of low computational efficiency and lengthy computation time. This paper proposes a time-efficient distributed CCFD discovery algorithm (DCCFD). Through the optimization of data preprocessing and index mapping, the data organization structure is enhanced, laying the foundation for the discovery of CCFDs under distributed conditions. The Spark parallel computing framework is used to partition the dataset, which accelerates the parallel loading and processing of data. Additionally, this algorithm ensures accuracy and processing speed when discovering dependencies by efficiently generating frequent itemsets and verifying CCFDs in parallel. Experiments on multiple real datasets show that, especially with the complex Airline dataset, the DCCFD algorithm not only accurately discovers CCFDs, but also reduces the average running time by 75.64% compared with the preCFDMiner algorithm.

关键词： Accuracy Data preprocessing Software algorithms Distributed databases Parallel processing Software Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Exploring Patent Transformation Event: Forecasting Patent Transfer Time

Exploring Patent Transformation Event: Forecasting Patent Tr...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Jinchen Huo Weidong Liu Yang Li Yan Cao College of Computer Science Inner Mongolia University China Institute of Scientific and Technical Information of China China National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China Inner Mongolia Key Laboratory of Social Computing and Data Processing China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

As the largest source of technical information around the world, patents are regarded as an essential crystallization and carrier of knowledge and technological innovation. Patent transformation is conducive not only to enhancing economic efficiency, but also to improving productivity and the rational utilization of resources. There is an imbalance between high patent ownership and low transformation rates. We try to predict the occurrence of transformation events from the patent assignment. However, there are some challenges in predicting patent transformation: (1) how to capture transformation features of patents, especially combined with the transfer time factor. (2) how to predict patent transfer time effectively. To address these challenges, a Patent Transfer Time Forecasting Model (PTTFM) is proposed. The model includes: (1) extraction of time-varying features of patents. (2) the patent transfer time is forecast using a Neural Temporal Point Process. By testing the model on patents under different classifications, the experimental results are obtained to show that the proposed model is applicable to predict the timing of patent assignment within a certain time frame, especially one month. Our work may facilitate patent transformation while interpretability is ensured for transformation events.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-Terrain Radar HRRP Target Detection Using Contrastive Learning

Multi-Terrain Radar HRRP Target Detection Using Contrastive ...

引用

Signal, information and Data processing (ICSIDP), IEEE International Conference on

作者： Xinyang Wang Mingchen Yuan Jiaqi Liu Yang Li Yanhua Wang Liang Zhang Radar Technology Research Institute Beijing Institute of Technology Beijing China Chongqing Innovation Center Beijing Institute of Technology Chongqing China Zhengzhou Academy of Intelligent Technology Beijing Institute of Technology Zhengzhou China Beijing Key Laboratory of Embedded Real-Time Information: Processing Technology Beijing China

ISBN: (数字)9798331515669

ISBN: (纸本)9798331515676

As radar resolution improves, high-resolution radars have significantly enhanced target detection performance through the generation of high-resolution range profiles (HRRPs). However, when the range resolution is much smaller than the target, the target’s energy is dispersed across multiple range cells, leading to poor detection performance with traditional energy-based detection algorithms. Furthermore, existing detection algorithms are highly sensitive to clutter characteristics and exhibit poor adaptability to varying scenarios. To address these issues, this paper proposes a Constant False Alarm Rate (CFAR) HRRP detection algorithm based on contrastive learning for multiple terrains. The algorithm improves the contrastive learning loss function to achieve well-clustered representations of clutter samples during training. Test samples are evaluated by calculating the Mahalanobis distance between them and the training samples, and compared against detection thresholds to accomplish target detection. Testing results show that the proposed algorithm achieves superior detection performance across multiple terrains. Furthermore, to reach a 90% detection probability, the proposed method requires a signal-to-clutter ratio (SCR) reduction of 1 to 4 dB compared to the competing methods.

关键词： Training Energy resolution Radar detection Object detection Contrastive learning Radar Detection algorithms Clutter Signal to noise ratio Testing

来源：评论

学校读者我要写书评

暂无评论

Performer: A High-Performance Global-Local Model-Augmented with Dual Network Interaction Mechanism

引用

IEEE Transactions on Cognitive and Developmental Systems 2024年

作者： Tan, Dayu Hao, Rui Hua, Linfeng Xu, Qi Su, Yansen Zheng, Chunhou Zhong, Weimin Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Institutes of Physical Science and Information Technology Hefei230601 China East China University of Science and Technology Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education Shanghai200237 China Dalian University of Technology School of Computer Science and Technology Dalian116024 China

In deep learning, Convolutional Neural Networks (CNNs) focus on local information through convolutional kernels, while transformers attend to global information using self-attention mechanisms. The union of these distinct approaches enables a more comprehensive extraction of image features. However, the feature map dimensions of CNN and Transformer differ, leading to dimension mismatch issues when combining these architectures. Additionally, the parameter size of the hybrid model integrating both architectures remains large, making it difficult to train. To further augmenting the interpretation of complex image patterns, we present Performer, a dual-network architecture that seamlessly combines CNNs and transformers, resulting in a novel and efficient representation learning model. In the Performer model, we innovate by devising a unique interaction methodology for CNN and transformer architectures to enhance the image feature extraction capabilities mutually. To counteract issue of dimensionality mismatch, we also introduce a refined transformer block, a advancement over the transformer block of ViT. To validate the effectiveness of Performer, we conduct extensive experiments on both classification and segmentation tasks. Performer achieve an accuracy of 83.37% on the ImageNet-200 dataset. For semantic segmentation, Performer excels on the CamVid and Hippocampus datasets. On CamVid, our model achieves a mean Intersection over Union (mIoU) of 63.27% and Pixel Accuracy of 92.11%, demonstrating superior performance in capturing fine details and handling complex scenes effectively. The code is available at https://***/hlfthh/ Performer. © 2016 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Parameterized Cost Volume for Stereo Matching

Parameterized Cost Volume for Stereo Matching

引用

International Conference on Computer Vision (ICCV)

作者： Jiaxi Zeng Chengtang Yao Lidong Yu Yuwei Wu Yunde Jia Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Autonomous Driving Algorithm Deeproute Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China

Stereo matching becomes computationally challenging when dealing with a large disparity range. Prior methods mainly alleviate the computation through dynamic cost volume by focusing on a local disparity space, but it requires many iterations to get close to the ground truth due to the lack of a global view. We find that the dynamic cost volume approximately encodes the disparity space as a single Gaussian distribution with a fixed and small variance at each iteration, which results in an inadequate global view over disparity space and a small update step at every iteration. In this paper, we propose a parameterized cost volume to encode the entire disparity space using multi-Gaussian distribution. The disparity distribution of each pixel is parameterized by weights, means, and variances. The means and variances are used to sample disparity candidates for cost computation, while the weights and means are used to calculate the disparity output. The above parameters are computed through a JS-divergence-based optimization, which is realized as a gradient descent update in a feed-forward differential module. Experiments show that our method speeds up the runtime of RAFT-Stereo by 4 ~ 15 times, achieving real-time performance and comparable accuracy. The code is available at https://***/jiaxiZeng/Parameterized-Cost-Volume-for-Stereo-Matching.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sparse Point Guided 3D Lane Detection

Sparse Point Guided 3D Lane Detection

引用

International Conference on Computer Vision (ICCV)

作者： Chengtang Yao Lidong Yu Yuwei Wu Yunde Jia School of Computer Science & Technology Beijing Key Laboratory of Intelligent Information Technology Beijing Institute of Technology China Autonomous Driving Algorithm DeepRoute Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China

3D lane detection usually builds a dense correspondence between the front-view space and the BEV space to estimate lane points in the 3D space. 3D lanes only occupy a small ratio of the dense correspondence, while most correspondence belongs to the redundant background. This sparsity phenomenon bottlenecks valuable computation and raises the computation cost of building a high-resolution correspondence for accurate results. In this paper, we propose a sparse point-guided 3D lane detection, focusing on points related to 3D lanes. Our method runs in a coarse-to-fine manner, including coarse-level lane detection and iterative fine-level sparse point refinements. In coarse-level lane detection, we build a dense but efficient correspondence between the front view and BEV space at a very low resolution to compute coarse lanes. Then in fine-level sparse point refinement, we sample sparse points around coarse lanes to extract local features from the high-resolution front-view feature map. The high-resolution local information brought by sparse points refines 3D lanes in the BEV space hierarchically from low resolution to high resolution. The sparse point guides a more effective information flow and greatly promotes the SOTA result by 3 points on the overall F1-score and 6 points on several hard situations while reducing almost half memory cost and speeding up 2 times.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：