On the Vertex Separation of Cactus Graphs

This paper is part of a work in progress whose goal is to construct a fast, practical algorithm for the vertex separation (VS) of cactus graphs. We prove a \main theorem for cacti", a necessary and sufficient condition for the VS of a cactus graph being k. Further, we investigate the ensuing ramifications that prevent the construction of an algorithm based on that theorem only.

On the Vertex Separation of Maximal Outerplanar Graphs

We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability, of submops.

Vertex component analysis: a geometric-based approach to unmix hyperspectral data

Hyperspectral remote sensing exploits the electromagnetic scattering patterns of the different materials at specific wavelengths [2, 3]. Hyperspectral sensors have been developed to sample the scattered portion of the electromagnetic spectrum extending from the visible region through the near-infrared and mid-infrared, in hundreds of narrow contiguous bands [4, 5]. The number and variety of potential civilian and military applications of hyperspectral remote sensing is enormous [6, 7]. Very often, the resolution cell corresponding to a single pixel in an image contains several substances (endmembers) [4]. In this situation, the scattered energy is a mixing of the endmember spectra. A challenging task underlying many hyperspectral imagery applications is then decomposing a mixed pixel into a collection of reflectance spectra, called endmember signatures, and the corresponding abundance fractions [8–10]. Depending on the mixing scales at each pixel, the observed mixture is either linear or nonlinear [11, 12]. Linear mixing model holds approximately when the mixing scale is macroscopic [13] and there is negligible interaction among distinct endmembers [3, 14]. If, however, the mixing scale is microscopic (or intimate mixtures) [15, 16] and the incident solar radiation is scattered by the scene through multiple bounces involving several endmembers [17], the linear model is no longer accurate. Linear spectral unmixing has been intensively researched in the last years [9, 10, 12, 18–21]. It considers that a mixed pixel is a linear combination of endmember signatures weighted by the correspondent abundance fractions. Under this model, and assuming that the number of substances and their reflectance spectra are known, hyperspectral unmixing is a linear problem for which many solutions have been proposed (e.g., maximum likelihood estimation [8], spectral signature matching [22], spectral angle mapper [23], subspace projection methods [24,25], and constrained least squares [26]). In most cases, the number of substances and their reflectances are not known and, then, hyperspectral unmixing falls into the class of blind source separation problems [27]. Independent component analysis (ICA) has recently been proposed as a tool to blindly unmix hyperspectral data [28–31]. ICA is based on the assumption of mutually independent sources (abundance fractions), which is not the case of hyperspectral data, since the sum of abundance fractions is constant, implying statistical dependence among them. This dependence compromises ICA applicability to hyperspectral images as shown in Refs. [21, 32]. In fact, ICA finds the endmember signatures by multiplying the spectral vectors with an unmixing matrix, which minimizes the mutual information among sources. If sources are independent, ICA provides the correct unmixing, since the minimum of the mutual information is obtained only when sources are independent. This is no longer true for dependent abundance fractions. Nevertheless, some endmembers may be approximately unmixed. These aspects are addressed in Ref. [33]. Under the linear mixing model, the observations from a scene are in a simplex whose vertices correspond to the endmembers. Several approaches [34–36] have exploited this geometric feature of hyperspectral mixtures [35]. Minimum volume transform (MVT) algorithm [36] determines the simplex of minimum volume containing the data. The method presented in Ref. [37] is also of MVT type but, by introducing the notion of bundles, it takes into account the endmember variability usually present in hyperspectral mixtures. The MVT type approaches are complex from the computational point of view. Usually, these algorithms find in the first place the convex hull defined by the observed data and then fit a minimum volume simplex to it. For example, the gift wrapping algorithm [38] computes the convex hull of n data points in a d-dimensional space with a computational complexity of O(nbd=2cþ1), where bxc is the highest integer lower or equal than x and n is the number of samples. The complexity of the method presented in Ref. [37] is even higher, since the temperature of the simulated annealing algorithm used shall follow a log( ) law [39] to assure convergence (in probability) to the desired solution. Aiming at a lower computational complexity, some algorithms such as the pixel purity index (PPI) [35] and the N-FINDR [40] still find the minimum volume simplex containing the data cloud, but they assume the presence of at least one pure pixel of each endmember in the data. This is a strong requisite that may not hold in some data sets. In any case, these algorithms find the set of most pure pixels in the data. PPI algorithm uses the minimum noise fraction (MNF) [41] as a preprocessing step to reduce dimensionality and to improve the signal-to-noise ratio (SNR). The algorithm then projects every spectral vector onto skewers (large number of random vectors) [35, 42,43]. The points corresponding to extremes, for each skewer direction, are stored. A cumulative account records the number of times each pixel (i.e., a given spectral vector) is found to be an extreme. The pixels with the highest scores are the purest ones. N-FINDR algorithm [40] is based on the fact that in p spectral dimensions, the p-volume defined by a simplex formed by the purest pixels is larger than any other volume defined by any other combination of pixels. This algorithm finds the set of pixels defining the largest volume by inflating a simplex inside the data. ORA SIS [44, 45] is a hyperspectral framework developed by the U.S. Naval Research Laboratory consisting of several algorithms organized in six modules: exemplar selector, adaptative learner, demixer, knowledge base or spectral library, and spatial postrocessor. The first step consists in flat-fielding the spectra. Next, the exemplar selection module is used to select spectral vectors that best represent the smaller convex cone containing the data. The other pixels are rejected when the spectral angle distance (SAD) is less than a given thresh old. The procedure finds the basis for a subspace of a lower dimension using a modified Gram–Schmidt orthogonalizati on. The selected vectors are then projected onto this subspace and a simplex is found by an MV T pro cess. ORA SIS is oriented to real-time target detection from uncrewed air vehicles using hyperspectral data [46]. In this chapter we develop a new algorithm to unmix linear mixtures of endmember spectra. First, the algorithm determines the number of endmembers and the signal subspace using a newly developed concept [47, 48]. Second, the algorithm extracts the most pure pixels present in the data. Unlike other methods, this algorithm is completely automatic and unsupervised. To estimate the number of endmembers and the signal subspace in hyperspectral linear mixtures, the proposed scheme begins by estimating sign al and noise correlation matrices. The latter is based on multiple regression theory. The signal subspace is then identified by selectin g the set of signal eigenvalue s that best represents the data, in the least-square sense [48,49 ], we note, however, that VCA works with projected and with unprojected data. The extraction of the end members exploits two facts: (1) the endmembers are the vertices of a simplex and (2) the affine transformation of a simplex is also a simplex. As PPI and N-FIND R algorithms, VCA also assumes the presence of pure pixels in the data. The algorithm iteratively projects data on to a direction orthogonal to the subspace spanned by the endmembers already determined. The new end member signature corresponds to the extreme of the projection. The algorithm iterates until all end members are exhausted. VCA performs much better than PPI and better than or comparable to N-FI NDR; yet it has a computational complexity between on e and two orders of magnitude lower than N-FINDR. The chapter is structure d as follows. Section 19.2 describes the fundamentals of the proposed method. Section 19.3 and Section 19.4 evaluate the proposed algorithm using simulated and real data, respectively. Section 19.5 presents some concluding remarks.

Measurement of B(B)over-bar angular correlations based on secondary vertex reconstruction at root s=7 TeV

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Doehlert Design-desirability Function Multi-criteria Optimal Separation Of 17 Phenolic Compounds From Extra-virgin Olive Oil By Capillary Zone Electrophoresis.

In Brazil, the consumption of extra-virgin olive oil (EVOO) is increasing annually, but there are no experimental studies concerning the phenolic compound contents of commercial EVOO. The aim of this work was to optimise the separation of 17 phenolic compounds already detected in EVOO. A Doehlert matrix experimental design was used, evaluating the effects of pH and electrolyte concentration. Resolution, runtime and migration time relative standard deviation values were evaluated. Derringer's desirability function was used to simultaneously optimise all 37 responses. The 17 peaks were separated in 19min using a fused-silica capillary (50μm internal diameter, 72cm of effective length) with an extended light path and 101.3mmolL(-1) of boric acid electrolyte (pH 9.15, 30kV). The method was validated and applied to 15 EVOO samples found in Brazilian supermarkets.

Beam-energy Dependence Of Charge Separation Along The Magnetic Field In Au+au Collisions At Rhic.

Local parity-odd domains are theorized to form inside a quark-gluon plasma which has been produced in high-energy heavy-ion collisions. The local parity-odd domains manifest themselves as charge separation along the magnetic field axis via the chiral magnetic effect. The experimental observation of charge separation has previously been reported for heavy-ion collisions at the top RHIC energies. In this Letter, we present the results of the beam-energy dependence of the charge correlations in Au+Au collisions at midrapidity for center-of-mass energies of 7.7, 11.5, 19.6, 27, 39, and 62.4 GeV from the STAR experiment. After background subtraction, the signal gradually reduces with decreased beam energy and tends to vanish by 7.7 GeV. This implies the dominance of hadronic interactions over partonic ones at lower collision energies.

Separation Of Glycosidic Catiomers By Twim-ms Using Co2 As A Drift Gas.

Traveling wave ion mobility mass spectrometry (TWIM-MS) is shown to be able to separate and characterize several isomeric forms of diterpene glycosides stevioside (Stv) and rebaudioside A (RebA) that are cationized by Na(+) and K(+) at different sites. Determination and characterization of these coexisting isomeric species, herein termed catiomers, arising from cationization at different and highly competitive coordinating sites, is particularly challenging for glycosides. To achieve this goal, the advantage of using CO2 as a more massive and polarizable drift gas, over N2 , was demonstrated. Post-TWIM-MS/MS experiments were used to confirm the separation. Optimization of the possible geometries and cross-sectional calculations for mobility peak assignments were also performed. Copyright © 2015 John Wiley & Sons, Ltd.

Preparative separation of flavonoids from the medicinal plant Davilla elliptica St. Hill. by high-speed counter-current chromatography

High-speed counter-current chromatography (HSCCC) is a major tool for the fast separation of natural products from plants. It was used for the preparative isolation of the flavonoid monoglucosides present in the aerial parts of the Davilla elliptica St. Hill. (Dilleniaceae). This species is used in Brazilian folk medicine for the treatment of gastric disorders. The optimum solvent system used was composed of a mixture of ethyl acetate-n-propanol-water (140:8:80, v/v/v) and led to a successful separation of quercetin-3-O-alpha-L-rhamnopyranoside and myricetin-3-O-alpha-L-rhamnopyranoside in approximately 3.0 hours with purity higher than 95%. Identification was performed by ¹H NMR, 13C NMR and HPLC-UV-DAD analyses.

DECISION TREE CLASSIFIERS FOR STAR/GALAXY SEPARATION

We study the star/galaxy classification efficiency of 13 different decision tree algorithms applied to photometric objects in the Sloan Digital Sky Survey Data Release Seven (SDSS-DR7). Each algorithm is defined by a set of parameters which, when varied, produce different final classification trees. We extensively explore the parameter space of each algorithm, using the set of 884,126 SDSS objects with spectroscopic data as the training set. The efficiency of star-galaxy separation is measured using the completeness function. We find that the Functional Tree algorithm (FT) yields the best results as measured by the mean completeness in two magnitude intervals: 14 <= r <= 21 (85.2%) and r >= 19 (82.1%). We compare the performance of the tree generated with the optimal FT configuration to the classifications provided by the SDSS parametric classifier, 2DPHOT, and Ball et al. We find that our FT classifier is comparable to or better in completeness over the full magnitude range 15 <= r <= 21, with much lower contamination than all but the Ball et al. classifier. At the faintest magnitudes (r > 19), our classifier is the only one that maintains high completeness (> 80%) while simultaneously achieving low contamination (similar to 2.5%). We also examine the SDSS parametric classifier (psfMag - modelMag) to see if the dividing line between stars and galaxies can be adjusted to improve the classifier. We find that currently stars in close pairs are often misclassified as galaxies, and suggest a new cut to improve the classifier. Finally, we apply our FT classifier to separate stars from galaxies in the full set of 69,545,326 SDSS photometric objects in the magnitude range 14 <= r <= 21.

High performance magnetic separation of gold nanoparticles for catalytic oxidation of alcohols

We present the magnetic separation approach to facilitate the recovery of gold nanoparticle (AuNP) catalysts. The use of magnetically recoverable supports for the immobilization of AuNPs instead of traditional oxides, polymers or carbon based solids guarantees facile, clean, fast and efficient separation of the catalyst at the end of the reaction cycle. Magnetic separation can be considered an environmentally benign separation approach, since it minimizes the use of auxiliary substances and energy for achieving catalyst recovery. The catalyst preparation is based on the immobilization of Au(3+) on the surface of core-shell silica-coated magnetite nanoparticles, followed by metal reduction using two different methods. AuNPs were prepared by thermal reduction in air and by hydrogen reduction at mild temperature. Interestingly, the mean particle size of the supported AuNPs was similar (ca. 5.9 nm), but the polydispersity of the samples is quite different. The catalytic activity of both catalysts in the aerobic oxidation of alcohols was investigated and a distinct selectivity for benzyl alcohol oxidation was observed.

Liquid-liquid microextraction without phase separation in a multicommuted flow system for diltiazem determination in pharmaceuticals

Liquid-liquid microextraction without phase segmentation was implemented in a multicommuted flow system for determination of the anti-hypertensive diltiazem. The procedure was based on ion pair formation between the drug and the dye bromothymol blue at pH 3.5. The detection was performed without phase separation in a glass tube coupled to a fiber-optics spectrophotometer. The total volume of chloroform was reduced to 50 mu L in comparison with 10 mL consumed in batch. A linear response was observed between 9 and 120 mu mol L(-1), with a detection limit of 0.9 mu mol L(-1) (99.7% confidence level). The coefficient of variation (n = 10), sampling rate and extraction efficiency were estimated as 0.6%, 78 determinations per hour and 61%, respectively. About 30 mu g of bromothymol blue was consumed and the waste volume was 380 mu L per determination. The results for pharmaceutical samples agreed with those obtained by the reference procedure at the 95% confidence level. (C) 2011 Elsevier B.V. All rights reserved.

Skewness, splitting number and vertex deletion of some toroidal meshes

The skewness sk(G) of a graph G = (V, E) is the smallest integer sk(G) >= 0 such that a planar graph can be obtained from G by the removal of sk(C) edges. The splitting number sp(G) of C is the smallest integer sp(G) >= 0 such that a planar graph can be obtained from G by sp(G) vertex splitting operations. The vertex deletion vd(G) of G is the smallest integer vd(G) >= 0 such that a planar graph can be obtained from G by the removal of vd(G) vertices. Regular toroidal meshes are popular topologies for the connection networks of SIMD parallel machines. The best known of these meshes is the rectangular toroidal mesh C(m) x C(n) for which is known the skewness, the splitting number and the vertex deletion. In this work we consider two related families: a triangulation Tc(m) x c(n) of C(m) x C(n) in the torus, and an hexagonal mesh Hc(m) x c(n), the dual of Tc(m) x c(n) in the torus. It is established that sp(Tc(m) x c(n)) = vd(Tc(m) x c(n) = sk(Hc(m) x c(n)) = sp(Hc(m) x c(n)) = vd(Hc(m) x c(n)) = min{m, n} and that sk(Tc(m) x c(n)) = 2 min {m, n}.

Surface tension of flotation solution and its influence on the selectivity of the separation between apatite and gangue minerals

This work presents and discusses the influence of the surface tension (gamma(LV)) of methanol/water mixtures on the flotation response of apatite versus gangue minerals conditioned with flotation reagents (75 g/t cornstarch and 100 g/t Berol 867) at pH 10.6. Berol 867 is a collector composed of sodium alkyl sarcosinate plus nonionic surfactant. The highest Schulz efficiency of separation (recovery of apatite minus recovery of gangue) was achieved at approximate to 51.0 mN/m. The critical surface tension of wettability (gamma(C)) of apatite was found to occur at 34.7 mN/m when determined by means of gamma flotation experiments, , and it was 33.9 mN/m when determined by Zisman`s approach.

Separation of silica from bauxite via froth flotation

This paper reports an innovative development: concentrating gibbsite via reverse froth flotation in order to obtain a metallurgical-grade bauxite concentrate. Tailings from an industrial plant have undergone attrition scrubbing and desliming; the quartz silica contained in the tailings has undergone flotation. Starch was used as a depressant, and ether-amine as the cationic collector. Optimum pH is around 10.0. In pilot plant scale, a metallurgical-grade concentrate was obtained by assaying 42.3% available alumina with an alumina/insoluble silica mass ratio of 11.1. It contained the gibbsite and the iron and titanium bearing minerals. The concentrate was further upgraded by magnetic separation, leading to 54.0% available alumina, with an alumina/insoluble silica mass ratio of 12.6 at an overall available alumina recovery of 69.3% in the final concentrate (non-magnetic product). (C) 2008 Elsevier Ltd. All rights reserved.

A Separation Principle for the Continuous-Time LQ-Problem With Markovian Jump Parameters

In this paper, we devise a separation principle for the finite horizon quadratic optimal control problem of continuous-time Markovian jump linear systems driven by a Wiener process and with partial observations. We assume that the output variable and the jump parameters are available to the controller. It is desired to design a dynamic Markovian jump controller such that the closed loop system minimizes the quadratic functional cost of the system over a finite horizon period of time. As in the case with no jumps, we show that an optimal controller can be obtained from two coupled Riccati differential equations, one associated to the optimal control problem when the state variable is available, and the other one associated to the optimal filtering problem. This is a separation principle for the finite horizon quadratic optimal control problem for continuous-time Markovian jump linear systems. For the case in which the matrices are all time-invariant we analyze the asymptotic behavior of the solution of the derived interconnected Riccati differential equations to the solution of the associated set of coupled algebraic Riccati equations as well as the mean square stabilizing property of this limiting solution. When there is only one mode of operation our results coincide with the traditional ones for the LQG control of continuous-time linear systems.