Physical Sciences and Mathematics Commons^™

Propuesta De Un Modelo De Enseñanza En Las Matemáticas Enfocado En La Solución De Problemas En El Nivel Secundario En Puerto Rico, Carlos J. Colon Rivera

Theses and Dissertations

El propósito del estudio fue proponer un modelo educativo enfocado en la solución de problemas matemáticos en el nivel secundario, y se realizó la revisión sistemática para evaluarlo. El marco teórico incluyó teorías heurísticas y modelos educativos. La metodología de seis fases que se empleó en este estudio, incluyendo la formulación de preguntas investigativas, búsqueda de literatura, selección de investigaciones, levantamiento de información, análisis y resumen de resultados y exposición y discusión de estos. Se siguieron guías para revisiones sistemáticas y criterios de inclusión y exclusión para evaluar la efectividad de modelos didácticos en la disciplina de matemáticas con énfasis …

Improving Student Achievement Through The Implementation Of A Classroom Performance System, Stacy Maria Artis

Theses and Dissertations

This applied dissertation was designed to implement and examine the impact of a classroom performance system (CPS) on student achievement for Grade 9 mathematics students. Seventy-five students in 4 Coordinate Algebra classes were observed during the regular school day for 9 weeks. The treatment group received CPS-based instruction, and the control group received traditional mathematics instruction without the use of a CPS. The teacher was the same for all classes.

Data from benchmark assessments as well as quarterly grade reports were compared for both groups. The findings of this study showed mixed results in relation to the impact of CPS-based …

Algorithmic Foundations Of Heuristic Search Using Higher-Order Polygon Inequalities, Newton Henry Campbell Jr.

CCE Theses and Dissertations

The shortest path problem in graphs is both a classic combinatorial optimization problem and a practical problem that admits many applications. Techniques for preprocessing a graph are useful for reducing shortest path query times. This dissertation studies the foundations of a class of algorithms that use preprocessed landmark information and the triangle inequality to guide A* search in graphs. A new heuristic is presented for solving shortest path queries that enables the use of higher order polygon inequalities. We demonstrate this capability by leveraging distance information from two landmarks when visiting a vertex as opposed to the common single landmark …

Performance Comparison Of Projective Elliptic-Curve Point Multiplication In 64-Bit X86 Runtime Environment, Ninh Winson

CCE Theses and Dissertations

For over two decades, mathematicians and cryptologists have evaluated and presented the theoretical performance of Elliptic-curve scalar point-multiplication in projective geometry. Because computation in projective domain is composed of a wide array of formulations and computing optimizations, there is not a comprehensive performance comparison of point-multiplication using projective transformation available to verify its realistic efficiency in 64-bit x86 computing platforms. Today, research on explicit mathematical formulations in projective domain continues to excel by seeking higher computational efficiency and ease of realization. An explicit performance evaluation will help implementers choose better implementation methods and improve Elliptic-curve scalar point-multiplication. This paper was …