An efficient forward-backward algorithm to MSDEPP including batteries and voltage control devices

Electric distribution networks are now in the era of transition from passive to active distribution networks with the integration of energy storage devices. Optimal usage of batteries and voltage control devices along with other upgrades in network needs a distribution expansion planning (DEP) considering inter-temporal dependencies of stages. This paper presents an efficient approach for solving multi-stage distribution expansion planning problems (MSDEPP) based on a forward-backward approach considering energy storage devices such as batteries and voltage control devices such as voltage regulators and capacitors. The proposed algorithm is compared with three other techniques including full dynamic, forward fill-in, backward pull-out from the point of view of their precision and their computational efficiency. The simulation results for the IEEE 13 bus network show the proposed pseudo-dynamic forward-backward approach presents good efficiency in precision and time of optimization.

Activation of membrane-bound proteins and receptor systems: A link between tissue kallikrein and the KLK-related peptidases

The 15 members of the kallikrein-related serine peptidase (KLK) family have diverse tissue-specific expression profiles and roles in a range of cellular processes, including proliferation, migration, invasion, differentiation, inflammation and angiogenesis that are required in both normal physiology as well as pathological conditions. These roles require cleavage of a range of substrates, including extracellular matrix proteins, growth factors, cytokines as well as other proteinases. In addition, it has been clear since the earliest days of KLK research that cleavage of cell surface substrates is also essential in a range of KLK-mediated cellular processes where these peptidases are essentially acting as agonists and antagonists. In this review we focus on these KLK-regulated cell surface receptor systems including bradykinin receptors, proteinase-activated receptors, as well as the plasminogen activator, ephrins and their receptors, and hepatocyte growth factor/Met receptor systems and other plasma membrane proteins. From this analysis it is clear that in many physiological and pathological settings KLKs have the potential to regulate multiple receptor systems simultaneously; an important issue when these peptidases and substrates are targeted in disease.

The Long and Short of It: Branch Lengths and the Problem of Placing the New Zealand Short-Tailed Bat, Mystacina

The taxonomic position of the endemic New Zealand bat genus Mystacina has vexed systematists ever since its erection in 1843. Over the years the genus has been linked with many microchiropteran families and superfamilies. Most recent classifications place it in the Vespertilionoidea, although some immunological evidence links it with the Noctilionoidea (=Phyllostomoidea). We have sequenced 402 bp of the mitochondrial cytochrome b gene for M. tuberculata (Gray in Dieffenbach, 1843), and using both our own and published DNA sequences for taxa in both superfamilies, we applied different tree reconstruction methods to find the appropriate phylogeny and different methods of estimating confidence in the parts of the tree. All methods strongly support the classification of Mystacina in the Noctilionoidea. Spectral analysis suggests that parsimony analysis may be misleading for Mystacina's precise placement within the Noctilionoidea because of its long terminal branch. Analyses not susceptible to long-branch attraction suggest that the Mystacinidae is a sister family to the Phyllostomidae. Dating the divergence times between the different taxa suggests that the extant chiropteran families radiated around and shortly after the Cretaceous-Tertiary boundary. We discuss the biogeographical implications of classifying Mystacina within the Noctilionoidea and contrast our result with those classifications placing Mystacina in the Vespertilionoidea, concluding that evidence for the latter is weak.

Excitation of bound plasmons along nanoscale stripe waveguides: A comparison of end and grating coupling techniques

In this paper we excite bound long range stripe plasmon modes with a highly focused laser beam. We demonstrate highly confined plasmons propagating along a 50 μm long silver stripe 750 nm wide and 30 nm thick. Two excitation techniques were studied: focusing the laser spot onto the waveguide end and focusing the laser spot onto a silver grating. By comparing the intensity of the out-coupling photons at the end of the stripe for both grating and end excitation we are able to show that gratings provide an increase of a factor of two in the output intensity and thus out-coupling of plasmons excited by this technique are easier to detect. Authors expect that the outcome of this paper will prove beneficial for the development of passive nano-optical devices based on stripe waveguides, by providing insight into the different excitation techniques available and the advantages of each technique.

GPU accelerated algorithms for computing matrix function vector products with applications to exponential integrators and fractional diffusion

The efficient computation of matrix function vector products has become an important area of research in recent times, driven in particular by two important applications: the numerical solution of fractional partial differential equations and the integration of large systems of ordinary differential equations. In this work we consider a problem that combines these two applications, in the form of a numerical solution algorithm for fractional reaction diffusion equations that after spatial discretisation, is advanced in time using the exponential Euler method. We focus on the efficient implementation of the algorithm on Graphics Processing Units (GPU), as we wish to make use of the increased computational power available with this hardware. We compute the matrix function vector products using the contour integration method in [N. Hale, N. Higham, and L. Trefethen. Computing Aα, log(A), and related matrix functions by contour integrals. SIAM J. Numer. Anal., 46(5):2505–2523, 2008]. Multiple levels of preconditioning are applied to reduce the GPU memory footprint and to further accelerate convergence. We also derive an error bound for the convergence of the contour integral method that allows us to pre-determine the appropriate number of quadrature points. Results are presented that demonstrate the effectiveness of the method for large two-dimensional problems, showing a speedup of more than an order of magnitude compared to a CPU-only implementation.

One practical algorithm for both stochastic and adversarial bandits

We present an algorithm for multiarmed bandits that achieves almost optimal performance in both stochastic and adversarial regimes without prior knowledge about the nature of the environment. Our algorithm is based on augmentation of the EXP3 algorithm with a new control lever in the form of exploration parameters that are tailored individually for each arm. The algorithm simultaneously applies the “old” control lever, the learning rate, to control the regret in the adversarial regime and the new control lever to detect and exploit gaps between the arm losses. This secures problem-dependent “logarithmic” regret when gaps are present without compromising on the worst-case performance guarantee in the adversarial regime. We show that the algorithm can exploit both the usual expected gaps between the arm losses in the stochastic regime and deterministic gaps between the arm losses in the adversarial regime. The algorithm retains “logarithmic” regret guarantee in the stochastic regime even when some observations are contaminated by an adversary, as long as on average the contamination does not reduce the gap by more than a half. Our results for the stochastic regime are supported by experimental validation.

Predicting tours and probabilistic simulation for BKZ lattice reduction algorithm

We investigate the terminating concept of BKZ reduction first introduced by Hanrot et al. [Crypto'11] and make extensive experiments to predict the number of tours necessary to obtain the best possible trade off between reduction time and quality. Then, we improve Buchmann and Lindner's result [Indocrypt'09] to find sub-lattice collision in SWIFFT. We illustrate that further improvement in time is possible through special setting of SWIFFT parameters and also through the combination of different reduction parameters adaptively. Our contribution also include a probabilistic simulation approach top-up deterministic simulation described by Chen and Nguyen [Asiacrypt'11] that can able to predict the Gram-Schmidt norms more accurately for large block sizes.

Design and flight testing of a bio-inspired plume tracking algorithm for unmanned serial vehicles

There is an increased interest on the use of UAVs for environmental research such as tracking bush fires, volcanic eruptions, chemical accidents or pollution sources. The aim of this paper is to describe the theory and results of a bio-inspired plume tracking algorithm. A method for generating sparse plumes in a virtual environment was also developed. Results indicated the ability of the algorithms to track plumes in 2D and 3D. The system has been tested with hardware in the loop (HIL) simulations and in flight using a CO2 gas sensor mounted to a multi-rotor UAV. The UAV is controlled by the plume tracking algorithm running on the ground control station (GCS).