Extensions of discrete triangular distributions and boundary bias in kernel estimation for discrete functions

Asymmetric discrete triangular distributions are introduced in order to extend the symmetric ones serving for discrete associated kernels in the nonparametric estimation for discrete functions. The extension from one to two orders around the mode provides a large family of discrete distributions having a finite support. Establishing a bridge between Dirac and discrete uniform distributions, some different shapes are also obtained and their properties are investigated. In particular, the mean and variance are pointed out. Applications to discrete kernel estimators are given with a solution to a boundary bias problem. (C) 2010 Elsevier B.V. All rights reserved.

The generalized log-gamma mixture model with covariates: local influence and residual analysis

In a sample of censored survival times, the presence of an immune proportion of individuals who are not subject to death, failure or relapse, may be indicated by a relatively high number of individuals with large censored survival times. In this paper the generalized log-gamma model is modified for the possibility that long-term survivors may be present in the data. The model attempts to separately estimate the effects of covariates on the surviving fraction, that is, the proportion of the population for which the event never occurs. The logistic function is used for the regression model of the surviving fraction. Inference for the model parameters is considered via maximum likelihood. Some influence methods, such as the local influence and total local influence of an individual are derived, analyzed and discussed. Finally, a data set from the medical area is analyzed under the log-gamma generalized mixture model. A residual analysis is performed in order to select an appropriate model.

On estimation and influence diagnostics for zero-inflated negative binomial regression models

The zero-inflated negative binomial model is used to account for overdispersion detected in data that are initially analyzed under the zero-Inflated Poisson model A frequentist analysis a jackknife estimator and a non-parametric bootstrap for parameter estimation of zero-inflated negative binomial regression models are considered In addition an EM-type algorithm is developed for performing maximum likelihood estimation Then the appropriate matrices for assessing local influence on the parameter estimates under different perturbation schemes and some ways to perform global influence analysis are derived In order to study departures from the error assumption as well as the presence of outliers residual analysis based on the standardized Pearson residuals is discussed The relevance of the approach is illustrated with a real data set where It is shown that zero-inflated negative binomial regression models seems to fit the data better than the Poisson counterpart (C) 2010 Elsevier B V All rights reserved

Evaluation of algorithms used to order markers on genetic maps

When building genetic maps, it is necessary to choose from several marker ordering algorithms and criteria, and the choice is not always simple. In this study, we evaluate the efficiency of algorithms try (TRY), seriation (SER), rapid chain delineation (RCD), recombination counting and ordering (RECORD) and unidirectional growth (UG), as well as the criteria PARF (product of adjacent recombination fractions), SARF (sum of adjacent recombination fractions), SALOD (sum of adjacent LOD scores) and LHMC (likelihood through hidden Markov chains), used with the RIPPLE algorithm for error verification, in the construction of genetic linkage maps. A linkage map of a hypothetical diploid and monoecious plant species was simulated containing one linkage group and 21 markers with fixed distance of 3 cM between them. In all, 700 F(2) populations were randomly simulated with and 400 individuals with different combinations of dominant and co-dominant markers, as well as 10 and 20% of missing data. The simulations showed that, in the presence of co-dominant markers only, any combination of algorithm and criteria may be used, even for a reduced population size. In the case of a smaller proportion of dominant markers, any of the algorithms and criteria (except SALOD) investigated may be used. In the presence of high proportions of dominant markers and smaller samples (around 100), the probability of repulsion linkage increases between them and, in this case, use of the algorithms TRY and SER associated to RIPPLE with criterion LHMC would provide better results. Heredity (2009) 103, 494-502; doi:10.1038/hdy.2009.96; published online 29 July 2009

Atomic Latin squares of order eleven

A Latin square is pan-Hamiltonian if the permutation which defines row i relative to row j consists of a single cycle for every i j. A Latin square is atomic if all of its conjugates are pan-Hamiltonian. We give a complete enumeration of atomic squares for order 11, the smallest order for which there are examples distinct from the cyclic group. We find that there are seven main classes, including the three that were previously known. A perfect 1-factorization of a graph is a decomposition of that graph into matchings such that the union of any two matchings is a Hamiltonian cycle. Each pan-Hamiltonian Latin square of order n describes a perfect 1-factorization of Kn,n, and vice versa. Perfect 1-factorizations of Kn,n can be constructed from a perfect 1-factorization of Kn+1. Six of the seven main classes of atomic squares of order 11 can be obtained in this way. For each atomic square of order 11, we find the largest set of Mutually Orthogonal Latin Squares (MOLS) involving that square. We discuss algorithms for counting orthogonal mates, and discover the number of orthogonal mates possessed by the cyclic squares of orders up to 11 and by Parker's famous turn-square. We find that the number of atomic orthogonal mates possessed by a Latin square is not a main class invariant. We also define a new sort of Latin square, called a pairing square, which is mapped to its transpose by an involution acting on the symbols. We show that pairing squares are often orthogonal mates for symmetric Latin squares. Finally, we discover connections between our atomic squares and Franklin's diagonally cyclic self-orthogonal squares, and we correct a theorem of Longyear which uses tactical representations to identify self-orthogonal Latin squares in the same main class as a given Latin square.

Replacement of the natural Wolbachia symbiont of Drosophila simulans with a mosquito counterpart

Inherited rickettsial symbionts of the genus Wolbachia occur commonly in arthropods and have been implicated in the expression of parthenogenesis, feminization and cytoplasmic incompatibility phenomena in their respective hosts. Here we use purified Wolbachia from the Asian tiger mosquito, Aedes albopictus, to replace the natural infection of Drosophila simulans by means of embryonic microinjection techniques. The transferred Wolbachia infection behaves like a natural Drosophila infection with regard to its inheritance, cytoskeleton interactions and ability to induce incompatibility when crossed with uninfected flies. The transinfected flies are bidirectionally incompatible with all other naturally infected strains of Drosophila simulans, however, and as such represent a unique crossing type. The successful transfer of this symbiont between distantly related hosts suggests that it may be possible to introduce this agent experimentally into arthropod species of medical and agricultural importance in order to manipulate natural populations genetically.

Existence of Multiple Solutions for Second Order Boundary Value Problems

We give conditions on f involving pairs of lower and upper solutions which lead to the existence of at least three solutions of the two point boundary value problem y" + f(x, y, y') = 0, x epsilon [0, 1], y(0) = 0 = y(1). In the special case f(x, y, y') = f(y) greater than or equal to 0 we give growth conditions on f and apply our general result to show the existence of three positive solutions. We give an example showing this latter result is sharp. Our results extend those of Avery and of Lakshmikantham et al.

Fixed bed reactors with catalyst poisoning - first order kinetics.

The long performance of an isothermal fixed bed reactor undergoing catalyst poisoning is theoretically analyzed using the dispersion model. First order reaction with dth order deactivation is assumed and the model equations are solved by matched asymptotic expansions for large Peclet number. Simple closed-form solutions, uniformly valid in time, are obtained.

Protein fold recognition without Boltzmann statistics or explicit physical basis

We present a fast method for finding optimal parameters for a low-resolution (threading) force field intended to distinguish correct from incorrect folds for a given protein sequence. In contrast to other methods, the parameterization uses information from >10(7) misfolded structures as well as a set of native sequence-structure pairs. In addition to testing the resulting force field's performance on the protein sequence threading problem, results are shown that characterize the number of parameters necessary for effective structure recognition.

Critical sets for families of Latin squares

In this paper I give details of new constructions for critical sets in latin squares. These latin squares, of order n, are such that they can be partitioned into four subsquares each of which is based on the addition table of the integers module n/2, an isotopism of this or a conjugate.

Subcycling first- and second-order generalizations of the trapezoidal rule

Subcycling algorithms which employ multiple timesteps have been previously proposed for explicit direct integration of first- and second-order systems of equations arising in finite element analysis, as well as for integration using explicit/implicit partitions of a model. The author has recently extended this work to implicit/implicit multi-timestep partitions of both first- and second-order systems. In this paper, improved algorithms for multi-timestep implicit integration are introduced, that overcome some weaknesses of those proposed previously. In particular, in the second-order case, improved stability is obtained. Some of the energy conservation properties of the Newmark family of algorithms are shown to be preserved in the new multi-timestep extensions of the Newmark method. In the first-order case, the generalized trapezoidal rule is extended to multiple timesteps, in a simple way that permits an implicit/implicit partition. Explicit special cases of the present algorithms exist. These are compared to algorithms proposed previously. (C) 1998 John Wiley & Sons, Ltd.

Off-diagonal long-range order in a supersymmetric integrable model of correlated electrons

A new model for correlated electrons is presented which is integrable in one-dimension. The symmetry algebra of the model is the Lie superalgebra gl(2\1) which depends on a continuous free parameter. This symmetry algebra contains the eta pairing algebra as a subalgebra which is used to show that the model exhibits Off-Diagonal Long-Range Order in any number of dimensions.

Truncation errors in finite difference models for solute transport equation with first-order reaction

The truncation errors associated with finite difference solutions of the advection-dispersion equation with first-order reaction are formulated from a Taylor analysis. The error expressions are based on a general form of the corresponding difference equation and a temporally and spatially weighted parametric approach is used for differentiating among the various finite difference schemes. The numerical truncation errors are defined using Peclet and Courant numbers and a new Sink/Source dimensionless number. It is shown that all of the finite difference schemes suffer from truncation errors. Tn particular it is shown that the Crank-Nicolson approximation scheme does not have second order accuracy for this case. The effects of these truncation errors on the solution of an advection-dispersion equation with a first order reaction term are demonstrated by comparison with an analytical solution. The results show that these errors are not negligible and that correcting the finite difference scheme for them results in a more accurate solution. (C) 1999 Elsevier Science B.V. All rights reserved.

New integrable model of correlated electrons with off-diagonal long-range order from so(5) symmetry

We present a new integrable model for correlated electrons which is based on so(5) symmetry. By using an eta-pairing realization we construct eigenstates of the Hamiltonian with off-diagonal long-range order. It is also shown that these states lie in the ground state sector. We exactly solve the model on a one-dimensional lattice by the Bethe ansatz.