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

IEEE Journal on Flexible Electronics 2025年第2期4卷 98-107页

作者： Jahan, Sharmin Lazarus, Nathan University of Delaware Electrical and Computer Engineering Department NewarkDE19716 United States

Additive manufacturing is a powerful approach forintegrating flexible and stretchable conductors into complex3-D structures, but many current printing technologies, suchas direct ink writing (DIW), are expensive and challengingto access for many potential users, such as hobbyists andsmall companies. In this work, a low-cost commercial fusedfilament fabrication (FFF) 3-D printer is used to manufacturelow-resistivity stretchable serpentine conductors. By using dualextruder heads, serpentines are printed in a highly conductivemetal-particulate-based composite on a thermoplastic elastomer(TPE) part and demonstrated to survive mechanical strains of upto 25%, sufficient for use in close contact with the human *** electroless plating is also demonstrated to metalize theprinted traces, depositing a thin layer of copper for improvedelectrical conductivity. Using this approach, we demonstrateconductivity improvements by about three orders of magnitude(∼ 103) over past FFF printed serpentines, a major milestonein making stretchable electronics cheaper and more *** resulting stretchable conductors are then demonstrated toprint devices, including stretchable inductors and stretchableinterconnect on a soft robotic actuator. © 2022 IEEE.

关键词： Reinforced plastics

来源：评论

学校读者我要写书评

暂无评论

Exploring Hyperdimensional Computing Robustness Against Hardware Errors

引用

IEEE Transactions on computers 2025年第6期74卷 1963-1977页

作者： Zhang, Sizhe Juretus, Kyle Jiao, Xun Villanova University Department of Electrical and Computer Engineering VillanovaPA19085 United States

Brain-inspired hyperdimensional computing (HDC) is an emerging machine learning paradigm leveraging high-dimensional spaces for efficient tasks like pattern recognition and medical diagnostics. As a lightweight alternative to deep neural networks, HDC offers smaller model sizes, reduced computation, and memory-centric processing. However, deploying HDC in safety-critical applications, such as healthcare and robotics, is challenged by hardware-induced errors. This paper investigates HDC's robustness to memory errors via extensive bit-flip injection experiments on item and associative memories. Results reveal that certain bit-flips severely degrade accuracy. To address this, we introduce the Hyperdimensional Bit-Flip Search (HD-BFS), a similarity-guided method for identifying vulnerabilities and crafting efficient attacks, where flipping just 6 critical bits—3.9% of random bit-flips—reduces accuracy to chance levels. We further propose Hyperdimensional Accelerated Bit-Flip Search (HD-ABFS), which narrows the search space by targeting critical dimensions and most significant bits (MSBs), achieving up to 282x speedup over HD-BFS. Finally, we develop an effective protection mechanism to enhance model safety. These insights highlight HDC's resilience to random errors, offer robust defenses against targeted attacks, and advance the security and reliability of HDC systems. © 1968-2012 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Meta-ETI: Meta-Reinforcement Learning with Explicit Task Inference for UAV-IoT Coverage

引用

IEEE Internet of Things Journal 2025年第13期12卷 23852-23865页

作者： Huang, Songjun Sun, Chuanneng Pompili, Dario Rutgers University-New Brunswick Department of Electrical and Computer Engineering NJ United States

To better enhance the network service for different user devices in various scenarios, unmanned aerial vehicles (UAVs) are increasingly used as aerial base stations (ABSs). However, optimizing coverage for user devices via UAV team control is an NP-hard problem and escalates exponentially in complexity with the growing number of user devices. To address this challenge, researchers have turned to reinforcement learning (RL) for a more practical solution. With the growing prevalence of the Internet of Things (IoT), the diversity of user devices increases, posing challenges for traditional RL, as i) the spatial distribution of devices becomes more complex;ii) variations in device types and device mobility increase the training latency;iii) the high-speed movement of IoT devices can lead to performance deterioration in widely used RL algorithms with discrete action space;and iv) traditional RL struggles to adapt to new environments. To solve these problems, we propose a new meta-RL framework, Meta-RL with Explicit Task Inference (Meta-ETI). Then, we apply this framework to efficiently train an energy-efficient UAV control policy for fair and effective coverage in 3D dynamic environments. Meta-ETI is evaluated in both theoretical and application-related aspects and demonstrates superior performance compared to the baseline frameworks. The result shows that Meta-ETI demonstrates 2 to 3 times faster adaptation speed and a decent performance in sample efficiency. Furthermore, in the UAV-IoT coverage application, Meta-ETI shows 30% to 50% better in energy efficiency and 40% to 60% more served devices because of the fair coverage. © 2014 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A Scalable Unsupervised and Back Propagation Free Learning With SACSOM: A Novel Approach to SOM-Based Architectures

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第4期6卷 955-967页

作者： Hirani, Gaurav R. Wang, Kevin I-Kai Abdulla, Waleed H. The University of Auckland Department of Electrical Computer and Software Engineering Auckland1010 New Zealand

The field of computer vision is predominantly driven by supervised models, which, despite their efficacy, are computationally expensive and often intractable for many applications. Recently, research has expedited alternative avenues such as self-organizing maps (SOM)-based architectures, which offer significant advantages such as tractability, the absence of back-propagation, and feed-forward unsupervised learning. However, these SOM-based approaches frequently suffer from lower accuracy and limited generalization capabilities. To address these shortcomings, we propose a novel model called split and concur SOM (SACSOM). SACSOM overcomes the limitations of closely related SOM-based algorithms by utilizing multiple parallel branches, each equipped with its own SOM modules that process data independently with varying patch sizes. Furthermore, by creating groups of classes and using respective training samples to train independent subbranches in each branch, our approach accommodates datasets with a large number of classes. SACSOM employs a simple yet effective labeling technique requiring minimal labeled samples. The outputs from each branch, filtered by a threshold, contribute to the final prediction. Experimental validation on MNIST-digit, Fashion-MNIST, CIFAR-10, and CIFAR-100 demonstrates that SACSOM achieves competitive accuracy with significantly reduced computation time. Furthermore, it exhibits superior performance and generalization capabilities, even in high-noise scenarios. The weights of the single-layered SACSOM provide meaningful insights into the patch-based learning pattern, enhancing its tractability and making it ideal from the perspective of explainable AI. This study addresses the limitations of current clustering techniques, such as K-means and traditional SOMs, by proposing a lightweight, manageable, and fast architecture that does not require a GPU, making it suitable for low-powered devices. © 2024 IEEE.

关键词： Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Matrix Completion from One-Bit Dither Samples

引用

IEEE Transactions on Signal Processing 2024年 1-14页

作者： Eamaz, Arian Yeganegi, Farhang Soltanalian, Mojtaba Department of Electrical and Computer Engineering University of Illinois Chicago Chicago IL USA

We explore the impact of coarse quantization on matrix completion in the extreme scenario of dithered one-bit sensing, where the matrix entries are compared with random dither levels. In particular, instead of observing a subset of high-resolution entries of a low-rank matrix, we have access to a small number of one-bit samples, generated as a result of these comparisons. In order to recover the low-rank matrix using its coarsely quantized known entries, we begin by transforming the problem of one-bit matrix completion (one-bit MC) with random dithering into a nuclear norm minimization problem. The one-bit sampled information is represented as linear inequality feasibility constraints. We then develop the popular singular value thresholding (SVT) algorithm to accommodate these inequality constraints, resulting in the creation of the One-Bit SVT (OBSVT). Our findings demonstrate that incorporating multiple random dither sequences in one-bit MC can significantly improve the performance of the matrix completion algorithm. In pursuit of achieving this objective, we utilize diverse dithering schemes, namely uniform, Gaussian, and discrete dithers. To accelerate the convergence of our proposed algorithm, we introduce three variants of the OB-SVT algorithm. Among these variants is the randomized sketched OB-SVT, which departs from using the entire information at each iteration, opting instead to utilize sketched data. This approach effectively reduces the dimension of the operational space and accelerates the convergence. We perform numerical evaluations comparing our proposed algorithm with the maximum likelihood estimation method previously employed for one-bit MC, and demonstrate that our approach can achieve a better recovery performance. Authors

关键词： Linear matrix inequalities

来源：评论

学校读者我要写书评

暂无评论

Multi-Model emotion recognition from speech using StarGAN, DCNN, and SVM

引用

Multimedia Tools and Applications 2025年 1-18页

作者： Banihosseini, Najmeh Sadat Ghods, Vahid Department of Electrical and Computer Engineering Semnan Branch Islamic Azad University Semnan Iran

Emotion recognition from speech is a significant research area in human–computer interaction and psychological assessments. This study proposes a novel three-stage process for emotion recognition from speech signals. In the first stage, pre-processing operations, including noise reduction and normalization, are applied to improve data quality. Then, StarGAN is employed for data augmentation, addressing the challenge of limited emotional speech data. The second stage involves extracting meaningful features from high-dimensional data using deep convolutional neural networks (DCNN). Finally, support vector machines (SVM) are used to classify the extracted features into distinct emotional categories. The main advantage of the proposed method over traditional deep learning techniques is the use of StarGAN for data augmentation, which improves performance on limited datasets. Additionally, the combination of DCNN and SVM enhances accuracy and efficiency in feature extraction and classification. This method has been evaluated using four different datasets, RAVDESS, Emo-DB, SAVEE, and CASIA, achieving accuracy rates of 98.25%, 95.5%, 96.8%, and 96.45%, respectively. The results indicate that the proposed method significantly outperforms existing methods and offers improved capabilities for practical application. Despite achieving high accuracy, challenges such as increased computational complexity and variability in performance across different datasets are discussed. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Switching Dynamic State Estimation and Event Detection for Inverter-Based Resources with Multiple Control Modes

引用

IEEE Transactions on Power Systems 2024年第4期40卷 3439-3451页

作者： Huang, Heqing Lin, Yuzhang Department of Electrical and Computer Engineering New York University Brooklyn NY USA

The Dynamic State Estimation (DSE) for Inverter-Based Resources (IBRs) is an emerging topic as IBRs gradually replace synchronous generators (SGs) in power systems. Unlike SGs, the dynamic models of IBRs heavily depend on their control algorithms, and conventional DSE methods for SGs, which assume a unchanged state space and dynamic model, cannot handle IBRs with control mode changes in real time, particularly when the power grid operators are unaware of the current control mode of the IBRs. In response to these challenges, an Expectation-Maximization Sliding-Window Iterated Extended Kalman Filter (EM-SW-IEKF) method is proposed in this paper. It theoretically achieves maximum likelihood estimation under different modes through the EM algorithm, providing the most probable control mode of the system as well as the corresponding state estimate. This method is validated in various IBR systems (battery energy storage systems and solar photovoltaic systems) and under different control mode transitions (switching between grid-following and grid-forming controls and between low voltage ride through and maximum power point tracking controls). © 1969-2012 IEEE.

关键词： Expectation maximization algorithm

来源：评论

学校读者我要写书评

暂无评论

Learning-Based Compress-and-Forward Schemes for the Relay Channel

引用

IEEE Journal on Selected Areas in Communications 2025年第7期43卷 2393-2404页

作者： Ozyilkan, Ezgi Carpi, Fabrizio Garg, Siddharth Erkip, Elza New York University Department of Electrical and Computer Engineering BrooklynNY United States

The relay channel, consisting of a source-destination pair along with a relay, is a fundamental component of cooperative communications. While the capacity of a general relay channel remains unknown, various relaying strategies, including compress-and-forward (CF), have been proposed. In CF, the relay forwards a quantized version of its received signal to the destination. Given the correlated signals at the relay and destination, distributed compression techniques, such as Wyner–Ziv coding, can be harnessed to utilize the relay-to-destination link more efficiently. Leveraging recent advances in neural network-based distributed compression, we revisit the relay channel problem and integrate a learned task-aware Wyner–Ziv compressor into a primitive relay channel with a finite-capacity out-of-band relay-to-destination link. The resulting neural CF scheme demonstrates that our compressor recovers binning of the quantized indices at the relay, mimicking the optimal asymptotic CF strategy, although no structure exploiting the knowledge of source statistics was imposed into the design. The proposed neural CF, employing finite order modulation, operates closely to the rate achievable in a primitive relay channel with a Gaussian codebook. We showcase the advantages of exploiting the correlated destination signal for relay compression through various neural CF architectures that involve end-to-end training of the compressor and the demodulator components. Our learned task-oriented compressors provide the first proof-of-concept work toward interpretable and practical neural CF relaying schemes. © 1983-2012 IEEE.

关键词： Compressors

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning Data Collection for Bayesian Inference of Hidden Markov Models

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1217-1232页

作者： Alali, Mohammad Imani, Mahdi Northeastern University Department of Electrical and Computer Engineering BostonMA02115 United States

Hidden Markov models (HMMs) are a powerful class of dynamical models for representing complex systems that are partially observed through sensory data. Existing data collection methods for HMMs, typically based on active learning or heuristic approaches, face challenges in terms of efficiency in stochastic domains with costly data. This article introduces a Bayesian lookahead data collection method for inferring HMMs with finite state and parameter spaces. The method optimizes data collection under uncertainty using a belief state that captures the joint distribution of system states and models. Unlike traditional approaches that prioritize short-term gains, this policy accounts for the long-term impact of data collection decisions to improve inference performance over time. We develop a deep reinforcement learning policy that approximates the optimal Bayesian solution by simulating system trajectories offline. This pretrained policy can be executed in real time, dynamically adapting to new conditions as data is collected. The proposed framework supports a wide range of inference objectives, including point based, distribution based, and causal inference. Experimental results across three distinct systems demonstrate significant improvements in inference accuracy and robustness, showcasing the effectiveness of the approach in uncertain and data-limited environments. © 2020 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Incorporation of plasmonic metal-metal and metal-oxide configurations in a polymer solar cell: introducing inorganic features to organic photovoltaics

引用

Optical and Quantum Electronics 2025年第4期57卷 1-16页

作者： Heidarzadeh, Hamid Department of Electrical and Computer Engineering University of Mohaghegh Ardabili Ardabil Iran

In thicker polymer active layers charge collection efficiency suffers due to low carrier mobility and increased recombination losses. In thin absorber polymer solar cell to increase absorption, light-trapping techniques and plasmonic structures are essential. This study investigates the effect of shell thickness on the photocurrent density of a poly(3-hexylthiophene): phenyl-C61- butyric acid methyl ester (P3HT:PCBM) polymer based solar cell incorporating core–shell nanoparticles with configurations of Au–Ag and Ag-Au core–shell nanoparticles. Through a series of simulation, the photocurrent density was calculated as a function of shell thickness. The results demonstrate that, for both nanoparticle configurations, the photocurrent density generally increases with shell thickness, reaching an optimal point before stabilizing or slightly decreasing. Additionally, the effects of dielectric shells made of SiO₂ and Al₂O₃ on its performance parameters were analyzed. The study also found that the photocurrent decreases with increasing shell thickness for both SiO₂ and Al₂O₃ shells, with a more pronounced decrease for SiO₂ due to its smaller refractive index and greater change in shorter wavelengths. The photocurrent density of 13.74 mA/cm2 is achieved for a cell with a thickness of 80 nm without nanoparticles. This value increases to 16.62 mA/cm2 for a cell incorporating Ag nanoparticles and reaches 19.3 mA/cm2 for a cell with Au–Ag core–shell nanoparticles at the optimal shell thickness. The power conversion efficiency of the polymer solar cell increases from 7.02% without nanoparticles to 8.67% with Ag, 8.45% with Au, and reaches the highest value of 10.26% with Au–Ag core–shell nanoparticles, highlighting the superior performance of the core–shell configuration. This superior performance is attributed to the enhanced plasmonic effects of the Au–Ag combination, which facilitates better light trapping and absorption. These findings underscore the importance of optimizing

关键词： Plasmonics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：