A Comparative Study of Text Summarization Based on Synchronous and Asynchronous PSO

Text summarization is the process of extracting the most important sentences from the original document without its meaning change. The paper focus on Extractive summarization technique which chooses the important sentences from the document and integrates into summary. An extractive summarization technique, Particle swarm Optimization performs arithmetic operations that enhances a problem, by iteratively trying to improve possible solution with regard to input data. It determines a problem by having a population of possible solutions moving around the search space according to arithmetic formulae over the particles position and velocity. The sequence of modernized particles of PSO can be categorized into Synchronous PSO (S-PSO) and Asynchronous PSO(A-PSO). In synchronous PSO, after calculating the whole performance, velocities and positions of the particles are modernized, this increases the performance. In A-PSO after calculating its performance, velocities and positions of the particles are modernized using partial data which leads to extreme analysis. The comparative study on the synchronous PSO and asynchronous PSO with the precision and recall values for different datasets is considered. Asynchronous PSO has higher precision and recall values compared to synchronous PSO. Asynchronous PSO leads to extreme analysis of data

A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations

A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high computational cost as measured by elapsed time. One approach to reduce the elapsed time is to make use of coarse-grained parallelization to evaluate the design points. Previous parallel PSO algorithms were mostly implemented in a synchronous manner, where all design points within a design iteration are evaluated before the next iteration is started. This approach leads to poor parallel speedup in cases where a heterogeneous parallel environment is used and/or where the analysis time depends on the design point being analyzed. This paper introduces an asynchronous parallel PSO algorithm that greatly improves the parallel e ciency. The asynchronous algorithm is benchmarked on a cluster assembled of Apple Macintosh G5 desktop computers, using the multi-disciplinary optimization of a typical transport aircraft wing as an example

Transitional Particle Swarm Optimization

A new variation of particle swarm optimization (PSO) termed as transitional PSO (T-PSO) is proposed here. T-PSO attempts to improve PSO via its iteration strategy. Traditionally, PSO adopts either the synchronous or the asynchronous iteration strategy. Both of these iteration strategies have their own strengths and weaknesses. The synchronous strategy has reputation of better exploitation while asynchronous strategy is stronger in exploration. The particles of T-PSO start with asynchronous update to encourage more exploration at the start of the search. If no better solution is found for a number of iteration, the iteration strategy is changed to synchronous update to allow fine tuning by the particles. The results show that T-PSO is ranked better than the traditional PSOs

Discriminative methods for classification of asynchronous imaginary motor tasks from EEG data

In this work, two methods based on statistical models that take into account the temporal changes in the electroencephalographic (EEG) signal are proposed for asynchronous brain-computer interfaces (BCI) based on imaginary motor tasks. Unlike the current approaches to asynchronous BCI systems that make use of windowed versions of the EEG data combined with static classifiers, the methods proposed here are based on discriminative models that allow sequential labeling of data. In particular, the two methods we propose for asynchronous BCI are based on conditional random fields (CRFs) and latent dynamic CRFs (LDCRFs), respectively. We describe how the asynchronous BCI problem can be posed as a classification problem based on CRFs or LDCRFs, by defining appropriate random variables and their relationships. CRF allows modeling the extrinsic dynamics of data, making it possible to model the transitions between classes, which in this context correspond to distinct tasks in an asynchronous BCI system. On the other hand, LDCRF goes beyond this approach by incorporating latent variables that permit modeling the intrinsic structure for each class and at the same time allows modeling extrinsic dynamics. We apply our proposed methods on the publicly available BCI competition III dataset V as well as a data set recorded in our laboratory. Results obtained are compared to the top algorithm in the BCI competition as well as to methods based on hierarchical hidden Markov models (HHMMs), hierarchical hidden CRF (HHCRF), neural networks based on particle swarm optimization (IPSONN) and to a recently proposed approach based on neural networks and fuzzy theory, the S-dFasArt. Our experimental analysis demonstrates the improvements provided by our proposed methods in terms of classification accuracy

Situational Intelligence for Improving Power System Operations Under High Penetration of Photovoltaics

Nowadays, power grid operators are experiencing challenges and pressures to balance the interconnected grid frequency with rapidly increasing photovoltaic (PV) power penetration levels. PV sources are variable and intermittent. To mitigate the effect of this intermittency, power system frequency is regulated towards its security limits. Under aforementioned stressed regimes, frequency oscillations are inevitable, especially during disturbances and may lead to costly consequences as brownout or blackout. Hence, the power system operations need to be improved to make the appropriate decision in time. Specifically, concurrent or beforehand power system precise frequencies simplified straightforward-to-comprehend power system visualizations and cooperated well-performed automatic generation controls (AGC) for multiple areas are needed for operation centers to enhance. The first study in this dissertation focuses on developing frequency prediction general structures for PV and phasor measurement units integrated electric grids to improve the situational awareness (SA) of the power system operation center in making normal and emergency decisions ahead of time. Thus, in this dissertation, a frequency situational intelligence (FSI) methodology capable of multi-bus type and multi-timescale prediction is presented based on the cellular computational network (CCN) structure with a multi-layer proception (MLP) and a generalized neuron (GN) algorithms. The results present that both CCMLPN and CCGNN can provide precise multi-timescale frequency predictions. Moreover, the CCGNN has a superior performance than the CCMLPN. The second study of this dissertation is to improve the SA of the operation centers by developing the online visualization tool based on the synchronous generator vulnerability index (GVI) and the corresponding power system vulnerability index (SVI) considering dynamic PV penetration. The GVI and SVI are developed by the coherency grouping results of synchronous generator using K-Harmonic Means Clustering (KHMC) algorithm. Furthermore, the CCGNN based FSI method has been implemented for the online coherency grouping procedure to achieve a faster-than-real-time grouping performance. Last but not the least, the multi-area AGCs under different PV integrated power system operating conditions are investigated on the multi-area multi-source interconnected testbed, especially with severe load disturbances. Furthermore, an onward asynchronous tuning method and a two-step (synchronous) tuning method utilizing particle swarm optimization algorithm are developed to refine the multi-area AGCs, which provide more opportunities for power system balancing authorities to interconnect freely and to utilize more PV power. In summary, a number of methods for improving the interconnected power system situational intelligence for a high level of PV power penetration have been presented in this dissertation

Steady state particle swarm

The following grant information was disclosed by the authors: Fundação para a Ciência e Tecnologia (FCT), Research Fellowship: SFRH/BPD/66876/2009. FCT PROJECT: UID/EEA/50009/2013. EPHEMECH: TIN2014-56494-C4-3-P, Spanish Ministry of Economy and Competitivity. PROY-PP2015-06: Plan Propio 2015 UGR. CEI2015-MP-V17 of the Microprojects program 2015 from CEI BioTIC Granada.This paper investigates the performance and scalability of a new update strategy for the particle swarm optimization (PSO) algorithm. The strategy is inspired by the Bak–Sneppen model of co-evolution between interacting species, which is basically a network of fitness values (representing species) that change over time according to a simple rule: the least fit species and its neighbors are iteratively replaced with random values. Following these guidelines, a steady state and dynamic update strategy for PSO algorithms is proposed: only the least fit particle and its neighbors are updated and evaluated in each time-step; the remaining particles maintain the same position and fitness, unless they meet the update criterion. The steady state PSO was tested on a set of unimodal, multimodal, noisy and rotated benchmark functions, significantly improving the quality of results and convergence speed of the standard PSOs and more sophisticated PSOs with dynamic parameters and neighborhood. A sensitivity analysis of the parameters confirms the performance enhancement with different parameter settings and scalability tests show that the algorithm behavior is consistent throughout a substantial range of solution vector dimensions.This work was supported by Fundação para a Ciência e Tecnologia (FCT) Research Fellowship SFRH/BPD/66876/2009 and FCT Project (UID/EEA/50009/2013), EPHEMECH (TIN2014-56494-C4-3-P, Spanish Ministry of Economy and Competitivity), PROY-PP2015-06 (Plan Propio 2015 UGR), project CEI2015-MP-V17 of the Microprojects program 2015 from CEI BioTIC Granada

Scalable parallel evolutionary optimisation based on high performance computing

Evolutionary algorithms (EAs) have been successfully applied to solve various challenging optimisation problems. Due to their stochastic nature, EAs typically require considerable time to find desirable solutions; especially for increasingly complex and large-scale problems. As a result, many works studied implementing EAs on parallel computing facilities to accelerate the time-consuming processes. Recently, the rapid development of modern parallel computing facilities such as the high performance computing (HPC) bring not only unprecedented computational capabilities but also challenges on designing parallel algorithms. This thesis mainly focuses on designing scalable parallel evolutionary optimisation (SPEO) frameworks which run efficiently on the HPC. Motivated by the interesting phenomenon that many EAs begin to employ increasingly large population sizes, this thesis firstly studies the effect of a large population size through comprehensive experiments. Numerical results indicate that a large population benefits to the solving of complex problems but requires a large number of maximal fitness evaluations (FEs). However, since sequential EAs usually requires a considerable computing time to achieve extensive FEs, we propose a scalable parallel evolutionary optimisation framework that can efficiently deploy parallel EAs over many CPU cores at CPU-only HPC. On the other hand, since EAs using a large number of FEs can produce massive useful information in the course of evolution, we design a surrogate-based approach to learn from this historical information and to better solve complex problems. Then this approach is implemented in parallel based on the proposed scalable parallel framework to achieve remarkable speedups. Since demanding a great computing power on CPU-only HPC is usually very expensive, we design a framework based on GPU-enabled HPC to improve the cost-effectiveness of parallel EAs. The proposed framework can efficiently accelerate parallel EAs using many GPUs and can achieve superior cost-effectiveness. However, since it is very challenging to correctly implement parallel EAs on the GPU, we propose a set of guidelines to verify the correctness of GPU-based EAs. In order to examine these guidelines, they are employed to verify a GPU-based brain storm optimisation that is also proposed in this thesis. In conclusion, the comprehensively experimental study is firstly conducted to investigate the impacts of a large population. After that, a SPEO framework based on CPU-only HPC is proposed and is employed to accelerate a time-consuming implementation of EA. Finally, the correctness verification of implementing EAs based on a single GPU is discussed and the SPEO framework is then extended to be deployed based on GPU-enabled HPC