Related Experiment Video

Updated: Jan 29, 2026

Comparing Eye-tracking Data of Children with High-functioning ASD, Comorbid ADHD, and of a Control Watching Social Videos
05:32

Comparing Eye-tracking Data of Children with High-functioning ASD, Comorbid ADHD, and of a Control Watching Social Videos

Published on: December 7, 2018

9.7K

Kinematic analysis of fast pen strokes in children with ADHD

Patricia Laniel1, Nadir Faci2, Réjean Plamondon2

  • 1Department of Psychology, University of Montreal, Montreal, Quebec, Canada.

Applied Neuropsychology. Child
|February 7, 2019
PubMed

Keywords:
ADHDKinematic Theory of rapid human movementsSigma-lognormal modelchildrenfine motor controlhandwritingkinematic analysis

More Related Videos

The Impact of Motor Task Conditions on Goal-Directed Arm Reaching Kinematics and Trunk Compensation in Chronic Stroke Survivors15:00

The Impact of Motor Task Conditions on Goal-Directed Arm Reaching Kinematics and Trunk Compensation in Chronic Stroke Survivors

Published on: May 2, 2021

4.1K
Kinematic Analysis Using 3D Motion Capture of Drinking Task in People With and Without Upper-extremity Impairments08:45

Kinematic Analysis Using 3D Motion Capture of Drinking Task in People With and Without Upper-extremity Impairments

Published on: March 28, 2018

11.4K

Related Concept Videos

Kinematic Equations - I01:26

Kinematic Equations - I

When an object moves with constant acceleration, the velocity of the object changes at a constant rate throughout the motion. The kinematic equations of motions are derived for such cases where the acceleration of the object is constant. The first kinematic equation gives an insight into the relationship between velocity, acceleration, and time. We can see, for example:
15.2K
Kinematic Equations - II01:17

Kinematic Equations - II

The second kinematic equation expresses the final position of an object in terms of its initial position, the distance traveled with the initial constant velocity, and the distance traveled due to a change in velocity. Similar to the first kinematic equation, this equation is also only valid when the acceleration is constant throughout the motion of an object.
Suppose a car merges into freeway traffic on a 200 m long ramp. If its initial velocity is 10 m/s and it accelerates at 2 m/s2, then the...
13.7K
Kinematic Equations for Rotation01:30

Kinematic Equations for Rotation

In mechanics, when one observes a rigid body in rotational motion with constant angular acceleration, it is possible to establish equations for its rotational kinematics. This process resembles how linear kinematics are dealt with in simpler motion studies.
For instance, imagine a point A on a rigid body engaged in circular motion. The translational velocity of this particular point can be calculated by taking the time derivatives of the displacement equation, which essentially measures the...
807
Kinematic Equations - III01:18

Kinematic Equations - III

The first two kinematic equations have time as a variable, but the third kinematic equation is independent of time. This equation expresses final velocity as a function of the acceleration and distance over which it acts. The fourth kinematic equation does not have an acceleration term and provides the final position of the object at time t in terms of the initial and final velocities. This equation is useful when the value of the constant acceleration is unknown.
Using the kinematic equations,...
10.8K
Kinematic Equations: Problem Solving01:15

Kinematic Equations: Problem Solving

When analyzing one-dimensional motion with constant acceleration, the problem-solving strategy involves identifying the known quantities and choosing the appropriate kinematic equations to solve for the unknowns. Either one or two kinematic equations are needed to solve for the unknowns, depending on the known and unknown quantities. Generally, the number of equations required is the same as the number of unknown quantities in the given example. Two-body pursuit problems always require two...
28.1K
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
936