To prove properties on Finite State Machines, we can construct a proof:

• stating an invariant
• proving that the invarient is true for all states
• for all transitions: assume invarient is true before transition and prove that its true after

So, essentially induction.

flux is the volume of flow per unit time: multiplying the speed of flow \(\frac{m}{s}\) against the area \(m^{2}\) gives you the volume flowed per second \(\frac{m^{3}}{s}\).

tilted flux

Flow, however, is not necessarily perpendicular to the plain. Therefore, we only analyze the perpendicular component of the flow: that is — \(\Phi = Av \cos \theta\). Why? If we tipped the plane (of certain area) up, the flow that used to cross the bottom of the plane now will not go through the plane, so we want to account for that.

Abstract

Alzheimer’s Disease (AD) is a demonstrativeness disease marked by declines in cognitive function. Despite early diagnoses being critical for AD prognosis and treatment, currently accepted diagnoses mechanisms for AD requires clinical outpatient testing with a medical professional, which reduces its accessibility. In this work, we propose a possible feature extraction mechanism leveraging the previously demonstrated errors of Hidden Markov-based forced alignment (FA) tools upon cognitively impaired patients as an automated means to quantify linguistic disfluency.

fork creates a second process that is an exact clone from the first.

The original process is called the parent, the child process is called the child. The child comes in at the next instruction after fork. This means that fork calls once, returns twice. After fork, the execution order between both processes is completely up to the OS. After fork, we cannot assume execution order.

Fork’s return value is different between parent and child: