Advertisements

**Types of controls**

imperative – used to initiate a function

selection – used to select options or data

entry – used to enter data

display – used to directly manipulate the program visually

**Imperative controls** (commands immediate action)

– Buttons

– Butcons (icons as buttons)

– Hyperlinks

**Selection controls** (allows user to choose from a group of valid choices)

– checkboxes (can expand on butcon – latching button or toggle)

– flip flop buttons (may want to avoid)

– radio buttons (mutual, also radio butcon)

– combutcon – group of latching butcons that behave like a combo box

List controls (allows users to select from a finite set of text strings)

– list boxes or listviews

– dropdown

– earmarking (multiple checkboxes)

**Entry controls** (enable users to enter information into app)

– bounded and unbounded (use bounded controls for bounded input)

Bounded

– spinners (small edit field with 2 buttons attached, up/down arrows)

– dials and sliders

– thumbwheels

Unbounded (handle out of bounds data)

– text edit (validation – active/passive)

– clue boxes

**Display controls** (display and manage the visual presentation of info on screen)

– text controls

– scrollbars (thumb)

– splitters (think bootstrap with dividing screen into panes)

– drawers and levers

**Important Points and Concepts**

– When are 2 matrices multipliable? And what would the result look like?

– What are the ways we can multiply 2 matrices?

– What is an inverse matrix? And how do we find it?

*When are 2 matrices multipliable? And what would the result look like?*

Let A be an m x n matrix and B an n x m matrix. Can we multiply A and B?

An easy way to tell if 2 matrices are multipliable is to check if the number of columns of the matrix A is equal to the number of rows of matrix B. If they are, we can multiply them. The output will have the have the same number of rows as A and the same number of columns as B.

(m x n)(n x m) = m x m

In this case, AB will result in an m x m matrix, let’s call it C.

Let’s do another quick example: A(m x n)B(n x p) = C(???)

Matrix A is an m x n matrix and B is an n x p matrix. First, can we multiply them? And if so, what would the output look like in terms of rows and columns?

We can see that A has n rows, B has n columns, which means that we can multiply these 2 matrices. C would have the number of rows of A (m) and the number of columns in B (p). Therefore, C would be an m x p matrix.

*What are the ways we can multiply 2 matrices?*

Ways to multiply

These matrices are multipliable, the result is an 2 x 3 matrix.

Let’s call the first matrix P, the second matrix Q and the resulting matrix Z.

*What are the ways we can multiply 2 matrices?*

**Dot product **(standard way)

To find the top left number of Z, we take the first row of P [1, 2, 3] and the first column of Q [7, 9, 11]. We perform an operation called the dot product, which looks like this: (1, 2, 3) * (7, 9, 11).

The operation produces (1 * 7) + (2 * 9) + (3 * 11) and the top left number of Z results in 58.

For the top right value, we perform the same operation with the same row [1, 2, 3] but a different column. Instead we use the second column of Q [8, 10, 12] since we are trying the find the (1, 2) value of Z. Notice how change which row and column we are multiplying based on the row and column of Z.

The operation produces this: (1 * 8) + (2 * 10) + (3 * 12) and the top left number of Z is 64.

I won’t solve it all the way, but you get the idea. For the bottom left of Z (2, 1), we’d be taking the dot product of the second row of P and the first column of the Q.

**Column Way** (columns of Z are combinations of columns of P)

How do we multiply a matrix by a column?

Let’s find the first column of Z: P times first column of Q.

And that’s it, we repeat this process for each column of Q to produce each column of Z.

**Row way** (rows of Z are combinations of rows of Q)

How do we multiply a row by a matrix?

Let’s find the first column of Z: the first row of P times Q.

Very similar to the column way. We repeat this process for each row of P.

**Columns x Rows**

Columns of P times a row of Q = (2 x 1) x (1 x 3). We get a 2 x 3 matrix.

A quick example:

The first row of the result [2 * 1, 2 * 6] is [2, 12]. The second row is [3 * 1, 3 * 6] is [3, 18] and the third row is [4, 24]. The pattern is easy to see.

**Block**

Let’s say we want to multiply matrices A and B, both are 20 x 20 matrices. The main concept is that we can break up matrices into blocks. We can break up A into 4 10 x 10 matrices and B into 4 10 x 10 matrices. Simply multiply the top left blocks of A and B, and we get the top left matrix of the resulting matrix (AB).

**What is an inverse matrix? And how do we find it?**

Let A be a square matrix.

The inverse of A times A is the identity matrix, I. And this works both ways for square matrices only.

**A matrix has no inverse if**

– The determinant is zero (the left diagonal numbers multiplied together minus the right diagonal multiplied together is zero)

– Both columns lie on the same line (for example if the second column in a 2 x 2 matrix is a multiple of the first)

– you can find a vector x with Ax = 0, (x!=0)

**Gauss – Jordan** (solve 2 equations at once)

Solve for the inverse.

First, create an augmented matrix that includes the identity.

Recreate the identity matrix on the left side of this matrix using elimination and the right side will become the inverse.

The process is elimination the usual way, top down. Once we reach the bottom, we perform elimination bottom up to reproduce the identity matrix.

And you can see, the right side becomes the inverse of our original matrix.

**Important point: **A matrix times a column is a column, a matrix times a row is a row

Given the following equations, solve for x, y, and z using elimination and back substitution:

We start by forming our matrix, leaving out the right side of the equations.

Using elimination, our goal is to turn our original matrix into one that looks like this where n represents some arbitrary number:

To get to this destination we:

– go row by row

– keep the first row

– determine what number multiplied to the row above when subtracted

by the current row will get us closer our destination matrix

Step by step, here are what the matrices will look like

Let’s start with our original matrix.

We keep the first row, so we take a look at the second row. We ask ourselves: What must I do to the first row ([1, 2, 1]) such that when subtracted by the second row ([3, 8, 1]), the first number is a zero? Our aim is to get a row that look like this ([0, n, n], again n being any arbitrary number). The answer is that we must multiply the first row by 3, which will give us [3, 6, 3]. We then subtract this by the second row to give us [0, 2, -2]. We now work with this new matrix when going to the third row.

We repeat this step for our new matrix.

We have to get a row that looks like [0, 0, n]. As we can see, we’re already halfway there since we were given the first 0 to begin with. Same process for the other 0: what must I do to the row above ([0, 2, 2]) such that when subtracted by the third row ([0, 4, 1]) the first two numbers are zero? Similar to the process above, we must multiply the second row by 2, which will give us [0, 4, -4]. We then subtract this by the third row to give us [0, 0, 5]. Now, we have our final matrix.

**Pivot numbers**

The diagonal line of numbers starting from the top-left (1, 2, 5) are called pivot numbers. An important note is that if any of these numbers were zero to start with, we would have to switch rows around and try again.

**Right hand side**

Notice we haven’t touched the right side of the equations yet, but that’s an easy step to do afterwards. This is also the way software solves systems of equations.

Let’s take our matrices we solved through and let’s augment them by including the numbers from the right hand side of the equations. These matrices are known as augmented matrices.

You get the new fourth column by following a similar process of taking the multiplier, multiply the number above the row in question and subtracting the current row number by that value.

For example, the number we multiplied the first row in the un-augmented matrices was a 3. We start in the second row and multiply the 2 in the first by 3 to make 6. Subtract the 12 in the second row by the 6 and we get 6, which is our new second row value.

Our new equations are:

Very simple from this point, start with the last equation and move up, solving for a variable at a time. The solutions turns out to be: z = -2, y = 1, x = 2.

Let’s use the first and second matrices of our un-augmented matrices as an example. What matrix do I multiply the first matrix by to get the second matrix? How do I subtract 3x from row 1 from row 2?

We’ll start with the identity matrix which when multiplied by some matrix, gives you back that same matrix. We need to fix this so that we have 3 of row 1 subtracted from row 2. Here is the solution.

**Important point: **Matrices are noncommutative, so order matters!

How to switch rows of a matrix

**Inverses**

How to undo elimination: Simply switch a sign to get back to the identity matrix

Ax = b is a big theme.

A = matrix, x = vector of unknowns, and b = solution vector or point

Main questions:

Can I solve Ax = b for every b?

Do the linear combinations of the columns fill 3D space? (for our 3D example below, yes it does)

Find the x and y values that satisfy both equations.

**Row Picture**

The coefficients of the left side of the first equation become the first row of the first matrix. The coefficients of the the left side of the second question become the second row of the first matrix.

First equation coefficients are -2 and -1.

Second equation coefficients are -1 and 2.

Both are displayed below in their own matrix.

Next is the vector containing the 2 unknowns: x and y.

Lastly the matrix times the vector (also known as taking the dot product)

is equal to the vector containing the numbers on the right side of the given equations.

With the column picture, you plot the lines, see where they intersect and that is your solution: x = 1, y =2.

**Column Picture**

Take the first and second columns from the previous matrix and multiply them by their corresponding unknown: x and y. Add these vectors together and have them equal to the same previous vector.

When we plot these vectors and use the answer x = 1, y = 2 from from before, we start by putting together 1 of the x vectors and 2 of the y vectors. The vector between the beginning point and the ending point is your solution. Again x = 1, y = 2.

The solutions from the column and row pictures are easy to see at this point, no reason to use one over the other when dealing with 2 equations and 2 unknowns. Now on the 3 equations and 3 unknowns.

Same process as above. However, when it comes to plotting the 3 planes and finding the intersecting point, it gets tricky to visualize.

A ton easier when it comes to plotting, only 3 vectors need to be plotted. It’s a lot easier to visualize and to find the solution vector.

Famo.us: near native experiences on mobile, 60FPS, works across all screen sizes, browsers, operating systems, and is entirely in Javascript. Everyone wants the advantages of Famo.us, but nobody wants to learn it. And for good reason, it’s a burgeoning framework, it has a steep learning curve (what in the world are surfaces and modifiers), and is still pretty buggy.

Over the past month, I’ve been working with 3 other software engineers from Hack Reactor. And with the help from the VP of product at Famo.us, we have designed a framework on top of Famo.us that provides a low level abstraction layer to lower the barrier to entry for developers.

We call it Famo.us UI. There are no more surfaces and modifiers. There are no more syncs for each input (scroll, touch, mouse). And there is less code to write, a LOT of less code to write. In this post, I’ll discuss the high level overview of what Famo.us UI is, specifically the role of elements. There won’t be much code in this post.

Elements are the best of surfaces and modifiers put together. You interact with them like surfaces but they behave like modifiers. In the standard Famo.us, creating something as simple as creating and centering a button on the screen went something like this.

**Standard Famo.us**

- Create a button surface
- Set the size, content, and CSS properties on the button surface
- Create a button modifier
- Set the align and origin on the modifier to [0.5, 0.5]
- Add the button modifier to the main context
- Add the button surface to the main context

**Famo.us UI**

- Create a button element
- Set the size, content, CSS properties, align, and origin on the element
- Add the button element to the main context

We have reduced the number of required steps in half and the mental load of working with Famo.us UI is much lower. We have reduced the code by about 40-60% and have completely abstracted away surfaces and modifiers into something much more intuitive – elements.

Some of you might have seen us at the last Famo.us meetup where we had a demo booth alongside Adobe, Intel, Facebook and Angular. Famo.us UI is currently in the private Famo.us Gitlabs. More to come later, with code samples as well.

Famo.us is only just a few months old, but has been gaining traction in the way of integrations that are currently available for the framework. Here are the many different types of integrations that are currently out and also some in the works.

**Currently Available**

- Use d3’s data-binding and Famo.us’ surfaces and rendering capabilities to create awesome charts and graphs

- Focus on the front-end and let Firebase take care of the rest

- Give Famo.us some structure with the newly released Famo.us/Angular

- For those that can’t get enough Meteor

- Famo.us with Facebook’s React

- Add map components to the Famo.us render tree and also use Famo.us modifiers to pan the map and sync the position of renderables

**Future Integrations**

As hinted at by the Famo.us CEO, Steve Newcomb, here are some of the integrations that are currently in the works.

- Famo.us + Backbone
- Famo.us + Ember

**Will keep up-to-date, subscribe to be notified of new integrations.**