combination:
$$
\overrightarrow{v_1}, \overrightarrow{v_2}, \overrightarrow{v_3} \cdots \overrightarrow{v_n} \in \mathbb{R}^n c_1 \overrightarrow{v_1}+c_2 \overrightarrow{v_2}+\cdots+c_n \overrightarrow{v_n}\left[\left(c_1 \rightarrow c_n\right) \in \mathbb{R}\right]
$$
span: $\vec{a}, \vec{b} \in \mathbb{R}$
The code of the bouncing all and more projects.
I’ve learnt Processing JavaScript a little and have some complete projects. They are very simple but I think they are not ugly.
In order to post my note of linear algebra, I need to know how to put matrix using LaTex. The followings are the usage.
intro:
$\left[\begin{array}{lll}x & x & x\end{array}\right] \rightarrow$ element amount $(n)=n$ dimension
$\mathbb{R}^n$ (e.g. n = 3 3 Dimension)
To describe supervised learning,we establish notation for future use.
**$x^i$ **denote the input variables also called input features
**$y^i$ ** denote the output variables also called target variables that we are trying to predict.
A pair **($x^i, y^i$) **is called a training set.
we just find the position of the character '.' and '/' and '%' and reverse the string before and after the character and omit the front zeros.
Every time I use find function in C++ , I always search its usage after using it for so many times. So I decide to make a summary of some commonly used usages.
KMP is an algorithm that find the given pattern string in the pending string. Usually we would think of violent traversing the two strings using for loop. However the time complexity of this method is O(n)~O(mn). So the KMP can cut the times of loop.
