+ This "Summary Page" provides both an overview of the rater as a whole + and a breakdown of all of its details on an intimate level. +
+As is customary for many mathematical notations in CS, this system uses @@ -2091,37 +2096,44 @@
+ All sequences/arrays of values are represented as matrices. + For one-dimensional arrays, column vectors are used; written + horizontally, their notation is + \(\left[\begin{array}\\x_0 & x_1 & \ldots & x_n\end{array}\right]^T\), + where the \(T\) means "transpose". +
In the equations represented above, it is to be assumed that undefined - values in a set are implicitly 0; this simplifies the representations of + values in a vector are implicitly \(0\); this simplifies the representations of the various summations; they are not intended to be vigorous.
- For example: let \( x \) = \( \{ 1, 2, 3 \} \). Given the equation \( + For example: let \( x \) = \( \left[\begin{array}\\1 & 2 & 3\end{array}\right]^T \). Given the equation \( \sum_k x_k \), it is assumed that the solution is \( 1 + 2 + 3 = 6 \), not undefined. Formally, the former sum is to be interpreted as: \( - \sum_{k=0}^n x_k \) where \( n \) is the length of set \( x \), or \( + \sum_{k=0}^n x_k \) where \( n \) is the length of vector \( x \), or \( \sum_k x_k [x_k \textrm{ is defined}] \) using Iverson's convention (the latter of which our first notation is based upon by simply omitting the brackets and implying their existence).