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

28th International Conference on database Systems for Advanced Applications, DASFAA 2023

作者： Sha, Ying Wu, Mingmin Zeng, Zhi Ge, Xing Huang, Zhongqiang Wang, Huan College of Informatics Huazhong Agricultural University Wuhan China Key Laboratory of Smart Farming for Agricultural Animals Wuhan China Hubei Engineering Technology Research Center of Agricultural Big Data Wuhan China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan China

ISBN: (纸本)9783031306747

Chinese idiom is a distinctive language phenomenon, which usually consists of four Chinese characters and expresses a non-compositional and metaphorical meaning. Therefore, Chinese idioms pose unique challenges for Chinese machine reading comprehension. To address this issue, researchers proposed a Chinese idiom cloze task and a large-scale Chinese idioms dataset ChID. Existing methods have proposed a number of models and achieved reasonable performance on ChID. However, they fall short of fully exploring the precise representations and distinctions of the meanings of idioms, especially idioms with similar meanings. In this paper, we propose a prompt-based representation individual enhancement method (PRIEM). This method fuses the context-specific representation and the generic definition representation of the idioms, and uses the prompt method to guide the model in learning the metaphorical meanings of idioms purposefully. To further improve the distinction representations of idioms with similar meanings, PRIEM adopts a method of idiom representation mapping and decomposing based on orthogonal projection to obtain the common and individual representations of idioms respectively. Experimental results on ChID show that our model outperforms state-of-the-art models. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Automatic recognition of depression based on audio and video:A review

引用

World Journal of Psychiatry 2024年第2期14卷 225-233页

作者： Meng-Meng Han Xing-Yun Li Xin-Yu Yi Yun-Shao Zheng Wei-Li Xia Ya-Fei Liu Qing-Xiang Wang Shandong Mental Health Center Shandong UniversityJinan 250014Shandong ProvinceChina Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center(National Supercomputer Center in Jinan)Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353Shandong ProvinceChina Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and TechnologyQilu University of Technology(Shandong Academy of Sciences)Jinan 250353Shandong ProvinceChina Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan 250353Shandong ProvinceChina Department of Ward Two Shandong Mental Health CenterShandong UniversityJinan 250014Shandong ProvinceChina

Depression is a common mental health *** current depression detection methods,specialized physicians often engage in conversations and physiological examinations based on standardized scales as auxiliary measures for depression ***-biological markers-typically classified as verbal or non-verbal and deemed crucial evaluation criteria for depression-have not been effectively *** physicians usually require extensive training and experience to capture changes in these *** in deep learning technology have provided technical support for capturing non-biological *** researchers have proposed automatic depression estimation(ADE)systems based on sounds and videos to assist physicians in capturing these features and conducting depression *** article summarizes commonly used public datasets and recent research on audio-and video-based ADE based on three perspectives:datasets,deficiencies in existing research,and future development directions.

关键词： Depression recognition Deep learning Automatic depression estimation System Audio processing Image processing Feature fusion Future development

来源：评论

学校读者我要写书评

暂无评论

SPViT: Accelerate Vision Transformer Inference on Mobile Devices via Adaptive Splitting and Offloading

引用

IEEE Transactions on Mobile Computing 2025年

作者： Zhao, Sifan Liu, Tongtong Jin, Hai Yao, Dezhong Huazhong University of Science and Technology 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 Wuhan430074 China

The Vision Transformer (ViT), which benefits from utilizing self-attention mechanisms, has demonstrated superior accuracy compared to CNNs. However, due to the expensive computational costs, deploying and inferring ViTs on resource-constrained mobile devices has become a challenge. To resolve this challenge, we conducted an empirical analysis to identify performance bottlenecks in deploying ViTs on mobile devices and explored viable solutions. In this paper, we propose SPViT, an adaptive split and offloading method that accelerates ViT inference on mobile devices. SPViT executes collaborative inference of ViT across available edge devices. We introduce a fine-grained splitting technique for the vision transformer structure. Furthermore, we propose an algorithm based on the Auto Regression model to predict partition latency and adaptive offload partitions. Finally, we design offline and online optimization methods to minimize the computational and communication overhead on each device. Based on real-world prototype experiments, SPViT effectively reduces inference latency by 2.2x to 3.3x across four state-of-the-art models. © 2002-2012 IEEE.

关键词： Regression analysis

来源：评论

学校读者我要写书评

暂无评论

3DHacker: Spectrum-based Decision Boundary Generation for Hard-label 3D Point Cloud Attack

3DHacker: Spectrum-based Decision Boundary Generation for Ha...

引用

International Conference on Computer Vision (ICCV)

作者： Yunbo Tao Daizong Liu Pan Zhou Yulai Xie Wei Du Wei Hu Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wangxuan Institute of Computer Technology Peking University

With the maturity of depth sensors, the vulnerability of 3D point cloud models has received increasing attention in various applications such as autonomous driving and robot navigation. Previous 3D adversarial attackers either follow the white-box setting to iteratively update the coordinate perturbations based on gradients, or utilize the output model logits to estimate noisy gradients in the black-box setting. However, these attack methods are hard to be deployed in real-world scenarios since realistic 3D applications will not share any model details to users. Therefore, we explore a more challenging yet practical 3D attack setting, i.e., attacking point clouds with black-box hard labels, in which the attacker can only have access to the prediction label of the input. To tackle this setting, we propose a novel 3D attack method, termed 3D Hard-label attacker (3DHacker), based on the developed decision boundary algorithm to generate adversarial samples solely with the knowledge of class labels. Specifically, to construct the class-aware model decision boundary, 3DHacker first randomly fuses two point clouds of different classes in the spectral domain to craft their intermediate sample with high imperceptibility, then projects it onto the decision boundary via binary search. To restrict the final perturbation size, 3DHacker further introduces an iterative optimization strategy to move the intermediate sample along the decision boundary for generating adversarial point clouds with smallest trivial perturbations. Extensive evaluations show that, even in the challenging hard-label setting, 3DHacker still competitively outperforms existing 3D attacks regarding the attack performance as well as adversary quality.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fusion of Natural Language and Knowledge Graph for Multi-hop Reasoning 19th

Fusion of Natural Language and Knowledge Graph for Multi-hop...

引用

19th International Conference on Web Information Systems and Applications, WISA 2022

作者： Lu, Xun Zhao, Feng 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 Wuhan China

ISBN: (纸本)9783031203084

Multi-hop reasoning has been widely studied for its important application values in the domain of intelligent search and question answering. Real-world applications are often dominated by natural language input, and it is difficult to directly model the relation semantics in natural language to fit the multi-hop reasoning model. In addition, the extremely large scale and complex structure of knowledge graphs increase the challenge. We propose a natural language and knowledge graph fusion model (NLKGF) for multi-hop reasoning. NLKGF embeds knowledge graph by fusing natural language semantics during the graph propagation process and adds a relation attention mechanism to enable entity representations to perceive the contribution of different relations. A relation path encoder is designed to encode the relation path by an improved recurrent neural network, the reasoning entity is obtained by calculating the correlation score with the natural language. We tested the performance of the NLKGF model on two datasets requiring multi-hop reasoning. The experimental results show that NLKGF beats advanced benchmark models in multi-hop reasoning tasks, which proves superiority of our model. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Commonsense Knowledge Construction with Concept and Pretrained Model 19th

Commonsense Knowledge Construction with Concept and Pretrain...

引用

19th International Conference on Web Information Systems and Applications, WISA 2022

作者： Cai, Hanjun Zhao, Feng 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 Wuhan China

ISBN: (纸本)9783031203084

Commonsense knowledge (CSK) is the information that people use in daily life but do not often mention. It summarizes the practical knowledge about how the world works. Existing machines have knowledge but lack commonsense because they do not understand and master commonsense knowledge in the same way that humans do. In the latest works, crowdsourcing-based method is costly and has low coverage, knowledge base completion method can highly fit samples, and methods extracted from unstructured data have the defects of low quality. CG &BF is commonsense knowledge construction with a concept-based generator and a BERT-based filter. We utilize semantic search for node matching and entropy encoder for filtering triples with high abstraction. Two algorithms based on concept aggregation and path credibility are proposed to obtain high-quality CSK triples. We subsequently finetuning a BERT to filter incorrect triples. We obtain 500,000 CSK triples based on ConceptNet, which is superior to other construction methods in novelty and quality. In the reading comprehension task, the three-way attention network is selected as the basic model and the knowledge we generate enables the base model to perform better, which proves that the output of CG &BF has higher quality and ease of use. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

RGraph: Asynchronous graph processing based on asymmetry of remote direct memory access

RGraph: Asynchronous graph processing based on asymmetry of ...

引用

作者： Chen, Hanhua Yuan, Jie Jin, Hai Wang, Yonghui Wu, Sijie Jiang, Zhihao National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

The scale of real-world graphs is constantly growing. To deal with large-scale graphs, distributed graph processing has attracted much research efforts. Existing distributed graph processing systems are commonly built on traditional TCP/IP communication stack, which leads to network bottleneck because of low bandwidth and heavy kernel stack operations. Meanwhile, in real power-law graphs, the average number of mirror vertices after graph partitioning is very large, resulting in significant communication overhead among nodes. The emerging high-performance Remote Direct Memory Access (RDMA) network has the features of low latency, high bandwidth, and low CPU overhead, which brings new opportunities for distributed graph processing systems. Existing RDMA-assisted graph processing systems focus on synchronous execution, which imposes barriers between consecutive iterations. Synchronous execution transfers bulk data among nodes and thus only needs a small number of network transfers. However, synchronous execution is usually less efficient than asynchronous execution because of bulk synchronization. Asynchronous execution accelerates graph processing by eliminating barriers, which in turn requires to transfer a large amount of small size data. In this paper, we propose RGraph, an RDMA-assisted asynchronous distributed graph processing system. RGraph distributes edges into two parts to isolate master and mirror vertices. RGraph exploits the asymmetry of RDMA to accelerate the one-to-many communication between master and mirror vertices. We implement RGraph on top of PowerGraph and conduct comprehensive experiments with large-scale real graphs to evaluate its performance. Results show that compared to existing designs, RGraph reduces the execution time by up to 81%. © 2021 John Wiley & Sons Ltd.

关键词： Mirrors

来源：评论

学校读者我要写书评

暂无评论

Semantic Reasoning technology on Temporal Knowledge Graph 19th

Semantic Reasoning Technology on Temporal Knowledge Graph

引用

19th International Conference on Web Information Systems and Applications, WISA 2022

作者： Li, Jianuo Zhao, Feng 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 Wuhan China

ISBN: (纸本)9783031203084

Semantic reasoning techniques based on knowledge graphs have been widely studied since they were proposed. Previous studies are mostly based on closed-world assumptions, which cannot reason about unknown facts. To this end, we propose the Two-Stage Temporal Reasoning Model (TSTR) for reasoning about future facts. In the first stage, probability of future facts occurring is reasoned using repeated information in history. In the second stage, the semantics of the neighborhood nodes are aggregated using the structural encoder and the temporal information is captured using the temporal encoder. The predicted probabilities are obtained by the decoder. Finally, the candidate entity probabilities of the two-stage reasoning are weighted to achieve the prediction of the two-stage fusion. We tested the performance of the TSTR on public datasets and the results demonstrated the effectiveness of the TSTR. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

Tensor Graph Convolutional Network for Dynamic Graph Representation Learning 7

Tensor Graph Convolutional Network for Dynamic Graph Represe...

引用

7th International Symposium on Autonomous Systems, ISAS 2024

作者： Wang, Ling Yuan, Ye The School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China The Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Engineering Research Center of Big Data Application For Smart Cities Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China College of Computer and Information Science Southwest University Chongqing400715 China

ISBN: (纸本)9798350363173

Dynamic graphs (DG) represent evolving interactions between entities in various real-world scenarios. Many existing DG representation learning models employ a combination of graph convolutional networks and sequence neural networks to capture spatial-temporal dependencies. However, this hybrid approach often fails to effectively capture the spatial-temporal continuity inherent in DGs. In this paper, we propose a novel approach called the Tensor Graph Convolutional Network (TGCN) to learn DG representations within a unified convolution framework based on tensor products. Our approach is founded on two key principles: (a) representing DG information in tensor form, and (b) leveraging tensor product operations to design a graph convolutional network that simultaneously models spatial and temporal features. Experimental results on three real-world DG datasets demonstrate that our proposed model achieves state-of-the-art performance. © 2024 IEEE.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

GA-Net: Gated Attention Mechanism Based Global Refinement Network for Image Inpainting 29

GA-Net: Gated Attention Mechanism Based Global Refinement Ne...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Qiu, Ran Zhao, Shengrong Liang, Hu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350330717

Underwater images are often affected by problems such as light attenuation, color distortion, noise and scattering, resulting in image defects. A novel image inpainting method is proposed to intelligently predict and fill damaged areas for complete and continuous visualization of the image. First, in order to effectively solve the problem of color distortion caused by light refraction in underwater environments, the improved gated attention mechanism is used. This mechanism improves the local details by learning and weighting the important features of the image. Second, gated convolution automatically determines the degree of restoration for each pixel based on local features of the original image. It eliminates distractions such as low contrast and scattering, retaining more original detailed information. By doing so, image inpainting techniques improve the quality and visualization of underwater images. © 2023 IEEE.

关键词： Gated convolution Image inpainting Underwater images

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：