Load Forecasting Research of Power System Based on Fuzzy Sets Algorithm

Qihui Wang,Yuhuai Wang,Huixi Zhang,Yaping Sun 보안공학연구지원센터 2016 International Journal of Signal Processing, Image Vol.9 No.6

In this paper, adjust the system parameters back-propagation algorithm based on fuzzy similarity interval type proposed by the fuzzy rule base to streamline redundant fuzzy sets, we can also merge with the means to reduce the number of redundant fuzzy rules, then singular value decomposition method is preferred fuzzy rules. The algorithm can effectively eliminate the adverse effects caused by redundant fuzzy rule, which improve the interpretability of fuzzy rules to reduce the computational complexity of the fuzzy reasoning process, and to improve the approximation accuracy of the system. Based on the long-term and short-term load power load characteristics analysis, to identify the influence of the load itself changes and related factors, gray system theory, neural network model and chaotic time series methods, models and methods for forecasting power load range were research. Examples verified, interval prediction has better precision, demonstrate the effectiveness of the interval prediction algorithm, the research results can be used in power market analysis and forecasting systems, power system operation and provide scientific basis for management decisions.

Research on the Management Strategy of the Last Level Cache Sharing Multi-Core Processor

Yuhuai Wang,Huixi Zhang,Yaping Sun,Qihui Wang 보안공학연구지원센터 2015 International Journal of Grid and Distributed Comp Vol.8 No.5

Effective allocation of shared resources limited is a key problem for chip multiprocessors. As the processor core growth in the scale, multi thread for the shared resource limited system competition will become more intense, the performance of the system will also be more significant. In order to alleviate this problem, a fair and effective multi thread shared resources allocation scheduling algorithm is important. In all kinds of shared resources, the largest effect on the system performance is the shared cache and DRAM system. There are essential differences between the last level cache and a cache. The goal of a cache design is to provide fast data processor which requires high access speed. However, the object of the last level cache is to save data in the chip as much as possible, and the access speed requirements are not too high, it is more subject to the plate number of available transistors. Management level cache LRU strategy and its approximate algorithm are not applicable to the large capacity last level cache for traditional. It may cause destructive interference between threads, cache thrashing of stream media program lead, which will lead to a decline in the performance of processor. This paper focuses on the analysis of some hot problems of the last level cache management in the process of the large capacity of multi-core platform sharing, and puts forward the corresponding costs less.

Improved Particle Swarm Optimization Algorithm for Optimization of Power Communication Network

Yuhuai Wang,Qihui Wang,Huixi Zhang,Kang An,Xia Ye,Yaping Sun 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.1

Based on particle swarm optimization (PSO) algorithm and its power system reactive power optimization method to in-depth study and research proposed a new hybrid particle swarm optimization algorithm (HPSO). Algorithm combines the differential evolution algorithm and simulated annealing algorithm and particle swarm optimization algorithm, in particle searching optimal except for tracking individual and global, and tracks produced by particle information difference of the three value. At the same time, when the particle search space of one dimension speed lower than the setting value will be re initialized the dimensional particle velocity and the particle of differential evolution mutation. For the crossover and mutation operations, new solution may be worse than the original solution to, the introduction of simulated annealing algorithm, the metropolis rule in a certain extent accept bad solutions, allows the target function in a certain degree of deterioration, practical calculation is not according to the probability to choose the poor solution, but rather the judgment target function difference is less than allows the target function deterioration range. Hybrid particle swarm optimization algorithm combines the advantages of particle swarm optimization algorithm, differential evolution algorithm and simulated annealing algorithm, to maintain the diversity of particles, has very strong practicability.

Apoptosis induced in vivo by new type gosling viral enteritis virus

Shun Chen,Anchun Cheng,Mingshu Wang,Dekang Zhu,Renyong Jia,Qihui Luo,Hengmin Cui,Yi Zhou,Yin Wang,Zhiwen Xu,Zhengli Chen,Xiaoyue Chen,Xiaoyu Wang 대한수의학회 2011 JOURNAL OF VETERINARY SCIENCE Vol.12 No.4

In this study, apoptosis was induced by new type gosling viral enteritis virus (NGVEV) in experimentally infected goslings is reported in detail for the first time. After 3-day-old goslings were orally inoculated with a NGVEV-CN strain suspension, the time course of NGVEV effects on apoptotic morphological changes of the internal tissues was evaluated. These changes were observed by histological analysis with light microscopy and ultrastructural analysis with transmission electron microscopy. DNA fragmentation was assessed with a terminal deoxynucleotidyl transferase-mediated dUTP nick end-labeling (TUNEL) assay and DNA ladder analysis. A series of characteristic apoptotic morphological changes including chromatin condensation and margination, cytoplasmic shrinkage, plasma membrane blebbing, and formation of apoptotic bodies were noted. Apoptosis was readily observed in the lymphoid and gastrointestinal organs, and sporadically occurred in other organs after 3 days post-infection (PI). The presence and quantity of TUNEL-positive cells increased with infection time until 9 days PI. DNA extracted from the NGVEV-infected gosling cells displayed characteristic 180~200 bp ladders. Apoptotic cells were ubiquitously distributed, especially among lymphocytes, macrophages, monocytes, and epithelial and intestinal cells. Necrosis was subsequently detected during the late NGVEV-infection phase, which was characterized by cell swelling, plasma membrane collapse, and rapidly lysis. Our results suggested that apoptosis may play an important role in the pathogenesis of NGVE disease.

Non-cooperative interference radio localization with binary proximity sensors

( Qihui Wu ),( Liang Yue ),( Long Wang ),( Guoru Ding ) 한국인터넷정보학회 2015 KSII Transactions on Internet and Information Syst Vol.9 No.9

Interference can cause serious problems in our daily life. Traditional ways in localizing a target can`t work well when it comes to the source of interference for it may take an uncooperative or even resistant attitude towards localization. To tackle this issue, we take the BPSN (Binary Proximity Sensor Networks) and consider a passive way in this paper. No cooperation is needed and it is based on simple sensor node suitable for large-scale deployment. By dividing the sensing field into different patches, when enough patches are formed, good localization accuracy can be achieved with high resolution. Then we analyze the relationship between sensing radius and localization error, we find that in a finite region where edge effect can`t be ignored, the trend between sensing radius and localization error is not always consistent. Through theoretical analysis and simulation, we explore to determine the best sensing radius to achieve high localization accuracy.

Exploiting Multichannel Diversity in Spectrum Sharing Systems Using Optimal Stopping Rule

Yuhua Xu,Qihui Wu,Jinlong Wang,Alagan Anpalagan,Yitao Xu 한국전자통신연구원 2012 ETRI Journal Vol.34 No.2

This letter studies the problem of exploiting multichannel diversity in a spectrum sharing system, where the secondary user (SU) sequentially explores channel state information on the licensed channels with time consumption. To maximize the expected achievable throughput for the SU, we formulate this problem as an optimal stopping problem, whose objective is to choose the right channel to stop exploration based on the observed signal-to-noise ratio sequence. Moreover, we propose a myopic but optimal rule, called one-stage look-ahead rule, to solve the stopping problem.

Outage Analysis of CRNs with SC Diversity Over Nakagami-m Fading Environment

( Zongsheng Zhang ),( Qihui Wu ),( Xueqiang Zheng ),( Jinlong Wang ),( Lianbao Li ) 한국인터넷정보학회 2013 KSII Transactions on Internet and Information Syst Vol.7 No.12

In this paper, we investigate the outage performance of a cognitive relay network. We consider mutual interference in an independent, non-identically distributed Nakagmai-m fading environment. We first derive the close-form outage probability expression, which provides an efficient means to evaluate the effects of several parameters. This allows us to study the impact of several parameters on the network`s performance. We then derive the asymptotic expression and reveal that the diversity order is strictly determined by the fading severity of the cognitive system. It is not affected by the primary network. Moreover, the primary network only affects the coding gain of the cognitive system. Finally, Monte Carlo simulations are provided, which corroborate the analytical results.

A Novel Cooperative Spectrum Sensing Algorithm in Cognitive Radio Systems

Zheng, Xueqiang,Wang, Jinlong,Wu, Qihui,Shen, Liang The Korea Institute of Information and Commucation 2009 Journal of communications and networks Vol.11 No.2

In cognitive radio (CR) systems, cognitive users can use the frequency bands when the primary users are not present. Hence, reliable detection of available spectrum is foundation of cognitive radio technology. To ensure unimpaired operation of primary users, cooperative spectrum sensing is needed. To reduce the network overhead of cooperative spectrum sensing, a novel cooperative spectrum sensing algorithm based on credibility is proposed. In particular, the close-form expressions for probability of detection and false-alarm are derived for the novel algorithm, and expression for the average overhead used for cooperation is given. The thresholds design method for the algorithm is also discussed. The conclusion is proved by computer simulations.

Optimal Adaptive Multiband Spectrum Sensing in Cognitive Radio Networks

( Long Yu ),( Qihui Wu ),( Jinlong Wang ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.3

In this paper, optimal sensing time allocation for adaptive multiband spectrum sensing-transmission procedure is investigated. The sensing procedure consists of an exploration phase and a detection phase. We first formulate an optimization problem to maximize the throughput by designing not only the overall sensing time, but also the sensing time for every stage in the exploration and detection phases, while keeping the miss detection probability for each channel under a pre-defined threshold. Then, we transform the initial non-convex optimization problem into a convex bilevel optimization problem to make it mathematically tractable. Simulation results show that the optimized sensing time setting in this paper can provide a significant performance gain over the previous studies.

A Novel Cooperative Spectrum Sensing Algorithm in Cognitive Radio Systems

Xueqiang Zheng,Jinlong Wang,Qihui Wu,Liang Shen 한국통신학회 2009 Journal of communications and networks Vol.11 No.2

In cognitive radio (CR) systems, cognitive users can use the frequency bands when the primary users are not present. Hence, reliable detection of available spectrum is foundation of cognitive radio technology. To ensure unimpaired operation of primary users, cooperative spectrum sensing is needed. To reduce the network overhead of cooperative spectrum sensing, a novel cooperative spectrum sensing algorithm based on credibility is proposed. In particular, the close-form expressions for probability of detection and false-alarm are derived for the novel algorithm, and expression for the average overhead used for cooperation is given. The thresholds design method for the algorithm is also discussed. The conclusion is proved by computer simulations.