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

2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

作者： Liu, Yang Wu, Jialun Wei, Yuhua Mao, Bing Li, Chen Gong, Tieliang Xi'An Jiaotong University School of Computer Science and Technology National Engineering Lab for Big Data Analytics Shaanxi Xi'an710049 China

ISBN: (纸本)9781665401265

Healthcare Representation learning has been a key element to achieving state-of-the-art performance on healthcare prediction. Recent advances based Electronic Healthcare Records(EHRs) are mostly devoted to extracting temporal progression patterns with temporal model and their variants. Although these works have shown excellent performances in healthcare prediction, the unified temporal pattern may not be suitable for individuals in all healthcare conditions. Moreover, some studies ususally introduce complex Deep Neural Networks models and medical prior knowledge to get compact representation, causing great computational burden. In this paper, we propose a general health care representation model, named AEFNet. We only leverage three simple convolution operations and a set of up and down sampling to ensure performance and model complexity equally, which achieves adaptively extract distinct individual key feature in a light manner. AEFNet can shrink and refine highly suitable scale information adaptively and comletely. Breaking traditional fixed convolution scale or multi-scale, AEFNet achieves scale adaptively to extract the most significant information and context relationship. Finally, We validate our method on the public dataset MIMIC-III, and the evaluation results indicate that our method can significantly outperform other remarkable baseline models. © 2021 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Hierarchical features-based targeted aspect extraction from online reviews

引用

Intelligent data Analysis 2021年第1期25卷 205-223页

作者： He, Jin Li, Lei Wang, Yan Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei Anhui China School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Department of Computing Macquarie University Sydney Australia MiningLamp Academy of Sciences Mininglamp Techonologies Beijing China

With the prevalence of online review websites, large-scale data promote the necessity of focused analysis. This task aims to capture the information that is highly relevant to a specific aspect. However, the broad scope of the aspects of the various products makes this task overarching but challenging. A commonly used solution is to modify the topic models with additional information to capture the features for a specific aspect (referred to as a targeted aspect). However, the existing topic models, either perform the full analysis to capture features as many as possible or estimate the similarity to capture features as coherent as possible, overlook the fine-grained semantic relations between the features, resulting in the captured features coarse and confusing. In this paper, we propose a novel Hierarchical Features-based Topic Model (HFTM) to extract targeted aspects from online reviews, then to capture the aspect-specific features. Specifically, our model can not only capture the direct features posing target-to-feature semantics but also capture the latent features posing feature-to-feature semantics. The experiments conducted on real-world datasets demonstrate that HFTMl outperforms the state-of-the-art baselines in terms of both aspect extraction and document classification. © 2021 - IOS Press. All rights reserved.

关键词： Aspect extraction Focused analysis Online reviews Text mining Topic modeling

来源：评论

学校读者我要写书评

暂无评论

Flow-Guided Deformable Alignment Network with Self-Supervision for Video Inpainting 48

Flow-Guided Deformable Alignment Network with Self-Supervisi...

引用

48th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2023

作者： Wu, Zhiliang Zhang, Kang Sun, Changchang Xuan, Hanyu Yan, Yan Nanjing University of Science and Technology School of Computer Science and Engineering China Illinois Institute of Technology Department of Computer Science United States Anhui University School of Big Data and Statistics China

ISBN: (纸本)9781728163277

Video inpainting aims to utilize plausible contents to fill missing regions in the video. State-of-the-art video inpainting methods typically generate the missing contents of the target frame (current frame) by aggregating the temporal information of reference frames (neighboring frames) aligned using deformable convolution. However, these deformable convolution alignment networks often suffer from offset overflow during training, resulting in unsatisfactory alignment, thereby obtaining compromised inpainting performance. In this paper, we propose a self-supervised Flow-Guided Deformable Alignment (FGDA) network for aligning reference frames at the feature level. FGDA computes the residual of the optical flow as the offsets. This design can effectively reduce the burden of offsets learning, thereby avoiding offset overflow. Furthermore, a gradient-weighted reconstruction loss for supervised completed frame reconstruction is designed, which can use the gradients in all directions of the video frame to emphasize the difficultly reconstructed texture regions, so that detail textures get more attention during training. Experiments show that FGDA-based video inpainting model trained with gradient-weighted reconstruction loss outperforms the state-of-the-art by a significant margin in terms of PSNR and SSIM with relative improvements of 6.2% and 2.1%, respectively. © 2023 IEEE.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

Solution to Satisfiability Problem Based on Molecular Beacon Microfluidic Chip Computing Model 16th

Solution to Satisfiability Problem Based on Molecular Beacon...

引用

16th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2021

作者： Yang, Jing Yin, Zhixiang Tang, Zhen Cui, Jianzhong Liu, Congcong School of Mathematics and Big Data Anhui University of Science and Technology Huainan232001 China School of Mathematics Physics and Statistics Shanghai University of Engineering Science Shanghai201620 China

ISBN: (纸本)9789811912559

The satisfiability problem is a well-known NPC problem in mathematics. In this paper, we report construction of a computational model based on molecular beacon microfluidic chip, to solve the satisfiability problem by using advantages such as;rapid, simple and economical measurement of molecular beacon probe. Taking 3-satisfiability problem as an example, we encode the variable and construct molecular beacon probe by combining the complement of corresponding DNA strands with variable whose clause is 1. They are then fixed on the chip and placed in the microfluidic chip. It takes DNA strands corresponding to all combinations of values as the initial data pool, and utilize the microfluidic chip to detect. If there are DNA strands in the final data pool, it will be sequenced, and we call that this problem can be satisfied. If there are no DNA strands, the problem is not satisfied. The complexity of the model is O(m) + O(n), where m is the number of clauses in conjunctive normal form, and n is the number of variables contained in the conjunctive normal form. This model represents great parallelism, massive storage capacity and high throughput, integration and multi-function of microfluidic chips. © 2022, Springer Nature Singapore Pte Ltd.

关键词： Microfluidic chips

来源：评论

学校读者我要写书评

暂无评论

TIGA: Towards Efficient Near data Processing in SmartNICs-based Disaggregated Memory Systems 24

TIGA: Towards Efficient Near Data Processing in SmartNICs-ba...

引用

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Duan, Zhuohui Yu, Zelin Liu, Haikun Liao, Xiaofei Jin, Hai Zheng, Shijie Wu, Sihan National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9798400706011

Memory disaggregation, facilitated by Smart Network Interface Cards (SmartNICs), has emerged as a cost-effective approach for sharing memory resources in data centers. However, current SoC-based SmartNICs face several challenges for supporting near-data processing (NDP) in disaggregated memory (DM) systems effectively, such as inefficient resource allocation for SmartNICs employed in NDP, and the lack of collaboration between SmartNICs on data nodes and CPUs on compute nodes. To address these issues, we propose TIGA, an efficient NDP framework for SmartNICs-based disaggregated memory systems. We propose an adaptive resource allocator to fully utilize the SoC cores among NDP engines automatically, and a SmartNIC-CPU cooperative computing mechanism to schedule NDP tasks among CPUs and SmartNICs. We prototype TIGA with FPGAs and evaluate it with several typical workloads. Experimental results show that TIGA significantly improves the efficiency of NDP tasks in DM systems compared with state-of-the-art SmartNIC-based co-processing schemes. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Storage allocation (computer)

来源：评论

学校读者我要写书评

暂无评论

Intelligent Fast Cell Association Scheme Based on Deep Q-Learning in Ultra-Dense Cellular Networks

引用

China Communications 2021年第2期18卷 259-270页

作者： Jinhua Pan Lusheng Wang Hai Lin Zhiheng Zha Caihong Kai Key Laboratory of Knowledge Engineering with Big Data Ministry of Education.School of Computer Science and Information EngineeringHefei University of TechnologyHefei 230601China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei 230601China Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education.School of Cyber Science and EngineeringWuhan UniversityWuhan 430072China

To support dramatically increased traffic loads,communication networks become *** cell association(CA)schemes are timeconsuming,forcing researchers to seek fast *** paper proposes a deep Q-learning based scheme,whose main idea is to train a deep neural network(DNN)to calculate the Q values of all the state-action pairs and the cell holding the maximum Q value is *** the training stage,the intelligent agent continuously generates samples through the trial-anderror method to train the DNN until *** the application stage,state vectors of all the users are inputted to the trained DNN to quickly obtain a satisfied CA result of a scenario with the same BS locations and user *** demonstrate that the proposed scheme provides satisfied CA results in a computational time several orders of magnitudes shorter than traditional ***,performance metrics,such as capacity and fairness,can be guaranteed.

关键词： ultra-dense cellular networks(UDCN) cell association(CA) deep Q-learning proportional fairness Q-learning

来源：评论

学校读者我要写书评

暂无评论

Towards Stricter Black-box Integrity Verification of Deep Neural Network Models 24

Towards Stricter Black-box Integrity Verification of Deep Ne...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： He, Chaoxiang Bai, Xiaofan Ma, Xiaojing Zhu, Bin B. Hu, Pingyi Fu, Jiayun Jin, Hai Zhang, Dongmei Huazhong University of Science and Technology Hubei Wuhan China Shanghai Jiao Tong University Shanghai China Microsoft Corporation Beijing China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security School of Cyber Science and Engineering Huazhong University of Science and Technology China 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: (纸本)9798400706868

Cloud-based machine learning services offer significant advantages but also introduce the risk of tampering with cloud-deployed deep neural network (DNN) models. Black-box integrity verification (BIV) allows model owners and end-users to determine if a cloud-deployed DNN model has been tampered with by examining only the top-1 label responses. Fingerprinting generates fingerprint samples to query the model, achieving BIV with no impact on the model's accuracy. In this paper, we present BIVBench, the first comprehensive benchmark for BIV of DNN models. BIVBench covers 16 types of model modifications, providing extensive coverage of practical modification scenarios. Our analysis reveals that existing fingerprinting methods, which are typically focused on significant tampering, lack the sensitivity needed to effectively detect subtle yet common and potentially severe modifications. To address this limitation, we propose MiSentry (Model Integrity Sentry), a novel fingerprinting method that leverages meta-learning. MiSentry strategically incorporates a few subtly modified models into the meta-learning model zoo and maximizes the divergence of output predictions between the target model and the modified models in the model zoo to generate highly sensitive, generalizable, and effective fingerprint samples. Extensive evaluations using BIVBench demonstrate that MiSentry outperforms existing state-of-the-art methods overall and significantly surpasses them in detecting subtle modifications. The BIVBench and supplementary materials are available at: https://***/CGCL-codes/BIVBench. © 2024 ACM.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Research on Leak Location Method of Water Supply Network based on Deep Neural Network Model

Research on Leak Location Method of Water Supply Network bas...

引用

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

作者： 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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：