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

2020 International Conference on Networking and Network Applications, NaNA 2020

作者： Zhao, Ying Xu, Dantong Wang, Tie Ren, Yanchun Inner Mongolia Key Laboratory of Pattern Recognition and Intelligent Image Processing School of Information Engineering Inner Mongolia University of Science and Technology Baotou Inner Mongolia

ISBN: (纸本)9781728189543

Purpose. To assess the recognition pattern of dynamic action by visual prosthesis' wearers. Methods. Twenty volunteers (classified by gender and experience) were recruited to carried out action recognition test in simulated prosthetic vision. Twenty-three common dynamic actions video clips usually see in daily life were selected and formed the experimental action set which was divided into three parts including combined actions, simple actions and difficult actions in turn. The action animations made by 3D Studio Max were recorded by Banicam to convert to MP4 video format and processed to phosphene video clips by MATLAB in different resolutions (16 × 16, 24 × 24, 32 × 32, 48 × 48, 64 × 64, 128 × 128). Result. Comparing the recognition results, male group and female group had no significant difference. 48 × 48 resolution was the considerable latent capacity which subjects had stable performance. After a period of study, the performance of prosthesis wearers could be improved significantly. © 2020 IEEE.

关键词： MATLAB

来源：评论

学校读者我要写书评

暂无评论

Finite-time asynchronous dissipative filtering of conic-type nonlinear Markov jump systems

引用

Science China(Information Sciences) 2021年第5期64卷 151-162页

作者： Xiang ZHANG Shuping HE Vladimir STOJANOVIC Xiaoli LUAN Fei LIU Key Laboratory of Intelligent Computing and Signal Processing (Ministry of Education) School of Electrical Engineering and Automation Anhui University Department of Automatic Control Robotics and Fluid Technique Faculty of Mechanical and Civil EngineeringUniversity of Kragujevac Key Laboratory of Advanced Process Control for Light Industry (Ministry of Education) Institute of AutomationJiangnan University

In the present study, the finite-time asynchronous dissipative filter design problem for the Markov jump systems with conic-type nonlinearity is studied. The hidden Markov model can describe the asynchronism embodied in the system modes and the filter modes reasonably. Moreover, a suitable LyapunovKrasovskii function is utilized and linear matrix inequalities are applied to obtain adequate conditions. These techniques guarantee the finite-time boundedness and strict dissipativity of the filtering error dynamic system. Furthermore, the design problems of the passive filter and the H∞ filter are studied by adjusting the three parameters U, G and V. Finally, the filter gains and the optimal index α*are obtained and the correctness and feasibility of the designed approach are verified by a simulation example.

关键词： dissipative filtering hidden Markov model finite-time boundedness Markov jump systems conic-type nonlinearity

来源：评论

学校读者我要写书评

暂无评论

Tight Formulations of Unit Commitment with General Start-Up Ramp Rate Constraints

Tight Formulations of Unit Commitment with General Start-Up ...

引用

Sustainable Power and Energy Conference (iSPEC)

作者： Yijie Gao Xuan Zhang Yaowen Yu Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Hitachi ABB Power Grid San Jose California US

ISBN: (纸本)9781665414401

Unit commitment (UC) is a central market clearing process in wholesale electricity markets. With the increasing size and complexity of market-clearing models, UC problems become more and more complicated. To improve the computation efficiency, this paper tightens UC formulations with the general start-up ramp rate. Through analyzing their parameters over three periods, units are categorized into several categories for constructing corresponding tight formulations, and three of the categories are beyond existing works. By applying a recent systematic formulation tightening approach on top of these categories, new tight constraints of the general start-up ramp rate have been obtained. Numeral testing results illustrate the tightening process and demonstrate the improvement of computational efficiency when using our tightened formulations.

关键词： Systematics Computational modeling Conferences Electricity supply industry Computational efficiency Complexity theory Testing

来源：评论

学校读者我要写书评

暂无评论

On the Performance Trade-off of Distributed Integrated Sensing and Communication Networks

arXiv

引用

arXiv 2023年

作者： Li, Xuran Guo, Shuaishuai Li, Tuo Zou, Xiaofeng Li, Dengwang Shandong Key Laboratory of Medical Physics and Image Processing School of Physics and Electronics Shandong Normal University Jinan250061 China School of Control Science and Engineering Shandong University Jinan250061 China Shandong Provincial Key Laboratory of Wireless Communication Technologies China Shandong Yunhai Guochuang Cloud Computing Equipment Industry Innovation Co. Ltd. China

In this letter, we analyze the performance tradeoff in distributed integrated sensing and communication (ISAC) networks. Specifically, with the aid of stochastic geometry theory, we derive the probability of detection of that of the coverage given user number. Based on the analytical derivations, we provide a quantitative description of the performance limits and the performance trade-off between sensing and communication in a distributed ISAC network under the given transmit power and bandwidth budget. Extensive simulations are conducted and the numerical results validate the accuracy of our derivations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Optimization of Crane Scheduling Time for Steel Plate Outbound Operations Based on Backtracking Algorithm

Optimization of Crane Scheduling Time for Steel Plate Outbou...

引用

Chinese Automation Congress (CAC)

作者： Jiang Xiang Zhezhuang Xu Jinlong Wang Boyu Chen Qingdong Zhang Xiuren Wu Yuxiong Xia College of Electrical Engineering and Automation Fuzhou University Fuzhou China Education Department of Fujian Province Key Laboratory of Industrial Automation Control Technology and Information Processing Fuzhou China Sansteel Minguang Co. Ltd. Sanming China Fujian Huading Intelligent Manufacturing Technology Co. Ltd. Fuzhou China

ISBN: (数字)9798350368604

ISBN: (纸本)9798350368611

Steel plate is a highly customized product, and steel plates from the same order may be stored in different stacks. However, during the outbound process, the steel plates of the next order can only be dispatched from the warehouse once all plates from the preceding order have been fully completed. In this case, the outbound scheduling of steel plates is a challenging problem since its efficiency and complexity are affected by the shuffling of steel plates. In order to address the challenge, this paper formulates the steel plate outbound scheduling as a dynamic programming model with the aim of minimizing the crane operation time. To solve the problem, an decision tree-based backtracking search algorithm (DTBSA) is developed, in which the search tree is pruned through lower bound functions and dominance rules, so as to reduce the search range of the solution space. Experimental results prove that the proposed method can obtain optimal scheduling results within a reasonable time range.

关键词： Backtracking Lower bound Cranes Heuristic algorithms Optimal scheduling Search problems Dynamic scheduling Dynamic programming Steel Decision trees

来源：评论

学校读者我要写书评

暂无评论

MetaEarth: A Generative Foundation Model for Global-scale Remote Sensing image Generation

arXiv

引用

arXiv 2024年

作者： Yu, Zhiping Liu, Chenyang Liu, Liqin Shi, Zhenwei Zou, Zhengxia The Image Processing Center School of Astronautics Beihang University Beijing100191 China The State Key Laboratory of Virtual Reality Technology and Systems Beihang University Beijing100191 China The Shanghai Artificial Intelligence Laboratory Shanghai200232 China Shen Yuan Honors College Beihang University Beijing100191 China The Department of Guidance Navigation and Control School of Astronautics Beihang University Beijing100191 China

The recent advancement of generative foundational models has ushered in a new era of image generation in the realm of natural images, revolutionizing art design, entertainment, environment simulation, and beyond. Despite producing high-quality samples, existing methods are constrained to generating images of scenes at a limited scale. In this paper, we present MetaEarth - a generative foundation model that breaks the barrier by scaling image generation to a global level, exploring the creation of worldwide, multi-resolution, unbounded, and virtually limitless remote sensing images. In MetaEarth, we propose a resolution-guided self-cascading generative framework, which enables the generating of images at any region with a wide range of geographical resolutions. To achieve unbounded and arbitrary-sized image generation, we design a novel noise sampling strategy for denoising diffusion models by analyzing the generation conditions and initial noise. To train MetaEarth, we construct a large dataset comprising multi-resolution optical remote sensing images with geographical information. Experiments have demonstrated the powerful capabilities of our method in generating global-scale images. Additionally, the MetaEarth serves as a data engine that can provide high-quality and rich training data for downstream tasks. Our model opens up new possibilities for constructing generative world models by simulating Earth’s visuals from an innovative overhead perspective. © 2024, CC BY.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Accelerated Simulation of Master Equation for Open Quantum Systems

Accelerated Simulation of Master Equation for Open Quantum S...

引用

Chinese control Conference (CCC)

作者： Bo Yue Yanfang Wang Shibei Xue Department of Automation Shanghai Jiao Tong University Shanghai P. R. China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai P. R. China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai P. R. China

Simulation of open quantum systems is undoubtedly critical to design of quantum devices and applications of quantum technologies since dynamics of open quantum systems cannot be solved analytically in general. However, the dimension of open quantum systems grows exponentially as the number of their subsystems increases or as involving complicated environments, which reduces the computational efficiency of the simulation. In this paper, we boost numerical simulation of master equations of open quantum systems from several aspects with which the total time and the occupied memory in the simulation are significantly reduced without losing precision. Our method can be applied to the simulation of non-Markovian quantum systems described by an augmented system model as well. We conduct numerical experiments on simulation of a non-Markovian spin chain. Compared with the algorithm in a well-known toolbox, QuTiP, our method can take 26.3% time and less memory under fair conditions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adversarial Learning Network for Recovering Rppg Signals from Low-Resolution images for Remote Heart Rate Measurement

SSRN

引用

SSRN 2024年

作者： Zhai, Dezhao Chen, Wei Li, Qinwei Yu, Ming Wu, Hang Tianjin Key Laboratory for Advanced Mechatronic System Design and Intelligent Control School of Mechanical Engineering Tianjin University of Technology Tianjin300384 China Systems Engineering Institute Academy of Military Sciences People's Liberation Army Tianjin300161 China Tianjin Key Laboratory for Advanced Signal Processing Civil Aviation University of China Tianjin300300 China School of Artificial Intelligence Nankai University Tianjin300381 China

Remote Photoplethysmography (rPPG) is a non-contact method for measuring heart rate (HR) through facial video, which has significant research value and application potential. However, in long-distance vital sign measurement tasks, the low resolution of facial images and insufficient pixels in the facial region severely degrade the quality of the rPPG signals, leading to a sharp decline in HR accuracy. To address this issue, this paper proposes an adversarial learning network for recovering rPPG signals from low-resolution images (ALRSL-HR). First, arbitrary resolution face images are fed into multi-channel network to extract rPPG signal features capturing rich rPPG information, generating rPPG feature blocks, and temporally aggregating for richer feature representation. These features are then inputted into the backbone network to generate adversarial examples of rPPG signals of varying qualities. Finally, a two-stage adversarial loss function is employed to enable the low-quality rPPG signals to learn the periodic characteristics of high-quality rPPG signals, recover the low-quality signals, and narrow the quality gap between rPPG signals from low-resolution images. Extensive experiments were conducted in this paper to validate the effectiveness of our model on the public COHFACE, UBFC-Phys and UBFC-rPPG datasets. The results of the experiments demonstrate that the proposed ALRSL-HR model can effectively recover degraded rPPG signals from low-resolution images. © 2024, The Authors. All rights reserved.

关键词： Photoplethysmography

来源：评论

学校读者我要写书评

暂无评论

Robust Remote Sensing Scene Classification with Multi-View Voting and Entropy Ranking

arXiv

引用

arXiv 2023年

作者： Wang, Jinyang Wang, Tao Gan, Min Hadjichristofi, George Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering International Digital Economy College Minjiang University Fuzhou350108 China College of Computer and Data Science Fuzhou University Fuzhou350108 China Department of Computer Science and Engineering European University Cyprus Nicosia1516 Cyprus

Deep convolutional neural networks have been widely used in scene classification of remotely sensed images. In this work, we propose a robust learning method for the task that is secure against partially incorrect categorization of images. Specifically, we remove and correct errors in the labels progressively by iterative multi-view voting and entropy ranking. At each time step, we first divide the training data into disjoint parts for separate training and voting. The unanimity in the voting reveals the correctness of the labels, so that we can train a strong model with only the images with unanimous votes. In addition, we adopt entropy as an effective measure for prediction uncertainty, in order to partially recover labeling errors by ranking and selection. We empirically demonstrate the superiority of the proposed method on the WHU-RS19 dataset and the AID dataset. Copyright © 2023, The Authors. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

Distributed Shadow Dynamic Consensus Optimization Framework for Power Market with Parameterization Bidding Strategy of GENCOs

Distributed Shadow Dynamic Consensus Optimization Framework ...

引用

IEEE PES Conference on Innovative Smart Grid Technologies - Middle East (ISGT Middle East)

作者： Liying Yu Peng Wang Zhe Chen Dewen Li Ning Li Rachid Cherkaoui Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China School of Electricity and Electronic Engineering École Polytechnique Fédérale de Lausanne Switzerland

This paper presents a distributed shadow dynamic consensus (DSDC) framework to address the generation company (GENCO) strategic bidding problem in the independent system operator (ISO) operation. First, each sub-group is defined according to the communication principle. The global resource allocation can be solved by introducing the local shadow power demand. Then, for the general market clearing optimization problem, a distributed dynamic consensus algorithm is presented to estimate the general equality constraint. The optimal locational marginal price (LMP) and power allocation in each sub-group are obtained in this step. Finally, the optimal solution is corrected when considering the transmission constraint. A theoretical analysis of the DSDC framework is provided. The algorithm and model are tested by the IEEE 30-bus test system to support the proposed DSDC framework.

关键词： Power demand Heuristic algorithms ISO Consensus algorithm Dynamic scheduling Power markets Smart grids

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：