| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910453893503321 |
|
|
Autore |
Xin Yan Ping |
|
|
Titolo |
Conceptual model-based problem solving [[electronic resource] ] : teach students with learning difficulties to solve math problems / / Yan Ping Xin |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Rotterdam ; ; Boston, : Sense Publishers, c2012 |
|
|
|
|
|
|
|
ISBN |
|
94-6209-103-X |
94-6209-104-8 |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2012.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (266 p.) |
|
|
|
|
|
|
Collana |
|
Career Development Series ; ; v.5 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Mathematics - Study and teaching (Elementary) - United States |
Problem-based learning |
Learning disabled children - Education - United States |
Inclusive education - United States |
Learning strategies - United States |
Electronic books. |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references (p. 267-268). |
|
|
|
|
|
|
Nota di contenuto |
|
Preliminary Material -- Conceptual Model-based Problem Solving -- COMPS Program -- Representing Part-Part-Whole (PPW) Problems -- Solving Part-Part Whole (PPW) Problems -- Representing Additive Compare (AC) Problems -- Solving Additive Compare (AC) Problems -- Solving Mixed PPW and AC Problems -- Representing Equal Groups (EG) Problems -- Solving Equal Groups (EG) Problems -- Representing Multiplicative Compare (MC) Problems -- Solving Multiplicative Compare (MC) Problems -- Solving Mixed Equal Groups and Multiplicative -- Solving Complex Word Problems -- Solving Mixed Multi-Step Problems -- Connection between Mathematical Ideas -- Student Worksheets -- Reference Guide -- References. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
Are you having trouble in finding Tier II intervention materials for elementary students who are struggling in math? Are you hungry for effective instructional strategies that will address students’ conceptual gap in additive and multiplicative math problem solving? Are you searching for a powerful and generalizable problem solving approach |
|
|
|
|
|
|
|
|
|
|
that will help those who are left behind in meeting the Common Core State Standards for Mathematics (CCSSM)? If so, this book is the answer for you. • The conceptual model-based problem solving (COMPS) program emphasizes mathematical modeling and algebraic representation of mathematical relations in equations, which are in line with the new Common Core. • “Through building most fundamental concepts pertinent to additive and multiplicative reasoning and making the connection between concrete and abstract modeling, students were prepared to go above and beyond concrete level of operation and be able to use mathematical models to solve more complex real-world problems. As the connection is made between the concrete model (or students’ existing knowledge scheme) and the symbolic mathematical algorithm, the abstract mathematical models are no longer “alien” to the students.” As Ms. Karen Combs, Director of Elementary Education of Lafayette School Corporation in Indiana, testified: “It really worked with our kids!” • “One hallmark of mathematical understanding is the ability to justify,… why a particular mathematical statement is true or where a mathematical rule comes from” (http://illustrativemathematics.org/standards). Through making connections between mathematical ideas, the COMPS program makes explicit the reasoning behind math, which has the potential to promote a powerful transfer of knowledge by applying the learned conception to solve other problems in new contexts. • Dr. Yan Ping Xin’s book contains essential tools for teachers to help students with learning disabilities or difficulties close the gap in mathematics word problem solving. I have witnessed many struggling students use these strategies to solve word problems and gain confidence as learners of mathematics. This book is a valuable resource for general and special education teachers of mathematics. - Casey Hord, PhD, University of Cincinnati. |
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910143616203321 |
|
|
Titolo |
Graph-Theoretic Concepts in Computer Science : 26th International Workshop, WG 2000 Konstanz, Germany, June 15-17, 2000 Proceedings / / edited by Ulrik Brandes, Dorothea Wagner |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2000.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 313 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 1928 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer programming |
Computers |
Data structures (Computer science) |
Algorithms |
Computer science—Mathematics |
Programming Techniques |
Theory of Computation |
Data Structures and Information Theory |
Algorithm Analysis and Problem Complexity |
Discrete Mathematics in Computer Science |
Data Structures |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references at the end of each chapters and index. |
|
|
|
|
|
|
|
|
Nota di contenuto |
|
On the Expected Runtime and the Success Probability of Evolutionary Algorithms (Invited Presentation) -- n Points and One Line: Analysis of Randomized Games (Abstract of Invited Lecture) -- Approximating Call-Scheduling Makespan in All-Optical Networks -- New Spectral Lower Bounds on the Bisection Width of Graphs -- Traversing Directed Eulerian Mazes (Extended Abstract) -- On the Space and Access Complexity of Computation DAGs -- Approximating the Treewidth of AT-Free Graphs -- Split-Perfect Graphs: Characterizations and Algorithmic Use -- Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs -- Networks with Small Stretch Number |
|
|
|
|
|
|
|
|
|
|
|
(Extended Abstract) -- Efficient Dispersion Algorithms for Geometric Intersection Graphs -- Optimizing Cost Flows by Modifying Arc Costs and Capacities -- Update Networks and Their Routing Strategies -- Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults -- Diameter of the Knödel Graph -- On the Domination Search Number -- Efficient Communication in Unknown Networks -- Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract) -- The Tree-Width of Clique-Width Bounded Graphs without K n,n -- Tree Spanners for Subgraphs and Related Tree Covering Problems -- Minimal Size of Piggybacked Information for Tracking Causality: A Graph-Based Characterization -- The Expressive Power and Complexity of Dynamic Process Graphs -- Bandwidth of Split and Circular Permutation Graphs -- Recognizing Graphs without Asteroidal Triples (Extended Abstract) -- Budget Constrained Minimum Cost Connected Medians -- Coloring Mixed Hypertrees -- A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs -- Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables. |
|
|
|
|
|
|
Sommario/riassunto |
|
The 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000) was held at Waldhaus Jakob, in Konstanz, Germany, on 15{ 17 June 2000. It was organized by the Algorithms and Data Structures Group of the Department of Computer and Information Science, University of K- stanz, and sponsored by Deutsche Forschungsgemeinschaft (DFG) and Univ- sit¨atsgesellschaft Konstanz. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions for future research. The workshop looks back on a remarkable tradition of more than a quarter of a century. Previous Workshops have been organized in various places in Europe, and submissions come from all over the world. This year, 57 attendees from 13 di erent countries gathered in the relaxing atmosphere of Lake Constance, also known as the Bodensee. Out of 51 submis- ons, the program committee carefully selected 26 papers for presentation at the workshop. This selection re?ects current research directions, among them graph and network algorithms and their complexity, algorithms for special graph cl- ses, communication networks, and distributed algorithms. The present volume contains these papers together with the survey presented in an invited lecture by Ingo Wegener (University of Dortmund) and an extended abstract of the invited lecture given by Emo Welzl (ETH Zuric ¨ h). |
|
|
|
|
|
|
|
| |