Results 111 to 120 of about 2,093 (267)

Bayesian inference for dynamic Q matrices and attribute trajectories in hidden Markov diagnostic classification models

British Journal of Mathematical and Statistical Psychology, EarlyView.
Abstract Hidden Markov diagnostic classification models capture how students' cognitive attributes evolve over time. This paper introduces a Bayesian Markov chain Monte Carlo algorithm for diagnostic classification models that jointly estimates time‐varying Q matrices, latent attributes, item parameters, attribute class proportions and transition ...
Chen‐Wei Liu
wiley   +1 more source

Spreadsheets: Laying a Foundation for Understanding Functions

Spreadsheets in Education, 2015
Linear, quadratic, and exponential functions, as well as polynomial functions, are the most basic mathematical expressions. Despite being among the most basic expressions in algebra, these functions are often used to approximate more complicated ...
Pejmon Sadri
doaj  

Bias and precision in true‐score estimation

British Journal of Mathematical and Statistical Psychology, EarlyView.
Abstract We discuss two approaches to estimating the true score from classical test theory, each with a corresponding measure of uncertainty due to measurement error: the classical method with the standard error of measurement (SEM) and Kelley's method with the standard error of estimation (SEE).
L. Andries van der Ark, Wilco H. M. Emons, Jules L. Ellis, Klaas Sijtsma   +3 more
wiley   +1 more source

Computing Skinning Weights via Convex Duality

Computer Graphics Forum, EarlyView.
We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley   +1 more source

Solving Degree Bounds for Iterated Polynomial Systems

IACR Transactions on Symmetric Cryptology
For Arithmetization-Oriented ciphers and hash functions Gröbner basis attacks are generally considered as the most competitive attack vector. Unfortunately, the complexity of Gröbner basis algorithms is only understood for special cases, and it is ...
Matthias Johann Steiner
doaj   +1 more source

Neural Local Inter‐reflection Modeling for Garment Fold Rendering

Computer Graphics Forum, EarlyView.
Abstract Realistic garment rendering requires simulating complex multi‐bounce light paths within intricate fold geometries. In these regions, conventional path tracing is computationally expensive as light becomes trapped, necessitating high bounce counts for convergence.
Jooeun Son, Nuri Ryu, Gyoonseo Kim, Joo Ho Lee, Seungyong Lee   +4 more
wiley   +1 more source

Survey on differential estimators for 3d point clouds

Computer Graphics Forum, EarlyView.
Abstract Recent advancements in 3D scanning technologies, including LiDAR and photogrammetry, have enabled the precise digital replication of real‐world objects. These methods are widely used in fields such as GIS, robotics, and cultural heritage. However, the point clouds generated by such scans are often noisy and unstructured, posing challenges for ...
Léo Arnal–Anger, Thibault Lejemble, David Coeurjolly, Loïc Barthe, Nicolas Mellado   +4 more
wiley   +1 more source

Twisted Baker–Akhiezer function from determinants

European Physical Journal C: Particles and Fields
General description of eigenfunctions of integrable Hamiltonians associated with the integer rays of Ding–Iohara–Miki (DIM) algebra, is provided by the theory of Chalykh Baker–Akhiezer functions (BAF) defined as solutions to a simply looking linear ...
A. Mironov, A. Morozov, A. Popolitov
doaj   +1 more source

Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis

Computer Graphics Forum, EarlyView.
Abstract We investigate the evaluation of points and derivatives of Bézier curves and surfaces on modern architectures, focusing on performance and guided by numerical error bounds. While the de Casteljau algorithm remains the reference for numerical robustness, its linear working‐set size imposes substantial register pressure on GPUs.
Gábor Valasek, Anna Lili Horváth
wiley   +1 more source

Phong‐Rodrigues Extrinsic Vector‐Field Processing

Computer Graphics Forum, EarlyView.
Abstract We introduce a new extrinsic discretization of tangent vector fields on triangle meshes that is continuous, with bounded derivatives that are continuous almost everywhere, supporting pointwise evaluation and integration of differential operators.
Hongyi Liu, Oded Stein, Amir Vaxman, Mirela Ben‐Chen, Misha Kazhdan   +4 more
wiley   +1 more source