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

International Conference on Management of Large-Scale System Development (MLSD)

作者： Vladimir Kulba Viktor Medennikov Laboratory of Modular Data Processing and Control Systems V.A. Trapeznikov Institute of Control Sciences of the Russian Academy of Sciences Moscow Russia Information and Computing Systems Department Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences Moscow Russia

The paper considers a mathematical model for managing a scientific digital ecosystem exemplified by the agriculture case; the model enables assessing the impact science exerts on the regions’ socioeconomic position in order to build an adequate response to the advanced economies’ regime of severe sanctions against Russia. For these purposes, a systemic analysis of the subject identification and classification of ecosystems was conducted to address the critical issue of determining the basic concepts and terms of the country’s digitalization.

关键词：

来源：评论

学校读者我要写书评

暂无评论

EK-Net++: Real-time scene text detection with expand kernel distance and Epoch Adaptive Weight

引用

Expert systems with Applications 2025年 267卷

作者： Zhu, Boyuan Chen, Xi Tang, Quan Chen, C.L. Philip Liu, Fagui Computer Science and Engineering South China University of Technology Guangzhou510006 China Cyberspace Security Research Center Peng Cheng Laboratory Shenzhen518066 China State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100080 China

Recently, scene text detection has received significant attention due to its wide applications. Accurate detection in complex scenes of multiple scales, orientations, and curvature remains a challenge. Component-based methods have emerged as the dominant approach for offering a more flexible way to achieve superior performance. However, Component-based methods employ the Vatti clipping algorithm for multi-instance training to handle the difficulty of arbitrary-shaped text. Yet we identify several bias results from these approaches called the "shrinked kernel" leading to decreased accuracy. Additionally, almost all text detection methods fail to consider the characteristics of different datasets and directly assign fixed loss weights to multi-instances. To address these limitations, we propose a new approach named Expand Kernel Network (EK-Net++), which presents the expand kernel distance map to compensate for the previous deficiency and incorporates three-stage regression to complete integral instance detection. Furthermore, we design the Epoch Adaptive Weight algorithm which dynamically distinguishes the characteristics of different datasets. EK-Net++ not only achieves precise positioning of arbitrary-shaped text but also strikes a balance between performance and speed. Evaluation results show that EK-Net++ attains state-of-the-art or competitive performance compared to other advanced methods, e.g., F-measure of 86.72% at 35.42 FPS on ICDAR 2015, F-measure of 85.83% at 40.13 FPS on CTW1500. © 2024 Elsevier Ltd

关键词： Epoch Adaptive Weight Expand kernel distance Real-time Scene text detection

来源：评论

学校读者我要写书评

暂无评论

CONTINUOUS-TIME IDENTIFICATION OF DYNAMIC STATE-SPACE MODELS BY DEEP SUBSPACE ENCODING

arXiv

引用

arXiv 2022年

作者： Beintema, Gerben I. Schoukens, Maarten Tóth, Roland Department of Electrical Engineering Eindhoven University of Technology Netherlands Systems and Control Laboratory Institute for Computer Science and Control Budapest Hungary

Continuous-time (CT) modeling has proven to provide improved sample efficiency and interpretability in learning the dynamical behavior of physical systems compared to discrete-time (DT) models. However, even with numerous recent developments, the CT nonlinear state-space (NL-SS) model identification problem remains to be solved in full, considering common experimental aspects such as the presence of external inputs, measurement noise, latent states, and general robustness. This paper presents a novel estimation method that addresses all these aspects and that can obtain state-of-the-art results on multiple benchmarks with compact fully connected neural networks capturing the CT dynamics. The proposed estimation method called the subspace encoder approach (SUBNET) ascertains these results by efficiently approximating the complete simulation loss by evaluating short simulations on subsections of the data, by using an encoder function to estimate the initial state for each subsection and a novel state-derivative normalization to ensure stability and good numerical conditioning of the training process. We prove that the use of subsections increases cost function smoothness together with the necessary requirements for the existence of the encoder function and we show that the proposed state-derivative normalization is essential for reliable estimation of CT NL-SS models. © 2022, CC BY.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Partial-Node-Based State Estimation for Complex Networks With Energy Harvesting Sensors

Partial-Node-Based State Estimation for Complex Networks Wit...

引用

International Conference on Automation and Computing (ICAC)

作者： Yu-Ang Wang Zidong Wang Fan Wang Lei Zou College of Information Science and Technology Donghua University Shanghai China Department of Computer Science Brunel University London Uxbridge Middlesex United Kingdom Institute for Automatic Control and Complex Systems (AKS) University of Duisburg-Essen Duisburg Germany

In this paper, the recursive partial-node-based (PN-B) state estimation problem is investigated for a class of time-varying complex networks (CNs) with energy harvesting sensors (EHSs). Measurements are transmitted to the remote state estimator by the EHSs only when the current energy level can compensate for the energy consumption. Only a part of the network nodes' measurements, which are available to the users, are utilized to estimate the network states. The objective of this problem is to design a recursive state estimator for CNs with EHSs based on available measurements observed from partial nodes. The upper bound of the estimation error covariance is first established with the help of intensive scholastic techniques and induction approach. Then, the required estimator gain is determined by minimizing such an upper bound. Finally, an illustrative example is presented to verify the effectiveness of the proposed PNB state estimation method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Signal Detection Method Based on Social Relationship Strength in Vehicular Ad-hoc Networks ⁎

引用

IFAC-PapersOnLine 2024年第10期58卷 176-181页

作者： Yi Li Shuangshuang Han Yongqiang Bai Fei-Yue Wang School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China and Key Laboratory of Ocean Observation Technology MNR Tianjin China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China and Beijing Huairou Academy of Parallel Sensing Beijing China The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China

In the case of scarce communication resources, the importance of different vehicle communication levels is self-evident. They not only affect the efficiency of information exchange between vehicles and driving safety, but also directly affect the rational allocation and utilization of communication resources. Therefore, this paper proposes a signal detection method based on vehicle social relationship strength (SRS) in vehicular ad-hoc networks (VANETs) scenario, and integrates the SRS information into the data to be transmitted. In this method, minimum mean square error (MMSE) signal detection algorithm is selected for simulation, and Rayleigh channel and Rician channel are selected for simulation scenarios. This method makes full use of the intensity of social relationship between vehicles, and realizes the efficient transmission of data and the accurate transmission of communication level. Experimental verification shows that the method performs well in the VANETs scenario, and provides a new communication method for intelligent transportation, social network and other applications, which is expected to promote the technical progress and application development in related fields.

关键词： VANETs Social relation strength Image data transmission MMSE detection Intelligent transportation Social networking

来源：评论

学校读者我要写书评

暂无评论

Learning to control Linear systems can be Hard

arXiv

引用

arXiv 2022年

作者： Tsiamis, Anastasios Ziemann, Ingvar Morari, Manfred Matni, Nikolai Pappas, George J. Automatic Control Laboratory ETH Zurich Switzerland School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Department of Electrical and Systems Engineering University of Pennsylvania United States

In this paper, we study the statistical difficulty of learning to control linear systems. We focus on two standard benchmarks, the sample complexity of stabilization, and the regret of the online learning of the Linear Quadratic Regulator (LQR). Prior results state that the statistical difficulty for both benchmarks scales polynomially with the system state dimension up to system-theoretic quantities. However, this does not reveal the whole picture. By utilizing minimax lower bounds for both benchmarks, we prove that there exist non-trivial classes of systems for which learning complexity scales dramatically, i.e. exponentially, with the system dimension. This situation arises in the case of underactuated systems, i.e. systems with fewer inputs than states. Such systems are structurally difficult to control and their system theoretic quantities can scale exponentially with the system dimension dominating learning complexity. Under some additional structural assumptions (bounding systems away from uncontrollability), we provide qualitatively matching upper bounds. We prove that learning complexity can be at most exponential with the controllability index of the system, that is the degree of underactuation. Copyright © 2022, The Authors. All rights reserved.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

Solution to the Problem of Passing Over the Given Targets by an Unmanned Aerial Vehicle in an Unstable Environment

Solution to the Problem of Passing Over the Given Targets by...

引用

International Russian Automation Conference (RusAutoCon)

作者： Mikhail Khachumov Intelligent Control Laboratory Ailamazyan Program Systems Institute of RAS Pereslavl-Zalessky Russia Federal Research Center "Computer Science and Control" of RAS Moscow Russia RUDN University Moscow Russia

The paper gives a statement and considers the solution to an urgent problem of flying over the given targets by an unmanned aerial vehicle (UAV) in unstable conditions. A criterion is formulated for constructing efficient routes and passing arbitrary located sites according to a given formal description of the terrain map with the presence of interferences. Heuristic rules are proposed aimed at minimizing the graph of the initial map and reducing the number of alternative flight routes, given the time constraints for completing the task. The search of the solution in this case can be carried out according to the base tree of routes. A heuristic algorithm for searching efficient routes in a limited time is considered, which has the complexity that ensures its implementation on the UAV onboard computer. It is substantiated that the proposed approach can significantly reduce the number of comparing alternatives for flying around given arbitrary located targets in comparison with the well-known methods for solving this problem. The paper describes a successful example of solving the UAV route planning problem with the proposed approach, which is complicated by the presence of wind flows affecting the speed and trajectory.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Trust Establishment for the Role-Based Collaborative Multi-Robot systems

Trust Establishment for the Role-Based Collaborative Multi-R...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Behzad Akbari Haibin Zhu Ya-Jun Pan Department of Mechanical Engineering Advanced Control and Mechatronics Laboratory Dalhousie University Halifax NS Canada Department of Computer Science and Mathematics Collaborative Systems Laboratory Nipissing University NorthBay ON Canada

Trust evaluation and trust establishment play crucial roles in the management of trust within a multi-agent system. When it comes to collaboration systems, trust becomes directly linked to the specific roles performed by agents. The Role-Based Collaboration (RBC) methodology serves as a framework for assigning roles that facilitate agent collaboration. Within this context, the behavior of an agent with respect to a role is referred to as a process role. This research paper introduces a role engine that incorporates a trust establishment algorithm aimed at identifying optimal and reliable process roles. In our study, we define trust as a continuous value ranging from 0 to 1. To optimize trustworthy process roles, we have developed a consensus-based Gaussian Process Factor Graph (GPFG) tool. Our simulations and experiments validate the feasibility and efficiency of our proposed approach with autonomous robots in unsignalized intersections and narrow hallways.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Trust Region Policy Optimization with Optimal Transport Discrepancies: Duality and Algorithm for Continuous Actions

arXiv

引用

arXiv 2022年

作者： Terpin, Antonio Lanzetti, Nicolas Yardim, Batuhan Dörfler, Florian Ramponi, Giorgia Automatic Control Laboratory ETH Zürich Switzerland Dept. of Computer Science ETH Zürich Switzerland Dept. of Computer Science ETH AI Center Switzerland

Policy Optimization (PO) algorithms have been proven particularly suited to handle the high-dimensionality of real-world continuous control tasks. In this context, Trust Region Policy Optimization methods represent a popular approach to stabilize the policy updates. These usually rely on the Kullback-Leibler (KL) divergence to limit the change in the policy. The Wasserstein distance represents a natural alternative, in place of the KL divergence, to define trust regions or to regularize the objective function. However, state-of-the-art works either resort to its approximations or do not provide an algorithm for continuous state-action spaces, reducing the applicability of the method. In this paper, we explore optimal transport discrepancies (which include the Wasserstein distance) to define trust regions, and we propose a novel algorithm – Optimal Transport Trust Region Policy Optimization (OT-TRPO) – for continuous state-action spaces. We circumvent the infinite-dimensional optimization problem for PO by providing a one-dimensional dual reformulation for which strong duality holds. We then analytically derive the optimal policy update given the solution of the dual problem. This way, we bypass the computation of optimal transport costs and of optimal transport maps, which we implicitly characterize by solving the dual formulation. Finally, we provide an experimental evaluation of our approach across various control tasks. Our results show that optimal transport discrepancies can offer an advantage over state-of-the-art approaches. Copyright © 2022, The Authors. All rights reserved.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive Positional Encoding for Bundle-Adjusting Neural Radiance Fields

Adaptive Positional Encoding for Bundle-Adjusting Neural Rad...

引用

International Conference on computer Vision (ICCV)

作者： Zelin Gao Weichen Dai Yu Zhang State Key Laboratory of Industrial Control Technology College of Control Science and Engineering Zhejiang University Key Laboratory of Brain Machine Collaborative Intelligence of Zhejiang Province and School of Computer Science Hangzhou Dianzi University Key Laboratory of Collaborative Sensing and Autonomous Unmanned Systems of Zhejiang Province

Neural Radiance Fields have shown great potential to synthesize novel views with only a few discrete image observations of the world. However, the requirement of accurate camera parameters to learn scene representations limits its further application. In this paper, we present adaptive positional encoding (APE) for bundle-adjusting neural radiance fields to reconstruct the neural radiance fields from unknown camera poses (or even intrinsics). Inspired by Fourier series regression, we investigate its relationship with the positional encoding method and therefore propose APE where all frequency bands are trainable. Furthermore, we introduce period-activated multilayer perceptrons (PMLPs) to construct the implicit network for the high-order scene representations and fine-grained gradients during backpropagation. Experimental results on public datasets demonstrate that the proposed method with APE and PMLPs can outperform the state-of-the-art methods in accurate camera poses and high-fidelity view synthesis.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：