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

SSRN 2022年

作者： Xiao, Jiuhong Cai, Yishuai Wang, Wanru Chen, Yong College of Economic and Social Development Nankai University Tianjin300072 China Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China School of Information Management and Artificial Intelligence Zhejiang University of Finance and Economics Hangzhou310018 China College of Civil Engineering and Architecture Zhejiang University Hangzhou310058 China

Cloud manufacturing is an emerging manufacturing paradigm, which enables the simultaneous processing of multiple manufacturing tasks submitted by customers through centralized management and planning of manufacturing services offered by distributed enterprises. To date, various meta-heuristics algorithms such as ant colony optimization algorithm, and genetic algorithm have been widely employed to solve the cloud manufacturing multi-task scheduling (CMMS) problem to improve the efficiency of multi-task scheduling. However, these algorithms need sophisticated design procedures and laborious parameter tuning, making their adaptation to dynamic, large-scale manufacturing environments difficult. Deep reinforcement learning (DRL), because of its efficiency and flexibility, has recently attracted increasing attention from researchers and has shown promising performance in solving combinatorial optimization problems. Nevertheless, little is known about the performance of DRL technologies in solving the CMMS problem. Therefore, in this study, three state-of-the-art DRL technologies, including proximal policy optimization (PPO), deep deterministic policy gradient, and normalized advantage function, are selected to systematically investigate the potential of DRL in solving the CMMS problem. A comprehensive comparison of these DRL technologies is conducted in terms of effectiveness and efficiency, robustness and adaptability, and scalability. Experimental results indicate that PPO is superior to other technologies in solving the CMMS problem. © 2022, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Dual Interactive Graph Convolutional Networks for Hyperspectral Image Classification

引用

IEEE Transactions on Geoscience and Remote Sensing 2022年 60卷 1页

作者： Wan, Sheng Pan, Shirui Zhong, Ping Chang, Xiaojun Yang, Jian Gong, Chen Pca Laboratory Key Lab. of Intelligent Percept. and Syst. for High-Dimensional Information of Ministry of Education Jiangsu Key Laboratory of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Faculty of Information Technology Monash University ClaytonVIC3800 Australia National Key Laboratory of Science and Technology on Atr National University of Defense Technology Changsha410073 China Pca Laboratory Key Lab. of Intelligent Percept. and Syst. for High-Dimensional Information of Ministry of Education Nanjing University of Science and Technology Nanjing210094 China Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong

Recently, graph convolutional network (GCN) has progressed significantly and gained increasing attention in hyperspectral image (HSI) classification due to its impressive representation power. However, existing GCN-based methods do not give full consideration to the multiscale spatial information, since the convolution operations are governed by fixed neighborhood. As a result, their performances can be limited, particularly in the regions with diverse land cover appearances. In this article, we develop a new dual interactive GCN (DIGCN) which introduces the dual GCN branches to capture spatial information at different scales. More significantly, the dual interactive module is embedded across the GCN branches, so that the correlation of multiscale spatial information can be leveraged to refine the graph information. To be concrete, the edge information contained in one GCN branch can be refined by incorporating the feature representations from the other branch. Analogously, improved feature representations can be generated in one GCN branch by fusing the edge information from the other branch. As such, the refined graph information can help enhance the representation power of the model. Furthermore, to avoid the negative effects of the manually constructed graph, our proposed model adaptively learns a discriminative region-induced graph, which also accelerates the convolution operation. We comprehensively evaluate the proposed method on four commonly used HSI benchmark data sets, and the state-of-the-art results can be achieved when compared with several typical HSI classification methods. © 1980-2012 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Attention-guided progressive neural texture fusion for high dynamic range image restoration

arXiv

引用

arXiv 2021年

作者： Chen, Jie Yang, Zaifeng Chan, Tsz Nam Li, Hui Hou, Junhui Chau, Lap-Pui The Department of Computer Science Hong Kong Baptist University Hong Kong The Institute of High Performance Computing A*STAR Singapore The Imaging Algorithm Research Department Vivo Mobile Communication Co. Ltd Shenzhen China The Department of Computer Science City University of Hong Kong Hong Kong The School of Electrical & Electronic Engineering Nanyang Technological University Singapore

high Dynamic Range (HDR) imaging via multiexposure fusion is an important task for most modern imaging platforms. In spite of recent developments in both hardware and algorithm innovations, challenges remain over content association ambiguities caused by saturation, motion, and various artifacts introduced during multi-exposure fusion such as ghosting, noise, and blur. In this work, we propose an Attention-guided Progressive Neural Texture Fusion (APNT-Fusion) HDR restoration model which aims to address these issues within one framework. An efficient two-stream structure is proposed which separately focuses on texture feature transfer over saturated regions and multi-exposure tonal and texture feature fusion. A neural feature transfer mechanism is proposed which establishes spatial correspondence between different exposures based on multi-scale VGG features in the masked saturated HDR domain for discriminative contextual clues over the ambiguous image areas. A progressive texture blending module is designed to blend the encoded two-stream features in a multi-scale and progressive manner. In addition, we introduce several novel attention mechanisms, i.e., the motion attention module detects and suppresses the content discrepancies among the reference images;the saturation attention module facilitates differentiating the misalignment caused by saturation from those caused by motion;and the scale attention module ensures texture blending consistency between different coder/decoder scales. We carry out comprehensive qualitative and quantitative evaluations and ablation studies, which validate that these novel modules work coherently under the same framework and outperform state-of-the-art methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

Security boundaries of an optical power limiter for protecting quantum key distribution systems

arXiv

引用

arXiv 2023年

作者： Peng, Qingquan Gao, Binwu Zaitsev, Konstantin Wang, Dongyang Ding, Jiangfang Liu, Yingwen Liao, Qin Guo, Ying Huang, Anqi Wu, Junjie Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China School of Automation Central South University Changsha410083 China China Greatwall Research Institute China Greatwall Technology Group Co. Ltd. Shenzhen518057 China Russian Quantum Center Skolkovo Moscow121205 Russia NTI Center for Quantum Communications National University of Science and Technology MISiS Moscow119049 Russia Vigo Quantum Communication Center University of Vigo Vigo Spain Escuela de Ingeniería de Telecomunicación Department of Signal Theory and Communications University of Vigo Vigo Spain atlanTTic Research Center University of Vigo Vigo Spain College of Computer Science and Electronic Engineering Hunan University Changsha410082 China School of Computer Science Beijing University of Posts and Telecommunications Beijing100876 China

Unauthorized light injection has always been a vital threat to the practical security of a quantum key distribution (QKD) system. An optical power limiter (OPL) based on the thermo-optical defocusing effect has been proposed and implemented, limiting the injected hacking light. As a hardware countermeasure, the performance of the OPL under various light-injection attacks shall be tested to clarify the security boundary before being widely deployed. To investigate the OPL’s security boundary in quantum cryptography, we comprehensively test and analyse the behavior of OPL under continuous-wave (c.w.) light-injection attacks and pulse illumination attacks with pulses’ repetition rate at 0.5-Hz, 40-MHz, and 1-GHz. The testing results illuminate the security boundary of the OPL, which allows one to properly employ the OPL in the use cases. The methodology of testing and analysis proposed here is applicable to other power-limitation components in a QKD system. Copyright © 2023, The Authors. All rights reserved.

关键词： Pulse repetition rate

来源：评论

学校读者我要写书评

暂无评论

Kidney Tumor Detection and Classification Based on Deep Learning Approaches: A New Dataset in CT Scans

引用

Journal of Healthcare engineering 2022年第1期2022卷 3861161页

作者： Alzu'Bi, Dalia Abdullah, Malak Hmeidi, Ismail Alazab, Rami Gharaibeh, Maha El-Heis, Mwaffaq Almotairi, Khaled H. Forestiero, Agostino Hussein, Ahmad Mohdaziz Abualigah, Laith Department of Computer Information Systems Jordan University of Science and Technology Irbid2210 Jordan Department of General Surgery and Urology University of Science and Technology Irbid22110 Jordan Department of Diagnostic and Interventional Radiology Faculty of Medicine Jordan University of Science and Technology Irbid2210 Jordan Computer Engineering Department Computer and Information Systems College Umm Al-Qura University Makkah21955 Saudi Arabia Institute for High Performance Computing and Networking CNR CS Rende Italy Deanship of E-Learning and Distance Education Umm Al-Qura University Makkah21955 Saudi Arabia Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman19328 Jordan Faculty of Information Technology Middle East University Amman11831 Jordan School of Computer Sciences Universiti Sains Malaysia Pulau Pinang11800 Malaysia

Kidney tumor (KT) is one of the diseases that have affected our society and is the seventh most common tumor in both men and women worldwide. The early detection of KT has significant benefits in reducing death rates, producing preventive measures that reduce effects, and overcoming the tumor. Compared to the tedious and time-consuming traditional diagnosis, automatic detection algorithms of deep learning (DL) can save diagnosis time, improve test accuracy, reduce costs, and reduce the radiologist's workload. In this paper, we present detection models for diagnosing the presence of KTs in computed tomography (CT) scans. Toward detecting and classifying KT, we proposed 2D-CNN models;three models are concerning KT detection such as a 2D convolutional neural network with six layers (CNN-6), a ResNet50 with 50 layers, and a VGG16 with 16 layers. The last model is for KT classification as a 2D convolutional neural network with four layers (CNN-4). In addition, a novel dataset from the King Abdullah University Hospital (KAUH) has been collected that consists of 8,400 images of 120 adult patients who have performed CT scans for suspected kidney masses. The dataset was divided into 80% for the training set and 20% for the testing set. The accuracy results for the detection models of 2D CNN-6 and ResNet50 reached 97%, 96%, and 60%, respectively. At the same time, the accuracy results for the classification model of the 2D CNN-4 reached 92%. Our novel models achieved promising results;they enhance the diagnosis of patient conditions with high accuracy, reducing radiologist's workload and providing them with a tool that can automatically assess the condition of the kidneys, reducing the risk of misdiagnosis. Furthermore, increasing the quality of healthcare service and early detection can change the disease's track and preserve the patient's life. © 2022 Dalia Alzu'bi et al.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

A bi-level formulation for label noise learning with spectral cluster discovery 29

A bi-level formulation for label noise learning with spectra...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Luo, Yijing Han, Bo Gong, Chen PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology China Jiangsu Key Lab of Image Video Understanding for Social Security China Department of Computer Science Hong Kong Baptist University Hong Kong Department of Computing Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9780999241165

Practically, we often face the dilemma that some of the examples for training a classifier are incorrectly labeled due to various subjective and objective factors. Although intensive efforts have been put to design classifiers that are robust to label noise, most of the previous methods have not fully utilized data distribution information. To address this issue, this paper introduces a bi-level learning paradigm termed "Spectral Cluster Discovery" (SCD) for combating with noisy labels. Namely, we simultaneously learn a robust classifier (Learning stage) by discovering the low-rank approximation to the ground-truth label matrix and learn an ideal affinity graph (Clustering stage). Specifically, we use the learned classifier to assign the examples with similar label to a mutual cluster. Based on the cluster membership, we use the learned affinity graph to explore the noisy examples based on the cluster membership. Both stages will reinforce each other iteratively. Experimental results on typical benchmark and real-world datasets verify the superiority of SCD to other label noise learning methods. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Smoothed Least-Laxity-First Algorithm for EV Charging

arXiv

引用

arXiv 2021年

作者： Chen, Niangjun Kurniawan, Christian Nakahira, Yorie Chen, Lijun Low, Steven H. the Department of Information Systems Technology and Design Singapore University of Technology and Design Singapore487372 Singapore the Institute for High Performance Computing Agency for Science Technology and Research Singapore138632 Singapore the Department of Electrical and Computer Engineering Carnegie Mellon University PA15213 United States the Department of Computer Science University of Colorado BoulderCO80309 United States the Department of Computing and Mathematical Sciences California Institute of Technology CA91125 United States

Adaptive charging can charge electric vehicles (EVs) at scale cost effectively, despite the uncertainty in EV arrivals. We formulate adaptive EV charging as a feasibility problem that meets all EVs’ energy demands before their deadlines while satisfying constraints in charging rate and total charging power. We propose an online algorithm, smoothed least-laxity-first (sLLF), that decides the current charging rates without the knowledge of future arrivals and demands. We characterize the performance of the sLLF algorithm analytically and numerically. Numerical experiments with real-world data show that it has a significantly higher rate of feasible EV charging than several other existing EV charging algorithms. Resource augmentation framework is employed to assess the feasibility condition of the algorithm. The assessment shows that the sLLF algorithm achieves perfect feasibility with only a 0.07 increase in resources. © 2021, CC BY.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Weakly supervised learning for textbook question answering

TechRxiv

引用

TechRxiv 2021年

作者： Ma, Jie Chai, Qi Huang, Jingyue Liu, Jun You, Yang Zheng, Qinghua National Engineering Lab for Big Data Analytics School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China The High Performance Computing for Artificial intelligence Lab Department of Computer Science National University of Singapore 117417 Singapore

Textbook Question Answering (TQA) is the task of answering diagram and non-diagram questions given large multimodal contexts consisting of abundant text and diagrams. Deep text understandings and effective learning of diagram semantics are important for this task due to its specificity. In this paper, we propose a Weakly Supervised learning method for TQA (WSTQ), which regards the incompletely accurate results of essential intermediate procedures for this task as supervision to develop Text Matching (TM) and Relation Detection (RD) tasks and then employs the tasks to motivate itself to learn strong text comprehension and excellent diagram semantics respectively. Specifically, we apply the result of text retrieval to build positive as well as negative text pairs. In order to learn deep text understandings, we first pre-train the text understanding module of WSTQ on TM and then fine-tune it on TQA. We build positive as well as negative relation pairs by checking whether there is any overlap between the items/regions detected from diagrams using object detection. The RD task forces our method to learn the relationships between regions, which are crucial to express the diagram semantics. We train WSTQ on RD and TQA simultaneously, i.e., multitask learning, to obtain effective diagram semantics and then improve the TQA performance. Extensive experiments are carried out on CK12-QA and AI2D to verify the effectiveness of WSTQ. Experimental results show that our method achieves significant accuracy improvements of 5.02% and 4.12% on test splits of the above datasets respectively than the current state-of-the-art baseline. We have released our code on https://***/dr-majie/WSTQ. © 2021, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Sketch2Relief: Generating Bas-relief from Sketches with Deep Generative Networks

Sketch2Relief: Generating Bas-relief from Sketches with Deep...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Shizhe Zhou Zeyu Liu Key Laboratory of High Performance Computing and Stochastic Information Processing Ministry of Education of China College of Computer Science and Electronic Engineering Hunan University Changsha China

ISBN: (数字)9781728192284

ISBN: (纸本)9781728185361

We present a novel sketch-based system for generating digital bas-relief sculptures. All existing computational methods for generating digital bas-reliefs first require the input of a three-dimensional (3D) scene, thus preventing artists from freely creating or exploring designs when 3D data are not available. Motivated by this limitation, we propose a generative adversarial network (GAN)-based sketch modeling system for generating digital bas-reliefs from freehand user sketches (see Figure 1, 5). The basic tool underpinning the interface is a conditional GAN (cGAN) that digitally learns a functional map from a contour image to a 3D model for any given viewpoint of the corresponding bas-relief model. When using our system for designing bas-reliefs, the user only needs to draw 2D sketch lines without having to designate any additional hints on the lines. The interface returns bas-relief results in interactive time (500 ms per bas-relief on average). We tested the quality and robustness of our approach with extensive and comprehensive experiments. By carefully analyzing the results, we verified that our system can faithfully reconstruct bas-reliefs from a test dataset and can generate completely new reliefs from raw amateur sketches.

关键词： Solid modeling Three-dimensional displays Two dimensional displays Neural networks Tools Generative adversarial networks Robustness

来源：评论

学校读者我要写书评

暂无评论

Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2022年 13214 LNCS卷 v页

作者： Panda, Dhabaleswar K. Sullivan, Michael Department of Computer Science and Engineering The Ohio State University ColumbusOH United States Material Science and Chemistry A*STAR Institute of High Performance Computing Singapore Singapore

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：