Search
Search Results
-
-
Transient multi-physics behavior of an insert high temperature superconducting no-insulation coil in hybrid superconducting magnets with inductive coupling
A transient multi-physics model incorporated with an electromagneto-thermomechanical coupling is developed to capture the multi-field behavior of a...
-
On the Thermal Hysteresis Behavior of Encapsulated Latent Heat Storage with Various Geometry
In this work, thermal hysteresis of PCM inside different encapsulated configurations (circle, triangle and square) during melting and solidification...
-
Access Control Method for EV Charging Stations Based on State Aggregation and Q-Learning
This paper presents intelligent access control for a charging station and a framework for dynamically and adaptively managing charging requests from...
-
The Semantic Function of the Axiomatic Method
Since ancient Greek mathematics the axiomatic method had essentially a deductive function in the sense of granting the truth of the propositions of a...
-
Co-optimizing the smart grid and electric public transit bus system
As climate change provides impetus for investing in smart cities, with electrified public transit systems, we consider electric public transportation...
-
Planar graphs are acyclically edge \((\Delta + 5)\)-colorable
An edge coloring of a graph G is to color all its edges such that adjacent edges receive different colors. It is acyclic if the subgraph induced by...
-
A novel adaptive meshless method for solving the nonlinear time fractional telegraph equations on arbitrary domains
A novel adaptive meshless numerical method for tackling with the two-dimensional time fractional telegraph equations on arbitrary domains based on...
-
Lesson Plan: Capacitor Charge and Discharge Process. Capacitor Energy
In this lesson, students will learn about the change of voltage on a capacitor over time during the processes of charging and discharging. By...
-
2-Distance \((\varDelta +1)\) -Coloring of Sparse Graphs Using the Potential Method
A 2-distance k-coloring of a graph is a proper k-coloring of the vertices where vertices at distance at most 2 cannot share the same color. We prove...
-
Domination Games Played on Graphs
This concise monograph present the complete history of the domination game and its variants up to the most recent developments and will stimulate...
-
Service-oriented operational decision optimization for dry bulk ship** fleet under stochastic demand
Dry bulk ship** plays a crucial role in intercontinental bulk cargo transport, with operators managing fleets to meet shippers’ transportation...
-
Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system
We develop a stochastic optimization model for scheduling a hybrid solar-battery storage system. Solar power in excess of the promise can be used to...
-
Reducing Peak Electricity Demands of a Cluster of Buildings with Multi-Agent Reinforcement Learning
The proliferation of distributed energy sources (DESs) in buildings offers a unique opportunity for demand response (DR) programs to reduce peak...
-
The Great Debate
Forty+ years later, the controversy surrounding the Appel and Haken proof is amazingly alive and well. Even when the extraordinary in many respects...
-
Firing and synchronous of two memristive neurons
As a nonlinear circuit component, memristor can be utilized to simulate neural discharging activities in biological neural networks with synapses and...
-
A unified operation decision model for dry bulk ship** fleet: ship scheduling, routing, and sailing speed optimization
Dry bulk ship** plays a crucial role in the global transportation of raw material across continents. As the primary player in the dry bulk ship**...
-
Optimal Planning of the Microgrid Considering Optimal Sizing of the Energy Resources
This study addresses the necessity of energy storage systems in microgrids due to the uncertainties in power generation from photovoltaic (PV)...
-
Injective Δ+2 Coloring of Planar Graph Without Short Cycles
A coloring of graph G is an injective coloring if its restriction to the neighborhood of any vertex is injective, which means that any two vertices...
-
The Odd Chromatic Number of a Planar Graph is at Most 8
Petruševski and Škrekovski recently introduced the notion of an odd colouring of a graph: a proper vertex colouring of a graph G is said to be odd if...
