Unprecedented formation of a 14-membered dihydropyran macrocycle via sequential olefin cross metathesis-intramolecular hetero Diels-Alder reaction

Formation of a 2,3-dihydro-4H-pyran containing 14-membered macrocycle by sequential olefin cross metathesis and a highly regiospecific hetero Diels-Alder reaction was observed in the reaction of a hydroxydienone derived from tartaric acid with Grubbs' second generation catalyst. It was found that the free alcohol in the hydroxyenone led to the macrocycle formation, while protection of the hydroxy group formed the ring closing metathesis product. (C) 2013 Elsevier Ltd. All rights reserved.

Identification of immuno-dominant antigens of Trypanosoma evansi for detection of chronic trypanosomosis using experimentally infected equines

Trypanosoma evansi is the most extensively distributed trypanosome responsible for disease called surra in livestock in many countries including frequent outbreaks in India. The prevalence of this disease is most commonly reported by standard parasitological detection methods (SPDM); however, antibody ELISA is being in practice by locally produced whole cell lysate (WCL) antigens in many countries. In the present investigation, we attempted to identify and purify immuno dominant, infection specific trypanosome antigens from T. evansi proteome using experimentally infected equine serum by immuno blot. Three immuno dominant clusters of proteins i.e. 62-66 kDa, 52-55 kDa and 41-43 kDa were identified based on their consistent reactivity with donkey sequential serum experimentally infected T. evansi up to 280 days post infection (dpi). The protein cluster of 62-66 kDa was purified in bulk in native form and comparatively evaluated with whole cell lysate antigen (WCL). ELISA and immuno blot showed that polypeptide of this cluster is 100% sensitive in detection of early and chronic infection. Further, this protein cluster was also found immuno reactive against hyper immune serum raised against predominantly 66 kDa exo antigen, revealed that this is a common immunodominant moieties in proteome and secretome of T. evansi.

Modified particle swarm optimization for pattern clustering

Data clustering is a common technique for statistical data analysis, which is used in many fields, including machine learning and data mining. Clustering is grouping of a data set or more precisely, the partitioning of a data set into subsets (clusters), so that the data in each subset (ideally) share some common trait according to some defined distance measure. In this paper we present the genetically improved version of particle swarm optimization algorithm which is a population based heuristic search technique derived from the analysis of the particle swarm intelligence and the concepts of genetic algorithms (GA). The algorithm combines the concepts of PSO such as velocity and position update rules together with the concepts of GA such as selection, crossover and mutation. The performance of the above proposed algorithm is evaluated using some benchmark datasets from Machine Learning Repository. The performance of our method is better than k-means and PSO algorithm.

Polyvinylidene fluoride film based nasal sensor to monitor human respiration pattern: An initial clinical study

Design and development of a piezoelectric polyvinylidene fluoride (PVDF) thin film based nasal sensor to monitor human respiration pattern (RP) from each nostril simultaneously is presented in this paper. Thin film based PVDF nasal sensor is designed in a cantilever beam configuration. Two cantilevers are mounted on a spectacle frame in such a way that the air flow from each nostril impinges on this sensor causing bending of the cantilever beams. Voltage signal produced due to air flow induced dynamic piezoelectric effect produce a respective RP. A group of 23 healthy awake human subjects are studied. The RP in terms of respiratory rate (RR) and Respiratory air-flow changes/alterations obtained from the developed PVDF nasal sensor are compared with RP obtained from respiratory inductance plethysmograph (RIP) device. The mean RR of the developed nasal sensor (19.65 +/- A 4.1) and the RIP (19.57 +/- A 4.1) are found to be almost same (difference not significant, p > 0.05) with the correlation coefficient 0.96, p < 0.0001. It was observed that any change/alterations in the pattern of RIP is followed by same amount of change/alterations in the pattern of PVDF nasal sensor with k = 0.815 indicating strong agreement between the PVDF nasal sensor and RIP respiratory air-flow pattern. The developed sensor is simple in design, non-invasive, patient friendly and hence shows promising routine clinical usage. The preliminary result shows that this new method can have various applications in respiratory monitoring and diagnosis.

A Phase Transition for the Uniform Distribution in the Pattern Maximum Likelihood Problem

In this paper, we consider the setting of the pattern maximum likelihood (PML) problem studied by Orlitsky et al. We present a well-motivated heuristic algorithm for deciding the question of when the PML distribution of a given pattern is uniform. The algorithm is based on the concept of a ``uniform threshold''. This is a threshold at which the uniform distribution exhibits an interesting phase transition in the PML problem, going from being a local maximum to being a local minimum.

Scalable sequential alternating proximal methods for sparse structural SVMs and CRFs

Structural Support Vector Machines (SSVMs) and Conditional Random Fields (CRFs) are popular discriminative methods used for classifying structured and complex objects like parse trees, image segments and part-of-speech tags. The datasets involved are very large dimensional, and the models designed using typical training algorithms for SSVMs and CRFs are non-sparse. This non-sparse nature of models results in slow inference. Thus, there is a need to devise new algorithms for sparse SSVM and CRF classifier design. Use of elastic net and L1-regularizer has already been explored for solving primal CRF and SSVM problems, respectively, to design sparse classifiers. In this work, we focus on dual elastic net regularized SSVM and CRF. By exploiting the weakly coupled structure of these convex programming problems, we propose a new sequential alternating proximal (SAP) algorithm to solve these dual problems. This algorithm works by sequentially visiting each training set example and solving a simple subproblem restricted to a small subset of variables associated with that example. Numerical experiments on various benchmark sequence labeling datasets demonstrate that the proposed algorithm scales well. Further, the classifiers designed are sparser than those designed by solving the respective primal problems and demonstrate comparable generalization performance. Thus, the proposed SAP algorithm is a useful alternative for sparse SSVM and CRF classifier design.

Diffusion pattern in MSi2 and M5Si3 silicides in group VB (M = V, Nb, Ta) and VIB (M = Mo, W) refractory metal-silicon systems

Group VB and VIB M-Si systems are considered to show an interesting pattern in the diffusion of components with the change in atomic number in a particular group (M = V, Nb, Ta or M = Mo, W, respectively). Mainly two phases, MSi2 and M5Si3 are considered for this discussion. Except for Ta-silicides, the activation energy for the integrated diffusion of MSi2 is always lower than M5Si3. In both phases, the relative mobilities measured by the ratio of the tracer diffusion coefficients, , decrease with an increasing atomic number in the given group. If determined at the same homologous temperature, the interdiffusion coefficients increase with the atomic number of the refractory metal in the MSi2 phases and decrease in the M5Si3 ones. This behaviour features the basic changes in the defect concentrations on different sublattices with a change in the atomic number of the refractory components.

Transition in vortex breakdown modes in a coaxial isothermal unconfined swirling jet

This paper reports first observations of transition in recirculation pattern from an open-bubble type axisymmetric vortex breakdown to partially open bubble mode through an intermediate, critical regime of conical sheet formation in an unconfined, co-axial isothermal swirling flow. This time-mean transition is studied for two distinct flow modes which are characterized based on the modified Rossby number (Ro(m)), i.e., Ro(m) <= 1 and Ro(m) > 1. Flow modes with Ro(m) <= 1 are observed to first undergo cone-type breakdown and then to partially open bubble state as the geometric swirl number (S-G) is increased by similar to 20% and similar to 40%, respectively, from the baseline open-bubble state. However, the flow modes with Ro(m) > 1 fail to undergo such sequential transition. This distinct behavior is explained based on the physical significance associated with Ro(m) and the swirl momentum factor (xi). In essence, xi represents the ratio of angular momentum distributed across the flow structure to that distributed from central axis to the edge of the vortex core. It is observed that xi increases by similar to 100% in the critical swirl number band where conical breakdown occurs as compared to its magnitude in the S-G regime where open bubble state is seen. This results from the fact that flow modes with Ro(m) <= 1 are dominated by radial pressure gradient due to swirl/rotational effect when compared to radial pressure deficit arising from entrainment (due to the presence of co-stream). Consequently, the imparted swirl tends to penetrate easily towards the central axis causing it to spread laterally and finally undergo conical sheet breakdown. However, the flow modes with Ro(m) > 1 are dominated by pressure deficit due to entrainment effect. This blocks the radial inward penetration of imparted angular momentum thus preventing the lateral spread of these flow modes. As such these structures fail to undergo cone mode of vortex breakdown which is substantiated by a mere 30%-40% rise in xi in the critical swirl number range. (C) 2014 AIP Publishing LLC.

Optimal sequential wireless relay placement on a random lattice path

Our work is motivated by impromptu (or ``as-you-go'') deployment of wireless relay nodes along a path, a need that arises in many situations. In this paper, the path is modeled as starting at the origin (where there is the data sink, e.g., the control center), and evolving randomly over a lattice in the positive quadrant. A person walks along the path deploying relay nodes as he goes. At each step, the path can, randomly, either continue in the same direction or take a turn, or come to an end, at which point a data source (e.g., a sensor) has to be placed, that will send packets to the data sink. A decision has to be made at each step whether or not to place a wireless relay node. Assuming that the packet generation rate by the source is very low, and simple link-by-link scheduling, we consider the problem of sequential relay placement so as to minimize the expectation of an end-to-end cost metric (a linear combination of the sum of convex hop costs and the number of relays placed). This impromptu relay placement problem is formulated as a total cost Markov decision process. First, we derive the optimal policy in terms of an optimal placement set and show that this set is characterized by a boundary (with respect to the position of the last placed relay) beyond which it is optimal to place the next relay. Next, based on a simpler one-step-look-ahead characterization of the optimal policy, we propose an algorithm which is proved to converge to the optimal placement set in a finite number of steps and which is faster than value iteration. We show by simulations that the distance threshold based heuristic, usually assumed in the literature, is close to the optimal, provided that the threshold distance is carefully chosen. (C) 2014 Elsevier B.V. All rights reserved.

Spectrum sensing using distributed sequential detection via noisy reporting MAC

This paper considers cooperative spectrum sensing algorithms for Cognitive Radios which focus on reducing the number of samples to make a reliable detection. We propose algorithms based on decentralized sequential hypothesis testing in which the Cognitive Radios sequentially collect the observations, make local decisions and send them to the fusion center for further processing to make a final decision on spectrum usage. The reporting channel between the Cognitive Radios and the fusion center is assumed more realistically as a Multiple Access Channel (MAC) with receiver noise. Furthermore the communication for reporting is limited, thereby reducing the communication cost. We start with an algorithm where the fusion center uses an SPRT-like (Sequential Probability Ratio Test) procedure and theoretically analyze its performance. Asymptotically, its performance is close to the optimal centralized test without fusion center noise. We further modify this algorithm to improve its performance at practical operating points. Later we generalize these algorithms to handle uncertainties in SNR and fading. (C) 2014 Elsevier B.V. All rights reserved.

Use of Exocentric and Egocentric Representations in the Concurrent Planning of Sequential Saccades

The concurrent planning of sequential saccades offers a simple model to study the nature of visuomotor transformations since the second saccade vector needs to be remapped to foveate the second target following the first saccade. Remapping is thought to occur through egocentric mechanisms involving an efference copy of the first saccade that is available around the time of its onset. In contrast, an exocentric representation of the second target relative to the first target, if available, can be used to directly code the second saccade vector. While human volunteers performed a modified double-step task, we examined the role of exocentric encoding in concurrent saccade planning by shifting the first target location well before the efference copy could be used by the oculomotor system. The impact of the first target shift on concurrent processing was tested by examining the end-points of second saccades following a shift of the second target during the first saccade. The frequency of second saccades to the old versus new location of the second target, as well as the propagation of first saccade localization errors, both indices of concurrent processing, were found to be significantly reduced in trials with the first target shift compared to those without it. A similar decrease in concurrent processing was obtained when we shifted the first target but kept constant the second saccade vector. Overall, these results suggest that the brain can use relatively stable visual landmarks, independent of efference copy-based egocentric mechanisms, for concurrent planning of sequential saccades.

Efficient generation of diffraction-limited multi-sheet pattern for biological imaging

We demonstrate a new technique to generate multiple light-sheets for fluorescence microscopy. This is possible by illuminating the cylindrical lens using multiple copies of Gaussian beams. A diffraction grating placed just before the cylindrical lens splits the incident Gaussian beam into multiple beams traveling at different angles. Subsequently, this gives rise to diffraction-limited light-sheets after the Gaussian beams pass through the combined cylindrical lens-objective sub-system. Direct measurement of field at and around the focus of objective lens shows multi-sheet pattern with an average thickness of 7.5 mu m and inter-sheet separation of 380 mu m. Employing an independent orthogonal detection sub-system, we successfully imaged fluorescently-coated yeast cells (approximate to 4 mu m) encaged in agarose gel-matrix. Such a diffraction-limited sheet-pattern equipped with dedicated detection system may find immediate applications in the field of optical microscopy and fluorescence imaging. (C) 2015 Optical Society of America

A New Algorithm for Nonparametric Sequential Detection

We consider nonparametric sequential hypothesis testing problem when the distribution under the null hypothesis is fully known but the alternate hypothesis corresponds to a general family of distributions. We propose a simple algorithm to address the problem. Its performance is analysed and asymptotic properties are proved. The simulated and analysed performance of the algorithm is compared with an earlier algorithm addressing the same problem with similar assumptions. Finally, we provide a justification for our model motivated by a Cognitive Radio scenario and modify the algorithm for optimizing performance when information about the prior probabilities of occurrence of the two hypotheses is available.

Digital image analysis around isotropic points for photoelastic pattern recognition

Fringe tracking and fringe order assignment have become the central topics of current research in digital photoelasticity. Isotropic points (IPs) appearing in low fringe order zones are often either overlooked or entirely missed in conventional as well as digital photoelasticity. We aim to highlight image processing for characterizing IPs in an isochromatic fringe field. By resorting to a global analytical solution of a circular disk, sensitivity of IPs to small changes in far-field loading on the disk is highlighted. A local theory supplements the global closed-form solutions of three-, four-, and six-point loading configurations of circular disk. The local theoretical concepts developed in this paper are demonstrated through digital image analysis of isochromatics in circular disks subjected to three-and four-point loads. (C) 2015 Society of Photo-Optical Instrumentation Engineers (SPIE)