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

Sparse common feature representation for undersampled face recognition

IEEE Internet of Things Journal 2021年第7期8卷 5607-5618页

作者： Yang, Shicheng Wen, Ying He, Lianghua Zhou, MengChu Department of Computer Science and Technology Tongji University Shanghai200092 China Shanghai Key Laboratory of Multidimensional Information Processing Department of Computer Science and Technology East China Normal University Shanghai200241 China Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102 United States Center of Research Excellence in Renewable Energy and Power Systems King Abdulaziz University Jeddah21589 Saudi Arabia

This work investigates the problem of undersampled face recognition (i.e., insufficient training data) encountered in practical Internet-of-Things (IoT) applications. Insufficient and uncertain samples captured by IoT devices may include background and facial disguise that makes face recognition more challenging than that with sufficient and reliable images. Many models work well in face recognition on a big data set, but when training data are insufficient, they achieve unsatisfactory performance. This work proposes a novel method named sparse common feature-based representation (SCFR) that provides a unique and stable result and completely avoids very time-consuming training required by a deep learning model. Specially, it constructs a common feature dictionary using both training and test images. Thereinto, a common feature is based on a discriminative common vector and learned by a Gaussian mixture model for both training and test images in a semisupervised learninig manner, which would reduce the difference among samples in each class. In the optimization, the latent indicator of test data is initialized by the estimated label. This can avoid learning invalid information and lead to good prototype images. A new variation dictionary characterizes variables that can be shared by different classes. Finally, this work adopts minimum reconstruction residuals to recognize test images, thus bringing about a substantial improvement in SCFR's performance. Extensive results on benchmark face databases demonstrate that the proposed method is better than the state-of-the-art methods handling undersampled face recognition. © 2014 IEEE.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Real-Time Fault Detection and Diagnosis Method for Industrial Chemical Tennessee Eastman Process

Real-Time Fault Detection and Diagnosis Method for Industria...

引用

International Conference on Control, Decision and Information Technologies (CoDIT)

作者： Khadija Attouri Majdi Mansouri Mansour Hajji Abdelmalek Kouadri Kais Bouzrara Hazem Nounou Institut Superieur des Sciences Appliques et de Technologie de Kasserine Kairouan University Tunisia The Department of Electrical and Computer Engineering Program Texas A&M University at Qatar Doha Qatar Signals and Systems Laboratory Institute of Electrical and Electronics Engineering University M Hamed Bougara of Boumerdes Boumerdes Algeria The Research Laboratory of Automation Signal Processing and Image National Engineering School of Monastir Tunisia

ISBN: (数字)9798350373974

ISBN: (纸本)9798350373981

The accurate detection and diagnosis of faults are critical for maintaining optimal operation and ensuring the reliability of industrial processes. Notably, the topic of online fault detection and diagnosis has recently presented a significant challenge. This work mainly deploys a neural network technique for the comprehensive detection and diagnosis of faults within the Tennessee Eastman Process (TEP) on a low-computational power system, the Raspberry Pi board. The devolved methodology showcases a remarkable level of accuracy (94.50%) in diagnosing the various TEP faults, affirming its robustness and effectiveness. To elevate the practical applicability of the proposed approach, a meticulous investigation into the implementation of the suggested approach on a Raspberry Pi 4 card was undertaken. The successful realization of this implementation not only highlights the adaptability of the approach but also paves the way for its seamless integration into practical industrial applications.

关键词： Accuracy Embedded systems Fault detection Neural networks electrical fault detection Real-time systems Robustness Power system reliability Information technology Chemicals

来源：评论

学校读者我要写书评

暂无评论

Real-Time Fault Detection Scheme for Industrial Chemical Tennessee Eastman Process

Real-Time Fault Detection Scheme for Industrial Chemical Ten...

引用

International Conference on Control, Decision and Information Technologies (CoDIT)

ISBN: (数字)9798350373974

ISBN: (纸本)9798350373981

The key idea behind this study is to integrate a moving window dynamic PCA (MW-DPCA) methodology for fault detection within the Tennessee Eastman process (TEP) into a low-computational power system, the Raspberry Pi 4 card, for real-time application. Indeed, the paramount importance of real-time fault detection (FD) in intricate industrial processes presents a critical challenge. Various data-driven techniques have been developed to ensure safety, maintain operational stability, and optimize productivity in such processes. Principal Component Analysis (PCA) is a fundamental data-driven technique that utilizes dimensionality reduction to extract the most informative features from high-dimensional data, simplifying analysis and potentially revealing underlying fault patterns. However, PCA primarily focuses on static relationships and may miss crucial temporal dynamics for fault identification. This is where dynamic PCA (DPCA) excels. By incorporating lagged values of variables, DPCA captures the temporal evolution of features, enabling a more comprehensive understanding of process behavior and improving the detection of faults involving dynamic changes. In order to address the stochastic measurements, a moving average filter tool is also employed. The results obtained and the successful realization of this implementation demonstrate the adaptability of the approach and pave the way for its seamless integration into practical industrial applications.

关键词： Fault detection Power system dynamics Power system stability Feature extraction electrical fault detection Real-time systems Stability analysis Robustness Safety Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Designing of a Solar MPPT Controller with the Technique of Differentiation Between Uniform Irradiance and Partial Shading Conditions 9

Designing of a Solar MPPT Controller with the Technique of D...

引用

9th IEEE International Conference on Power and Energy, PECon 2022

作者： Ahmed, Sajib Mekhilef, Saad Mubin, Marizan Tey, Kok Soon Rawa, Muhyaddin University of Malaya Power Electronics and Renewable Energy Research Laboratory Faculty of Engineering Department of Electrical Engineering Kuala Lumpur50603 Malaysia School of Science Computing and Engineering Technologies Swinburne University of Technology HawthornVIC3122 Australia University of Malaya Faculty of Computer Science and Information Technology Department of Computer System and Technology Kuala Lumpur50603 Malaysia King Abdulaziz University Center of Research Excellence in Renewable Energy and Power Systems Jeddah21589 Saudi Arabia

ISBN: (数字)9781665409902

ISBN: (纸本)9781665409902

Solar energy is considered one of the best essential energy sources to solve the present power crisis. The solar photovoltaic system has a low conversion efficiency that inflicts maximum power extractions. The non-linear relationship between the voltage and current insists on using a maximum power point tracking (MPPT) controller. Perturb and observe (P&O) MPPT controller is popular because of its simple design and cost-effectiveness features;nonetheless, it has drawbacks while operating under partial shading conditions (PSC). The maximum power trapezium (MPT) method modified the P&O algorithm by incorporating an appropriate scanning mechanism for PSC. Despite having good PSC performance, this method's tracking time is much longer than the conventional algorithm in both uniform irradiance conditions (UIC) and PSC. The algorithm proposed in this paper modifies the MPT method with an extra strategy to distinguish between the UIC and PSC. If the pattern is recognized as UIC, the proposed method utilizes the conventional P&O algorithm to track the MPP;otherwise, scanning techniques are being used. The proposed algorithm's operation was tested on simulation using distinct UIC and PSC patterns and worked effectively. © 2022 IEEE.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

SEE-MCAM: Scalable Multi-Bit FeFET Content Addressable Memories for Energy Efficient Associative Search

SEE-MCAM: Scalable Multi-Bit FeFET Content Addressable Memor...

引用

IEEE International Conference on computer-Aided Design

作者： Shengxi Shou Che-Kai Liu Sanggeon Yun Zishen Wan Kai Ni Mohsen Imani X. Sharon Hu Jianyi Yang Cheng Zhuo Xunzhao Yin College of Information Science and Electronic Engineering Zhejiang University China Department of Information and Computer Science University of California Irvine USA School of Electrical and Computer Engineering Georgia Institute of Technology USA Department of Electrical and Microelectronic Engineering Rochester Institute of Technology USA Department of Computer Science and Engineering University of Notre Dame USA School of Micro-Nano Electronics. Zhejiang University China Key Laboratory of Collaborative Sensing and Autonomous Unmaned Systems of Zhejiang Province China

Artificial intelligence has made remarkable advancements in recent years, leading to the development of algorithms and models capable of handling ever-increasing amounts of data. The computational demands of these algorithms necessitate circuit and architecture designs that go beyond the von-Neumann paradigm. Content addressable memories (CAMs), which implement parallel associative search functionality within memory blocks to overcome the memory wall bottleneck, have proven to be effective for data-intensive tasks. While current CAM designs have achieved higher storage density and energy efficiency than their CMOS-based counterparts by leveraging emerging non-volatile memories (NVM), most of these implementations are limited to binary storage cells. In this work, we propose SEE-MCAM, scalable and compact multi-bit CAM (MCAM) designs that utilize the three-terminal ferroelectric FET (FeFET) as the proxy. By exploiting the multi-level-cell characteristics of FeFETs, our proposed SEE-MCAM designs enable multi-bit associative search functions and achieve better energy efficiency and performance than existing FeFET-based CAM designs. We validated the functionality of our proposed designs by achieving 3 bits per cell CAM functionality, resulting in 3x improvement in storage density. The area per bit of the proposed SEE-MCAM cell is 8% of the conventional CMOS CAM. We thoroughly investigated the scalability and robustness of the proposed design. Evaluation results suggest that the proposed 2FeFET-1 T SEE-MCAM achieves 9.8× more energy efficiency and 1.6× less search latency compared to the CMOS CAM, respectively. When compared to existing MCAM designs, the proposed SEE-MCAM can achieve 8.7× and 4.9× more energy efficiency than ReRAM-based and FeFET-based MCAMs, respectively. Benchmarking results show that our approach provides up to 3 orders of magnitude improvement in speedup and energy efficiency over a GPU implementation in accelerating a novel quantized hyperdimensiona

关键词：

来源：评论

学校读者我要写书评

暂无评论

Internet-of-Things technology and applications for clean energy systems

Energy Conversion and Economics

引用

Energy Conversion and Economics 2021年第4期2卷 183-185页

作者： Strunz, Kai Wang, Xuanyuan Guo, Qinglai Xie, Le Zhang, Song Fang, Xin Wang, Jianxiao School of Electrical Engineering and Computer Science Berlin10587 Germany State Grid Jibei Electric Power Co. LTD. Beijing China Department of Electrical Engineering Tsinghua University Beijing China Department of Electrical and Computer Engineering Texas A&M University College StationTX United States Department of Business Architecture and Technology ISO New England Inc. HolyokeMA United States Power Systems Engineering Center National Renewable Energy Laboratory GoldenCO United States School of Electrical and Electronic Engineering North China Electric Power University Beijing China

[...]future research interests regarding IESSs are summarised. A multi-stage PMU placement strategy was developed to alleviate power system vulnerability to possible false data injection attacks, where forward dynamic programming was used to distribute the capital cost of PMUs over a certain period. Three clustering methods, including linear regression, density-based spatial clustering of applications with noise (DBSCAN), and Gaussian mixture models (GMM), were combined for bad PMU data detection.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multiple Redundant Weighted Cluster Path Scheduling Scheme for Damaged Sensor-Based Wireless Sensor Network

Multiple Redundant Weighted Cluster Path Scheduling Scheme f...

引用

IEEE Future Networks World Forum (FNWF)

作者： Grace Khayat Constandinos X Mavromoustakis Andreas Pitsillides Jordi Mongay Batalla Houbing Song Department of Computer Science Mobile Systems Laboratory (MoSys Lab) University of Nicosia Nicosia Cyprus Department of Computer Science Department of Electrical & Electronic Engineering Science University of Cyprus Cyprus University of Johannesburg (Visiting Professor) Warsaw University of Technology Warsaw Poland Department of Information Systems University of Maryland Baltimore Country Baltimore MD USA

In a predefined geographical field, a group of sensor nodes communicating wirelessly form a Wireless Sensor Network (WSN). The sensors' goal is to upload the sensed data to the control station to determine if any immediate action should be taken or to analyze and monitor the situation. In clustering algorithms, the sensors are grouped as clusters, where each cluster has one sensor selected as the cluster head (CH) responsible for all inter-cluster communication. In a crisis scenario, the CH might be non-functional, resulting in a disconnected cluster. An enhanced WSN weighted cluster routing scheme is proposed in this paper. A cluster index based on distance, rewarding index, and energy is used to select the CH and cluster members (CM). The proposed scheme aims at ensuring that the data is uploaded even though the CH is non-functional by selecting a redundant CH for every node. Therefore, no matter how many sensors are inactive, a CH is still selected to ensure inter-cluster communication. The delays generated in the proposed routing scheme are studied using MATLAB simulation. In addition, the effect of different weights is studied on the delay.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Fast Mapping of Flexibility Regions at TSO-DSO Interfaces under Uncertainty

arXiv

引用

arXiv 2022年

作者： Patig, Alice Stanojev, Ognjen Aristidou, Petros Kiprakis, Aristides Hug, Gabriela Eeh - Power Systems Laboratory Eth Zurich Switzerland Department of Electrical Engineering Computer Engineering and Informatics Cyprus University of Technology Cyprus Institute for Energy Systems School of Engineering University of Edinburgh United Kingdom

The gradual decommissioning of fossil fuel-driven power plants, that traditionally provide most operational flexibility in power systems, has led to more frequent grid stability issues. To compensate for the lack of flexible resources, Distributed Energy Resources (DERs) in distribution networks can be employed. To facilitate the use of DERs, the aggregated flexibility in a distribution grid is commonly represented on a PQ-plane displaying the feasible active and reactive power exchange with the upstream grid. This paper proposes a fast feasible operating region mapping mechanism that utilizes a linear power flow approximation in combination with linearized generator, current, and voltage constraints to construct a high-dimensional polyhedral feasible set of DER power injections. The obtained polytope is projected onto the PQ-plane using Fourier-Motzkin Elimination to represent the aggregate network flexibility. Additionally, uncertainty in DER generation is addressed using chance-constraints. Our analysis of a modified 33-bus IEEE test system demonstrates that the proposed method obtains more accurate approximations than former geometric methods and is ten times faster than the tested optimization-based method. Copyright © 2022, The Authors. All rights reserved.

关键词： Electric load flow

来源：评论

学校读者我要写书评

暂无评论

Low-Overhead Channel Estimation via 3D Extrapolation for TDD mmWave Massive MIMO systems Under High-Mobility Scenarios

arXiv

引用

arXiv 2024年

作者： Zhou, Binggui Yang, Xi Ma, Shaodan Gao, Feifei Yang, Guanghua School of Intelligent Systems Science and Engineering Jinan University Zhuhai519070 China State Key Laboratory of Internet of Things for Smart City The Department of Electrical and Computer Engineering University of Macau China Shanghai Key Laboratory of Multidimensional Information Processing East China Normal University Shanghai200241 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China State Key Laboratory of Internet of Things for Smart City The Department of Electrical and Computer Engineering University of Macau 999078 China Department of Automation Tsinghua University Beijing100084 China School of Intelligent Systems Science and Engineering Guangdong International Cooperation Base of Science and Technology for GBA Smart Logistics Jinan University Zhuhai519070 China

In time division duplexing (TDD) millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems, downlink channel state information (CSI) can be obtained from uplink channel estimation thanks to channel reciprocity. However, under high-mobility scenarios, frequent uplink channel estimation is needed due to channel aging. Additionally, large amounts of antennas and subcarriers result in high-dimensional CSI matrices, aggravating pilot training overhead. To address this, we propose a three-domain (3D) channel extrapolation framework across spatial, frequency, and temporal domains. First, considering the effectiveness of traditional knowledge-driven channel estimation methods and the marginal effects of pilots in the spatial and frequency domains, a knowledge- and-data driven spatial-frequency channel extrapolation network (KDD-SFCEN) is proposed for uplink channel estimation via joint spatial-frequency channel extrapolation to reduce spatial-frequency domain pilot overhead. Then, leveraging channel reciprocity and temporal dependencies, we propose a temporal uplink-downlink channel extrapolation network (TUDCEN) powered by generative artificial intelligence for slot-level channel extrapolation, aiming to reduce the tremendous temporal domain pilot overhead caused by high mobility. Numerical results demonstrate the superiority of the proposed framework in significantly reducing the pilot training overhead by 16 times and improving the system’s spectral efficiency under high-mobility scenarios compared with state-of-the-art channel estimation/extrapolation methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Frequency estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：