Confirmation of QTL mapping and marker validation for partial seedling resistance to crown rot in wheat line '2-49'

We have tested the efficacy of putative microsatellite single sequence repeat (SSR) markers, previously identified in a 2-49 (Gluyas Early/Gala) × Janz doubled haploid wheat (Triticum aestivum) population, as being linked to partial seedling resistance to crown rot disease caused by Fusarium pseudograminearum. The quantitative trait loci (QTLs) delineated by these markers have been tested for linkage to resistance in an independent Gluyas Early × Janz doubled haploid population. The presence of a major QTL on chromosome 1DL (QCr.usq-1D1) and a minor QTL on chromosome 2BS (QCr.usq-2B1) was confirmed. However, a putative minor QTL on chromosome 2A was not confirmed. The QTL on 1D was inherited from Gluyas Early, a direct parent of 2-49, whereas the 2B QTL was inherited from Janz. Three other putative QTLs identified in 2-49 × Janz (on 1AL, 4BL, and 7BS) were inherited by 2-49 from Gala and were not able to be confirmed in this study. The screening of SSR markers on a small sample of elite wheat genotypes indicated that not all of the most tightly linked SSR markers flanking the major QTLs on 1D and 1A were polymorphic in all backgrounds, indicating the need for additional flanking markers when backcrossing into some elite pedigrees. Comparison of SSR haplotypes with those of other genotypes exhibiting partial crown rot resistance suggests that additional, novel sources of crown rot resistance are available.

A note on acyclic edge coloring of complete bipartite graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (2-colored) cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). Let Delta = Delta(G) denote the maximum degree of a vertex in a graph G. A complete bipartite graph with n vertices on each side is denoted by K-n,K-n. Alon, McDiarmid and Reed observed that a'(K-p-1,K-p-1) = p for every prime p. In this paper we prove that a'(K-p,K-p) <= p + 2 = Delta + 2 when p is prime. Basavaraju, Chandran and Kummini proved that a'(K-n,K-n) >= n + 2 = Delta + 2 when n is odd, which combined with our result implies that a'(K-p,K-p) = p + 2 = Delta + 2 when p is an odd prime. Moreover we show that if we remove any edge from K-p,K-p, the resulting graph is acyclically Delta + 1 = p + 1-edge-colorable. (C) 2009 Elsevier B.V. All rights reserved.

Surface acoustic waves of finite amplitude excited by a monochromatic line source

A technique for obtaining a uniformly valid solution to the problem of nonlinear propagation of surface acoustic waves excited by a monochromatic line source is presented. The method of solution is an extension of the method of strained coordinates wherein both the dependent and independent variables are expanded in perturbation series. A special transformation is proposed for the independent variables so as to make the expansions uniformly valid and also to satisfy all the boundary conditions. This perturbation procedure, carried out to the second order, yields a solution containing a second harmonic surface wave whose amplitude and phase exhibit an oscillatory variation along the direction of propagation. In addition, the solution also contains a second harmonic bulk wave of constant amplitude but varying phase propagating into the medium.

Acyclic Edge Coloring of Graphs with Maximum Degree 4

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Sudakov, and Zaks that for any simple and finite graph G, a'(G) <= Delta+2, where Delta=Delta(G) denotes the maximum degree of G. We prove the conjecture for connected graphs with Delta(G)<= 4, with the additional restriction that m <= 2n-1, where n is the number of vertices and m is the number of edges in G. Note that for any graph G, m <= 2n, when Delta(G)<= 4. It follows that for any graph G if Delta(G)<= 4, then a'(G) <= 7.

Evaluation of the most effective measures of infectivity of a precocious line of Eimeria acervulina in poultry

Coccidiosis is an economically important parasitic disease of chickens that, in Australia, is caused by seven species of the genus Eimeria.1 The disease has traditionally been controlled by prophylactic drugs, but vaccination with attenuated lines of the parasites2–4 is rapidly gaining acceptance world wide. Live Eimeria vaccines are produced in batches which are not frozen and have a limited shelf life. The per cent infectivity of vaccine seed stocks and the vaccines produced from them must therefore be accurately monitored using standardised dose dependant assays to ensure that shelf life, quality control and vaccine release specifications are met. Infectivity for the chicken host cannot readily be determined by microscopic observation of oocysts or sporocyst hatching.5 Dose dependent parameters such as body weight gain, feed conversion ratio, visual lesion scores, mortality, oocysts production, clinical symptoms and microscopic lesion counts could be used as measures of infectivity.6–11 These parameters show significant dose dependant effects with field strains, but lines of vaccine parasites that have been selected for precocious development with associated reduced virulence and reproductive capability may not have the same effect.3,4 The aim of this trial was to determine which parameters provide the most effective measures of infective dose in birds inoculated with a precocious vaccine strain.

Representation of functional dependencies in relational databases using linear graphs

Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) dependency relation, (2) equipotence relation, (3) dissidence relation, (4) completion relation, and dual relations of each of them are described. Any one of these eight relations can be used to represent the functional dependencies in a database. Results from linear graph theory are found helpful in obtaining these representations. The dependency relation directly gives the functional dependencies. The equipotence relation specifies the dependencies in terms of attribute sets which functionally determine each other. The dissidence relation specifies the dependencies in terms of saturated sets in a very indirect way. Completion relation represents the functional dependencies as a function, the range of which turns out to be a lattice. Depletion relation which is the dual of the completion relation can also represent functional dependencies and similarly can the duals of dependency, equipotence, and dissidence relations. The class of depleted sets, which is the dual of saturated sets, is defined and used in the study of depletion relations.

An On-Line Algorithm for the Location of Cross Point Faults in Programmable Logic Arrays

An on-line algorithm is developed for the location of single cross point faults in a PLA (FPLA). The main feature of the valgorithm is the determination of a fault set corresponding to the response obtained for a failed test. For the apparently small number of faults in this set, all other tests are generated and a fault table is formed. Subsequently, an adaptive procedure is used to diagnose the fault. Functional equivalence test is carried out to determine the actual fault class if the adaptive testing results in a set of faults with identical tests. The large amount of computation time and storage required in the determination, a priori, of all the fault equivalence classes or in the construction of a fault dictionary are not needed here. A brief study of functional equivalence among the cross point faults is also made.

An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V, E). The expected running time of our algorithm is (O) over tilde (mc) where vertical bar E vertical bar = m and c is the maximum u-v edge connectivity, where u, v is an element of V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n - 1; so the expected run-ning time of our algorithm for simple unweighted graphs is (O) over tilde (mn). All the algorithms currently known for constructing a Gomory-Hu tree [8, 9] use n - 1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest (O) over tilde (n(20/9)) max flow algorithm due to Karger and Levine[11] yields the current best running time of (O) over tilde (n(20/9)n) for Gomory-Hu tree construction on simple unweighted graphs with m edges and n vertices. Thus we present the first (O) over tilde (mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs. We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S subset of V can be reused for computing a minimum Steiner cut for certain Steiner sets S' subset of S.

On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts

A cut (A, B) (where B = V - A) in a graph G = (V, E) is called internal if and only if there exists a vertex x in A that is not adjacent to any vertex in B and there exists a vertex y is an element of B such that it is not adjacent to any vertex in A. In this paper, we present a theorem regarding the arrangement of cliques in a chordal graph with respect to its internal cuts. Our main result is that given any internal cut (A, B) in a chordal graph G, there exists a clique with kappa(G) + vertices (where kappa(G) is the vertex connectivity of G) such that it is (approximately) bisected by the cut (A, B). In fact we give a stronger result: For any internal cut (A, B) of a chordal graph, and for each i, 0 <= i <= kappa(G) + 1 such that vertical bar K-i vertical bar = kappa(G) + 1, vertical bar A boolean AND K-i vertical bar = i and vertical bar B boolean AND K-i vertical bar = kappa(G) + 1 - i. An immediate corollary of the above result is that the number of edges in any internal cut (of a chordal graph) should be Omega(k(2)), where kappa(G) = k. Prompted by this observation, we investigate the size of internal cuts in terms of the vertex connectivity of the chordal graphs. As a corollary, we show that in chordal graphs, if the edge connectivity is strictly less than the minimum degree, then the size of the mincut is at least kappa(G)(kappa(G)+1)/2 where kappa(G) denotes the vertex connectivity. In contrast, in a general graph the size of the mincut can be equal to kappa(G). This result is tight.

Transversely isotropic infinite cylindrical shell subjected to a radial axisymmetric line load

The problem of an infinite transversely isotropic circular cylindrical shell subjected to an axisymmetric radial external line load is investigated using elasticity theory, classical shell theory and shear deformation theory. The results obtained by these methods are compared for two ratios of inner to outer shell radius and for varying degrees of anisotropy. Some typical results are given here to show the effect of anisotropy and the thickness of the shell on the distribution of stresses and displacements.

Where do consumers draw the line? Factors informing perceptions and justifications of deviant consumer behaviour

Deviant consumer behaviour in the marketplace is an ongoing problem causing harm to the organisation, employees, and other consumers. To address this problem, this study explores consumer perceptions of right and wrong using the novel concept of a deviance threshold – the mental line in the sand dictating right and wrong. Using consumer-based interviews with a card-sort activity, findings supported and extended dimensions proposed to explain why some behaviours are perceived as more serious or unethical than others. Moreover, why specific neutralisation techniques are used and how they affect categorisations of behaviours within an individual’s deviance threshold is explained. This study offers alternative strategies tailored to challenging consumer justifications to curb deviance. Implications support abandoning the universal approach to deterrence.

Application of Haar functions for transmission line and transformer differential protection

The development of algorithms, based on Haar functions, for extracting the desired frequency components from transient power-system relaying signals is presented. The applications of these algorithms to impedance detection in transmission line protection and to harmonic restraint in transformer differential protection are discussed. For transmission line protection, three modes of application of the Haar algorithms are described: a full-cycle window algorithm, an approximate full-cycle window algorithm, and a half-cycle window algorithm. For power transformer differential protection, the combined second and fifth harmonic magnitude of the differential current is compared with that of fundamental to arrive at a trip decision. The proposed line protection algorithms are evaluated, under different fault conditions, using realistic relaying signals obtained from transient analysis conducted on a model 400 kV, 3-phase system. The transformer differential protection algorithms are also evaluated using a variety of simulated inrush and internal fault signals.

An improved technique for estimating short-term survival of released line-caught fish, and an application comparing barotrauma-relief methods in red emperor (Lutjanus sebae Cuvier 1816).

Promotion of better procedures for releasing undersize fish, advocacy of catch-and-release angling, and changing minimum legal sizes are increasingly being used as tools for sustainable management of fish stocks. However without knowing the proportion of released fish that survive, the conservation value of any of these measures is uncertain. We developed a floating vertical enclosure to estimate short-term survival of released line-caught tropical and subtropical reef-associated species, and used it to compare the effectiveness of two barotrauma-relief procedures (venting and shotline releasing) on red emperor (Lutjanus sebae). Barotrauma signs varied with capture depth, but not with the size of the fish. Fish from the greatest depths (40-52 m) exhibited extreme signs less frequently than did those from intermediate depths (30-40 m), possibly as a result of swim bladder gas being vented externally through a rupture in the body wall. All but two fish survived the experiment, and as neither release technique significantly improved short-term survival of the red emperor over non-treatment we see little benefit in promoting either venting or shotline releasing for this comparatively resilient species. Floating vertical enclosures can improve short-term post-release mortality estimates as they overcome many problems encountered when constraining fish in submerged cages.

Assessing the effects of line capture and barotrauma relief procedures on post-release survival of key tropical reef fish species in Australia using recreational tagging clubs.

Common coral trout, Plectropomus leopardus Lacepede, crimson snapper, Lutjanus erythropterus Bloch, saddletail snapper, Lutjanus malabaricus (Bloch & Schneider), red emperor, Lutjanus sebae (Cuvier), redthroat emperor, Lethrinus miniatus (Schneider) and grass emperor, Lethrinus laticaudis Alleyne & Macleay, were tagged to determine the effects of barotrauma relief procedures (weighted shot-line release and venting using a hollow needle) and other factors on survival. Release condition was the most significant factor affecting the subsequent recapture rate of all species. Capture depth was significant in all species apart from L. malabaricus and L. miniatus, the general trend being reduced recapture probability with increasing capture depth. Recapture rates of fish hooked in either the lip or mouth were generally significantly higher than for those hooked in the throat or gut. Statistically significant benefit from treating fish for barotrauma was found in only L. malabaricus, but the lack of any negative effects of treating fish indicated that the practices of venting and shot-lining should not be discouraged by fisheries managers for these species.