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

A Coalitional Game for Demand-Side Management in a Low-Voltage Resistive Micro-Grid with Multiple Electricity Retailers

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Mendoza, Fernando Genis Baldivieso-Monasterios, Pablo R. Bauso, Dario Konstantopoulos, George The Department of Automatic Control and Systems Engineering The University of Sheffield Mappin Street SheffieldS1 3JD United Kingdom The Department of Electrical and Computer Engineering University of Patras Rion26500 Greece The Jan C. Willems Center for Systems and Control ENTEG Fac. Science and Engineering University of Groningen Nijenborgh 4 Groningen9747 AG Netherlands The Netherlands and Dipartimento di Ingegneria Università di Palermo viale delle Scienze Palermo Italy

An existing challenge in power systems is the implementation of optimal demand management through dynamic pricing. This paper encompasses the design, analysis and implementation of a novel on-line pricing scheme based on coalitional game theory. The setting consists of a network with multiple energy retailers competing to attract consumers by announcing a price in a hierarchical leader-follower structure. The process of coalition formation under such a pricing scheme can be viewed as a game for which we show that a Stackelberg equilibrium exists, i.e., given a price, consumers will respond by conforming to a reciprocal power consumption quantity. We propose a coalition formation algorithm and perform a game-theoretic stability analysis on the resulting coalitions. We integrate the pricing setting with a resistive micro-grid dynamic model. In this context we analyse the behaviour of the integrated system, bridging the gap between market and physical layers of the problem. Simulations provide a comparison of profits generated by the proposed scheme against a more traditional single retailer scheme, while simultaneously showing convergence towards a steady-state equilibrium. Additionally, we shed light into the system's physical response when subject to our proposed pricing scheme. © 2024, CC BY.

关键词： Costs

Pinching Antennas: Principles, Applications and Challenges

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Yang, Zheng Wang, Ning Sun, Yanshi Ding, Zhiguo Schober, Robert Karagiannidis, George K. Wong, Vincent W.S. Dobre, Octavia A. Fujian Provincial Engineering Technology Research Center of Photoelectric Sensing Application Fujian Normal University Fuzhou350117 China School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China Khalifa University Abu Dhabi United Arab Emirates University of Manchester ManchesterM1 9BB United Kingdom Germany Group Electrical & Computer Engineering Dept. Aristotle University of Thessaloniki Thessaloniki54 124 Greece Department of Electrical and Computer Engineering The University of British Columbia Vancouver Canada Department of Electrical and Computer Engineering Memorial University St. John’sNL Canada

Flexible-antenna systems, such as fluid antennas and movable antennas, have been recognized as key enabling technologies for sixth-generation (6G) wireless networks, as they can intelligently reconfigure the effective channel gains of the users and hence significantly improve their data transmission capabilities. However, existing flexible-antenna systems have been designed to combat small-scale fading in non-line-of-sight (NLoS) conditions. As a result, they lack the ability to establish line-of-sight links, which are typically 100 times stronger than NLoS links. In addition, existing flexible-antenna systems have limited flexibility, where adding/removing an antenna is not straightforward. This article introduces an innovative flexible-antenna system called pinching antennas, which are realized by applying small dielectric particles to waveguides. We first describe the basics of pinching-antenna systems and their ability to provide strong LoS links by deploying pinching antennas close to the users as well as their capability to scale up/down the antenna system. We then focus on communication scenarios with different numbers of waveguides and pinching antennas, where innovative approaches to implement multiple-input multiple-output and non-orthogonal multiple access are discussed. In addition, promising 6G-related applications of pinching antennas, including integrated sensing and communication and next-generation multiple access, are presented. Finally, important directions for future research, such as waveguide deployment and channel estimation, are highlighted. Copyright © 2025, The Authors. All rights reserved.

关键词： Channel estimation

STARS Assisted Semi-Grant-Free NOMA Communications

学校读者我要写书评

暂无评论

IEEE Transactions on Wireless Communications 2025年

作者： Xie, Jin Yue, Xinwei Zhao, Jingjing Zou, Yixuan Liu, Yuanwei Liu, Rongke Ding, Zhiguo Key Laboratory of Information and Communication Systems China Beijing Information Science and Technology University Key Laboratory of Modern Measurement and Control Technology Ministry of Education Beijing100101 China Beihang University School of Electronic and Information Engineering Beijing100191 China Queen Mary University of London School of Electronic Engineering and Computer Science LondonE1 4NS United Kingdom The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong Hong Kong Kyung Hee University Department of Electronic Engineering Gyeonggi-do Yongin-si17104 Korea Republic of Khalifa University Department of Computer and Information Engineering Abu Dhabi United Arab Emirates

This paper investigates the performance of simultaneously transmitting and reflecting surface (STARS) assisted semi-grant-free non-orthogonal multiple access network with randomly distributed users. By deploying STARS, the transmit signals of grant-based user (GBU) and grant-free users (GFUs) can be exquisitely adjusted to reduce interference. We propose a maximum channel scheduling (MCS) protocol that allows a GFU to access GBU’s channel with the assistance of STARS. In particular, the impacts of perfect/imperfect successive interference cancellation (pSIC/ipSIC) on MCS protocol are taken into account. To characterize the performance of STARS aided MCS (STARS-MCS) network, we derive the expressions of outage probability for GBU and GFU with pSIC/ipSIC. By applying convolution theorem and Laplace transform, the asymptotic expressions of outage probability and diversity orders for GBU and GFU are attained. We further design a STARS-based power control (SPC) strategy to eliminate the outage probability error floor and improve the outage performance. Numerical results show that: 1) The performance of STARS-MCS outperforms the existing benchmarks in terms of outage probability and system throughput;2) The SPC strategy can effectively improve the performance of the STARS-MCS network and eliminate the outage probability error floor at high signal-to-noise ratios;and 3) By adjusting reflection and transmission coefficients of STARS, the outage performance of GBU and GFU can be greatly enhanced. © 2025 IEEE. All rights reserved.

关键词： Laplace transforms

AI verification platform using block chain with distributed ledger technology (DLT)

学校读者我要写书评

暂无评论

AIP Conference Proceedings 2023年第1期2427卷

作者： Sanjeev Kumar Sharma 1Department of Computer Science and Engineering Sanskriti University Mathura Uttar Pradesh India

The Developments in (AI) and (DLT) presently guide to energetic discussion in practice and academia. AI procedure data to accomplish targets that were earlier thought conceivable only for the humans. Distributed ledger technology has the capacity to create unanimity over information amid a category of contributor in unresolved environment. In present investigation, both technologies that are required in comparable and common systems. So comprise the pattern of safe (DLT) or the formation of federated learning system disseminate across several nodes. It can guide technological confluence, which the previous, has covered the method for the main revolution in (IT). Earlier work culminates numerous potential profits of the confluence of DLT and AI but alone offers a restricted theoretical structure to explain upcoming actual-world amalgamation cases of the both technologies. This investigation mainly aims to distribute by managing systematic earlier works and providing conscientious derivative future investigation chances. This research helps to overcome form the current limitations in the fields of AI and DLT convergence in both technologies.

关键词：

Blockchain used in apparel supply and textile

学校读者我要写书评

暂无评论

AIP Conference Proceedings 2023年第1期2427卷

作者： Chitrangada Chaubey 1Department of Computer Science and Engineering Sanskriti University Mathura Uttar Pradesh India

In sequence to help disclose and track environmental presentation transversely the apparel supply chain and textile, The Blockchain is suggested as a thorough tool for informations communication and storage in the highly translucent networks. Every contributor in networks can get gateway to the details for a supply chains procedure & eventually construct a higher levels of belief on distributor’ environmental authority. The paper main objective to usher out the capacity of Blockchain technology on the apparel supply chain and textile. This research helps to examine how to employ the different features of Blockchain for attaining low carbon excretion during apparel and textile industrial through the good supply chains translucent. In overall, Blockchain technology is extended into this research paper by manifest the project, business insinuation and chances in the apparel supply and textile chain. In addition, this paper helps to understand the use of Blockchain in apparel supply and textile with the help of Low Carbon Manufacturing Program (LCMP).

关键词：

Overview of data mining with Python modules

学校读者我要写书评

暂无评论

AIP Conference Proceedings 2023年第1期2427卷

作者： Sanjeev Kumar Sharma Mrinal Paliwal 1Department of Computer Science and Engineering Sanskriti University Mathura Uttar Pradesh India

Big data describes a huge amount of data in structured and unstructured form that makes a business on a daily basis and is not the amount of data that is important. It is huge in size and growing more with time. Big data is generated through various fields such as stock exchanges, jet engines, social media sites etc. The data is searched for a specific information. The process of searching specific data in big data is known as data mining that is done with multiple methods. The most common and efficient method of data mining is by using python language. There are multiple libraries in python that are used in data mining. The paper discusses the orange, matminer and scikit-learn modules of python and provides an overview with the discussion of data mining techniques.

关键词：

Feature selection in linear Support Vector Machines via a hard cardinality constraint: a scalable conic decomposition approach

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Bomze, Immanuel D’Onofrio, Federico Palagi, Laura Peng, Bo Faculty of Mathematics and Research Network Data Science University of Vienna Oskar-Morgenstern-Platz 1 Wien1090 Austria Department of Computer Control and Management Engineering Sapienza University of Rome Via Ariosto 25 Rome00185 Italy VGSCO University of Vienna Oskar-Morgenstern-Platz 1 Wien1090 Austria

In this paper, we study the embedded feature selection problem in linear Support Vector Machines (SVMs), in which a cardinality constraint is employed, leading to an interpretable classification model. The problem is NP-hard due to the presence of the cardinality constraint, even though the original linear SVM amounts to a problem solvable in polynomial time. To handle the hard problem, we first introduce two mixed-integer formulations for which novel semidefinite relaxations are proposed. Exploiting the sparsity pattern of the relaxations, we decompose the problems and obtain equivalent relaxations in a much smaller cone, making the conic approaches scalable. To make the best usage of the decomposed relaxations, we propose heuristics using the information of its optimal solution. Moreover, an exact procedure is proposed by solving a sequence of mixed-integer decomposed semidefinite optimization problems. Numerical results on classical benchmarking datasets are reported, showing the efficiency and effectiveness of our *** Codes 90C22, 90C11 © 2024, CC BY-NC-ND.

关键词： Mixed-integer linear programming

Perceptual Quality Assessment of Trisoup-Lifting Encoded 3D Point Clouds

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Long, Juncheng Su, Honglei Liu, Qi Yuan, Hui Gao, Wei Song, Jiarun Wang, Zhou The College of Electronics and Information Qingdao University Qingdao266071 China The School of Control Science and Engineering Shandong University Ji'nan250061 China The School of Electronic and Computer Engineering Peking University Shenzhen518055 China The Peng Cheng Laboratory Shenzhen518066 China The School of Telecommunications Engineering Xidian University Xi'An710071 China The Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada

No-reference bitstream-layer point cloud quality assessment (PCQA) can be deployed without full decoding at any network node to achieve real-time quality monitoring. In this work, we develop the first PCQA model dedicated to Trisoup-Lifting encoded 3D point clouds by analyzing bitstreams without full decoding. Specifically, we investigate the relationship among texture bitrate per point (TBPP), texture complexity (TC) and texture quantization parameter (TQP) while geometry encoding is lossless. Subsequently, we estimate TC by utilizing TQP and TBPP. Then, we establish a texture distortion evaluation model based on TC, TBPP and TQP. Ultimately, by integrating this texture distortion model with a geometry attenuation factor, a function of trisoupNodeSizeLog2 (tNSL), we acquire a comprehensive NR bitstream-layer PCQA model named streamPCQ-TL. In addition, this work establishes a database named WPC6.0, the first and largest PCQA database dedicated to Trisoup-Lifting encoding mode, encompassing 400 distorted point clouds with both 4 geometric multiplied by 5 texture distortion levels. Experiment results on M-PCCD, ICIP2020 and the proposed WPC6.0 database suggest that the proposed streamPCQ-TL model exhibits robust and notable performance in contrast to existing advanced PCQA metrics, particularly in terms of computational cost. The dataset and source code will be publicly released at https://***/qdushl/Waterloo-Point-Cloud-Database-6.0. Copyright © 2024, The Authors. All rights reserved.

关键词： Encoding (symbols)

A Multi-Player Potential Game Approach for Sensor Network Localization with Noisy Measurements

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xu, Gehui Chen, Guanpu Fidan, Baris Hong, Yiguang Qi, Hongsheng Parisini, Thomas Johansson, Karl H. The Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden The Department of Mechanical and Mechatronics Engineering University of Waterloo WaterlooONN2L 3G1 Canada Department of Control Science and Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing China The Department of Electrical and Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom The Department of Engineering and Architecture University of Trieste Trieste34127 Italy

Sensor network localization (SNL) is a challenging problem due to its inherent non-convexity and the effects of noise in inter-node ranging measurements and anchor node position. We formulate a non-convex SNL problem as a multi-player non-convex potential game and investigate the existence and uniqueness of a Nash equilibrium (NE) in both the ideal setting without measurement noise and the practical setting with measurement noise. We first show that the NE exists and is unique in the noiseless case, and corresponds to the precise network localization. Then, we study the SNL for the case with errors affecting the anchor node position and the inter-node distance measurements. Specifically, we establish that in case these errors are sufficiently small, the NE exists and is unique. It is shown that the NE is an approximate solution to the SNL problem, and that the position errors can be quantified accordingly. Based on these findings, we apply the results to case studies involving only inter-node distance measurement errors and only anchor position information inaccuracies. Copyright © 2024, The Authors. All rights reserved.

关键词： Sensor nodes