We put restrictions on the coefficients of polynomials and give bounds concerning the number of zeros in a specific region. The restrictions involve a monotonicity-type condition on the coefficients of the even powers of the variable and on the coefficients of the odd powers of the variable (treated separately). We present results by imposing the restrictions on the moduli of the coefficients, the real and imaginary parts of the coefficients, and the real parts (only) of the coefficients.

No description available.

This thesis was designed as a self study unit for middle school aged students with special needs. The unit is broken in to sub-units that specifically cater to each number base. Also included in this plan is a brief history of counting and practical uses for the mathematics of different number bases. This has been designed to be a "fun" unit to study after taking S.O.L. tests or other state standard testing. Included in each unit are worksheets for assessment of understanding.

A projective plane tropical curve is a proper immersion of a graph into the real Cartesian plane subject to some conditions such as that the images of all the edges must be lines with rational slopes. Two important combinatorial invariants of a projective plane tropical curve are its degree, d, and genus g. First, we explore Gathmann and Markwig's approach to the study of the moduli spaces of such curves and explain their proof that the number of projective plane tropical curves, counting multiplicity, passing through n = 3d + g -1 points does not depend on the choice of points, provided they are in tropical general position. This number of curves is called a Gromov-Written invariant. Second, we discuss the proof of a theorem of Mikhalkin that allows one to compute the Gromov-Written invariant by a purely combinatorial process of counting certain lattice paths.

No description available.

No description available.

Most privatization literature, of which outsourcing/contracting out is a sub-set, discusses: 1) localized anecdotes of how organizations privatized; 2) privatization's history; 3) its types; and/or 4) its pros and cons. What is missing is a methodologically defensible, comprehensive, macro-view of whether or not outsourcing has saved money and/or improved service quality. Using the vote-counting analytical procedure, this dissertation provides one comprehensive view by analyzing and combining the findings of 40 sources covering 222 outsourced services at all levels of US government. The author found that contracting out resulted in cost savings 79% of the time, but improved service quality only 48% of the time. The author also found that outsourcing savings and improved service quality declined as the level of government got smaller. This phenomenon could be an artifact of the federal requirement that a private contractor must show savings of at least 10% or $10 million before any outsourcing occurs. The lower levels of improved service can generally be explained by surveys which show that government managers treat service quality improvement as an afterthought. The findings of this study are consistent with other authors (e.g., Hodge, Savas, Dehoog, Moore) and led the author to the following insights: 1) Outsourcing continues to grow. 2) The amount of evidence regarding outsourcing effectiveness is minimal, confusing, and highly subjective. 3) Outsourcing saves money, but at the expense of quality or at least without improving it. 4) Contracting out can be a solution, but is not the only solution to government funding and service quality shortfalls. 5) Successful outsourcing has been implemented in certain ways. 6) Outsourcing does not spell the end of public administration. / Ph. D.

No description available.

The aim of this work is to examine the applicability of an algorithm for approximate frequency counting to act as an on-the-fly filter in the process of phrase table extraction in Statistical Machine Translation systems. Its implementation allows for the bulk of extracted phrase pairs to be much reduced with no significant loss to the ultimate quality of the phrase-based translation model as measured by the state-of-the-art evaluation measure BLEU. The result of this implementation is a fully working program, called eppex, capable of acting as an alternative to the existing tools for phrase table creation and filtration that are part of the open-source SMT system Moses. A substantial part of this work is devoted to the benchmarking of both the runtime performance and the quality of produced phrase tables achieved by the program when confronted with parallel training data comprised of 2 billions of words. Powered by TCPDF (www.tcpdf.org)

A caracterização estática dos sistemas caóticos clássicos dissipativos tem sido realizada através do cálculo das dimensões generalizadas \'D IND. q\' e do espectro de singularidades f(alfa). Os métodos mais comuns de cálculo numérico dessas funções utilizam algoritmos de contagem de caixa. Porém, esses algoritmos produzem um erro sistemático através de \'caixas espúrias\', levando a resultados distorcidos. Por essa razão, estudamos métodos numéricos que não utilizam o algoritmo de contagem de caixa, verificando em que casos eles podem ser aplicados eficazmente e propusemos um novo algoritmo de contagem de caixa que reduz o número de \'caixas espúrias\', obtendo melhores resultados. / The static caracterization of classical dissipative chaotical systems has been achieved by the calculation of the generalized dimensions \'D IND. q\' and the spectrum of singularities f(alfa). The most used numerical methods of evaluating these functions are based on box counting algorithms. The results obtained by those methods are distorced by the presence of \'spurious boxes\' generated intrinsecally by these algorithms. For this reason, we have studied numerical methods that don\'t use box counting algorithms, and we have tried to verify in which kind of sets they give best results. We also have proposed a new box counting algorithm that reduces the number of \'spurious boxes\', and led to better results.