Results 81 to 90 of about 167,657,560 (187)
Is A Little Learning Dangerous?
Noûs, EarlyView.ABSTRACT I argue that a little learning is often dangerous even for ideal reasoners who are operating in extremely simple scenarios and know all the relevant facts about how the evidence is generated. More precisely, I show that, on many plausible ways of assigning value to a credence in a hypothesis H, ideal Bayesians should sometimes expect other ...
Bernhard Salow
wiley +1 more source
Teacher Perspectives of Student Engagement in Data Practice Instruction: Two Classroom Conditions
School Science and Mathematics, EarlyView.ABSTRACT This study examines high school science teachers' perceptions of student engagement in data practices across two instructional contexts: a scaffolded, student‐centered environment using the Science Practices Innovation Notebook (SPIN) and a business‐as‐usual (BAU) teacher‐led investigation.
Erin Peters‐Burton +4 more
wiley +1 more source
Fairness criteria for algebraic curves
, 2003 We develop methods for the variational design of algebraic curves. Our approach is based on truly geometric fairness criteria, such as the elastic bending energy.
Bert Jüttler, Pavel Chalmoviansky
core
Improving the stability of algebraic curves for applications [PDF]
, 2000 journal articleAn algebraic curve is defined as the zero set of a polynomial in two variables. Algebraic curves are practical for modeling shapes much more complicated than conics or superquadrics.
Tarel, Jean-Philippe; Cooper, David B. +1 more
core
Tropical Medicine &International Health, EarlyView.ABSTRACT Background Dengue vector control plays an important role in reducing the burden of dengue infection. Conventional meta‐analysis can only include interventions that can be directly compared. Hence, this study aimed to compare the effectiveness of all interventions for dengue vector control directly and indirectly through a multilevel Bayesian ...
Gary K. K. Low +5 more
wiley +1 more source
Data‐Driven Spectral Prediction for Accelerating Large‐Scale Electronic Structure Calculations
Proceedings in Applied Mathematics and Mechanics, Volume 26, Issue 4, December 2026.ABSTRACT Simulating large molecular systems comprising thousands of atoms requires highly scalable methodologies. While modern Density Functional Theory (DFT) codes exhibit linear scaling, solving the associated large, sparse generalized eigenproblems remains a critical computational bottleneck on exascale architectures.
Abhiram Badrinarayanan +6 more
wiley +1 more source
ALGEBRAIC CURVES AND CRYPTOGRAPHY
, 2008 . Algebraic curves over finite fields are being extensively used in the design of public-key cryptographic schemes. This paper surveys some topics in algebraic curve cryptography, with an emphasis on recent developments in algorithms for the elliptic and
Alfred Menezes, Steven Galbraith
core
On the Computation of Crack Surface Normals in the Phase‐Field Model of Hydraulic Fracture
Proceedings in Applied Mathematics and Mechanics, Volume 26, Issue 4, December 2026.ABSTRACT Hydraulic fracturing techniques have been used to extract oil from the Earth's crust and to enhance the efficiency of geothermal systems among other applications. Numerical simulation of hydraulic fracturing is essential for predicting the environmental impact of this method, as well as its efficiency in such applications. In the present work,
Anuj Gupte +2 more
wiley +1 more source
Proceedings in Applied Mathematics and Mechanics, Volume 26, Issue 4, December 2026.ABSTRACT Many engineering courses are still organized according to a predominantly deductive and content‐oriented approach: theoretical foundations are introduced first, while authentic disciplinary activity is often postponed to later stages of the curriculum.
Thorsten Bartel
wiley +1 more source
On computing local monodromy and the numerical local irreducible decomposition
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards +1 more
wiley +1 more source