Showing 5 results for Idd
A. Badri, S. Jadid, M. Parsa-Moghaddam,
Volume 3, Issue 1 (1-2007)
Abstract
Unlike perfect competitive markets, in oligopoly electricity markets due to
strategic producers and transmission constraints GenCos may increase their own profit
through strategic biddings. This paper investigates the problem of developing optimal
bidding strategies of GenCos considering participants’ market power and transmission
constraints. The problem is modeled as a bi-level optimization that at the first level each
GenCo maximizes its payoff through strategic bidding and at the second level, in order to
consider transmission constraints a system dispatch is accomplished through an OPF
problem. The AC power flow model is used for proposed OPF. Here it is assumed that each
GenCo uses linear supply function model for its bidding and has information about initial
bidding of other competitors. The impact of optimal biddings on market characteristics as
well as GenCos’ payoffs are investigated and compared with perfect competitive markets
where all the participants bid with their marginal costs. Furthermore, effects of exercising
market power due to transmission constraints as well as different biddings of strategic
generators on GenCos’ optimal bidding strategies are presented. Finally IEEE-30 bus test
system is used for case study to demonstrate simulation results.
H. Miar-Naimi, P. Davari,
Volume 4, Issue 1 (1-2008)
Abstract
In this paper, a new Hidden Markov Model (HMM)-based face recognition
system is proposed. As a novel point despite of five-state HMM used in pervious
researches, we used 7-state HMM to cover more details. Indeed we add two new face
regions, eyebrows and chin, to the model. As another novel point, we used a small number
of quantized Singular Values Decomposition (SVD) coefficients as features describing
blocks of face images. This makes the system very fast. The system has been evaluated on
the Olivetti Research Laboratory (ORL) face database. In order to additional reduction in
computational complexity and memory consumption the images are resized to 64×64 jpeg
format. Before anything, an order-statistic filter is used as a preprocessing operation. Then
a top-down sequence of overlapping sub-image blocks is considered. Using quantized SVD
coefficients of these blocks, each face is considered as a numerical sequence that can be
easily modeled by HMM. The system has been examined on 400 face images of the Olivetti
Research Laboratory (ORL) face database. The experiments showed a recognition rate of
99%, using half of the images for training. The system has been evaluated on 64×64 jpeg
resized YALE database too. This database contains 165 face images with 231×195 pgm
format. Using five training image, we obtained 97.78% recognition rate where for six
training images the recognition rate was 100%, a record in the literature. The proposed
method is compared with the best researches in the literature. The results show that the
proposed method is the fastest one, having approximately 100% recognition rate.
Sh. Gorgizadeh, A. Akbari Foroud, M. Amirahmadi,
Volume 8, Issue 2 (6-2012)
Abstract
This paper proposes a method for determining the price bidding strategies of
market participants consisting of Generation Companies (GENCOs) and Distribution
Companies (DISCOs) in a day-ahead electricity market, while taking into consideration the
load forecast uncertainty and demand response programs. The proposed algorithm tries to
find a Pareto optimal point for a risk neutral participant in the market. Because of the
complexity of the problem a stochastic method is used. In the proposed method, two
approaches are used simultaneously. First approach is Fuzzy Genetic Algorithm for finding
the best bidding strategies of market players, and another one is Mont-Carlo Method that
models the uncertainty of load in price determining algorithm. It is demonstrated that with
considering transmission flow constraints in the problem, load uncertainty can considerably
influences the profits of companies and so using the second part of the proposed algorithm
will be useful in such situation. It is also illustrated when there are no transmission flow
constraints, the effect of load uncertainty can be modeled without using a stochastic model.
The algorithm is finally tested on an 8 bus system.
H. Rajabi Mashhadi, J. Khorasani,
Volume 9, Issue 1 (3-2013)
Abstract
Strategic bidding in joint energy and spinning reserve markets is a challenging task from the viewpoint of generation companies (GenCos). In this paper, the interaction between energy and spinning reserve markets is modeled considering a joint probability density function for the prices of these markets. Considering pay-as-bid pricing mechanism, the bidding problem is formulated and solved as a classic optimization problem. The results show that the contribution of a GenCo in each market strongly depends on its production cost and its level of risk-aversion. Furthermore, if reserve bid acceptance is considered subjected to winning in the energy market, it can affect the strategic bidding behavior.
Mohamed Khalaf, Ahmed Fawzi, Ahmed Yahya,
Volume 20, Issue 1 (3-2024)
Abstract
Cognitive radio (CR) is an effective technique for dealing with scarcity in spectrum resources and enhancing overall spectrum utilization. CR attempts to enhance spectrum sensing by detecting the primary user (PU) and allowing the secondary user (SU) to utilize the spectrum holes. The rapid growth of CR technology increases the required standards for Spectrum Sensing (SS) performance, especially in regions with low Signal-to-Noise Ratios (SNRs). In Cognitive Radio Networks (CRN), SS is an essential process for detecting the available spectrum. SS is divided into sensing time and transmission time; the more the sensing time, the higher the detection probability) and the lower the probability of a false alarm). So, this paper proposes a novel two-stage SS optimization model for CR systems. The proposed model consists of two techniques: Interval Dependent De-noising (IDD) and Energy Detection (ED), which achieve optimum sensing time, maximum throughput, lower and higher. The Simulation results demonstrated that the proposed model decreases the, achieves a higher especially at low SNRs ranging, and obtains the optimum sensing time, achieving maximum throughput at different numbers of sensing samples (N) and different SNRs from -10 to -20 dB in the case of N = 1000 to 10000 samples. The proposed model achieves a throughput of 5.418 and 1.98 Bits/Sec/HZ at an optimum sensing time of 0.5ms and 1.5ms respectively, when N increases from 10000 to 100000 samples. The proposed model yields an achievable throughput of 5.37 and 4.58 Bits/Sec/HZ at an optimum sensing time of 1.66ms and 13ms respectively. So, it enhances the SS process than previous related techniques.