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

Fuzzy Set-Membership Filtering for Discrete-Time Nonlinear Systems

IEEE/CAA Journal of Automatica Sinica 2022年第6期9卷 1026-1036页

作者： Jingyang Mao Xiangyu Meng Derui Ding Department of Control Science and Engineering University of Shanghai for Science and TechnologyShanghai 200093China Division of Electrical and Computer Engineering Louisiana State UniversityBaton RougeLA70803 USA IEEE School of Science Computing and Engineering TechnologiesSwinburne University of TechnologyMelbourneVIC 3122Australia

In this article,the problem of state estimation is addressed for discrete-time nonlinear systems subject to additive unknown-but-bounded noises by using fuzzy set-membership ***,an improved T-S fuzzy model is introduced to achieve highly accurate approximation via an affine model under each fuzzy ***,compared to traditional prediction-based ones,two types of fuzzy set-membership filters are proposed to effectively improve filtering performance,where the structure of both filters consists of two parts:prediction and *** the locally Lipschitz continuous condition of membership functions,unknown membership values in the estimation error system can be treated as multiplicative noises with respect to the estimation ***-time recursive algorithms are given to find the minimal ellipsoid containing the true ***,the proposed optimization approaches are validated via numerical simulations of a one-dimensional and a three-dimensional discrete-time nonlinear systems.

关键词： Affine model membership functions set-membership filtering stability Takagi-Sugeno fuzzy modeling

来源：评论

学校读者我要写书评

暂无评论

Development and Analysis of Genetic Algorithm for Optimization of Continuous Cast Billets Warehousing Process

Development and Analysis of Genetic Algorithm for Optimizati...

引用

2024 International Russian Smart Industry Conference, SmartIndustryCon 2024

作者： Shchegolikhin, Ivan S. Andreev, Sergey M. Nosov Magnitogorsk State Technical University Department of Computer Engineering and Programming Magnitogorsk Russia Nosov Magnitogorsk State Technical University Department of Automated Control Systems Magnitogorsk Russia

ISBN: (纸本)9798350395044

Warehouses are an important logistic component of various companies. Warehouses may have different layouts, equipment and their own features. Optimization of warehouse operations can decrease overhead costs and increase the economic efficiency of industry. The technological process of steel sheet production at a metallurgical company includes two major stages: casting of liquid steel into billets and rolling of these billets on a rolling mill. In order to coordinate the productivity of these two stages and to be able to fulfill orders promptly, a warehouse of slabs (billets) is used. Billets of different parties and steel grades are stored in stacks. The billets are moved to the warehouse for storage and from the warehouse to the rolling mill by bridge cranes. In this paper the problem of optimization of the process of continuous cast billets storage is solved to minimize the number of slab handling operations. The problem is decomposed into two subproblems SLAP (Storage Location Assignment Problem) and CSP (Crane Scheduling Problem). A modified genetic algorithm was applied to solve the problem. Using a simulation model of the warehouse, the efficiency of the algorithm was evaluated using different approaches to take the restrictions imposed on the process of slab handling into account. It is shown that the most effective is the algorithm in which there is no restriction on the placement of stacks of billets belonging to one melting. © 2024 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

MFTN: A Multi-scale Feature Transfer Network Based on IMatchFormer for Hyperspectral Image Super-Resolution 41

MFTN: A Multi-scale Feature Transfer Network Based on IMatch...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Huang, Shuying Ren, Mingyang Yang, Yong Wang, Xiaozheng Wei, Yingzhi School of Software Tiangong University Tianjin China School of Computer Science and Technology Tiangong University Tianjin China School of Control Science and Engineering Tiangong University Tianjin China

Hyperspectral image super-resolution (HISR) aims to fuse a low-resolution hyperspectral image (LR-HSI) with a high-resolution multispectral image (HR-MSI) to obtain a high-resolution hyperspectral image (HR-HSI). Due to some existing HISR methods ignoring the significant feature difference between LR-HSI and HR-MSI, the reconstructed HR-HSI typically exhibits spectral distortion and blurring of spatial texture. To solve this issue, we propose a multi-scale feature transfer network (MFTN) for HISR. Firstly, three multi-scale feature extractors are constructed to extract features of different scales from the input images. Then, a multi-scale feature transfer module (MFTM) consisting of three improved feature matching Transformers (IMatchFormers) is designed to learn the detail features of different scales from HR-MSI by establishing the cross-model feature correlation between LR-HSI and degraded HR-MSI. Finally, a multiscale dynamic aggregation module (MDAM) containing three spectral aware aggregation modules (SAAMs) is constructed to reconstruct the final HR-HSI by gradually aggregating features of different scales. Extensive experimental results on three commonly used datasets demonstrate that the proposed model achieves better performance compared to state- of-the-art (SOTA) methods. Copyright 2024 by the author(s)

关键词： Image resolution

来源：评论

学校读者我要写书评

暂无评论

Propagation Characteristics of Partial Discharges in an Oil-Filled Power Transformer 17

Propagation Characteristics of Partial Discharges in an Oil-...

引用

17th IEEE International Conference on Compatibility, Power Electronics and Power engineering, CPE-POWERENG 2023

作者： Kameli, Sayed Mohammad Refaat, Shady S. Ghrayeb, Ali Abu-Rub, Haitham Guzinski, Jaroslaw Texas AandM University at Qatar Electrical and Computer Engineering Doha Qatar University of Hertfordshire School of Physics Engineering and Computer Science Department of Engineering United Kingdom Gdansk University of Technology Electrical and Control Engineering Faculty ul. Gabriela Narutowicza 11/12 Gdansk80-233 Poland

ISBN: (纸本)9798350300048

Power transformers are among the most important assets in the power transmission and distribution grid. However, they suffer from degradation and possible faults causing major electrical and financial losses. Partial discharges (PDs) are used to identify the insulation health status and their degradation level. PDs are incipient, low-magnitude faults caused by localized dielectric breakdown. Those activities emit signals in many forms, including electrical, chemical, acoustic, electromagnetic, and optical, facilitating various detection methods. This paper provides a theoretical basis for the condition evaluation of an oil-filled power transformer and clarifies the relationship between the operating voltage, void location, and electric-field intensity within the void. This was achieved by investigating the propagation characteristics of partial discharge signals in an oil-filled power transformer using a 3D finite element method (FEM) based simulation. Moreover, the characterization of simulated PD sources at different positions is investigated in this paper. The simulation results are curried out to show that air voids near the windings are subject to greatest peak electric field intensity. © 2023 IEEE.

关键词： Power transformers

来源：评论

学校读者我要写书评

暂无评论

Spectral graph theory to investigate topological and dynamic properties of EEG-based brain networks: An application to post-stroke patients 46

Spectral graph theory to investigate topological and dynamic...

引用

46th Annual International Conference of the IEEE engineering in Medicine and Biology Society, EMBC 2024

作者： Ranieri, Andrea Pichiorri, Floriana Mongiardini, Elena Colamarino, Emma Cincotti, Febo Mattia, Donatella Toppi, Jlenia Sapienza University of Rome Department of Computer Control and Management Engineering Rome00185 Italy Fondazione Santa Lucia Hospital Neuroelectrical Imaging and Bci Laboratory Rome00179 Italy

ISBN: (纸本)9798350371499

Brain networks represent one of the most fascinating biophysics contributions to modern medicine. Nowadays clinical practice largely benefits from network theory to characterize both physiological and pathological brain networks. However, to date the analysis of such systems still relies on classic approaches, thus limiting the amount of information extracted from those networks. As to overcome such a limitation, this work investigates the behavior of brain networks combinig combining both spectral graph theory and random walk analysis. Specifically, the algebraic connectivity and the relaxation time have been extracted from functional resting state brain networks estimated from a population of subacute post-stroke subjects. Results have been correlated with the Upper Extremity Fugl-Mayer Assessment (UEFMA) score of each subject as to assess whether a dependence exists between network's organization and motor impairment in the upper limb. © 2024 IEEE.

关键词： Network theory (graphs)

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preservation for Distributed Quantized k-means Clustering 59

Privacy-Preservation for Distributed Quantized k-means Clust...

引用

59th Annual Allerton Conference on Communication, control, and Computing, Allerton 2023

作者： Rikos, Apostolos I. Manitara, Nicolas E. Oliva, Gabriele Hadjicostis, Christoforos N. Boston University Division of Systems Engineering Department of Electrical and Computer Engineering BostonMA02215 United States University of Cyprus Department of Electrical and Computer Engineering Nicosia1678 Cyprus Università Campus Bio-Medico di Roma Unit of Automatic Control Department of Engineering Rome00128 Italy

ISBN: (纸本)9798350328141

In this paper, we enhance a distributed version of the well known k-means algorithm with privacy-preservation features. While ensuring that sensitive or confidential information remains undisclosed to unauthorized entities (in our case these entities are curious nodes within the network), we maintain the desirable features of the distributed algorithm: the transmitted values are quantized, which optimizes bandwidth utilization and alleviates communication bottlenecks, and nodes possess the ability to collectively determine when to terminate the algorithm, which enables the conservation of valuable resources. We introduce a novel privacy-preserving protocol that not only preserves the privacy of a node's state, but it also ensures confidentiality about its cluster affiliation (i.e., it does not reveal to curious nodes whether a node participates in the update calculation for a specific centroid value). Moreover, we precisely characterize topological conditions that guarantee privacy preservation for individual nodes. Our distributed algorithm allows the formation of exclusive clusters within a finite time frame on any static and strongly connected directed graph. © 2023 IEEE.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

A Reachability-decidable Petri Net Modeling Method and its Application to Flexible Manufacturing Systems

A Reachability-decidable Petri Net Modeling Method and its A...

引用

2023 International Conference on Automation in Manufacturing, Transportation and Logistics, iCaMaL 2023

作者： Su, Yue Qi, Liang Zhou, MengChu Wiśniewski, Remigiusz Faculty of Innovation Engineering Macau University of Science and Technology China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China Electrical and Computer Engineering New Jersey Institute of Technology Newark United States Institute of Control and Computation Engineering University of Zielona GÓra Poland

ISBN: (纸本)9781839539954

Petri nets (PNs) are graphical and mathematical tools used to model various discrete event systems and analyze their properties. Reachability is their fundamental property. When we use a state equation to determine a state's (marking's) reachability, the existence of legal firing sequences (LFSs) corresponding to nonnegative integer solutions (NISs) of the state equation needs to be determined. Our previous work has proposed an algorithm to determine the LFSs' existence in polynomial time. However, when a state equation has an infinite number of NISs, we cannot check all NISs to determine a marking's reachability. Hence, this work studies the relationship between the structure of an ordinary PN and the number of NISs of its state equation. Then, a method is proposed to modify the structure of the PN such that the state equation has no more than one NIS. The modified PN is used as the final model of the system, which maintains the functions of its modeled system. Its reachability can be determined in polynomial time. This work shows the application of the proposed method to a flexible manufacturing system's modeling and analysis. © The Institution of engineering & Technology 2023.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

FlexPDD: Enabling Proportional Delay Differentiation Service on Programmable Switches

FlexPDD: Enabling Proportional Delay Differentiation Service...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Jiang, Xinyue Kong, Dezhang Zhou, Zhengyan Wang, Di Chen, Shuangxi Wu, Chunming Zhejiang University College of Control Science and Engineering Hangzhou China Zhejiang University College of Computer Science and Technology Hangzhou China Jiaxing Vocational and Technical College Jiangxing China

ISBN: (纸本)9798350351255

Quality-of-Service (QoS) guarantees are crucial for meeting the diverse performance requirements of applications in packet networks. The Proportional Delay Differentiation (PDD) model offers relative service differentiation based on the delay requirements of different traffic classes. However, implementing PDD on current hardware switches faces challenges due to the lack of inherent queuing behavior description in switch ASICs. This paper introduces FlexPDD, a dynamic and adaptive packet prioritization mechanism designed to implement the PDD model on programmable switches. FlexPDD leverages the flexibility of programmable switch to adjust the mapping between packet classes and output queues dynamically, ensuring precise control over delay differentiation. Our implementation of FlexPDD on a Barefoot Tofino switch and an NS3 simulator demonstrates its feasibility and effectiveness. The results indicate that FlexPDD successfully maintains approximate delay differentiation among service classes proportional to their delay weights, highlighting its potential as a practical solution for achieving advanced service differentiation in modern network infrastructures. © 2024 IEEE.

关键词： Packet networks

来源：评论

学校读者我要写书评

暂无评论

Accelerating Data Transfer in Dataflow Architectures Through a Look-Ahead Acknowledgment Mechanism

引用

Journal of computer Science & Technology 2022年第4期37卷 942-959页

作者： Yu-Jing Feng De-Jian Li Xu Tan Xiao-Chun Ye Dong-Rui Fan Wen-Ming Li Da Wang Hao Zhang Zhi-Min Tang State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China Beijing Smartchip Microelectronics Technology Company Limited Beijing 100000China School of Computer and Control Engineering University of Chinese Academy of SciencesBeijing 100190China

The dataflow architecture,which is characterized by a lack of a redundant unified control logic,has been shown to have an advantage over the control-flow architecture as it improves the computational performance and power efficiency,especially of applications used in high-performance computing(HPC).Importantly,the high computational efficiency of systems using the dataflow architecture is achieved by allowing program kernels to be activated in a simultaneous ***,a proper acknowledgment mechanism is required to distinguish the data that logically belongs to different *** solutions include the tagged-token matching mechanism in which the data is sent before acknowledgments are received but retried after rejection,or a handshake mechanism in which the data is only sent after acknowledgments are ***,these mechanisms are characterized by both inefficient data transfer and increased area *** performance of the dataflow architecture depends on the efficiency of data *** order to optimize the efficiency of data transfer in existing dataflow architectures with a minimal increase in area and power cost,we propose a Look-Ahead Acknowledgment(LAA)*** accelerates the execution flow by speculatively acknowledging ahead without *** simulation analysis based on a handshake mechanism shows that our LAA increases the average utilization of computational units by 23.9%,with a reduction in the average execution time by 17.4%and an increase in the average power efficiency of dataflow processors by 22.4%.Crucially,our novel approach results in a relatively small increase in the area and power consumption of the on-chip logic of less than 0.9%.In conclusion,the evaluation results suggest that Look-Ahead Acknowledgment is an effective improvement for data transfer in existing dataflow architectures.

关键词： dataflow model control-flow model high-performance computing application data transfer power efficiency

来源：评论

学校读者我要写书评

暂无评论

Composing Like an Ancient Chinese Poet:Learn to Generate Rhythmic Chinese Poetry

引用

Journal of computer Science & Technology 2023年第6期38卷 1272-1287页

作者：何明陈艳赵洪科刘淇吴乐崔羽曾贵华刘贵全 Department of Electronic Engineering Shanghai Jiao Tong UniversityShanghai 200240China AI Laboratory Lenovo ResearchBeijing 100193China Baidu Incorporated Beijing 100193China College of Management and Economics Tianjin UniversityTianjin 300072China School of Computer Science and Technology University of Science and Technology of ChinaHefei 230027China School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230009China Risk Control Department OPayBeijing 100010China

Automatic generation of Chinese classical poetry is still a challenging problem in artificial ***-cently,Encoder-Decoder models have provided a few viable methods for poetry ***,by reviewing the pri-or methods,two major issues still need to be settled:1)most of them are one-stage generation methods without further polishing;2)they rarely take into consideration the restrictions of poetry,such as tone and ***,some an-cient Chinese poets tended first to write a coarse poem underlying aesthetics and then deliberated its semantics;while oth-ers first create a semantic poem and then refine its *** this basis,in order to better imitate the human creation procedure of poems,we propose a two-stage method(i.e.,restricted polishing generation method)of which each stage fo-cuses on the different aspects of poems(i.e.,semantics and aesthetics),which can produce a higher quality of generated *** this way,the two-stage method develops into two symmetrical generation methods,the aesthetics-to-semantics method and the semantics-to-aesthetics *** particular,we design a sampling method and a gate to formulate the tone and rhyme restrictions,which can further improve the rhythm of the generated *** results demon-strate the superiority of our proposed two-stage method in both automatic evaluation metrics and human evaluation met-rics compared with baselines,especially in yielding consistent improvements in tone and rhyme.

关键词： aesthetics poetry generation polishing semantics two-stage method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：