Discrete Math For Computer Science - Chapter 29: Tree Traversals: Spanning Trees,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 29: Tree Traversals: Spanning Trees, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
(Si14-12) Some Novel Fractional Discrete Inequalities Of Gronwall-Bellman Type And Their Applications To Fractional Difference Equations,
2025
Savitribai Phule Pune University
(Si14-12) Some Novel Fractional Discrete Inequalities Of Gronwall-Bellman Type And Their Applications To Fractional Difference Equations, Subhash Kendre, Nagesh Kale, Dimplekumar Chalishajar
Applications and Applied Mathematics: An International Journal (AAM)
In this study, we develop multiple power nonlinear generalizations of Gronwall-Bellman type fractional discrete inequalities and fractional sum inequalities through combining functions with powered unknown functions.We have employed technique of reducing power non-linearity into linearity to furnish these refinements. These novel findings present a broader framework for dealing with wider range of nonlinear fractional difference equations and fractional sum-difference equations. The utilization of these inequalities enables to study certain crucial classes of fractional difference equations that arise in the realm of fractional difference calculus, both quantitatively and qualitatively. Several illustrations are provided to examine the boundedness of initial value problems …
Best Strategies For Bilingual Education: How Can We Explain Their Success?,
2025
University of Texas San Antonio
Best Strategies For Bilingual Education: How Can We Explain Their Success?, Claudia Cabrera, Olga Kosheleva, Christian Servin, Vladik Kreinovich
Departmental Technical Reports (CS)
When designing AI-based tools for education, it is important to take into account the experience of human teachers. In this, it is necessary to distinguish between the education features that are justified by the general features of the corresponding education task -- these features should be taken into account in AI-based learning as well -- and features which are specific for traditional non-AI teaching. In this paper, on the important example of bilingual education, we show that several empirically successful teaching strategies can be explained in the general context -- and thus, should be implemented in AI-based teaching as well.
Discrete Math For Computer Science - Chapter 3: Predicates And Quantifiers: Quantified Statements,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 3: Predicates And Quantifiers: Quantified Statements, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 1: Proposition, Logical Operations, And Conditional Statements,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 1: Proposition, Logical Operations, And Conditional Statements, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 22: Counting By Complement: Permutations With Repetitions: Inclusion/Exclusion Principle,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 22: Counting By Complement: Permutations With Repetitions: Inclusion/Exclusion Principle, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 20: Sum And Product Rules,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 20: Sum And Product Rules, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 25: Conditional Probability And Independence,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 25: Conditional Probability And Independence, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 24: Unions And Complements Of Events,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 24: Unions And Complements Of Events, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 17: The Division Algorithm: Modular Arithmetic,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 17: The Division Algorithm: Modular Arithmetic, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 23: Probability Of An Event,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 23: Probability Of An Event, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 12: Introduction To Binary Relations,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 12: Introduction To Binary Relations, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 21: Counting Permutations And Subsets,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 21: Counting Permutations And Subsets, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 18: Prime Factorization: Gcd And Euclid’S Algorithm,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 18: Prime Factorization: Gcd And Euclid’S Algorithm, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 9: Cartesian Products,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 9: Cartesian Products, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 10: Definition Of Functions: Properties Of Functions,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 10: Definition Of Functions: Properties Of Functions, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 6: Proofs By Contradiction: Proofs By Cases,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 6: Proofs By Contradiction: Proofs By Cases, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 5: Direct Proofs: Proofs By Contrapositive,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 5: Direct Proofs: Proofs By Contrapositive, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 7: Sets And Subsets: Set Of Sets,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 7: Sets And Subsets: Set Of Sets, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Book Vi Of The Mathematical Collection Of Pappus Of Alexandria, Translated By John B. Little,
2025
College of the Holy Cross
Book Vi Of The Mathematical Collection Of Pappus Of Alexandria, Translated By John B. Little, John B. Little, Pappus Of Alexandria
Holy Cross Bookshelf
Book VI of the Mathematical Collection is a collection of comments or notes about various points treated in parts of a collection of other texts sometimes known as the “Little Astronomy.” Pappus uses these works as sources and frequently quotes from them in this book. In the teaching of mathematical astronomy in late antiquity, and this would include the time of Pappus, the “Little Astronomy” is often understood to have been a follow-up to Euclid’s Elements and a preliminary to the study of the Almagest of Claudius Ptolemy (ca. 100–165 CE). The “Little Astronomy” included works by a group of …
