Optimal irrigation depth for bean crops considering water constraints and farmer`s risk aversion level

Nowadays, the rising competition for the use of water and environmental resources with consequent restrictions for farmers should change the paradigm in terms of irrigation concepts, or rather, in order to attain economical efficiency other than to supply water requirement for the crop. Therefore, taking into account the social and economical role of bean activity in Brazil, as well as the risk inherent to crop due to its high sensibility to both deficit and excessive water, the optimization methods regarding to irrigation management have become more interesting and essential. This study intends to present a way to determine the optimal water supply, considering different combinations between desired bean yield and level of risk, bringing as a result a graph with the former associated with the latter, depending on different water depths.

Canonical discriminant analysis applied to broiler chicken performance

The mechanisms involved in the control of growth in chickens are too complex to be explained only under univariate analysis because all related traits are biologically correlated. Therefore, we evaluated broiler chicken performance under a multivariate approach, using the canonical discriminant analysis. A total of 1920 chicks from eight treatments, defined as the combination of four broiler chicken strains (Arbor Acres, AgRoss 308, Cobb 500 and RX) from both sexes, were housed in 48 pens. Average feed intake, average live weight, feed conversion and carcass, breast and leg weights were obtained for days 1 to 42. Canonical discriminant analysis was implemented by SAS((R)) CANDISC procedure and differences between treatments were obtained by the F-test (P < 0.05) over the squared Mahalanobis` distances. Multivariate performance from all treatments could be easily visualised because one graph was obtained from two first canonical variables, which explained 96.49% of total variation, using a SAS((R)) CONELIP macro. A clear distinction between sexes was found, where males were better than females. Also between strains, Arbor Acres, AgRoss 308 and Cobb 500 (commercial) were better than RX (experimental), Evaluation of broiler chicken performance was facilitated by the fact that the six original traits were reduced to only two canonical variables. Average live weight and carcass weight (first canonical variable) were the most important traits to discriminate treatments. The contrast between average feed intake and average live weight plus feed conversion (second canonical variable) were used to classify them. We suggest analysing performance data sets using canonical discriminant analysis.

Winter-feeding systems for gestating sheep II. Effects on feedlot performance, glucose tolerance, and carcass composition of lamb progeny

Mature pregnant crossbred ewes (n = 90) were used in a randomized complete block design experiment and were assigned to 1 of 3 winter-feeding systems differing in primary feed source: haylage (HL), limit-fed corn (CN), or limit-fed dried distillers grains (DDGS). Effects of these winter-feeding strategies on postweaning progeny performance were determined. Lamb progeny (n = 96) were weaned at 61 +/- 4 d of age and fed a common high-concentrate diet. Lambs were assigned to feedlot pen (n = 18) based on dam mid-gestation pen. Growth rate, DMI, and ADG were determined for the first 40 d of the finishing period. At 96 +/- 4 d of age, 1 wether lamb was randomly selected from each pen (n = 18) for a glucose tolerance test. The experiment was terminated, and lambs were slaughtered individually when they were determined to have achieved 0.6-cm 12th-rib fat thickness. After a 24-h chill, carcass data were collected and a 2.54-cm chop was removed from each lamb from the LM posterior to the 12th rib for ether extract analysis. Additional carcass measurements of bone, muscle, and fat from the shoulder, rack, loin, and leg were collected on 35 carcasses. At weaning, lamb BW was not different among treatments, whereas final BW tended to be greater (P = 0.09) for lambs from ewes fed DDGS and CN during gestation than from those fed HL. Overall lamb growth rate from birth to slaughter was not different among treatments. Lambs from ewes fed DDGS vs. CN or HL tended to have a greater initial insulin response (P = 0.09). Dressing percent was less (P = 0.04) in lambs from ewes fed DDGS, but no difference (P = 0.16) was detected in HCW among treatments. As expected, 12th rib fat thickness was similar among treatments, whereas LM area was largest to smallest (P = 0.05) in lambs from ewes fed CN, HL, and DDGS, respectively. Proportion of internal fat tended to be greatest to smallest (P = 0.06) in lambs from ewes fed DDGS, CN, and HL, respectively. Calculated boneless trimmed retail cuts percentage was less (P = 0.04) in lambs from ewes fed DDGS than CN or HL. Loin muscle weight as a percentage of wholesale cut tended (P = 0.10) to be greater in lambs from ewes fed CN and HL than DDGS, whereas other muscle, bone, and fat weights and proportions were similar (P > 0.24) among treatments. Prepartum diet during mid to late gestation of ewes altered postnatal fat and muscle deposition and may be associated with alterations in insulin sensitivity of progeny.

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.

A Fibred Tableau Calculus for Modal Logics of Agents

In previous works we showed how to combine propositional multimodal logics using Gabbay's \emph{fibring} methodology. In this paper we extend the above mentioned works by providing a tableau-based proof technique for the combined/fibred logics. To achieve this end we first make a comparison between two types of tableau proof systems, (\emph{graph} $\&$ \emph{path}), with the help of a scenario (The Friend's Puzzle). Having done that we show how to uniformly construct a tableau calculus for the combined logic using Governatori's labelled tableau system \KEM. We conclude with a discussion on \KEM's features.

Trades and Graphs

The trade spectrum of a simple graph G is defined to be the set of all t for which it is possible to assemble together t copies of G into a simple graph H, and then disassemble H into t entirely different copies of G. Trade spectra of graphs have applications to intersection problems, and defining sets, of G-designs. In this investigation, we give several constructions, both for specific families of graphs, and for graphs in general.

Packing complete multipartite graphs with 4-cycles

In this paper we completely solve the problem of finding a maximum packing of any complete multipartite graph with edge-disjoint 4-cycles, and the minimum leaves are explicitly given.

Decomposition of complete tripartite graphs into gregarious 4-cycles

A 4-cycle in a tripartite graph with vertex partition {V-1, V-2, V-3} is said to be gregarious if it has at least one vertex in each V-i, 1 less than or equal to i less than or equal to 3. In this paper, necessary and sufficient conditions are given for the existence of an edge-disjoint decomposition of any complete tripartite graph into gregarious 4-cycles.

Twisted quantum affine superalgebra Uq[gl(m|n)(2)] and new Uq[osp(m|n)] invariant R-matrices

The minimal irreducible representations of U-q[gl(m|n)], i.e. those irreducible representations that are also irreducible under U-q[osp(m|n)] are investigated and shown to be affinizable to give irreducible representations of the twisted quantum affine superalgebra U-q[gl(m|n)((2))]. The U-q[osp(m|n)] invariant R-matrices corresponding to the tensor product of any two minimal representations are constructed, thus extending our twisted tensor product graph method to the supersymmetric case. These give new solutions to the spectral-dependent graded Yang-Baxter equation arising from U-q[gl(m|n)((2))], which exhibit novel features not previously seen in the untwisted or non-super cases.

Common multiples of complete graphs

A graph H is said to divide a graph G if there exists a set S of subgraphs of G, all isomorphic to H, such that the edge set of G is partitioned by the edge sets of the subgraphs in S. Thus, a graph G is a common multiple of two graphs if each of the two graphs divides G.

XSophe-Sophe-XeprView (R). A computer simulation software suite (v. 1.1.3) for the analysis of continuous wave EPR spectra

The XSophe-Sophe-XeprView((R)) computer simulation software suite enables scientists to easily determine spin Hamiltonian parameters from isotropic, randomly oriented and single crystal continuous wave electron paramagnetic resonance (CW EPR) spectra from radicals and isolated paramagnetic metal ion centers or clusters found in metalloproteins, chemical systems and materials science. XSophe provides an X-windows graphical user interface to the Sophe programme and allows: creation of multiple input files, local and remote execution of Sophe, the display of sophelog (output from Sophe) and input parameters/files. Sophe is a sophisticated computer simulation software programme employing a number of innovative technologies including; the Sydney OPera HousE (SOPHE) partition and interpolation schemes, a field segmentation algorithm, the mosaic misorientation linewidth model, parallelization and spectral optimisation. In conjunction with the SOPHE partition scheme and the field segmentation algorithm, the SOPHE interpolation scheme and the mosaic misorientation linewidth model greatly increase the speed of simulations for most spin systems. Employing brute force matrix diagonalization in the simulation of an EPR spectrum from a high spin Cr(III) complex with the spin Hamiltonian parameters g(e) = 2.00, D = 0.10 cm(-1), E/D = 0.25, A(x) = 120.0, A(y) = 120.0, A(z) = 240.0 x 10(-4) cm(-1) requires a SOPHE grid size of N = 400 (to produce a good signal to noise ratio) and takes 229.47 s. In contrast the use of either the SOPHE interpolation scheme or the mosaic misorientation linewidth model requires a SOPHE grid size of only N = 18 and takes 44.08 and 0.79 s, respectively. Results from Sophe are transferred via the Common Object Request Broker Architecture (CORBA) to XSophe and subsequently to XeprView((R)) where the simulated CW EPR spectra (1D and 2D) can be compared to the experimental spectra. Energy level diagrams, transition roadmaps and transition surfaces aid the interpretation of complicated randomly oriented CW EPR spectra and can be viewed with a web browser and an OpenInventor scene graph viewer.

3,5-cycle decompositions

For all odd integers n and all non-negative integers r and s satisfying 3r + 5s = n(n -1)/2 it is shown that the edge set of the complete graph on n vertices can be partitioned into r 3-cycles and s 5-cycles. For all even integers n and all non-negative integers r and s satisfying 3r + 5s = n(n-2)/2 it is shown that the edge set of the complete graph on n vertices with a 1-factor removed can be partitioned into r 3-cycles and s 5-cycles. (C) 1998 John Wiley & Sons, Inc.

The lobatamides, novel cytotoxic macrolides from southwestern Pacific tunicates

Novel macrolides, lobatamides A-F (1-6), have been isolated from shallow water Australian collections of Aplidium lobatum, from a deep water collection of Aplidium sp., and from an unidentified Philippine ascidian. Full details of the isolation and structure elucidation of 1-6 are provided herein, along with results and analyses of the testing of lobatamides A-D (1-4) in the NCI human tumor 60 cell-line screen. The lobatamides share a common core structure with the recently described salicylihalamides, which were isolated from a Haliclona sp. sponge. COMPARE analyses of the mean-graph differential cytotoxicity profiles of the lobatamides and the salicylihalamides showed high correlations with each other but not with members of the NCI's standard agents database. These compounds, therefore, appear to comprise a new mechanistic class, meriting further antitumor investigations.

(m,n)-cycle systems

We describe a method which, in certain circumstances, may be used to prove that the well-known necessary conditions for partitioning the edge set of the complete graph on an odd number of vertices (or the complete graph on an even number of vertices with a 1-factor removed) into cycles of lengths m(1),m(2),...,m(t) are sufficient in the case \{m(1), m(2), ..., m(t)}\=2. The method is used to settle the case where the cycle lengths are 4 and 5. (C) 1998 Elsevier Science B.V. All rights reserved.