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

22nd International Symposium on Parallel and Distributed Computing, ISPDC 2023

作者： Andreou, Andreas Mavromoustakis, Constandinos X. Batalla, Jordi Mongay Dobre, Ciprian Markakis, Evangelos Mastorakis, George University of Nicosia University of Nicosia Research Foundation Departement of Computer Science Nicosia Cyprus Warsaw University of Technology Warsaw Poland University Politehnica of Bucharest National Institute for Research and Development in Informatics Automatic Control and Computers Bucharest Romania Hellenic Mediterranean University Department of Electrical and Computer Engineering Heraklion Greece Hellenic Mediterranean University Department of Management Science and Technology Agios Nikolaos Greece

ISBN: (纸本)9798350341270

Smart spaces are a rapidly emerging concept in technology. They result from the convergence of various novel technologies, such as the Internet of Things, Machine Learning and Artificial Intelligence, which allow for greater levels of automation and control within physical environments. The devices which are connected to the IoT network are equipped with sensors to acquire and exchange data. As a result, the IoT has transformed how we live, work, and play. However, the deployment in smart spaces is not always the best due to the issues arising from network node positioning. Therefore, we are investigating solutions to this problem with a novel approach which utilises Voronoi diagrams in conjunction with the algorithmic genetic technique. First, the initial positions of the IoT nodes will be determined by simulating a homogeneous Poisson point process in the smart space environment. Then, after dividing the area into the Voronoi cells, the genetic algorithm will optimise the position towards achieving full network coverage within the smart space. Experimental results prove the 100% network coverage within the specified area. © 2023 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Contracting Skeletal Kinematic Embeddings for Anomaly Detection

SSRN

引用

SSRN 2023年

作者： Flaborea, Alessandro D’Amely di Melendugno, Guido Maria D’Arrigo, Stefano Sterpa, Marco Aurelio Sampieri, Alessio Galasso, Fabio Department of Computer Science Sapienza University of Rome Italy Department of Computer Control and Management Engineering Sapienza University of Rome Italy Department of Earth Sciences and Forecasting Research Center Prevention and Control of Geological Risks

Detecting the anomaly of human behavior is paramount to timely recognizing endangering situations, such as street fights or elderly falls. However, anomaly detection is complex, since anomalous events are rare and because it is an open set recognition task, i.e., what is anomalous at inference has not been observed at training. We propose COSKAD, a novel model which encodes skeletal human motion by an efficient graph convolutional network and learns to COntract SKeletal kinematic embeddings onto a latent hypersphere of minimum volume for Anomaly Detection. We propose and analyze three latent space designs for COSKAD: the commonly-adopted Euclidean, and the new spherical-radial and hyperbolic volumes. All three variants outperform the state-of-the-art, including video-based techniques, on the ShangaiTechCampus, the Avenue, and on the most recent UBnormal dataset, for which we contribute novel skeleton annotations and the selection of human-related *** source code and dataset will be released upon acceptance. © 2023, The Authors. All rights reserved.

关键词： Kinematics

来源：评论

学校读者我要写书评

暂无评论

FISS GAN:A Generative Adversarial Network for Foggy Image Semantic Segmentation

引用

IEEE/CAA Journal of Automatica Sinica 2021年第8期8卷 1428-1439页

作者： Kunhua Liu Zihao Ye Hongyan Guo Dongpu Cao Long Chen Fei-Yue Wang School of Computer Science and Engineering Sun Yat-sen UniversityGuangzhou 510006China State Key Laboratory of Automotive Simulation and Control and the Department of Control Science and Engineering Jilin University(Campus Nanling)Changchun 130025China Mechanical and Mechatronics Engineering Department at the University of Waterloo 200 University Avenue West WaterlooON N2L 3G1Canada State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190 Institute of Systems Engineering Macao University of Science and TechnologyMacao 999078China

Because pixel values of foggy images are irregularly higher than those of images captured in normal weather(clear images),it is difficult to extract and express their *** method has previously been developed to directly explore the relationship between foggy images and semantic segmentation *** investigated this relationship and propose a generative adversarial network(GAN)for foggy image semantic segmentation(FISS GAN),which contains two parts:an edge GAN and a semantic segmentation *** edge GAN is designed to generate edge information from foggy images to provide auxiliary information to the semantic segmentation *** semantic segmentation GAN is designed to extract and express the texture of foggy images and generate semantic segmentation *** on foggy cityscapes datasets and foggy driving datasets indicated that FISS GAN achieved state-of-the-art performance.

关键词： Edge GAN foggy images foggy image semantic segmentation GAN semantic segmentation

来源：评论

学校读者我要写书评

暂无评论

Distributed Sequential Receding Horizon control of Multi-Agent Systems Under Recurring Signal Temporal Logic

Distributed Sequential Receding Horizon Control of Multi-Age...

引用

European control Conference (ECC)

作者： Eleftherios E. Vlahakis Lars Lindemann Dimos V. Dimarogonas Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Thomas Lord Department of Computer Science Viterbi School of Engineering University of Southern California Los Angeles CA USA

ISBN: (数字)9783907144107

ISBN: (纸本)9798331540920

We consider the synthesis problem of a multi-agent system under signal temporal logic (STL) specifications representing bounded-time tasks that need to be satisfied recurrently over an infinite horizon. Motivated by the limited approaches to handling recurring STL systematically, we tackle the infinite-horizon control problem with a receding horizon scheme equipped with additional STL constraints that introduce minimal complexity and a backward-reachability-based terminal condition that is straightforward to construct and ensures recursive feasibility. Subsequently, we decompose the global receding horizon optimization problem into agent-level programs the objectives of which are to minimize local cost functions subject to local and joint STL constraints. We propose a scheduling policy that allows individual agents to sequentially optimize their control actions while maintaining recursive feasibility. This results in a distributed strategy that can operate online as a model predictive controller. Last, we illustrate the effectiveness of our method via a multi-agent system example assigned a surveillance task.

关键词： Surveillance Decentralized control Europe Predictive models Fasteners Cost function Infinite horizon

来源：评论

学校读者我要写书评

暂无评论

Geometric Reachability for Attitude control Systems via Contraction Theory

arXiv

引用

arXiv 2025年

作者： Xu, Chencheng Jafarpour, Saber Zhao, Chengcheng Shi, Zhiguo Chen, Jiming College of Information Science and Electronic Engineering Zhejiang University Hangzhou China Department of Electrical Computer and Energy Engineering University of Colorado Boulder BoulderCO United States College of Control Science and Engineering Zhejiang University Hangzhou China

In this paper, we present a geometric framework for the reachability analysis of attitude control systems. We model the attitude dynamics on the product manifold SO(3) × 3 and introduce a novel parametrized family of Riemannian metrics on this space. Using contraction theory on manifolds, we establish reliable upper bounds on the Riemannian distance between nearby trajectories of the attitude control systems. By combining these trajectory bounds with numerical simulations, we provide a simulation-based algorithm to over-approximate the reachable sets of attitude systems. We show that the search for optimal metrics for distance bounds can be efficiently performed using semidefinite programming. Additionally, we introduce a practical and effective representation of these over-approximations on manifolds, enabling their integration with existing Euclidean tools and software. Numerical experiments validate the effectiveness of the proposed approach. Copyright © 2025, The Authors. All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret

arXiv

引用

arXiv 2024年

作者： Hua, Youqing Liu, Shuai Hong, Yiguang Johansson, Karl Henrik Wang, Guangchen School of Control Science and Engineering Shandong University Jinan China Nanyang Technological University Singapore Department of Control Science and Engineering Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden

This paper considers the distributed online bandit optimization problem with nonconvex loss functions over a time-varying digraph. This problem can be viewed as a repeated game between a group of online players and an adversary. At each round, each player selects a decision from the constraint set, and then the adversary assigns an arbitrary, possibly nonconvex, loss function to this player. Only the loss value at the current round, rather than the entire loss function or any other information (e.g. gradient), is privately revealed to the player. Players aim to minimize a sequence of global loss functions, which are the sum of local losses. We observe that traditional multi-point bandit algorithms are unsuitable for online optimization, where the data for the loss function are not all a priori, while the one-point bandit algorithms suffer from poor regret guarantees. To address these issues, we propose a novel one-point residual feedback distributed online algorithm. This algorithm estimates the gradient using residuals from two points, effectively reducing the regret bound while maintaining O(1) sampling complexity per iteration. We employ a rigorous metric, dynamic regret, to evaluate the algorithm's performance. By appropriately selecting the step size and smoothing parameters, we demonstrate that the expected dynamic regret of our algorithm is comparable to existing algorithms that use two-point feedback, provided the deviation in the objective function sequence and the path length of the minimization grows sublinearly. Finally, we validate the effectiveness of the proposed algorithm through numerical simulations. Copyright © 2024, The Authors. All rights reserved.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Towards an Integrated Framework for Fugitive Methane Source Localization and Monitoring in a Wireless Sensor Network

Towards an Integrated Framework for Fugitive Methane Source ...

引用

IEEE SSD International Multi-Conference on Systems, Signals and Devices

作者： Amira Al Jawhari Yasmine Souissi Jawhar Ghommam Yassine Jamoussi Faisal Mnif Department of Electrical and Computer Engineering College of Engineering Sultan Qaboos University Department of Engineering GUtech University Muscat Oman Laboratory of Control Energy Management (Cem-Lab) ENIS Tunisa Departement of Computer Science College of Science SQU

Gas leaks are the main cause of industrial fires and accidents. These cause countless fatalities, equipment damage, and other severe environmental effects. In this paper, we provide a framework for the monitoring and detection of methane leakage using a diffusion model based on the gas diffusion theory. Given that centralized Least Square methods are not efficient and robust as they require the gathering and processing of large-scale measurements on a central node. We propose a detection technique which makes use of the distributed (Non-linear) least squares method to overcome this problem. Then, a network of connected methane sensors is used to detect gas leaks. In order to estimate the parameters of the diffusive model for the gas leakage on each sensor node, a distributed recursive estimator of the consensus plus an innovation type technique is used. The characteristics being estimated include the gas source’s distance, which will be effectively triangulated to determine the source’s precise location. The targeted location is subsequently estimated using a location dispersed algorithm-based LS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Evolution and Effectiveness of Loss Functions in Generative Adversarial Networks

引用

China Communications 2021年第10期18卷 45-76页

作者： Ali Syed Saqlain Fang Fang Tanvir Ahmad Liyun Wang Zain-ul Abidin School of Control and Computer Engineering North China Electric Power UniversityBeijing 102206China Department of Computer Science Portland State UniversityPortland 97207U.S. School of Information and Communication Engineering South West Jiaotong UniversityChengdu 610031China

Recently,the evolution of Generative Adversarial Networks(GANs)has embarked on a journey of revolutionizing the field of artificial and computational *** improve the generating ability of GANs,various loss functions are introduced to measure the degree of similarity between the samples generated by the generator and the real data samples,and the effectiveness of the loss functions in improving the generating ability of *** this paper,we present a detailed survey for the loss functions used in GANs,and provide a critical analysis on the pros and cons of these loss ***,the basic theory of GANs along with the training mechanism are ***,the most commonly used loss functions in GANs are introduced and ***,the experimental analyses and comparison of these loss functions are presented in different GAN ***,several suggestions on choosing suitable loss functions for image synthesis tasks are given.

关键词： loss functions deep learning machine learning unsupervised learning generative adversarial networks(GANs) image synthesis

来源：评论

学校读者我要写书评

暂无评论

On the Approximation of the Quotient of Two Gaussian Densities for Multiple-Model Smoothing 26

On the Approximation of the Quotient of Two Gaussian Densiti...

引用

26th International Conference on Information Fusion, FUSION 2023

作者： Liu, Yi Li, Xi Yang, Le Mihaylova, Lyudmila Xue, Yanbo University of Canterbury Department of Electrical and Computer Engineering Christchurch New Zealand National University of Defense Technology State Key Lab of Complex Electromagnetic Environment Effects on Electronics and Information Systems Changsha China University of Sheffield Department of Automatic Control and System Engineering Sheffield United Kingdom Career Science Lab Beijing China

ISBN: (纸本)9798890344854

The quotient of two multivariate Gaussian densities can be written as an unnormalized Gaussian density, which has been applied in some recently developed multiple-model fixed-interval smoothing algorithms. However, this expression is invalid if instead of being positive definite, the covariance of the unnormalized Gaussian density is indefinite (i.e., it has both positive and negative eigenvalues) or undefined (i.e., computing it requires inverting a singular matrix). This paper considers approximating the quotient of two Gaussian densities in this case using two different approaches to mitigate the caused numerical problems. The first approach directly replaces the indefinite covariance of the unnormalized Gaussian density with a positive definite matrix nearest to it. The second approach computes the approximation through solving, using the natural gradient, an optimization problem with a Kullback-Leibler divergence-based cost function. This paper illustrates the application of the theoretical results by incorporating them into an existing smoothing method for jump Markov systems and utilizing the obtained smoothers to track a maneuvering target. © 2023 International Society of Information Fusion.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Applying System Thinking to Learn from Accident of Modern Automatic control Systems

引用

Chinese Journal of Electronics 2025年第2期23卷 409-414页

作者： Ru Niu Yuan Cao Xiaocheng Ge Tao Tang State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing China School of Electronics and Information Engineering National Engineering Research Center of Rail Transportation Operation and Control System Beijing Jiaotong University Beijing China Department of Computer Science University of York York UK

Modern societies increasingly rely on automatic control systems. These systems are hardly pure technical systems; instead they are complex socio-technical systems, which consist of technical elements and social components. It is necessary to have a systematic approach to analyze these systems because it is growing evidence that accidents from these systems usually have complex causal factors which form an interconnected network of events, rather than a simple cause-effect chain. We take railway Train control systems (TCS) as an example to demonstrate the importance of the socio-technical approach to analyze the system. The paper presents an investigation of recent high-speed railway accident by applying STAMP - one of the most notable socio-technical system analysis techniques, outlines improvements to the system which could avoid similar accidents in the future. We also provide our valuable feedback for the use of STAMP.

关键词： Sociotechnical systems Analytical models Systematics Railway accidents Transportation Medical services Rail transportation Systems thinking Research and development Accidents

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：