نتایج جستجو برای: local power

تعداد نتایج: 993387  

The significant penetration rate of wind turbines in power systems made some challenges in the operation of the systems such as large-scale power fluctuations induced by wind farms. Gas-fired plants with fast starting ability and high ramping can better handle natural uncertainties of wind power compared to other traditional plants. Therefore, the integration of electrical and natural gas syste...

2011
Waqquas A. Bukhsh Andreas Grothey Ken McKinnon Paul Trodden

The existence of locally optimal solutions to optimal power flow (OPF) problems has been a question of interest for decades. This paper presents examples of local optima on very simple power system networks. Usually local optima occur when the network is stressed, and the resulting voltage profiles are infeasible in practice; however, we present examples where the voltage is within practical li...

1994
Kousha Etessami Neil Immerman

The L NL question remains one of the major unresolved problems in complexity theory Both L and NL have logical characterizations as the sets of totally ordered structures expressible in rst order logic augmented with the appropriate Transitive Closure operator I FO DTC captures L and FO TC captures NL On the other hand in the absence of ordering FO TC is strictly more powerful than FO DTC GM An...

Journal: :Theor. Comput. Sci. 2006
Anne Broadbent André Allan Méthot

A non-local box is a virtual device that has the following property: given that Alice inputs a bit at her end of the device and that Bob does likewise, it produces two bits, one at Alice’s end and one at Bob’s end, such that the XOR of the outputs is equal to the AND of the inputs. This box, inspired from the CHSH inequality, was first proposed by Popescu and Rohrlich to examine the question: g...

Journal: :رادار 0
عطاالله ابراهیم زاده محمد آخوندی درزیکلایی

parameter estimation is an important task in the modeling, classification, and detection of radar clutters. radar clutters have stochastic characteristics. therefore, statistical distributions are usually used to describe the features of clutters better. k distribution is one of the most common models utilized to the simulation of clutters. this distribution, which consists of scale and shape p...

2013
Xueyuan Hu Heng Fan D. L. Zhou Wu-Ming Liu

We define quantum-correlating power (QCP) of a local quantum channel acting on the left part of a bipartite quantum system as the maximum amount of left quantum correlation that can be created by this channel. We prove that for any local channel, the optimal input state, which corresponds to the maximum quantum correlation in the output state, must be a classical-classical state. Further, the s...

1995
Oleg V. Belegradek Alexei P. Stolboushkin Michael A. Taitslin

Consider a scheme of databases Q and two signatures: L0 = f<g, L = f<g[ , where is a nite relational signature. For a database scheme SC = fR1; : : : ; Rng, denote L+0 = L0[SC and L+ = L [ SC. FO is the rst-order language. FO in L+0 is called restricted. FO in L+ is called extended. Consider a countable universe U in L. Assume CH. It is possible to reconstruct the proofs of corollaries into one...

2008
Monika Steinová

We consider a network represented by a simple connected undirected graph with N vertices. The nodes of the graph do not have any special unique identifiers, the only requirement is that each incident edge of a vertex v of degree dv has assigned a locally-unique label (portname) between 1 and dv, inclusive. This is called a local orientation. Our main goal is to have an agent visit all vertices ...

Journal: :CoRR 2011
Pablo Moriano Jorge Finke

This letter introduces a mechanism for constructing, through a process of distributed decision-making, substrates for the study of collective dynamics on extended power-law weighted networks with both a desired scaling exponent and a fixed clustering coefficient. The analytical results show that the connectivity distribution converges to the scaling behavior often found in social and engineerin...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 1995
Richard Beigel Howard Straubing

Identify a string x over f0; 1g with the positive integer whose binary representation is 1x. We say that a self-reduction is k-local if on input x all queries belong to fx ? 1; : : :; x ? kg. We show that all k-locally self-reducible sets belong to PSPACE. However, the power of k-local self-reductions changes drastically between k = 2 and k = 3. Although all 2-locally self-reducible sets belong...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید