Search

Intended to furnish continuing assistance to adviser, staff, and printer, and written from their point of view, this guidebook in yearbook journalism emphasizes fundamentals but also encourages experimentation and creativity. The book is intended to provide self-help for the inexperienced adviser, furnish a quick review or refresher course for the experienced adviser and trained staff, and act as a practical guide for all staff members. It includes sections on themes, content and coverage, the dummy, layout, use of color, copy writing, photos and photography, the production process, advertising, budgeting, staff responsibility, the printer's role, and the functions of a yearbook adviser. Extensive examples are provided in most sections. A bibliography and references are also included. (TO)

The shallow water equations are widely used in ocean and hydraulic engineering to model flows in rivers, reservoirs, or coastal areas, among others. These equations constitute a hyperbolic system of conservation laws with a source term due to the bottom topography. [ABSTRACT FROM AUTHOR]

Climatic change, a global environmental problem particularly affecting agriculture and the natural environment, is now seen to be associated with an increase in the frequency and intensity of climatic anomalies. Weather extremes in Hungary have included droughts in the 1980s, hot, dry summers in 2001-2003, and excessive rainfall in 2004 and 2005 Research on the effect of climate extremes on the biomass, yield and abiotic stress tolerance of wheat has been done in the phytotron of the Agricultural Research Institute in Martonvásár. Studies on the frost resistance, heat tolerance and drought tolerance of wheat varieties with various genetic backgrounds were made when grown under normal and increased atmospheric CO2concentrations and at various nutrient supply levels. The following conclusions were drawn from the results [ABSTRACT FROM AUTHOR]

Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph parameter thicknessθ(G). By restricting the edges to be straight, we obtain the geometric thickness. By further restricting the vertices to be in convex position, we obtain the book thickness. This paper studies the relationship between these parameters and the treewidth of G. Let / / denote the maximum thickness / geometric thickness / book thickness of a graph with treewidth at most k. We prove that: - , and - for k≤2, and for k≥3. The first result says that the lower bound for thickness can be matched by an upper bound, even in the more restrictive geometric setting. The second result disproves the conjecture of Ganley and Heath [Discrete Appl. Math. 2001] that for all k. Analogous results are proved for outerthickness, arboricity, and star-arboricity. [ABSTRACT FROM AUTHOR]

Introduction of exogenous DNA into Caenorhabditis elegans is important for examining the expression of altered or reporter gene constructs, rescuing mutant genes, and studying gene function in vivo. Until recently, germ-line injection was the most commonly used method for transforming C. elegans strains. This chapter describes four different microparticle bombardment methods used to transform C. elegans with exogenous DNA. We include a discussion of the advantages and disadvantages of using micro-particle bombardment for transformation, list cotransformation markers that have been used successfully in microparticle bombardment experiments, and discuss transformation efficiency. [ABSTRACT FROM AUTHOR]

We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large' induced subgraph H, where H has treewidth at most t and every vertex in H has degree at most d in G. The order of H depends on t, k, d, and the order of G. With t = k, we obtain large sets of bounded degree vertices. With t = 0, we obtain large independent sets of bounded degree. In both these cases, our bounds on the order of H are tight. For bounded degree independent sets in trees, we characterise the extremal graphs. Finally, we prove that an interval graph with maximum clique size k has a maximum independent set in which every vertex has degree at most 2k. [ABSTRACT FROM AUTHOR]

A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering. A k-track layout of a graph consists of a vertex k-colouring, and a total order of each vertex colour class, such that between each pair of colour classes no two edges cross. The stack-number (respectively, queue-number, track-number) of a graph G, denoted by (, ), is the minimum k such that G has a k-stack (k-queue, k-track) layout. This paper studies stack, queue, and track layouts of graph subdivisions. It is known that every graph has a 3-stack subdivision. The best known upper bound on the number of division vertices per edge in a 3-stack subdivision of an n-vertex graph G is improved from to . This result reduces the question of whether queue-number is bounded by stack-number to whether 3-stack graphs have bounded queue number. It is proved that every graph has a 2-queue subdivision, a 4-track subdivision, and a mixed 1-stack 1-queue subdivision. All these values are optimal for every non-planar graph. In addition, we characterise those graphs with k-stack, k-queue, and k-track subdivisions, for all values of k. The number of division vertices per edge in the case of 2-queue and 4-track subdivisions, namely , is optimal to within a constant factor, for every graph G. Applications to 3D polyline grid drawings are presented. For example, it is proved that every graph G has a 3D polyline grid drawing with the vertices on a rectangular prism, and with bends per edge. [ABSTRACT FROM AUTHOR]

We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 5n/2 segments and at most 2n slopes, and that every cubic 3-connected plane graph has a plane drawing with three slopes (and three bends on the outerface). Drawings of non-planar graphs with few slopes are also considered. For example, it is proved that graphs of bounded degree and bounded treewidth have drawings with slopes. [ABSTRACT FROM AUTHOR]

Human progesterone receptor (PR) is a member of the nuclear hormone receptor superfamily of transcriptional activators, which share a common modular structure consisting of a C-terminal ligand-binding domain (LBD), a highly conserved and centrally located DNA-binding domain (DBD), and a poorly characterized N-terminal domain that is required for maximal transcriptional activity (1,2) Human PR is expressed as two proteins from a single gene by alternate use of two promoters: PR-A, which is missing the first 164 amino acids in the N-terminus, and full-length PR-B (3). [ABSTRACT FROM AUTHOR]