Fifteen generations of selection were conducted to study responses for litter size at birth (LSB), weight at weaning of standardized litter (LWW), and individual body weight at 8 wk of age (BW8) using golden hamsters as an experimental model for pigs. The experiment involved three lines: selection on an aggregate breeding value of LSB, LWW, and BW8 (line W); selection on an aggregate breeding v...

The first investigations on discrete lines are dated back to E.B. Christoffel (Chr75), A. Markoff (Mar82) and more recently to G.A. Hedlund and H. Morse (MH40) who introduced the terminology of sturmian sequences, for the ones defined on a two-letter alphabet and coding lines with irrational slope. These works gave the first theoretical framework for discrete lines. A sequence u ∈ {0, 1}N is st...

On-line chain partition is a two-player game between Spoiler and Algorithm. Spoiler presents, point by point, a partially ordered set. Algorithm assigns incoming points (immediately and irrevocably) to the chains which constitute a chain partition of the order. The value of the game for orders of width w is a minimum number val(w) such that Algorithm has a strategy using at most val(w) chains o...

For a string w over an alphabet Σ, we consider a composite data structure called the all-suffixes directed acyclic word graph (ASDAWG). ASDAWG(w) has |w| + 1 initial nodes, and the dag induced by all reachable nodes from the k-th initial node conforms with DAWG(w[k :]), where w[k :] denotes the k-th suffix of w. We prove that the size of the minimum ASDAWG(w) (MASDAWG(w)) is Θ(|w|) for |Σ| = 1,...

this study was conducted to investigate the effect of supplementation different levels of pomegranate seed pulp (psp) on performance and blood parameters in laying hens. a total of 96 layers hens (hy-line w-36) at 24 week of age were randomly assigned into 4 treatments including 0 (control), 5, 10 and 15% of psp, with 4 replicates containing 6 layers in each. results showed no significant effec...

We denote that set by A(z,w,k) and (following [1]) call it the Apollonius circle of constant k associated to the points z and w. The set A(z,w,k) is a circle for all values of k other than 1 when it is a line. In this paper, we consider z,w ∈ U, show that if z = w, then necessarily A(z,w, √ (1−|w|2)/(1−|z|2)) meets the unit circle twice, consider the arc on the unit circle with those endpoints,...

W e propose a coverage metric and a two-pass test generation method f o r path delay faults in combinational logic circuits. The coverage is measured f o r each line with a rising and a falling transition. However, the test criterion is different f r o m that of the slow-to-rise and slow-to-fall transition faults. The test, called “line delay test”, as a path delay test for the longest sensitiz...

Weinstein’s[2] brilliant short proof of de Branges’[1] theorem can be made yet much shorter(modulo routine calculations), completely elementary (modulo Löwner theory), self contained(no need for the esoteric Legendre polynomials’ addition theorem), and motivated(ditto), as follows. Replace the text between p. 62, line 7 and p. 63, line 7, by Fact 1 below, and the text between the last line of p...

The aim of this paper is to begin a study of the cohomology modules H(X(w),Lλ) for non-dominant weights λ on Schubert varieties X(w) in G/B. The aim is to set-up a combinatorial dictionary for describing the cohomology modules and give criteria for their vanishing. Here Lλ denotes the line bundle on X(w) corresponding to the 1-dimensional representation of B given by the character λ.