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

Topological Photonic Molecule with Time-Varying Modulations

Topological Photonic Molecule with Time-Varying Modulations

2023 Photonic Networks and Devices, Networks 2023 in Advanced Photonics Congress - Part of Advanced Photonics Congress 2023

作者： Suh, Joseph Kim, Gyunghun Park, Hyungchul Yu, Sunkyu Intelligent Wave Systems Laboratory Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of

We propose dynamic modulations of a photonic molecule to achieve topological properties of light. We investigate the Hall transport in synthetic dimensions and the system modulation strategy to demonstrate the pumping... 详细信息

ISBN: (纸本)9781957171265

关键词： Molecules

来源：评论

学校读者我要写书评

暂无评论

A Novel Zero Common-Mode Voltage Modulation Strategy for Dual Three-Phase PWM Inverter Based on Unified Voltage Modulation 4

A Novel Zero Common-Mode Voltage Modulation Strategy for Dua...

引用

4th International Conference on Energy, Power and electrical engineering, EPEE 2024

作者： Kan, Jinpeng Meng, Yongqing Li, Changyi Chen, Wenjie Li, Fengjiao Shi, Yixin Xi'an Jiaotong University School of Electrical Engineering Xi'an China Avic Xi'an Flight Automatic Control Research Institute Department of Computer and Electronic Systems Engineering Xi'an China

ISBN: (纸本)9798331518066

Power electronic switching devices and pulse width modulation (PWM) not only improves the performance of motor drive systems, but also brings about common-mode voltage (CMV) issues, that challenging the normal operation of the system. This article proposes a zero common-mode voltage modulation strategy based on unified voltage modulation for a 60° Y-connected six-phase permanent magnet synchronous motor system driven by a dual three-phase inverter. The theoretical basis and zero common-mode implementation scheme of unified modulation are analyzed, and the effectiveness of the proposed zero common-mode voltage modulation strategy is finally verified through simulation. © 2024 IEEE.

关键词： Pulse width modulation

来源：评论

学校读者我要写书评

暂无评论

Resource Efficiency vs Performance Isolation Tradeoff in Network Slicing 21

Resource Efficiency vs Performance Isolation Tradeoff in Net...

引用

21st International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2023

作者： Nikolaidis, Panagiotis Zoulkarni, Asim Baras, John Department of Electrical & Computer Engineering The Institute for Systems Research University of Maryland College ParkMD20742 United States

ISBN: (纸本)9783903176553

We consider the tradeoff between resource efficiency and performance isolation that emerges when multiplexing the resource demands of Network Slices (NSs). On the one hand, multiplexing allows the use of idle resources, which increases resource efficiency. On the other hand, the performance of each NS becomes susceptible to traffic surges in other NSs, which degrades performance isolation. The analysis of this tradeoff enables network operators to determine the effect of performance isolation on the operating cost of each NS. To study the tradeoff, we solve an optimization problem where we find the multiplexing policy that requires the least provisioned resources to honor the Service Level Agreements (SLAs) of all NSs. The SLA of each NS i states that its resource demand should be met for PiH fraction of time, and for PiL ≤ PiH fraction of time, it should be met regardless of the demands of other NSs. For resource demands that follow ergodic Markov chains, we show that the well-known Max-Weight scheduler is an optimal multiplexing policy. Since the Max-Weight scheduler does not require any knowledge of the statistics of the resource demands, we also propose its use in non-markovian settings. For resource demands obtained in the LTE module of ns-3, we show that the Max-Weight scheduler reduces the provisioned bandwidth by 36.2% when no performance isolation is required. Lastly, for these non-markovian resource demands, the Max-Weight scheduler maintains its optimality since it requires as much provisioned bandwidth as the best non-causal scheduler. © 2023 IFIP.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Dynamic S-Box Generation Using Novel Chaotic Map with Nonlinearity Tweaking

引用

computers, Materials & Continua 2023年第5期75卷 3011-3026页

作者： Amjad Hussain Zahid Muhammad Junaid Arshad Musheer Ahmad Naglaa F.Soliman Walid El-Shafai School of Systems and Technology University of Management and TechnologyLahore54700Pakistan Department of Computer Science University of Engineering and TechnologyLahore54700Pakistan Department of Computer Engineering Jamia Millia IslamiaNew Delhi110025India Department of Information Technology College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia Security Engineering Lab Computer Science DepartmentPrince Sultan UniversityRiyadh11586Saudi Arabia Department of Electronics and Electrical Communications Engineering Faculty of Electronic EngineeringMenoufia UniversityMenouf32952Egypt

A substitution box(S-Box)is a crucial component of contemporary cryptosystems that provide data protection in block *** the moment,chaotic maps are being created and extensively used to generate these SBoxes as a chaotic map assists in providing disorder and resistance to combat cryptanalytical *** this paper,the construction of a dynamic S-Box using a cipher key is proposed using a novel chaotic map and an innovative tweaking *** projected chaotic map and the proposed tweak approach are presented for the first time and the use of parameters in their workingmakes both of these dynamic in *** tweak approach employs cubic polynomials while permuting the values of an initial S-Box to enhance its cryptographic *** of the parameters are provided using the cipher key and a small variation in values of these parameters results in a completely different unique *** analysis and exploration confirmed that the projected chaoticmap exhibits a significant amount of chaotic *** security assessment in terms of bijectivity,nonlinearity,bits independence,strict avalanche,linear approximation probability,and differential probability criteria are utilized to critically investigate the effectiveness of the proposed S-Box against several *** proposed S-Box’s cryptographic performance is comparable to those of recently projected S-Boxes for its adaption in real-world security *** comparative scrutiny pacifies the genuine potential of the proposed S-Box in terms of its applicability for data security.

关键词： Substitution-box chaotic map data security tweaking

来源：评论

学校读者我要写书评

暂无评论

Temporal Sensitivity Analysis of Internal Temperature Informed Charging Algorithms and Rapid Thermal Management System for E-mobility

Temporal Sensitivity Analysis of Internal Temperature Inform...

引用

2024 IEEE Energy Conversion Congress and Exposition, ECCE 2024

作者： Samanta, Akash Chetri, Chandan Karnehm, Dominic Neve, Antje Williamson, Sheldon Ontario Tech University Department of Electrical Computer and Software Engineering Oshawa Canada Bundeswehr University Munich Institute of Intelligent Distributed Systems Neubiberg Germany

ISBN: (纸本)9798350376067

The experimental studies presented in this paper reveal that existing thermal management systems (TMS) and temperature-informed charging algorithms exhibit a response time lag of at least 5.3 minutes due to their reliance on surface temperature measurements. The results indicate that changes in the internal thermal state of lithium-ion batteries (LIBs), induced by variations in charging currents, take an average of 2 minutes to manifest on the battery surface, particularly evident in cylindrical cells. Current thermal management systems for automotive battery packs solely rely on surface temperature measurements, neglecting the approximately 5.8°C temperature difference between the core and surface in TMS control. Consequently, changes in the battery's thermal state due to internal heat losses are not promptly detected by surface-mounted temperature sensors. This delayed response time accelerates battery degradation and increases the risk of thermal runaway events. In this study, temperature-informed fast charging algorithms, tested under various ambient conditions for LIBs, along with a comparative analysis, demonstrate that response time can be reduced by at least 2 minutes by considering internal temperature rather than relying solely on surface temperature measurements. Moreover, accounting for the temperature difference between the core and surface facilitates rapid TMS control and health-conscious fast charging, thereby mitigating the risk of thermal runaway events. © 2024 IEEE.

关键词： Surface measurement

来源：评论

学校读者我要写书评

暂无评论

Improving the Area-Delay Tradeoff for Academic FPGA Architectures by Applying Rent's Rule to Logic Block Modeling 33

Improving the Area-Delay Tradeoff for Academic FPGA Architec...

引用

33rd International Scientific Conference Electronics, ET 2024

作者： Minev, Petar Kukenska, Valentina Dinev, Matyo Varbov, Ilian Technical University of Gabrovo Faculty of Electrical Engineering and Electronics Department of Computer Systems and Technologies 4 H. Dimitar str Gabrovo5300 Bulgaria

ISBN: (纸本)9798350376449

This paper presents a study on the effect of using a smaller number of inputs in the FPGA logic block calculated according to a pre-compiled model based on Rent's rule. This rule, when applied to the FPGA logic block with a logic block crossbar, allows for the reduction of the size of its multiplexers, thereby reducing its area and the delays in the switching circuits. The study uses a set of benchmark circuits, which are implemented in FPGA architectures with predefined parameters. The obtained results allow for comparing the architectures based on the total area and the critical path delays of the benchmark circuits. © 2024 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Conditioned fully convolutional denoising autoencoder for multi-target NILM

引用

Neural Computing and Applications 2025年第17期37卷 10491-10505页

作者： García, Diego Pérez, Daniel Papapetrou, Panagiotis Díaz, Ignacio Cuadrado, Abel A. Enguita, José M. Domínguez, Manuel Department of Electrical Engineering University of Oviedo Principado de Asturias Gijón33209 Spain SUPPRESS Research Group University of León León24007 Spain Department of Computer and Systems Science Stockholm University Kista SE-164 07 Stockholm Sweden

Energy management requires reliable tools to support decisions aimed at optimising consumption. Advances in data-driven models provide techniques like Non-Intrusive Load Monitoring (NILM), which estimates the energy demand of appliances from total consumption. Common single-target NILM approaches perform energy disaggregation by using separate learned models for each device. However, the use of single-target systems in real scenarios is computationally expensive and can obscure the interpretation of the resulting feedback. This study assesses a conditioned deep neural network built upon a Fully Convolutional Denoising AutoEncoder (FCNdAE) as multi-target NILM model. The network performs multiple disaggregations using a conditioning input that allows the specification of the target appliance. Experiments compare this approach with several single-target and multi-target models using public residential data from households and non-residential data from a hospital facility. Results show that the multi-target FCNdAE model enhances the disaggregation accuracy compared to previous models, particularly in non-residential data, and improves computational efficiency by reducing the number of trainable weights below 2 million and inference time below 0.25 s for several sequence lengths. Furthermore, the conditioning input helps the user to interpret the model and gain insight into its internal behaviour when predicting the energy demand of different appliances. © The Author(s) 2024.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Channel Coding at Low Capacity

Channel Coding at Low Capacity

引用

作者： Fereydounian, Mohammad Hassani, Hamed Jamali, Mohammad Vahid Mahdavifar, Hessam University of Pennsylvania Electrical and Systems Engineering Department PhiladelphiaPA19104 United States University of Michigan Electrical Engineering and Computer Science Department Ann ArborMI48109 United States

Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require efficient and reliable transmission over channels with an extremely small capacity. Within these constraints, the state-of-the-art coding techniques may not be directly applicable. Moreover, the prior work on the finite-length analysis of optimal channel coding provides inaccurate predictions of the limits in the low-capacity regime. In this paper, we study channel coding at low capacity from two perspectives: fundamental limits at finite length and code constructions. We first specify what a low-capacity regime means. We then characterize finite-length fundamental limits of channel coding in the low-capacity regime for various types of channels, including binary erasure channels (BECs), binary symmetric channels (BSCs), and additive white Gaussian noise (AWGN) channels. From the code construction perspective, we characterize the optimal number of repetitions for transmission over binary memoryless symmetric (BMS) channels, in terms of the code blocklength and the underlying channel capacity, such that the capacity loss due to the repetition is negligible. Furthermore, it is shown that capacity-achieving polar codes naturally adopt the aforementioned optimal number of repetitions. © 2020 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Online Mechanism Design for Differentially Private Data Acquisition

Online Mechanism Design for Differentially Private Data Acqu...

引用

IEEE Conference on Decision and Control

作者： Ameya Anjarlekar Rasoul Etesami R. Srikant Department of Electrical and Computer Engineering UIUC Faculty of Electrical and Computer Engineering and Industrial and Systems Engineering UIUC Faculty of Electrical and Computer Engineering UIUC

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

We address a problem involving a buyer seeking to train a logistic regression model by acquiring data from privacy-sensitive sellers. Along with compensating the sellers for their data, the buyer provides differential privacy guarantees to them where the payments depend on the privacy guarantees. In addition, each seller has a different privacy sensitivity associated with their data, which is the cost per unit of loss of privacy. The buyer transacts sequentially with the sellers, wherein the seller will disclose their privacy sensitivity, and the buyer immediately provides a payment and guarantees differential privacy. After receiving the payment, the seller provides their data to the buyer. The buyer’s goal is to optimize a weighted combination of test loss and payments, i.e., achieve a tradeoff between getting a good ML model and limiting its payments. Additionally, the buyer must design the payments and differential privacy guarantees in an online fashion. Further, the online problem is historydependent, which adds to the challenge. Consequently, we design a payment mechanism that ensures incentive compatibility and individual rationality and is asymptotically optimal. Additionally, we also provide experimental results to validate our findings.

关键词： Differential privacy Privacy Logistic regression Sensitivity Limiting Costs Data acquisition Mechanism design Games Data models

来源：评论

学校读者我要写书评

暂无评论

Fundamental Limits of Distributed Covariance Matrix Estimation Under Communication Constraints 41

Fundamental Limits of Distributed Covariance Matrix Estimati...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Rahmani, Mohammad Reza Yassaee, Mohammad Hossein Maddah-Ali, Mohammad Ali Aref, Mohammad Reza Department of Electrical Engineering Sharif University of Technology Tehran Iran Sharif Center for Information Systems and Data Science Sharif Institute for Convergence Science & Technology Tehran Iran Department of Electrical and Computer Engineering University of Minnesota Minneapolis United States

Estimating high-dimensional covariance matrices is crucial in various domains. This work considers a scenario where two collaborating agents access disjoint dimensions of m samples from a high-dimensional random vector, and they can only communicate a limited number of bits to a central server, which wants to accurately approximate the covariance matrix. We analyze the fundamental trade-off between communication cost, number of samples, and estimation accuracy. We prove a lower bound on the error achievable by any estimator, highlighting the impact of dimensions, number of samples, and communication budget. Furthermore, we present an algorithm that achieves this lower bound up to a logarithmic factor, demonstrating its near-optimality in practical settings. Copyright 2024 by the author(s)

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：