Maxima and Minima

A function has an global maximum at a if f(a) ≥ f(x) for all x in D, domain of f. f(a) is called the maximum value of f on D.

A function has an global minimum at a if f(a) ≤ f(x) for all x in D, domain of f. f(a) is called the minimum value of f on D.

If a function is a continuous on a closed interval [a, b], then the function attains both an absolute maximum value M and an absolute minimum value m in [a, b]. It means, there are numbers c and d in [a, b] with f(c) = M and f(d) = m and m ≤ f(x) ≤ M for every other x in [a, b].

This is called Extreme Value Theorem. The theorem doesn't apply to functions which are not continuous on [a, b].

A function has a local maximum at a point a if f(a) ≥ f(x) for all x in some open interval containing a.

A function f has a local minimum at a point a if f(a) ≤ f(x) for all x in some open interval containing a.

If f has a local maximum or minimum at a, and if f'(a) exists, then f'(c) = 0.

Gaussian Elimination - Row reduction Algorithm

Gaussian elimination is a method for solving matrix equations of the form, Ax=b. This method is also known as the row reduction algorithm. Back Substitution Solving the last equation for the variable and then work backward into the first equation to solve it. The fundamental idea is to add multiples of one equation to the others in order to eliminate a variable and to continue this process until only one variable is left. Pivot row The row that is used to perform elimination of a variable from other rows is called the pivot row. Example: Solving a linear equation The augmented matrix for the above equation shall be The equation shall be solved using back substitution. The eliminating the first variable (x1) in the first row (Pivot row) by carrying out the row operation. As the second row become zero, the row will be shifted to bottom by carrying out partial pivoting. Now, the second variable (x2) shall be eliminated by carrying out the row operation again. ...

Decision Tree - Gini Index

The Gini index is used in CART. The Gini index measures the impurity of the data set, where p i - probability that data in the data set, D belong to class, C i and pi = |C i,D |/|D| There are 2 v - 2 possible ways to form two partitions of the data set, D based on a binary split on a attribute. Each of the possible binary splits of the attribute is considered. The subset that gives the minimum Gini index is selected as the splitting subset for discrete valued attribute. The degree of Gini index varies between 0 and 1. The value 0 denotes that all elements belong to a certain class or if there exists only one class, and the value 1 denotes that the elements are randomly distributed across various classes. A Gini Index of 0.5 denotes equally distributed elements into some classes. The Gini index is biased toward multivalued attributes and has difficulty when the number of classes is large.

Cache Memory

The supplementary memory system that temporarily stores frequently used instructions and data for quicker processing by CPU of a computer. Main memory consists of up to 2n addressable words, with each word having a unique n-bit address. there are M = 2n/K fixed length of blocks in main memory. where K - words The cache consists of m blocks called lines. The length of a line, not including tag and control bits, is the line size. As there are more blocks in main memory than lines in cache, an individual line cannot be uniquely and permanently dedicated to a particular block. Thus, each line includes a tag that identifies which particular block is currently being stored. The cache connects to the processor via data, control, and address lines. When a cache hit occurs, the data and address buffers are disabled and communication is only between processor and cache, with no system bus traffic. When a cache miss occurs, the desired address is loaded onto the system bus and the data are r...

The Data Ilm

Search This Blog