Chapter 5 Differentiation and Integration
Limits (Summary)
The limit of a function
Definition 1
We write \[lim_{x\to a}f(x)=L\] and say “the limit of \(f(x)\), as \(x\) approaches \(a\), equals \(L\)”
if we can make the values of \(f(x)\) arbitrarily close to \(L\) (as close to \(L\) as we like) by taking \(x\) to be sufficiently close to \(a\) (on either side of \(a\)) but not equal to \(a\)
One-sided limits
Definition 2
We write
\[lim_{x\to a^-}f(x)=L\] and say the left-hand limit of \(f(x)\) as \(x\) approaches \(a\) [or the limit of \(f(x)\) as \(x\) approaches \(a\) from the left] is equal to \(L\) if we can make the values of \(f(x)\) arbitrarily close to \(L\) by taking \(x\) to be sufficiently close to \(a\) and \(x\) less than \(a\).
Notice that Definition 2 differs from Definition 1 only in that we require \(x\) to be less than \(a\).
Similarly, if we require that \(x\) be grater than \(a\), we get “the right-hand limit of \(f(x)\) as \(x\) approaches \(a\) is equal to \(L\)” and we write \[lim_{x\to a^+}f(x)=L\]
5.0.1 Relationship between the limit and one-side limits
\[lim_{x\to a}f(x)=L \;\;\;\text{if and only if }\;\;\; lim_{x\to a^-}f(x)=L \;\;\text{and}\;\; lim_{x\to a^+}f(x)=L\]
That is, \[lim_{x\to a}f(x)=L \Rightarrow lim_{x\to a^-}f(x)= lim_{x\to a^+}f(x)=L\] \[lim_{x\to a^-}f(x)= lim_{x\to a^+}f(x)=L \Rightarrow lim_{x\to a}f(x)=L\] \[lim_{x\to a^-}f(x) \ne lim_{x\to a^+}f(x) \Rightarrow lim_{x\to a}f(x) \text{ Does Not Exist }\]
Properties
Assume \(lim_{x\to a}f(x)\) and \(lim_{x\to a}g(x)\) both exist and \(c\) is any number then,
\(lim_{x\to a}[cf(x)] = c\;lim_{x\to a}f(x)\)
\(lim_{x\to a}[f(x) \pm g(x)] = lim_{x\to a}f(x) \pm lim_{x\to a}g(x)\)
\(lim_{x\to a}[f(x)g(x)] = lim_{x\to a}f(x) lim_{x\to a}g(x)\)
\(lim_{x\to a}\left[\frac{f(x)}{g(x)}\right] = \frac{lim_{x\to a}f(x)}{lim_{x\to a}g(x)}\) provided \(lim_{x\to a}g(x) \ne 0\)
\(lim_{x\to a}[f(x)]^n = [lim_{x\to a}f(x)]^n\)
Continuous functions
Definition3
A function \(f\) is continuous at a number \(a\) if
\[lim_{x\to a}f(x)=f(a)\]
Notice that Definition 3 implicitly requires three things if \(f\) is continuous at \(a\):
- \(f(a)\) is defined (that is, \(a\) is in the domain of \(f\))
- \(lim_{x\to a}f(x)\) exits
- \(lim_{x\to a}f(x) = f(a)\)
5.1 Differentiation
5.1.1 Derivative and tangent lines
<IP_ADDRESS> Geometric meaning of the derivative
- The steepness of a line can be determined by its slope.
- The steepness of the graph of a function (\(f\)) at a given point on it (say \((x_0, f{(x_0)})\)), can be approximated by its tangent line at that point.
- The slope of the tangent line at a point on the function is equal to the derivative of the function at that point
- The derivative of \(f\) at \(x_0\) is denoted by \(f^\prime (x_0)\)
- The direct computation of the slope of the tangent line is not possible as we are given only one point \((x_0, f{(x_0)})\).
- Instead, we consider the secant line through two points: \((x_0, f{(x_0)})\) and \((x, f{(x)})\), on the graph of \(f\).
- As \(x\) approaches \(x_0\), the secant line is approaching to the tangent line.
- As \(x\) varies, the secant line turns about the fixed point \((x_0, f{(x_0)})\).
- We can describe the tangent line as the limiting line of the secant line when \(x\) approaches \(x_0\) from either direction.
- As we move on the secant line from \((x_0, f{(x_0)})\) to \((x, f{(x)})\)
- the rise is \(f(x) - f(x_0)\)
- the run is \(x - x_0\).
- Therefore, \[\text{The slope of the secant line} = \frac{f(x) - f(x_0)}{x - x_0} \text{ for } x\neq x_0.\]
- To have the derivative be the slope of the tangent line, we define it as the limit of the slope of the secant line.
Definition 1: Tangent line
The tangent line to the curve \(f\) at the point \((x_0, f(x_0))\) is the line through that point with slope \[m = lim_{x\to x_{0}}\frac{f(x)-f(x_0)}{x-x_0}\]
provided that this limit exists
Definition 2
The derivative of a function \(f\) at \(x_0\) is \[f^{\prime}(x_0) = lim_{x\to x_{0}}\frac{f(x) - f(x_0)}{x-x_0}\] provided this limit exists and is finite.
- If this limit does not exist or if it is infinite, we say that \(f\) does not have a derivative at \(x_{0}\)
Example 1 Compute the derivative of the function \(x^2\) at \(x=1\), using the definition of derivative
The geometric interpretation of the above solution
- The derivative is the slope of the tangent line to the graph at the point \((1,1)\). ( \(f^\prime(1) = 2\))
- The secant line has slope \(x+1\), and the limit of that slope as x tends to 1 is the slope 2 of the tangent line
<IP_ADDRESS> Equations of the tangent lines
- When we compute the derivative, \(f^\prime(x_0)\), we can give an equation for the tangent line at \((x_0, f(x_0))\) on the graph of \(f\).
- The tangent line has the equation \[y-f(x_0)= f^\prime(x_0)(x-x_0)\]
Example 2
Give the equation for the tangent line to the parabola \(y=x^2\) at \(x=1\).
<IP_ADDRESS> Important properties
1. Differentiable functions are continuous
- A function must be continuous at any point where it has a derivative.
Theorem
If the derivative \(f^\prime(x_0)\) exists, then the function \(f\) is continuous at \(x_{0}\).
2. Continuous functions that do not have derivative
The converse of the above theorem is false; that is, there are functions that are continuous but not differentiable.
This usually occurs in one of the two ways:
- When the graph of \(f\) has a vertical tangent line at a given point. (The slope of the secant line \(\frac{f(x) - f(x_0)}{x-x_0}\) tends to \(\infty\) or to \(-\infty\) as \(x\) tends to \(x_0\))
- When the secant line has different limits as \(x\) tends to \(x_0\) from the left and from the right (i.e. when the graph has a sharp corner or a cusp at \(x=x_0\)).
The graph of a function will not have a tangent line at a point where the function is discontinuous.
- This graph does not have a tangent line at \(x=x_{0}\)
- Therefore, the function \(f\) does not have a derivative at \(x_{0}\).
5.1.2 Leibniz notation and derivative as a function
5.1.2 Leibniz notation and derivative as a function
In the Leibniz notation the derivative of \(f\) at \(x_0\) is denoted by the symbol \(\frac{df}{dx}(x_0)\)
With Leibniz notation the definition of the derivative reads
\[\frac{df}{dx}(x_0)= lim_{x\to x_{0}}\frac{f(x)-f(x_0)}{x-x_0}\]
We set \(\Delta x = x-x_0.\)
Then \(x = x_0+ \Delta x\).
Let \(\Delta f\) for the change \(f(x_0 + \Delta x) - f(x_0)\) in the value of \(f\) that occurs when we change \(x\) by \(\Delta x\) from \(x_0\) to \(x_0+\Delta x\)
Then the slope of the secant line takes the form
\[\frac{f(x_0 +\Delta x)-f(x_0)}{\Delta x }= \frac{\Delta f}{\Delta x}.\]
Now the definition of the derivative reads
\[\frac{df}{dx} (x_0) = lim_{\Delta x\to 0}\frac{\Delta f}{\Delta x}= lim_{\Delta x\to 0} \frac{f(x_0 +\Delta x)-f(x_0)}{\Delta x }\]
Example 3
Use the above definition of the derivative to compute \(\frac{df}{dx}(3)\) where \(f(x)=x^2\)
<IP_ADDRESS> The derivative as a function
So far we considered derivatives at a given value of x
If we consider the derivative at a variable \(x\), we get the derivative function \(\frac{df}{dx}\) whose value \(\frac{df}{dx}(x)\) is the slope of the tangent line to the graph of f at the point \((x, f(x)).\)
\[\frac{df}{dx}(x) =lim_{\Delta x\to 0}\frac{f(x+\Delta x) -f(x)}{\Delta x}\]
5.1.3 Derivatives of polynomials and exponential functions
<IP_ADDRESS> Derivative of a constant function
\[\frac{d}{dx}(c) = 0\]
<IP_ADDRESS> Power functions
- We now look at the functions \(f(x) = x^n\).
Pascal’s Triangle and the Binomial Theorem
Binomial Expansions Using Pascal’s Triangle
Consider the following expanded powers of \((a + b)^n\), where \(a + b\) is any binomial and \(n\) is a whole number. Look for patterns.
\((a+b)^0 = 1\)
\((a+b)^1 = a+b\)
\((a+b)^2 = a^2+2ab+b^2\)
\((a+b)^3 = a^3+3a^2b+3ab^2+b^3\)
\((a+b)^4 = a^4+4a^3b+6a^2b^2+4ab^3+b^4\)
\((a+b)^5 = a^5+5a^4b+10a^3b^2+10a^2b^3+5ab^4+b^5\)
Each expansion is a polynomial.
- Blaise Pascal found a numerical pattern, called Pascal’s Triangle
- Pascal’s Triangle gives us the coefficients for an expanded binomial of the form \((a + b)^n\), where \(n\) is the row of the triangle.
Binomial Theorem
- According to the Binomial Theorem, if \(a\) and \(b\) are any real numbers and \(k\) is a positive integer, then
\[(a+b)^n = a^n + na^{n-1}b+\frac{n(n-1)}{2!}a^{n-2}b^2+ \frac{n(n-1)(n-2)}{3!}a^{n-3}b^3 +\]
\[\dots + \frac{n(n-1)(n-2)\dots (n-k+1)}{n!}a^{n-k}b^k + \dots + nab^{n-1}+b^n\]
The traditional notation for the binomial coefficients is \[{n \choose 0}=1\]
\[{n \choose k}=\frac{n(n-1)(n-2)\dots (n-k+1)}{k!}\] \(n=1,2,\dots, k\)
which enables us to write the Binomial Theorem in the abbreviated form
\[(a+b)^n = \sum_{k=0}^n {n \choose k }a^{n-k}b^k = \sum_{k=0}^n {n \choose k }a^{k}b^{n-k}.\]
Example 1
\(f(x)=x\)
Example 2
\(f(x)=x^2\)
Example 3
\(f(x)=x^3\)
Example 4
\(f(x)=x^4\)
The Power Rule
If \(n\) is a positive integer, then
\[\frac{d}{dx}(x^n)=nx^{n-1}\]
Functions with negative integer exponents
Example 5
\(f(x)=\frac{1}{x}\)
When the exponent is a fraction
Example 6
\(f(x)=\sqrt{x}\)
The Power Rule (General version)
If \(n\) is any real number, then
\[\frac{d}{dx}(x^n)=nx^{n-1}\]
<IP_ADDRESS> The constant multiple rule
If \(c\) is a constant and \(f\) is a differentiable function, then
\[\frac{d}{dx}[cf(x)]= c\frac{d}{dx}f(x)\]
Example 7
\(f(x)=3x^4\)
<IP_ADDRESS> The Sum Rule
If \(f\) and \(g\) are both differentiable, then
\[\frac{d}{dx}[f(x)+g(x)]= \frac{d}{dx}f(x)+ \frac{d}{dx}g(x)\]
- The Sum Rule is applicable to the sum of any number of functions
<IP_ADDRESS> The Difference Rule
If \(f\) and \(g\) are both differentiable, then
\[\frac{d}{dx}[f(x)-g(x)]= \frac{d}{dx}f(x)- \frac{d}{dx}g(x)\]
- The Constant Multiple Rule, the Sum Rule and the Difference Rule can be combined with the Power Rule to differentiate any polynomial.
Example 8
Differentiate \(f(x)=x^4 - 6x^2+4\)
Find the points on the curve \(f(x)=x^4-6x^2+4\) where the tangent line is horizontal
<IP_ADDRESS> Exponential Functions
Exercise:
Compute the derivative of the exponential function \(f(x) = a^x\) using th definition of a derivative
Definition: Definition of the number \(e\)
\(e\) is the number such that
\[lim_{h\to 0}\frac{e^h -1}{h}=1\]
If we put \(a=e\) and , then, \(f^\prime(0)=1\).
Then derivative of the Natural Exponential Function \[\frac{d}{dx}(e^x)= e^x\]
Therefore, the exponential function, \(f(x) = e^x\) has the property that it is its own derivative.
Geometrically, this means that the slope of the tangent line to the curve \(f(x) = e^x\) is equal to the y-coordinate of the point.
Example 9
If \(f(x)=e^x-x\), find \(f^\prime(x)\)
5.1.4 The product and quotient rules
<IP_ADDRESS> The product rule
If \(f\)and \(g\) are both differentiable, then
\[\frac{d}{dx}[f(x)g(x)]= f(x)\frac{d}{dx}[g(x)]+ g(x)\frac{d}{dx}[f(x)]\]
Example 10
If \(f(x)=xe^x\), find \(f^\prime(x)\)
<IP_ADDRESS> The quotient rule
If \(f\)and \(g\) are both differentiable, then
\[\frac{d}{dx}[\frac{f(x)}{g(x)}]= \frac{g(x)\frac{d}{dx}[f(x)]- f(x)\frac{d}{dx}[g(x)]}{[g(x)]^2}\]
Example 11
If \(f(x)=\frac{x^2+x-2}{x^3+6}\), find \(f^\prime(x)\)
5.1.5 The chain rule
If \(y=f(u)\) and \(u=g(x)\) are both differentiable functions, then
\[\frac{dy}{dx} = \frac{dy}{du}\frac{du}{dx} \]
Example 12
If \(f(x)=\sqrt{x^2+1}\), find \(f^\prime(x)\) using chain rule.
<IP_ADDRESS> The power rule combined with the chain rule
If \(n\) is any real number and \(u=g(x)\) is differentiable, then
\[\frac{d}{dx}(u^n)= nu^{n-1}\frac{du}{dx}\]
Alternatively,
\[\frac{d}{dx}([g(x)]^n)= n[g(x)]^{n-1}\frac{d}{dx}g(x)\]
Example 13
If \(f(x)=(x^3-2)^{100}\), find \(f^\prime(x)\)
Example 14
If \(f(x)=\frac{1}{(x^2+x+1)^{1/3}}\), find \(f^\prime(x)\)
5.1.6 Partial Derivatives
If \(f\) is a function of two variables, its partial derivatives are the functions \(f_x\) and \(f_y\) defined by
\[f_x=f_x(x,y)=lim_{h\to 0}\frac{f(x+h,y)-f(x,y)}{h}\]
\[f_y=f_y(x,y)=lim_{h\to 0}\frac{f(x,y+h)-f(x,y)}{h}\]
There are many alternative notations for partial derivatives.
Instead of \(f_x\), it can be written as \(f_1\) or \(D_1f\) to indicate that the differentiation is with respect to the first variable.
Another notation is \(\frac{\partial f}{\partial x}\).
But here \(\frac{\partial f}{\partial x}\) can’t be interpreted as a ratio of differentials.
Notations for Partial Derivatives
If \(z=f(x,y),\) we write
\[f_x=f_x(x,y)= \frac{\partial f}{\partial x}= \frac{\partial }{\partial x}f(x,y)= \frac{\partial z }{\partial x}= f_1=D_1f= D_xf \]
\[f_y=f_y(x,y)= \frac{\partial f}{\partial y}= \frac{\partial }{\partial y}f(x,y)= \frac{\partial z }{\partial y}= f_2=D_2f= D_yf \]
The partial derivative with respect to \(x\) is just the ordinary derivative of the function of a single variable that we get by keeping \(y\) fixed.
Therefore, we have the following rule.
Rule for finding Partial Derivatives of \(z=f(x,y)\)
To find \(f_x\), regard \(y\) as a constant and differentiate \(f(x,y)\) with respect to \(x\).
To find \(f_y\), regard \(x\) as a constant and differentiate \(f(x,y)\) with respect to \(y\).
Example 15
If \(f(x,y)=x^3+x^2y^3-2y^2\), find \(f_x(2,1)\) and \(f_y(2,1)\)
5.1.7 Higher Derivatives
If \(f\) is a differentiable function, then its derivative \(f^\prime\) is also a function.
It is denoted by \((f^\prime)^\prime = f^{\prime\prime}\).
This \(f^{\prime\prime}\) is called the second derivative of \(f\) as it is the derivative of the derivative of \(f\).
Using Leibniz notation we can write the second derivative of \(f\) as follows:
\[\frac{d}{dx}(\frac{dy}{dx})= \frac{d^2y}{dx^2}\]
Another notation is \(f^{\prime\prime}= D^2f(x)\).
We can interpret \(f^{\prime\prime}\) as the slope of the curve \(y=f^{\prime}(x)\) at the point \((x, f^\prime(x))\).
In other words, it is the rate of change of the slope of the original curve \(f(x)\).
The third derivative \(f^{\prime\prime\prime}\) is the derivative of the second derivative: \(f^{\prime\prime\prime} = (f^{\prime\prime})^\prime\).
Therefore, \(f^{\prime\prime\prime}(x)\) can be interpreted as the slope of the curve \(y= f^{\prime\prime}(x)\) or as the rate of change of \(f^{\prime\prime}(x)\)
Alternative notations for the third derivative:
\[y^{\prime\prime\prime} = f^{\prime\prime\prime}(x)=\frac{d}{dx}(\frac{d^2y}{dx^2})= \frac{d^3y}{dx^3}= D^3f(x)\]
In general, the \(n\)th derivative of \(f\) is denoted by \(f^{(n)}\) and is obtained from \(f\) by differentiating \(n\) times.
If \(y=f(x)\), \[y^{(n)} = f^{(n)}(x)= \frac{d^ny}{dx^n}= D^nf(x)\]
Example 16
If \(f(x)=x^3-7x^2-3x+5\)
5.1.8 Derivatives of logarithmic functions
\[\frac{d}{dx}(a^x)= a^xln(a)\]
\[\frac{d}{dx}(log_ax)= \frac{1}{xln(a)}\]
\[\frac{d}{dx}(lnx)= \frac{1}{x}\]
Example 17
If \(y=ln(x^3+1)\)
In general, if we combine derivatives of logarithmic functions with the chain rule. we get
\[\frac{d}{dx}{ln\text{ } u} = \frac{1}{u}\frac{du}{dx}\] or
\[\frac{d}{dx}{[ln\text{ } g(x)]} = \frac{g^\prime (x)}{g(x)}\]
5.1.9 Applications of differentiation
<IP_ADDRESS> Maximum and minimum values
1. Definition
A function \(f\) has an absolute maximum (or global maximum) at \(c\) if \(f(c)\geq f(x)\) for all \(x\) in \(D\), where \(D\) is the domain of \(f\). The number \(f(c)\) is called the maximum value of \(f\) on \(D\).
Similarly, \(f\) has an absolute minimum (or global minimum) at \(c\) if \(f(c)\leq f(x)\) for all \(x\) in \(D\) and the number \(f(c)\) is called the minimum value of \(f\) on \(D\).
The maximum and minimum values of \(f\) are called the extreme values of \(f\).
2. Definition
A function \(f\) has an local maximum (or relative maximum) at \(c\) if \(f(c)\geq f(x)\) when \(x\) is near \(c\). [This means that \(f(c)\geq f(x)\) for all \(x\) in some open interval containing \(c\)]
Similarly, \(f\) has a local minimum (or relative minimum) at \(c\) if \(f(c)\leq f(x)\) when \(x\) is near \(c\).
3. The Extreme Value Theorem
If \(f\) is continuous on a closed interval \([a,b]\), then \(f\) attains an absolute maximum value \(f(c)\) and an absolute minimum value \(f(d)\) at some numbers \(c\) and \(d\) in \([a,b]\)
- A function need not possess extreme values if either hypothesis (continuity or closed interval) is omitted from the Extreme Value Theorem
4. Fermat’s Theorem
If \(f\) has a local maximum or minimum at \(c\), and if \(f^\prime(c)\) exists, then \(f^\prime(c) = 0.\)
Examples
5. Definition
A critical number of a function \(f\) is a number \(c\) in the domain of \(f\) such that either \(f^\prime(c) = 0\) or \(f^\prime(c)\) does not exist.
Example 18
Find the critical numbers of \(f(x)=x^{3/5}(4-x).\)
- In terms of critical numbers, Fermat’s Theorem can be rephrased as,
6. Fermat’s Theorem (modification)
If \(f\) has a local maximum or minimum at \(c\), then \(c\) is a critical number of \(f\).
7. The closed interval method
To find the absolute maximum and minimum values of a continuous function \(f\) on a closed interval \([a,b]\):
Find the values of \(f\) at the critical numbers of \(f\) in \((a,b)\).
Find the values of \(f\) at the endpoints of the interval.
The largest of the values from Steps 1 and 2 is the absolute maximum value; the smallest of these values is the absolute minimum value.
Example 19
Find the absolute maximum and minimum values of the function \(f(x)=x^3-3x^2+1\) \(-\frac{1}{2} \leq x \leq4.\)
<IP_ADDRESS> How derivatives affect the shape of a graph
<IP_ADDRESS>.1 What does \(f^\prime\) say about \(f\)?
- Increasing/ Decreasing Test
- If \(f^\prime (x) >0\) on an interval, then \(f\) is increasing on that interval
- If \(f^\prime (x) <0\) on an interval, then \(f\) is decreasing on that interval
Example 20
Find where the function \(f(x)=3x^4-4x^3- 12x^2+5\) is increasing and where it is decreasing
- The First Derivative Test
Suppose that \(c\) is a critical number of a continuous function \(f\).
If \(f^\prime\) changes from positive to negative at \(c\), then \(f\) has a local maximum at \(c\).
If \(f^\prime\) changes from negative to positive at \(c\), then \(f\) has a local minimum at \(c\).
If \(f^\prime\) does not change sign at \(c\) (for example, if \(f^\prime\) is positive on both sides of \(c\) or negative on both sides), then \(f\) has no local maximum or minimum at \(c\).
<IP_ADDRESS>.2 What does \(f^{\prime \prime}\) say about \(f\)?
Concavity
- Definition
If the graph of \(f\) lies above all of its tangents on an interval \(I\), then it is called concave upward on \(I\). If the graph of \(f\) lies below all of its tangents on \(I\), it is called concave downward on \(I\).
- Concavity Test
If \(f^{\prime \prime}(x)>0\) for all \(x\) in \(I\), then the graph of \(f\) is concave upward on \(I\).
If \(f^{\prime \prime}(x)<0\) for all \(x\) in \(I\), then the graph of \(f\) is concave downward on \(I\).
- Definition: Inflection Point
A point \(P\) in a curve \(y=f(x)\) is called an inflection point if \(f\) is continuous there and the curve changes from concave upward to concave downward or from concave downward to concave upward at \(P\).
- The Second Derivative Test
Suppose \(f^{\prime \prime}\) is continuous near \(c\). (a) If \(f^\prime (c) = 0\) and \(f^{\prime \prime}(c) >0,\) then \(f\) has a local minimum at \(c\) (b) If \(f^\prime (c) = 0\) and \(f^{\prime \prime}(c) <0,\) then \(f\) has a local maximum at \(c\)
Example 21
Discuss the curve \(y= x^4 - 4x^3\) with respect to concavity, points of inflection and local maxima and minima.
5.2 Integration
5.2.1 The Definite Integral
Definition: Definite Integral
If \(f\) is a continuous function defined for \(a \leq x \leq b\), we divide the interval \([a,b]\) into \(n\) sub-intervals of equal width \(\Delta x = (b-a)/n\). We let \(x_0 (=a) , x_1, x_2, \dots, x_n(=b)\) be the endpoints of these sub-intervals and we let \(x_1^*,x_2^*, \dots, x_n^*\) be any sample point in these sub-intervals, so \(x_i^*\) lies in the \(i\)th sub-interval \([x_{i-1} , x_i]\). Then definite integral of \(f\) from \(a\) to \(b\) is
\[\int_a^b f(x) dx = lim_{n\to \infty}\sum_{i=1}^n f(x_i^*) \Delta x \]
- The definite integral \(\int_a^b f(x) dx\) is a number and does not depend on \(x\).
Therefore, any letter can be used in place of \(x\) without changing the value of the integral \[\int_a^b f(x) dx= \int_a^b f(t) dt = \int_a^b f(r) dr\]
A definite integral can be interpreted as a net area.
<IP_ADDRESS> Properties of the Definite Integral
- \(\int_a^b f(x) dx= -\int_b^a f(x) dx\)
- \(\int_a^a f(x) dx= 0\)
- \(\int_a^b[ f(x)+ g(x)] dx= \int_a^b f(x) dx + \int_a^b g(x)dx\)
- \(\int_a^b c dx= c(b-a),\) where \(c\) is a constant.
- \(\int_a^b c f(x) dx= c\int_a^b f(x) dx\), where \(c\) is a constant.
- \(\int_a^b[ f(x)- g(x)] dx= \int_a^b f(x) dx - \int_a^b g(x)dx\)
- \(\int_a^b f(x) dx + \int_b^c f(x)dx = \int_a^c f(x) dx\)
5.2.2 The Fundamental Theorem of Calculus
- The fundamental Theorem of Calculus establishes a connection between the two branches of calculus and integral calculus.
\[g(x) = \int_a^x f(t) dt,\] where \(f\) is a continuous function on \([a,b]\) and \(x\) varies between \(a\) and \(b\).
The Fundamental Theorem of Calculus, Part I
If \(f\) is continuous on \([a,b],\) then the function \(g\) defined by \[g(x) = \int_a^x f(t) dt,\text{ } a\leq x \leq b\]
is continuous on \([a,b]\) and differentiable on \((a,b),\) and \(g^\prime(x) = f(x).\)
- Using Leibniz notation for derivatives, we can write the Fundamental Theorem of Calculus, Part I as \[\frac{d}{dx} \int_a^x f(t) dt= f(x)\] when \(f\) is continuous.
Example 22
Find the derivative of the function \(g(x) = \int_0^x \sqrt{1+ t+ t^2} dt\)
5.2.3 Indefinite Integrals
<IP_ADDRESS> Antiderivatives
Consider the problem of finding a function \(F\) whose derivative is a known function \(f\).
If such a function \(F\) exists, it is called an antiderivative of \(f\).
Definition: Antiderivative
A function \(F\) is called an antiderivative of \(f\) on an interval \(I\) if \(F^\prime(x) = f(x)\) for all \(x\) in \(I\)
Indefinite integral
The notation \(\int f(x)dx\) is traditionally used for an antiderivative of \(f\) and is called an indefinite integral.
Thus \[\int f(x) dx = F(x) \text{ means } F^\prime(x) = f(x)\]
- If \(f\) is continuous on \([a,b],\) then \[\int_a^b f(x)dx = \left[\int f(x)dx \right]_a^b\]
Indefinite Integrals
\(\int cf(x) dx = c\int f(x)dx\)
\(\int [f(x) +g(x)] dx = \int f(x)dx + \int g(x)dx\)
\(\int k dx = kx+C\)
\(\int x^n dx = \frac{x^{n+1}}{n+1}+C\) \((n \neq -1)\)
\(\int \frac{1}{x} dx = ln|x|+C\)
\(\int e^xdx= e^x+C\)
\(\int a^xdx= \frac{a^x}{ln \text{ } a}+C\)
Example 23
Evaluate \(\int_1^9 \frac{2t^2+t^2\sqrt{t}-1}{t^2} dt\)
5.2.4 The Substitution Rule
The Substitution Rule
If \(u= g(x)\) is a differentiable function whose range is and interval \(I\) and \(f\) is continuous on \(I\), then
\[\int f(g(x))g^\prime(x)dx=\int f(u)du\]
Example 24
Evaluate \(\int\sqrt{2x+1} dx\)
The Substitution Rule for Definite Integrals
If \(g^\prime\) is continuous on \([a,b]\) and \(f\) is continuous on the range of \(u=g(x),\) then \[\int_a^bf(g(x))g^\prime(x)dx=\int_{g(a)}^{g(b)} f(u)du\]
Example 25
Evaluate \(\int_0^4\sqrt{2x+1} dx\)
Integrals of Symmetric Functions
Suppose \(f\) is continuous on \([-a,a].\)
- If \(f\) is even \([f(-x) = f(x)],\) then \(\int_{-a}^af(x) dx = 2\int_0^af(x)dx\)
- If \(f\) is odd \([f(-x) = - f(x)],\) then \(\int_{-a}^af(x) dx = 0\)
5.2.5 The integral of the logarithmic and exponential function
\(\int e^xdx = e^x + C\)
\(\int \frac{1}{x}dx = ln(x) + C\) if \(x>0\)
\(\int a^xdx = \frac{a^x}{ln (a)} + C\)
Example 26
Evaluate \(\int \frac{e^x - e^{-x}}{5} dx\)
Example 27
Evaluate \(\int \frac{3x^2}{x^3+1} dx\) \(x\neq -1\)
5.2.6 Integration by Parts
\[\int f(x) g^\prime(x)dx=f(x)g(x)-\int g(x)f^\prime(x)dx\]
- Let \(u = f(x)\) and \(v=g(x)\). Then the differentials are \(du = f^\prime (x) dx\) and \(dv = g^\prime(x) dx,\) so, by the Substitution Rule, the formula for integration by parts becomes
\[\int udv = uv-\int vdu\]
Example 28
Evaluate \(\int ln \text{ } x dx\)
Example 29
Evaluate \(\int x^2e^x dx\)
\[\int_a^b f(x) g^\prime(x)dx=\left [ f(x)g(x) \right ]_a^b-\int_a^b g(x)f^\prime(x)dx\]
5.2.7 Trigonometric Functions
Derivatives of Trigonometric Functions
- \(\frac{d}{dx} sin(x) = cos(x)\)
- \(\frac{d}{dx} cos(x) = -sin(x)\)
- \(\frac{d}{dx} tan(x) = sec^2(x)\)
- \(\frac{d}{dx} sec(x) = sec(x)tan(x)\)
Integration of Trigonometric Functions
- \(\int cos(x)dx = sin(x) +C\)
- \(\int sin(x)dx = -cos(x) +C\)
- \(\int sec^2(x) = tan(x) +C\)
- \(\int sec(x)tan(x) = sec(x) +C\)
5.3 Tutorial
Chapter 5.1: Differentiation
- The graph of function \(f\) is given. Use it to sketch the graph of the derivative \(f^\prime\)
- Find the derivative of the function using the definition of derivative. state the domain of the function and the domain of the derivative.
- \(f(x) = 20\)
- \(f(x) = 1-3x^2\)
- \(f(x) = x^3 -3x+5\)
- \(f(x) = \sqrt{1+2x}\)
- \(f(x) = 12+5x\)
- \(g(x) = 5x^2+3x-2\)
- \(g(x) = x+\sqrt{x}\)
- \(g(x) = \frac{3+x}{1-3x}\)
- \(G(t) = \frac{4t}{t+1}\)
- \(g(x) = \frac{1}{x^2}\)
- \(G(t) = t^4\)
- The graph of \(f\) is given.
- At what values is \(f\) discontinuous? Why?
- At what values is \(f\) not differentiable? Why?
Where is the function \(f(x) = |x|\) differentiable? find a formula for \(f^\prime\) and sketch its graph.
Find an equation of the tangent line to the curve \(y=x \sqrt x\) at the point \((1,1).\) Illustrate by graphing the curve and its tangent line.
If \(f(x) = e^x -x,\) find \(f^\prime\). Compare the graphs of \(f\) and \(f^\prime\).
At what point on the curve \(y=e^x\) is the tangent line parallel to the line \(y=2x\)?
Differentiate the function
- \(g(x) = \frac{3x-1}{2x+1}\)
- \(V(x) = (2x^3+3)(x^4-2x)\)
- \(f(y) = \left ( \frac{1}{y^2}- \frac{3}{y^4} \right ) (y+5y^3)\)
- \(f(x) = \frac{1}{x^4+x^2+1}\)
- \(f(x) = \frac{x}{x+\frac{c}{x}}\)
- \(f(x) = \frac{3x^2+2\sqrt x}{x}\)
- Find an equation of the tangent line to the given curve at the specified point.
- \(y= \frac{1}{1+x^2}\), \((-1, \frac{1}{2})\)
- \(y= \frac{e^x }{1+x^2}\), \((1, \frac{e}{2})\)
- Suppose that \(f(5) = 1\) , \(f^\prime (5) =6\), \(g(5) = -3\) and \(g^\prime (5) =2\). Find the following values.
- \((fg)^\prime(5)\)
- \((f/g)^\prime(5)\)
- \((g/f)^\prime(5)\)
- If \(h(2) = 4\) and \(h^\prime(2) = -3,\) find
\[\frac{d}{dx} \left( \frac{h(x)}{x} \right) \Bigr|_{x=2} \]
Use the Product Rule twice to prove that if \(f\), \(g\) and \(h\) are differentiable, then \[(fgh)^\prime = f^\prime gh+ fg^\prime h + fgh^\prime\]
Taking \(f=g=h\) in part (a), show that
\[\frac{d}{dx} [f(x)]^3= 3[f(x)]^2f^\prime(x)\]
- Use part (b) to differentiate \(y= e^{3x}\)
- Write the composite function in the form \(f(g(x)).\) Then find the derivative of the function.
- \(f(x) = \sqrt{x^2+1}\)
- \(f(x) = (x^3-1)^{100}\)
- \(f(x) = e^{-mx}\)
- \(g(t) =\frac{1}{(t^4+1)^3}\)
- \(f(x) = (1+4x)^5(3+x-x^2)^8\)
- \(f(t) = \left( \frac{t-2}{2t+1} \right)^9\)
Suppose that \(F(x) = f(g(x))\) and \(g(3) =6\), \(g^\prime(3) =4\), \(f^\prime(3) =2\) and \(f^\prime(6) =7\). Find \(F^\prime(3).\)
A table of values for \(f,g, f^\prime,\) and \(g^\prime\) is given.
| \(x\) | \(f(x)\) | \(g(x)\) | \(f^\prime(x)\) | \(g^\prime(x)\) |
|---|---|---|---|---|
| 1 | 3 | 2 | 4 | 6 |
| 2 | 1 | 8 | 5 | 7 |
| 3 | 7 | 2 | 7 | 9 |
- If \(h(x) = f(g(x))\), Find \(h^\prime (1)\). \(\text { }\) (b) If \(H(x) = g(f(x))\), Find \(H^\prime (1)\).
- Suppose \(L\) is a function such that \(L^{\prime}(x)=1/x\) for \(x>0\). Find an expression for the derivative of each function.
- \(f(x)= L(x^4)\)
- \(g(x)= L(4x)\)
- \(F(x)= [L(x)]^4\)
- \(G(x) = L(1/x)\)
- Find the fist and second derivatives of the function
- \(f(x)= x^5+6x^2-7x\)
- \(F(t)=t^8-7t^6+2t^4\)
- \(F(t)= (1-7t)^6\)
- Show that \(\frac{d}{dx} [ln \text{ }g(x)]= \frac{g^\prime (x)}{g(x)}\) \(\text{ }\) (b) Differentiate \(y=ln (x^3+1)\)
Find \(\frac{d}{dx} ln \left[ \frac{x+1}{\sqrt{x-2}}\right]\)
Sketch the graph of the function \(f(x) = x^{\frac{2}{3}}(6-x)^{\frac{1}{3}}.\)
- Suppose you are given a formula for a function \(f\).
- How do you determine where \(f\) is increasing or decreasing?
- How do you determine where the graph of \(f\) is concave upward or concave downward? (c)How do you locate inflection points?
- If \(x^2+y^2=25,\)
- Find \(\frac{dy}{dx}\)
- Fins an equation of the tangent to the circle \(x^2+y^2=25\) at the point \((3,4).\)
If \(f(x,y) = 4-x^2-2y^2,\) find \(f_x(1,1)\) and \(f_y(1,1)\) and interpret these numbers as slopes.
If \(f(x,y) = sin\left(\frac{x}{1+y} \right),\) calculate \(\frac{\partial f}{\partial x}\) and \(\frac{\partial f}{\partial y}\)
Differentiate \(y=\frac{x^{3/4} \sqrt{x^2+1}}{(3x+2)^5}\)
Use the properties of integrals to evaluate \(\int_0^1 (4+3x^2)dx\)
If it is known that \(\int_0^{10} f(x)dx=17\) and \(\int_0^{8} f(x)dx=12\), find \(\int_8^{10} f(x)dx\)
- Use Part I of the Fundamental Theorem of Calculus to find the derivative of the function
- \(g(x) = \int_o^x\sqrt{1+2t}dt\)
- \(g(x) = \int_o^xln(t)dt\)
- \(g(y) = \int_2^yt^2sin(t)dt\)
- \(g(y) = \int_3^y\frac{1}{x+x^2}dx\)
- \(g(x) = \int_x^2cos(t^2)dt\)
- \(y = \int_{1-3x}^1\frac{u^3}{1+u^2}du\)
Find the general indefinite integral \(\int(10x^4-2sec^2x)dx.\)
- Evaluate the integral
- \(\int_0^2(6x^2-4x+5)dx\)
- \(\int_{-1}^0(2x-e^x)dx\)
- \(\int_{-2}^2(3u+1)^2du\)
- \(\int_1^4\sqrt{t}(1+t)dt\)
- \(\int_1^4\sqrt{\frac{5}{x}}dx\)
- Find the area of the region that lies to the right of the \(y\)-axis and to the left of the parabola \(x=2y-y^2.\)
- Find
- \(\int\frac{x}{\sqrt{1-4x^2}}dx\)
- \(\int \sqrt{1+x^2} x^5dx\)
- Find
- \(\int tan\;x \;dx\)
- \(x^3 cos (x^4 +2) dx\)
- Calculate
- \(\int_1^e\frac{ln\;x}{x}dx\)
- \(\int e^{5x} dx\)
Show that \(\frac{d}{dx}(log_ax) = \frac{1}{xln(a)}\)
Find \(\int xsin(x)dx\)
Find \(\int t^2e^tdt\)
Evaluate \(\int e^xsin (x)dx\)
If \(f(0) = g(0)=0\) and \(f^{\prime\prime}\) and \(g^{\prime\prime}\) are continuous, show that \[\int_0^af(x)g^{\prime\prime}(x)dx=f(a)g^{\prime}(a)-f^{\prime}(a)g(a)+\int_0^af^{\prime\prime}(x)g(x)dx\]
Suppose that \(f(1)=2,\) \(f(4)=7,\) \(f^{\prime}(1)=5,\) \(f^{\prime}(4)=3\) and \(f^{\prime\prime}\) is continuous. Find the value of \(\int_1^4xf^{\prime\prime}(x)dx\)
References
Shenk, A. (1988). Calculus and analytic geometry. Scott Foresman & Company.
Stewart, J. (2003). Calculus: Early Transcendentals. Thomson Learning. Inc., Belmont, CA.


| Class | Description |
|---|---|
| DistanceXYC |
Ensures:
|X-Y| OP C where OP can take its value among {=, >, <, =/=} |
| PropAbsolute |
Enforces X = |Y|
|
| PropDistanceXYC |
| X - Y | op C
op = {"==", "<", ">", "=/="} |
| PropElement |
VALUE = TABLE[INDEX]
Bound consistency. |
| PropEqualX_Y |
X = Y
Ensures Arc-Consistency
|
| PropEqualX_YC |
X = Y + C
|
| PropEqualXY_C |
X + Y = C
|
| PropGreaterOrEqualX_Y |
X >= Y
|
| PropGreaterOrEqualX_YC |
X >= Y + C
|
| PropGreaterOrEqualXY_C |
X + Y >= C
|
| PropLessOrEqualXY_C |
X + Y <= C
|
| PropNotEqualX_Y |
A specific
Propagator extension defining filtering algorithm for:
X =/= Y where X and Y are Variable objects. |
| PropNotEqualX_YC |
A specific
Propagator extension defining filtering algorithm for:
X =/= Y + C where X and Y are Variable objects and C a constant. |
| PropNotEqualXY_C |
A specific
Propagator extension defining filtering algorithm for:
X + Y =/= C where X and Y are Variable objects and C a constant. |
| PropScale |
Scale propagator : ensures x * y = z
With y a constant greater than one
Ensures AC
|
| PropSquare |
Enforces X = Y^2
|
| Enum | Description |
|---|---|
| PropElement.Sort |
To indicate the ordering of the index value
|
Copyright © 2015. All rights reserved.


Glass Guardian is designed to help people solve the safety problem when users are exposed in a dangerous condition and entering an unsafe area. Glassware is able to track user environmental data, detect abnormal user behavior and send alert to user’s friends and family reaching for help.
1) Sign in with your gmail account which binds with your Google Glass
2) Set up alert email list, so your friends and family know what happen to you in the first time if you were in danger
3) After install the glassware, turn on the Guardian glassware when you think you are in unsafe area with potential dangers
4) When you face the danger and trigger alert, an alert notification email will be sent immediately to all the email address on your list along with a tracking data link
5) Your friends/family open the tracking link, they will see all the tracking information of you and know what exactly happened to you


| cmc | Command-line compiler |
| cmcode | IDE |
| cmdb | Command-line debugger and debugger server |
| cmdb2xml | Converts binary debug information file to XML |
| cmdoc | Generates HTML reference documentation |
| cmprof | Profiling tool |
| cmtrace2txt | Trace conversion tool |
| cmunit | Unit testing tool |
| cmupd | Updates projects using version 3.2.0 API's to later version |
| cppcmc | Command-line compiler with C++ backend |
| cppcmcconfig | Utility to configure MinGW Boost libraries for cppcmc |
| project file conversion | Project and solution file conversion utilities |
| soulcm | Lexer and parser generator written in Cmajor |
| spring | Graphical diagram designer for Windows written in Cmajor |
| supd | Source file update utility written in Cmajor |


Here is an image:
And here is a link.
Here is a video embedded with the iframe tag:
Here is a column with an mp4 video.


Movie Search
Javascript is either disabled or not supported in your browser. Please enable it or use a Javascript enabled browser.


{% extends "header.html" %} {% block body %}
Once you have NLTK installed, you are ready to begin using it. One of the more powerful aspects of NLTK for Python is the part of speech tagger that is built in. Notably, this part of speech tagger is not perfect, but it is pretty darn good. If you are looking for something better, you can purchase some, or even modify the existing code for NLTK.
The idea of part of speech tagging is so that you can understand the sentence structure and begin to use your program to somewhat follow the meaning of a sentence based on the word used, its part of speech, and the string it creates.
To accompany the video, here is the sample code for NLTK part of speech tagging with lots of comments and info as well:
POS tag list:
import re import nltk cj = CookieJar() opener = urllib2.build_opener(urllib2.HTTPCookieProcessor(cj)) opener.addheaders = [('User-agent', 'Mozilla/5.0')] #empty array# contentArray =['Starbucks is doing very well lately.', 'Overall, while it may seem there is already a Starbucks on every corner, Starbucks still has a lot of room to grow.', 'They just began expansion into food products, which has been going quite well so far for them.', 'I can attest that my own expenditure when going to Starbucks has increased, in lieu of these food products.', 'Starbucks is also indeed expanding their number of stores as well.', 'Starbucks still sees strong sales growth here in the united states, and intends to actually continue increasing this.', 'Starbucks also has one of the more successful loyalty programs, which accounts for 30% of all transactions being loyalty-program-based.', 'As if news could not get any more positive for the company, Brazilian weather has become ideal for producing coffee beans.', 'Brazil is the world\'s #1 coffee producer, the source of about 1/3rd of the entire world\'s supply!', 'Given the dry weather, coffee farmers have amped up production, to take as much of an advantage as possible with the dry weather.', 'Increase in supply... well you know the rules...',] exampleArray = ['The incredibly intimidating NLP scares people away who are sissies'] def processContent(): try: for item in exampleArray: tokenized = nltk.word_tokenize(item) tagged = nltk.pos_tag(tokenized) chunkGram = r"""Chunk: {<RB.?>*<VB.?>*<NNP>}""" chunkParser = nltk.RegexpParser(chunkGram) chunked = chunkParser.parse(tagged) print(chunked) chunked.draw() except Exception as e: print(str(e)) processContent()


Write your text below:
Select the list of hash functions below: (Multiple selection is allowed)
How many times to apply the given hash functions:


August 2015
Monday
Tuesday
Wednesday
Thursday
Friday
Saturday
Sunday
On control
01-01
Letter
Whatever
01-01
Letter
Whatever
01-02
Request
Gimme Fuel
01-02
Request
Gimme Fuel
01-02
Request
Gimme Fuel


lspgpot(1) lspgpot(1) NAME lspgpot - extracts the ownertrust values from PGP keyrings and list them in GnuPG ownertrust format. SYNOPSIS lspgpot DESCRIPTION lspgpot extracts the ownertrust values from PGP keyrings and list them in GnuPG ownertrust format. AUTHOR Copyright (C) 2002 Free Software Foundation, Inc. Please report bugs to<EMAIL_ADDRESS>This manpage was written by Francois Wendling<EMAIL_ADDRESS>December 2005 lspgpot(1)


string-metrics
String metric algorithms for Crystal:
Installation
Add this to your application's shard.yml
:
dependencies:
string-metrics:
github: mlobl/string-metrics
Usage
require "string-metrics"
StringMetrics.damerau_levenshtein("char", "hcar") == 1
StringMetrics.hamming("Micro", "Macro") == 1
StringMetrics.jaro("MARTHA", "MARHTA").round(2) == 0.94
StringMetrics.jaro_winkler("MARTHA", "MARHTA").round(2) == 0.96
StringMetrics.levenshtein("Car", "Char") == 1
Contributing
- Fork it ( https://github.com/mlobl/string-metrics/fork )
- Create your feature branch (git checkout -b my-new-feature)
- Commit your changes (git commit -am 'Add some feature')
- Push to the branch (git push origin my-new-feature)
- Create a new Pull Request
Contributors
- mlobl Meyer Lobl - creator, maintainer


pump is a small node module that pipes streams together and destroys all of them if one of them closes.
npm install pump
When using standard source.pipe(dest)
source will not be destroyed if dest emits close or an error.
You are also not able to provide a callback to tell when then pipe has finished.
pump does these two things for you
Simply pass the streams you want to pipe together to pump and add an optional callback
var pump = require('pump')
var fs = require('fs')
var source = fs.createReadStream('/dev/random')
var dest = fs.createWriteStream('/dev/null')
pump(source, dest, function(err) {
console.log('pipe finished', err)
})
setTimeout(function() {
dest.destroy() // when dest is closed pump will destroy source
}, 1000)
You can use pump to pipe more than two streams together as well
var transform = someTransformStream()
pump(source, transform, anotherTransform, dest, function(err) {
console.log('pipe finished', err)
})
If source
, transform
, anotherTransform
or dest
closes all of them will be destroyed.
MIT
pump
is part of the mississippi stream utility collection which includes more useful stream modules similar to this one.


Good Adventure
Good Vibes
Succesful Journeys
People Transfered
I went on a Pluton trip, that was a very good experince for me and my wife. We visited the "Ice Museum". We had a romantic dinner on the heart of the Pluton. I definately recommend this trip for who are undecided to come or not to come.
CEO at RocketEx.com
Hi. I,m Rick and a scientist from New Zealand. I visited the "Make Make" planet for a research. It was very useful for my research. I used the laboratories of TravelX. I want to thank to Abdulmecid and TravelX for organising this trip.
Scientist at StarLabs
I'm Jack Johnson and I'm an enterpreneur.I found really great enterpreneurship ideas. I want to work with TravelX again in the future. And I want to thank all of the cofounders of the TravelX. They really help me to choose the best option.
Enterpreneur


{% extends 'base.html' %} {% block title %}RAD Remedy - Submit a Correction{% endblock %} {% block head_text %}Submit a Correction{% endblock %} {% block head %} {% endblock %} {% block content %}
Found something that doesn't seem quite right? Submit a correction for {{ resource.name }}.
{% endblock %}


返回主页
名言佳句（长句）
Piratenpartei
名言佳句（亚里士多德）
Robber Barons, 财阀, Plutocrat, Faction, das Herrenvolk, Ginny Weasley(Hogwarts)
德语名言：政治经济（1）
德语名言：激励奋斗（1）
德语名言：Segel航海（1）
德语名言：哲学智慧（1）
A statesman cannot create anything himself. He must wait and listen until he hears the steps of God sounding through events; then leap up and grasp the hem of his garment.
Man cannot control the current of events. he can only float with them and steer.
When you want to fool the world, tell the truth.
Never believe anything in politics until it has been officially denied.
Otto von Bismarck
Harry Potter 核心情节
Josef Korbel (1909) Czech: Albright (Georgetown University), Condoleezza Rice, Susan Rice.
Kissinger’s ability to ingratiate (讨好)was legendary: he almost always left adversaries believing he agreed with them. With due respect to Kissinger, he is the most devious (狡猾) man I ever met. (Shimon Peres, Israel)
Assertive: Habsburg (Philip the Prudent/Felipe el Prudente)
Self-confidence, creativity, the ability to relate to others: these are the skills and brain development processes that we’re trying to nurture in our kids and that may remain undeveloped if formal learning monopolizes their time and attention. Understand the rules, but then choose how to live their own lives.
亚洲是亚洲人的亚洲
希特勒演讲：但泽（Danzig）回归祖国。Maniac！！
日耳曼人大迁徙（蛮族入侵）
德国地图
普鲁士（Prussia）地图
德语名言：激励奋斗（6）
Hegel说“We learn from history that we do not learn from history”。
爱（Was du liebst, lass frei）
一生中只追求完美
McNerney：Help others get better. 政工/政委/Vujicic
I start with people's growth, my own growth included. Help others get better, that is, help people who work for you grow. If team works, everything will be fine.
My ability to lead (leiten/Leiter), to chart the course for the team members, to inspire them to reach for performance, to deliver the values you bring to the job. We focus on the courage to do the right thing. I tend to think about this in terms of helping others get better. I view myself as a value-added facilitator（促进者/帮助着）here more than as someone who's crashing through the waves on the bridge of a frigate护卫舰. It feels great to see the people you work with grow and achieve.
It generally gets down to a very personal level - openness to change, courage to change, hard work and teamwork. What I do is figure out how to unlock that in people, because most people have that inside them. But they often get trapped in, for example, fear, bureaucracy or confusion.
You chart the course for yourself and the people you work with, to expect a lot and inspire people, to have the right values, to find a way and deliver results - these are pretty fundamental things. The things you expect of people have to be so fundamental. Like a priest missionary (the seminary, The Communication Department （传理系/“仁”即“沟通”/仁者无敌） of Hong Kong Baptist University). I expect a fair amount from people. It makes them so much better.
There was no question that there was an expectation in my family, for every member, including my children. I think some of the saddest things in the world are when you don't expect enough from your children. They have to run a higher standard. Yes, it will be a little over focused, a little tough, but that's part of the package or side effects (副作用).
As a child, you're trying to grow and meet expectations. If you focus and insist, you will win at least once. Success and achievement can feed on themselves. It feels good to keep succeeding. It’s positive feedback. Then you have the passion to win. Like addiction or maniac （上瘾/狂热）.
Expect a lot, inspire people, ask them to take the values that are important to them at home or at church and bring them to work.
爱（Was du liebst, lass frei）
In Hogwarts
Dumbledore: I sense that something is troubling you. Am I right, Harry?
Harry: It's just...you see, sir, I couldn't help but notice certain things, certain....certain similarities between Tom Riddle and me.
Dumbledore: I see. Well, you can speak Parseltongue, Harry. Why? Because Lord Voldemort can speak Parseltongue. If I'm not mistaken, Harry...he transferred some of his powers to you......the night he gave you that scar.
Harry: Voldemort transferred some of his powers to me?
Dumbledore: Not intentionally...but yes.
Harry: So the Sorting Hat was right. I should be in Slytherin.
Dumbledore: It's true. You possess many of the qualities that Voldemort himself prizes. Determination, resourcefulness......and if I may say so, a certain disregard for the rules. Why, then, did the Sorting Hat place you in Gryffindor?
Harry: Because I asked it to.
Dumbledore: Exactly, Harry, exactly, which makes you different from Voldemort. It is not our abilities that show what we truly are. It is our choices.
文摘（战争和航海）
Harry Potter 核心情节
爱（Was du liebst, lass frei）
version:1.0<EMAIL_ADDRESS>© retter2012.com


Users may combine and transform datasets from multiple sources such as RDBMS, Cloud Storage, and Local, without any coding with Daria’s GUI. Daria then automatically detects variable types and anomalies and suggests appropriate data transformations. Users can apply any predefined data processing function to this process, including oversampling, scaling, and normalization, with a mere drag and drop.
Daria automatically selects the best machine learning model for each dataset from a number of possible combinations of algorithms and hyperparameters. Training results are organized onto a highly detailed analysis page in the form of intuitively designed charts and tables, allowing for a quick evaluation of model performance.
The results generated from model training can be deployed straight to production via Daria’s RESTful API. Users receive Real-time/Batch predictions, while also managing and monitoring model performance with Daria’s help.


¶ Ghost ConfigurationSetup your Ghost install for various environments. |
|
|
Ghost runs in |
var path = require('path'),
config;
config = {
|
¶ ProductionWhen running Ghost in the wild, use the production environment. Configure your URL and mail settings here |
production: {
url: 'http://my-ghost-blog.com',
mail: {},
database: {
client: 'sqlite3',
connection: {
filename: path.join(__dirname, '/content/data/ghost.db')
},
debug: false
},
server: {
host: '<IP_ADDRESS>',
port: '2368'
}
},
|
¶ Development (default) |
development: {
|
|
The url to use when providing links to the site, E.g. in RSS and email. Change this to your Ghost blog's published URL. |
url: 'http://localhost:2368',
|
|
Example mail config Visit http://support.ghost.org/mail for instructions
|
|
¶ DatabaseGhost supports sqlite3 (default), MySQL & PostgreSQL |
database: {
client: 'sqlite3',
connection: {
filename: path.join(__dirname, '/content/data/ghost-dev.db')
},
debug: false
},
|
¶ ServerCan be host & port (default), or socket |
server: {
|
|
Host to be passed to node's |
host: '<IP_ADDRESS>',
|
|
Port to be passed to node's |
port: '2368'
},
|
¶ PathsSpecify where your content directory lives |
paths: {
contentPath: path.join(__dirname, '/content/')
}
},
|
|
Developers only need to edit below here |
|
¶ TestingUsed when developing Ghost to run tests and check the health of Ghost Uses a different port number |
testing: {
url: 'http://<IP_ADDRESS>:2369',
database: {
client: 'sqlite3',
connection: {
filename: path.join(__dirname, '/content/data/ghost-test.db')
}
},
server: {
host: '<IP_ADDRESS>',
port: '2369'
},
logging: false
},
|
¶ Testing MySQLUsed by Travis - Automated testing run through GitHub |
'testing-mysql': {
url: 'http://<IP_ADDRESS>:2369',
database: {
client: 'mysql',
connection: {
host : '<IP_ADDRESS>',
user : 'root',
password : '',
database : 'ghost_testing',
charset : 'utf8'
}
},
server: {
host: '<IP_ADDRESS>',
port: '2369'
},
logging: false
},
|
¶ Testing pgUsed by Travis - Automated testing run through GitHub |
'testing-pg': {
url: 'http://<IP_ADDRESS>:2369',
database: {
client: 'pg',
connection: {
host : '<IP_ADDRESS>',
user : 'postgres',
password : '',
database : 'ghost_testing',
charset : 'utf8'
}
},
server: {
host: '<IP_ADDRESS>',
port: '2369'
},
logging: false
}
};
module.exports = config;
|


After U.S. blacklisting, iFlytek chief says firm will stick to law
SHANGHAI (Reuters) - Chinese artificial intelligence firm iFlytek will strictly adhere to international laws, including a recent decision by the U.S. government to put the firm on a trade blacklist, its chairman said on Tuesday.
iFlytek’s Liu Qingfeng told Reuters on the sidelines of the China International Import Expo in Shanghai that the artificial intelligence firm had strong internal controls, and would not infringe upon user privacy or human rights.
“Not many,” he said in response to a query whether the firm had many U.S. suppliers, adding that its core technologies were self-developed.


The Myth of Overpopulation
The myth of overpopulation came about in England, 1798 by Thomas Malthus.
He believed that our food production could not keep up with the exponential growth of humans and determined that the world would be out of food by 1890.
In his “Essay on the Principle of Population”, he actually formulated a plan to kill the poor and less fortunate citizens so that the wealthy and elite would have enough food and resources.
An Essay on the Principle of Population
Paul Ehrlich of Stanford University expanded upon this erroneous idea in 1968 when he claimed that famines would decimate humanity by the 1970’s to due “reckless human reproduction”.
This led to the creation of the UNFPA, which is the United Nations Fund for Population Activities.
This organization is funded by the elite and is responsible for population control programs and propaganda fear tactics of a manufactured crisis that isn’t real.
We don’t need to kill innocent people to take their resources and we don’t need to prevent people from existing in the first place.
The fact is that we have enough natural resources for everyone to live in abundance.
The technological revolution eliminated the problems we used to have in obtaining resources, but another problem arose as a result:
Greed and abuse, industrial pollution, and the hoarding of land and resources by the elite.
This is the actual problem we are facing.
The myth of over-population is purposely designed to create a scarcity mindset.
There is plenty of room on this planet for everyone.
If you took the population density of Paris and you forced the whole world to live at that population density, you could fit the entire population of the planet into the state of Texas.
The idea of over-population is just another example of manufactured reality to keep us in a fear based scarcity mindset which is overwhelmingly unhealthy for human existence.
mspsteem.com
This post was made on mspsteem.com. It’s just like steemit.com but run by msp (thanks @netuoso) and gives a 5% beneficiary to @minnowsupport.
source https://www.treehugger.com/sustainable-product-design/at-nycs-density-the-worlds-population-could-live-in-texas.html
This page is synchronized from the post: ‘The Peace Academy Curriculum // Waking Up To The Truth Part 2 // The Myth of Overpopulation’


Indiana
I'm a Junkie-Monkey!
Registered: Oct 2001
Location: Incommincado Tyler Durden says: Do we really need another women?
Posts: 3087 |
www.the5thrace.com
__________________
"Now I'm cleaning up and I'm moving on, going straight and choosing life. I'm looking forward to it already.  The washing machine, the car, the compact disc and electric tin opener, good health, low cholesterol, dental insurance, mortgage, starter home, leisure wear, luggage, three piece suite, DIY, game shows, junk food, children, walks in the park, nine to five, good at golf, washing the car, choice of sweaters, family Christmas, indexed pension, tax exemption clearing gutters, getting by, looking ahead, the day you die."
Report this post to a moderator | ? + *
|


timePlotComponent
Description
This is a component that can easily generate a timeplot timeseries chart whithout needing a xaction file. The resultset is returned
from a mdx or sql query. In case of mdx queries, a role will be passed to mondrian if the session variable 'role' is
defined, allowing row level security.
Kettle transformations need to use db repository.
Note: Due to security restrictions, sql execution is disabled by default. If you want to enable sql copy the file
"cdf/components/timelinefeeder.xaction.sql" to "cdf/components/timelinefeeder.xaction" in the solutions directory.
All parameters can optionally be functions.
Options
- name
- The name of the component
- type
timePlotComponent
- listeners
- Array - Parameters who this component will react to
- chartDefinition
- MetaLayer object with the definition of chart (see MetaLayer options)
- htmlObject
- Id of the component (usually a div or a span tag) to be replaced by the result
- refreshPeriod
- Time in seconds for this component to refresh. Default is 0 (disabled)
- executeAtStart
- True to execute the component at start, false otherwise
- tooltip
- Tooltip to be displayed when mouse hovers
- preExecution
- Function - Function to be called before the component is executed
- postExecution
- Function - Function to be called after the component is executed
MetaLayer options
The options related to charts map the ones described in pentaho wiki.
- columns
- Mandatory. An array of the columns that will be displayed. Unlike jFreeChartComponent, it has to be a fixed list of series
- queryType
- Type of query to read results from. Can be sql or mdx. Default: mdx
- jndi
- Connection to use for the query
- query
- sql or mdx Query to execute
- cube
- Cube name to use when queryType is mdx
- catalog
- Mondrian schema to use when queryType is mdx
- transformation
- Kettle transformation to use
- directory
- Kettle db repository directory
- importStep
- Kettle transformation's import step
- parameterN
- with N being 0 to 10 (eg: parameter0), this are the parameters passed
to the kettle transformation
- width
- Width of the chart. Default: 200
- height
- Height of the chart. Default: 200
- title
- Please check jFreeChart action documentation
- showValues
- Show a tooltip with the values. Default: true
- hideZeroToolTipValues
- Hides the tooltip when value is zero. Default: false
- dots
- Shows a dot for the values. Default: false
- fill
- Shows a color gradient on the plot. Default: false
Sample


import warnings
import numpy as np
def normalized(*args):
if len(args) == 1:
args = np.array(*args)
return args/np.linalg.norm(args)
def bilinear_fit(ux, uy, kx, ky):
a = np.empty((len(ux), 3), dtype=float)
a[:,0] = 1
a[:,1] = ux
a[:,2] = uy
b = np.empty((len(ux), 2), dtype=float)
b[:,0] = kx
b[:,1] = ky
x, _, _, _ = np.linalg.lstsq(a, b, rcond=-1)
return x
[docs]def gnomonicToDirCos(u, v):
"""Convert gnomonic tangent plane projection u,v to direction cosines.
Parameters
----------
u, v : float
Gnomonic tangent plane coordinates in radians.
Returns
-------
alpha, beta, gamma : float
Direction cosines (unit vector projected onto x, y, z in order)
Notes
-----
The tangent plane reference is at (u,v) = (0,0), which corresponds to
(alpha, beta, gamma) = (0, 0, -1) (a ray coming directly from above). The
orientation is such that vx (vy) is positive when u (v) is positive.
"""
gamma = 1/np.sqrt(1.0 + u*u + v*v)
alpha = u*gamma
beta = v*gamma
return alpha, beta, -gamma
[docs]def dirCosToGnomonic(alpha, beta, gamma):
"""Convert direction cosines to gnomonic tangent plane projection.
Parameters
----------
alpha, beta, gamma : float
Direction cosines (unit vector projected onto x, y, z in order)
Returns
-------
u, v : float
Gnomonic tangent plane coordinates in radians.
Notes
-----
The tangent plane reference is at (u,v) = (0,0), which corresponds to
(alpha, beta, gamma) = (0, 0, -1) (a ray coming directly from above). The
orientation is such that vx (vy) is positive when u (v) is positive.
"""
u = -alpha / gamma
v = -beta / gamma
return u, v
[docs]def postelToDirCos(u, v):
"""Convert Postel azimuthal equidistant tangent plane projection u,v to
direction cosines.
Parameters
----------
u, v : float
Postel tangent plane coordinates in radians.
Returns
-------
alpha, beta, gamma : float
Direction cosines (unit vector projected onto x, y, z in order)
Notes
-----
The tangent plane reference is at (u,v) = (0,0), which corresponds to
(alpha, beta, gamma) = (0, 0, -1) (a ray coming directly from above). The
orientation is such that vx (vy) is positive when u (v) is positive.
"""
rho = np.sqrt(u*u + v*v)
wZero = (rho == 0.0)
try:
if wZero:
return 0.0, 0.0, -1.0
except ValueError:
pass
srho = np.sin(rho)
with warnings.catch_warnings():
warnings.simplefilter("ignore")
alpha = u/rho*srho
beta = v/rho*srho
gamma = -np.cos(rho)
if np.any(wZero):
alpha[wZero] = 0.0
beta[wZero] = 0.0
gamma[wZero] = -1.0
return alpha, beta, gamma
[docs]def dirCosToPostel(alpha, beta, gamma):
"""Convert direction cosines to Postel azimuthal equidistant tangent plane
projection.
Parameters
----------
alpha, beta, gamma : float
Direction cosines (unit vector projected onto x, y, z in order)
Returns
-------
u, v : float
Postel tangent plane coordinates in radians.
Notes
-----
The tangent plane reference is at (u,v) = (0,0), which corresponds to
(alpha, beta, gamma) = (0, 0, -1) (a ray coming directly from above). The
orientation is such that vx (vy) is positive when u (v) is positive.
"""
wZero = (gamma == -1)
try:
if wZero:
return 0.0, 0.0
except ValueError:
pass
rho = np.arccos(-gamma)
srho = np.sin(rho)
with warnings.catch_warnings():
warnings.simplefilter("ignore")
u = alpha*rho/srho
v = beta*rho/srho
if np.any(wZero):
u[wZero] = 0.0
v[wZero] = 0.0
return u, v
[docs]def zemaxToDirCos(u, v):
"""Convert Zemax field angles u,v to direction cosines.
Parameters
----------
u, v : float
Zemax field angles in radians.
Returns
-------
alpha, beta, gamma : float
Direction cosines (unit vector projected onto x, y, z in order)
Notes
-----
The tangent plane reference is at (u,v) = (0,0), which corresponds to
(alpha, beta, gamma) = (0, 0, -1) (a ray coming directly from above). The
orientation is such that vx (vy) is positive when u (v) is positive.
The Zemax field angle convention is not rotationally invariant. The
z-direction cosine for (u, v) = (0, 1) does not equal the z-direction
cosine for (u, v) = (0.6, 0.8).
"""
tanu = np.tan(u)
tanv = np.tan(v)
norm = np.sqrt(1 + tanu*tanu + tanv*tanv)
return tanu/norm, tanv/norm, -1/norm
[docs]def dirCosToZemax(alpha, beta, gamma):
"""Convert direction cosines to Postel azimuthal equidistant tangent plane
projection.
Parameters
----------
alpha, beta, gamma : float
Direction cosines (unit vector projected onto x, y, z in order)
Returns
-------
u, v : float
Postel tangent plane coordinates in radians.
Notes
-----
The tangent plane reference is at (u,v) = (0,0), which corresponds to
(alpha, beta, gamma) = (0, 0, -1) (a ray coming directly from above). The
orientation is such that vx (vy) is positive when u (v) is positive.
The Zemax field angle convention is not rotationally invariant. The
z-direction cosine for (u, v) = (0, 1) does not equal the z-direction
cosine for (u, v) = (0.6, 0.8).
"""
return np.arctan(-alpha/gamma), np.arctan(-beta/gamma)
[docs]def stereographicToDirCos(u, v):
"""Convert stereographic tangent plane projection u,v to direction cosines.
Parameters
----------
u, v : float
Stereographic tangent plane coordinates in radians.
Returns
-------
alpha, beta, gamma : float
Direction cosines (unit vector projected onto x, y, z in order)
Notes
-----
The tangent plane reference is at (u,v) = (0,0), which corresponds to
(alpha, beta, gamma) = (0, 0, -1) (a ray coming directly from above). The
orientation is such that vx (vy) is positive when u (v) is positive.
"""
rho = np.sqrt(u*u + v*v)
wZero = (rho == 0.0)
try:
if wZero:
return 0.0, 0.0, -1.0
except ValueError:
pass
theta = 2*np.arctan(rho/2)
stheta = np.sin(theta)
with warnings.catch_warnings():
warnings.simplefilter("ignore")
alpha = u/rho*stheta
beta = v/rho*stheta
gamma = -np.cos(theta)
if np.any(wZero):
alpha[wZero] = 0.0
beta[wZero] = 0.0
gamma[wZero] = -1.0
return alpha, beta, gamma
[docs]def dirCosToStereographic(alpha, beta, gamma):
"""Convert direction cosines to stereographic tangent plane projection.
Parameters
----------
alpha, beta, gamma : float
Direction cosines (unit vector projected onto x, y, z in order)
Returns
-------
u, v : float
Stereographic tangent plane coordinates in radians.
Notes
-----
The tangent plane reference is at (u,v) = (0,0), which corresponds to
(alpha, beta, gamma) = (0, 0, -1) (a ray coming directly from above). The
orientation is such that vx (vy) is positive when u (v) is positive.
"""
wZero = (gamma == -1)
try:
if wZero:
return 0.0, 0.0
except ValueError:
pass
theta = np.arccos(-gamma)
rho = 2*np.tan(theta/2)
stheta = np.sin(theta)
with warnings.catch_warnings():
warnings.simplefilter("ignore")
u = alpha*rho/stheta
v = beta*rho/stheta
if np.any(wZero):
u[wZero] = 0.0
v[wZero] = 0.0
return u, v
[docs]def orthographicToDirCos(u, v):
"""Convert orthographic tangent plane projection u,v to direction cosines.
Parameters
----------
u, v : float
Orthographic tangent plane coordinates in radians.
Returns
-------
alpha, beta, gamma : float
Direction cosines (unit vector projected onto x, y, z in order)
Notes
-----
The tangent plane reference is at (u,v) = (0,0), which corresponds to
(alpha, beta, gamma) = (0, 0, -1) (a ray coming directly from above). The
orientation is such that vx (vy) is positive when u (v) is positive.
"""
rho = np.sqrt(u*u + v*v)
theta = np.arcsin(rho)
gamma = np.cos(theta)
alpha = u
beta = v
return alpha, beta, -gamma
[docs]def dirCosToOrthographic(alpha, beta, gamma):
"""Convert direction cosines to orthographic tangent plane projection.
Parameters
----------
alpha, beta, gamma : float
Direction cosines (unit vector projected onto x, y, z in order)
Returns
-------
u, v : float
Orthographic tangent plane coordinates in radians.
Notes
-----
The tangent plane reference is at (u,v) = (0,0), which corresponds to
(alpha, beta, gamma) = (0, 0, -1) (a ray coming directly from above).
Parameters
----------
u, v : float
Lambert tangent plane coordinates in radians.
Returns
-------
alpha, beta, gamma : float
Direction cosines (unit vector projected onto x, y, z in order)
Notes
-----
The tangent plane reference is at (u,v) = (0,0), which corresponds to
(alpha, beta, gamma) = (0, 0, -1) (a ray coming directly from above). The
orientation is such that vx (vy) is positive when u (v) is positive.
"""
rhosqr = u*u + v*v
wZero = rhosqr == 0.0
try:
if wZero:
return 0.0, 0.0, -1.0
except ValueError:
pass
rho = np.sqrt(rhosqr)
gamma = (2-rhosqr)/2
r = np.sqrt(1-gamma*gamma)
with warnings.catch_warnings():
warnings.simplefilter("ignore")
alpha = u * r/rho
beta = v * r/rho
if np.any(wZero):
alpha[wZero] = 0.0
beta[wZero] = 0.0
gamma[wZero] = 1.0
return alpha, beta, -gamma
[docs]def dirCosToLambert(alpha, beta, gamma):
"""Convert direction cosines to Lambert azimuthal equal-area tangent plane
projection.
Parameters
----------
alpha, beta, gamma : float
Direction cosines (unit vector projected onto x, y, z in order)
Returns
-------
u, v : float
Lambert tangent plane coordinates in radians.
Notes
-----
The tangent plane reference is at (u,v) = (0,0), which corresponds to
(alpha, beta, gamma) = (0, 0, -1) (a ray coming directly from above). The
orientation is such that vx (vy) is positive when u (v) is positive.
"""
wZero = (gamma == -1)
try:
if wZero:
return 0.0, 0.0
except ValueError:
pass
rho = np.sqrt(2+2*gamma)
norm = np.sqrt(1-gamma*gamma)
with warnings.catch_warnings():
warnings.simplefilter("ignore")
u = alpha*rho/norm
v = beta*rho/norm
if np.any(wZero):
u[wZero] = 0.0
v[wZero] = 0.0
return u, v
[docs]def fieldToDirCos(u, v, projection='postel'):
"""Convert field angle to direction cosines using specified projection.
Parameters
----------
u, v : float
Tangent plane coordinates in radians.
projection : {'postel', 'zemax', 'gnomonic', 'stereographic', 'lambert', 'orthographic'}
Projection used to convert field angle to direction cosines.
Returns
-------
alpha, beta, gamma : float
Direction cosines (unit vector projected onto x, y, z in order)
Notes
-----
The tangent plane reference is at (u,v) = (0,0), which corresponds to
(alpha, beta, gamma) = (0, 0, -1) (a ray coming directly from above). The
orientation is such that vx (vy) is positive when u (v) is positive.
"""
if projection == 'postel':
return postelToDirCos(u, v)
elif projection == 'zemax':
return zemaxToDirCos(u, v)
elif projection == 'gnomonic':
return gnomonicToDirCos(u, v)
elif projection == 'stereographic':
return stereographicToDirCos(u, v)
elif projection == 'lambert':
return lambertToDirCos(u, v)
elif projection == 'orthographic':
return orthographicToDirCos(u, v)
else:
raise ValueError("Bad projection: {}".format(projection))
[docs]def dirCosToField(alpha, beta, gamma, projection='postel'):
"""Convert direction cosines to field angle using specified projection.
Parameters
----------
alpha, beta, gamma : float
Direction cosines (unit vector projected onto x, y, z in order)
projection : {'postel', 'zemax', 'gnomonic', 'stereographic', 'lambert', 'orthographic'}
Projection used to convert direction cosines to field angle.
Returns
-------
u, v : float
Tangent plane coordinates in radians.
Notes
-----
The tangent plane reference is at (u,v) = (0,0), which corresponds to
(alpha, beta, gamma) = (0, 0, -1) (a ray coming directly from above). The
orientation is such that vx (vy) is positive when u (v) is positive.
"""
if projection == 'postel':
return dirCosToPostel(alpha, beta, gamma)
elif projection == 'zemax':
return dirCosToZemax(alpha, beta, gamma)
elif projection == 'gnomonic':
return dirCosToGnomonic(alpha, beta, gamma)
elif projection == 'stereographic':
return dirCosToStereographic(alpha, beta, gamma)
elif projection == 'lambert':
return dirCosToLambert(alpha, beta, gamma)
elif projection == 'orthographic':
return dirCosToOrthographic(alpha, beta, gamma)
else:
raise ValueError("Bad projection: {}".format(projection))
# http://stackoverflow.com/a/6849299
class lazy_property(object):
"""
meant to be used for lazy evaluation of an object attribute.
property should represent non-mutable data, as it replaces itself.
"""
def __init__(self, fget):
self.fget = fget
self.func_name = fget.__name__
def __get__(self, obj, cls):
if obj is None:
return self
value = self.fget(obj)
setattr(obj, self.func_name, value)
return value


Cheapass needs your help.
Fill up this small questionnaire to help us with Cheapass. It'll take less than a minute. We promise!
BTW, Thank you for being an active user on Cheapass. We hope you're enjoying the service!
Email<EMAIL_ADDRESS>We'll keep communication like this to an absolute minimum. If you'd, however, not receive any of these, you may unsubscribe by clicking here.


Texas Chainsaw Massacre: The Next Generation A review by Joe Chamberlain Starring Renee Zellweger; Matthew McConaughey; Robert Jacks; Tonie Perensky & Joe Stevens
There is a rule when it comes to movies. A sequel is never as good as the original. There are very few exceptions to this rule, and Texas Chainsaw Massacre: The Next Generation is not one of them. Now if you also take into consideration that the original Chainsaw Massacre was a REALLY bad movie, and that this isn't even the first sequel to it, you have a recipe for a very painful viewing experience. Don't be fooled by the presence of up and coming talents Matthew McConaughey (A Time To Kill) and Renee Zellweger (Jerry Maguire). They made this movie before they were stars. Judging by their performances they also made it before they took any acting lessons. It's a wonder they ever worked in Hollywood again after appearing in this turkey.
Apparently the producers of this film realized just how bad it was, because it sat unreleased for years until someone decided that they might be able to capitalize off the success of McConaughey and Zellweger. Apparently the two young stars were none too happy about this thing ever seeing the light of day. And I don't blame them, they would have been better off if this had been some sort of porno flick starring the two of them.  While McConaughey plays a guy who wears a mechanical brace on his leg that he controls with a television remote control. (Hey, don't say I didn't warn you.) To make matters worse, Leatherface, the chainsaw wielding maniac, who was never the scariest of psychopathic killers at the best of times, has now become a full blown cross-dresser, and spends the entire movie in drag. There is a plot to this movie but it isn't worth mentioning. Let's just suffice to say that a group of teenagers are in the typical wrong place at the wrong time and are left to the mercy of remote control man (McConaughey) and his lipstick wearing chainsaw revving half-witted sidekick. Man, I can't get over just how bad this movie is.
This film has absolutely no redeeming qualities. Even the obligatory topless babe shot wasn't enough to hold my interest for more than 2 seconds. The writing is bad, the direction is even worse, but both of those things look good in comparison to the acting. This is the sort of movie that they should make people in prison watch. A guarantee you, if criminals thought that they would be subjected to this film they would never break the law again.
1/10
Visit The Movie Guy http://members.tripod.com/~MovieGuy/index.html
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Welcome to The ETH Guide! Are you new to ETH? Then you are at the right place! Not only made for newbies,
this website should be a helping hand from students to students, because let's be honest, every one
of us gets confused once in a while at ETH, am I right?
First, you might want to find out to what Study Association you belong to. For this, search for your course
here.
To find the website of your student association, click here.
How to start
The first thing you might want to do is to login to
MyStudies and get your timetable. You should by now have set a new password or at least know
the one given to you by ETH. Once you're logged in, you will have to press the button saying "Functions".
Next, you will be clicking on "Course registration".
.
The next step will be individual for each one of you. You'll have to choose your programme. As an
example I've chosen to show "Computer Science Bachelor's Degree Programme".
There's no need to fill out more then this, just hit the "Search" button and you'll get a list of
the courses you will be taking.
You should have the option to click on it at the top of the page.
At first, it will all seem quite chaotic. Don't worry. At the top of the table click on "Timetable".
This should look more familiar ;).
In the list, you'll only have to tick some of the courses, but this is not quite important yet...
On the timetable, there's a number on top of every course followed by one letter:
"V" which comes from "Vorlesung", german for Lecture. Those normally take place in relatively
large lecture rooms. Or
"U" for "Übung", the german word for exercise. Those classes will be held in classrooms
like the ones you probably know from Gymi, and they will be held by teaching assistents, which normally
are students from a higher semester. You should treat them like people your age, and not like a teacher,
trust me.


Package org.h2.util
Class ScriptReader
- java.lang.Object
-
- org.h2.util.ScriptReader
-
- All Implemented Interfaces:
java.io.Closeable
,java.lang.AutoCloseable
public class ScriptReader extends java.lang.Object implements java.io.Closeable
This class can split SQL scripts to single SQL statements. Each SQL statement ends with the character ';', however it is ignored in comments and quotes.
-
-
Field Summary
Fields Modifier and Type Field Description private boolean
blockRemark
Only valid if insideRemark is true.private char[]
buffer
private int
bufferEnd
The position in the buffer of the last available charprivate int
bufferPos
The position in the buffer of the next char to be readprivate int
bufferStart
The position in the buffer of the statement startprivate boolean
endOfFile
True if we have read past the end of fileprivate boolean
insideRemark
True if we are inside a commentprivate static int
IO_BUFFER_SIZE
The block size for I/O operations.private java.io.Reader
reader
private int
remarkStart
The position in buffer of start of commentprivate boolean
skipRemarks
True if comments should be skipped completely by this reader.
-
Constructor Summary
Constructors Constructor Description ScriptReader(java.io.Reader reader)
Create a new SQL script reader from the given reader
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description private void
clearRemark()
void
close()
Close the underlying reader.private void
endRemark()
boolean
isBlockRemark()
If currently inside a remark, this method tells if it is a block comment (true) or single line comment (false)boolean
isInsideRemark()
Check if this is the last statement, and if the single line or block comment is not finished yet.private int
read()
private int
readBuffer()
java.lang.String
readStatement()
Read a statement from the reader.private java.lang.String
readStatementLoop()
void
setSkipRemarks(boolean skipRemarks)
If comments should be skipped completely by this reader.private void
startRemark(boolean block)
-
-
-
Field Detail
-
IO_BUFFER_SIZE
private static final int IO_BUFFER_SIZE
The block size for I/O operations. NOTE: This static variable was added by FBSQL Team team- See Also:
- Constant Field Values
-
reader
private final java.io.Reader reader
-
buffer
private char[] buffer
-
bufferPos
private int bufferPos
The position in the buffer of the next char to be read
-
bufferStart
private int bufferStart
The position in the buffer of the statement start
-
bufferEnd
private int bufferEnd
The position in the buffer of the last available char
-
endOfFile
private boolean endOfFile
True if we have read past the end of file
-
insideRemark
private boolean insideRemark
True if we are inside a comment
-
blockRemark
private boolean blockRemark
Only valid if insideRemark is true. True if we are inside a block comment, false if we are inside a line comment
-
skipRemarks
private boolean skipRemarks
True if comments should be skipped completely by this reader.
-
remarkStart
private int remarkStart
The position in buffer of start of comment
-
-
Constructor Detail
-
ScriptReader
public ScriptReader(java.io.Reader reader)
Create a new SQL script reader from the given reader- Parameters:
reader
- the reader
-
-
Method Detail
-
close
public void close() throws java.io.IOException
Close the underlying reader.- Specified by:
close
in interfacejava.lang.AutoCloseable
- Specified by:
close
in interfacejava.io.Closeable
- Throws:
java.io.IOException
- NOTE: This method was modified by FBSQL Team team (for original version see above)
-
readStatement
public java.lang.String readStatement() throws java.io.IOException
Read a statement from the reader. This method returns null if the end has been reached.- Returns:
- the SQL statement or null
- Throws:
java.io.IOException
- NOTE: This method was modified by FBSQL Team team (for original version see above)
-
readStatementLoop
private java.lang.String readStatementLoop() throws java.io.IOException
- Throws:
java.io.IOException
-
startRemark
private void startRemark(boolean block)
-
endRemark
private void endRemark()
-
clearRemark
private void clearRemark()
-
read
private int read() throws java.io.IOException
- Throws:
java.io.IOException
-
readBuffer
private int readBuffer() throws java.io.IOException
- Throws:
java.io.IOException
-
isInsideRemark
public boolean isInsideRemark()
Check if this is the last statement, and if the single line or block comment is not finished yet.- Returns:
- true if the current position is inside a remark
-
isBlockRemark
public boolean isBlockRemark()
If currently inside a remark, this method tells if it is a block comment (true) or single line comment (false)- Returns:
- true if inside a block comment
-
setSkipRemarks
public void setSkipRemarks(boolean skipRemarks)
If comments should be skipped completely by this reader.- Parameters:
skipRemarks
- true if comments should be skipped
-
-


Fire SelfBot🔥
Homepage
Fire SelfBot🔥
Next Generation SelfBot? I dont think.
About Fire SelfBot
Custom Themes
Nitro Sniper
Fast dmclear
Many Commands !
Credits for site base
here


--- title: "Man Attempts to Rape Woman, She Beats The Sh*t Out Of Him" featimg: "http://www.viralthread.com/wp-content/uploads/2015/12/Screen-Shot-2015-12-02-at-15.28.38.png" description: "" categories: article_url: "http://www.viralthread.com/man-attempts-to-rape-woman-she-beats-the-sht-out-of-him/" social_media_msg: "Never underestimate a woman!" ---
It’s an unfortunate truth that there is still an element of barbarism in the human psyche which occasionally permits the most horrendous acts. However, when Jonathan Holmes decided to follow a woman home one night, he wasn’t expecting her to kick the crap out of him.
The incident happened in Sheffield, UK, where 35-year-old Holmes followed the woman for over a mile. According to the Mirror, he told her that she was “going to enjoy this” and stuck his tongue in her mouth. However, his victim fought back – punching him, biting his tongue and using her keys to stab him in the neck.
Despite being deeply affected by the incident, the woman was brave enough to face Holmes in court. “I believed without a doubt he was going to rape me,” she explained, during the trial. Holmes, meanwhile, stated that he had been drinking and had no recollection of what happened.
“My life would have been over, he might as well have killed me right there,” the victim continued. “I was so terrified but so angry.” What happened to me was my worst nightmare. The whole thing replayed in my head for days. Now going anywhere after dark is really stressful for me.”
“No one listening could fail to have been moved by her words. It is clear to me that what you did had a devastating effect on her life,” Judge Sarah Write told the court. “She is not able to continue her life as before.” Holmes may have played dumb but detectives discovered CCTV footage of him watching women throughout the afternoon.
I hate to imagine what the victim looked like after the ordeal. Other news reports paid little mind to how badly beaten Holmes was after the incident. I’m not sure if this is a sign that he came off better or worse. He was sentenced to four and a half years in prison.


0% OF 2019 PUBLICATIONS
COMPARED TO 2017
16% OF 2019 DOWNLOADS
76%
FROM LAC
0% OF 2019 MOOCS
0
COMPARED TO 2017
0% OF 2019 REGISTRATIONS
0%
FROM LAC
0% OF 2019 DATASETS
0
COMPARED TO 2017
0 OF 2019 DOWNLOADS
0%
FROM LAC
0% OF 2019 CODE
0
COMPARED TO 2017
0% OF 2019 PAGEVIEWS
0%FROM
LAC
0% OF SUBSCRIBERS
0
SUBSCRIBERS IN 2019
0% FROM LAC


{% extends 'base.html' %} {% block content %} MockerData An open source webapp for generating mock data for testing your websites and apps! Field Name Data type Delete Select data type Firstname Lastname Age ID (Row number) country city address street_address Month number Month name Time (24 hour format) Timezone Year Currency name Currency code Currency sympol BBAN IBAN Credit card number Credit card provider Country calling code Phone number Username Email Company email Password Domain name Url Image url Select data type Firstname Lastname Age ID (Row number) country city address street_address Month number Month name Time (24 hour format) Timezone Year Currency name Currency code Currency sympol BBAN IBAN Credit card number Credit card provider Country calling code Phone number Username Email Company email Password Domain name Url Image url Add Field Dataset name #Rows Data Format JSON CSV HTML SQL Download Preview Preview {% endblock %}
Field Name
Data type
Delete
Download
Preview


Registration Required If not a registered user click on Sign-up else click on login enter the valid password admin login only for adminisrative purposes


Tests debugging of HTML5 Workers
- Open DevTools, Scripts Panel; Tick Debug on Workers sidebar.
- Reload the page.
- Observe 2 workers appear in the worker sidebar pane (including non-existent-worker.js)"
- Observe worker-primes.js and primes.js appear in scripts drop-down box.
- Assure primes are being logged to test console below.
- Set a breakpoint on one of worker scripts, assure it's hit.
- Try causing an error in worker, observe it's logged in DevTools console and in test console below.


Nickelodeon Renews 'Blue's Clues and You!' for Season 2
Series premiered Nov. 11
by Margeaux SippellNickelodeon has renewed “Blue’s Clues & You!” for a second season.
The children’s network ordered an additional 20 episodes of the preschool series, which premiered on Nov. 11. A remake of the 1996 classic “Blue’s Clues” series, “Blue’s Clues & You!” follows new host Josh (Josh Dela Cruz) and Blue on new adventures.
In Season 2, original “Blue’s Clues” host Steve (Steve Burns) will make an appearance, as will the show’s second host, Joe (Donovan Patton), and Dela Cruz’s grandmother. Season 2 will also feature “even more singing and dancing, exploration, celebration, and of course clues that empower preschoolers to help their friends,” according to the network.
Nickelodeon also has plans to debut a new “Blue’s Clues & You!” inspired float at the Macy’s Thanksgiving Day Parade, on which Dela Cruz will perform alongside a 22-foot tall Blue covered in 13 pounds of glitter.
Also Read:
The original “Blue’s Clues” aired on Nickelodeon from 1996 to 2006. The remake features a modern take on beloved “Blue’s Clues” hallmarks, like the Handy Dandy Notebook, which is now a smartphone that Josh can have video calls and receive emails. Blue and his pal Magenta have been updated with CG-animation, and original characters Tickety Tock, Slippery Soap, Shovel, Pail, Mr. Salt, Mrs. Pepper, Cinnamon, Paprika, Felt Friends, Sidetable Drawer and Mailbox will all return — plus the original Thinking Chair. New additions include Mr. Salt and Mrs. Pepper’s twins, Sage and Ginger, and an all-new Handy Dandy Guitar.
New episodes of “Blue’s Clues & You!” are currently airing weekdays at 11 a.m. ET/PT on Nickelodeon.
Star athletes Chris Paul, Danica Patrick, Aaron Rodgers, Micheal Phelps, Travis Kelce and Ronda Rousey dare to be slimed at the annual awards show
View In Gallery


C/C++ Folder Properties, Resource
- Resource
- Shows resource information.
- Read only
- Set Read-only attribute for folder
- Archive
- Set Archive attribute for folder
- Derived
- Set Derived attribute for folder
- Text file encoding
- Sets an alternate text encoding.
Available for :- Any projects, folders and files regardless of project kind
- Resource
- C/C++ Build
- C/C++ General
- Paths and Symbols
- Run/Debug Settings page


Computation of the International Roughness Index (IRI) given a longitudinal road profile. The IRI can be calculated for a single road segment or for a sequence of segments with a fixed length (e. g. 100m). For the latter, an overlap of the segments can be selected. The IRI and likewise the algorithms for its determination are defined in Sayers, Michael W; Gillespie, Thomas D; Queiroz, Cesar A.V. 1986. The International Road Roughness Experiment (IRRE) : establishing correlation and a calibration standard for measurements. World Bank technical paper; no. WTP 45. Washington, DC : The World Bank. (ISBN 0-8213-0589-1) available from <http://documents.worldbank.org/curated/en/326081468740204115>.
| Version: | 0.0.5 |
| Suggests: | testthat, knitr, zoo, biwavelet |
| Published: | 2018-02-21 |
| Author: | Viliam Simko [cre, aut], Kevin Laubis [aut] |
| Maintainer: | Viliam Simko <viliam.simko at gmail.com> |
| BugReports: | http://github.com/vsimko/rroad/issues |
| License: | MIT + file LICENSE |
| URL: | http://github.com/vsimko/rroad |
| NeedsCompilation: | no |
| CRAN checks: | rroad results |
| Reference manual: | rroad.pdf |
| Vignettes: |
Road Condition Analysis |
| Package source: | rroad_0.0.5.tar.gz |
| Windows binaries: | r-devel: rroad_0.0.5.zip, r-release: rroad_0.0.5.zip, r-oldrel: rroad_0.0.5.zip |
| OS X binaries: | r-release: rroad_0.0.5.tgz, r-oldrel: rroad_0.0.5.tgz |
| Old sources: | rroad archive |
Please use the canonical form https://CRAN.R-project.org/package=rroad to link to this page.


Home
News
Our Projects
Gallery
Contact
Sign in
Due to the pandemic, we can only work by appointment.
Please make an appointment by filling out the form below.


Adding Aqara Sensors to Home Assistant
to monitor temperature, humidity and air pressure
Home Assistant is running great! It is time to add some more devices to my setup, and since all groundwork to add Zigbee devices using Zigbee2MQTT was done previously (check out this post) it makes sense to add more devices that support this protocol. For this post I picked up two Aqara sensors which can measure temperature, humidity and air pressure in a small form factor.
Pairing new Zigbee devices
First we need to pair Zigbee2MQTT to the new sensors, to do this we’ll have to log onto the Raspberry Pi and edit the
file /opt/zigbee2mqtt/data/configuration.yaml
. Find the line that says permit_join: false
and change this
to permit_join: true
. Then restart Zigbee2MQTT using the commands below.
sudo nano /opt/zigbee2mqtt/data/configuration.yaml
sudo systemctl restart zigbee2mqtt
Now Zigbee2MQTT is ready to pair with new devices. To pair a sensor, press the button on top. Once you press
the button it will blink once indicating it is pairing and upon connecting it will blink twice. Now go back into
/opt/zigbee2mqtt/data/configuration.yaml
and give your device a name, this is done by adding a friendly_name
tag
to the device as shown below in my configuration file.
...
devices:
'0x00158d0003495e50':
friendly_name: Aqara Cube
'0x00158d00068b6c2e':
friendly_name: TMP Sensor Bedroom
'0x00158d0006a08eda':
friendly_name: TMP Sensor Nursery
While you could connect all devices in one go, I recommend adding them one by one and setting the name to something
easy to remember. Once you have connected the last device set permit_join
back to false
and restart
Zigbee2MQTT one last time.
Creating an interface for our sensors
Once all new devices are paired you should see in Home Assistants Integrations page (in Configuration) that there are a few additional MQTT devices found. Let’s quickly set up an interface to monitor them!
At a later stage a smart socket could be used to turn the humidifier on automatically when necessary. For the time being, I’m just interested in monitoring the temperature and humidity in our master bedroom and nursery. So in case it feels cold, or dry I can go back and see what was going on the last 48 hours.
So I’ve added a new page in Home Assistant and combined a glance card with two sensor cards into a nice overview for the two rooms. With recent versions of Home Assistant, these can be set up easily using the interface, or you can use the yaml code below (don’t forget to change the sensors to match you system).
type: vertical-stack
title: Office/Nursery
cards:
- type: glance
entities:
- entity: sensor.0x00158d0006a08eda_temperature
- entity: sensor.0x00158d0006a08eda_humidity
- entity: sensor.0x00158d0006a08eda_pressure
show_name: false
- type: horizontal-stack
cards:
- type: sensor
entity: sensor.0x00158d0006a08eda_temperature
graph: line
hours_to_show: 48
name: Temperature
detail: 2
- type: sensor
entity: sensor.0x00158d0006a08eda_humidity
graph: line
hours_to_show: 48
detail: 2
name: Humidity
24 Hour test
Given how inexpensive these sensors are I wanted to test how well they actually performed. So before installing them in their final location I put them side by side on my desk and pulled the data from Home Assistant after 24 hours. The temperature measurement is very consistent between both devices, usually it is off by less than 0.1 degrees. Comparing temperatures in different rooms equipped with these sensors is perfectly possible. Humidity readings are also fairly consistent between the devices and vary about 1% between devices. Again good enough to directly compare readings of sensors in different rooms. The air pressure however is off by about 2-3 hPa on both devices and considerably lower than the (outside) air pressure reported by the closest weather station. However, the correlation with the outside air pressure was pretty good. So while the absolute value seems to be off, it is a consistent error and readings between devices can’t be directly compared, it is possible to calibrate and correct this. As I have no real use for barometric pressure readings, let along comparing them between rooms, this is a non-issue for me.
Conclusion
Since creating the Zigbee2MQTT stick was the hard part and this was done in the previous post connecting an Aqara cube to Home Assistant, adding two more sensors was a breeze. Apart from the lack of an interface to pair new devices, which required dropping into the console and type a few commands, it is pretty easy, and it is tempting to start adding additional devices …
Liked this post ? You can buy me a coffee


Review the scenario below, then answer the questions which follow, using the UML diagram below.
This UML may represent the partial design for an
Employee Management System (sometimes referred to as an
Employee Information System or Human Resources Information System)
for a business or organization.
Such systems are often used to support tracking and managing of
employee information and related process.
This may including recruitment and applicant tracking, payroll
administration, vacation and benefits administration, time and
attendance management, training, and performance management.
An Employee Management System would need the ability to track
and manage many different instances of the Employee objects
(as well as many instances of Employee subclasses, such as
ExternalContractor, PartTimeEmployee).
To accommodate this requirement the design should be amended to include:
There are no hints for this question


Stores either a surface or texture which can be drawn on screen by providing a renderer to render().
More...
#include <Drawable.hpp>
|
| | Drawable () |
| | Height of mask. More...
|
| |
| | Drawable (Renderer *renderer, SDL_Surface *surf, const unsigned int width, const unsigned int height) |
| | Create a Drawable from a surface. More...
|
| |
| | Drawable (Renderer *renderer, SDL_Texture *tex, const unsigned int width, const unsigned int height) |
| | Create a Drawable from a texture. More...
|
| |
| ImageData | getImageData () |
| | Returns the ImageData for the currently stored image. More...
|
| |
| void | setColour (const Colour &colour) |
| | Set colour to tint Drawable with when rendered. More...
|
| |
| void | setMask (const int x, const int y, const unsigned int width, const unsigned int height) |
| | Set the mask (area to draw) More...
|
| |
| void | render (const int x, const int y, const unsigned int width=0, const unsigned int height=0) |
| | Render the Drawable on screen at the given coordinates. More...
|
| |
| bool | convertToTexture () |
| | Convert the contained surface to a texture. Has no effect if the Drawable does not contain a surface. More...
|
| |
| Type | type () |
| | Returns the type of the data stored. More...
|
| |
| int | width () |
| | Returns the width of the Drawable in pixels. More...
|
| |
| int | height () |
| | Returns the height of the Drawable in pixels. More...
|
| |
|
| ~Drawable () |
| | Destructor ensures contained data is deleted appropriately.
|
| |
Stores either a surface or texture which can be drawn on screen by providing a renderer to render().
- Note
- This class is not thread-safe by itself.
-
All instances of this should be deleted before deleting the main renderer.
◆ Type
Type of raw data stored.
| Enumerator |
|---|
| None | Doesn't store any data that can be rendered
|
| Surface | Currently stores a SDL 'surface'
|
| Texture | Currently stores a SDL 'texture'
|
◆ Drawable() [1/3]
| Aether::Drawable::Drawable |
( |
| ) |
|
Height of mask.
Default constructor. Initializes with no data.
- Note
- This is effectively useless: it's here for default allocations.
◆ Drawable() [2/3]
| Aether::Drawable::Drawable |
( |
Renderer * |
renderer, |
|
|
SDL_Surface * |
surf, |
|
|
const unsigned int |
width, |
|
|
const unsigned int |
height |
|
) |
| |
Create a Drawable from a surface.
- Parameters
-
| renderer | Renderer to draw/manipulate Drawable with |
| surf | Surface to instantiate with |
| width | Width of given surface (in pixels) |
| height | Height of given surface (in pixels) |
◆ Drawable() [3/3]
| Aether::Drawable::Drawable |
( |
Renderer * |
renderer, |
|
|
SDL_Texture * |
tex, |
|
|
const unsigned int |
width, |
|
|
const unsigned int |
height |
|
) |
| |
Create a Drawable from a texture.
- Parameters
-
| renderer | Renderer to draw/manipulate Drawable with |
| tex | Texture to instantiate with |
| width | Width of given texture (in pixels) |
| height | Height of given texture (in pixels) |
◆ convertToTexture()
| bool Aether::Drawable::convertToTexture |
( |
| ) |
|
Convert the contained surface to a texture. Has no effect if the Drawable does not contain a surface.
- Note
- This should be called by the same thread that instantiated the renderer!
- Returns
- true if successful/not a surface, false if conversion failed
◆ getImageData()
Returns the ImageData for the currently stored image.
- Returns
- ImageData for the currently stored image.
◆ height()
| int Aether::Drawable::height |
( |
| ) |
|
Returns the height of the Drawable in pixels.
- Returns
- Height of Drawable in pixels, 0 if no data stored
◆ render()
| void Aether::Drawable::render |
( |
const int |
x, |
|
|
const int |
y, |
|
|
const unsigned int |
width = 0 , |
|
|
const unsigned int |
height = 0 |
|
) |
| |
Render the Drawable on screen at the given coordinates.
- Parameters
-
| x | X coordinate (top-left) |
| y | Y coordinate (top-left) |
| width | Width to render at (optional, defaults to Drawable size) |
| height | Height to render at (optional, defaults to Drawable size) |
◆ setColour()
| void Aether::Drawable::setColour |
( |
const Colour & |
colour | ) |
|
Set colour to tint Drawable with when rendered.
- Parameters
-
◆ setMask()
| void Aether::Drawable::setMask |
( |
const int |
x, |
|
|
const int |
y, |
|
|
const unsigned int |
width, |
|
|
const unsigned int |
height |
|
) |
| |
Set the mask (area to draw)
- Parameters
-
| x | X coordinate of mask (top-left) |
| y | Y coordinate of mask (top-left) |
| width | Width of mask |
| height | Height of mask |
◆ type()
| Type Aether::Drawable::type |
( |
| ) |
|
Returns the type of the data stored.
- Returns
- Type of raw data stored (see Type)
◆ width()
| int Aether::Drawable::width |
( |
| ) |
|
Returns the width of the Drawable in pixels.
- Returns
- Width of Drawable in pixels, 0 if no data stored
The documentation for this class was generated from the following file:


Proposal for a Key Revokation Procedure for Tor Hidden Services
13 Nov 2014Warning (03/12/2014): This proposal was based on a flawed understanding of the DHT. And will not work with the current tor implementation.  However, I am leaving it up incase the implementation changes in future or whatever.
Warning in advance: I am not a proper cryptographer, and I am not a tor developer. I am just some gobshite on the internet who is going to make some probably incredibly stupid statements in this short posting that might be of interest to people far more intelligent than myself. Also, this is not exactly providing much in the lines of “implementation”, it is merely chucking an idea out there for the clever fuckers to figure out the details of ;)
So in light of the recent FBI/Europol takedowns of a number of tor hidden services, and subsequent reseizure of the doxbin hidden service by persons unknown (nachash was quite adamant that it was not him, and that he had given the keys to an interested party), it suddenly came to mind that there might be a need for a key revokation mechanism for tor hidden services - similar to the revokation method in use with PGP. Except, obviously, better.
Anyways. So onions are stored in a distributed hash table, which, as the name suggests, is distributed. The hidden service domain is calculated from the public key of a private-public keypair.
So, what I am proposing is an extension to the DHT protocol to not only allow publishing a hidden service descriptor to the DHT, but a secure revokation mechanism (based on the private key) that would allow a hidden service operator to “kill” a hidden service. Furthermore, a mechanism wherin prior to killing a HS, perhaps the ability to create new keys, sign with the old ones, pop it in the DHT, wait for a consensus mechanism to accept the new service, and then kill the old keys. This would, probably, be needlessly complex, however, so it would likely be best to just go with the revokation mechanism.
Uses for the revokation mechanism would include killing a HS post-compromise (by LE, Government, or malicious hackers) to defend the users of it from impersonation, amongst other things.


Change Password
Enter your existing password and new password.
x
Well done!
You have successfully changed your password.
x
Oh snap!
Password change failed. Please try again.
Input is incorrect
*
Original:
*
New:
*
New Again:
Submit
* indicates a required field
Change Password
If you forgot your password for this account please
Click Here
.


Tharoor comments on Maha drama in typical fashion
by DH Web DeskCongress MP Shashi Tharoor retweeted one of his old tweets yesterday in response to the surprising political happenings in Maharashtra. The tweet from about two years ago said “Word of the day! Definition of *snollygoster* US dialect: a shrewd, unprincipled politician First Known Use: 1845 Most recent use: 26/7/17”
He added a comment to the retweet “Correction: Most recent use: 23 November 2019, Mumbai” referring to the political drama that was unfolding in the state.
A flurry of Twitter users responded to Dr Tharoor’s comment on the usage of the word and the political drama in Maharashtra.
@ajay_prabhu_n replied “Sir, please tell if the usage is correct. Amit shah saved Sonia gandhi from being a snollygoster today in Mumbai”
@Ntanjore tweeted “No mr Tharoor it was a Red Herring and you were colour blind to see it! When your secular party chose to interwine hands with communal Sena it was kosher ? Wasn't it renegade? It does hurt when Ur outsmarted at the goal post!”
@agnishul replied “What is the word (US or UK dialect) for - ' Congress and Shiv Sena licking it's own wounds after a sound thrashing by @AmitShah'? I am sure a man of your vocabulary could come up with a word for this phenomenon. #MaharashtraPolitics”
On Saturday, BJP’s Devendra Fadnavis and NCP’s Ajit Pawar took oath as the Chief Minister and Deputy chief minister of the state respectively in a surprise turn of events when a Shiv Sena-NCP-Congress alliance was expected to form a government.