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

A better constant approximation for minimum 3-connected m-dominating set problem in unit disk graph using Tutte decomposition

学校读者我要写书评

暂无评论

A better constant approximation for minimum 3-connected m-do...

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Wei Wang Bei Liu Donghyun Kim Deying Li Jingyi Wang Yaolin Jiang School of Mathematics and Statistics Xi'an Jiaotong University Xi'an China Department of Mathematics and Physics North Carolina Central University Durham USA Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University) Renmin University of China Beijing P.R. China

Over years, virtual backbone has attracted lots of attentions as a promising approach to deal with the broadcasting storm problem in wireless networks. One popular way to construct a quality virtual backbone is to solve the minimum connected dominating set problem. However, a virtual backbone computed in this way is not resilient against topology change since the induced graph by the connected dominating set is one-vertex-connected. As a result, the minimum k-connected m-dominating set problem is introduced to construct a fault-tolerant virtual backbone. Currently, the best known approximation algorithm for the problem in unit disk graph assumes k ≤ 3 and m ≥ 1 and its performance ratio is 280 when k = m = 3. In this paper, we use a classical result from graph theory, Tutte decomposition, to design a new approximation algorithm for the problem in unit disk graph for k ≤ 3 and m ≥ 3. In particular, the algorithm features with much simpler structure and much smaller performance ratio, e.g. nearly 66 when k = m = 3. We also conduct simulation to evaluate the performance of our algorithm.

关键词： Particle separators Approximation algorithms Algorithm design and analysis Approximation methods Wireless networks Conferences Computers

Generative Aspect Based Sentiment Analysis for Online Health Community with data Augmentation

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Han, Pu Ye, Dongyu Gu, Liang Chen, Wenqi Wei, Hongchen Li, Xiaoyan School of Management Nanjing University of Posts & Telecommunications Nanjing210003 China Jiangsu Provincial Key Laboratory of Data Engineering and Knowledge Service Nanjing210023 China School of Basic Medical Sciences Nanjing Medical University Nanjing210029 China

Accurate analysis of patients' feedback on various medical aspects is of great importance for improving the quality of healthcare services. In this paper, we address the task of extracting aspects and opinions by adopting a generative end-to-end deep learning model. And we address the challenge of limited high-quality labeled data in aspect-based sentiment analysis by introducing a data augmentation method. To evaluate the effectiveness of our proposed generative model and data augmentation technique in the healthcare domain, we collected reviews related to diagnosis and treatment from online health communities(OHC) and verified the effectiveness of the proposed model. The experimental results demonstrate the superiority of generative models in complex aspect-based sentiment analysis tasks, showing a noteworthy nearly 13% increase in F1 score. Furthermore, we find that our data augmentation method is effective in enhancing the experimental outcomes. Our work contributes to the advancement of natural language processing techniques in the healthcare domain, and it has the potential to improve the quality of healthcare services through more fine-grained analysis of patients' feedback. Our code and dataset are available at https://***/woloc/OHC_*** now. © 2023, The Authors. All rights reserved.

关键词： Sentiment analysis

XTQA: Span-Level Explanations for Textbook Question Answering

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Ma, Jie Chai, Qi Liu, Jun Yin, Qingyu Wang, Pinghui Zheng, Qinghua Ministry of Education of Key Lab for Intelligent Networks and Network Security School of Cyber Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering The School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China Amazon United States

Textbook Question Answering (TQA) is the task of correctly answering diagram or non-diagram questions given large multi-modal contexts consisting of abundant essays and diagrams. In real-world scenarios, an explainable TQA system plays a key role in deepening humans’ understanding of learned knowledge. However, there is no work to investigate how to provide explanations currently. To address this issue, we devise a novel architecture towards span-level eXplanations for TQA (XTQA). In this paper, spans are the combinations of sentences within a paragraph. The key idea is to consider the entire textual context of a lesson as candidate evidence, and then use our proposed coarse-to-fine grained Explanation Extracting (EE) algorithm to narrow down the evidence scope and extract the span-level explanations with varying lengths for answering different questions. The EE algorithm can also be integrated into other TQA methods to make them explainable and improve the TQA performance. Experimental results show that XTQA obtains the best overall explanation result (mIoU) of 52.38% on the first 300 questions of CK12-QA test splits, demonstrating the explainability of our method (non-diagram: 150 and diagram: 150). The results also show that XTQA achieves the best TQA performance of 36.46% and 36.95% on the aforementioned splits respectively. We have released our code in https://***/dr-majie/*** Codes 68T07 Copyright © 2020, The Authors. All rights reserved.

关键词： Textbooks

MDPL-net: Multi-layer Dictionary Learning Network with Added Skip Dense Connections

学校读者我要写书评

暂无评论

MDPL-net: Multi-layer Dictionary Learning Network with Added...

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Yulin Sun Zheng Zhang Yang Wang Lin Wu Meng Wang School of Computer Science and Technology Soochow University Suzhou China Ministry of Education Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Hefei University of Technology Hefei China Bio-Computing Research Center Harbin Institute of Technology (Shenzhen) Shenzhen China

ISBN: (数字)9781728183169

ISBN: (纸本)9781728183176

Dictionary learning (DL) is powerful for representation learning, while it fails to capture the deep hierarchical information hidden in data. In this paper, we propose a new generalized end-to-end mulita-layer representation learning architecture referred to as Multi-layer Dictionary Pair Learning Network (MDPL-net) for the deep sparse and hierarchical representation of images. To enable MDPL-net to conduct accurate classification, MDPL-net clearly integrates the skip connection end-to-end network and multi-layer deep sparse dictionary learning into a unified architecture. The representation learning module has several hidden DL blocks, where each hidden DL block has a dictionary pair learning (DPL) layer, a batch-norm layer and an activation function layer, and the DL blocks are connected in a feed-forward manner. To further improve the information flow and maintain the privileged features between different DL blocks, a novel skip dense connectivity pattern is deployed between hidden DL blocks, which can obtain more stable and discriminative features. The DPL layer jointly formulates the discriminative synthesis dictionary and analysis dictionary by minimizing reconstruction error within each batch over the feature maps from front layers. Extensive results on benchmark databases demonstrate the effectiveness of MDPL-net for discriminative representation and robust image classification.

关键词： Dictionaries databases Conferences Machine learning data mining Image reconstruction Image classification

The K-Step H Indices in Citation Networks at the Paper, Author, and Institution Levels

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Yang, Alex Jie Wu, Linwei Zhang, Qi Wang, Hao Deng, Sanhong School of Information Management Nanjing University 22 Hankou Rd. Nanjing210093 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing University Nanjing210093 China International Joint Informatics Laboratory Nanjing University China

From the viewpoint of high-generation citation networks, h indices can be extended to global metrics at both basic and aggregated levels. To accomplish this, three types of networks are designed: the paper-paper network, the author-paper-paper network, and the institution-paper-paper network. The k-step h index is then proposed at the level of papers, authors, and institutions, respectively. Through a comprehensive empirical study based on the APS dataset, it is found that the k-step h index extends the depth and dimensionality of the Hirsh core, allowing for more global information. The consistency and convergent validity of the k-step h indices are quantitatively assessed. The results indicate that the k-step h index demonstrates a high degree of consistency and focuses on the potential for further research, and is capable of measuring the long-term reputation rather than short-term popularity. The convergent validity of the k-step h indices is rigorously tested using benchmark examples such as Nobel laureates and their publications, and they demonstrate superior performance in identifying seminal papers and prominent scientists compared to traditional metrics at the paper and author levels. The k-step h index also excels in ranking institutions, offering a promising new approach for evaluating the impact and influence of scientific entities at both the basic and aggregate levels. This opens up exciting avenues for future research. © 2023, The Authors. All rights reserved.

关键词： Benchmarking

GPTR: Gestalt-Perception Transformer for Diagram Object Detection

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Hu, Xin Zhang, Lingling Liu, Jun Fan, Jinfu You, Yang Wu, Yaqiang Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi’an Jiaotong University China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University China Department of Control Science and Engineering Tongji University Shanghai China Department of Computer Science National University of Singapore Singapore Lenovo Research Beijing China

Diagram object detection is the key basis of practical applications such as textbook question answering. Because the diagram mainly consists of simple lines and color blocks, its visual features are sparser than those of natural images. In addition, diagrams usually express diverse knowledge, in which there are many low-frequency object categories in diagrams. These lead to the fact that traditional data-driven detection model is not suitable for diagrams. In this work, we propose a gestalt-perception transformer model for diagram object detection, which is based on an encoder-decoder architecture. Gestalt perception contains a series of laws to explain human perception, that the human visual system tends to perceive patches in an image that are similar, close or connected without abrupt directional changes as a perceptual whole object. Inspired by these thoughts, we build a gestalt-perception graph in transformer encoder, which is composed of diagram patches as nodes and the relationships between patches as edges. This graph aims to group these patches into objects via laws of similarity, proximity, and smoothness implied in these edges, so that the meaningful objects can be effectively detected. The experimental results demonstrate that the proposed GPTR achieves the best results in the diagram object detection task. Our model also obtains comparable results over the competitors in natural image object detection. Copyright © 2022, The Authors. All rights reserved.

关键词： Object detection

Learning from Semi-Factuals: A Debiased and Semantic-Aware Framework for Generalized Relation Discovery

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Jiaxin Zhang, Lingling Liu, Jun Guo, Tianlin Wu, Wenjun The School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China The Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Shaanxi Xi’an710049 China

We introduce a novel task, called Generalized Relation Discovery (GRD), for open-world relation extraction. GRD aims to identify unlabeled instances in existing pre-defined relations or discover novel relations by assigning instances to clusters as well as providing specific meanings for these clusters. The key challenges of GRD are how to mitigate the serious model biases caused by labeled pre-defined relations to learn effective relational representations and how to determine the specific semantics of novel relations during classifying or clustering unlabeled instances. We then propose a novel framework, SFGRD, for this task to solve the above issues by learning from semi-factuals in two stages. The first stage is semi-factual generation implemented by a tri-view debiased relation representation module, in which we take each original sentence as the main view and design two debiased views to generate semi-factual examples for this sentence. The second stage is semi-factual thinking executed by a dual-space tri-view collaborative relation learning module, where we design a cluster-semantic space and a class-index space to learn relational semantics and relation label indices, respectively. In addition, we devise alignment and selection strategies to integrate two spaces and establish a self-supervised learning loop for unlabeled data by doing semi-factual thinking across three views. Extensive experimental results show that SFGRD surpasses state-of-the-art models in terms of accuracy by 2.36% ∼5.78% and cosine similarity by 32.19%∼ 84.45% for relation label index and relation semantic quality, respectively. To the best of our knowledge, we are the first to exploit the efficacy of semi-factuals in relation extraction. Copyright © 2024, The Authors. All rights reserved.

关键词： Extraction

Reconfigurable Digital Twin from the Perspective of Smart Manufacturing Systems in Industry 4.0/5.0

学校读者我要写书评

暂无评论

Reconfigurable Digital Twin from the Perspective of Smart Ma...

2024 International Conference on Intelligent Systems and Robotics, CISR 2024

作者： Mo, Guangyu Sun, Yuan Huang, Sihan Gao, Feng Huang, Jintang Lai, Lijuan Wang, Guoxin Yan, Yan School of Mechanical Engineering Beijing Institute of Technology Beijing100081 China Beijing Aerospace Times Optical-Electronic Technology Co. Ltd. Beijing100094 China Key Laboratory of Industry Knowledge & Data Fusion Technology and Application Ministry of Industry and Information Technology Beijing Institute of Technology Beijing100081 China China Academy of Aerospace Electronic Technology Beijing100094 China School of Industrial Automation Beijing Institute of Technology Zhuhai519088 China

In industry 4.0/5.0, Smart manufacturing systems are typically complex systems that can be adjusted to deal with demand fluctuation through reconfigurable software/hardware. The emergence of digital twin as enabler technology can promote the operation efficiency of smart manufacturing systems. However, the modelling processes of digital twin of smart manufacturing systems is inefficient due to their complicated structures in general. Besides, the frequent reconfiguration of smart manufacturing systems and the differentiation among smart manufacturing systems will increase the burden of digital twin modelling. Therefore, a reconfigurable modelling method for digital twin of smart manufacturing systems is proposed in this paper. First, a reconfigurable modelling framework based on open architecture is proposed to provide basic model scenario for digital twin of smart manufacturing systems. Second, the reconfiguration of digital twin is elaborated from three dimensions, including reconfigurable virtual model, reconfigurable mapping, and reconfigurable scene. Finally, a case study is given to demonstrate the effectiveness of the proposed method. © Published under licence by IOP Publishing Ltd.

关键词： Smart manufacturing

Adaptive Loose Optimization for Robust Question Answering

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Ma, Jie Wang, Pinghui Wang, Zewei Kong, Dechen Hu, Min Han, Ting Liu, Jun The Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Cyber Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Automation Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The China Mobile Research Institute China The Shannxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China

Question answering methods are well-known for leveraging data bias, such as the language prior in visual question answering and the position bias in machine reading comprehension (extractive question answering). Current debiasing methods often come at the cost of significant in-distribution performance to achieve favorable out-of-distribution generalization ability, while non-debiasing methods sacrifice a considerable amount of out-of-distribution performance in order to obtain high in-distribution performance. Therefore, it is challenging for them to deal with the complicated changing real-world situations. In this paper, we propose a simple yet effective novel loss function with adaptive loose optimization, which seeks to make the best of both worlds for question answering. Our main technical contribution is to reduce the loss adaptively according to the ratio between the previous and the current optimization state on mini-batch training data. This loose optimization can be used to prevent non-debiasing methods from overlearning data bias while enabling debiasing methods to maintain slight bias learning. Experiments on the visual question answering datasets, including VQA v2, VQA-CP v1, VQA-CP v2, GQA-OOD, and the extractive question answering dataset SQuAD demonstrate that our approach enables QA methods to obtain state-of-the-art in- and out-of-distribution performance in most cases. The source code has been released publicly in https://***/reml-group/ALO. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning