Demand-side flexibility as a new source of ancillary services is attracting growing attention. Aggregation and coordination mechanisms are needed to efficiently use the demand side flexibility. This paper proposes a n...
Demand-side flexibility as a new source of ancillary services is attracting growing attention. Aggregation and coordination mechanisms are needed to efficiently use the demand side flexibility. This paper proposes a new secure two-stage bottom-up coordination mechanism that ensures the quality of service (QoS) for customers and facilitates improved services for both distribution and transmission system operators. In the first stage of the proposed method, the interaction between aggregators and controllable loads is addressed. In the second stage, the interactions between the DSO and aggregators are addressed. Commitments of the aggregators to follow their scheduled power in the electricity market are also taken into account in the proposed framework. The proposed method is applied to a test system with two areas supplied by two transformers with some uncontrollable loads, 70 PV/battery setups, and 80 heating systems supplied by heat pumps (HP) that are in contract with two aggregators. Simulation results highlight the effectiveness of the proposed method in preventing transformers’ overload and reducing their loading by up to 27% while increasing the total electricity cost of customers with controllable devices by about 4.6%.
In this study, we integrate the established obstacle problem formulation from ice sheet modeling [12, 20] with cutting-edge deep learning methodologies to enhance ice thickness predictions, specifically targeting the ...
详细信息
The digital twin(DT)is envisaged as a catalyst for pioneering ecosystems of service provision within an immersive environment born from the convergence of virtual and physical ***,DT could enhance the performance of e...
详细信息
The digital twin(DT)is envisaged as a catalyst for pioneering ecosystems of service provision within an immersive environment born from the convergence of virtual and physical ***,DT could enhance the performance of edge-intelligent connected vehicular networks by allocating network resources efficiently based on the key performance indicators(KPIs)of vehicular data ***,this work addresses the key challenge of computation and spectrum resource allocation for vehicular *** allocate the optimal resource allocation,we subdivided the problem into:traffic classification,collective learning,and resource allocation *** order to do so,this paper concentrates on two crucial vehicular applications:brake application and lane-change *** utilize a random forest model to collectively learn vehicular data traffic in the upcoming time ***,a time-ahead resource allocation algorithm is proposed to improve the quality of service(QoS)by intelligently offloading vehicular data traffic to a DT-based integrated fiber-wireless(Fi-Wi)connected vehicular *** evaluate the performance of the resource allocation strategy in terms of resources required by the network alongside the packet loss *** was observed that there was a 44.74%increase in cost as the total computation resources increased from F=50 to 100 GHz,whereas the PLR of the network decreased by 71.43%.
This paper presents models for renewable energy systems with storage, and considers its optimal operation. We model and simulate wind and solar power production using stochastic differential equations as well as stora...
This paper presents models for renewable energy systems with storage, and considers its optimal operation. We model and simulate wind and solar power production using stochastic differential equations as well as storage of the produced power using batteries, thermal storage, and water electrolysis. We formulate an economic optimal control problem, with the scope of controlling the system in the most efficient way, while satisfying the power demand from the electric grid. Deploying multiple storage systems allows flexibility and higher reliability of the renewable energy system.
A singularly (near) optimal distributed algorithm is one that is (near) optimal in two criteria, namely, its time and message complexities. For synchronous CONGEST networks, such algorithms are known for fundamental d...
详细信息
ISBN:
(纸本)9783959772556
A singularly (near) optimal distributed algorithm is one that is (near) optimal in two criteria, namely, its time and message complexities. For synchronous CONGEST networks, such algorithms are known for fundamental distributed computing problems such as leader election [Kutten et al., JACM 2015] and Minimum Spanning Tree (MST) construction [Pandurangan et al., STOC 2017, Elkin, PODC 2017]. However, it is open whether a singularly (near) optimal bound can be obtained for the MST construction problem in general asynchronous CONGEST networks. In this paper, we present a randomized distributed MST algorithm that, with high probability, computes an MST in asynchronous CONGEST networks and takes Õ(D1+Ε + √n) time and Õ(m) messages1, where n is the number of nodes, m the number of edges, D is the diameter of the network, and Ε > 0 is an arbitrarily small constant (both time and message bounds hold with high probability). Since (Equation presented)(D + √n) and Ω(m) are respective time and message lower bounds for distributed MST construction in the standard KT0 model, our algorithm is message optimal (up to a polylog(n) factor) and almost time optimal (except for a DΕ factor). Our result answers an open question raised in Mashregi and King [DISC 2019] by giving the first known asynchronous MST algorithm that has sublinear time (for all D = O(n1-Ε)) and uses Õ(m) messages. Using a result of Mashregi and King [DISC 2019], this also yields the first asynchronous MST algorithm that is sublinear in both time and messages in the KT1 CONGEST model. A key tool in our algorithm is the construction of a low diameter rooted spanning tree in asynchronous CONGEST that has depth Õ(D1+Ε) (for an arbitrarily small constant Ε > 0) in Õ(D1+Ε) time and Õ(m) messages. To the best of our knowledge, this is the first such construction that is almost singularly optimal in the asynchronous setting. This tree construction may be of independent interest as it can also be used for efficiently perfor
This paper introduces a novel direct approach to system identification of dynamic networks with missing data based on maximum likelihood estimation. Dynamic networks generally present a singular probability density fu...
详细信息
ISBN:
(数字)9783907144107
ISBN:
(纸本)9798331540920
This paper introduces a novel direct approach to system identification of dynamic networks with missing data based on maximum likelihood estimation. Dynamic networks generally present a singular probability density function, which poses a challenge in the estimation of their parameters. By leveraging knowledge about the network's interconnections, we show that it is possible to transform the problem into a more tractable form by applying linear transformations. This results in a nonsingular probability density function, enabling the application of maximum likelihood estimation techniques. Our preliminary numerical results suggest that when combined with global optimization algorithms or a suitable initialization strategy, we are able to obtain a good estimate of the dynamics of the internal systems.
Reducing the amount of data transmitted and protecting devices from the adversary environment are the major challenges faced in the development of the Internet of Things (IoT) network. Compressive sensing (CS) offers ...
详细信息
In this study, we created an Intelligent Geospatial Platform called GeoBeeDashboard. The GeoBeeDashboard combines advanced geospatial technologies and artificial intelligence (AI), allowing real-time data visualizatio...
详细信息
ISBN:
(数字)9798350368086
ISBN:
(纸本)9798350368093
In this study, we created an Intelligent Geospatial Platform called GeoBeeDashboard. The GeoBeeDashboard combines advanced geospatial technologies and artificial intelligence (AI), allowing real-time data visualization and optimized decision-making across multiple sectors. The system architecture consists of a ***-based front end, a FastAPI-driven back end, and PostGIS for geospatial data management. One of the GeoBeeDashboard’s primary use cases is addressing waste management issues in Tangerang City, Indonesia. As rapid urbanization increases waste generation, effective management becomes critical. The dashboard identifies critical trends and inefficiencies in Tangerang’s districts by K-Means clustering waste management data from 2020 to 2023. Our findings identify distinct clusters, highlighting areas with effective waste management and those that require targeted interventions. The benefits that local government can get from GeoBeeDashboard by utilising insights based on clustering analysis of data per each district in Tangerang to optimise waste collection, allocate resources efficiently, and improve the policy-making process for each district in Tangerang. The GeoBeeDashboard improves local government capabilities by providing a scalable model for other cities facing similar urban challenges. In conclusion, GeoBeeDashboard provides local governments with a powerful tool for addressing waste management inefficiencies and fostering sustainable urban development.
On a finite time interval (0,T), we consider the multiresolution Galerkin discretization of a modified Hilbert transform HT which arises in the space-time Galerkin discretization of the linear diffusion equation. To t...
详细信息
Information Technology (IT) is now widely adopted in current business and organizations, which refers to the usage of any computers, networking and physical devices to help create, exchange and handle electronic data....
详细信息
暂无评论