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

3rd IEEE International Conference on ICT in Business Industry and Government, ICTBIG 2023

作者： Naik, Nitin Jenkins, Paul Grace, Paul Naik, Dishita Song, Jingping Prajapat, Shaligram Mishra, Durgesh Yang, Longzhi Boongoen, Tossapon Iam-On, Natthakan School of Informatics and Digital Engineering Aston University United Kingdom Cardiff School of Technologies Cardiff Metropolitan University United Kingdom Birmingham City University United Kingdom Software College Northeastern University China International Institute of Professional Studies Devi Ahilya University India School of Computer Science & Information Technology Symbiosis University of Applied Sciences India Northumbria University Department of Computer and Information Sciences United Kingdom Aberystwyth University Department of Computer Science United Kingdom

ISBN: (纸本)9798350343274

Organisations and users have been experiencing significant rises in cyberattacks and their severity, which means that they require a greater awareness and understanding of the anatomy of cyberattacks, to prevent and mitigate their effects. In analysing cyberattacks, there are a number of different approaches that may be used to assess their potential risks and effects. However, these are utilised in specific types of cyberattacks and their analysis, which means they cannot be applied in every situation or cyberattack. Moreover, several other factors may influence the decision to use these approaches, such as cost, complexity, skills and adaptability. As a result, continuous research to design and enhance these approaches is undertaken to produce a generic, cost-effective, easy and adaptable approach. This paper presents one such approach to assess the risk of cyberattacks utilising an attack tree and fuzzy logic. An attack tree is a systematic and illustrative method for describing an attack on a system and analysing its taxonomy and other aspects. Subsequently, the probability and risk of each leaf node in the attack tree are calculated using the proposed formulas. Finally, fuzzy logic enables decision making based on imprecise data and heuristics to obtain the overall risk of attack. This proposed approach comprises systematic steps to accomplish an assessment of any cyberattack and its associated risks in an uncomplicated and effective manner, enabling its prevention and mitigation to be determined. The paper illustrates an application of the proposed approach to assess the risk of an information theft attack on an organisation, which can then be utilised to assess the risk of other cyberattacks. © 2023 IEEE.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Explainable-AI-based two-stage solution for WSN object localization using zero-touch mobile transceivers

引用

science China(Information sciences) 2024年第7期67卷 27-45页

作者： Kai FANG Junxin CHEN Han ZHU Thippa Reddy GADEKALLU Xiaoping WU Wei WANG School of Mathematics and Computer Science Zhejiang A&F University School of Software Dalian University of Technology Faculty of Applied Sciences Macao Polytechnic University Department of Electrical and Computer Engineering Lebanese American University School of Information Engineering Huzhou University Guangdong-Hong Kong-Macao Joint Laboratory for Emotional Intelligence and Pervasive Computing Artificial Intelligence Research Institute Shenzhen MSU-BIT University

Artificial intelligence technology is widely used in the field of wireless sensor networks(WSN).Due to its inexplicability, the interference factors in the process of WSN object localization cannot be effectively eliminated. In this paper, an explainable-AI-based two-stage solution is proposed for WSN object localization. In this solution, mobile transceivers are used to enlarge the positioning range and eliminate the blind area for object localization. The motion parameters of transceivers are considered to be unavailable,and the localization problem is highly nonlinear with respect to the unknown parameters. To address this,an explainable AI model is proposed to solve the localization problem. Since the relationship among the variables is difficult to fully include in the first-stage traditional model, we develop a two-stage explainable AI solution for this localization problem. The two-stage solution is actually a comprehensive consideration of the relationship between variables. The solution can continue to use the constraints unused in the firststage during the second-stage, thereby improving the performance of the solution. Therefore, the two-stage solution has stronger robustness compared to the closed-form solution. Experimental results show that the performance of both the two-stage solution and the traditional solution will be affected by numerical changes in unknown parameters. However, the two-stage solution performs better than the traditional solution, especially with a small number of mobile transceivers and sensors or in the presence of high noise. Furthermore,we have also verified the feasibility of the proposed explainable-AI-based two-stage solution.

关键词： explainable AI object localization semidefinite relaxation mobile transceiver two-stage solution closed-form solution

来源：评论

学校读者我要写书评

暂无评论

HOTS3D: Hyper-Spherical Optimal Transport for Semantic Alignment of Text-to-3D Generation

arXiv

引用

arXiv 2024年

作者： Li, Zezeng Wang, Weimin Li, Wenhai Lei, Na Gu, Xianfeng International Information and Software Institute Dalian University of Technology Dalian116620 China School of Software Dalian University of Technology Dalian116620 China Department of Computer Science and Applied Mathematics State University of New York at Stony Brook Stony BrookNY11794-2424 United States

Recent CLIP-guided 3D generation methods have achieved promising results but struggle with generating faithful 3D shapes that conform with input text due to the gap between text and image embeddings. To this end, this paper proposes HOTS3D which makes the first attempt to effectively bridge this gap by aligning text features to the image features with spherical optimal transport (SOT). However, in high-dimensional situations, solving the SOT remains a challenge. To obtain the SOT map for high-dimensional features obtained from CLIP encoding of two modalities, we mathematically formulate and derive the solution based on Villani's theorem, which can directly align two hyper-sphere distributions without manifold exponential maps. Furthermore, we implement it by leveraging input convex neural networks (ICNNs) for the optimal Kantorovich potential. With the optimally mapped features, a diffusion-based generator and a Nerf-based decoder are subsequently utilized to transform them into 3D shapes. Extensive qualitative and qualitative comparisons with state-of-the-arts demonstrate the superiority of the proposed HOTS3D for 3D shape generation, especially on the consistency with text semantics. The code will be publicly available. Copyright © 2024, The Authors. All rights reserved.

关键词： Spheres

来源：评论

学校读者我要写书评

暂无评论

Attribute-Based Data Sharing Scheme with Flexible Search Functionality for Cloud-Assisted Autonomous Transportation System

引用

IEEE Transactions on Industrial Informatics 2023年第11期19卷 10977-10986页

作者： Xiong, Hu Wang, Hanxiao Meng, Weizhi Yeh, Kuo-Hui University of Electronic Science and Technology of China School of Information and Software Engineering Network and Data Security Key Laboratory of Sichuan Province Chengdu610054 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610025 China Technical University of Denmark Department of Applied Mathematics and Computer Science Kongens Lyngby2800 Denmark National Dong Hwa University Department of Information Management Hualien97401 Taiwan National Sun Yat-sen University Department of Computer Science and Engineering Kaohsiung804201 Taiwan

The existing group public key encryption with equality test schemes could only support one-to-one data sharing and are not suitable for cloud-assisted autonomous transportation systems, which demand one-to-many data sharing. To tackle this problem efficiently, in this article, we put forward the group-attribute-based encryption with equality test (G-ABEET) scheme. The presented G-ABEET allows sensors equipped in vehicles to encrypt traffic data with an expressive access policy before sharing it. Only users with attributes required by the access policy ought to access the shared ciphertexts, thus achieving selective one-to-many data sharing. Meanwhile, the authorized cloud server could provide group users with equality tests over the ciphertexts, realizing ciphertext search ability. Furthermore, with the group mechanism, the G-ABEET scheme could resist offline message recovery attacks. Besides, in the standard model, we give rigorous security proof of the G-ABEET construction. The feasibility and efficiency of G-ABEET are demonstrated by experimental simulations. © 2005-2012 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A Crossover Algebra for Solving Minimum Spanning Tree in Network Design with Diameter Constraints

A Crossover Algebra for Solving Minimum Spanning Tree in Net...

引用

2021 International Conference on Cloud Computer, IoT and Intelligence System, CCIIS 2021

作者： Wang, Ziyi Shi, Kai Qiao, Fuqiang Li, Huanran School of Computer Science and Engineering Tianjin University of Technology China College of Software and Communications Tianjin Sino-German University of Applied Sciences Tianjin China

The minimum spanning tree problem with diameter constraint is an important problem for many applications such as network design and reliability. The diameter constraint makes it be different from the common minimum spanning tree problem, it is difficult to get the optimal solution, even the feasible solution can not be obtained by the traditional method. To address this problem, in this paper, a new crossover algebra is designed to ensure that the crossover tree still satisfies the diameter constraint. During the crossover process, structure of the subtree will be retained, thus avoiding the problem that the new generated tree is not a feasible solution. Experimental results show the effectiveness of the improved algorithm. © Published under licence by IOP Publishing Ltd.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Vacancy-Type Defects in Thin HfO2 Layers Probed by Monoenergetic Positron Beams 30

Vacancy-Type Defects in Thin HfO2 Layers Probed by Monoenerg...

引用

30th International Symposium on Semiconductor Manufacturing, ISSM 2024

作者： Uedono, Akira Kawakami, Kazuya Kuribara, Tatsunori Hasunuma, Ryu Harashima, Yosuke Shigeta, Yasuteru Ni, Zeyuan Yan, Ruolin Nakamura, Hideo Notake, Akira Moriya, Tsuyoshi Michishio, Koji Ishibashi, Shoji University of Tsukuba Faculty of Pure and Applied Science Ibaraki Tsukuba305-8573 Japan Nara Institute of Science and Technology Graduate School of Science and Technology Nara Ikoma630-0192 Japan Tokyo Electron Technology Solutions Ltd. S-Technology Development Center Yamanashi Nirasaki407-0192 Japan Tokyo Electron Technology Solutions Ltd. Development Department 1 Yamanashi Nirasaki407-0192 Japan Tokyo Electron Ltd. Digital Design Center Hokkaido Sapporo060-0003 Japan Tokyo Electron Technology Solutions Ltd. Software and Data Engineering Division Yamanashi Nirasaki407-0192 Japan National Institute of Advanced Industrial Science and Technology Research Institute for Measurement and Analytical Instrumentation Ibaraki Tsukuba305-8568 Japan National Institute of Advanced Industrial Science and Technology Research Center for Computational Design of Advanced Functional Materials Ibaraki Tsukuba305-8568 Japan

ISBN: (纸本)9798331510589

Behaviors of vacancies during the amorphous-to-crystalline transition of thin HfO2 layers were studied by monoenergetic positron beams. The HfO2 layers with 430 nm thickness were fabricated on TiN/Si templates by atomic layer deposition technique. The major vacancy-type defects in the layers were identified as (i) Hf vacancies (VHf) coupled with oxygen vacancies (VOs) and (ii) vacancy clusters. After annealing at 500°C, the concentration of vacancy clusters increased, which was attributed to the agglomeration of intrinsic open spaces in the amorphous phase upon the phase transition from amorphous to crystalline phases. The phase transition started near the interface between the HfO2 layer and bottom electrodes (TiN). After the crystallization, the concentration of vacancy clusters decreased as the annealing temperature increased. © 2024 IEEE.

关键词： Positron annihilation

来源：评论

学校读者我要写书评

暂无评论

Moreau Envelope for Nonconvex Bi-Level Optimization: A Single-loop and Hessian-free Solution Strategy

arXiv

引用

arXiv 2024年

作者： Liu, Risheng Liu, Zhu Yao, Wei Zeng, Shangzhi Zhang, Jin School of Software Technology Dalian University of Technology Dalian China Pazhou Lab Guangzhou China National Center for Applied Mathematics Shenzhen Southern University of Science and Technology Shenzhen China Department of Mathematics Southern University of Science and Technology Shenzhen China Department of Mathematics and Statistics University of Victoria VictoriaBC Canada

This work focuses on addressing two major challenges in the context of large-scale nonconvex Bi-Level Optimization (BLO) problems, which are increasingly applied in machine learning due to their ability to model nested structures. These challenges involve ensuring computational efficiency and providing theoretical guarantees. While recent advances in scalable BLO algorithms have primarily relied on lower-level convexity simplification, our work specifically tackles large-scale BLO problems involving nonconvexity in both the upper and lower levels. We simultaneously address computational and theoretical challenges by introducing an innovative single-loop gradient-based algorithm, utilizing the Moreau envelope-based reformulation, and providing non-asymptotic convergence analysis for general nonconvex BLO problems. Notably, our algorithm relies solely on first-order gradient information, enhancing its practicality and efficiency, especially for large-scale BLO learning tasks. We validate our approach’s effectiveness through experiments on various synthetic problems, two typical hyper-parameter learning tasks, and a real-world neural architecture search application, collectively demonstrating its superior performance. © 2024, CC BY-NC-SA.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Modelling infectious disease transmission dynamics in conference environments: An individual-based approach

arXiv

引用

arXiv 2024年

作者： Liu, Xue Deng, Yue Huang, Jingying Zhang, Yuhong Lei, Jinzhi School of Mathematical Sciences Tiangong University Tianjin300387 China School of Software Tiangong University Tianjin300387 China School of Computer Science and Technology Tiangong University Tianjin300387 China Center for Applied Mathematics Tiangong University Tianjin300387 China

The global public health landscape is perpetually challenged by the looming threat of infectious diseases. Central to addressing this concern is the imperative to prevent and manage disease transmission during pandemics, particularly in unique settings. This study addresses the transmission dynamics of infectious diseases within conference venues, presenting a computational model designed to simulate transmission processes within a condensed timeframe (one day), beginning with sporadic cases. Our model intricately captures the activities of individual attendees within the conference venue, encompassing meetings, rest intervals, and meal breaks. While meetings entail proximity seating, rest and lunch periods allow attendees to interact with diverse individuals. Moreover, the restroom environment poses an additional avenue for potential infection transmission. Employing an individual-based model, we meticulously replicated the transmission dynamics of infectious diseases, with a specific emphasis on close-contact interactions between infected and susceptible individuals. Through comprehensive analysis of model simulations, we elucidated the intricacies of disease transmission dynamics within conference settings and assessed the efficacy of control strategies to curb disease dissemination. Ultimately, our study proffers a numerical framework for assessing the risk of infectious disease transmission during short-duration conferences, furnishing conference organizers with valuable insights to inform the implementation of targeted prevention and control measures. © 2024, CC BY-NC-SA.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

Chebyshev Polynomial Broad Learning System

Chebyshev Polynomial Broad Learning System

引用

2021 International Conference on Information, Cybernetics, and Computational Social Systems, ICCSS 2021

作者： Feng, Shuang Wang, Bingshu Philip Chen, C.L. Beijing Normal University School of Applied Mathematics Zhuhai China Northwestern Polytechnical University School of Software Suzhou China South China University of Technology School of Computer Science and Engineering Guangzhou China

ISBN: (纸本)9781665402453

The broad learning system (BLS) has been attracting more and more attention due to its excellent property in the field of machine learning. A great deal of variants and hybrid structures of BLS have also been designed and developed for better performance in some specialized tasks. In this paper, the Chebyshev polynomials are introduced into the BLS to take advantage of their powerful approximation capability, where the feature windows are replaced by a set of Chebyshev polynomials. This new variant, named Chebyshev polynomial BLS (CPBLS), has a light structure with a reduction in computational complexity since the sparse autoencoder is removed. Instead, the dimension of each input sample is expended by n + 1 Chebyshev polynomials, mapping the original feature into a new feature space with higher dimension, which helps to classify the patterns in training. The proposed CPBLS is evaluated by some popular datasets from UCI and KEEL repositories, and it outperforms some representative neural networks and neuro-fuzzy models in terms of classification accuracy. The CPBLS also show some advantages over the recent developed compact fuzzy BLS (CFBLS) which indicates its great potential in future research and real-world applications. © 2021 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Spectral Extrema of Bipartite Graphs: Forbidden an Even Cycle of Specified Length

SSRN

引用

SSRN 2024年

作者： Feng, Zhimin Luo, Xiaobing Wei, Wei School of Mathematics and Statistics Xinyang Normal University Xinyang China School of Computer Technology and Software Engineering Wuhan Polytechnic Wuhan China Center of Intelligent Computing and Applied Statistics School of Mathematics Physics and Statistics Shanghai University of Engineering Science Shanghai201620 China

A graph is called $H$-free if the graph has no subgraph being isomorphic to $H$. The classical Tur\'an problem aims to determine the maximum size of an $H$-free graph with given order. In 2010, Nikiforov introduced the spectral Tur\'an-type problem: Determine the maximum spectral radius of an $H$-free graph with given order. He also presented the following conjecture: For sufficiently large $\nu$ and for $k\geq 2$, the graph $K_k\vee (\overline{K_{\nu-k-2}}\cup K_2)$ is the unique $\nu$-vertex $\{C_{2k+1}, C_{2k+2}\}$-free graph having the largest spectral radius and $K_k\vee \overline{K_{\nu-k}}$ is the unique $\nu$-vertex $C_{2k+2}$-free graph having the largest spectral radius. Recently, this conjecture was confirmed by Cioab\u{a}, Desai and Tait. In this contribution, we resolve the Nikiforov's even cycle conjecture for bipartite graphs. Let $\nu$ and $k$ be two integers satisfying $\nu\geq 1$ if $k=1,$ and $\nu \geq \left(\frac{7^22^{24}k\left(2k-1\right)^2(k+1)^{20}} {(2k-3)^2}\right)^{\frac{k+1}{k-1}}$ if $k\geq 2$. Then we show that the complete bipartite graph $K_{k,\nu-k}$ uniquely maximizes the spectral radius over the set of $C_{2k+2}$-free bipartite graphs of order $\nu$. © 2024, The Authors. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：