Sensitive targeted multiple protein quantification based on elemental detection of Quantum Dots

A generic strategy based on the use of CdSe/ZnS Quantum Dots (QDs) as elemental labels for protein quantification, using immunoassays with elemental mass spectrometry (ICP-MS), detection is presented. In this strategy, streptavidin modified QDs (QDs-SA) are bioconjugated to a biotinylated secondary antibody (b-Ab₂). After a multi-technique characterization of the synthesized generic platform (QDs-SA-b-Ab₂) it was applied to the sequential quantification of five proteins (transferrin, complement C3, apolipoprotein A1, transthyretin and apolipoprotein A4) at different concentration levels in human serum samples. It is shown how this generic strategy does only require the appropriate unlabeled primary antibody for each protein to be detected. Therefore, it introduces a way out to the need for the cumbersome and specific bioconjugation of the QDs to the corresponding specific recognition antibody for every target analyte (protein). Results obtained were validated with those obtained using UV–vis spectrophotometry and commercial ELISA Kits.     

A Genetic Search for Exploiting a Fuzzy Preference Model of Portfolio Problems with Public Projects

When an organization solves a portfolio problem with public projects evaluated by multiple criteria, in which the economic dimension is not essential or not well characterized, the classical methods are not useful. We propose a non-linear preference model developed from normative Value Theory and using fuzzy sets to model some sources of imprecision. This model can be considered as a generalization of the classical approaches. However, the optimization problem is very complex in order to be solved with non-linear programming techniques. Therefore, the model is exploited by an evolutionary algorithm, able to achieve a strong improvement of the quality of solution.     

Affine Arithmetic: Concepts and Applications

Affine arithmetic is a model for self-validated numerical computation that keeps track of first-order correlations between computed and input quantities. We explain the main concepts in affine arithmetic and how it handles the dependency problem in standard interval arithmetic. We also describe some of its applications.     

Order conditions for linearly implicit fractional step Runge Kutta methods

^{In this paper, we study the consistency of a variant of fractionalstep Runge–Kutta methods. These methods are designed tointegrate efficiently semi-linear multidimensional parabolicproblems by means of linearly implicit time integration processes.Such time discretization procedures are also related to a splittingof the space differential operator (or the spatial discretizationof it) as a sum of ‘simpler’ linear differentialoperators and a nonlinear term.}     

Lattices contained in planar orders are planar

The covering graph of a lattice which is contained in an ordered set with a planar covering graph is itself planar.Presented by R. W. Quackenbush.     

Local solution for the Kadomtsev-Petviashvili equation with periodic conditions

In this article we prove a local existence and uniqueness theorem for the Kadomtsev-Petviashvili Equation (u _t +u _xxx +uu _x ) _x −u _yy =0) in the Sobolev spaces of orders≥3, with initial values in the same spaces, and periodic boundary conditions. This theorem improves previous results based upon the application of singular perturbation techniques.     

Point-to-Periodic and Periodic-to-Periodic Connections

In this work we consider computing and continuing connecting orbits in parameter dependent dynamical systems. We give details of algorithms for computing connections between equilibria and periodic orbits, and between periodic orbits. The theoretical foundation for these techniques is given by the seminal work of Beyn in 1994, “On well-posed problems for connecting orbits in dynamical systems”, where a numerical technique is also proposed. Our algorithms consist of splitting the computation of the connection from that of the periodic orbit(s). To set up appropriate boundary conditions, we follow the algorithmic approach used by Demmel, Dieci, and Friedman, for the case of connecting orbits between equilibria, and we construct and exploit the smooth block Schur decomposition of the monodromy matrices associated to the periodic orbits. Numerical examples illustrate the performance of the algorithms. This revised version was published online in July 2006 with corrections to the Cover Date.     

An approximation property of harmonic functions in Lipschitz domains and some of its consequences

An extension of an inequality of J. B. Garnett (1979), with improvements by B. E. J. Dahlberg (1980), on an approximation property of harmonic functions is proved. The weighted inequality proved here was suggested by the work of J. Pipher (1993) and it implies an extension of a result of S. Y. A. Chang, J. Wilson and T. Wolff (1985) and C. Sweezy (1991) on exponential square integrability of the boundary values of solutions to second-order linear differential equations in divergence form. This implies a solution of a problem left open by R. Bañuelos and C. N. Moore (1989) on sharp estimates for the area integral of harmonic functions in Lipschitz domains.