22,888 research outputs found
Decentralized Greedy-Based Algorithm for Smart Energy Management in Plug-in Electric Vehicle Energy Distribution Systems
Variations in electricity tariffs arising due to stochastic demand loads on the power grids have stimulated research in finding optimal charging/discharging scheduling solutions for electric vehicles (EVs). Most of the current EV scheduling solutions are either centralized, which suffer from low reliability and high complexity, while existing decentralized solutions do not facilitate the efficient scheduling of on-move EVs in large-scale networks considering a smart energy distribution system. Motivated by smart cities applications, we consider in this paper the optimal scheduling of EVs in a geographically large-scale smart energy distribution system where EVs have the flexibility of charging/discharging at spatially-deployed smart charging stations (CSs) operated by individual aggregators. In such a scenario, we define the social welfare maximization problem as the total profit of both supply and demand sides in the form of a mixed integer non-linear programming (MINLP) model. Due to the intractability, we then propose an online decentralized algorithm with low complexity which utilizes effective heuristics to forward each EV to the most profitable CS in a smart manner. Results of simulations on the IEEE 37 bus distribution network verify that the proposed algorithm improves the social welfare by about 30% on average with respect to an alternative scheduling strategy under the equal participation of EVs in charging and discharging operations. Considering the best-case performance where only EV profit maximization is concerned, our solution also achieves upto 20% improvement in flatting the final electricity load. Furthermore, the results reveal the existence of an optimal number of CSs and an optimal vehicle-to-grid penetration threshold for which the overall profit can be maximized. Our findings serve as guidelines for V2G system designers in smart city scenarios to plan a cost-effective strategy for large-scale EVs distributed energy management
Thermodynamic Phase Diagram of the Quantum Hall Skyrmion System
We numerically study the interacting quantum Hall skyrmion system based on
the Chern-Simons action. By noticing that the action is invariant under global
spin rotations in the spin space with respect to the magnetic field direction,
we obtain the low-energy effective action for a many skyrmion system.
Performing extensive molecular dynamics simulations, we establish the
thermodynamic phase diagram for a many skyrmion system.Comment: 4 pages, RevTex, 2 postscript figure
Maximal induced matchings in triangle-free graphs
An induced matching in a graph is a set of edges whose endpoints induce a
-regular subgraph. It is known that any -vertex graph has at most
maximal induced matchings, and this bound is best
possible. We prove that any -vertex triangle-free graph has at most maximal induced matchings, and this bound is attained by any
disjoint union of copies of the complete bipartite graph . Our result
implies that all maximal induced matchings in an -vertex triangle-free graph
can be listed in time , yielding the fastest known algorithm for
finding a maximum induced matching in a triangle-free graph.Comment: 17 page
Erratum: Dirichlet Forms and Dirichlet Operators for Infinite Particle Systems: Essential Self-adjointness
We reprove the essential self-adjointness of the Dirichlet operators of
Dirchlet forms for infinite particle systems with superstable and
sub-exponentially decreasing interactions.Comment: This is an erratum to the work appeared in J. Math. Phys. 39(12),
6509-6536 (1998
- …