Distributed algorithms for edge dominating sets

An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approximation algorithms for finding minimum-size edge dominating sets. The focus is on anonymous port-numbered networks: there are no unique identifiers, but a node of degree d can refer to its neighbours by integers 1, 2, ..., d. The present work shows that in the port-numbering model, edge dominating sets can be approximated as follows: in d-regular graphs, to within 4 − 6/(d + 1) for an odd d and to within 4 − 2/d for an even d; and in graphs with maximum degree Δ, to within 4 − 2/(Δ − 1) for an odd Δ and to within 4 − 2/Δ for an even Δ. These approximation ratios are tight for all values of d and Δ: there are matching lower bounds.

On some results of A. E. Livingston and coefficient problems for concave univalent functions

We consider functions that map the open unit disc conformally onto the complement of a bounded convex set. We call these functions concave univalent functions. In 1994, Livingston presented a characterization for these functions. In this paper, we observe that there is a minor flaw with this characterization. We obtain certain sharp estimates and the exact set of variability involving Laurent and Taylor coefficients for concave functions. We also present the exact set of variability of the linear combination of certain successive Taylor coefficients of concave functions.

Minimal sets of generators for the relation ideals of certain monomial curves

Let O be a monomial curve in the affine algebraic e-space over a field K and P be the relation ideal of O. If O is defined by a sequence of e positive integers some e - 1 of which form an arithmetic sequence then we construct a minimal set of generators for P and write an explicit formula for mu(P).

Novel gray coded pattern for unwrapping phase in fringe projection based 3D profiling

A method to reliably extract object profiles even with height discontinuities (that leads to 2n pi phase jumps) is proposed. This method uses Fourier transform profilometry to extract wrapped phase, and an additional image formed by illuminating the object of interest by a novel gray coded pattern for phase unwrapping. Simulation results suggest that the proposed approach not only retains the advantages of the original method, but also contributes significantly in the enhancement of its performance. Fundamental advantage of this method stems from the fact that both extraction of wrapped phase and unwrapping the same were done by gray scale images. Hence, unlike the methods that use colors, proposed method doesn't demand a color CCD camera and is ideal for profiling objects with multiple colors.

Reversible Insertion of a Trivalent Cation onto MnO2 Leading to Enhanced Capacitance

Supercapacitor properties of MnO2 are studied generally in aqueous alkali metal salt solutions, often in a Na salt solution. During electrochemical discharge-charge processes, Na+ ions from the electrolyte get reversibly inserted/deinserted on the surface of MnO2 particles, which leads to redox reaction between MnOONa and MnO2. In the present study, it has been shown that MnO2 exhibits enhanced capacitance behaviour in a rare earth metal salt solution, namely, La(NO3)(3) solution in comparison with NaNO3 and Mg(NO3)(2) aqueous solutions. The specific capacitance increases with an increase in charge on the solution cation (Na+, Mg2+ and La3+). It is proposed that the number of surface sites for adsorption of cations remains unaltered in all solutions. The surface insertion of cation facilitates the reduction of Mn4+ in MnO2 to Mn3+ equivalent to the charge present on the cation. As the specific capacitance is related to the quantity of charge that is exchanged between the solid MnO2 and the aqueous solution, the trivalent cation (La3+) provides greater specific capacitance than in Mg(NO3)(2) and NaNO3 electrolytes. Accordingly, the number of Mn(IV)/Mn(III) redox pairs involved in the neighbourhood of the adsorption site is one, two and three when Na+, Mg2+ and La3+ ions, respectively, are adsorbed. (C) 2011 The Electrochemical Society. DOI: 10.1149/1.3565177] All rights reserved.

Studies on adsorption of guar gum onto biotite mica

The interaction of guar gum with biotite mica has been investigated through adsorption, flotation and electrokinetic measurements. The adsorption densities of guar gum increase with increase of pH and the isotherms exhibit Langmuirian behaviour. Pretreatment of mica with a complexing agent such as EDTA results in a decrease in the adsorption density, highlighting the contribution of metal ions to the adsorption process. An increase in the surface face-to-edge ratio lends to an increase in the adsorption density. The flotation recoveries decrease as a function of pH, complementing the adsorption results. However, polymer depressant ability is reduced in the case of EDTA treated mica, consequent to reduction of metallic sites. Electrokinetic measurements portray conformational rearrangements of macromolecules with the loading, resulting in the shift of the shear plane, further away from the interface. Dissolution experiments indicate release of metal ions from mica, while co-precipitation tests confirm polymer-metal ion interaction in the bulk solution. The adsorption process is governed by hydrogen bonding as well as chemical interaction between guar gum and the surface metal hydroxide groups of mica. (C) 1997 Published by Elsevier Science Ltd.

Mapping adaptive resonance theory onto ring and mesh architectures

In recent years, parallel computers have been attracting attention for simulating artificial neural networks (ANN). This is due to the inherent parallelism in ANN. This work is aimed at studying ways of parallelizing adaptive resonance theory (ART), a popular neural network algorithm. The core computations of ART are separated and different strategies of parallelizing ART are discussed. We present mapping strategies for ART 2-A neural network onto ring and mesh architectures. The required parallel architecture is simulated using a parallel architectural simulator, PROTEUS and parallel programs are written using a superset of C for the algorithms presented. A simulation-based scalability study of the algorithm-architecture match is carried out. The various overheads are identified in order to suggest ways of improving the performance. Our main objective is to find out the performance of the ART2-A network on different parallel architectures. (C) 1999 Elsevier Science B.V. All rights reserved.

Solution grafting of maleic anhydride onto polyethylene and compatibilization of polyetylene-nylon blends

Maleic anhydride (MAH) has been grafted onto high density polyethylene (HDPE) with benzoyl peroxide (BOP) initiator in toluene solution. Maximum degree of grafting (12%) without crosslinking has been obtained using MAH/HDPE and BOP/HDPE weight ratios of 1.0 and 0.15 respectively, at 110 degrees C. The HDPE-g-MAH compatibilizer is found to drastically reduce the dispersed phase size and also to produce homogeneous blends for relatively low concentrations of dispersed phase in HDPE/nylon blends. Addition of this compatibilizer results in increase of tensile strength and modulus with increasing nylon content of HDPE/nylon blends, while the opposite is found for the blends without any added compatibilizer.

Surface chemical studies on the competitive adsorption of poly(acrylic acid) and poly(vinyl alcohol) onto alumina

The adsorption of poly(acrylic acid) (PAA) and poly(vinyl alcohol) (PVA) onto alumina has been studied as a function of pH, both individually and in the presence of each other. The adsorption density of PAA is found to decrease with an increase of pH while that of PVA shows the opposite trend. In a binary system containing PAA and PVA, the presence of PVA does not affect the adsorption of PAA onto alumina, but the addition of PAA diminishes the adsorption of PVA in the pH range investigated. The adsorption isotherm of PAA at acidic pH exhibits high-affinity Langmuirian behavior. The isotherms for PVA appear rounded and are of the low-affinity type, Once again the adsorption isotherms of PAA remain unaltered in the presence of PVA whereas those of PVA are significantly affected resulting in a lowering of the adsorption density consequent to PAA addition. A variation in the sequence of addition of PAA and PVA does not affect the adsorption behavior of either of the polymers, The electrokinetic behavior of alumina with PAA is hardly influenced by the addition of PVA, On the other hand, the electrophoretic mobility of alumina in the presence of PVA is significantly altered in the presence of PAA and closely resembles the trend observed with PAA alone. Desorption studies reveal that over 80% of PVA could be desorbed in the pH range 3-9 whereas in the case of PAA, the percent desorption increases from 20 to about 70% as the pH is increased from about 3 to 8. Solution conductivity tests confirm interaction of aluminum species and PAA in the bulk solution. FTIR spectroscopic data provide evidence in support of hydrogen bonding and chemical interaction in the case of the PAA-alumina system and hydrogen bonding with respect to the PVA-alumina interaction. (C) 1999 Academic Press.

Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions

In this paper we consider the problem of learning an n × n kernel matrix from m(1) similarity matrices under general convex loss. Past research have extensively studied the m = 1 case and have derived several algorithms which require sophisticated techniques like ACCP, SOCP, etc. The existing algorithms do not apply if one uses arbitrary losses and often can not handle m > 1 case. We present several provably convergent iterative algorithms, where each iteration requires either an SVM or a Multiple Kernel Learning (MKL) solver for m > 1 case. One of the major contributions of the paper is to extend the well knownMirror Descent(MD) framework to handle Cartesian product of psd matrices. This novel extension leads to an algorithm, called EMKL, which solves the problem in O(m2 log n 2) iterations; in each iteration one solves an MKL involving m kernels and m eigen-decomposition of n × n matrices. By suitably defining a restriction on the objective function, a faster version of EMKL is proposed, called REKL,which avoids the eigen-decomposition. An alternative to both EMKL and REKL is also suggested which requires only an SVMsolver. Experimental results on real world protein data set involving several similarity matrices illustrate the efficacy of the proposed algorithms.

Removal of As(V) by adsorption onto mixed rare earth oxides

Arsenic pollution of water is a major problem faced worldwide. Arsenic is a suspected carcinogen in human beings and is harmful to other living beings. In the present study, a novel adsorbent was used to remove arsenate [As(V)] from synthetic solutions. The adsorbent, which is a mixture of rare earth oxides, was found to adsorb As(V) rapidly and effectively. The effect of various parameters such as contact time, initial concentration, pH, and adsorbent dose on adsorption efficiency was investigated. More than 90% of the adsorption occurred within the first 10 min and the kinetic rate constant was found to be about 3.5 mg min(-1). Adsorption efficiency was found to be dependent on the initial As(V) concentration, and the adsorption behavior followed the Langmuir adsorption model. The optimum pH was found to be 6.5. The presence of other ions such as nitrate, phosphate, sulphate, and silicate decreased the adsorption of As(V) by about 20-30%. The adsorbed As(V) could be desorbed easily by washing the adsorbent with pH 12 solution. This study demonstrates the applicability of naturally occurring rare earth oxides as selective adsorbents for As(V) from solutions.

Grafting of m-isopropenyl-alpha, alpha-dimethylbenzyl-isocyanate (m-TMI) onto isotactic polypropylene: Synthesis and characterization

A novel vinyl monomer with an isocyanate functional group, m-isopropenyl-alpha,alpha-dimethylbenzyl-isocyanate (m-TMI), was grafted onto isotactic polypropylene (i-PP) using dicumyl peroxide (DCP) as the initiator. This would open up the possibility of using the grafted polymer with the reactive isocyanate group as compatibilizer for blending carbohydrates such as cellulose with. polypropylene. The grafting was carried out in a Brabender Plasticoder at 180degreesC. The effects of monomer and initiator concentrations on the yield of grafting were investigated by performing statistical analysis. While the grafting yield increased with the concentration of DCP at any given concentration of m-TMI, the variation of the grafting yield with m-TMI concentration, for a given concentration of DCP, went through a maximum, the optimum yield of 7.8% (w/w) being obtained at 10 wt.% concentration of both DCP and m-TMI. The grafting reaction is. accompanied by considerable chain scission of I-PP, resulting in a decrease in the molecular weight of the grafted polymer. While the molecular weight drops sharply even at a low concentration of DCP, there occurs no further significant change in the molecular weight even at much higher concentrations of the initiator.

Tree structure for efficient data mining using rough sets

In data mining, an important goal is to generate an abstraction of the data. Such an abstraction helps in reducing the space and search time requirements of the overall decision making process. Further, it is important that the abstraction is generated from the data with a small number of disk scans. We propose a novel data structure, pattern count tree (PC-tree), that can be built by scanning the database only once. PC-tree is a minimal size complete representation of the data and it can be used to represent dynamic databases with the help of knowledge that is either static or changing. We show that further compactness can be achieved by constructing the PC-tree on segmented patterns. We exploit the flexibility offered by rough sets to realize a rough PC-tree and use it for efficient and effective rough classification. To be consistent with the sizes of the branches of the PC-tree, we use upper and lower approximations of feature sets in a manner different from the conventional rough set theory. We conducted experiments using the proposed classification scheme on a large-scale hand-written digit data set. We use the experimental results to establish the efficacy of the proposed approach. (C) 2002 Elsevier Science B.V. All rights reserved.