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

2024 IEEE PES Innovative Smart Grid Technologies Europe Conference, ISGT EUROPE 2024

作者： De Winkel, Eva Lukszo, Zofia Neerincx, Mark Dobbe, Roel Tu Delft Faculty of Technology Policy and Management Netherlands Tu Delft Faculty of Electrical Engineering Mathematics and Computer Science Netherlands

ISBN: (纸本)9789531842976

Fairness has recently gained significant attention in the scientific literature on algorithmic control systems for congestion management. However, many diverse conceptualizations of fairness have been presented. This paper aims to categorize these varying conceptualizations by reviewing existing literature on congestion management. It examines how researchers approach decisions concerning the scoping of fairness problems, the selection of fairness principles, and the choice of evaluation metrics. Findings highlight a need for more justification of fairness conceptualizations in literature as well as a need for standardized evaluation metrics and more empirical grounding and validation. The insights provided can help researchers and practitioners consider fairness comprehensively in the design of algorithmic control systems for congestion management. © 2024 IEEE.

关键词： algorithmic control systems congestion management electrical distribution grids fairness

来源：评论

学校读者我要写书评

暂无评论

Random hyperbolic graphs in d+1 dimensions

引用

Physical Review E 2024年第5期109卷 054131-054131页

作者： Gabriel Budel Maksim Kitsak Rodrigo Aldecoa Konstantin Zuev Dmitri Krioukov Faculty of Electrical Engineering Mathematics and Computer Science Department of Physics Network Science Institute Department of Computing and Mathematical Sciences Department of Physics Department of Mathematics Department of Electrical & Computer Engineering

We consider random hyperbolic graphs in hyperbolic spaces of any dimension d+1≥2. We present a rescaling of model parameters that casts the random hyperbolic graph model of any dimension to a unified mathematical framework, leaving the degree distribution invariant with respect to the dimension. Unlike the degree distribution, clustering does depend on the dimension, decreasing to 0 at d→∞. We analyze all of the other limiting regimes of the model, and we release a software package that generates random hyperbolic graphs and their limits in hyperbolic spaces of any dimension.

关键词： Network formation & growth Network structure

来源：评论

学校读者我要写书评

暂无评论

Scalable global state synchronization of discrete-time double integrator multi-agent systems with input saturation via linear protocol 41

Scalable global state synchronization of discrete-time doubl...

引用

第41届中国控制会议

作者： Zhenwei Liu Ali Saberi Anton A.Stoorvogel College of Information Science and Engineering Northeastern University School of Electrical Engineering and Computer Science Washington State University Department of Electrical Engineering Mathematics and Computer ScienceUniversity of Twente

ISBN: (数字)9789887581536

ISBN: (纸本)9781665482561

This paper studies scalable global state synchronization of discrete-time double integrator multi-agent systems in presence of input saturation based on localized information exchange.A scale-free collaborative linear dynamic protocols design methodology is developed for discrete-time multi-agent systems with both full and partialstate *** the protocol design methodology does not need any knowledge of the directed network topology and the spectrum of the associated Laplacian ***,the protocols are parametric based on a parameter set in which the designed protocols can guarantee the global synchronization ***,the proposed protocol is scalable and achieves synchronization for any arbitrary number of agents.

关键词： Discrete-time double integrator multi-agent systems Global state synchronization Scale-free linear protocol

来源：评论

学校读者我要写书评

暂无评论

On k-Planar Graphs Without Short Cycles 32

On k-Planar Graphs Without Short Cycles

引用

32nd International Symposium on Graph Drawing and Network Visualization, GD 2024

作者： Bekos, Michael A. Bose, Prosenjit Büngener, Aaron Dujmović, Vida Hoffmann, Michael Kaufmann, Michael Morin, Pat Odak, Saeed Weinberger, Alexandra Department of Mathematics University of Ioannina Greece School of Computer Science Carleton University Ottawa Canada Department of Computer Science University of Tübingen Germany School of Electrical Engineering and Computer Science University of Ottawa Canada Department of Computer Science ETH Zürich Switzerland Faculty of Mathematics and Computer Science Fern Universität in Hagen Germany

ISBN: (纸本)9783959773430

We study the impact of forbidding short cycles to the edge density of k-planar graphs;a k-planar graph is one that can be drawn in the plane with at most k crossings per edge. Specifically, we consider three settings, according to which the forbidden substructures are 3-cycles, 4-cycles or both of them (i.e., girth ≥ 5). For all three settings and all k ∈ {1, 2, 3}, we present lower and upper bounds on the maximum number of edges in any k-planar graph on n vertices. Our bounds are of the form c n, for some explicit constant c that depends on k and on the setting. For general k ≥ 4 our bounds are of the form c √ kn, for some explicit constant c. These results are obtained by leveraging different techniques, such as the discharging method, the recently introduced density formula for non-planar graphs, and new upper bounds for the crossing number of 2- and 3-planar graphs in combination with corresponding lower bounds based on the Crossing Lemma. © Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmović, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, and Alexandra Weinberger.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Joint Device and Training Scheduling for Wireless Federated Learning

引用

IEEE Internet of Things Journal 2025年第12期12卷 18806-18819页

作者： Chen, Xiaobing Zhou, Xiangwei Zhang, Hongchao Sun, Mingxuan Zhao, Taibiao Louisiana State University Division of Electrical and Computer Engineering Baton RougeLA70803 United States Louisiana State University Department of Mathematics Baton RougeLA70803 United States Louisiana State University Division of Computer Science and Engineering Baton RougeLA70803 United States

The advent of ubiquitous computing devices in the Internet of Things (IoT) has resulted in an explosion of data. Traditional centralized machine learning models face challenges including limited bandwidth in wireless environments and privacy concerns due to their data aggregation approach. Federated learning addresses these challenges via decentralizing model training across numerous devices, leveraging model updates to enhance privacy and reduce communication overhead. To improve its cost efficiency, current research focuses on minimizing either time or energy costs but rarely both, and does not jointly optimize the parameters of device and training scheduling in the presence of system and data heterogeneity inherent in IoT networks. In our paper, we first introduce a multi-group transmission scheme and propose a comprehensive device scheduling framework, Group Scheduling on Orthogonal Frequency-Division Multiple Access (GS-OFDMA), to address time bottlenecks. Then we formulate a joint optimization problem for device and training scheduling that minimizes the total cost of training while ensuring model convergence. To tackle the resulting mixed integer nonlinear programming problem, we develop an iterative algorithm. Experimental results show that our approach significantly reduces the total cost by at least 35% across various real-world datasets and data distributions in comparison with random participant selection. The proposed GS-OFDMA protocol also exhibits higher time efficiency over other device scheduling schemes. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Low-complexity signal detection for massive MIMO systems via trace iterative method

引用

Journal of Systems engineering and Electronics 2024年第3期35卷 549-557页

作者： IMRAN A.Khoso ZHANG Xiaofei ABDUL Hayee Shaikh IHSAN A.Khoso ZAHEER Ahmed Dayo College of Electronic and Information Engineering Nanjing University of Aeronautics and AstronauticsNanjing 211106China School of Electrical Engineering Korea UniversitySeoul 02841Korea School of Mathematics South China University of TechnologyGuangzhou 510641China Department of Computer Science Huanggang Normal UniversityHuanggang 438000China

Linear minimum mean square error(MMSE)detection has been shown to achieve near-optimal performance for massive multiple-input multiple-output(MIMO)systems but inevitably involves complicated matrix inversion,which entails high *** avoid the exact matrix inversion,a considerable number of implicit and explicit approximate matrix inversion based detection methods is *** combining the advantages of both the explicit and the implicit matrix inversion,this paper introduces a new low-complexity signal detection ***,the relationship between implicit and explicit techniques is ***,an enhanced Newton iteration method is introduced to realize an approximate MMSE detection for massive MIMO uplink *** proposed improved Newton iteration significantly reduces the complexity of conventional Newton ***,its complexity is still high for higher ***,it is applied only for first two *** subsequent iterations,we propose a novel trace iterative method(TIM)based low-complexity algorithm,which has significantly lower complexity than higher Newton *** guarantees of the proposed detector are also *** simulations verify that the proposed detector exhibits significant performance enhancement over recently reported iterative detectors and achieves close-to-MMSE performance while retaining the low-complexity advantage for systems with hundreds of antennas.

关键词： signal detection low-complexity linear minimum mean square error(MMSE) massive multiple-input multiple-output(MIMO) trace iterative method(TIM)

来源：评论

学校读者我要写书评

暂无评论

End-To-End Encryption Enabled Lightweight Mutual Authentication Scheme for Resource Constrained IoT Network

引用

computers, Materials & Continua 2025年第2期82卷 3223-3249页

作者： Shafi Ullah Haidawati Muhammad Nasir Kushsairy Kadir Akbar Khan Ahsanullah Memon Shanila Azhar Ilyas Khan Muhammad Ashraf Department of Computer Engineering Balochistan University of Information TechnologyEngineering and Management SciencesQuetta87300Pakistan Computer Engineering Section Malaysian Institute of Technology Universiti Kuala LumpurKuala Lumpur50250Malaysia Electrical Engineering Section Universiti Kuala LumpurBritish Malaysian InstituteSalengor53100Malaysia Electrical Engineering Department Mehran UniversityKhairpur-Mirs76062Pakistan Department of Mathematics College of Science Al-ZulfiMajmaah UniversityAl-Majmaah11952Saudi Arabia

Machine-to-machine (M2M) communication networks consist of resource-constrained autonomous devices, also known as autonomous Internet of things (IoTs) or machine-type communication devices (MTCDs) which act as a backbone for Industrial IoT, smart cities, and other autonomous systems. Due to the limited computing and memory capacity, these devices cannot maintain strong security if conventional security methods are applied such as heavy encryption. This article proposed a novel lightweight mutual authentication scheme including elliptic curve cryptography (ECC) driven end-to-end encryption through curve25519 such as (i): efficient end-to-end encrypted communication with pre-calculation strategy using curve25519;and (ii): elliptic curve Diffie-Hellman (ECDH) based mutual authentication technique through a novel lightweight hash function. The proposed scheme attempts to efficiently counter all known perception layer security threats. Moreover, the pre-calculated key generation strategy resulted in cost-effective encryption with 192-bit curve security. It showed comparative efficiency in key strength, and curve strength compared with similar authentication schemes in terms of computational and memory cost, communication performance and encryption robustness.

关键词： Mutual authentication lightweight end-to-end encryption elliptic curve cryptography industrial internet of things curve25519 machine-to-machine communication

来源：评论

学校读者我要写书评

暂无评论

Optimizing Service Placement in Edge-to-Cloud AR/VR Systems Using a Multi-Objective Genetic Algorithm 14

Optimizing Service Placement in Edge-to-Cloud AR/VR Systems ...

引用

14th International Conference on Cloud Computing and Services science, CLOSER 2024

作者： Herabad, Mohammadsadeq G. Taheri, Javid Ahmed, Bestoun S. Curescu, Calin Department of Mathematics and Computer Science Karlstad University Karlstad Sweden School of Electronics Electrical Engineering and Computer Science Queen’s University Belfast Belfast United Kingdom Department of Computer Science Faculty of Electrical Engineering Czech Technical University Prague Czech Republic Ericsson AB Stockholm Sweden

ISBN: (纸本)9789897587016

Augmented Reality (AR) and Virtual Reality (VR) systems involve computationally intensive image processing algorithms that can burden end-devices with limited resources, leading to poor performance in providing low latency services. Edge-to-cloud computing overcomes the limitations of end-devices by offloading their computations to nearby edge devices or remote cloud servers. Although this proves to be sufficient for many applications, optimal placement of latency sensitive AR/VR services in edge-to-cloud infrastructures (to provide desirable service response times and reliability) remain a formidable challenging. To address this challenge, this paper develops a Multi-Objective Genetic Algorithm (MOGA) to optimize the placement of AR/VR-based services in multi-tier edge-to-cloud environments. The primary objective of the proposed MOGA is to minimize the response time of all running services, while maximizing the reliability of the underlying system from both software and hardware perspectives. To evaluate its performance, we mathematically modeled all components and developed a tailor-made simulator to assess its effectiveness on various scales. MOGA was compared with several heuristics to prove that intuitive solutions, which are usually assumed sufficient, are not efficient enough for the stated problem. The experimental results indicated that MOGA can significantly reduce the response time of deployed services by an average of 67% on different scales, compared to other heuristic methods. MOGA also ensures reliability of the 97% infrastructure (hardware) and 95% services (software). © 2024 by SCITEPRESS – science and Technology Publications, Lda.

关键词： Augmented reality

来源：评论

学校读者我要写书评

暂无评论

Enhancing biometric authentication security through the novel integration of graph theory encryption and chaotic logistic mapping

引用

Multimedia Tools and Applications 2025年第16期84卷 16909-16943页

作者： El-Shafai, Walid El-Mesady, A. Kamal, F.M. Security Engineering Lab Computer Science Department Prince Sultan University Riyadh11586 Saudi Arabia Department of Electronics and Electrical Communications Engineering Faculty of Electronic Engineering Menoufia University Menouf32952 Egypt Department of Physics and Engineering Mathematics Faculty of Electronic Engineering Menoufia University Menouf32952 Egypt Mathematics and Engineering Physics Department Faculty of Engineering Mansoura University PO 35516 Mansoura Egypt

The escalating reliance on biometric systems for identity verification underscores the imperative for robust data protection mechanisms. Biometric authentication, leveraging unique biological and behavioral characteristics, offers unparalleled precision in individual identification. However, the integrity and confidentiality of biometric data remain paramount concerns, given its susceptibility to compromise. This research delineates the development and implementation of an innovative framework for cancellable biometrics, focusing on facial and fingerprint recognition. This study introduces a novel cancellable biometrics framework that integrates graph theory encryption with three-dimensional chaotic logistic mapping. The methodology encompasses a multifaceted approach: initially employing graph theory for the secure and efficient encryption of biometric data, subsequently enhanced by the complexity and unpredictability of three-dimensional chaotic logistic mapping. This dual-layered strategy ensures the robustness of the encryption, thereby significantly elevating the security of biometric data against unauthorized access and potential compromise. Thus, the resulting cancellable biometrics, characterized by the ability to transform biometric data into an adjustable representation, addresses critical challenges in biometric security. It allows for the revocation and reissuance of biometric credentials, thereby safeguarding the original biometric characteristics of individuals. This feature not only enhances user privacy and data security but also introduces a dynamic aspect to biometric authentication, facilitating adaptability across diverse systems and applications. Preliminary evaluations of the proposed framework demonstrate a marked improvement in the security of face and fingerprint recognition systems. Through the application of graph theory encryption, coupled with three-dimensional chaotic logistic mapping, our framework mitigates the risks associated with t

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Impact of Virtual Synchronous Generators on Power System Frequency Dynamics

Impact of Virtual Synchronous Generators on Power System Fre...

引用

2023 International Conference on Smart Energy Systems and Technologies, SEST 2023

作者： Fu, Aihui Lekic, Aleksandra Kontis, Eleftherios O. Malamaki, Kyriaki-Nefeli D. Kryonidis, Georgios C. Mauricio, Juan Manuel Demoulias, Charis S. Cvetkovic, Milos Delft University of Technology Faculty of Electrical Engineering Mathematics and Computer Science Delft Netherlands Aristotle University of Thessaloniki Department of Electrical & Computer Engineering Thessaloniki Greece University of Seville Department of Electrical Engineering Spain

ISBN: (纸本)9798350397901

This paper deals with a systematic assessment of the power system frequency dynamics under high penetration of converter-interfaced renewable energy sources (CI-RESs). Specifically, the concept of the virtual synchronous generator (VSG) is implemented in the CI-RESs located at the transmission system (TS) side and/or the distribution network (DN) side. Dynamic RMS simulations are performed on a testbed consisting of the IEEE 9-bus TS grid and the CIGRE medium-voltage DN grid under different CI-RES penetration levels and VSG control parameters to assess the VSG impact on the power system frequency dynamics. It is shown that the decommissioning of conventional power plants coupled via synchronous generators can be safely performed in case the VSG concept is adopted correctly. © 2023 IEEE.

关键词： Synchronous generators

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：