Summary

This study used the Monte Carlo method to calculate fast neutron backscattering from water. Results detail neutron reflection properties and their dependence on source energy and scattering order.

Related Concept Videos

Reflection of Waves01:07

Reflection of Waves

When a wave travels from one medium to another, it gets reflected at the boundary of the second medium. A common example of this is when a person yells at a distance from a cliff and hears the echo of their voice. The sound waves (longitudinal waves) traveling in the air are reflected from the bounding cliff. Similarly, flipping one end of a string whose other end is tied to a wall causes a pulse (transverse wave) to travel through the string, which gets reflected upon reaching the wall. In...
4.5K
The Sense of Self: Reflected Self-Appraisal and Social Comparison02:57

The Sense of Self: Reflected Self-Appraisal and Social Comparison

According to Charles Cooley, we base our image on what we think other people see (Cooley 1902). We imagine how we must appear to others, then react to this speculation. We don certain clothes, prepare our hair in a particular manner, wear makeup, use cologne, and the like—all with the notion that our presentation of ourselves is going to affect how others perceive us. We expect a certain reaction, and, if lucky, we get the one we desire and feel good about it. But more than that, Cooley...
55.5K
States of Water01:23

States of Water

Water exists in any one of the three classical states: solid (ice), liquid (water), and gas (steam or water vapor). The state of water depends on i) the intermolecular forces that draw molecules together and ii) the kinetic energy that leads to movements that pull them apart.
Water freezes when the intermolecular forces are greater than the kinetic energy. Unlike most other substances, water is less dense in its solid state than in its liquid state. This is because each water molecule can form...
56.5K
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...
927