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

arXiv 2019年

作者： Li, Xurong Ji, Shouling Han, Meng Ji, Juntao Ren, Zhenyu Liu, Yushan Wu, Chunming Institute of Cyberspace Research College of Computer Science and Technology Zhejiang University Hangzhou Zhejiang310027 China School of Computer Science and Technology Georgia Institute of Technology AtlantaGA30302 United States College of Computing and Software Engineering Kennesaw State University MariettaGA30060 United States Department of Electrical Engineering Princeton University PrincetonNJ08540 United States

Deep learning has been broadly leveraged by major cloud providers, such as Google, AWS and Baidu, to offer various computer vision related services including image classification, object identification, illegal image detection, etc. While recent works extensively demonstrated that deep learning classification models are vulnerable to adversarial examples, cloud-based image detection models, which are more complicated than classifiers, may also have similar security concern but not get enough attention yet. In this paper, we mainly focus on the security issues of real-world cloud-based image detectors. Specifically, (1) based on effective semantic segmentation, we propose four attacks to generate semantics-aware adversarial examples via only interacting with black-box APIs;and (2) we make the first attempt to conduct an extensive empirical study of black-box attacks against real-world cloud-based image detectors. Through the comprehensive evaluations on five major cloud platforms: AWS, Azure, Google Cloud, Baidu Cloud, and Alibaba Cloud, we demonstrate that our image processing based attacks can reach a success rate of approximately 100%, and the semantic segmentation based attacks have a success rate over 90% among different detection services, such as violence, politician, and pornography detection. We also proposed several possible defense strategies for these security challenges in the real-life situation. Copyright © 2019, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Application of Ontology in the Web Information Retrieval

引用

Journal on Big Data 2019年第2期1卷 79-88页

作者： Zimeng Xing Lina Wang Wenbo Xing Yongjun Ren Tao Li Jinyue Xia School of Electronics and Information Engineering Nanjing University of Information Science and TechnologyNanjing210044China School of Criminal Science and Technology Nanjing Forest Police CollegeNanjing210023China School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China International Business Machines Corporation(IBM) New YorkUSA

In this paper,the research advances of ontology and its application are reviewed *** the development of ontology technology,subject-oriented web information retrieval technology combining ontology has been becoming one of the hot scientific *** innovative method of the semantic web technology combined with the traditional information retrieval technology is put forward,and the related algorithm based on ontology for judging the relevancy with different topics is also represented,and has proved to be effective in given experiments.

关键词： Ontology semantic web topic relevance

来源：评论

学校读者我要写书评

暂无评论

A Survey on Dragonfly Algorithm and its Applications in engineering

TechRxiv

引用

TechRxiv 2020年

作者： Rahman, Chnoor M. Rashid, Tarik A. Alsadoon, Abeer Bacanin, Nebojsa Fattah, Polla Mirjalili, Seyedali Applied Computer Department College of Health and Applied Sciences Charmo University Sulaimany Iraq Science and Engineering Department University of Kurdistan Hewler Erbil Iraq Charles Sturt University Sydney Australia Singidunum University Belgrade Serbia Software and Informatics Engineering Salahaddin University-Erbil- Erbil Iraq Centre for Artificial Intelligence Research and Optimisation Torrens University Adelaide Australia Yonsei Frontier Lab Yonsei University Seoul Korea Republic of University of Kurdistan Hewler Iraq

The dragonfly algorithm developed in 2016. It is one of the algorithms used by the researchers to optimize an extensive series of uses and applications in various areas. At times, it offers superior performance compared to the most well-known optimization techniques. However, this algorithm faces several difficulties when it is utilized to enhance complex optimization problems. This work addressed the robustness of the method to solve real-world optimization issues, and its deficiency to improve complex optimization problems. This review paper shows a comprehensive investigation of the dragonfly algorithm in the engineering area. First, an overview of the algorithm is discussed. Besides, we also examined the modifications of the algorithm. The merged forms of this algorithm with different techniques and the modifications that have been done to make the algorithm perform better are addressed. Additionally, a survey on applications in the engineering area that used the dragonfly algorithm is offered. The utilized engineering applications are the applications in the field of mechanical engineering problems, electrical engineering problems, optimal parameters, economic load dispatch, and loss reduction. The algorithm is tested and evaluated against particle swarm optimization algorithm and firefly algorithm. To evaluate the ability of the dragonfly algorithm and other participated algorithms a set of traditional benchmarks (TF1-TF23) were utilized. Moreover, to examine the ability of the algorithm to optimize large scale optimization problems CEC-C2019 benchmarks were utilized. A comparison is made between the algorithm and other metaheuristic techniques to show its ability to enhance various problems. The outcomes of the algorithm from the works that utilized the dragonfly algorithm previously and the outcomes of the benchmark test functions proved that in comparison with participated algorithms (GWO, PSO, and GA), the dragonfly algorithm owns an excellent performance,

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Enhanced energy-efficient downlink resource allocation in green non-orthogonal multiple access systems

arXiv

引用

arXiv 2019年

作者： Ruby, Rukhsana Zhong, Shuxin Ng, Derrick Wing Kwan Wu, Kaishun Leung, Victor C.M. College of Computer Science and Software Engineering Shenzhen University Shenzhen Guangdong518060 China School of Electrical Engineering and Telecommunications University of New South Wales Australia Department of Electrical and Computer Engineering University of British Columbia Vancouver Canada PCL Research Center of Networks and Communications Peng Cheng Laboratory Shenzhen China

Non-orthogonal multiple access (NOMA) technique has the ability to support multiple transmissions simultaneously using the same physical resource, the idea of which achieves much enhanced performance for a system compared to the conventional orthogonal multiple access (OMA) techniques. Despite numerous advantages, this phenomenon of NOMA technique can bring additional interference for the neighboring ultra-dense networks if the power consumption of the system is not properly optimized. While targeting on the green communication concept, in this paper, we propose an energy-efficient downlink resource allocation scheme for a NOMA-equipped cellular network. The objective of this work is to allocate subchannels and power of the base station among the users so that the overall energy efficiency is maximized. Since this problem is NP-hard, we attempt to find an elegant solution with reasonable complexity that provides good performance for some realistic applications. To this end, we decompose the problem into a subchannel allocation subproblem followed by a power loading subproblem that allocates power to each user's data stream on each of its allocated subchannels. We first employ a many-to-many matching model under the assumption of uniform power loading in order to obtain the solution of the first subproblem with reasonable performance. Once the the subchanneluser mapping information is known from the first solution, we propose a geometric programming (GP)-based power loading scheme upon approximating the energy efficiency of the system by a ratio of two posynomials. The techniques adopted for these subproblems better exploit the available multi-user diversity compared to the techniques used in an earlier work. Having observed the computational overhead of the GP-based power loading scheme, we also propose a suboptimal computationally-efficient algorithm for the power loading subproblem with a polynomial time complexity that provides reasonably good performance. Extens

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Publisher Correction: A skin-integrated multimodal haptic interface for immersive tactile feedback

引用

Nature Electronics 2023年第12期6卷 1041页

作者： Ya Huang Jingkun Zhou Chun Ki Yiu Kuanming Yao Dengfeng Li Jian Li Tsz Hung Wong Yiming Liu Yuyu Gao Xingcan Huang Hu Li Jiyu Li Binbin Zhang Zhenlin Chen Xinge Yu Pingchuan Ke Shaoyu Cai Xingyu Yang Haichen Gao Kening Zhu Xu Guo Zichen Zhao Zhaoqian Xie Yu Zhou Lei Li Huanxi Zheng Zuankai Wang Enming Song Hui Wu Department of Biomedical Engineering City University of Hong Kong Hong Kong China Hong Kong Centre for Cerebro-Cardiovascular Health Engineering Hong Kong Science Park Hong Kong China Shenzhen Research Institute City University of Hong Kong Shenzhen China Department of Sociology Hong Kong Shue Yan University Hong Kong China School of Creative Media City University of Hong Kong Hong Kong China Engineering Design and Innovation Centre College of Design and Engineering National University of Singapore Singapore Singapore State Key Laboratory of Structural Analysis Optimization and CAE Software for Industrial Equipment Dalian University of Technology Dalian China Department of Engineering Mechanics Dalian University of Technology Dalian China Ningbo Institute of Dalian University of Technology Ningbo China Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology Hong Kong China National Engineering Research Center of Electric Vehicles Beijing Institute of Technology Beijing China Department of Mechanical Engineering Hong Kong Polytechnic University Hong Kong China Shanghai Frontiers Science Research Base of Intelligent Optoelectronics and Perception Institute of Optoelectronics Fudan University Shanghai China State Key Laboratory of New Ceramics and Fine Processing School of Materials Science and Engineering Tsinghua University Beijing China

来源：评论

学校读者我要写书评

暂无评论

SysML Modeling Mistakes and Their Impacts on Requirements

SysML Modeling Mistakes and Their Impacts on Requirements

引用

IEEE International Requirements engineering Conference Workshops (REW)

作者： Mounifah Alenazi Nan Niu Juha Savolainen Department of Electrical Engineering and Computer Science University of Cincinnati USA College of Arts and Sciences University of Hafr Albatin Saudi Arabia Global Software and Control R&D Danfoss Drives A/S Denmark

ISBN: (纸本)9781728151663

The Systems Modeling Language (SysML) represents a significant and increasing segment of industrial support for building critical systems. Because modeling is a human-centric activity, mistakes are unavoidable. Although there exist several software defect classifications, little is known about the mistakes pertaining to SysML modeling and the implications of those mistakes in model-driven requirements engineering. In this paper, we report a systematic mapping through which 42 SysML modeling mistakes are identified from 19 primary studies. With an emphasis on the evidence of industrial relevance, we further uncover that, despite some mistakes hurt requirements satisfaction, others help make the requirements more complete and the specifications more precise. Our work sheds light on understanding the scope of the SysML mistakes and checking requirements fulfillment in the face of the mistakes.

关键词： Unified modeling language Modeling software Systematics Systems Modeling Language Requirements engineering software engineering

来源：评论

学校读者我要写书评

暂无评论

Gabor Wavelet Based Feature Extraction and Fusion for Hyperspectral and Lidar Remote Sensing Data

Gabor Wavelet Based Feature Extraction and Fusion for Hypers...

引用

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： Sen Jia Meng Zhang Jiasong Zhu College of Computer Science and Software Engineering Shenzhen University Shenzhen China

In recent years, it has been found that the fusion processing of remote sensing data produced by multiple sensors is often effective for material classification. Specifically, the joint use of hyperspectral image (HSI) and Light Detection And Ranging (LiDAR) data for classification has been an active topic of research in remote sensing field. Since hyperspectral and LiDAR data provide complementary information (spectral reflectance, and vertical structure, respectively), one promising and challenging approach is to fuse these data in the information extraction procedure. In this paper, we propose an efficient feature extraction and fusion method based on Gabor wavelet, leading to a fusion of the spectral, spatial and elevation data. The core idea of the proposed fusion approach is stacking elevation and intensity data of LiDAR as additional channels to spectral bands. Our strategies are based on the Gabor feature stack structure, which are natural and effective. The features extracted by Gabor wavelets have proved to be discriminant features when considered for thematic classification in remote sensing applications especially when dealing with hyperspectral images due to their ability to extract joint spatial and spectrum information from HSI. Experimental results on the real hyperspectral image data have shown the better discriminative power of our approach for classification.

关键词： Feature extraction Laser radar Hyperspectral imaging Training Sensors

来源：评论

学校读者我要写书评

暂无评论

Approximating maximum diameter-bounded subgraph in unit disk graphs 34

Approximating maximum diameter-bounded subgraph in unit disk...

引用

34th International Symposium on Computational Geometry, SoCG 2018

作者： Abu-Affash, A. Karim Carmi, Paz Maheshwari, Anil Morin, Pat Smid, Michiel Smorodinsky, Shakhar Software Engineering Department Shamoon College of Engineering Beer-Sheva84100 Israel Department of Computer Science Ben-Gurion University Beer-Sheva84105 Israel School of Computer Science Carleton University Ottawa Canada Department of Mathematics Ben-Gurion University Beer-Sheva84105 Israel

ISBN: (纸本)9783959770668

We consider a well studied generalization of the maximum clique problem which is defined as follows. Given a graph G on n vertices and an integer d ≥ 1, in the maximum diameter-bounded subgraph problem (MaxDBS for short), the goal is to find a (vertex) maximum subgraph of G of diameter at most d. For d = 1, this problem is equivalent to the maximum clique problem and thus it is NP-hard to approximate it within a factor n1-ϵ, for any ϵ > 0. Moreover, it is known that, for any d ≥ 2, it is NP-hard to approximate MaxDBS within a factor n1/2-ϵ, for any ϵ > 0. In this paper we focus on MaxDBS for the class of unit disk graphs. We provide a polynomial-time constant-factor approximation algorithm for the problem. The approximation ratio of our algorithm does not depend on the diameter d. Even though the algorithm itself is simple, its analysis is rather involved. We combine tools from the theory of hypergraphs with bounded VC-dimension, k-quasi planar graphs, fractional Helly theorems and several geometric properties of unit disk graphs. © *** Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, and Shakhar Smorodinsky;licensed under Creative Commons License CC-BY 34th Symposium on Computational Geometry (SoCG 2018).

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Facial Emotion Distribution Learning by Exploiting Low-Rank Label Correlations Locally

Facial Emotion Distribution Learning by Exploiting Low-Rank ...

引用

IEEE/CVF Conference on computer Vision and Pattern Recognition

作者： Xiuyi Jia Xiang Zheng Weiwei Li Changqing Zhang Zechao Li School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China College of Astronautics Nanjing University of Aeronautics and Astronautics Nanjing China College of Intelligence and Computing Tianjin University Tianjin China

Emotion recognition from facial expressions is an interesting and challenging problem and has attracted much attention in recent years. Substantial previous research has only been able to address the ambiguity of "what describes the expression", which assumes that each facial expression is associated with one or more predefined affective labels while ignoring the fact that multiple emotions always have different intensities in a single picture. Therefore, to depict facial expressions more accurately, this paper adopts a label distribution learning approach for emotion recognition that can address the ambiguity of "how to describe the expression" and proposes an emotion distribution learning method that exploits label correlations locally. Moreover, a local low-rank structure is employed to capture the local label correlations implicitly. Experiments on benchmark facial expression datasets demonstrate that our method can better address the emotion distribution recognition problem than state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

First Results from the REAL-time Transient Acquisition backend (REALTA) at the Irish LOFAR station

arXiv

引用

arXiv 2021年

作者： Murphy, Pearse C. Callanan, P. McCauley, J. McKenna, D.J. Fionnagáin, D.Ó. Louis, C.K. Redman, M.P. Cañizares, L.A. Carley, E.P. Maloney, S.A. Coghlan, B. Daly, M. Scully, J. Dooley, J. Gajjar, V. Giese, C. Brennan, A. Keane, E.F. Maguire, C.A. Quinn, J. Mooney, S. Ryan, A.M. Walsh, J. Jackman, C.M. Golden, A. Ray, T.P. Doyle, J.G. Rigney, J. Burton, M. Gallagher, P.T. School of Physics Trinity College Dublin Dublin 2 Ireland Astronomy & Astrophysics Section Dublin Institute for Advanced Studies D02 XF86 Ireland Department of Physics University College Cork Cork Ireland Astrophysics Research Group School of Mathematics Statistics and Applied Mathematics National University of Ireland Galway University Road GalwayH91 TK33 Ireland Centre for Astronomy School of Physics National University of Ireland Galway University Road GalwayH91 TK33 Ireland School of Computer Science and Statistics Trinity College Dublin Dublin 2 Ireland Deptartment of Computer and Software Engineering Athlone Institute of Technology Athlone Ireland Department of Astronomy University of California BerkeleyCA94720 United States School of Physics University College Dublin Belfield Dublin 4 Ireland Armagh Observatory and Planetarium College Hill ArmaghBT61 9DG United Kingdom Astrophysics Research Centre School of Mathematics and Physics Queen's University Belfast BelfastBT7 1NN United Kingdom

Modern radio interferometers such as the LOw Frequency ARray (LOFAR) are capable of producing data at hundreds of gigabits to terabits per second. This high data rate makes the analysis of radio data cumbersome and computationally expensive. While high performance computing facilities exist for large national and international facilities, that may not be the case for instruments operated by a single institution or a small consortium. Data rates for next generation radio telescopes are set to eclipse those currently in operation, hence local processing of data will become all the more important. Here, we introduce the REAL-time Transient Acquisition backend (REALTA), a computing backend at the Irish LOFAR station (I-LOFAR) which facilitates the recording of data in near real-time and post-processing. We also present first searches and scientific results of a number of radio phenomena observed by I-LOFAR and REALTA, including pulsars, fast radio bursts (FRBs), rotating radio transients (RRATs), the search for extraterrestrial intelligence (SETI), Jupiter, and the Sun. © 2021, CC BY.

关键词： Interferometers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：