Absence of Cooper-type bound states in three- and few-electron systems

It is shown that the appearance of a fixed-point singularity in the kernel of the two-electron Cooper problem is responsible for the formation of the Cooper pair for an arbitrarily weak attractive interaction between two electrons. This singularity is absent in the problem of three and few superconducting electrons at zero temperature on the full Fermi sea. Consequently, such three- and few-electron systems on the full Fermi sea do not form Cooper-type bound states for an arbitrarily weak attractive pair interaction.

Nucleon-nucleon interaction: Central potential and pion production

We show that the tail of the chiral two-pion exchange nucleon-nucleon potential is proportional to the pion-nucleon (πN) scalar form factor and discuss how it can be translated into effective scalar meson interactions. We then construct a kernel for the process NN → πNN, due to the exchange of two pions, which may be used in either three-body forces or pion production in NN scattering. Our final expression involves a partial cancellation among three terms, due to chiral symmetry, but the net result is still important. We also find that, at large internucleon distances, the kernel has the same spatial dependence as the central NN potential and we produce expressions relating these processes directly.

Nonnegative trigonometric polynomials

An extremal problem for the coefficients of sine polynomials, which are nonnegative in [0,π] , posed and discussed by Rogosinski and Szego is under consideration. An analog of the Fejér-Riesz representation of nonnegative general trigonometric and cosine polynomials is proved for nonnegative sine polynomials. Various extremal sine polynomials for the problem of Rogosinski and Szego are obtained explicitly. Associated cosine polynomials k n (θ) are constructed in such a way that { k n (θ) } are summability kernels. Thus, the L p , pointwise and almost everywhere convergence of the corresponding convolutions, is established. © 2002 Springer-Verlag New York Inc.

An extremal nonnegative sine polynomial

For any positive integer n, the sine polynomials that are nonnegative in [0, π] and which have the maximal derivative at the origin are determined in an explicit form. Associated cosine polynomials Kn (θ) are constructed in such a way that {Kn(θ)} is a summability kernel. Thus, for each Pi 1 ≤ P ≤ ∞ and for any 27π-periodic function f ∈ Lp [-π, π], the sequence of convolutions Kn * f is proved to converge to f in Lp[-ππ]. The pointwise and almost everywhere convergences are also consequences of our construction.

An environment for knowledge discovery in biology

This paper describes a data mining environment for knowledge discovery in bioinformatics applications. The system has a generic kernel that implements the mining functions to be applied to input primary databases, with a warehouse architecture, of biomedical information. Both supervised and unsupervised classification can be implemented within the kernel and applied to data extracted from the primary database, with the results being suitably stored in a complex object database for knowledge discovery. The kernel also includes a specific high-performance library that allows designing and applying the mining functions in parallel machines. The experimental results obtained by the application of the kernel functions are reported. © 2003 Elsevier Ltd. All rights reserved.

Remarks on the normal bordism forgetful homomorphism

Assume that X is an oriented smooth (n+k)-manifold. Then the kernel of the forgetful map F considered in this work consists of immersions f: Mn → X nullbordant as a continuous map. Using an exact sequence of normal bordism groups previously given, we present a homological characterization of the kernel of the forgetful map F. Also, we prove that Ωi(X, εs - ηs and Hi(X,Z) are -isomorphic for i≤3 and C2-isomorphic for i≤2, where C2,3 (resp. C2 is the class of abelian groups whose elements have order 2p. 3q (resp. 2p), and ηs is an orientable stable vector bundle over X. © 2009 Pushpa Publishing House.

Fast automatic microstructural segmentation of ferrous alloy samples using optimum-path forest

In this work we propose a novel automatic cast iron segmentation approach based on the Optimum-Path Forest classifier (OPF). Microscopic images from nodular, gray and malleable cast irons are segmented using OPF, and Support Vector Machines (SVM) with Radial Basis Function and SVM without kernel mapping. Results show accurate and fast segmented images, in which OPF outperformed SVMs. Our work is the first into applying OPF for automatic cast iron segmentation. © 2010 Springer-Verlag.

Solution of two-body bound state problems with confining potentials

The homogeneous Lippmann-Schwinger integral equation is solved in momentum space by using confining potentials. Since the confining potentials are unbounded at large distances, they lead to a singularity at small momentum. In order to remove the singularity of the kernel of the integral equation, a regularized form of the potentials is used. As an application of the method, the mass spectra of heavy quarkonia, mesons consisting from heavy quark and antiquark (Υ(bb̄), ψ(cc̄)), are calculated for linear and quadratic confining potentials. The results are in good agreement with configuration space and experimental results. © 2010 American Institute of Physics.

Parkinson's disease identification through Optimum-Path Forest

Artificial intelligence techniques have been extensively used for the identification of several disorders related with the voice signal analysis, such as Parkinson's disease (PD). However, some of these techniques flaw by assuming some separability in the original feature space or even so in the one induced by a kernel mapping. In this paper we propose the PD automatic recognition by means of Optimum-Path Forest (OPF), which is a new recently developed pattern recognition technique that does not assume any shape/separability of the classes/feature space. The experiments showed that OPF outperformed Support Vector Machines, Artificial Neural Networks and other commonly used supervised classification techniques for PD identification. © 2010 IEEE.

Proximate composition of guariroba (Syagrus oleracea), jerivá (Syagrus romanzoffiana) and macaúba (Acrocomia aculeata) palm fruits

This study aimed to characterize the pulp and kernel of guariroba (Syagrus oleracea), jerivá (Syagrus romanzoffiana) and macaúba (Acrocomia aculeata) palm fruits, through their proximate composition, carotenoids contents and tocopherol composition. The three kernels showed to be composed mainly of lipids and proteins, as the three pulps, of carbohydrate and fiber. In the kernels the levels of lipids ranged from 45.17 to 56.37% and proteins from 15.46 to 28.61%. In the pulps the total fiber content ranged from 20.26 to 26.98%. The pulps also presented a significant amount of ash, which represents a significant mineral content, especially in the guariroba (5.16%). Moreover, the pulp oils showed higher carotenoids and tocopherol contents. The jerivá pulp oil contained carotenoid and tocopherol on average 1219 μg/g and 323.50. mg/kg, respectively. The consumption of the whole fruit, pulp, and kernel supplies important quantities of many necessary nutrients for human diet, including vitamins A and E. © 2011 Elsevier Ltd.

A logical approach to the management of object identifiers in non-conventional database management systems

Non-conventional database management systems are used to achieve a better performance when dealing with complex data. One fundamental concept of these systems is object identity (OID), because each object in the database has a unique identifier that is used to access and reference it in relationships to other objects. Two approaches can be used for the implementation of OIDs: physical or logical OIDs. In order to manage complex data, was proposed the Multimedia Data Manager Kernel (NuGeM) that uses a logical technique, named Indirect Mapping. This paper proposes an improvement to the technique used by NuGeM, whose original contribution is management of OIDs with a fewer number of disc accesses and less processing, thus reducing management time from the pages and eliminating the problem with exhaustion of OIDs. Also, the technique presented here can be applied to others OODBMSs. © 2011 IEEE.

Multivariate sobolev-type orthogonal polynomials

Multivariate orthogonal polynomials associated with a Sobolev-type inner product, that is, an inner product defined by adding to a measure the evaluation of the gradients in a fixed point, are studied. Orthogonal polynomials and kernel functions associated with this new inner product can be explicitly expressed in terms of those corresponding with the original measure. We apply our results to the particular case of the classical orthogonal polynomials on the unit ball, and we obtain the asymptotics of the kernel functions. © 2011 Universidad de Jaén.

First telemetry study of bush dogs: Home range, activity and habitat selection

Context The bush dog (Speothos venaticus) is difficult to observe, capture, and study. To date, indirect evidence and opportunistic field observations have been the primary sources of information about the species' ecology. Field data are urgently needed to clarify the species' ecological requirements, behaviour and movement patterns. Aims The present study uses 13 months of telemetry data from a group of bush dogs to begin to address questions about area requirements, habitat preferences and movement patterns of this difficult-to-study species. Methods We tracked a group of bush dogs (two adults, one juvenile, four young) in an area of intact and altered Cerrado (woodlandsavanna biome) in eastern Mato Grosso, Brazil (Nova Xavantina District). Key results The group had a total home range of 140km2 (fixed kernel 95%), with smaller seasonal 'subareas' (areas used for 12 months before moving to another area, with repetition of some areas over time) and demonstrated a preference for native habitats. Conclusions The bush dog's home range is greater than that of other canids of the same size, even correcting for group size. Patterns of seasonal movement are also different from what has been observed in other South American canids. Implications From our observations in the Brazilian savanna, bush dogs need large tracks of native habitat for their long-term persistence. Although the present study is based on a single pack, it is highly relevant for bush dog conservation because it provides novel information on the species' spatial requirements and habitat preferences. © 2012 CSIRO.

Automatic landslide recognition through Optimum-Path Forest

In this paper we shed light over the problem of landslide automatic recognition using supervised classification, and we also introduced the OPF classifier in this context. We employed two images acquired from Geoeye-MS satellite at March-2010 in the northwest (high steep areas) and north sides (pipeline area) covering the area of Duque de Caxias city, Rio de Janeiro State, Brazil. The landslide recognition rate has been assessed through a cross-validation with 10 runnings. In regard to the classifiers, we have used OPF against SVM with Radial Basis Function for kernel mapping and a Bayesian classifier. We can conclude that OPF, Bayes and SVM achieved high recognition rates, being OPF the fastest approach. © 2012 IEEE.

Managing object identity with less I/O operations

Non-conventional database management systems are used to achieve a better performance when dealing with complex data. One fundamental concept of these systems is object identity (OID). Two techniques can be used for the implementation of OIDs: physical or logical. A logical implementation of OIDs, based on an Indirection Table, is used by NuGeM, a multimedia data manager kernel which is described in this paper. NuGeM Indirection Table allows the relocation of all pages in a database. The proposed strategy modifies the workings of this table so that it is possible to reduce considerably the number of I/O operations during the request and release of pages containing objects and their OIDs. Tests show a reduction of 84% in reading operations and a 67% reduction in writing operations when pages are requested. Although no changes were observed in writing operations during the release of pages, a 100% of reduction in reading operations was obtained. © 2012 IEEE.