Maximum Margin Classifiers with Specified False Positive and False Negative Error Rates

This paper addresses the problem of maximum margin classification given the moments of class conditional densities and the false positive and false negative error rates. Using Chebyshev inequalities, the problem can be posed as a second order cone programming problem. The dual of the formulation leads to a geometric optimization problem, that of computing the distance between two ellipsoids, which is solved by an iterative algorithm. The formulation is extended to non-linear classifiers using kernel methods. The resultant classifiers are applied to the case of classification of unbalanced datasets with asymmetric costs for misclassification. Experimental results on benchmark datasets show the efficacy of the proposed method.

An O(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V,E). The expected running time of our algorithm is Õ(mc) where |E| = m and c is the maximum u-vedge connectivity, where u,v ∈ V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n-1; so the expected running time of our algorithm for simple unweighted graphs is Õ(mn).All the algorithms currently known for constructing a Gomory-Hu tree [8,9] use n-1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest Õ(n20/9) max flow algorithm due to Karger and Levine [11] yields the current best running time of Õ(n20/9n) for Gomory-Hu tree construction on simpleunweighted graphs with m edges and n vertices. Thus we present the first Õ(mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs.We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S ⊆ V can be reused for computing a minimum Steiner cut for certain Steiner sets S' ⊆ S.

Boxicity of Circular Arc Graphs

A k-dimensional box is a Cartesian product R(1)x...xR(k) where each R(i) is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. That is, two vertices are adjacent if and only if their corresponding boxes intersect. A circular arc graph is a graph that can be represented as the intersection graph of arcs on a circle. We show that if G is a circular arc graph which admits a circular arc representation in which no arc has length at least pi(alpha-1/alpha) for some alpha is an element of N(>= 2), then box(G) <= alpha (Here the arcs are considered with respect to a unit circle). From this result we show that if G has maximum degree Delta < [n(alpha-1)/2 alpha] for some alpha is an element of N(>= 2), then box(G) <= alpha. We also demonstrate a graph having box(G) > alpha but with Delta = n (alpha-1)/2 alpha + n/2 alpha(alpha+1) + (alpha+2). For a proper circular arc graph G, we show that if Delta < [n(alpha-1)/alpha] for some alpha is an element of N(>= 2), then box(G) <= alpha. Let r be the cardinality of the minimum overlap set, i.e. the minimum number of arcs passing through any point on the circle, with respect to some circular arc representation of G. We show that for any circular arc graph G, box(G) <= r + 1 and this bound is tight. We show that if G admits a circular arc representation in which no family of k <= 3 arcs covers the circle, then box(G) <= 3 and if G admits a circular arc representation in which no family of k <= 4 arcs covers the circle, then box(G) <= 2. We also show that both these bounds are tight.

Single Particle and Packed Bed Combustion in Modern Gasifier Stoves—Density Effects

This article is concerned with a study of an unusual effect due to density of biomass pellets in modern stoves based on close-coupled gasification-combustion process. The two processes, namely, flaming with volatiles and glowing of the char show different effects. The mass flux of the fuel bears a constant ratio with the air flow rate of gasification during the flaming process and is independent of particle density; char glowing process shows a distinct effect of density. The bed temperatures also have similar features: during flaming, they are identical, but distinct in the char burn (gasification) regime. For the cases, wood char and pellet char, the densities are 350, 990 kg/m(3), and the burn rates are 2.5 and 3.5 g/min with the bed temperatures being 1380 and 1502 K, respectively. A number of experiments on practical stoves showed wood char combustion rates of 2.5 +/- 0.5 g/min and pellet char burn rates of 3.5 +/- 0.5 g/min. In pursuit of the resolution of the differences, experimental data on single particle combustion for forced convection and ambient temperatures effects have been obtained. Single particle char combustion rate with air show a near-d(2) law and surface and core temperatures are identical for both wood and pellet char. A model based on diffusion controlled heat release-radiation-convection balance is set up. Explanation of the observed results needs to include the ash build-up over the char. This model is then used to explain observed behavior in the packed bed; the different packing densities of the biomass chars leading to different heat release rates per unit bed volume are deduced as the cause of the differences in burn rate and bed temperatures.

Bacterial transformation using micro-shock waves

Shock waves are one of the most competent mechanisms of energy dissipation observed in nature. We have developed a novel device to generate controlled micro-shock waves using an explosive-coated polymer tube. In this study, we harnessed these controlled micro-shock waves to develop a unique bacterial transformation method. The conditions were optimized for the maximum transformation efficiency in Escherichia coli. The maximum transformation efficiency was obtained when we used a 30 cm length polymer tube, 100 mu m thick metal foil, 200 mM CaCl(2), 1 ng/mu l plasmid DNA concentration, and 1 x 10(9) cell density. The highest transformation efficiency achieved (1 x 10(-5) transformants/cell) was at least 10 times greater than the previously reported ultrasound-mediated transformation (1 x 10(-6) transformants/cell). This method was also successfully employed for the efficient and reproducible transformation of Pseudomonas aeruginosa and Salmonella typhimurium. This novel method of transformation was shown to be as efficient as electroporation with the added advantage of better recovery of cells, reduced cost (40 times cheaper than a commercial electroporator), and growth phase independent transformation. (C) 2011 Elsevier Inc. All rights reserved.

Heterologous expression of P5CS gene in chickpea enhances salt tolerance without affecting yield

Vigna Delta(1)-pyrroline-5-carboxylate synthetase (P5CS) cDNA was transferred to chickpea (Cicer arietinum L.) cultivar Annigeri via Agrobacterium tumefaciens mediated transformation. Following selection on hygromycin and regeneration, 60 hygromycin-resistant plants were recovered. Southern blot analysis of five fertile independent lines of T0 and T1 generation revealed single and multiple insertions of the transgene. RT-PCR and Western blot analysis of T0 and T1 progeny demonstrated that the P5CS gene is expressed and produced functional protein in chickpea. T1 transgenic lines accumulated higher amount of proline under 250 mM NaCl compared to untransformed controls. Higher accumulation of Na(+) was noticed in the older leaves but negligible accumulation in seeds of T1 transgenic lines as compared to the controls. Chlorophyll stability and electrolyte leakage indicated that proline overproduction helps in alleviating salt stress in transgenic chickpea plants. The T1 transgenics lines were grown to maturity and set normal viable seeds under continuous salinity stress (250 mM) without any reduction in plant yield in terms of seed mass.

Predictive distribution modeling for rare Himalayan medicinal plant Berberis aristata DC

Predictive distribution modelling of Berberis aristata DC, a rare threatened plant with high medicinal values has been done with an aim to understand its potential distribution zones in Indian Himalayan region. Bioclimatic and topographic variables were used to develop the distribution model with the help of three different algorithms viz. GeneticAlgorithm for Rule-set Production (GARP), Bioclim and Maximum entroys(MaxEnt). Maximum entropy has predicted wider potential distribution (10.36%) compared to GARP (4.63%) and Bioclim (2.44%). Validation confirms that these outputs are comparable to the present distribution pattern of the B. atistata. This exercise highlights that this species favours Western Himalaya. However, GARP and MaxEnt's prediction of Eastern Himalayan states (i.e. Arunachal Pradesh, Nagaland and Manipur) are also identified as potential occurrence places require further exploration.

Comparison of HMM and SDTW for Tamil handwritten character recognition

In this paper, we compare the experimental results for Tamil online handwritten character recognition using HMM and Statistical Dynamic Time Warping (SDTW) as classifiers. HMM was used for a 156-class problem. Different feature sets and values for the HMM states & mixtures were tried and the best combination was found to be 16 states & 14 mixtures, giving an accuracy of 85%. The features used in this combination were retained and a SDTW model with 20 states and single Gaussian was used as classifier. Also, the symbol set was increased to include numerals, punctuation marks and special symbols like $, & and #, taking the number of classes to 188. It was found that, with a small addition to the feature set, this simple SDTW classifier performed on par with the more complicated HMM model, giving an accuracy of 84%. Mixture density estimation computations was reduced by 11 times. The recognition is writer independent, as the dataset used is quite large, with a variety of handwriting styles.

Asymptotically-Optimal, Fast-Decodable, Full-Diversity STBCs

For a family/sequence of Space-Time Block Codes (STBCs) C1, C2,⋯, with increasing number of transmit antennas Ni, with rates Ri complex symbols per channel use (cspcu), i = 1,2,⋯, the asymptotic normalized rate is defined as limi→∞ Ri/Ni. A family of STBCs is said to be asymptotically-good if the asymptotic normalized rate is non-zero, i.e., when the rate scales as a non-zero fraction of the number of transmit antennas, and the family of STBCs is said to be asymptotically-optimal if the asymptotic normalized rate is 1, which is the maximum possible value. In this paper, we construct a new class of full-diversity STBCs that have the least maximum-likelihood (ML) decoding complexity among all known codes for any number of transmit antennas N>;1 and rates R>;1 cspcu. For a large set of (R,N) pairs, the new codes have lower ML decoding complexity than the codes already available in the literature. Among the new codes, the class of full-rate codes (R=N) are asymptotically-optimal and fast-decodable, and for N>;5 have lower ML decoding complexity than all other families of asymptotically-optimal, fast-decodable, full-diversity STBCs available in the literature. The construction of the new STBCs is facilitated by the following further contributions of this paper: (i) Construction of a new class of asymptotically-good, full-diversity multigroup ML decodable codes, that not only includes STBCs for a larger set of antennas, but also either matches in rate or contains as a proper subset all other high-rate or asymptotically-good, delay-optimal, multigroup ML decodable codes available in the literature. (ii) Construction of a new class of fast-group-decodable codes (codes that combine the low ML decoding complexity properties of multigroup ML decodable codes and fast-decodable codes) for all even number of transmit antennas and rates 1 <; R ≤ 5/4.- - (iii) Given a design with full-rank linear dispersion matrices, we show that a full-diversity STBC can be constructed from this design by encoding the real symbols independently using only regular PAM constellations.