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

arXiv 2021年

作者： Song, Yue Liu, Tao Hill, David J. The Department of Control Science and Engineering Tongji University Shanghai201804 China The National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai201210 China The Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai200120 China Hong Kong The HKU Shenzhen Institute of Research and Innovation Shenzhen China The Department of Electrical and Computer Systems Engineering Monash University MelbourneVIC3000 Australia The Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong

This paper incorporates a continuous-type network flexibility into chance constrained economic dispatch (CCED). In the proposed model, both power generations and line susceptances are continuous variables to minimize the expected generation cost and guarantee a low probability of constraint violation in terms of generations and line flows under renewable uncertainties. From the analytical form of CCED, we figure out the mechanism of network flexibility against uncertainties-while renewable uncertainties shrink the usable line capacities and aggravate transmission congestion, network flexibility mitigates congestion by re-routing the base-case line flows and reducing the line capacity shrinkage caused by uncertainties. Further, we propose an alternate iteration solver for this problem. By duality theory, we set up a master problem in the form of second-order cone programming to optimize generation dispatch scheme and a subproblem in the form of linear programming to optimize line susceptances. A satisfactory solution can be obtained efficiently by alternately solving these two problems. The proposed method applies to both Gaussian uncertainty and non-Gaussian uncertainty by means of Gaussian mixture model. The case studies on the IEEE 14-bus system and IEEE 118-bus system suggest that network flexibility can significantly improve operational economy while ensuring security under uncertainties. © 2021, CC BY.

关键词： Second-order cone programming

来源：评论

学校读者我要写书评

暂无评论

Colour-weighted rank transform and improved dynamic programming for fast and accurate stereo matching

引用

The Journal of Photographic Science 2024年第2期72卷

作者： Mohamed Hallek Randa Khemiri Ali Aseere Abdellatif Mtibaa Mohamed Atri a Laboratory of Electronics and Microelectronics University of Monastir Monastir Tunisia b Networked Objects Control and Communication Systems Laboratory ENISO Sousse University Sousse Tunisia c College of Computer Science King Khalid University Abha Saudi Arabia d National Engineering School of Sfax University of Sfax Sfax Tunisia

ABSTRACTReal-time stereo matching with high accuracy is a dynamic research topic; it is attractive in diverse computer vision applications. This paper presents a stereo-matching algorithm that produces high-quality disparity map while maintaining real-time performance. The proposed stereo-matching method is based on three per-pixel difference measurements with adjustment elements. The absolute differences and the gradient matching are combined with a colour-weighted extension of complete rank transform to reduce the effect of radiometric distortion. The disparity calculation is realized using improved dynamic programming that optimizes along and across all scanlines. It solves the inter-scanline inconsistency problem and increases the matching accuracy. The proposed algorithm is implemented on parallel high-performance graphic hardware using the Compute Unified Device Architecture to reach over 240 million disparity evaluations per second. The processing speed of our algorithm reaches 98 frames per second on 240 × 320-pixel images and 32 disparity levels. Our method ranks fourth in terms of accuracy and runtime for quarter-resolution images in the Middlebury stereo benchmark.

关键词： Cost function rank transform guided filter dynamic programming real-time performance stereo matching GPU CUDA gradient matching

来源：评论

学校读者我要写书评

暂无评论

Observation of quantum strong Mpemba effect

arXiv

引用

arXiv 2024年

作者： Zhang, Jie Xia, Gang Wu, Chun-Wang Chen, Ting Zhang, Qian Xie, Yi Su, Wen-Bo Wu, Wei Qiu, Cheng-Wei Chen, Ping-Xing Li, Weibin Jing, Hui Zhou, Yan-Li Institute for Quantum Science and Technology College of Science National University of Defense Technology Changsha410073 China Hunan Key Laboratory of Mechanism and technology of Quantum Information Changsha410073 China Hefei National Laboratory Anhui Hefei230088 China Key Laboratory of Low-Dimensional Quantum Structures and Quantum Control of Ministry of Education Hunan Normal University Changsha410081 China Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore School of Physics and Astronomy University of Nottingham NottinghamNG7 2RD United Kingdom Centre for the Mathematics and Theoretical Physics of Quantum Non-equilibrium Systems University of Nottingham NottinghamNG7 2RD United Kingdom College of Science National University of Defense Technology Changsha410073 China

An ancient and counterintuitive phenomenon known as the Mpemba effect showcases the critical role of initial conditions in relaxation processes. How to realize and utilize this effect for speeding up relaxation is an important but challenging task in purely quantum system till now. Here, we experimentally study the strong Mpemba effect in a single trapped ion system in which an exponentially accelerated relaxation in time is observed by preparing an optimal quantum initial state with no excitation of the slowest decaying mode. Also, we demonstrate that the condition of realizing such effect coincides with the Liouvillian exceptional point, featuring the coalescence of both the eigenvalues and the eigenmodes of the systems. Our work provides an efficient strategy to engineer the dynamics of open quantum system, and suggests a link unexplored yet between the Mpemba effect and the non-Hermitian physics. Copyright © 2024, The Authors. All rights reserved.

关键词： Trapped ions

来源：评论

学校读者我要写书评

暂无评论

Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization

arXiv

引用

arXiv 2021年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Chai, Tianyou Johansson, Karl H. The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm10044 Sweden The Digital Futures Stockholm10044 Sweden The Department of Control Science and Engineering College of Electronics and Information Engineering The Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai 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

This paper considers the distributed online convex optimization problem with time-varying constraints over a network of agents. This is a sequential decision making problem with two sequences of arbitrarily varying convex loss and constraint functions. At each round, each agent selects a decision from the decision set, and then only a portion of the loss function and a coordinate block of the constraint function at this round are privately revealed to this agent. The goal of the network is to minimize the network-wide loss accumulated over time. Two distributed online algorithms with full-information and bandit feedback are proposed. Both dynamic and static network regret bounds are analyzed for the proposed algorithms, and network cumulative constraint violation is used to measure constraint violation, which excludes the situation that strictly feasible constraints can compensate the effects of violated constraints. In particular, we show that the proposed algorithms achieve O(T max{κ,1-κ}) static network regret and O(T 1-κ/2) network cumulative constraint violation, where T is the time horizon and κ ∈ (0, 1) is a user-defined trade-off parameter. Moreover, if the loss functions are strongly convex, then the static network regret bound can be reduced to O(T κ). Finally, numerical simulations are provided to illustrate the effectiveness of the theoretical results. Copyright © 2021, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Zeroth-order algorithms for stochastic distributed nonconvex optimization

arXiv

引用

arXiv 2021年

作者： Yi, Xinlei Zhang, Shengjun Yang, Tao Johansson, Karl H. Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm10044 Sweden Department of Electrical Engineering University of North Texas DentonTX76203 United States State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China

In this paper, we consider a stochastic distributed nonconvex optimization problem with the cost function being distributed over n agents having access only to zeroth-order (ZO) information of the cost. This problem has various machine learning applications. As a solution, we propose two distributed ZO algorithms, in which at each iteration each agent samples the local stochastic ZO oracle at two points with a time-varying smoothing parameter. We show that the proposed algorithms achieve the linear speedup convergence rate O(√p=(nT)) for smooth cost functions under the state-dependent variance assumptions which are more general than the commonly used bounded variance and Lipschitz assumptions, and O(p=(nT)) convergence rate when the global cost function additionally satisfies the Polyak-Lojasiewicz (P-L) condition in addition, where p and T are the dimension of the decision variable and the total number of iterations, respectively. To the best of our knowledge, this is the first linear speedup result for distributed ZO algorithms, which enables systematic processing performance improvements by adding more agents. We also show that the proposed algorithms converge linearly under the relative bounded second moment assumptions and the P-L condition. We demonstrate through numerical experiments the efficiency of our algorithms on generating adversarial examples from deep neural networks in comparison with baseline and recently proposed centralized and distributed ZO algorithms. Copyright © 2021, The Authors. All rights reserved.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Pro-UIGAN: Progressive Face Hallucination from Occluded Thumbnails

arXiv

引用

arXiv 2021年

作者： Zhang, Yang Yu, Xin Lu, Xiaobo Liu, Ping The Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China The Australian Institute of Artificial Intelligence University of Technology Sydney UltimoNSW2007 Australia The School of Automation Southeast University Nanjing210096 China Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education Nanjing210096 China Singapore138634 Singapore

In this paper, we study the task of hallucinating an authentic high-resolution (HR) face from an occluded thumbnail. We propose a multi-stage Progressive Upsampling and Inpainting Generative Adversarial Network, dubbed Pro-UIGAN, which exploits facial geometry priors to replenish and upsample (8×) the occluded and tiny faces (16×16 pixels). Pro-UIGAN iteratively (1) estimates facial geometry priors for low-resolution (LR) faces and (2) acquires non-occluded HR face images under the guidance of the estimated priors. Our multi-stage hallucination network upsamples and inpaints occluded LR faces via a coarse-to-fine fashion, significantly reducing undesirable artifacts and blurriness. Specifically, we design a novel cross-modal attention module for facial priors estimation, in which an input face and its landmark features are formulated as queries and keys, respectively. Such a design encourages joint feature learning across the input facial and landmark features, and deep feature correspondences will be discovered by attention. Thus, facial appearance features and facial geometry priors are learned in a mutually beneficial manner. Extensive experiments show that our Pro-UIGAN attains visually pleasing completed HR faces, thus facilitating downstream tasks, i.e., face alignment, face parsing, face recognition as well as expression classification. Copyright © 2021, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Opportunistic Wiretapping/Jamming: A New Attack Model in Millimeter-Wave Wireless Networks

TechRxiv

引用

TechRxiv 2022年

作者： Zhang, Yuanyu Zheng, Zhumeng He, Ji Zhao, Shuangrui Qu, Qianyue Shen, Yulong Jiang, Xiaohong School of Computer Science and Technology Xidian University Shaanxi Xi’an China Shannxi Key Laboratory of Network and System Security China The Beijing Sunwise Information Technology Ltd Beijing Institute of Control Engineering Beijing China The Division of Information Science Graduate School of Science and Technology Nara Institute of Science and Technology Nara Ikoma Japan School of Systems Information Science Future University Hakodate Hokkaido Hakodate Japan

While the millimeter-wave (mmWave) communication is robust against the conventional wiretapping attack due to its short transmission range and directivity, this paper proposes a new opportunistic wiretapping and jamming (OWJ) attack model in mmWave wireless networks. With OWJ, an eavesdropper can opportunistically conduct wiretapping or jamming to initiate a more hazardous attack based on the instantaneous costs of wiretapping and jamming. We also provide three realizations of the OWJ attack, which are mainly determined by the cost models relevant to distance, path loss and received power, respectively. To understand the impact of the new attack on mmWave network security, we first develop novel approximation techniques to characterize the irregular distributions of wiretappers, jammers and interferers under three OWJ realizations. With the help of the results of node distributions, we then derive analytical expressions for the secrecy transmission capacity to depict the network security performance under OWJ. Finally, we provide extensive numerical results to illustrate the effect of OWJ and to demonstrate that the new attack can more significantly degrade the network security performance than the pure wiretapping or jamming attack. © 2022, CC BY.

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

Opportunistic Wiretapping/Jamming: A New Attack Model in Millimeter-Wave Wireless Networks

arXiv

引用

arXiv 2022年

作者： Zhang, Yuanyu Zheng, Zhumeng He, Ji Zhao, Shuangrui Qu, Qianyue Shen, Yulong Jiang, Xiaohong School of Computer Science and Technology Xidian University Shaanxi Xi’an China Shannxi Key Laboratory of Network and System Security China Beijing Sunwise Information Technology Ltd Beijing Institute of Control Engineering Beijing China Division of Information Science Graduate School of Science and Technology Nara Institute of Science and Technology Nara Ikoma Japan School of Systems Information Science Future University Hakodate Hokkaido Hakodate Japan

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

Disturbance Attenuation via Nonlinear Feedback for Chemical Reaction Networks

引用

IFAC-PapersOnLine 2020年第2期53卷 11497-11502页

作者： Lőrinc Márton Katalin M. Hangos Gábor Szederkényi Department of Electrical Engineering Sapientia Hungarian University of Transylvania Tirgu Mures Romania Systems and Control Laboratory Institute for Computer Science and Control Budapest Hungary Faculty of Information Technology and Bionics Pázmány Péter Catholic University Budapest Hungary Department of Electrical Engineering and Information Systems University of Pannonia Veszprém Hungary

This paper deals with the setpoint control of Chemical Reaction Networks (CRNs) in the presence of disturbances. The addressed control problem is traced back to the output feedback-based stabilization of passive systems. First, the passivity properties of complex balanced CRNs are discussed. Second, it is shown that, by combining the kinetic feedback based control with the passivity theory-based output feedback approach, arbitrary disturbance attenuation in controlled CRNs can be achieved. A case study is provided to demonstrate the applicability of the proposed control design approach.

关键词： Chemical Reaction Networks Passivity Setpoint control Disturbance Attenuation

来源：评论

学校读者我要写书评

暂无评论

ABCP: Automatic block-wise and channel-wise network pruning via joint search

arXiv

引用

arXiv 2021年

作者： Li, Jiaqi Li, Haoran Chen, Yaran Ding, Zixiang Li, Nannan Ma, Mingjun Duan, Zicheng Zhao, Dongbing The State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China The School of Mechanical Engineering Beijing Institute of Technology Beijing100081 China The University of Chinese Academy of Sciences Beijing China The College of Engineering and Computer Science Australian National University ACT2601 Australia

Currently, an increasing number of model pruning methods are proposed to resolve the contradictions between the computer powers required by the deep learning models and the resource-constrained devices. However, most of the traditional rule-based network pruning methods can not reach a sufficient compression ratio with low accuracy loss and are time-consuming as well as laborious. In this paper, we propose Automatic Block-wise and Channel-wise Network Pruning (ABCP1) to jointly search the block-wise and channel-wise pruning action with deep reinforcement learning. A joint sample algorithm is proposed to simultaneously generate the pruning choice of each residual block and the channel pruning ratio of each convolutional layer from the discrete and continuous search space respectively. The best pruning action taking both the accuracy and the complexity of the model into account is obtained finally. Compared with the traditional rule-based pruning method, this pipeline saves human labor and achieves a higher compression ratio with lower accuracy loss. Tested on the mobile robot detection dataset, the pruned YOLOv3 model saves 99.5% FLOPs, reduces 99.5% parameters, and achieves 37.3× speed up with only 2.8% mAP loss. The results of the transfer task on the sim2real detection dataset also show that our pruned model has much better robustness performance. Copyright © 2021, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：