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

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.

Self-Adapting Peripherally Heterofunctionalized Hyperbranched Polymers: Formation of Janus and Tripodal Structures

A peripherally clickable hyperbranched polyester carrying numerous propargyl terminal groups was prepared by a simple melt transesterification polycondensation of a suitably designed AB(2) monomer; this clickable hyperscaffold was then transformed into a variety of different derivatives by using the Cu-catalyzed azide-yne click reaction. Functionalization of the periphery with equimolar quantities of mutually immiscible segments, such as hydrocarbon, fluorocarbon, and PEG, yielded frustrated molecular systems that readapt and form structures wherein the immiscible segments appear to self-segregate to generate either Janus structures (when two immiscible segments are present) or tripodal structures (when three immiscible segments are present). Evidence for such self-segregation was obtained from a variety of studies, such as differential scanning calorimetry, Langmuir isotherms, AFM imaging, and small-angle X-ray scattering measurements. Crystallization of one or more of the peripheral segments reinforced this self-segregation; the weight-fraction-normalized enthalpies of melting associated with the different domains revealed a competition between the segments to optimize their crystalline organization. When one or more of the segments are amorphous, the remaining segments crystallize more effectively and consequently exhibit a higher melting enthalpy. AFM images of monolayers, transferred from the Langmuir trough, revealed that the thickness matches the expected values; furthermore, contact angle measurements clearly demonstrated that the monolayer films are fairly hydrophobic, and in the case of the tripodal hybramers, the presence of domains of hydrocarbon and fluorocarbon appears to impart nanoscale chemical heterogeneity that is reflected in the strong hysteresis in the advancing and receding contact angles.

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.

Electron rich supramolecular polymers as fluorescent sensors for nitroaromatics

Three pi-electron rich fluorescent supramolecular polymers (1-3) have been synthesized incorporating 2-methyl-3-butyn-2-ol groups in reasonable yield by employing Sonagashira coupling. They were characterized by multinuclear NMR (H-1, C-13), ESI-MS and single crystal X-ray diffraction analyses 1 = 1( 2-methyl-3-butyn-2-ol) pyrene; 2 = 9,10-bis(2-methyl-3-butyn-2-ol) anthracene; 3 = 1,3,6,8-tetrakis(2methyl- 3-butyn-2-ol) pyrene]. Single crystal structures of 1-3 indicated that the incorporation of hydroxy (-OH) groups on the peripheral of the fluorophores helps them to self-associate into an infinite supramolecular polymeric network via intermolecular hydrogen bonding interactions between the adjacent discrete fluorophore units. All these compounds showed fluorescence characteristics in chloroform solution due to the extended pi-conjugation and were used as selective fluorescent sensors for the detection of electron deficient nitroaromatics. The changes in photophysical properties of fluorophores (1-3) upon complex formation with electron deficient nitroaromatic explosives were studied in chloroform solution by using fluorescence spectroscopy. All these fluorophores showed the largest quenching response with moderate selectivity for nitroaromatics over various other electron deficient/ rich aromatic compounds tested (Chart 1). Analysis of the fluorescence titration profile of 9,10-bis(2-methyl-3butyn- 2-ol) anthracene fluorophore (2) with 1,3,5-trinitrotoluene/ 2,4-dinitrotoluene provided evidence that this particular fluorophore detects nitroaromatics in the nanomolar range 2.0 ppb for TNT, 13.7 ppb for DNT]. Moreover, sharp visual color change was observed upon mixing nitroaromatic (DNT) with fluorophores (1-3) both in solution as well as in solid phase. Furthermore, the vapor-phase sensing study of thin film of fluorophores (1-3) showed efficient quenching responses for DNT and this sensing process is reproducible. Selective fluorescence quenching response including a sharp visual color change for nitroaromatics make these tested fluorophores (1-3) as potential sensors for nitroaromatic compounds with a detection limit of ppb level.

Linear Coding Schemes for the Distributed Computation of Subspaces

Let X-1,..., X-m be a set of m statistically dependent sources over the common alphabet F-q, that are linearly independent when considered as functions over the sample space. We consider a distributed function computation setting in which the receiver is interested in the lossless computation of the elements of an s-dimensional subspace W spanned by the elements of the row vector X-1,..., X-m]Gamma in which the (m x s) matrix Gamma has rank s. A sequence of three increasingly refined approaches is presented, all based on linear encoders. The first approach uses a common matrix to encode all the sources and a Korner-Marton like receiver to directly compute W. The second improves upon the first by showing that it is often more efficient to compute a carefully chosen superspace U of W. The superspace is identified by showing that the joint distribution of the {X-i} induces a unique decomposition of the set of all linear combinations of the {X-i}, into a chain of subspaces identified by a normalized measure of entropy. This subspace chain also suggests a third approach, one that employs nested codes. For any joint distribution of the {X-i} and any W, the sum-rate of the nested code approach is no larger than that under the Slepian-Wolf (SW) approach. Under the SW approach, W is computed by first recovering each of the {X-i}. For a large class of joint distributions and subspaces W, the nested code approach is shown to improve upon SW. Additionally, a class of source distributions and subspaces are identified, for which the nested-code approach is sum-rate optimal.

A regularized linear classifier for effective text classification

In document community support vector machines and naïve bayes classifier are known for their simplistic yet excellent performance. Normally the feature subsets used by these two approaches complement each other, however a little has been done to combine them. The essence of this paper is a linear classifier, very similar to these two. We propose a novel way of combining these two approaches, which synthesizes best of them into a hybrid model. We evaluate the proposed approach using 20ng dataset, and compare it with its counterparts. The efficacy of our results strongly corroborate the effectiveness of our approach.

Interfacial growth as a model of tube-width heterogeneities in concentrated solutions of stiff polymers

Recent experimental measurements of the distribution P(w) of transverse chain fluctuations w in concentrated solutions of F-actin filaments B. Wang, J Guan, S. M. Anthony, S. C. Bae, K. S. Schweizer, and S. Granick, Phys. Rev. Lett. 104, 118301 (2010); J. Glaser, D. Chakraborty, K. Kroy, I. Lauter, M. Degawa, N. Kirchgessner, B. Hoffmann, R. Merkel, and M. Giesen, Phys. Rev. Lett. 105, 037801 (2010)] are shown to be well-fit to an expression derived from a model of the conformations of a single harmonically confined weakly bendable rod. The calculation of P(w) is carried out essentially exactly within a path integral approach that was originally applied to the study of one-dimensional randomly growing interfaces. Our results are generally as successful in reproducing experimental trends as earlier approximate results obtained from more elaborate many-chain treatments of the confining tube potential.

State estimation in power systems using linear model infinity norm-based trust region approach

State estimation is one of the most important functions in an energy control centre. An computationally efficient state estimator which is free from numerical instability/ill-conditioning is essential for security assessment of electric power grid. Whereas approaches to successfully overcome the numerical ill-conditioning issues have been proposed, an efficient algorithm for addressing the convergence issues in the presence of topological errors is yet to be evolved. Trust region (TR) methods have been successfully employed to overcome the divergence problem to certain extent. In this study, case studies are presented where the conventional algorithms including the existing TR methods would fail to converge. A linearised model-based TR method for successfully overcoming the convergence issues is proposed. On the computational front, unlike the existing TR methods for state estimation which employ quadratic models, the proposed linear model-based estimator is computationally efficient because the model minimiser can be computed in a single step. The model minimiser at each step is computed by minimising the linearised model in the presence of TR and measurement mismatch constraints. The infinity norm is used to define the geometry of the TR. Measurement mismatch constraints are employed to improve the accuracy. The proposed algorithm is compared with the quadratic model-based TR algorithm with case studies on the IEEE 30-bus system, 205-bus and 514-bus equivalent systems of part of Indian grid.

Application of the random eigenvalue problem in forced response analysis of a linear stochastic structure

The random eigenvalue problem arises in frequency and mode shape determination for a linear system with uncertainties in structural properties. Among several methods of characterizing this random eigenvalue problem, one computationally fast method that gives good accuracy is a weak formulation using polynomial chaos expansion (PCE). In this method, the eigenvalues and eigenvectors are expanded in PCE, and the residual is minimized by a Galerkin projection. The goals of the current work are (i) to implement this PCE-characterized random eigenvalue problem in the dynamic response calculation under random loading and (ii) to explore the computational advantages and challenges. In the proposed method, the response quantities are also expressed in PCE followed by a Galerkin projection. A numerical comparison with a perturbation method and the Monte Carlo simulation shows that when the loading has a random amplitude but deterministic frequency content, the proposed method gives more accurate results than a first-order perturbation method and a comparable accuracy as the Monte Carlo simulation in a lower computational time. However, as the frequency content of the loading becomes random, or for general random process loadings, the method loses its accuracy and computational efficiency. Issues in implementation, limitations, and further challenges are also addressed.

Linear and nonlinear optical properties of expanded porphyrins: a DMRG study

We study absorption spectra and two photon absorption coefficient of expanded porphyrins (EPs) by the density matrix renormalization group (DMRG) technique. We employ the Pariser-Parr-Pople (PPP) Hamiltonian which includes long-range electron-electron interactions. We find that, in the 4n+2 EPs, there are two prominent low-lying one-photon excitations, while in 4n EPs, there is only one such excitation. We also find that 4n+2 EPs have large two-photon absorption cross sections compared to 4n EPs. The charge density rearrangement in the one-photon excited state is mostly at the pyrrole nitrogen site and at the meso carbon sites. In the two-photon states, the charge density rearrangement occurs mostly at the aza-ring sites. In the one-photon state, the C-C bond length in aza rings shows a tendency to become uniform. In the two-photon state, the bond distortions are on C-N bonds of the pyrrole ring and the adjoining C-C bonds which connect the pyrrole ring to the aza or meso carbon sites.