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.

Path-integral formulation for Levy flights: Evaluation of the propagator for free, linear, and harmonic potentials in the over- and underdamped limits

Levy flights can be described using a Fokker-Planck equation, which involves a fractional derivative operator in the position coordinate. Such an operator has its natural expression in the Fourier domain. Starting with this, we show that the solution of the equation can be written as a Hamiltonian path integral. Though this has been realized in the literature, the method has not found applications as the path integral appears difficult to evaluate. We show that a method in which one integrates over the position coordinates first, after which integration is performed over the momentum coordinates, can be used to evaluate several path integrals that are of interest. Using this, we evaluate the propagators for (a) free particle, (b) particle subjected to a linear potential, and (c) harmonic potential. In all the three cases, we have obtained results for both overdamped and underdamped cases. DOI: 10.1103/PhysRevE.86.061105

A Single-Stage Water-Gas Shift Reaction over Highly Active and Stable Si- and Al-Substituted Pt/CeO2 Catalysts

Ce0.88Si0.1Pt0.02O2-d and Ce0.88Al0.1Pt0.02O2-d catalysts were synthesized by using a low-temperature sonochemical method and characterized by using XRD, TEM, XPS, FTIR, and BET surface analyzer. The catalytic activities of these compounds were investigated for the watergas shift reaction in the temperature range of 140-440 degrees C. The substitution of Si in Ce0.98Pt0.02O2-d increased the releasing capacity of lattice oxygen, whereas the substitution of Al decreased the reducibility of Ce0.98Pt0.02O2-d, as evidenced by hydrogen temperature-programmed reduction studies. However, both the catalysts showed a considerable improvement in terms of activity and stability compared to Ce0.98Pt0.02O2-d. The combined activity measurement and characterization results suggest that the increase in the oxygen vacancy, which acts as a dissociation center for water, is the primary reason for the improvement in the activity of modified Ce0.98Pt0.02O2-d. Both the catalysts are 100?% selective toward H2 production, and approximately 99?% conversion of CO to CO2 was observed at 260 and 270 degrees C for Ce0.88Si0.1Pt0.02O2-d and Ce0.88Al0.1Pt0.02O2-d, respectively. These catalysts do not deactivate during the daily startup/shutdown operations and are sustainable even after prolonged reaction. Notably, these catalysts do not require any pretreatment or activation during startup/shutdown operations.

Feedback Overhead-Aware, Distributed, Fast, and Reliable Selection

In a communication system in which K nodes communicate with a central sink node, the following problem of selection often occurs. Each node maintains a preference number called a metric, which is not known to other nodes. The sink node must find the `best' node with the largest metric. The local nature of the metrics requires the selection process to be distributed. Further, the selection needs to be fast in order to increase the fraction of time available for data transmission using the selected node and to handle time-varying environments. While several selection schemes have been proposed in the literature, each has its own shortcomings. We propose a novel, distributed selection scheme that generalizes the best features of the timer scheme, which requires minimal feedback but does not guarantee successful selection, and the splitting scheme, which requires more feedback but guarantees successful selection. The proposed scheme introduces several new ideas into the design of the timer and splitting schemes. It explicitly accounts for feedback overheads and guarantees selection of the best node. We analyze and optimize the performance of the scheme and show that it is scalable, reliable, and fast. We also present new insights about the optimal timer scheme.

All flavours of El Nino have similar early subsurface origins

The El Nino/Southern Oscillation phenomenon, characterized by anomalous sea surface temperatures and winds in the tropical Pacific, affects climate across the globe(1). El Ninos occur every 2-7 years, whereas the El Nino/Southern Oscillation itself varies on decadal timescales in frequency and amplitude, with a different spatial pattern of surface anomalies(2) each time the tropical Pacific undergoes a regime shift. Recent work has shown that Bjerknes feedback(3,4) (coupling of the atmosphere and the ocean through changes in equatorial winds driven by changes in sea surface temperature owing to suppression of equatorial upwelling in the east Pacific) is not necessary(5) for the development of an El Nino. Thus it is unclear what remains constant through regimes and is crucial for producing the anomalies recognized as El Nino. Here we show that the subsurface process of discharging warm waters always begins in the boreal summer/autumn of the year before the event (up to 18 months before the peak) independent of regimes, identifying the discharge process as fundamental to the El Nino onset. It is therefore imperative that models capture this process accurately to further our theoretical understanding, improve forecasts and predict how the El Nino/Southern Oscillation may respond to climate change.

Flowfield Analysis of Linear Plug Nozzle

Full-length and truncated linear plug nozzle flowfields have been analyzed, using both experimental and computational tools, for pressure ratios ranging from 5 to 72, which include the transition of an open base wake to a closed base wake. A good agreement has been found between computational and experimental results on the plug surface. Considering the deficiencies of the computational tools in predicting base flows associated with truncated plug nozzles, an engineering model to predict the wake structure transition in such flows is proposed. The utility of this model in conjunction with empirical tools for the closed-wake base pressure prediction is established. The model is validated against the experimental results available in open literature.

Optimal Linear Codes with a Local-Error-Correction Property

Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check equation associated with small Hamming weight, thereby enabling recovery of the message symbol by examining a small number of other code symbols. This notion is expanded to the case when all code symbols, not just the message symbols, are covered by such ``local'' parity. In this paper, we extend the results of Gopalan et. al. so as to permit recovery of an erased code symbol even in the presence of errors in local parity symbols. We present tight bounds on the minimum distance of such codes and exhibit codes that are optimal with respect to the local error-correction property. As a corollary, we obtain an upper bound on the minimum distance of a concatenated code.

Spatial Modulation and Space Shift Keying in Single Carrier Communication

Spatial modulation (SM) and space shift keying (SSK) are relatively new modulation techniques which are attractive in multi-antenna communications. Single carrier (SC) systems can avoid the peak-to-average power ratio (PAPR) problem encountered in multicarrier systems. In this paper, we study SM and SSK signaling in cyclic-prefixed SC (CPSC) systems on MIMO-ISI channels. We present a diversity analysis of MIMO-CPSC systems under SSK and SM signaling. Our analysis shows that the diversity order achieved by (n(t), n(r)) SSK scheme and (n(t), n(r), Theta(M)) SM scheme in MIMO-CPSC systems under maximum-likelihood (ML) detection is n(r), where n(t), n(r) denote the number of transmit and receive antennas and Theta(M) denotes the modulation alphabet of size M. Bit error rate (BER) simulation results validate this predicted diversity order. Simulation results also show that MIMO-CPSC with SM and SSK achieves much better performance than MIMO-OFDM with SM and SSK.

Low temperature CO oxidation and water gas shift reaction over Pt/Pd substituted in Fe/TiO2 catalysts

We demonstrate the activity of Ti0.84Pt0.01Fe0.15O2-delta and Ti0.73Pd0.02Fe0.25O2-delta catalysts towards the CO oxidation and water gas shift (VMS) reaction. Both the catalysts were synthesized in the nano crystalline form by a low temperature sonochemical method and characterized by different techniques such as XRD, FT-Raman, TEM, FT-IR, XPS and BET surface analyzer. H-2-TPR results corroborate the intimate contact between noble metal and Fe ions in the both catalysts that facilitates the reducibility of the support. In the absence of feed CO2 and H-2, nearly 100% conversion of CO to CO2 with 100% H-2 selectivity was observed at 300 degrees C and 260 degrees C respectively, for Ti0.84Pt0.01Fe0.15O2-delta and Ti0.73Pd0.02Fe0.25O2-delta catalyst. However, the catalytic performance of Ti0.73Pd0.02Fe0.25O2-delta deteriorates in the presence of feed CO2 and H-2. The change in the support reducibility is the primary reason for the significant increase in the activity for CO oxidation and WGS reaction. The effect of Fe addition was more significant in Ti0.73Pd0.02Fe0.25O2-delta than Ti0.84Pt0.01Fe0.15O2-delta. Based on the spectroscopic evidences and surface phenomena, a hybrid reaction scheme utilizing both surface hydroxyl groups and the lattice oxygen was hypothesized over these catalysts for WGS reaction. The mechanisms based on the formate and redox pathway were used to fit the ldnetic data. The analysis of experimental data shows the redox mechanism is the dominant pathway over these catalysts. Copyright (C) 2012, Hydrogen Energy Publications, LLC. Published by Elsevier Ltd. All rights reserved.

Feedback overhead-aware fast distributed selection scheme for multi-node wireless systems

Opportunistic selection is a practically appealing technique that is used in multi-node wireless systems to maximize throughput, implement proportional fairness, etc. However, selection is challenging since the information about a node's channel gains is often available only locally at each node and not centrally. We propose a novel multiple access-based distributed selection scheme that generalizes the best features of the timer scheme, which requires minimal feedback but does not always guarantee successful selection, and the fast splitting scheme, which requires more feedback but guarantees successful selection. The proposed scheme's design explicitly accounts for feedback time overheads unlike the conventional splitting scheme and guarantees selection of the user with the highest metric unlike the timer scheme. We analyze and minimize the average time including feedback required by the scheme to select. With feedback overheads, the proposed scheme is scalable and considerably faster than several schemes proposed in the literature. Furthermore, the gains increase as the feedback overhead increases.

Field extension code based dispersion matrices for coherently detected space-time shift keying

Motivated by the recent Coherent Space-Time Shift Keying (CSTSK) philosophy, we construct new dispersion matrices for rotationally invariant PSK signaling sets. Given a specific PSK signal constellation, the dispersion matrices of the existing CSTSK scheme were chosen by maximizing the mutual information over randomly generated sets of dispersion matrices. In this contribution we propose a general method for constructing a set of structured dispersion matrices for arbitrary PSK signaling sets using Field Extension (FE) codes and then study the attainable Symbol Error Rate (SER) performance of some example constructions. We demonstrate that the proposed dispersion scheme is capable of outperforming the existing dispersion arrangement at medium to high SNRs.

A nested linear codes approach to distributed function computation over subspaces

In this paper, we consider a distributed function computation setting, where there are m distributed but correlated sources X1,...,Xm and a receiver interested in computing an s-dimensional subspace generated by [X1,...,Xm]Γ for some (m × s) matrix Γ of rank s. We construct a scheme based on nested linear codes and characterize the achievable rates obtained using the scheme. The proposed nested-linear-code approach performs at least as well as the Slepian-Wolf scheme in terms of sum-rate performance for all subspaces and source distributions. In addition, for a large class of distributions and subspaces, the scheme improves upon the Slepian-Wolf approach. The nested-linear-code scheme may be viewed as uniting under a common framework, both the Korner-Marton approach of using a common linear encoder as well as the Slepian-Wolf approach of employing different encoders at each source. Along the way, we prove an interesting and fundamental structural result on the nature of subspaces of an m-dimensional vector space V with respect to a normalized measure of entropy. Here, each element in V corresponds to a distinct linear combination of a set {Xi}im=1 of m random variables whose joint probability distribution function is given.

Information dissemination in socially aware networks under the linear threshold model

We provide new analytical results concerning the spread of information or influence under the linear threshold social network model introduced by Kempe et al. in, in the information dissemination context. The seeder starts by providing the message to a set of initial nodes and is interested in maximizing the number of nodes that will receive the message ultimately. A node's decision to forward the message depends on the set of nodes from which it has received the message. Under the linear threshold model, the decision to forward the information depends on the comparison of the total influence of the nodes from which a node has received the packet with its own threshold of influence. We derive analytical expressions for the expected number of nodes that receive the message ultimately, as a function of the initial set of nodes, for a generic network. We show that the problem can be recast in the framework of Markov chains. We then use the analytical expression to gain insights into information dissemination in some simple network topologies such as the star, ring, mesh and on acyclic graphs. We also derive the optimal initial set in the above networks, and also hint at general heuristics for picking a good initial set.

Linear programming approach for state estimation incorporating phasor measurements

This paper presents methodologies for incorporating phasor measurements into conventional state estimator. The angle measurements obtained from Phasor Measurement Units are handled as angle difference measurements rather than incorporating the angle measurements directly. Handling in such a manner overcomes the problems arising due to the choice of reference bus. Current measurements obtained from Phasor Measurement Units are treated as equivalent pseudo-voltage measurements at the neighboring buses. Two solution approaches namely normal equations approach and linear programming approach are presented to show how the Phasor Measurement Unit measurements can be handled. Comparative evaluation of both the approaches is also presented. Test results on IEEE 14 bus system are presented to validate both the approaches.

Quadrature approximation properties of the spiral-phase quadrature transform

The notion of the 1-D analytic signal is well understood and has found many applications. At the heart of the analytic signal concept is the Hilbert transform. The problem in extending the concept of analytic signal to higher dimensions is that there is no unique multidimensional definition of the Hilbert transform. Also, the notion of analyticity is not so well under stood in higher dimensions. Of the several 2-D extensions of the Hilbert transform, the spiral-phase quadrature transform or the Riesz transform seems to be the natural extension and has attracted a lot of attention mainly due to its isotropic properties. From the Riesz transform, Larkin et al. constructed a vortex operator, which approximates the quadratures based on asymptotic stationary-phase analysis. In this paper, we show an alternative proof for the quadrature approximation property by invoking the quasi-eigenfunction property of linear, shift-invariant systems. We show that the vortex operator comes up as a natural consequence of applying this property. We also characterize the quadrature approximation error in terms of its energy as well as the peak spatial-domain error. Such results are available for 1-D signals, but their counter part for 2-D signals have not been provided. We also provide simulation results to supplement the analytical calculations.