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

arXiv 2024年

作者： Adams, Steven Patanè, Andrea Lahijanian, Morteza Laurenti, Luca Delft Center for Systems and Control Technical Universiy of Delft Delft2628 CD Netherlands School of Computer Science and Statistics Trinity College Dublin Dublin 2 Ireland Department of Aerospace Engineering Sciences and Computer Science University of Colorado Boulder BoulderCO80303 United States

Infinitely wide or deep neural networks (NNs) with independent and identically distributed (i.i.d.) parameters have been shown to be equivalent to Gaussian processes. Because of the favorable properties of Gaussian processes, this equivalence is commonly employed to analyze neural networks and has led to various breakthroughs over the years. However, neural networks and Gaussian processes are equivalent only in the limit;in the finite case there are currently no methods available to approximate a trained neural network with a Gaussian model with bounds on the approximation error. In this work, we present an algorithmic framework to approximate a neural network of finite width and depth, and with not necessarily i.i.d. parameters, with a mixture of Gaussian processes with error bounds on the approximation error. In particular, we consider the Wasserstein distance to quantify the closeness between probabilistic models and, by relying on tools from optimal transport and Gaussian processes, we iteratively approximate the output distribution of each layer of the neural network as a mixture of Gaussian processes. Crucially, for any NN and ǫ > 0 our approach is able to return a mixture of Gaussian processes that is ǫ-close to the NN at a finite set of input points. Furthermore, we rely on the differentiability of the resulting error bound to show how our approach can be employed to tune the parameters of a NN to mimic the functional behavior of a given Gaussian process, e.g., for prior selection in the context of Bayesian inference. We empirically investigate the effectiveness of our results on both regression and classification problems with various neural network architectures. Our experiments highlight how our results can represent an important step towards understanding neural network predictions and formally quantifying their uncertainty. © 2024, CC BY.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Knowledge Graph Completion with Low-Dimensional Gated Hierarchical Hyperbolic Embedding

SSRN

引用

SSRN 2024年

作者： Fang, Yan Liu, Xiaodong Lu, Wei Pedrycz, Witold Lang, Qi Yang, Jianhua School of Control Science and Engineering Faculty of Electronic Information and Electrical Engineering Dalian University of Technology Dalian116024 China Department of Electrical and Computer Engineering University of Alberta EdmontonT6R 2V4 AB Canada Systems Research Institute Polish Academy of Sciences Warsaw00-901 Poland Department of Electrical and Computer Engineering Faculty of Engineering King Abdulaziz University Jeddah21589 Saudi Arabia School of Computer Science and Information Technology Northeast Normal University Changchun130117 China

Knowledge Graph Embedding aims to advance the learning performance of knowledge graphs by deliberating the complexity of hierarchical data structures in a finite-dimensional space. Most traditional Euclidean models struggle to accurately describe and navigate the intricate hierarchical relationships between nodes. The hyperbolic embedding methods, particularly in conjunction with graph neural networks, offer promise in effectively modeling complex hierarchies in a limited-dimensional space. These methods can accommodate more information about nodes under the same conditions but are also more susceptible to interference from complex neighborhood features. This paper introduces HyperGatE, which novelty combines a hyperbolic graph hierarchical neighbor structure based on a gated filter and a hyperbolic isometric rotation model for knowledge graph completion. By analyzing the hierarchical structure of the knowledge base and using a gated mechanism to form multi-layer embedding networks of entity-relational paths, the gated filter selects diverse uneven multi-hop relations within the entity neighborhood and measures them through graph attention networks. Furthermore, the simplified hyperbolic isometric model allows for uncovering hierarchical structures in the data. HyperGatE experimentally surpasses the state-of-the-art Euclidean and hyperbolic space models in high and low dimensions across four well-known data, namely WN18RR, FB15k-237, NELL-995, and Kinship. © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Visual-infrared image monitoring system for moving object detection, classification and tracking using deep learning technique

引用

AIP Conference Proceedings 2023年第1期2651卷

作者： Maad Issa Al Tameemi Bashra Kadhim Oleiwi 1Department of Computer Engineering University of Baghdad Baghdad Iraq 2Department of Control and Systems Engineering University of Technology-Iraq Baghdad Iraq

In this work, the issue of moving object detection, classification, and tracking in both visual-infrared images and video streams is considered. The proposed system utilizing deep learning-based You Look Only Once -version3 (YOLOv3) algorithm as multilayers of CNN model, OpenCV, and CAMEL dataset and collected dataset as video sequence of a visual-infrared dataset. The proposed object detector system pre-trained on the dataset for streaming videos and different sizes and types of images as visual_ thermal as RGB images of different object classes and carried out by Python codes. The first part of the proposed system is to make the object or person detection and surround it by rectangle box, the center of the detected person is then specified in the second part, finally, calculate the relative accuracy of detected person and added it to the rectangle box. The obtained results proved the success of the proposed system in achieving objects detection, classification, and tracking within visual-infrared surveillance scenarios and gave satisfactory results with high accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Generalizable 3D Diffusion Framework for Low-Dose and Few-View Cardiac SPECT

arXiv

引用

arXiv 2024年

作者： Xie, Huidong Gan, Weijie Ji, Wei Chen, Xiongchao Alashi, Alaa Thorn, Stephanie L. Zhou, Bo Liu, Qiong Xia, Menghua Guo, Xueqi Liu, Yi-Hwa An, Hongyu Kamilov, Ulugbek S. Wang, Ge Sinusas, Albert J. Liu, Chi 1Department of Biomedical Engineering Yale University USA. 2Department of Computer Science Washington University in St. Louis USA. 3Department of Radiology and Biomedical Imaging Yale University USA. 5Department of Radiology Washington University in St. Louis USA. 6Department of Electrical & Systems Engineering Washington University in St. Louis USA. 9Department of Biomedical Engineering Rensselaer Polytechnic Institute USA.

Myocardial perfusion imaging using SPECT is widely utilized to diagnose coronary artery diseases, but image quality can be negatively affected in low-dose and few-view acquisition settings. Although various deep learning methods have been introduced to improve image quality from low-dose or few-view SPECT data, previous approaches often fail to generalize across different acquisition settings, limiting their applicability in reality. This work introduced DiffSPECT-3D, a diffusion framework for 3D cardiac SPECT imaging that effectively adapts to different acquisition settings without requiring further network re-training or fine-tuning. Using both image and projection data, a consistency strategy is proposed to ensure that diffusion sampling at each step aligns with the low-dose/few-view projection measurements, the image data, and the scanner geometry, thus enabling generalization to different low-dose/few-view settings. Incorporating anatomical spatial information from CT and total variation constraint, we proposed a 2.5D conditional strategy to allow the DiffSPECT-3D to observe 3D contextual information from the entire image volume, addressing the 3D memory/computational issues in diffusion model. We extensively evaluated the proposed method on 1,325 clinical 99mTc tetrofosmin stress/rest studies from 795 patients. Each study was reconstructed into 5 different low-count levels and 5 different projection few-view levels for model evaluations, ranging from 1% to 50% and from 1 view to 9 view, respectively. Validated against cardiac catheterization results and diagnostic comments from nuclear cardiologists, the presented results show the potential to achieve low-dose and few-view SPECT imaging without compromising clinical performance. Additionally, DiffSPECT-3D could be directly applied to full-dose SPECT images to further improve image quality, especially in a low-dose stress-first cardiac SPECT imaging protocol. © 2024, CC BY.

关键词： Heart

来源：评论

学校读者我要写书评

暂无评论

Commutation overshoots based on a novel model for series thyristors during the turn-off process

引用

High Voltage 2020年第5期5卷 501-510页

作者： Yingjie Tang Zheng Xu Huangqing Xiao Bo Yue Xuan Li College of Electric Engineering Zhejiang UniversityHangzhouPeople's Republic of China 2Department of Electrical Engineering and Computer ScienceThe University of Tennessee KnoxvilleUSA 3State Grid Economic and Technology Research InstituteBeijingPeople's Republic of China

The commutation overshoot is an important reference index for the insulation coordination of the converter station as well as the thyristor voltage *** the dispersity of reverse recovery charges of series thyristors may affect commutation overshoots,especially those at the thyristor level,little literature has tried to analyse it in ***,this study compares the turn-off models of independent thyristor and elaborates their applicability to series ***,a novel model for series thyristors during the turn-off process is proposed,based on which the turn-off model of converter valve is also ***,the validity and efficiency of the proposed model are discussed by simulations and it is applied to the analysis of commutation *** analysis shows that though the average model can be used to estimate the valve voltage stresses,it may lead to large errors in the thyristor voltage *** selecting the 1:n−1 distribution as the distribution mode of reverse recovery charge in series thyristors will result in very conservative results.

关键词： series process distribution

来源：评论

学校读者我要写书评

暂无评论

A Multi-Player Potential Game Approach for Sensor Network Localization with Noisy Measurements

arXiv

引用

arXiv 2024年

作者： Xu, Gehui Chen, Guanpu Fidan, Baris Hong, Yiguang Qi, Hongsheng Parisini, Thomas Johansson, Karl H. The Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden The Department of Mechanical and Mechatronics Engineering University of Waterloo WaterlooONN2L 3G1 Canada Department of Control Science and Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing China The Department of Electrical and Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom The Department of Engineering and Architecture University of Trieste Trieste34127 Italy

Sensor network localization (SNL) is a challenging problem due to its inherent non-convexity and the effects of noise in inter-node ranging measurements and anchor node position. We formulate a non-convex SNL problem as a multi-player non-convex potential game and investigate the existence and uniqueness of a Nash equilibrium (NE) in both the ideal setting without measurement noise and the practical setting with measurement noise. We first show that the NE exists and is unique in the noiseless case, and corresponds to the precise network localization. Then, we study the SNL for the case with errors affecting the anchor node position and the inter-node distance measurements. Specifically, we establish that in case these errors are sufficiently small, the NE exists and is unique. It is shown that the NE is an approximate solution to the SNL problem, and that the position errors can be quantified accordingly. Based on these findings, we apply the results to case studies involving only inter-node distance measurement errors and only anchor position information inaccuracies. Copyright © 2024, The Authors. All rights reserved.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Global solution to sensor network localization: A non-convex potential game approach and its distributed implementation

arXiv

引用

arXiv 2024年

作者： Xu, Gehui Chen, Guanpu Hong, Yiguang Fidan, Baris Parisini, Thomas Johansson, Karl H. Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing100190 China The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures StockholmSE-10044 Sweden Department of Control Science and Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China The Department of Mechanical and Mechatronics Engineering University of Waterloo WaterlooONN2L 3G1 Canada The Department of Electrical and Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom The Department of Engineering and Architecture University of Trieste Trieste34127 Italy

Consider a sensor network consisting of both anchor and non-anchor nodes. We address the following sensor network localization (SNL) problem: given the physical locations of anchor nodes and relative measurements among all nodes, determine the locations of all non-anchor nodes. The solution to the SNL problem is challenging due to its inherent non-convexity. In this paper, the problem takes on the form of a multi-player nonconvex potential game in which canonical duality theory is used to define a complementary dual potential function. After showing the Nash equilibrium (NE) correspondent to the SNL solution, we provide a necessary and sufficient condition for a stationary point to coincide with the NE. An algorithm is proposed_ to reach the NE and shown to have convergence rate O(1/√k). With the aim of reducing the information exchange within a network, a distributed algorithm for NE seeking is implemented and its global convergence analysis is provided. Extensive simulations show the validity and effectiveness of the proposed approach to solve the SNL problem. Copyright © 2024, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

MI3SE: A Multi-User Index-Based Searchable Symmetric Encryption Scheme for Improving Security of Data in Connected Electronic Devices

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Soleymani, Seyed Ahmad Goudarzi, Shidrokh Anisi, Mohammad Hossein Xiao, Pei Mihaylova, Lyudmila Wang, Wenwu University of Sheffield Department of Automatic Control and Systems Engineering Sheffield United Kingdom University of West London School of Computing and Engineering LondonW5 5RF United Kingdom University of Essex School of Computer Science and Electronic Engineering ColchesterCO4 3SQ United Kingdom GuildfordGU2 7XH United Kingdom GuildfordGU2 7XH United Kingdom

In the Industrial Internet of Things (IIoT), outdoor electronic devices serve crucial roles across sectors, providing vital data for decision-making. However, their exposure to open outdoor environments makes them vulnerable to unauthorized access, physical theft, or compromise, endangering both the device and its data. Ensuring the security of outdoor devices and their data is thus critical. This study addresses data security in outdoor IIoT devices by supporting the encryption of all IIoT-related data in device memory. Accessing and retrieving this data requires operations on encrypted data. Hence, we introduce a Searchable Symmetric Encryption (SSE) scheme called MI3SE, which ensures each device's encryption key is unique and valid for a period based on the device's security sensitivity. Moreover, MI3SE meets key security requirements, including confidentiality, integrity, forward secrecy, and backward secrecy. It is specifically designed to mitigate physical compromise and query pattern analysis through a two-keyword query approach and withstand various attacks, as validated by rigorous security analysis. Comparative evaluations against benchmark schemes underscore the efficacy of MI3SE in terms of both security and performance. Moreover, comprehensive non-mathematical security analysis and simulation experiments affirm the enhanced accuracy and efficacy of MI3SE in securing sensitive data stored in outdoor IIoT devices. © 1975-2011 IEEE.

关键词： Data Security IIoT Outdoor Electronic Devices Searchable Symmetric Encryption (SSE)

来源：评论

学校读者我要写书评

暂无评论

Quantized Distributed Nonconvex Optimization Algorithms with Linear Convergence under the Polyak–Lojasiewicz Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Xu, Lei Yi, Xinlei Sun, Jiayue Shi, Yang Johansson, Karl H. Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China University of Victoria Department of Mechanical Engineering VictoriaBCV8W 2Y2 Canada Tongji University Shanghai Institute of Intelligent Science and Technology Shanghai201804 China KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm100 44 Sweden

This paper considers distributed optimization for minimizing the average of local nonconvex cost functions, by using local information exchange over undirected communication networks. To reduce the required communication capacity, we introduce an encoder–decoder scheme. By integrating it with distributed gradient tracking and proportional integral algorithms, respectively, we then propose two quantized distributed nonconvex optimization algorithms. Assuming the global cost function satisfies the Polyak–Lojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that our proposed algorithms linearly converge to a global optimal point. Moreover, we show that a low data rate is sufficient to guarantee linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical examples. © 1963-2012 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Isolated Sign Language Recognition with Depth Cameras

引用

Procedia computer Science 2021年 192卷 2085-2094页

作者： Mariusz Oszust Jakub Krupski Rzeszow University of Technology Department of Computer and Control Engineering W. Pola 2 35-959 Rzeszow Poland

In this paper, an approach to isolated sign language recognition with data provided by a depth camera is presented. In the introduced method, sequences of depth maps of dynamic sign language gestures are divided into smaller regions (cells). Then, statistical information is used to describe the cells. Since gesture executions have different lengths, the dynamic time warping (DTW) technique with the nearest neighbor (NN) rule is often employed for their comparison. However, due to time-consuming computations, the DTW limits the usability of the classifier. Therefore, in this paper, a selection of representative depth maps using statistics for cells is proposed. It is shown that such gesture representation can be successfully employed for isolated sign language recognition with the NN classifier using the city block distance. Furthermore, the NN rule with the DTW and the introduced statistics for cells provides superior gesture recognition performance.

关键词： decision support system sign language recognition depth maps dynamic time warping

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：