In this work, we study the intrinsic complexity of black-box Universally Composable (UC) secure computation based on general assumptions. We present a thorough study in various corruption modelings while focusing on achieving security in the common reference string (CRS) model. Our results involve the following: • Static UC secure computation. Designing the first static UC secure oblivious tran...

Traditional power system operation and control decision-making processes, such as the unit commitment (UC) problem, primarily rely on physical models numerical calculations. With growing scale complexity of modern grids, it becomes more complicated to accurately formulate difficult efficiently solve corresponding UC problems. As a matter fact, plenty historical records well real-time data could...

Unit commitment (UC) stands out as a significant challenge in electrical power systems. With the rapid growth demand and pressing issues of fossil fuel scarcity global warming, it has become crucial to enhance utilization renewable energy sources. This study focuses on addressing UC problem by incorporating wind farm proposes modified version metaheuristic African vultures optimization algorith...

Power reserves are usually scheduled in day-ahead unit commitment (UC) to minimize operating costs while maintaining system security. In applying basic UC (bUC) after a contingency, the frequency may fall upon activation of load-shedding global control (under-frequency or UFLS) limits. Small isolated microgrids more sensitive this issue due their lack inertia. Including dynamic considerations i...

This paper presents an enhanced merit order (EMO) and augmented Lagrange Hopfield network (ALHN) for unit commitment (UC). The EMO method is a merit order based heuristic search for unit scheduling and ALHN is a continuous Hopfield network based on augmented Lagrange relaxation for economic dispatch problem. First, generating units are sorted in ascending average production cost and committed t...

We study the necessary and sufficient assumptions for universally composable (UC) computation, both in terms of setup and computational assumptions. We look at the common reference string model, the uniform random string model and the key-registration authority model (KRA), and provide new results for all of them. Perhaps most interestingly we show that: – For even the minimal meaningful KRA, w...

The use of photovoltaic (PV) generation forecasts in economic load dispatching control (EDC), which includes the unit commitment (UC) of conventional power plants, is essential to ensure the economic performance and the reliability of power systems. In the previous study, we developed a day-ahead charge and discharge scheduling method of battery energy storage systems (BESSs) based on interval ...

In this paper, Multi Objective Harmony Search Algorithm (MOHSA) is used to solve the Unit Commitment (UC) problem between thermal generating units with wind impact an electricity market to minimize total cost to achieve a real system considered with various generator and wind constraints in power systems. Today the wind power is utilized as energy in power systems to play an important role in r...

Inverter Based Generators (IBGs) have been increasing significantly in power systems. Due to the demanding thermal rating of Power Electronics (PE), their contribution system Short Circuit Current (SCC) is much less than that from conventional Synchronous (SGs) thus reducing strength and posing challenges protection stability. This paper proposes a Unit Commitment (UC) model with SCC constraint...

To each finite-dimensional operator space E is associated a commutative operator algebra UC(E), so that E embeds completely isometrically in UC(E) and any completely contractive map from E to bounded operators on Hilbert space extends uniquely to a completely contractive homomorphism out of UC(E). The unit ball of UC(E) is characterized by a Nevanlinna factorization and transfer function realiz...