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

Innovative Design for Mutual Coupling Reduction in Dual-Element Array Antennas for ISM Applications Using Whale Optimization Algorithm

引用

Progress in Electromagnetics Research C 2025年 152卷 121-129页

作者： Atashpanjeh, Elham Rezaei, Pejman Department of Electrical and Computer Engineering Semnan University Semnan35131-19111 Iran

This paper introduces a decoupled dual-element array antenna designed to address the challenges of mutual coupling between elements. To tackle this issue, a neutralization line is strategically incorporated to suppress leaky surface currents, while ensuring that the antenna’s central frequency and radiation pattern remain intact. The dimensions of the neutralization line are carefully optimized using the Whale Optimization Algorithm (WOA) to achieve the best possible performance, focusing on minimizing mutual coupling and enhancing gain. By placing the neutralization line nearby between the two elements, surface currents are efficiently redirected back to the radiating element, preventing leakage to neighboring elements. This approach also results in a more compact structure. The proposed antenna, with overall dimensions of 50 mm × 30 mm × 1.6 mm, is simulated using analytic software. It achieves an impressive 27 dB reduction in mutual coupling and delivers an ultra-wide bandwidth of 1.2 GHz within the Industrial Scientific and Medical (ISM) band at an operating frequency of 2.4 GHz, with a measured maximum gain of −5.19 dB. The structure was fabricated, and experimental results closely matched the simulations, confirming the design’s effectiveness. By leveraging the WOA optimization method, the geometry of the neutralization line was fine-tuned to maximize performance, significantly improving inter-element decoupling. This design approach is simple yet effective and can be readily extended to other antenna array configurations, demonstrating strong potential for compact and efficient ISM band applications. © 2025, Electromagnetics Academy. All rights reserved.

关键词： Directional patterns (antenna)

来源：评论

学校读者我要写书评

暂无评论

COLT: Cyclic Overlapping Lottery Tickets for Faster Pruning of Convolutional Neural Networks

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第6期6卷 1664-1678页

作者： Hossain, Md. Ismail Rakib, Mohammed Elahi, M. M. Lutfe Mohammed, Nabeel Rahman, Shafin North South University Department of Electrical and Computer Engineering Dhaka1229 Bangladesh

Pruning refers to the elimination of trivial weights from neural networks. The sub-networks within an overparameterized model produced after pruning are often called Lottery tickets. This research aims to generate winning lottery tickets from a set of lottery tickets that can achieve accuracy similar to that of the original unpruned network. We introduce a novel winning ticket called Cyclic Overlapping Lottery Ticket (COLT) by data splitting and cyclic retraining of the pruned network from scratch. We apply a cyclic pruning algorithm that keeps only the overlapping weights of different pruned models trained on different data segments. Our results demonstrate that COLT can achieve similar accuracies (obtained by the unpruned model) while maintaining high sparsities. Based on object recognition and detection tasks, we show that the accuracy of COLT is on par with the winning tickets of the Lottery Ticket Hypothesis (LTH) and, at times, is better. Moreover, COLTs can be generated using fewer iterations than tickets generated by the popular Iterative Magnitude Pruning (IMP) method. In addition, we also notice that COLTs generated on large datasets can be transferred to small ones without compromising performance, demonstrating its generalizing capability. We conduct all our experiments on Cifar-10, Cifar-100, TinyImageNet, and ImageNet datasets and report superior performance than the state-of-the-art methods. The codes are available at: https://***/ismail31416/COLT. © 2020 IEEE.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Characteristic Aware Index Structure Optimized for Real-world Datasets

引用

ACM Transactions on Storage 2025年第2期21卷 1-32页

作者： Yang, Jin Yoon, Heejin Yun, Gyeongchan Noh, Sam H. Choi, Young-Ri Computer Science and Engineering Unist Ulsan Korea Republic of Department of Computer Science Virginia Tech Blacksburg United States

Many datasets in real life are complex and dynamic, that is, their key densities are varied over the whole key space and their key distributions change over time. It is challenging for an index structure to efficiently support all key operations for data management, in particular, search, insert, and scan, for such dynamic datasets. In this article, we present DyTIS (Dynamic dataset Targeted Index Structure), an index that targets dynamic datasets. DyTIS, although based on the structure of Extendible hashing, leverages the CDF of the key distribution of a dataset, and learns and adjusts its structure as the dataset grows. The key novelty behind DyTIS is to group keys by the natural key order and maintain keys in sorted order in each bucket to support scan operations within a hash index. We also define what we refer to as a dynamic dataset and propose a means to quantify its dynamic characteristics. Our experimental results show that DyTIS provides higher performance than the state-of-the-art learned index for the dynamic datasets considered. We also analyze the effects of the dynamic characteristics of datasets, including sequential datasets, as well as the effect of multiple threads on the performance of the indexes. © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Dynamic datasets index structure key distribution

来源：评论

学校读者我要写书评

暂无评论

Design of a Level-3 electric vehicle charging station using a 1-MW solar system via the distributed maximum power point tracking technique

引用

Clean Energy 2024年第1期8卷 23-35页

作者： Afshin Balal Michael Giesselmann Department of Electrical and Computer Engineering Texas Tech UniversityLubbockTX 79409USA

Solar power is mostly influenced by solar irradiation,weather conditions,solar array mismatches and partial shading ***,before installing solar arrays,it is necessary to simulate and determine the possible power *** power point tracking is needed in order to make sure that,at any time,the maximum power will be extracted from the photovoltaic ***,maximum power point tracking is not a suitable solution for mismatches and partial shading *** overcome the drawbacks of maximum power point tracking due to mismatches and shadows,distributed maximum power point tracking is util-ized in this *** solar farm can be distributed in different ways,including one DC-DC converter per group of modules or per *** this paper,distributed maximum power point tracking per module is implemented,which has the highest *** technology is applied to electric vehicles(EVs)that can be charged with a Level 3 charging station in<1 ***,the problem is that charging an EV in<1 hour puts a lot of stress on the power grid,and there is not always enough peak power reserve in the existing power grid to charge EVs at that ***,a Level 3(fast DC)EV charging station using a solar farm by implementing distributed maximum power point tracking is utilized to address this ***,the simulation result is reported using MATLAB®,LTSPICE and the System Advisor *** results show that the proposed 1-MW solar system will provide 5 MWh of power each day,which is enough to fully charge~120 EVs each ***,the use of the proposed photovoltaic system benefits the environment by removing a huge amount of greenhouse gases and hazardous *** example,instead of supplying EVs with power from coal-fired power plants,1989 pounds of CO_(2) will be eliminated from the air per hour.

关键词： electric vehicles(EVs) distributed maximum power point tracking solar farm DC fast-charging station step-up DC-DC converter System Advisor Model economic analysis

来源：评论

学校读者我要写书评

暂无评论

Learning and Optimization over Robust Networked Systems

引用

Performance Evaluation Review 2025年第3期52卷 23-26页

作者： Lin, I-Cheng Department of Electrical and Computer Engineering Carnegie Mellon University United States

来源：评论

学校读者我要写书评

暂无评论

A Generalized Delay and Backlog Analysis for Multiplexing URLLC and eMBB: Reconfigurable Intelligent Surfaces or Decode-and-Forward?

引用

IEEE Transactions on Wireless Communications 2024年第5期23卷 4049-4068页

作者： Peng, Haoran Hsia, Ching-Chieh Han, Zhu Wang, Li-Chun Wenzhou University College of Electrical and Electronic Engineering Zhejiang Wenzhou325035 China National Yang Ming Chiao Tung University Department of Electrical and Computer Engineering Hsinchu300 Taiwan University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul02447 Korea Republic of

By creating multipath backscatter links and amplify signal strength, reconfigurable intelligent surfaces (RIS) and decode-and-forward (DF) relaying are shown to degrade the latency of the ultrareliable low-latency communications (URLLCs) and enhanced mobile broadband (eMBB) multiplexing system. This study investigates the delay and backlog violation behavior of URLLCs and eMBB multiplexing systems supported by different technologies, e.g. RIS and DF relay, for different scheduling policies of static priority, nonpreemption, and earliest deadline first. A tight analysis approach based on the Martingale theory was proposed to evaluate the serviceability of URLLC and eMBB multiplexing systems. On this basis, the Martingale theory analyzes the delay and backlog bounds by transforming the arrival and service processes into exponential forms of the moment generating function. Furthermore, this study derives the closed-form expression of delay and backlog bound for the URLLCs and eMBB multiplexing in two-hop heterogeneous communication networks. Numerical results demonstrate that the proposed Martingale-based tightly analytical method outperforms the state-of-the-art classic stochastic network calculus for evaluating delay and backlog violation in URLLC and eMBB multiplexing systems. © 2002-2012 IEEE.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

Robust Bidirectional Platoon Control for Mesh Stability of Vehicular Systems With Uncertain Kinematics and Dynamics

IEEE Transactions on Intelligent Vehicles

引用

IEEE Transactions on Intelligent Vehicles 2024年 1-14页

作者： Boo, Junseok Chwa, Dongkyoung Department of Electrical and Computer Engineering Ajou University Suwon South Korea

This study introduces an adaptive integral sliding mode disturbance observer (AISMDOB)-based robust bidirectional platoon control method, aiming to ensure mesh stability in vehicular systems. Most existing platoon control studies only focus on error propagation stability in either the longitudinal or lateral direction, neglecting the uncertainties in kinematics and dynamics of vehicular systems. The study proposes new coupled spacing error dynamics derived from vehicle kinematics and extended look-ahead-based coupled spacing errors to ensure both the longitudinal and lateral error propagation stability (that is, mesh stability) and are subsequently utilized to develop the novel AISMDOB, which improves the existing integral sliding mode disturbance observers (ISMDOBs) by incorporating adaptive estimation of unknown disturbance bounds while preserving their advantages. The AISMDOB-based platoon control method is then proposed using both robust kinematic and dynamic controllers to effectively compensate for the kinematic disturbances and dynamic model uncertainties, thereby reducing chattering phenomenon and ensuring the asymptotic convergence of spacing and velocity errors. Additionally, the proposed method can prevent cutting-corner behaviors during cornering maneuvers by utilizing the coupled spacing error dynamics. Simulation and experimental results verify the effectiveness of the proposed method through comparison with ISMDOB-based, sliding mode control (SMC)-based, and previous extended look-ahead-based methods. IEEE

关键词： Stability

来源：评论

学校读者我要写书评

暂无评论

High-accuracy sampling from constrained spaces with the Metropolis-adjusted Preconditioned Langevin Algorithm 36

High-accuracy sampling from constrained spaces with the Metr...

引用

36th International Conference on Algorithmic Learning Theory, ALT 2025

作者： Srinivasan, Vishwak Wibisono, Andre Wilson, Ashia Department of Electrical Engineering and Computer Science MIT United States Department of Computer Science Yale University United States

We propose a first-order sampling method called the Metropolis-adjusted Preconditioned Langevin Algorithm for approximate sampling from a target distribution whose support is a proper convex subset of Rd. Our proposed method is the result of applying a Metropolis-Hastings filter to the Markov chain formed by a single step of the preconditioned Langevin algorithm with a metric G, and is motivated by the natural gradient descent algorithm for optimisation. We derive non-asymptotic upper bounds for the mixing time of this method for sampling from target distributions whose potentials are bounded relative to G, and for exponential distributions restricted to the support. Our analysis suggests that if G satisfies stronger notions of self-concordance introduced in Kook and Vempala (2024), then these mixing time upper bounds have a strictly better dependence on the dimension than when G is merely self-concordant. Our method is a high-accuracy sampler due to the polylogarithmic dependence on the error tolerance in our mixing time upper bounds. © 2025 V. Srinivasan, A. Wibisono & A. Wilson.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

Hybrid Kalman Filter and Optimization-Based Routing for Energy Efficiency in Heterogeneous Wireless Sensor Networks

引用

Informatica (Slovenia) 2024年第23期48卷 121-132页

作者： Marzook, Ali K. Alkenani, Jawad University of Basrah College of Engineering Department of Electrical Engineering Iraq Department of Computer Science Shatt Al-Arab University College Basra Iraq

Several significant research studies have been done in distributed applications, database management systems, and information collecting in computer science concerning data mining and processing for wireless sensor networks (WSNs). As a result of WSNs' limited computation, networking, and data mining capabilities, the primary objective of creating WSN-based applications has proven to be extremely challenging: making decisions in real time. As such, typical data mining techniques are difficult to apply to sensor data due to their nature, peculiarities, and the constraints of wireless sensor networks. This work introduces a novel method for data mining and gathering and noise removal in wireless sensor networks (WSNs), dubbed KF-BA. This methodology increases network lifetime and efficiency by combining the Kalman Filter (KF) with the Bat Algorithm (BA). The recommended methods and BA contrast the provided techniques for raising energy consumption and prolonging network lifetime. The BA algorithm is not as effective as the KF-BA approach. The suggested strategy yields network longevity that is almost (57%) longer than BA in this instance, and that is after 2,000 packets are sent to two sensors spread over the network. The results were simulated using the MATLAB environment. © 2024 Slovene Society Informatika. All rights reserved.

关键词： Kalman filters

来源：评论

学校读者我要写书评

暂无评论

CSI Robust Joint User Selection and Precoder Design in MIMO Downlink Systems

引用

IEEE Wireless Communications Letters 2025年第6期14卷 1796-1800页

作者： Vaezy, Hossein Blostein, Steven D. Queen’s University Department of Electrical and Computer Engineering KingstonON Canada

In multiuser multiple-input multiple-output (MU-MIMO) systems, the selection of a subset of users to achieve the maximum sum rate is critical when resources are limited. In addition, designing suitable precoder and decoder matrices at the base station (BS) and at the user side requires unattainable perfect channel state information. In this letter, the downlink of a cellular system with multiple antennas at user equipments (UEs) is considered. A framework is derived for joint user selection and precoder/decoder design in the presence of imperfect channel estimation with neither instantaneous nor statistical error matrices. A robust method is proposed that incorporates a bounded worst-case channel in the design of precoders, decoders, and user selection. The optimization problem is solved iteratively by decomposition into multiple convex sub-problems which are solved successively. Finally, it is illustrated that for the case of a set of predesigned precoders, the interference pattern remains fixed for each user, implying that the problem of user selection could be transformed to that of beam selection. © 2025 IEEE. All rights reserved.

关键词： Channel estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：