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

Systematic Literature Review on Cyber Situational Awareness Visualizations

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Jiang, Liuyue Jayatilaka, Asangi Nasim, Mehwish Grobler, Marthie Zahedi, Mansooreh Ali Babar, M. CREST - the Centre for Research on Engineering Software Technologies School of Computer Science The University of Adelaide Australia Australia College of Science and Engineering Flinders University AdelaideSA5000 Australia CSIRO's Data61 Melbourne Australia School of Computing and Information Systems The University of Melbourne Australia

The dynamics of cyber threats are increasingly complex, making it more challenging than ever for organizations to obtain in-depth insights into their cyber security status. Therefore, organizations rely on Cyber Situational Awareness (CSA) to support them in better understanding the threats and associated impacts of cyber events. Due to the heterogeneity and complexity of cyber security data, often with multidimensional attributes, sophisticated visualization techniques are needed to achieve CSA. However, there have been no previous attempts to systematically review and analyze the scientific literature on CSA visualizations. In this paper, we systematically select and review 54 publications that discuss visualizations to support CSA. We extract data from these papers to identify key stakeholders, information types, data sources, and visualization techniques. Furthermore, we analyze the level of CSA supported by the visualizations, alongside examining the maturity of the visualizations, challenges, and practices related to CSA visualizations to prepare a full analysis of the current state of CSA in an organizational context. Our results reveal certain gaps in CSA visualizations. For instance, the largest focus is on operational-level staff, and there is a clear lack of visualizations targeting other types of stakeholders such as managers, higher-level decision makers, and non-expert users. Most papers focus on threat information visualization, and there is a dearth of papers that visualize impact information, response plans, and information shared within teams. Interestingly, we find that only a few studies proposed visualizations to facilitate up to the projection level (i.e., the highest level of CSA), whereas most studies facilitated only the perception level (i.e., the lowest level of CSA). Most of the studies provide evidence of the proposed visualizations through toy examples and demonstrations, while only a few visualizations are employed in industrial practi

关键词： Visualization

Attention-Weighted Federated Deep Reinforcement Learning for Device-to-Device Assisted Heterogeneous Collaborative Edge Caching

学校读者我要写书评

暂无评论

Attention-Weighted Federated Deep Reinforcement Learning for...

作者： Wang, Xiaofei Li, Ruibin Wang, Chenyang Li, Xiuhua Taleb, Tarik Leung, Victor C. M. College of Intelligence and Computing Tianjin University Tianjin China Ministry of Education China Department of Communications and Networking School of Electrical Engineering Aalto University Espoo Finland College of Computer Science and Software Engineering Shenzhen University Shenzhen China School of Big Data and Software Engineering Chongqing University Chongqing401331 China Department of Information Technology and Electrical Engineering Oulu University Oulu90570 Finland Department of Computer and Information Security Sejong University Seoul05006 Korea Republic of Department of Electrical and Computer Engineering The University of British Columbia VancouverBCV6T 1Z4 Canada

In order to meet the growing demands for multimedia service access and release the pressure of the core network, edge caching and device-to-device (D2D) communication have been regarded as two promising techniques in next generation mobile networks and beyond. However, most existing related studies lack consideration of effective cooperation and adaptability to the dynamic network environments. In this article, based on the flexible trilateral cooperation among user equipment, edge base stations and a cloud server, we propose a D2D-assisted heterogeneous collaborative edge caching framework by jointly optimizing the node selection and cache replacement in mobile networks. We formulate the joint optimization problem as a Markov decision process, and use a deep Q-learning network to solve the long-term mixed integer linear programming problem. We further design an attention-weighted federated deep reinforcement learning (AWFDRL) model that uses federated learning to improve the training efficiency of the Q-learning network by considering the limited computing and storage capacity, and incorporates an attention mechanism to optimize the aggregation weights to avoid the imbalance of local model quality. We prove the convergence of the corresponding algorithm, and present simulation results to show the effectiveness of the proposed AWFDRL framework in reducing average delay of content access, improving hit rate and offloading traffic. © 1983-2012 IEEE.

关键词： Reinforcement learning

ER: Equivariance Regularizer for Knowledge Graph Completion

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Cao, Zongsheng Xu, Qianqian Yang, Zhiyong Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

Tensor factorization and distanced based models play important roles in knowledge graph completion (KGC). However, the relational matrices in KGC methods often induce a high model complexity, bearing a high risk of overfitting. As a remedy, researchers propose a variety of different regularizers such as the tensor nuclear norm regularizer. Our motivation is based on the observation that the previous work only focuses on the "size" of the parametric space, while leaving the implicit semantic information widely untouched. To address this issue, we propose a new regularizer, namely, Equivariance Regularizer (ER), which can suppress overfitting by leveraging the implicit semantic information. Specifically, ER can enhance the generalization ability of the model by employing the semantic equivariance between the head and tail entities. Moreover, it is a generic solution for both distance based models and tensor factorization based models. The experimental results indicate a clear and substantial improvement over the state-of-the-art relation prediction methods. © 2022, CC BY.

关键词： Knowledge graph

A Learning-Exploring Method to Generate Diverse Paraphrases with Multi-Objective Deep Reinforcement Learning 28

学校读者我要写书评

暂无评论

A Learning-Exploring Method to Generate Diverse Paraphrases ...

28th International Conference on Computational Linguistics, COLING 2020

作者： Liu, Mingtong Yang, Erguang Xiong, Deyi Zhang, Yujie Meng, Yao Hu, Changjian Xu, Jinan Chen, Yufeng School of Computer Science and Information Technology Beijing Key Lab of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing China College of Intelligence and Computing Tianjin University Tianjin China Lenovo Research AI Lab. Beijing China

ISBN: (纸本)9781952148279

Paraphrase generation (PG) is of great importance to many downstream tasks in natural language processing. Diversity is an essential nature to PG for enhancing generalization capability and robustness of downstream applications. Recently, neural sequence-to-sequence (Seq2Seq) models have shown promising results in PG. However, traditional model training for PG focuses on optimizing model prediction against single reference and employs cross-entropy loss, which objective is unable to encourage model to generate diverse paraphrases. In this work, we present a novel approach with multi-objective learning to PG. We propose a learning-exploring method to generate sentences as learning objectives from the learned data distribution, and employ reinforcement learning to combine these new learning objectives for model training. We first design a sample-based algorithm to explore diverse sentences. Then we introduce several reward functions to evaluate the sampled sentences as learning signals in terms of expressive diversity and semantic fidelity, aiming to generate diverse and high-quality paraphrases. To effectively optimize model performance satisfying different evaluating aspects, we use a GradNorm-based algorithm that automatically balances these training objectives. Experiments and analyses on Quora and Twitter datasets demonstrate that our proposed method not only gains a significant increase in diversity but also improves generation quality over several state-of-the-art baselines. © 2020 COLING 2020 - 28th International Conference on Computational Linguistics, Proceedings of the Conference. All rights reserved.

关键词： Reinforcement learning

Geometry Interaction Knowledge Graph Embeddings

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Cao, Zongsheng Xu, Qianqian Yang, Zhiyong Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

Knowledge graph (KG) embeddings have shown great power in learning representations of entities and relations for link prediction tasks. Previous work usually embeds KGs into a single geometric space such as Euclidean space (zero curved), hyperbolic space (negatively curved) or hyperspherical space (positively curved) to maintain their specific geometric structures (e.g., chain, hierarchy and ring structures). However, the topological structure of KGs appears to be complicated, since it may contain multiple types of geometric structures simultaneously. Therefore, embedding KGs in a single space, no matter the Euclidean space, hyperbolic space or hyperspheric space, cannot capture the complex structures of KGs accurately. To overcome this challenge, we propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Theoretically, our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities. Experimental results on three well-established knowledge graph completion benchmarks show that our GIE achieves the state-of-the-art performance with fewer parameters. © 2022, CC BY.

关键词： Knowledge graph

EXPLAINABLE ARTIFICIAL INTELLIGENCE (XAI) 2.0: A MANIFESTO OF OPEN CHALLENGES AND INTERDISCIPLINARY RESEARCH DIRECTIONS

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Longo, Luca Brcic, Mario Cabitza, Federico Choi, Jaesik Confalonieri, Roberto Ser, Javier Del Guidotti, Riccardo Hayashi, Yoichi Herrera, Francisco Holzinger, Andreas Jiang, Richard Khosravi, Hassan Lecue, Freddy Malgieri, Gianclaudio Páez, Andrés Samek, Wojciech Schneider, Johannes Speith, Timo Stumpf, Simone The Artificial Intelligence and Cognitive Load Research Lab Technological University Dublin Ireland University of Zagreb Faculty of Electrical Engineering and Computing Croatia University of Milano-Bicocca Milan Italy IRCCS Ospedale Galeazzi Sant’Ambrogio Milan Italy Kim Jaechul Graduate School of AI Korea Advanced Institute of Science & Technology Korea Republic of INEEJI Corporation Korea Republic of Department of Mathematics University of Padua Italy Derio Spain Bilbao Spain University of Pisa Pisa Italy Department of Computer Science Meiji University Tokyo Japan Department of Computer Science and Artificial Intelligence DaSCI Andalusian Institute in Data Science & Computational Intelligence University of Granada Granada Spain Human-Centered AI Lab University of Natural Resources and Life Sciences Vienna Austria School of Computing and Communications Lancaster University United Kingdom The University of Queensland Brisbane Australia Sophia Antipolis France eLaw Center for Law and Digital Technologies Leiden University Netherlands Department of Philosophy Universidad de los Andes Bogotá Colombia Center for Research & Formation in Artificial Intelligence Universidad de los Andes Bogotá Colombia Technical University of Berlin Berlin Germany Fraunhofer Heinrich Hertz Institute Berlin Germany Berlin Germany Department of Information Systems and Computer Science University of Liechtenstein Liechtenstein Liechtenstein Department of Philosophy University of Bayreuth Bayreuth Germany Center for Perspicuous Computing Saarland University Saarbrücken Germany School of Computing Science University of Glasgow United Kingdom

As systems based on opaque Artificial Intelligence (AI) continue to flourish in diverse real-world applications, understanding these black box models has become paramount. In response, Explainable AI (XAI) has emerged as a field of research with practical and ethical benefits across various domains. This paper not only highlights the advancements in XAI and its application in real-world scenarios but also addresses the ongoing challenges within XAI, emphasizing the need for broader perspectives and collaborative efforts. We bring together experts from diverse fields to identify open problems, striving to synchronize research agendas and accelerate XAI in practical applications. By fostering collaborative discussion and interdisciplinary cooperation, we aim to propel XAI forward, contributing to its continued success. Our goal is to put forward a comprehensive proposal for advancing XAI. To achieve this goal, we present a manifesto of 27 open problems categorized into nine categories. These challenges encapsulate the complexities and nuances of XAI and offer a road map for future research. For each problem, we provide promising research directions in the hope of harnessing the collective intelligence of interested stakeholders. © 2023, CC BY-SA.

关键词： Ethical technology

BayesDose: Comprehensive proton dose prediction with model uncertainty using Bayesian LSTMs

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Voss, Luke Neishabouri, Ahmad Ortkamp, Tim Mairani, Andrea Wahl, Niklas Department of Medical Physics in Radiation Oncology German Cancer Research Center – DKFZ Im Neuenheimer Feld 280 Heidelberg69120 Germany Heidelberg Institute for Radiation Oncology – HIRO Im Neuenheimer Feld 280 Heidelberg69120 Germany Ruprecht Karl University of Heidelberg Institute of Computer Science Heidelberg Germany Clinical Cooperation Unit Radiation Oncology German Cancer Research Center – DKFZ Heidelberg Germany Steinbuch Centre for Computing Karlsruhe Germany Heidelberg Germany HIDSS4Health – Helmholtz Information and Data Science School for Health Karlsruhe Heidelberg Germany Im Neuenheimer Feld 450 HeidelbergD-69120 Germany

Purpose: Fast dose calculation techniques are needed in proton therapy, particularly in light of time restrictions in adaptive workflows. Neural network models show the potential to substitute conventional dose calculation algorithms with fast and accurate dose predictions, while lacking measures to quantify an individual prediction’s quality. We propose to use a Bayesian approach to learn uncertainty of AI-based dose prediction. Methods: Our resulting BayesDose-Framework is based on a previously published deterministic LSTM. Similarly, it is trained and evaluated on Monte Carlo beamlet doses simulated on (1) 2500 water phantoms with slab inserts and (2) 1000 geometries extracted from a lung patient for a single initial energy. The network’s weights are parameterized with 2D Gaussian mixture models, and 100 ensemble predictions are used to quantify mean dose predictions and their standard deviation. Generalizability as well as re-training of the model is evaluated on smaller datasets with two different initial energies as well as five additional patients. Results: The averaged predictions of the BayesDose model performed similarly to its deterministic variant and at least as good the original published long short-term memory (LSTM) model. Predictions of the uncertainty (measured through the sampled predictions’ standard deviation) seemed conservative, particularly for the phantom dataset, however regions of high uncertainty correlated spatially with the largest dose differences between the prediction and Monte Carlo calculated reference. Large average uncertainty within a prediction correlates strongly with dosimetric differences (up to ρ = −0.74). This correlation is reduced when applying the model to patient data with unseen HU value ranges. Runtime overhead could be decreased to 9x of a deterministic prediction for an ensemble size of 100 by parallelizing predictions and presampling network weights. Conclusion: Bayesian models for dose prediction can produce fast

关键词： Forecasting

Correction: AI content detection in the emerging information ecosystem: new obligations for media and tech companies

学校读者我要写书评

暂无评论

Ethics and information Technology 2024年第4期26卷 1-2页

作者： Knott, Alistair Pedreschi, Dino Jitsuzumi, Toshiya Leavy, Susan Eyers, David Chakraborti, Tapabrata Trotman, Andrew Sundareswaran, Sundar Baeza-Yates, Ricardo Biecek, Przemyslaw Weller, Adrian Teal, Paul D. Basu, Subhadip Haklidir, Mehmet Morini, Virginia Russell, Stuart Bengio, Yoshua Social Media Governance Project Global Partnership on AI Montreal Canada School of Engineering and Computer Science Victoria University of Wellington Wellington New Zealand University of Pisa Pisa Italy Chuo University Tokyo Japan Insight SFI Research Centre for Data Analytics School of Information and Communication University College Dublin Dublin Ireland School of Computing University of Otago Dunedin New Zealand Alan Turing Institute London United Kingdom University College London London United Kingdom Institute for Experiential AI Northeastern University Silicon Valley USA Warsaw University of Technology Warsaw Poland University of Cambridge Cambridge United Kingdom Computer Science and Engineering Department Jadavpur University Kolkata India Artificial Intelligence Institute Tubitak Bilgem Gebze Türkiye Center for Human-Compatible AI UC Berkeley Berkeley USA Mila - Quebec AI Institute Montreal Canada University of Montreal Montreal Canada

Sample hardness based gradient loss for long-tailed cervical cell detection

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Liu, Minmin Li, Xuechen Gao, Xiangbo Chen, Junliang Shen, Linlin Wu, Huisi Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence of Robotics of Society Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China University of California Irvine United States

Due to the difficulty of cancer samples collection and annotation, cervical cancer datasets usually exhibit a long-tailed data distribution. When training a detector to detect the cancer cells in a WSI (Whole Slice Image) image captured from the TCT (Thinprep Cytology Test) specimen, head categories (e.g. normal cells and inflammatory cells) typically have a much larger number of samples than tail categories (e.g. cancer cells). Most existing state-of-the-art long-tailed learning methods in object detection focus on category distribution statistics to solve the problem in the long-tailed scenario, without considering the "hardness" of each sample. To address this problem, in this work we propose a Grad-Libra Loss that leverages the gradients to dynamically calibrate the degree of hardness of each sample for different categories, and re-balance the gradients of positive and negative samples. Our loss can thus help the detector to put more emphasis on those hard samples in both head and tail categories. Extensive experiments on a long-tailed TCT WSI image dataset show that the mainstream detectors, e.g. RepPoints, FCOS, ATSS, YOLOF, etc. trained using our proposed Gradient-Libra Loss, achieved much higher (7.8%) mAP than that trained using cross-entropy classification loss. Copyright © 2022, The Authors. All rights reserved.

关键词： Cytology