Current Search: Arithmetic (x)
View All Items
 Title
 Bilingualism and arithmetic  a pilot study.
 Creator
 Nishat, Towhid, Perez, G., Rosselli, Monica, Graduate College
 Date Issued
 20130412
 PURL
 http://purl.flvc.org/fcla/dt/3361333
 Subject Headings
 Bilingualism, Arithmetic
 Format
 Document (PDF)
 Title
 Arithmetic and language proficiency in Spanish/English billinguals.
 Creator
 Perez, G., Nishat, Towhid, Rosselli, Monica
 Date Issued
 20130405
 PURL
 http://purl.flvc.org/fcla/dt/3361163
 Subject Headings
 Bilingualism, Arithmetic
 Format
 Document (PDF)
 Title
 Effects on technology on math testing.
 Creator
 Tornopsky, Cydney, Earles, Julie
 Date Issued
 20130405
 PURL
 http://purl.flvc.org/fcla/dt/3361207
 Subject Headings
 Computerassisted instruction, Arithmetic, Testing
 Format
 Document (PDF)
 Title
 The effects of the Enright Arithmetic Program on the emotional deficits associated with learned helplessness.
 Creator
 Johnson, Henry Eugene, III., Florida Atlantic University, Weppner, Daniel B.
 Abstract/Description

The purpose of this study was to investigate whether a particular mathematics program, which has been proven effective in changing student proficiency in mathematics, will also alter student emotional reactions to failure. The program selected for this study is unique in that through a series of diagnostic tests and remedial lessons, the student and teacher can accurately pinpoint the student's processing errors in mathematics. The sample consisted of 126 eighth grade mathematics students...
Show moreThe purpose of this study was to investigate whether a particular mathematics program, which has been proven effective in changing student proficiency in mathematics, will also alter student emotional reactions to failure. The program selected for this study is unique in that through a series of diagnostic tests and remedial lessons, the student and teacher can accurately pinpoint the student's processing errors in mathematics. The sample consisted of 126 eighth grade mathematics students from a public middle school. There were five independent variables: sex, race (black vs. white), attributional style (internal vs. external), proficiency level in mathematics (high vs. low), and grouping for instruction (Enright Program vs. control). The dependent variables consisted of test scores collected before the mathematics program and immediately after completion of the program on the affective factors of anxiety, hostility, and depression. The results showed a significant difference in student emotional reactions to failure after being exposed to the Enright Arithmetic Program as compared to students in the control group. The students in the Enright group had significantly less negative affective reactions to failure in relation to all three of the dependent variables after working with the Enright Arithmetic Program than did the students who were not afforded the opportunity to work with the program. This study thus demonstrated that the Enright Arithmetic Program not only improves student proficiency levels in mathematics, but also alters students' emotional reactions to a stressful failure situation in the classroom in a positive way.
Show less  Date Issued
 1988
 PURL
 http://purl.flvc.org/fcla/dt/11930
 Subject Headings
 Enright Arithmetic ProgramPsychological aspects, Education, Elementary, Education
 Format
 Document (PDF)
 Title
 Rings of integervalued polynomials and derivatives.
 Creator
 Villanueva, Yuri., Charles E. Schmidt College of Science, Department of Mathematical Sciences
 Abstract/Description

For D an integral domain with field of fractions K and E a subset of K, the ring Int (E,D) = {f e K[X]lf (E) C D} of integervalued polynomials on E has been well studies. In particulare, when E is a finite subset of D, Chapman, Loper, and Smith, as well as Boynton and Klingler, obtained a bound on the number of elements needed to generate a finitely generated ideal of Ing (E, D) in terms of the corresponding bound for D. We obtain analogous results for Int (r) (E, D)  {f e K [X]lf(k) (E) c...
Show moreFor D an integral domain with field of fractions K and E a subset of K, the ring Int (E,D) = {f e K[X]lf (E) C D} of integervalued polynomials on E has been well studies. In particulare, when E is a finite subset of D, Chapman, Loper, and Smith, as well as Boynton and Klingler, obtained a bound on the number of elements needed to generate a finitely generated ideal of Ing (E, D) in terms of the corresponding bound for D. We obtain analogous results for Int (r) (E, D)  {f e K [X]lf(k) (E) c D for all 0 < k < r} , for finite E and fixed integer r > 1. These results rely on the work of Skolem [23] and Brizolis [7], who found ways to characterize ideals of Int (E, D) from the values of their polynomials at points in D. We obtain similar results for E = D in case D is local, Noetherian, onedimensional, analytically irreducible, with finite residue field.
Show less  Date Issued
 2012
 PURL
 http://purl.flvc.org/FAU/3356899
 Subject Headings
 Rings of integers, Ideals (Algebra), Polynomials, Arithmetic algebraic geometry, Categories (Mathematics), Commutative algebra
 Format
 Document (PDF)
 Title
 Rough SetBased Software Quality Models and Quality of Data.
 Creator
 Bullard, Lofton A., Khoshgoftaar, Taghi M., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
 Abstract/Description

In this dissertation we address two significant issues of concern. These are software quality modeling and data quality assessment. Software quality can be measured by software reliability. Reliability is often measured in terms of the time between system failures. A failure is caused by a fault which is a defect in the executable software product. The time between system failures depends both on the presence and the usage pattern of the software. Finding faulty components in the development...
Show moreIn this dissertation we address two significant issues of concern. These are software quality modeling and data quality assessment. Software quality can be measured by software reliability. Reliability is often measured in terms of the time between system failures. A failure is caused by a fault which is a defect in the executable software product. The time between system failures depends both on the presence and the usage pattern of the software. Finding faulty components in the development cycle of a software system can lead to a more reliable final system and will reduce development and maintenance costs. The issue of software quality is investigated by proposing a new approach, rulebased classification model (RBCM) that uses rough set theory to generate decision rules to predict software quality. The new model minimizes overfitting by balancing the Type I and Type II niisclassiflcation error rates. We also propose a model selection technique for rulebased models called rulebased model selection (RBMS). The proposed rulebased model selection technique utilizes the complete and partial matching rule sets of candidate RBCMs to determine the model with the least amount of overfitting. In the experiments that were performed, the RBCMs were effective at identifying faulty software modules, and the RBMS technique was able to identify RBCMs that minimized overfitting. Good data quality is a critical component for building effective software quality models. We address the significance of the quality of data on the classification performance of learners by conducting a comprehensive comparative study. Several trends were observed in the experiments. Class and attribute had the greatest impact on the performance of learners when it occurred simultaneously in the data. Class noise had a significant impact on the performance of learners, while attribute noise had no impact when it occurred in less than 40% of the most significant independent attributes. Random Forest (RF100), a group of 100 decision trees, was the most, accurate and robust learner in all the experiments with noisy data.
Show less  Date Issued
 2008
 PURL
 http://purl.flvc.org/fau/fd/FA00012567
 Subject Headings
 Computer softwareQuality control, Computer softwareReliability, Software engineering, Computer arithmetic
 Format
 Document (PDF)
 Title
 Integervalued polynomials and pullbacks of arithmetical rings.
 Creator
 Boynton, Jason, Florida Atlantic University, Klingler, Lee
 Abstract/Description

Let D be an integral domain with field of fractions K, and let E be a nonempty finite subset of D. For n > 2, we show that the ngenerator property for D is equivalent to the ngenerator property for Int(E, D), which is equivalent to strong (n + 1)generator property for Int(E, D). We also give necessary and sufficient conditions that the pullback of a conductor square be a chain ring (that is, a ring whose ideals are totally ordered by inclusion), and we give necessary and sufficient...
Show moreLet D be an integral domain with field of fractions K, and let E be a nonempty finite subset of D. For n > 2, we show that the ngenerator property for D is equivalent to the ngenerator property for Int(E, D), which is equivalent to strong (n + 1)generator property for Int(E, D). We also give necessary and sufficient conditions that the pullback of a conductor square be a chain ring (that is, a ring whose ideals are totally ordered by inclusion), and we give necessary and sufficient conditions that the pullback of a conductor square be an arithmetical ring (that is, a ring which is locally a chain ring at every maximal ideal). We characterize all Prufer domains R between D[X] and K[X]such that the conductor C of K[X] into R is nonzero. As an application, we show that for n > 2, such a ring R has the ngenerator property (every finitely generated ideal can be generated by n elements) if and only if R/C has the same property.
Show less  Date Issued
 2006
 PURL
 http://purl.flvc.org/fcla/dt/12221
 Subject Headings
 Polynomials, Ideals (Algebra), Rings of integers, Categories (Mathematics), Arithmetical algebraic geometry
 Format
 Document (PDF)