Robust solver based on modified particle swarm optimization for improved solution of diffusion transport through containment facilities

Accurate estimation of mass transport parameters is necessary for overall design and evaluation processes of the waste disposal facilities. The mass transport parameters, such as effective diffusion coefficient, retardation factor and diffusion accessible porosity, are estimated from observed diffusion data by inverse analysis. Recently, particle swarm optimization (PSO) algorithm has been used to develop inverse model for estimating these parameters that alleviated existing limitations in the inverse analysis. However, PSO solver yields different solutions in successive runs because of the stochastic nature of the algorithm and also because of the presence of multiple optimum solutions. Thus the estimated mean solution from independent runs is significantly different from the best solution. In this paper, two variants of the PSO algorithms are proposed to improve the performance of the inverse analysis. The proposed algorithms use perturbation equation for the gbest particle to gain information around gbest region on the search space and catfish particles in alternative iterations to improve exploration capabilities. Performance comparison of developed solvers on synthetic test data for two different diffusion problems reveals that one of the proposed solvers, CPPSO, significantly improves overall performance with improved best, worst and mean fitness values. The developed solver is further used to estimate transport parameters from 12 sets of experimentally observed diffusion data obtained from three diffusion problems and compared with published values from the literature. The proposed solver is quick, simple and robust on different diffusion problems. (C) 2012 Elsevier Ltd. All rights reserved.

The Hinge Region of Human Thyroid-Stimulating Hormone (TSH) Receptor Operates as a Tunable Switch between Hormone Binding and Receptor Activation

The mechanism by which the hinge regions of glycoprotein hormone receptors couple hormone binding to activation of downstream effecters is not clearly understood. In the present study, agonistic (311.62) and antagonistic (311.87) monoclonal antibodies (MAbs) directed against the TSH receptor extracellular domain were used to elucidate role of the hinge region in receptor activation. MAb 311.62 which identifies the LRR/Cb-2 junction (aa 265-275), increased the affinity of TSHR for the hormone while concomitantly decreasing its efficacy, whereas MAb 311.87 recognizing LRR 7-9 (aa 201-259) acted as a non-competitive inhibitor of Thyroid stimulating hormone (TSH) binding. Binding of MAbs was sensitive to the conformational changes caused by the activating and inactivating mutations and exhibited differential effects on hormone binding and response of these mutants. By studying the effects of these MAbs on truncation and chimeric mutants of thyroid stimulating hormone receptor (TSHR), this study confirms the tethered inverse agonistic role played by the hinge region and maps the interactions between TSHR hinge region and exoloops responsible for maintenance of the receptor in its basal state. Mechanistic studies on the antibody-receptor interactions suggest that MAb 311.87 is an allosteric insurmountable antagonist and inhibits initiation of the hormone induced conformational changes in the hinge region, whereas MAb 311.62 acts as a partial agonist that recognizes a conformational epitope critical for coupling of hormone binding to receptor activation. The hinge region, probably in close proximity with the alpha-subunit in the hormone-receptor complex, acts as a tunable switch between hormone binding and receptor activation.

Phalangopsidae crickets from the Indian Region (Orthoptera, Grylloidea), with the descriptions of new taxa, diagnoses for genera, and a key to Indian genera

The Indian region is presently the second region after the Neotropics in terms of diversity of phalangopsid crickets. Yet their study is impeded by the lack of necessary taxonomic tools for taxon identification. In the present paper, all generic diagnoses are clarified, using morphological and genitalic characters; female genitalia are described and illustrated for all genera with known females. New taxa are described from southern India: Kempiola flavipunctatus Desutter-Grandcolas n. sp., Opiliosina meridionalis Desutter-Grandcolas n. gen., n. sp., Phalangopsina bolivari Desutter-Grandcolas n. sp., P. chopardi Desutter-Grandcolas n. sp., P. gravelyi Desutter-Grandcolas n. sp., and Speluncasina Desutter-Grandcolas n. gen. The list of phalangopsid crickets from the Indian Region is updated, and a key to phalangopsid genera proposed. A lectotype and a paralectotype are designated to fix the name of Phalangopsina dubia (Bolivar, 1900). Opilionacris annandalei Chopard, 1928, previously transferred to the African genus Phaeophilacris Walker, 1871, is transferred to the genus Speluncasina Desutter-Grandcolas n. gen., while Larandopsis jharnae Bhowmik, 1981 and L. newguineae Bhowmik, 1981 described from New Guinea are transferred to the eneopterine genus Lebinthus Stal, 1877. Finally Luzaropsis confusa Chopard, 1969 is removed from its synonymy with L. ferruginea Walker, 1871.

Computational algorithms inspired by biological processes and evolution

In recent times computational algorithms inspired by biological processes and evolution are gaining much popularity for solving science and engineering problems. These algorithms are broadly classified into evolutionary computation and swarm intelligence algorithms, which are derived based on the analogy of natural evolution and biological activities. These include genetic algorithms, genetic programming, differential evolution, particle swarm optimization, ant colony optimization, artificial neural networks, etc. The algorithms being random-search techniques, use some heuristics to guide the search towards optimal solution and speed-up the convergence to obtain the global optimal solutions. The bio-inspired methods have several attractive features and advantages compared to conventional optimization solvers. They also facilitate the advantage of simulation and optimization environment simultaneously to solve hard-to-define (in simple expressions), real-world problems. These biologically inspired methods have provided novel ways of problem-solving for practical problems in traffic routing, networking, games, industry, robotics, economics, mechanical, chemical, electrical, civil, water resources and others fields. This article discusses the key features and development of bio-inspired computational algorithms, and their scope for application in science and engineering fields.

Efficient Algorithms for Linear Summed Error Structural SVMs

Structural Support Vector Machines (SSVMs) have become a popular tool in machine learning for predicting structured objects like parse trees, Part-of-Speech (POS) label sequences and image segments. Various efficient algorithmic techniques have been proposed for training SSVMs for large datasets. The typical SSVM formulation contains a regularizer term and a composite loss term. The loss term is usually composed of the Linear Maximum Error (LME) associated with the training examples. Other alternatives for the loss term are yet to be explored for SSVMs. We formulate a new SSVM with Linear Summed Error (LSE) loss term and propose efficient algorithms to train the new SSVM formulation using primal cutting-plane method and sequential dual coordinate descent method. Numerical experiments on benchmark datasets demonstrate that the sequential dual coordinate descent method is faster than the cutting-plane method and reaches the steady-state generalization performance faster. It is thus a useful alternative for training SSVMs when linear summed error is used.

Analysis of large-amplitude stratospheric mountain wave event observed from the AIRS and MLS sounders over the western Himalayan region

Mountain waves in the stratosphere have been observed over elevated topographies using both nadir-looking and limb-viewing satellites. However, the characteristics of mountain waves generated over the Himalayan Mountain range and the adjacent Tibetan Plateau are relatively less explored. The present study reports on three-dimensional (3-D) properties of a mountain wave event that occurred over the western Himalayan region on 9 December 2008. Observations made by the Atmospheric Infrared Sounder on board the Aqua and Microwave Limb Sounder on board the Aura satellites are used to delineate the wave properties. The observed wave properties such as horizontal (lambda(x), lambda(y)) and vertical (lambda(z)) wavelengths are 276 km (zonal), 289 km (meridional), and 25 km, respectively. A good agreement is found between the observed and modeled/analyzed vertical wavelength for a stationary gravity wave determined using the Modern Era Retrospective Analysis for Research and Applications (MERRA) reanalysis winds. The analysis of both the National Centers for Environmental Prediction/National Center for Atmospheric Research reanalysis and MERRA winds shows that the waves are primarily forced by strong flow across the topography. Using the 3-D properties of waves and the corrected temperature amplitudes, we estimated wave momentum fluxes of the order of similar to 0.05 Pa, which is in agreement with large-amplitude mountain wave events reported elsewhere. In this regard, the present study is considered to be very much informative to the gravity wave drag schemes employed in current general circulation models for this region.

Assessment of seismic hazard and liquefaction potential of Gujarat based on probabilistic approaches

Gujarat is one of the fastest-growing states of India with high industrial activities coming up in major cities of the state. It is indispensable to analyse seismic hazard as the region is considered to be most seismically active in stable continental region of India. The Bhuj earthquake of 2001 has caused extensive damage in terms of causality and economic loss. In the present study, the seismic hazard of Gujarat evaluated using a probabilistic approach with the use of logic tree framework that minimizes the uncertainties in hazard assessment. The peak horizontal acceleration (PHA) and spectral acceleration (Sa) values were evaluated for 10 and 2 % probability of exceedance in 50 years. Two important geotechnical effects of earthquakes, site amplification and liquefaction, are also evaluated, considering site characterization based on site classes. The liquefaction return period for the entire state of Gujarat is evaluated using a performance-based approach. The maps of PHA and PGA values prepared in this study are very useful for seismic hazard mitigation of the region in future.

q-Gaussian based Smoothed Functional Algorithms for Stochastic Optimization

The q-Gaussian distribution results from maximizing certain generalizations of Shannon entropy under some constraints. The importance of q-Gaussian distributions stems from the fact that they exhibit power-law behavior, and also generalize Gaussian distributions. In this paper, we propose a Smoothed Functional (SF) scheme for gradient estimation using q-Gaussian distribution, and also propose an algorithm for optimization based on the above scheme. Convergence results of the algorithm are presented. Performance of the proposed algorithm is shown by simulation results on a queuing model.

Smoothed functional and Quasi-Newton algorithms for routing in multi-stage queueing network with constraints

We consider the problem of optimal routing in a multi-stage network of queues with constraints on queue lengths. We develop three algorithms for probabilistic routing for this problem using only the total end-to-end delays. These algorithms use the smoothed functional (SF) approach to optimize the routing probabilities. In our model all the queues are assumed to have constraints on the average queue length. We also propose a novel quasi-Newton based SF algorithm. Policies like Join Shortest Queue or Least Work Left work only for unconstrained routing. Besides assuming knowledge of the queue length at all the queues. If the only information available is the expected end-to-end delay as with our case such policies cannot be used. We also give simulation results showing the performance of the SF algorithms for this problem.

Combination of similarity measures for time series classification using genetic algorithms

Time series classification deals with the problem of classification of data that is multivariate in nature. This means that one or more of the attributes is in the form of a sequence. The notion of similarity or distance, used in time series data, is significant and affects the accuracy, time, and space complexity of the classification algorithm. There exist numerous similarity measures for time series data, but each of them has its own disadvantages. Instead of relying upon a single similarity measure, our aim is to find the near optimal solution to the classification problem by combining different similarity measures. In this work, we use genetic algorithms to combine the similarity measures so as to get the best performance. The weightage given to different similarity measures evolves over a number of generations so as to get the best combination. We test our approach on a number of benchmark time series datasets and present promising results.

Operator-splitting finite element algorithms for computations of high-dimensional parabolic problems

An operator-splitting finite element method for solving high-dimensional parabolic equations is presented. The stability and the error estimates are derived for the proposed numerical scheme. Furthermore, two variants of fully-practical operator-splitting finite element algorithms based on the quadrature points and the nodal points, respectively, are presented. Both the quadrature and the nodal point based operator-splitting algorithms are validated using a three-dimensional (3D) test problem. The numerical results obtained with the full 3D computations and the operator-split 2D + 1D computations are found to be in a good agreement with the analytical solution. Further, the optimal order of convergence is obtained in both variants of the operator-splitting algorithms. (C) 2012 Elsevier Inc. All rights reserved.

Novel algorithms for distributed sequential hypothesis testing

This paper considers sequential hypothesis testing in a decentralized framework. We start with two simple decentralized sequential hypothesis testing algorithms. One of which is later proved to be asymptotically Bayes optimal. We also consider composite versions of decentralized sequential hypothesis testing. A novel nonparametric version for decentralized sequential hypothesis testing using universal source coding theory is developed. Finally we design a simple decentralized multihypothesis sequential detection algorithm.

Capacity region of K-user discrete memoryless interference channels with a mixed strong-very strong interference

The capacity region of the 3-user Gaussian Interference Channel (GIC) with mixed strong-very strong interference was established in [1]. The mixed strong-very strong interference conditions considered in [1] correspond to the case where, at each receiver, one of the interfering signals is strong and the other is very strong. In this paper, we derive the capacity region of K-user (K ≥ 3) Discrete Memoryless Interference Channels (DMICs) with a mixed strong-very strong interference. This corresponds to the case where, at each receiver one of the interfering signals is strong and the other (K - 2) interfering signals are very strong. This includes, as a special case, the 3-user DMIC with mixed strong-very strong interference. The proof is specialized to the 3-user GIC case and hence an alternative derivation for the capacity region of the 3-user GIC with mixed strong-very strong interference is provided.