• Journal of Power Electronics
• /
• v.15 no.4
• /
• pp.1119-1130
• /
• 2015

This study investigates the multi-objective fuzzy optimization of crowbar resistance for the doubly fed induction generator (DFIG) low-voltage ride-through (LVRT). By integrating the crowbar resistance of the crowbar circuit as a decision variable, a multi-objective model for crowbar resistance value optimization has been established to minimize rotor overcurrent and to simultaneously reduce the DFIG reactive power absorbed from the grid during the process of LVRT. A multi-objective genetic algorithm (MOGA) is applied to solve this optimization problem. In the proposed GA, the value of the crowbar resistance is represented by floating-point numbers in the GA population. The MOGA emphasizes the non-dominated solutions and simultaneously maintains diversity in the non-dominated solutions. A fuzzy-set-theory-based is employed to obtain the best solution. The proposed approach has been evaluated on a 3 MW DFIG LVRT. Simulation results show the effectiveness of the proposed approach for solving the crowbar resistance multi-objective optimization problem in the DFIG LVRT.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3887-3907
• /
• 2015

This paper introduces a full duplex single secondary user multiple-input multiple-output (FD-SSU-MIMO) cognitive radio network, where secondary user (SU) opportunistically accesses the authorized spectrum unoccupied by primary user (PU) and transmits data based on FD-MIMO mode. Then we study the network achievable average sum-rate maximization problem under sum transmit power budget constraint at SU communication nodes. In order to solve the trade-off problem between SU's sensing time and data transmission time based on opportunistic spectrum access (OSA) and the power allocation problem based on FD-MIMO transmit mode, we propose a simple trisection algorithm to obtain the optimal sensing time and apply an alternating optimization (AO) algorithm to tackle the FD-MIMO based network achievable sum-rate maximization problem. Simulation results show that our proposed sensing time optimization and AO-based optimal power allocation strategies obtain a higher achievable average sum-rate than sequential convex approximations for matrix-variable programming (SCAMP)-based power allocation for the FD transmission mode, as well as equal power allocation for the half duplex (HD) transmission mode.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3867-3886
• /
• 2015

This article investigates the problem of opportunistic spectrum access in dynamic environment, in which the signal-to-noise ratio (SNR) is time-varying. Different from existing work on continuous feedback, we consider more practical scenarios in which the transmitter receives an Acknowledgment (ACK) if the received SNR is larger than the required threshold, and otherwise a Non-Acknowledgment (NACK). That is, the feedback is discrete. Several applications with different threshold values are also considered in this work. The channel selection problem is formulated as a non-cooperative game, and subsequently it is proved to be a potential game, which has at least one pure strategy Nash equilibrium. Following this, a multi-agent Q-learning algorithm is proposed to converge to Nash equilibria of the game. Furthermore, opportunistic spectrum access with multiple discrete feedbacks is also investigated. Finally, the simulation results verify that the proposed multi-agent Q-learning algorithm is applicable to both situations with binary feedback and multiple discrete feedbacks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4808-4824
• /
• 2016

Signal individual reconnaissance and identification is an extremely important research topic in non-cooperative domains such as electronic countermeasures and intelligence reconnaissance. Facing the characteristics of the complexity and changeability of current communication environment, how to realize radiation source signal individual identification under the low SNR conditions is an emphasis of research. A novel emitter individual identification method combined bi-spectrum analysis with wavelet feature is presented in this paper. It makes a feature fusion of bi-spectrum slice characteristics and energy variance characteristics of the secondary wavelet transform coefficient to identify MFSK signals under the low SNR (signal-to-noise ratios) environment. Theoretical analyses and computer simulation results show that the proposed algorithm has good recognition performance with the ability to suppress noise and interference, and reaches the recognition rate of more than 90% when the SNR is -6dB.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2063-2081
• /
• 2018

A resource allocation algorithm is proposed in this paper to simultaneously minimize the total system power consumption and maximize the system throughput for the downlink of multi-user multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) systems. With the Lagrange dual decomposition method, we transform the original problem to its convex dual problem and prove that the duality gap between the two problems is zero, which means the optimal solution of the original problem can be obtained by solving its dual problem. Then, we use convex optimization method to solve the dual problem and utilize bisection method to obtain the optimal dual variable. The numerical results show that the proposed algorithm is superior to traditional single-objective optimization method in both the system throughput and the system energy consumption.

• Journal of the Optical Society of Korea
• /
• v.18 no.3
• /
• pp.217-224
• /
• 2014

A major advantage of wavefront reconstruction based on a series of diffracted intensity images using only single-beam illumination is the simplicity of setup. Here we propose a fast-converging algorithm for wavefront calculation using single-beam illumination. The captured intensity images are resampled to a series of intensity images, ranging from highest to lowest resampling; each resampled image has half the number of pixels as the previous one. Phase calculation at a lower resolution is used as the initial solution phase at a higher resolution. This corresponds to separately calculating the phase for the lower- and higher-frequency components. Iterations on the low-frequency components do not need to be performed on the higher-frequency components, thus making the convergence of the phase retrieval faster than with the conventional method. The principle is verified by both simulation and optical experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.1140-1155
• /
• 2021

Up to now, many state-of-arts have been proposed for two-way relaying system with linear modulations. The performances of antenna selection (AS) at both transmit and relay nodes need to be investigated in some two-way relaying multiple-input multiple-output (TWRM) systems. In this paper, the goal is focused on the study of nonlinear modulations, i.e., continuous phase modulation (CPM) in TWRM systems. Firstly, the joint phase trellis are simplified by reversed Rimoldi processing so as to reduce the systems' complexity. Then the performances of joint transmit and receive antenna selection (JTRAS) with CPM modulations in two-way relaying MIMO systems are analyzed. More exactly, the pair wise probability (PEP) is used to evaluate the error performance based on the CPM signal matrix, which is calculated in terms of Laurent expression. Since the channels subject to two terminal nodes share common antennas at relay node R in multiple-access scheme, we revise the JTRAS algorithm and compare it to existing algorithm via simulation. Finally, the error performances for various schemes of antenna selection are simulated and compared to the analysis in this paper.

• Steel and Composite Structures
• /
• v.30 no.3
• /
• pp.293-304
• /
• 2019

The optimum cost of a reinforced concrete plane and space frames have been found by using the Genetic Algorithm (GA) method. The design procedure is subjected to many constraints controlling the designed sections (beams and columns) based on the standard specifications of the American Concrete Institute ACI Code 2011. The design variables have contained the dimensions of designed sections, reinforced steel and topology through the section. It is obtained from a predetermined database containing all the single reinforced design sections for beam and columns subjected to axial load, uniaxial or biaxial moments. The designed optimum beam sections by using GAs have been unified through MATLAB to satisfy axial, flexural, shear and torsion requirements based on the designed code. The frames' functional cost has contained the cost of concrete and reinforcement of steel in addition to the cost of the frames' formwork. The results have found that limiting the dimensions of the frame's beams with the frame's columns have increased the optimum cost of the structure by 2%, declining the re-analysis of the optimum designed structures through GA.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.359-373
• /
• 2019

For clustering large-scale data, which cannot be loaded into memory entirely, incremental clustering algorithms are very popular. Usually, these algorithms only concern the within-cluster compactness and ignore the between-cluster separation. In this paper, we propose two incremental fuzzy compactness and separation (FCS) clustering algorithms, Single-Pass FCS (SPFCS) and Online FCS (OFCS), based on a fuzzy scatter matrix. Firstly, we introduce two incremental clustering methods called single-pass and online fuzzy C-means algorithms. Then, we combine these two methods separately with the weighted fuzzy C-means algorithm, so that they can be applied to the FCS algorithm. Afterwards, we optimize the within-cluster matrix and betweencluster matrix simultaneously to obtain the minimum within-cluster distance and maximum between-cluster distance. Finally, large-scale datasets can be well clustered within limited memory. We implemented experiments on some artificial datasets and real datasets separately. And experimental results show that, compared with SPFCM and OFCM, our SPFCS and OFCS are more robust to the value of fuzzy index m and noise.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.4
• /
• pp.1263-1274
• /
• 2021

In online competitive social networks, each user can be influenced by different competing influencers and consequently chooses different products. But their interest may change over time and may have swings between different products. The existing influence spreading models seldom take into account the time-related shifts. This paper proposes a minimum cost influence maximization algorithm based on the competitive transition probability. In the model, we set a one-dimensional vector for each node to record the probability that the node chooses each different competing influencer. In the process of propagation, the influence maximization on Competitive Linear Threshold (IMCLT) spreading model is proposed. This model does not determine by which competing influencer the node is activated, but sets different weights for all competing influencers. In the process of spreading, we select the seed nodes according to the cost function of each node, and evaluate the final influence based on the competitive transition probability. Experiments on different datasets show that the proposed minimum cost competitive influence maximization algorithm based on IMCLT spreading model has excellent performance compared with other methods, and the computational performance of the method is also reasonable.