Your search

Agriculture ranks as one of the top contributors to global warming and nutrient pollution. Quantifying life cycle environmental impacts from agricultural production serves as a scientific foundation for forming effective remediation strategies. However, methods capable of accurately and efficiently calculating spatially explicit life cycle global warming (GW) and eutrophication (EU) impacts at the county scale over a geographic region are lacking. The objective of this study was to determine the most efficient and accurate model for estimating spatially explicit life cycle GW and EU impacts at the county scale, with corn production in the U.S.’s Midwest region as a case study. This study compared the predictive accuracies and efficiencies of five distinct supervised machine learning (ML) algorithms, testing various sample sizes and feature selections. The results indicated that the gradient boosting regression tree model built with approximately 4000 records of monthly weather features yielded the highest predictive accuracy with cross-validation (CV) values of 0.8 for the life cycle GW impacts. The gradient boosting regression tree model built with nearly 6000 records of monthly weather features showed the highest predictive accuracy with CV values of 0.87 for the life cycle EU impacts based on all modeling scenarios. Moreover, predictive accuracy was improved at the cost of simulation time. The gradient boosting regression tree model required the longest training time. ML algorithms demonstrated to be one million times faster than the traditional process-based model with high predictive accuracy. This indicates that ML can serve as an alternative surrogate of process-based models to estimate life-cycle environmental impacts, capturing large geographic areas and timeframes.

Consider a finite t + r − 1 dimensional projective space PG(t + r − 1, s) over a Galois field GF(s) of order s = ϱh, where ϱ and h are positive integers and ϱ is the prime characteristic of the field. A collection of k points in PG (t + r − 1, s) constitutes an L(t, k)-set if no t of them are linearly dependent. An L(t, k)-set is maximal if there exists no other L(t, k′)-set with k′ > k. The largest k for which an L(t, k)-set exists is denoted by Mt(t + r, s). K. A. Bush [3] established that Mt(t, s) = t + 1 for t ⩾ s. The purpose of this paper is to generalize this result and study Mt(t + r, s) for t, r, and s in certain relationships.

Consider a finite (t + r - 1)-dimensional projective space PG(t + r - 1, s) based on the Galois field GF(s), where s is prime or power of a prime. A set of k distinct points in PG(t + r - 1, s), no t-linearly dependent, is called a (k, t)-set and such a set is said to be maximal if it is not contained in any other (k*, t)-set with k* > k. The number of points in a maximal (k, t)-set with the largest k is denoted by mt(t + r, s). Our purpose in the paper is to investigate the conditions under which two or more points can be adjoined to the basic set of Ei, i = 1, 2, ..., t + r, where Ei is a point with one in i-th position and zeros elsewhere. The problem has several applications in the theory of fractionally replicated designs and information theory. © 1973.

Consider a finite r-dimensional projective space PG(r, s) based on the Galois field GF(s) where s is prime or power of a prime. A set of n distinct points in PG(r, s), no t linearly dependent, is said to be maximal or complete if it is not contained in any other set with n* points with n* > n. The number of points in a maximal set is denoted by mt(r + 1, s). The purpose of this paper is to improve the existing bounds for m5(r + 1, s) for r ≥ 5 and s ≥ 5 (odd). The investigation of maximal sets in certain relationships of t, r and s yields parity check matrices of (r + 1) rows and n columns with elements from GF(s) satisfying the condition that no t columns are linearly dependent. This problem has applications to coding theory and also in the theory of fractionally replicated designs. © 1972 Academic Press, Inc.

This investigation was originally motivated by the problem of determining the maximum number of points in finite n-dimensional projective space PG(n, s) based on the Galois field GF(s) of order s=ph (where p and h are positive integers and p is the prime characteristic of the field), such that no t of these chosen points are linearly dependent. A set of k distinct points in PG(n, s), no t linearly dependent, is called a (k, t)-set for k1 >k. The maximum value of k is denoted by mt (n+1, s). The purpose of this paper is to find new upper bounds for some values of n, s and t. These bounds are of importance in the experimental design and information theory problems. © 1971 Institute of Statistical Mathematics.

Cochran’s Q test for differences between related-sample percentages or proportions has generally been incorrectly presented in secondary sources. The most common mistake results from failure to recognize that rows containing only 1’s or only 0’s, i.e., only successes or only failures, do not affect the value of Q. The F test, however, is affected by such rows. The probabilities from the χ2 and F approximations are compared with the exact probabilities in three sets of data. A rule of thumb, based on extensive study of the distribution of 0 in small samples, is given as an aid in judging when the χ2 approximation is satisfactory for practical purposes. © Taylor & Francis Group, LLC.

Kirillov and Reshetikhin introduced rigged configurations as a new way to calculate the entries of the Kostka matrix. Macdonald defined the two-parameter Kostka matrix whose entries generalize. We use rigged configurations and a formula of Stembridge to provide a combinatorial interpretation of in the case where is a partition with no more than two columns. In particular, we show that in this case, has nonnegative coefficients. © 1995 American Mathematical Society.

This paper presents a fresh approach to a general education mathematics course. The basic idea is to turn the customary mathematics class on its head by focusing on applications first, through a reading of articles from magazines and newspapers, and then turning to the technical mathematical details. A description of the topics that were covered in my course, along with references to various publications, is given. A course such as this one is important because it conveys how mathematics is serving the goals of society. © 1994 Taylor and Francis Group, LLC.

One of the problems which many companies face is the distribution of inventory from one or more centrally located distribution centers. The retail, industry, and in particular the women's clothing industry, faces the additional problem that not only does the merchandise have to be distributed but it must be distributed in such a way that every store gets a reasonable spread of colors and sizes. This research attempts to optimize the multi-criteria allocation objective by developing a computer algorithm. In order to be implemented any algorithm developed must be computationally efficient due to the size of the industry and other system related programming constraints. The algorithm which was developed not only provided a solution which was a marked improvement regarding the color spread of the merchandise but was also efficient enough to be immediately implemented on a national basis. © 1992.

Dose-response experiments are crucial in biomedical studies. There are usually multiple objectives in such experiments and among the goals is the estimation of several percentiles on the dose-response curve. Here we present the first non-parametric adaptive design approach to estimate several percentiles simultaneously via generalized Pó lya urns. Theoretical properties of these designs are investigated and their performance is gaged by the locally compound optimal designs. As an example, we re-investigated a psychophysical experiment where one of the goals was to estimate the three quartiles. We show that these multiple-objective adaptive designs are more efficient than the original single-objective adaptive design targeting the median only. We also show that urn designs which target the optimal designs are slightly more efficient than those which target the desired percentiles directly. Guidelines are given as to when to use which type of design. Overall we are pleased with the efficiency results and hope compound adaptive designs proposed in this work or their variants may prove to be a viable non-parametric alternative in multiple-objective dose-response studies. Copyright © 2004 John Wiley & Sons, Ltd.

Abstract:- We provide lower and upper bounds for the domination numbers and the connected domination numbers for outerplanar graphs. We also provide a recursive algorithm that finds a connected domination set for an outerplanar graph. Finally, we show that for outerplanar graphs where all bounded faces are 3-cycles, the problem of determining the connected domination number is equivalent to an art gallery problem, which is known to be NP-hard. Key-Words:- dominating sets, star forests, outerplanar graphs, art gallery 1

In this paper we consider a variation of the Art Gallery Problem. A set of points script G sign in a polygon Pn is a connected guard set for Pn provided that is a guard set and the visibility graph of the set of guards script G sign in Pn is connected. We use a coloring argument to prove that the minimum number of connected guards which are necessary to watch any polygon with n sides is ⌊(n - 2)/2⌋. This result was originally established by induction by Hernández-Peńalver [3]. From this result it easily follows that if the art gallery is orthogonal (each interior angle is 90° or 270°), then the minimum number of connected guards is n/2 - 2. © Springer-Verlag Berlin Heidelberg 2003.

In this paper we consider a variation of the Art Gallery Problem for orthogonal polygons. A set of points in a polygon Pn is a connected guard set for Pn provided that is a guard set and the visibility graph of the set of guards in Pn is connected. The polygon P n is orthogonal provided each interior angle is 90° or 270°. First we use a coloring argument to prove that the minimum number of connected guards which are necessary to watch any orthogonal polygon with n sides is n/2-2. This result was originally established by induction by Hernández-Peñalver. Then we prove a new result for art galleries with holes: we show that n/2-h connected guards are always sufficient to watch an orthogonal art gallery with n walls and h holes. This result is sharp when n = 4h + 4. We also construct galleries that require at least n/2-h-1 connected guards, for all n and h. © Springer-Verlag 2003.