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

第四届材料科学应用与能源材料国际研讨会

作者： Xiaoxuan Wu Chen Zhang School of Artificial Intelligence and Big Data Hefei University Anhui Engineering Lab of Big Data Technology Application for Urban Infrastructure Hefei University

The water supply network is one of the important infrastructure in urban construction. It has strong theoretical and practical significance to realize the real-time monitoring and leak location of the water supply network. In this paper, based on the similarity of water supply network node pressure, fuzzy C-means clustering algorithm is used to realize the selection of finite monitoring points. On this basis, a depth neural network model is constructed according to the pressure changes of the monitoring points before and after the leakage of the water supply network, so as to locate the leakage points. In the experimental part, hydraulics simulation was conducted by using EPANETH pipe network adjustment software according to the layout structure of water supply network, and the pressure of all nodes was obtained. A deep neural network model was established by Keras in Tensorflow framework. After model training and testing, the training error was controlled within the effective range of 5%.Finally, the model is applied to the actual leakage problem of underground water supply network in Langxi County of Xuancheng City, and the accurate location of the leakage point is realized. The experiment proves the feasibility and accuracy of the method proposed in this paper.

关键词： Clustering Ensemble Deep Neural Network Fuzzy C-means Algorithm Leak Location Water Supply Network

来源：评论

学校读者我要写书评

暂无评论

OpticE: A Coherence Theory-Based Model for Link Prediction 29

OpticE: A Coherence Theory-Based Model for Link Prediction

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Gui, Xiangyu Zhao, Feng Jin, Langjunqing Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

Knowledge representation learning is a key step required for link prediction tasks with knowledge graphs (KGs). During the learning process, the semantics of each entity are embedded by a vector or a point in a feature space. The distance between these points is a measure of semantic similarity. However, in a KG, while two entities may have similar semantics in some relations, they have different semantics in others. It is ambiguous to assign a fixed distance to depict the variant semantic similarity of entities. To alleviate the semantic ambiguity in KGs, we design a new embedding approach named OpticE, which is derived from the well-known physical phenomenon of optical interference. It is a lightweight and relation-adaptive model based on coherence theory, in which each entity’s semantics vary automatically regarding different relations. In addition, a unique negative sampling method is proposed to combine the multimapping properties and self-adversarial learning during the training process. The experimental results obtained on practical KG benchmarks show that the OpticE model, with elegant structures, can compete with existing link prediction methods. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

RTGA: A Redundancy-free Accelerator for High-Performance Temporal Graph Neural Network Inference 24

RTGA: A Redundancy-free Accelerator for High-Performance Tem...

引用

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Yu, Hui Zhang, Yu Tan, Andong Lu, Chenze Zhao, Jin Liao, Xiaofei Jin, Hai Liu, Haikun National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9798400706011

Temporal Graph Neural Network (TGNN) has attracted much research attention because it can capture the dynamic nature of complex networks. However, existing solutions suffer from redundant computation overhead and excessive off-chip communications for TGNN inference because they often rely on redundant graph sampling and repeatedly fetching the features and vertex memory. This paper proposes a redundancy-free accelerator, RTGA, for high-performance TGNN inference. Specifically, RTGA proposes a redundancy-aware execution approach with temporal tree into a novel accelerator design to effectively eliminate unnecessary data processing for fewer redundant computations and off-chip communications and also designs a temporal-aware data caching method to improve data locality for TGNN. We have implemented and evaluated RTGA on a Xilinx Alveo U280 FPGA card. Compared with cutting-edge software solutions (i.e., TGN and TGL) and hardware solutions (i.e., BlockGNN and FlowGNN), RTGA improves the performance of TGNN inference by an average of 473.2x, 87.4x, 8.2x, and 6.9x and saves energy by 542.8x, 102.2x, 9.4x, and 8.3x, respectively. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Spatio-temporal data

来源：评论

学校读者我要写书评

暂无评论

Can Language Models Serve as Temporal Knowledge Bases?

Can Language Models Serve as Temporal Knowledge Bases?

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Zhao, Ruilin Zhao, Feng Xu, Guandong Zhang, Sixiao Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Data Science and Machine Intelligence Lab University of Technology Sydney Sydney Australia

Recent progress regarding the use of language models (LMs) as knowledge bases (KBs) has shown that language models can act as structured knowledge bases for storing relational facts. However, most existing works only considered the LM-as-KB paradigm in a static setting, which ignores the analysis of temporal dynamics of world knowledge. Furthermore, a basic function of KBs, i.e., the ability to store conflicting information (i.e., 1-N, N-1 and N-M relations), is underexplored. In this paper, we formulate two practical requirements for treating LMs as temporal KBs: (i) the capacity to store temporally-scoped knowledge that contains conflicting information and (ii) the ability to use stored knowledge for temporally-scoped knowledge queries. We introduce a new dataset called LAMA-TK which is aimed at probing temporally-scoped knowledge, and investigate the two above requirements to explore the LM-as-KB paradigm in the temporal domain. On the one hand, experiments show that LMs can memorize millions of temporally-scoped facts with relatively high accuracy and transfer stored knowledge to temporal knowledge queries, thereby expanding the LM-as-KB paradigm to the temporal domain. On the other hand, we show that memorizing conflicting information, which has been neglected by previous works, is still challenging for LMs and hinders the memorization of other unrelated one-to-one relationships. © 2022 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Optimal margin distribution machine for multi-instance learning 29

Optimal margin distribution machine for multi-instance learn...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Zhang, Teng Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9780999241165

Multi-instance learning (MIL) is a celebrated learning framework where each example is represented as a bag of instances. An example is negative if it has no positive instances, and vice versa if at least one positive instance is contained. During the past decades, various MIL algorithms have been proposed, among which the large margin based methods is a very popular class. Recently, the studies on margin theory disclose that the margin distribution is of more importance to generalization ability than the minimal margin. Inspired by this observation, we propose the multi-instance optimal margin distribution machine, which can identify the key instances via explicitly optimizing the margin distribution. We also extend a stochastic accelerated mirror prox method to solve the formulated minimax problem. Extensive experiments show the superiority of the proposed method. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

High-Performance and Resource-Efficient Dynamic Memory Management in High-Level Synthesis 24

High-Performance and Resource-Efficient Dynamic Memory Manag...

引用

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Wang, Qinggang Zheng, Long An, Zhaozeng Huang, Haoqin Zhu, Haoran Huang, Yu Yao, Pengcheng Liao, Xiaofei Jin, Hai National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China Zhejiang Lab Hangzhou China

ISBN: (纸本)9798400706011

With the merits of high productivity and ease of use, highlevel synthesis (HLS) tools bring hope to fast FPGA-based architecture development. However, their usability and popularity are still limited due to lack of support for dynamic memory management (DMM). Though HLS-compatible DMM solutions have been proposed recently, nevertheless, based on our investigation, none of them can hit high performance (i.e., minimal memory (de-)allocation latency) and resource efficiency (i.e., managing arbitrarily sized memory with minimal FPGA resource consumption) with one stone, seriously limiting their practicality. In response, we propose HeroDMM, a high-performance and resource-efficient dynamic memory manager for HLS. Specifically, HeroDMM organizes the managed memory area with a novel cartesian-like tree (CT) structure, a key to resolving the dilemma between (de-)allocation latency and resource efficiency standing in front of prior efforts. With the CT structure, HeroDMM further devises a delicate memory management algorithm and specializes the hardware implementation for achieving ever-higher performance while ensuring resource efficiency. Results show that HeroDMM outperforms state-of-the-art HLS-compatible DMM solutions by 61.69%∼99.99% in performance improvement and 23.79%∼97.22% in resource consumption savings. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Memory management

来源：评论

学校读者我要写书评

暂无评论

RESIDUAL ATTENTION BLOCK SEARCH FOR LIGHTWEIGHT IMAGE SUPER-RESOLUTION

RESIDUAL ATTENTION BLOCK SEARCH FOR LIGHTWEIGHT IMAGE SUPER-...

引用

2021 IEEE International Conference on Multimedia and Expo, ICME 2021

作者： Liao, Wenrui Zhao, Zhong-Qiu Shen, Hao Tian, Weidong School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China

ISBN: (纸本)9781665438643

Recently, lightweight neural networks with different manual designs have presented a promising performance in single image super-resolution (SR). However, these designs rely on too much expert experience. To address this issue, we focus on searching a lightweight block for efficient and accurate image SR. Due to the frequent use of various residual blocks and attention mechanisms in SR methods, we propose the residual attention search block (RASB) which combines an operation search block (OSB) with an attention search block (ASB). The former is used to explore the suitable operation at the proper position, and the latter is applied to discover the optimal connection of various attention mechanisms. Moreover, we build the modified residual attention network (MRAN) with stacked found blocks and a refinement module. Extensive experiments demonstrate that our MRAN achieves a better trade-off against the state-of-the-art methods in terms of accuracy and model complexity. © 2021 IEEE

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Combining spectral and textures of digital imagery for wheat aboveground biomass estimation

Combining spectral and textures of digital imagery for wheat...

引用

2022 International Conference on Electronic Information technology, EIT 2022

作者： Zheng, Ling Tao, Jianpeng Bao, Qian Weng, Shizhuang Zhang, Yakun Zhao, Jinling Huang, Linsheng National Engineering Research Venter for Agro-Ecological Big Data Analysis and Application Anhui University Hefei230601 China College of Agricultural Equipment Engineering Henan University of Science and Technology Luoyang471003 China

ISBN: (纸本)9781510655096

The aboveground biomass (AGB) is a key index for predicting wheat yield. In the case of high biomass, the AGB estimation of single spectral feature or image texture is poor. Therefore, this study evaluated the ability of fusion of spectral reflectance and texture to predict wheat AGB. Among them the reflectance spectrum of the wheat canopy was collected by near-earth spectrometer, and the texture features of three bands of RGB were extracted by gray co-occurrence matrix. Partial least squares regression (PLS) model was used to evaluate the relationship between fusion features and AGB. The experimental results based on the validated data set show that the AGB estimation effect of feature fusion is better than that of single feature (R2 = 0.70;RMSE = 0.06). This shows that the combination of spectral reflectance and texture can improve the accuracy of AGB estimation in the later stage. © 2022 SPIE. All rights reserved.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

An Extended-Isomap for high-dimensional data accuracy and efficiency: a comprehensive survey

引用

Multimedia Tools and Applications 2024年第38期83卷 85523-85574页

作者： Yousaf, Mahwish Shakoor Khan, Muhammad Saadat Ullah, Shamsher Institute of Intelligence Machine Hefei Institutes of Physical Science Chinese Academy of Sciences Anhui Hefei230027 China Key Laboratory of Materials Physics Institute of Solid-State Physics Chinese Academy of Sciences Anhui Hefei230027 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Shenzhen518060 China

Manifold learning is a widely adopted nonlinear dimensionality reduction technique employed to discover low-dimensional representations from high-dimensional data and to explore the intrinsic data structure. It encompasses a range of nonlinear techniques, including Isomap, Local Linear Embedding (LLE), Local Tangent Space Alignment (LTSA), and Multidimensional Scaling (MDS), among others. Isomap, as a popular method in manifold learning, has exhibited promising results. However, it encounters several challenges, such as the Topological Stability Problem, Shortest Path Distance, and noise sensitivity, which compromise its accuracy and elevate its computational demands. This survey paper presents three novel existing approaches to address these challenges and enhance the performance of Isomap. Firstly, the FastIsomap method, an existing approach that combines state-of-the-art algorithms like the KD tree and NN-descent to increase graph accuracy while reducing computational cost. Secondly, the FastIsomapVis method, also an existing technique, employs a hierarchical divide-and-conquer strategy employing the KD tree and Dijkstra Buckets Double, which enhances accuracy and reduces computational time in Isomap. Lastly, the NR-Isomap method, another existing approach, used the Local Tangent Space Alignment algorithm to remove noise sensitivity and short-circuit edge problems. The existing methods improve the accuracy of Isomap but also streamline its computational requirements. Furthermore, this survey paper discusses the open issues and future research directions for Isomap and manifold learning methods. It can be a valuable resource for researchers seeking insights across diverse domains. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Algorithms with Heuristic Gradient-based Repair for Constrained Optimization

Evolutionary Algorithms with Heuristic Gradient-based Repair...

引用

2022 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2022

作者： Du, Jiacheng Bu, Chenyang Liu, Yuxin Liu, Fei Luo, Wenjian Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Anhui Hefei230027 China Harbin Institute of Technology School of Computer Science and Technology Guangdong Shenzhen518000 China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Gradient-based repair aims to repair infeasible solutions to feasible ones using the gradient information of the constraints. As an effective constraint handling method, gradientbased repair has received extensive attention and has been applied in various evolutionary algorithms (EAs). Nevertheless, due to the complexity of constraints in practical problems, a single infeasible solution often needs to be repaired multiple times until it becomes a feasible solution or reaches the maximum number of repairs. As far as we know, existing related research on gradient-based repair mainly applies this method directly to EAs, while there is little work in the evolutionary computing community on how to improve gradient-based repair. Currently, the multiple repairs for a single individual are independent. That is, the current repair does not consider the previous repair experience. However, only using gradient information to repair infeasible individuals may result in oscillations in the search process. Therefore, in this paper, we propose a heuristic gradient-based repair method (HGR) which exploits the previous repair information of an individual to alleviate this issue. Experimental results on several benchmarks demonstrate the effectiveness of the proposed method. The source code is available at https://***/DMiC-lab-HFUT/HGR-SMC2022. © 2022 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：