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

2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, CVPRW 2023

作者： Sheng, Hao Liu, Yebin Yu, Jingyi Wu, Gaochang Xiong, Wei Guo, Longzhao Xie, Yanlin Zhang, Shuo Chang, Song Lin, Youfang Chao, Wentao Wang, Xuechun Wang, Guanghui Duan, Fuqing Wang, Tun Yang, Da Cui, Zhenglong Wang, Sizhe Zhao, Mingyuan Wang, Qiong Chen, Qianyu Liang, Zhengyu Wang, Yingqian Yang, Jungang Yang, Xueting Deng, Junli Cong, Ruixuan Chen, Rongshan State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University China Beihang Hangzhou Innovation Institute Yuhang China Faculty of Applied Sciences Macao Polytechnic University China Tsinghua University China Shanghaitech University China State Key Laboratory of Synthetical Automation for Process Industries Northeastern University China Beijing Meet Yuan Co. Ltd China Beijing Key Laboratory of Traffic Data Analysis and Mining School of Computer and Information Technology Beijing Jiaotong University China Beijing Normal University China Toronto Metropolitan University Canada College of Computer Science and Technology Zhejiang University of Technology China National University of Defense Technology China School of Information and Communication Engineering Communication University of China China

ISBN: (纸本)9798350302493

This paper reviews the 1st LFNAT challenge on light field depth estimation, which aims at predicting disparity information of central view image in a light field (i.e., pixel offset between central view image and adjacent view image). Compared to multi-view stereo matching, light field depth estimation emphasizes efficient utilization of the 2D angular information from multiple regularly varying views. This challenge specifies UrbanLF [20] light field dataset as the sole data source. There are two phases in total: submission phase and final evaluation phase, in which 75 registered participants successfully submit their predicted results in the first phase and 7 eligible teams compete in the second phase. The performance of all submissions is carefully reviewed and shown in this paper as a new standard for the current state-of-the-art in light field depth estimation. Moreover, the implementation details of these methods are also provided to stimulate related advanced research. © 2023 IEEE.

关键词： Stereo image processing

来源：评论

学校读者我要写书评

暂无评论

Dual-Objective Mixed Integer Linear Program and Memetic Algorithm for an Industrial Group Scheduling Problem

引用

IEEE/CAA Journal of Automatica Sinica 2021年第6期8卷 1199-1209页

作者： Ziyan Zhao Shixin Liu MengChu Zhou Abdullah Abusorrah State Key Laboratory of Synthetical Automation for Process Industries and the College of Information Science and Engineering Northeastern UniversityShenyang 110819China Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewark NJ 07102 USA Center of Research Excellence in Renewable Energy and Power Systems King Abdulaziz UniversityJeddah 21481Saudi Arabia Department of Electrical and Computer Engineering Faculty of Engineeringand Center of Research Excellence in Renewable Energy and Power SystemsKing Abdulaziz UniversityJeddah 21481Saudi Arabia

Group scheduling problems have attracted much attention owing to their many practical *** work proposes a new bi-objective serial-batch group scheduling problem considering the constraints of sequence-dependent setup time,release time,and due *** is originated from an important industrial process,i.e.,wire rod and bar rolling process in steel production *** objective functions,i.e.,the number of late jobs and total setup time,are minimized.A mixed integer linear program is established to describe the *** obtain its Pareto solutions,we present a memetic algorithm that integrates a population-based nondominated sorting genetic algorithm II and two single-solution-based improvement methods,i.e.,an insertion-based local search and an iterated greedy *** computational results on extensive industrial data with the scale of a one-week schedule show that the proposed algorithm has great performance in solving the concerned problem and outperforms its *** high accuracy and efficiency imply its great potential to be applied to solve industrial-size group scheduling problems.

关键词： Insertion-based local search iterated greedy algorithm machine learning memetic algorithm nondominated sorting genetic algorithm II(NSGA-II) production scheduling

来源：评论

学校读者我要写书评

暂无评论

Existence and Completeness of Bounded Disturbance Observers: A Set-Membership Viewpoint

arXiv

引用

arXiv 2023年

作者： Li, Yudong Cong, Yirui Dong, Jiuxiang The State Key Laboratory of Synthetical Automation of Process Industries Northeastern University China The College of Information Science and Engineering Northeastern University China The Key Laboratory of Vibration and Control of Aero-Propulsion Systems Ministry of Education of China Northeastern University China The College of Intelligence Science and Technology National University of Defense Technology China

This paper investigates the boundedness of the Disturbance Observer (DO) for linear discrete-time systems. In contrast to previous studies that focus on analyzing and/or designing observer gains, our analysis and synthesis approach is based on a set-membership viewpoint. From this viewpoint, a necessary and sufficient existence condition of bounded DOs is first established, which can be easily verified. Furthermore, a set-membership filter-based DO is developed, and its completeness is proved;thus, our proposed DO is bounded if and only if bounded DOs exist. We also prove that the proposed DO has the capability to achieve the worst-case optimality, which can provide a benchmark for the design of DOs. Finally, numerical simulations are performed to corroborate the effectiveness of the theoretical results. Copyright © 2023, The Authors. All rights reserved.

关键词： Digital control systems

来源：评论

学校读者我要写书评

暂无评论

Distributed Event-Triggered Bandit Convex Optimization with Time-Varying Constraints

arXiv

引用

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Wen, Guanghui Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China The Laboratory for Information and Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States The Department of Mathematics Southeast University Nanjing210096 China The Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms require that each agent broadcasts its decision to its neighbors at each iteration. To better utilize the limited communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2024, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Distributed Optimization by Network Flows with Spatio-Temporal Compression

arXiv

引用

arXiv 2024年

作者： Ren, Zihao Wang, Lei Yi, Xinlei Wang, Xi Yuan, Deming Yang, Tao Wu, Zhengguang Shi, Guodong State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou310027 China College of Electronics and Information Engineering Tongji University China School of Electrical Engineering Telecommunications University of New South Wales Sydney Australia School of Automation Nanjing University of Science and Technology China State Key Laboratory of Synthetical Automation for Process Industries Northeastern University China Australian Centre for Robotics School of Aerospace Mechanical and Mechatronic Engineering The University of Sydney SydneyNSW2006 Australia

Several data compressors have been proposed in distributed optimization frameworks of network systems to reduce communication overhead in large-scale applications. In this paper, we demonstrate that effective information compression may occur over time or space during sequences of node communications in distributed algorithms, leading to the concept of spatio-temporal compressors. This abstraction classifies existing compressors as spatio-temporal compressors, with their effectiveness described by constructive stability criteria from nonlinear system theory. Subsequently, we apply these spatio-temporal compressors to standard continuous-time consensus flows and distributed prime-dual flows, establishing conditions ensuring convergence. Additionally, we introduce a novel observer-based distributed primal-dual continuous flow integrated with spatio-temporal compressors, which provides broader convergence conditions. These continuous flows achieve exponential convergence to the global optimum when the objective function is strongly convex and can be discretized using Euler approximations. Finally, numerical simulations illustrate the versatility of the proposed spatio-temporal compressors and verify the convergence of algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Stability criteria

来源：评论

学校读者我要写书评

暂无评论

Reduced Network Cumulative Constraint Violation for Distributed Bandit Convex Optimization under Slater’s Condition

arXiv

引用

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Ding, Jinliang Cao, Ming Johansson, Karl H. Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201800 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper studies the distributed bandit convex optimization problem with time-varying inequality constraints, where the goal is to minimize network regret and cumulative constraint violation. To calculate network cumulative constraint violation, existing distributed bandit online algorithms solving this problem directly use the clipped constraint function to replace its original constraint function. However, the use of the clipping operation renders Slater’s condition (i.e, there exists a point that strictly satisfies the inequality constraints at all iterations) ineffective to achieve reduced network cumulative constraint violation. To tackle this challenge, we propose a new distributed bandit online primal–dual algorithm. If local loss functions are convex, we show that the proposed algorithm establishes an O(T max{c,1−c})network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the total number of iterations and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds, the network cumulative constraint violation bound is reduced to O(T 1−c). In addition, if local loss functions are strongly convex, for the case where strongly convex parameters are unknown, the network regret bound is reduced to O(T1−c), and the network cumulative constraint violation bound is O(T1−c/2) and O(T1−c) without and with Slater’s condition, respectively. For the case where strongly convex parameters are known, the network regret bound is further reduced to O)(log(T)), and the network cumulative constraint violation bound is reduced to O(log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is among the first to establish reduced (network) cumulative constraint violation bounds for (distributed) bandit convex optimization with time-varying constraints under Slater’s condition. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Determination of the Degree of Impact of Natural Disasters on the Level of Migration of the Population by Simulation Modelling

Determination of the Degree of Impact of Natural Disasters o...

引用

International Symposium on INFOTEH-JAHORINA (INFOTEH)

作者： Konstantin Lobkov Dmitrij Eremeev Anastasia Rubinskaya Elena Melnikova Ilya Panfilov Department of Information Economic Systems Reshetnev Siberian State University of Science and Technology Krasnoyarsk Russia Department of Accounting Finance and Economic Security Reshetnev Siberian State University of Science and Technology Krasnoyarsk Russia Department of Enterprise and Industry Economics Reshetnev Siberian State University of Science and Technology Krasnoyarsk Russia Department of Systems Analysis and Operations Research Reshetnev Siberian State University of Science and Technology Institute of Business Process Management Siberian Federal University Digital Material Science: New Materials and Technologie Bauman Moscow State Technical University Krasnoyarsk Russia

In this article the program for simulation of "PowerSim" was used. It built a simulation-dynamic model to measure the impact of natural disasters on people and migration levels. Three types of natural disasters were considered: hurricane, fire and earthquakes. The necessary constants for the operation of models have been identified, as well as models of the impact of various natural disasters on urban damage have been built. General models have been developed to illustrate the groups of factors influencing the destruction of the housing sector, including the population sector. For the ability to change results, constant switches were added to regulate earthquake severity, fire severity and hurricane strength. A graph has been constructed that can be used to visualize the number of destroyed houses from various natural disasters. The results were analyzed, on the basis of which four graphs were constructed: percentage of population growth, population, population, proportion of built-up land, in addition to graphs: table of calculation and emigration. In the course of the work, it was determined that the model was suitable for calculating the population size taking into account natural disasters.

关键词： Visualization Seismic measurements Sociology Earthquakes Urban areas Human factors Hurricanes

来源：评论

学校读者我要写书评

暂无评论

Compressed Gradient Tracking Algorithms for Distributed Nonconvex Optimization

arXiv

引用

arXiv 2023年

作者： Xu, Lei Yi, Xinlei Wen, Guanghui Shi, Yang Johansson, Karl H. Yang, Tao The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China The Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States The Department of Systems Science School of Mathematics Southeast University Nanjing210096 China The Department of Mechanical Engineering University of Victoria VictoriaBCV8W 2Y2 Canada The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden

In this paper, we study the distributed nonconvex optimization problem, aiming to minimize the average value of the local nonconvex cost functions using local information exchange. To reduce the communication overhead, we introduce three general classes of compressors, i.e., compressors with bounded relative compression error, compressors with globally bounded absolute compression error, and compressors with locally bounded absolute compression error. By integrating them, respectively, with the distributed gradient tracking algorithm, we then propose three corresponding compressed distributed nonconvex optimization algorithms. Motivated by the state-of-the-art BEER algorithm proposed in [1], which is an efficient compressed algorithm integrating gradient tracking with biased and contractive compressors, our first proposed algorithm extends this algorithm to accommodate both biased and non-contractive compressors. For each algorithm, we design a novel Lyapunov function to demonstrate its sublinear convergence to a stationary point if the local cost functions are smooth. Furthermore, when the global cost function satisfies the Polyak–Lojasiewicz (P–L) condition, we show that our proposed algorithms linearly converge to a global optimal point. It is worth noting that, for compressors with bounded relative compression error and globally bounded absolute compression error, our proposed algorithms’ parameters do not require prior knowledge of the P–L constant. The theoretical results are illustrated by numerical examples, demonstrating the effectiveness of the proposed algorithms in significantly reducing the communication burden while maintaining the convergence performance. Moreover, simulation results show that the proposed algorithms outperform the state-of-the-art compressed distributed nonconvex optimization algorithms. Copyright © 2023, The Authors. All rights reserved.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater’s Condition

arXiv

引用

arXiv 2023年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an O(T max{c,1−c}) network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the number of rounds and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T 1−c). Moreover, if the loss functions are strongly convex, then the network regret bound is reduced to O(log(T)), and the network cumulative constraint violation bound is reduced to O(√log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is the first to achieve reduced (network) cumulative constraint violation bounds for (distributed) online convex optimization with adversarial constraints under Slater’s condition. Finally, the theoretical results are verified through numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Dynamic Perturbation-Adaptive Adversarial Training on Medical Image Classification

arXiv

引用

arXiv 2024年

作者： Li, Shuai Ma, Xiaoguang Jiang, Shancheng Meng, Lu The College of Information Science and Engineering Northeastern University Shenyang110819 China The Foshan Graduate School Northeastern University Foshan528311 China The Faculty of Robot Science and Engineering Northeastern University Shenyang110819 China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China The School of Intelligent Systems Engineering Sun Yat-Sen University No. 135 Xingang Xi Road Guangzhou China Guangdong Provincial Key Laboratory of Fire Science and Technology Guangzhou510006 China

Remarkable successes were made in Medical Image Classification (MIC) recently, mainly due to wide applications of convolutional neural networks (CNNs). However, adversarial examples (AEs) exhibited imperceptible similarity with raw data, raising serious concerns on network robustness. Although adversarial training (AT), in responding to malevolent AEs, was recognized as an effective approach to improve robustness, it was challenging to overcome generalization decline of networks caused by the AT. In this paper, in order to reserve high generalization while improving robustness, we proposed a dynamic perturbation-adaptive adversarial training (DPAAT) method, which placed AT in a dynamic learning environment to generate adaptive data-level perturbations and provided a dynamically updated criterion by loss information collections to handle the disadvantage of fixed perturbation sizes in conventional AT methods and the dependence on external transference. Comprehensive testing on dermatology HAM10000 dataset showed that the DPAAT not only achieved better robustness improvement and generalization preservation but also significantly enhanced mean average precision and interpretability on various CNNs, indicating its great potential as a generic adversarial training method on the MIC. Copyright © 2024, The Authors. All rights reserved.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：