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

arXiv 2023年

作者： Ji, Qiu Zhang, Xiaoping Ye, Yuxin Qi, Guilin Li, Jiaye Li, Site Ren, Jianjie Lu, Songtao School of Modern Posts Institute of Modern Posts Nanjing University of Posts and Telecommunications Nanjing China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China National Data Center ofTraditional Chinese MedicineChina Academy of ChineseMedical Sciences Beijing100700 China College of Computer Science and Technology Jilin University Changchun130012 China School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing China School of Mathematics Southeast University Nanjing China Chien-Shiung Wu College Southeast University Nanjing China

Ontology revision aims to seamlessly incorporate a new ontology into an existing ontology and plays a crucial role in tasks such as ontology evolution, ontology maintenance, and ontology alignment. Similar to repair single ontologies, resolving logical incoherence in the task of ontology revision is also important and meaningful, because incoherence is a main potential factor to cause inconsistency and reasoning with an inconsistent ontology will obtain meaningless answers. To deal with this problem, various ontology revision approaches have been proposed to define revision operators and design ranking strategies for axioms in an ontology. However, they rarely consider axiom semantics which provides important information to differentiate axioms. In addition, pre-trained models can be utilized to encode axiom semantics, and have been widely applied in many natural language processing tasks and ontology-related ones in recent years. Therefore, in this paper, we study how to apply pre-trained models to revise ontologies. We first define four scoring functions to rank axioms based on a pre-trained model by considering various information from an ontology. Based on the functions, an ontology revision algorithm is then proposed to deal with unsatisfiable concepts at once. To improve efficiency, an adapted revision algorithm is designed to deal with unsatisfiable concepts group by group. We conduct experiments over 19 ontology pairs and compare our algorithms and scoring functions with existing ones. According to the experiments, our algorithms could achieve promising performance. The adapted revision algorithm could improve the efficiency largely, and at most about 90% of the time could be saved for some ontology pairs. Some of our scoring functions like reliableOnt cos could help a revision algorithm obtain better results in many cases, especially for those challenging ontology pairs like OM8. We also provide discussion about the overall experimental results and guidelin

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Sledge: Towards Efficient Live Migration of Docker Containers

Sledge: Towards Efficient Live Migration of Docker Container...

引用

IEEE International Conference on Cloud Computing, CLOUD

作者： Bo Xu Song Wu Jiang Xiao Hai Jin Yingxi Zhang Guoqiang Shi Tingyu Lin Jia Rao Li Yi Jizhong Jiang 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 State Key Laboratory of Intelligent Manufacturing System Technology Beijing China The University of Texas at Arlington Arlington TX USA Alibaba Cloud Computing Co. Ltd. Hangzhou China

ISBN: (数字)9781728187808

ISBN: (纸本)9781728187815

Modern large-scale cloud platforms require live migration technique on Docker containers with stateful workload to support load balancing, host maintenance, and Quality of Service (QoS) improvement. Efficient and scalable Docker live migration is expected to guarantee the component-integrity (image, runtime, and management context) with negligible downtime. In this paper, we present a highly efficient live migration system called Sledge, which ensures the component-integrity by integrating both images and management context during runtime migration. The key insight is that the layered image can be leveraged to reduce the migration overhead, and appropriately selective migration of management context will effectively improve QoS with negligible downtime. To achieve good scalability, a lightweight container registry mechanism for end-to-end image migration is designed to avoid the redundant layers transmission. In addition, a dynamic context loading scheme is proposed to precisely load the management context into the running daemon, which can significantly reduce downtime. Experiments show that, compared with the state-of-the-art, Sledge reduces 57% of total migration time, 55% of image migration time, and 70% downtime.

关键词： Cloud computing Runtime Scalability Loading Quality of service Containers Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

Poisoning attack against estimating from pairwise comparisons

arXiv

引用

arXiv 2021年

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Cao, Xiaochun Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen518055 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer and Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China The School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Big Data Mining and Knowledge Management The School of Economics and Management University of Chinese Academy of Sciences Beijing100049 China

As pairwise ranking becomes broadly employed for elections, sports competitions, recommendation, information retrieval and so on, attackers have strong motivation and incentives to manipulate or disrupt the ranking list. They could inject malicious comparisons into the training data to fool the target ranking algorithm. Such a technique is called "poisoning attack" in regression and classification tasks. In this paper, to the best of our knowledge, we initiate the first systematic investigation of data poisoning attack on the pairwise ranking algorithms, which can be generally formalized as the dynamic and static games between the ranker and the attacker, and can be modeled as certain kinds of integer programming problems mathematically. To break the computational hurdle of the underlying integer programming problems, we reformulate them into the distributionally robust optimization (DRO) problems, which are computational tractable. Based on such DRO formulations, we propose two efficient poisoning attack algorithms and establish the associated theoretical guarantees including the existence of Nash equilibrium and the generalization ability bounds. The effectiveness of the suggested poisoning attack strategies is demonstrated by a series of toy simulations and several real data experiments. These experimental results show that the proposed methods can significantly reduce the performance of the ranker in the sense that the correlation between the true ranking list and the aggregated results with toxic data can be decreased dramatically. © 2021, CC BY-NC-ND.

关键词： Toys

来源：评论

学校读者我要写书评

暂无评论

s-LWSR: Super lightweight super-resolution network

arXiv

引用

arXiv 2019年

作者： Li, Biao Liu, Jiabin Wang, Bo Qi, Zhiquan Shi, Yong School of Economics and Management University of Chinese Academy of Sciences Beijing101408 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China School of Information Technology and Management University of International Business and Economics Beijing100029 China Department of Computer Science and Engineering Texas A&M University College StationTX77843 United States College of Information Science and Technology University of Nebraska OmahaNE68182 United States

Deep learning (DL) architectures for super-resolution (SR) normally contain tremendous parameters, which has been regarded as the crucial advantage for obtaining satisfying performance. However, with the widespread use of mobile phones for taking and retouching photos, this character greatly hampers the deployment of DL-SR models on the mobile devices. To address this problem, in this paper, we propose a super lightweight SR network: s-LWSR. There are mainly three contributions in our work. Firstly, in order to efficiently abstract features from the low resolution image, we build an information pool to mix multi-level information from the first half part of the pipeline. Accordingly, the information pool feeds the second half part with the combination of hierarchical features from the previous layers. Secondly, we employ a compression module to further decrease the size of parameters. Intensive analysis confirms its capacity of trade-off between model complexity and accuracy. Thirdly, by revealing the specific role of activation in deep models, we remove several activation layers in our SR model to retain more information for performance improvement. Extensive experiments show that our s-LWSR, with limited parameters and operations, can achieve similar performance to other cumbersome DL-SR methods. Copyright © 2019, The Authors. All rights reserved.

关键词： Chemical activation

来源：评论

学校读者我要写书评

暂无评论

Examining scientific writing styles from the perspective of linguistic complexity

arXiv

引用

arXiv 2018年

作者： Lu, Chao Bu, Yi Wang, Jie Ding, Ying Torvik, Vetle Schnaars, Matthew Zhang, Chengzhi School of Economics and Management Nanjing University of Science and Technology Nanjing Jiangsu China School of Informatics Computing and Engineering Indiana University BloomingtonIN United States Center for Complex Networks and Systems Research School of Informatics Computing and Engineering Indiana University BloomingtonIN United States School of Information Management Nanjing University Nanjing Jiangsu China School of Information Management Wuhan University Wuhan Hubei China School of Information Sciences University of Illinois UrbanaIL United States Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing University Nanjing Jiangsu China

Publishing articles in high-impact English journals is difficult for scholars around the world, especially for non-native English-speaking scholars (NNESs), most of whom struggle with proficiency in English. In order to uncover the differences in English scientific writing between native English-speaking scholars (NESs) and NNESs, we collected a large-scale data set containing more than 150,000 full-text articles published in PLoS between 2006 and 2015. We divided these articles into three groups according to the ethnic backgrounds of the first and corresponding authors, obtained by Ethnea, and examined the scientific writing styles in English from a two-fold perspective of linguistic complexity: (1) syntactic complexity, including measurements of sentence length and sentence complexity;and (2) lexical complexity, including measurements of lexical diversity, lexical density, and lexical sophistication. The observations suggest marginal differences between groups in syntactical and lexical complexity. Copyright © 2018, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Size-invariance matters: rethinking metrics and losses for imbalanced multi-object salient object detection 24

Size-invariance matters: rethinking metrics and losses for i...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Feiran Li Qianqian Xu Shilong Bao Zhiyong Yang Runmin Cong Xiaochun Cao Qingming Huang Institute of Information Engineering Chinese Academy of Sciences Beijing China and School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China and School of Control Science and Engineering Shandong University Jinan China and Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Shenzhen Campus Sun Yat-sen University School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China and Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Practical Interference Exploitation Precoding without Symbol-by-Symbol Optimization: A Block-Level Approach

arXiv

引用

arXiv 2022年

作者： Li, Ang Shen, Chao Liao, Xuewen Masouros, Christos Lee Swindlehurst, A. The School of Information and Communications Engineering Faculty of Electronic and Information Engineering Xi'an Jiaotong University Shaanxi Xi'An710049 China The State Key Laboratory of Integrated Services Networks Xidian University Shaanxi Xi'An China The Shenzhen Research Institute of Big Data Shenzhen518172 China The Department of Electronic and Electrical Engineering University College London Torrington Place LondonWC1E 7JE United Kingdom The Center for Pervasive Communications and Computing Henry Samueli School of Engineering University of California IrvineCA92697 United States

In this paper, we propose a constructive interference (CI)-based block-level precoding (CI-BLP) approach for the downlink of a multi-user multiple-input single-output (MU-MISO) communication system. Contrary to existing CI precoding approaches which have to be designed on a symbol-by-symbol level, here a constant precoding matrix is applied to a block of symbol slots within a channel coherence interval, thus significantly reducing the computational costs over traditional CI-based symbol-level precoding (CI-SLP) as the CI-BLP optimization problem only needs to be solved once per block. For both PSK and QAM modulation, we formulate an optimization problem to maximize the minimum CI effect over the block subject to a block- rather than symbol-level power budget. We mathematically derive the optimal precoding matrix for CI-BLP as a function of the Lagrange multipliers in closed form. By formulating the dual problem, the original CI-BLP optimization problem is further shown to be equivalent to a quadratic programming (QP) optimization. Numerical results validate our derivations, and show that the proposed CI-BLP scheme achieves improved performance over the traditional CI-SLP method, thanks to the relaxed power constraint over the considered block of symbol slots. Copyright © 2022, The Authors. All rights reserved.

关键词： Lagrange multipliers

来源：评论

学校读者我要写书评

暂无评论

Order-preserving pattern mining with forgetting mechanism

arXiv

引用

arXiv 2024年

作者： Li, Yan Ma, Chenyu Gao, Rong Wu, Youxi Li, Jinyan Wang, Wenjian Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300400 China School of Artificial Intelligence Hebei University of Technology Tianjin300400 China School of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen518055 China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China School of Computer and Information Technology Shanxi University Taiyuan237016 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Order-preserving pattern (OPP) mining is a type of sequential pattern mining method in which a group of ranks of time series is used to represent an OPP. This approach can discover frequent trends in time series. Existing OPP mining algorithms consider data points at different time to be equally important;however, newer data usually have a more significant impact, while older data have a weaker impact. We therefore introduce the forgetting mechanism into OPP mining to reduce the importance of older data. This paper explores the mining of OPPs with forgetting mechanism (OPF) and proposes an algorithm called OPF-Miner that can discover frequent OPFs. OPF-Miner performs two tasks, candidate pattern generation and support calculation. In candidate pattern generation, OPF-Miner employs a maximal support priority strategy and a group pattern fusion strategy to avoid redundant pattern fusions. For support calculation, we propose an algorithm called support calculation with forgetting mechanism, which uses prefix and suffix pattern pruning strategies to avoid redundant support calculations. The experiments are conducted on nine datasets and 12 alternative algorithms. The results verify that OPF-Miner is superior to other competitive algorithms. More importantly, OPF-Miner yields good clustering performance for time series, since the forgetting mechanism is employed. Copyright © 2024, The Authors. All rights reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

MAINet: Modality-Aware Interaction Network for Medical Image Fusion

引用

ACM Transactions on Multimedia Computing, Communications, and Applications 1000年

作者： Lisi Wei Libo Zhao Xiaoli Zhang College of Computer Science and Technology Jilin University China College of Artificial Intelligence and Big Data Hulunbuir University China and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China College of Computer Science and Technology Jilin University China and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China

Due to the limitations of imaging sensors, obtaining a medical image that simultaneously captures both functional metabolic data and structural tissue details remains a significant challenge in clinical diagnosis. To address this, Multimodal Medical Image Fusion (MMIF) has emerged as an effective technique for integrating complementary information from multimodal source images, such as CT, PET, and SPECT, which is critical for providing a comprehensive understanding of both anatomical and functional aspects of the human body. One of the key challenges in MMIF is how to exchange and aggregate this multimodal information. This paper rethinks MMIF by addressing the harmony of modality gaps and proposes a novel Modality-Aware Interaction Network (MAINet), which leverages cross-modal feature interaction and progressively fuses multiple features in graph space. Specifically, we introduce two key modules: the Cascade Modality Interaction (CMI) module and the Dual-Graph Learning (DGL) module. The CMI module, integrated within a multi-scale encoder with triple branches, facilitates complementary multimodal feature learning and provides beneficial feedback to enhance discriminative feature learning across modalities. In the decoding process, the DGL module aggregates hierarchical features in two distinct graph spaces, enabling global feature interactions. Moreover, the DGL module incorporates a bottom-up guidance mechanism, where deeper semantic features guide the learning of shallower detail features, thus improving the fusion process by enhancing both scale diversity and modality awareness for visual fidelity results. Experimental results on medical image datasets demonstrate the superiority of the proposed method over existing fusion approaches in both subjective and objective evaluations. We also validated the performance of the proposed method in applications such as infrared-visible image fusion and medical image segmentation.

关键词： Multimodal fusion Medical image fusion Cascade modality interaction Modality-awareness Graph convolutional network

来源：评论

学校读者我要写书评

暂无评论

Culture versus Policy: More Global Collaboration to Effectively Combat COVID-19

引用

The Innovation 2020年第2期1卷 15-16页

作者： Jianping Li Kun Guo Enrique Herrera Viedma Heesoek Lee Jiming Liu Ning Zhong Luiz Flavio Autran Monteiro Gomes Florin Gheorghe Filip Shu-Cherng Fang Mujgan SagirÖzdemir Xiaohui Liu Guoqing Lu Yong Shi School of Economics and Management University of Chinese Academy of SciencesBeijing 100190China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of SciencesBeijing 100190China Research Center on Fictitious Economy&Data Science Chinese Academy of SciencesBeijing 100190China Department of Computer Science and Artificial Intelligence E.T.S.de Ingenieria Informatica y de TelecomunicacionesUniversity of Granada18071 GranadaSpain Department of Information Management Korea Advanced Institute of Science and TechnologySeoul 207-43 Korea Department of Computer Science and HKBU-CSD&NIPD Joint Research Laboratory for Intelligent Disease Surveillance and Control Hong Kong Baptist UniversityHong KongChina Department of Life Science and Informatics Maebashi Institute of TechnologyMaebashi 371-0816Japan Ibmec University Center Av.Presidente Wilson118Office#111020030-020 Rio de JaneiroBrazil The Romanian Academy Bucharest010071Romania Industrial and Systems Engineering Department North Carolina State UniversityRaleighNC 27695USA Department of Industrial Engineering Eskisehir Osmangazi University26480 EskisehirTurkey Department of Computer Science Brunel University LondonLondonUB83PHUK Department of Biology and School of Interdisciplinary Informatics University of Nebraska at OmahaOmahaNE 68182USA College of Information Science and Technology University of Nebraska at OmahaOmahaNE 68182USA

The outbreak of COVID-19 seriously challenges every government with regard to capacity and management of public health systems facing the catastrophic *** and anti-epidemic policy do not necessarily conflict with each *** countries and governments should be more tolerant to each other in seeking cultural and political consensus to overcome this historically tragic pandemic together.

关键词： seeking overcome policy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：