using monthly test day records the genetic parameters of iranian holstein cattle in first lactation were studied. data of 277400 test-day milk records from 65320 cows and 2210 sires were analyzed by an animal random regression model using restricted maximum likelihood methodology. the model included herd-test-date, interaction between year-season of calving, days in milk (linear and quadratic) ...

We consider a directed acyclic network where all the terminals demand the sum of the symbols generated at all the sources. We call such a network as a sum-network. We show that there exists a solvably (linear solvably) equivalent sum-network for any multiple-unicast network (and more generally, for any acyclic directed network where each terminal node demands a subset of the symbols generated a...

The library fast polynomial for Sage compiles multivariate polynomials for subsequent fast evaluation. Several evaluation schemes are handled, such as Hörner, divide and conquer and new ones can be added easily. Notably, a new scheme is introduced that improves the classical divide and conquer scheme when the number of terms is not a pure power of two. Natively, the library handles polynomials ...

the low earth orbiting (leo) satellites are widely used for geosciences applications. for most applications, precise orbital information of the satellites is required. a combination of the in suite observations and dynamic orbit yields the optimum solution. in order to obtain the combined optimal solution, one needs to analytically or numerically propagate the state vector epoch by an epoch bas...

the edge detour index polynomials were recently introduced for computing theedge detour indices. in this paper we nd relations among edge detour polynomials for the2-dimensional graph of tuc4c8(s) in a euclidean plane and tuc4c8(s) nanotorus.

We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary complex poles outside [−1, 1]. This algorithm is based on the derivation of explicit expressions for the Chebyshev (para-)orthogonal rational functions.

Babson and Steingŕımsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider n-permutations that avoid the generalized pattern 1-32 and whose k rightmost letters form an increasing subword. The number of such permutations is a linear combination of Bell numbers. We find a bijection between...

The principal aim of this paper is to serve the numerical solution of an integral-algebraic equation (IAE) by using the Bernoulli polynomials and the residual correction method. After implementation of our scheme, the main problem would be transformed into a system of algebraic equations such that its solutions are the unknown Bernoulli coefficients. This method gives an analytic solution when ...

—An explicit formula for the Fourier coef cients of the Legendre polynomials can be found in the Bateman Manuscript Project. However, formulas for more general classes of orthogonal polynomials do not appear to have been worked out. Here we derive explicit formulas for the Fourier series of Gegenbauer, Jacobi, Laguerre and Hermite polynomials. The methods described here apply in principle to an...

We introduce an FFT-based solver for the combinatorial continuous maximum flow discretization applied to computing minimum cut through heterogeneous microstructures. Recently, computational methods were introduced effective crack energy of periodic and random media. These based on cut-maximum duality G. Strang, made use discretizations trigonometric polynomials finite elements. For problems gra...