Physical and dynamical characterization of (5201) Ferraz-Mello, a possible extinct Jupiter family comet

Context. The subject of asteroids in cometary orbits (ACOs) has been of growing interest lately. These objects have the orbital characteristics typical of comets, but are asteroidal in appearance, i.e., show no signs of a coma at any part of their orbits. At least a fraction of these objects are thought to be comets that have either exhausted all their volatile content or developed a refractory crust that prevents sublimation. In particular, the asteroid ( 5201) Ferraz-Mello has, since its discovery, been suspected to be an extinct Jupiter family comet due to the peculiar nature of its orbit. Aims. The aim of this work is to put constraints on the possible origin of ( 5201) Ferraz-Mello by means of spectroscopic characterization and a study of the dynamics of this asteroid. Methods. We used the SOAR Optical Imager (SOI) to obtain observations of ( 5201) Ferraz-Mello using four SDSS filters. These observations were compared to asteroids listed in the Sloan Moving objects catalog and also to photometry of cometary nuclei, Centaurs, and TNOs. The orbital evolution of ( 5201) Ferraz-Mello and of a sample of asteroids and comets that are close to that object in the a - e plane were simulated using a pure N-body code for 4 000 years forward and 4 000 years backward in time. Results. The reflectance spectrum obtained from its colors in the SDSS system is unusual, with a steep spectral gradient that is comparable to TNOs and Centaurs, but with an increase in the reflectance in the g band that is not common in those populations. A similar behavior is seen in cometary nuclei that were observed in the presence of a faint dust coma. The dynamical results confirm the very chaotic evolution found previously and its dynamical similarity to the chaotic evolution of some comets. The asteroid is situated in the very stochastic layer at the border of the 2/1 resonance, and it has a very short Lyapunov time ( 30 - 40) years. Together, the spectral characteristcs and the dynamical evolution suggest that ( 5201) Ferraz-Mello is a dormant or extinct comet.

Fast ray-tracing algorithm for circumstellar structures (FRACS) II. Disc parameters of the B[e] supergiant CPD-57 degrees 2874 from VLTI/MIDI data

Context. B[e] supergiants are luminous, massive post-main sequence stars exhibiting non-spherical winds, forbidden lines, and hot dust in a disc-like structure. The physical properties of their rich and complex circumstellar environment (CSE) are not well understood, partly because these CSE cannot be easily resolved at the large distances found for B[e] supergiants (typically greater than or similar to 1 kpc). Aims. From mid-IR spectro-interferometric observations obtained with VLTI/MIDI we seek to resolve and study the CSE of the Galactic B[e] supergiant CPD-57 degrees 2874. Methods. For a physical interpretation of the observables (visibilities and spectrum) we use our ray-tracing radiative transfer code (FRACS), which is optimised for thermal spectro-interferometric observations. Results. Thanks to the short computing time required by FRACS (<10 s per monochromatic model), best-fit parameters and uncertainties for several physical quantities of CPD-57 degrees 2874 were obtained, such as inner dust radius, relative flux contribution of the central source and of the dusty CSE, dust temperature profile, and disc inclination. Conclusions. The analysis of VLTI/MIDI data with FRACS allowed one of the first direct determinations of physical parameters of the dusty CSE of a B[e] supergiant based on interferometric data and using a full model-fitting approach. In a larger context, the study of B[e] supergiants is important for a deeper understanding of the complex structure and evolution of hot, massive stars.

Phylogeography of the common vampire bat (Desmodus rotundus): Marked population structure, Neotropical Pleistocene vicariance and incongruence between nuclear and mtDNA markers

Background: The common vampire bat Desmodus rotundus is an excellent model organism for studying ecological vicariance in the Neotropics due to its broad geographic range and its preference for forested areas as roosting sites. With the objective of testing for Pleistocene ecological vicariance, we sequenced a mitocondrial DNA (mtDNA) marker and two nuclear markers (RAG2 and DRB) to try to understand how Pleistocene glaciations affected the distribution of intraspecific lineages in this bat. Results: Five reciprocally monophyletic clades were evident in the mitochondrial gene tree, and in most cases with high bootstrap support: Central America (CA), Amazon and Cerrado (AMC), Pantanal (PAN), Northern Atlantic Forest (NAF) and Southern Atlantic Forest (SAF). The Atlantic forest clades formed a monophyletic clade with high bootstrap support, creating an east/west division for this species in South America. On the one hand, all coalescent and non-coalescent estimates point to a Pleistocene time of divergence between the clades. On the other hand, the nuclear markers showed extensive sharing of haplotypes between distant localities, a result compatible with male-biased gene flow. In order to test if the disparity between the mitochondrial and nuclear markers was due to the difference in mutation rate and effective size, we performed a coalescent simulation to examine the feasibility that, given the time of separation between the observed lineages, even with a gene flow rate close to zero, there would not be reciprocal monophyly for a neutral nuclear marker. We used the observed values of theta and an estimated mutation rate for the nuclear marker gene to perform 1000 iterations of the simulation. The results of this simulation were inconclusive: the number of iterations with and without reciprocal monophyly of one or more clades are similar. Conclusions: We therefore conclude that the pattern exhibited by the common vampire bat, with marked geographical structure for a mitochondrial marker and no phylogeographic structure for nuclear markers is compatible with a historical scenario of complete isolation of refuge-like populations during the Pleistocene. The results on demographic history on this species is compatible with the Carnaval-Moritz model of Pleistocene vicariance, with demographic expansions in the southern Atlantic forest.

On the k-restricted structure ratio in planar and outerplanar graphs

A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-restricted ratio is the infimum, over simple planar graphs H, of the ratio of the number of edges in a maximum k-restricted structure subgraph of H to the number edges of H. We prove that, as k tends to infinity, the planar k-restricted ratio tends to 1/2. The same result holds for the weighted version. Our results are based on analyzing the analogous ratios for outerplanar and weighted outerplanar graphs. Here both ratios tend to 1 as k goes to infinity, and we provide good estimates of the rates of convergence, showing that they differ in the weighted from the unweighted case.

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications

An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).

On the resilience of long cycles in random graphs

In this paper we determine the local and global resilience of random graphs G(n,p) (p >> n(-1)) with respect to the property of containing a cycle of length at least (1 - alpha)n. Roughly speaking, given alpha > 0, we determine the smallest r(g) (G, alpha) with the property that almost surely every subgraph of G = G(n,p) having more than r(g) (G, alpha)vertical bar E(G)vertical bar edges contains a cycle of length at least (1 - alpha)n (global resilience). We also obtain, for alpha < 1/2, the smallest r(l) (G, alpha) such that any H subset of G having deg(H) (v) larger than r(l) (G, alpha) deg(G) (v) for all v is an element of V(G) contains a cycle of length at least (1 - alpha)n (local resilience). The results above are in fact proved in the more general setting of pseudorandom graphs.

Can we make a Bohmian electron reach the speed of light, at least for one instant?

In Bohmian mechanics, a version of quantum mechanics that ascribes world lines to electrons, we can meaningfully ask about an electron's instantaneous speed relative to a given inertial frame. Interestingly, according to the relativistic version of Bohmian mechanics using the Dirac equation, a massive particle's speed is less than or equal to the speed of light, but not necessarily less. That is, there are situations in which the particle actually reaches the speed of light-a very nonclassical behavior. That leads us to the question of whether such situations can be arranged experimentally. We prove a theorem, Theorem 5, implying that for generic initial wave functions the probability that the particle ever reaches the speed of light, even if at only one point in time, is zero. We conclude that the answer to the question is no. Since a trajectory reaches the speed of light whenever the quantum probability current (psi) over bar gamma(mu)psi is a lightlike 4-vector, our analysis concerns the current vector field of a generic wave function and may thus be of interest also independently of Bohmian mechanics. The fact that the current is never spacelike has been used to argue against the possibility of faster-than-light tunneling through a barrier, a somewhat similar question. Theorem 5, as well as a more general version provided by Theorem 6, are also interesting in their own right. They concern a certain property of a function psi : R(4) -> C(4) that is crucial to the question of reaching the speed of light, namely being transverse to a certain submanifold of C(4) along a given compact subset of space-time. While it follows from the known transversality theorem of differential topology that this property is generic among smooth functions psi : R(4) -> C(4), Theorem 5 asserts that it is also generic among smooth solutions of the Dirac equation. (C) 2010 American Institute of Physics. [doi:10.1063/1.3520529]

The Lobel-Komlos-Sos conjecture for trees of diameter 5 and for certain caterpillars

Loebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at least some k is an element of N, then every tree with at most k edges is a subgraph of G. We prove the conjecture for all trees of diameter at most 5 and for a class of caterpillars. Our result implies a bound on the Ramsey number r( T, T') of trees T, T' from the above classes.

Correlation between MMPs and their inhibitors in breast cancer tumor tissue specimens and in cell lines with different metastatic potential

Background: The metastatic disease rather than the primary tumor itself is responsible for death in most solid tumors, including breast cancer. The role of matrix metalloproteinases ( MMPs), tissue inhibitors of MMPs (TIMPs) and Reversion-inducing cysteine-rich protein with Kazal motifs ( RECK) in the metastatic process has previously been established. However, in all published studies only a limited number of MMPs/MMP inhibitors was analyzed in a limited number of cell lines. Here, we propose a more comprehensive approach by analyzing the expression levels of several MMPs (MMP-2, MMP-9 and MMP-14) and MMP inhibitors (TIMP-1, TIMP-2 and RECK) in different models ( five human breast cancer cell lines, 72 primary breast tumors and 30 adjacent normal tissues). Methods: We analyzed the expression levels of MMP-2, MMP-9 and MMP-14 and their inhibitors (TIMP-1, TIMP-2 and RECK) by quantitative RT-PCR (qRT-PCR) in five human breast cancer cell lines presenting increased invasiveness and metastatic potential, 72 primary breast tumors and 30 adjacent normal tissues. Moreover, the role of cell-extracellular matrix elements interactions in the regulation of expression and activity of MMPs and their inhibitors was analyzed by culturing these cell lines on plastic or on artificial ECM (Matrigel). Results: The results demonstrated that MMPs mRNA expression levels displayed a positive and statistically significant correlation with the transcriptional expression levels of their inhibitors both in the cell line models and in the tumor tissue samples. Furthermore, the expression of all MMP inhibitors was modulated by cell-Matrigel contact only in highly invasive and metastatic cell lines. The enzyme/inhibitor balance at the transcriptional level significantly favors the enzyme which is more evident in tumor than in adjacent non-tumor tissue samples. Conclusion: Our results suggest that the expression of MMPs and their inhibitors, at least at the transcriptional level, might be regulated by common factors and signaling pathways. Therefore, the multi-factorial analysis of these molecules could provide new and independent prognostic information contributing to the determination of more adequate therapy strategies for each patient.`

Laser-induced breakdown spectroscopy and chemometrics for classification of toys relying on toxic elements

Quality control of toys for avoiding children exposure to potentially toxic elements is of utmost relevance and it is a common requirement in national and/or international norms for health and safety reasons. Laser-induced breakdown spectroscopy (LIBS) was recently evaluated at authors` laboratory for direct analysis of plastic toys and one of the main difficulties for the determination of Cd. Cr and Pb was the variety of mixtures and types of polymers. As most norms rely on migration (lixiviation) protocols, chemometric classification models from LIBS spectra were tested for sampling toys that present potential risk of Cd, Cr and Pb contamination. The classification models were generated from the emission spectra of 51 polymeric toys and by using Partial Least Squares - Discriminant Analysis (PLS-DA), Soft Independent Modeling of Class Analogy (SIMCA) and K-Nearest Neighbor (KNN). The classification models and validations were carried out with 40 and 11 test samples, respectively. Best results were obtained when KNN was used, with corrected predictions varying from 95% for Cd to 100% for Cr and Pb. (C) 2011 Elsevier B.V. All rights reserved.

Sequential injections as an alternative to gradient exploitation for implementing differential kinetic analysis in a flow injection system

A novel flow-based strategy for implementing simultaneous determinations of different chemical species reacting with the same reagent(s) at different rates is proposed and applied to the spectrophotometric catalytic determination of iron and vanadium in Fe-V alloys. The method relies on the influence of Fe(II) and V(IV) on the rate of the iodide oxidation by Cr(VI) under acidic conditions, the Jones reducing agent is then needed Three different plugs of the sample are sequentially inserted into an acidic KI reagent carrier stream, and a confluent Cr(VI) solution is added downstream Overlap between the inserted plugs leads to a complex sample zone with several regions of maximal and minimal absorbance values. Measurements performed on these regions reveal the different degrees of reaction development and tend to be more precise Data are treated by multivariate calibration involving the PLS algorithm The proposed system is very simple and rugged Two latent variables carried out ca 95% of the analytical information and the results are in agreement with ICP-OES. (C) 2010 Elsevier B V. All rights reserved.

Contribuition of nitrogen from biological nitrogen fixation, nitrogen fertilizer and soil nitrogen on the growth of the common bean and cowpea

Biological nitrogen fixation (BNF) constitutes a valuable source of this nutrient for the common bean Phaseolus vulgaris L and cowpea Vigna unguiculata (L.) Walp., being its avaibility affected by mineral N in the soil solution. The objectives of this work were to evaluate the effects of nitrogen rate, as urea, on symbiotic fixation of N(2) in common bean and cowpea plants, using the isotopic technique, and quantifying the relative contributions of N sources symbiotic N(2) fixation, soil native nitrogen and urea N on the growth of the common bean and cowpea. Non nodulating soybean plants were used as standard. The research was carried out in greenhouse, using pots with 5 kg of soil from a Typic Haplustox (Dystrophic Red Yellow Latosol). The experimental design was completely randomized blocks, with 30 treatments and three replications, arranged in 5x3x2 factorial outline. The treatments consisted of five N rates: 2, 15, 30, 45 and 60 mg N kg(-1) soil; three sampling times: 23, 40 and 76 days after sowing (DAS) and two crops: common bean and cowpea. The BNF decreased with increase N rates, varying from 81.5% to 55.6% for cowpea, and from 71.9% to 55.1% for common bean. The symbiotic N(2) fixation in cowpea can substitute totally the nitrogen fertilization. The nitrogen absorption from soil is not affected by nitrogen fertilizer rate. The N recovery from fertilizer at 76 DAS was of 60.7% by common bean, and 57.1% by cowpea. The symbiotic association in common bean needs the application of a starting dose (40 kg N ha(-1)) for economically acceptable yields.

Power Transformer Differential Protection Based on Clarke`s Transform and Fuzzy Systems

The power transformer is a piece of electrical equipment that needs continuous monitoring and fast protection since it is very expensive and an essential element for a power system to perform effectively. The most common protection technique used is the percentage differential logic, which provides discrimination between an internal fault and different operating conditions. Unfortunately, there are some operating conditions of power transformers that can affect the protection behavior and the power system stability. This paper proposes the development of a new algorithm to improve the differential protection performance by using fuzzy logic and Clarke`s transform. An electrical power system was modeled using Alternative Transients Program (ATP) software to obtain the operational conditions and fault situations needed to test the algorithm developed. The results were compared to a commercial relay for validation, showing the advantages of the new method.

Node-Depth Encoding and Multiobjective Evolutionary Algorithm Applied to Large-Scale Distribution System Reconfiguration

The power loss reduction in distribution systems (DSs) is a nonlinear and multiobjective problem. Service restoration in DSs is even computationally hard since it additionally requires a solution in real-time. Both DS problems are computationally complex. For large-scale networks, the usual problem formulation has thousands of constraint equations. The node-depth encoding (NDE) enables a modeling of DSs problems that eliminates several constraint equations from the usual formulation, making the problem solution simpler. On the other hand, a multiobjective evolutionary algorithm (EA) based on subpopulation tables adequately models several objectives and constraints, enabling a better exploration of the search space. The combination of the multiobjective EA with NDE (MEAN) results in the proposed approach for solving DSs problems for large-scale networks. Simulation results have shown the MEAN is able to find adequate restoration plans for a real DS with 3860 buses and 632 switches in a running time of 0.68 s. Moreover, the MEAN has shown a sublinear running time in function of the system size. Tests with networks ranging from 632 to 5166 switches indicate that the MEAN can find network configurations corresponding to a power loss reduction of 27.64% for very large networks requiring relatively low running time.

An algorithm for computerized automatic tuning of power system stabilizers

The main objective of this paper is to relieve the power system engineers from the burden of the complex and time-consuming process of power system stabilizer (PSS) tuning. To achieve this goal, the paper proposes an automatic process for computerized tuning of PSSs, which is based on an iterative process that uses a linear matrix inequality (LMI) solver to find the PSS parameters. It is shown in the paper that PSS tuning can be written as a search problem over a non-convex feasible set. The proposed algorithm solves this feasibility problem using an iterative LMI approach and a suitable initial condition, corresponding to a PSS designed for nominal operating conditions only (which is a quite simple task, since the required phase compensation is uniquely defined). Some knowledge about the PSS tuning is also incorporated in the algorithm through the specification of bounds defining the allowable PSS parameters. The application of the proposed algorithm to a benchmark test system and the nonlinear simulation of the resulting closed-loop models demonstrate the efficiency of this algorithm. (C) 2009 Elsevier Ltd. All rights reserved.