Bessel functions#
This module provides symbolic Bessel and Hankel functions, and their spherical versions. These functions use the mpmath library for numerical evaluation and Maxima, GiNaC, Pynac for symbolics.
The main objects which are exported from this module are:
bessel_J(n, x)
– The Bessel J function
bessel_Y(n, x)
– The Bessel Y function
bessel_I(n, x)
– The Bessel I function
bessel_K(n, x)
– The Bessel K function
Bessel(...)
– A factory function for producing Bessel functions of various kinds and orders
hankel1(nu, z)
– The Hankel function of the first kind
hankel2(nu, z)
– The Hankel function of the second kind
struve_H(nu, z)
– The Struve function
struve_L(nu, z)
– The modified Struve function
spherical_bessel_J(n, z)
– The Spherical Bessel J function
spherical_bessel_Y(n, z)
– The Spherical Bessel J function
spherical_hankel1(n, z)
– The Spherical Hankel function of the first kind
spherical_hankel2(n, z)
– The Spherical Hankel function of the second kind
Bessel functions, first defined by the Swiss mathematician Daniel Bernoulli and named after Friedrich Bessel, are canonical solutions y(x) of Bessel’s differential equation:
\[x^2 \frac{d^2 y}{dx^2} + x \frac{dy}{dx} + \left(x^2 - \nu^2\right)y = 0,\]for an arbitrary complex number \(\nu\) (the order).
In this module, \(J_\nu\) denotes the unique solution of Bessel’s equation which is non-singular at \(x = 0\). This function is known as the Bessel Function of the First Kind. This function also arises as a special case of the hypergeometric function \({}_0F_1\):
\[J_\nu(x) = \frac{x^n}{2^\nu \Gamma(\nu + 1)} {}_0F_1(\nu + 1, -\frac{x^2}{4}).\]The second linearly independent solution to Bessel’s equation (which is singular at \(x=0\)) is denoted by \(Y_\nu\) and is called the Bessel Function of the Second Kind:
\[Y_\nu(x) = \frac{ J_\nu(x) \cos(\pi \nu) - J_{-\nu}(x)}{\sin(\pi \nu)}.\]There are also two commonly used combinations of the Bessel J and Y Functions. The Bessel I Function, or the Modified Bessel Function of the First Kind, is defined by:
\[I_\nu(x) = i^{-\nu} J_\nu(ix).\]The Bessel K Function, or the Modified Bessel Function of the Second Kind, is defined by:
\[K_\nu(x) = \frac{\pi}{2} \cdot \frac{I_{-\nu}(x) - I_n(x)}{\sin(\pi \nu)}.\]We should note here that the above formulas for Bessel Y and K functions should be understood as limits when \(\nu\) is an integer.
It follows from Bessel’s differential equation that the derivative of \(J_n(x)\) with respect to \(x\) is:
\[\frac{d}{dx} J_n(x) = \frac{1}{x^n} \left(x^n J_{n-1}(x) - n x^{n-1} J_n(z) \right)\]Another important formulation of the two linearly independent solutions to Bessel’s equation are the Hankel functions \(H_\nu^{(1)}(x)\) and \(H_\nu^{(2)}(x)\), defined by:
\[H_\nu^{(1)}(x) = J_\nu(x) + i Y_\nu(x)\]\[H_\nu^{(2)}(x) = J_\nu(x) - i Y_\nu(x)\]where \(i\) is the imaginary unit (and \(J_*\) and \(Y_*\) are the usual J- and Y-Bessel functions). These linear combinations are also known as Bessel functions of the third kind; they are also two linearly independent solutions of Bessel’s differential equation. They are named for Hermann Hankel.
When solving for separable solutions of Laplace’s equation in spherical coordinates, the radial equation has the form:
\[x^2 \frac{d^2 y}{dx^2} + 2x \frac{dy}{dx} + [x^2 - n(n+1)]y = 0.\]The spherical Bessel functions \(j_n\) and \(y_n\), are two linearly independent solutions to this equation. They are related to the ordinary Bessel functions \(J_n\) and \(Y_n\) by:
\[j_n(x) = \sqrt{\frac{\pi}{2x}} J_{n+1/2}(x),\]\[y_n(x) = \sqrt{\frac{\pi}{2x}} Y_{n+1/2}(x) = (-1)^{n+1} \sqrt{\frac{\pi}{2x}} J_{-n-1/2}(x).\]
EXAMPLES:
Evaluate the Bessel J function symbolically and numerically:
sage: bessel_J(0, x) bessel_J(0, x) sage: bessel_J(0, 0) 1 sage: bessel_J(0, x).diff(x) -1/2*bessel_J(1, x) + 1/2*bessel_J(-1, x) sage: N(bessel_J(0, 0), digits = 20) 1.0000000000000000000 sage: find_root(bessel_J(0,x), 0, 5) 2.404825557695773Plot the Bessel J function:
sage: f(x) = Bessel(0)(x); f x |--> bessel_J(0, x) sage: plot(f, (x, 1, 10)) Graphics object consisting of 1 graphics primitiveVisualize the Bessel Y function on the complex plane (set plot_points to a higher value to get more detail):
sage: complex_plot(bessel_Y(0, x), (-5, 5), (-5, 5), plot_points=20) Graphics object consisting of 1 graphics primitiveEvaluate a combination of Bessel functions:
sage: f(x) = bessel_J(1, x) - bessel_Y(0, x) sage: f(pi) bessel_J(1, pi) - bessel_Y(0, pi) sage: f(pi).n() -0.0437509653365599 sage: f(pi).n(digits=50) -0.043750965336559909054985168023342675387737118378169Symbolically solve a second order differential equation with initial conditions \(y(1) = a\) and \(y'(1) = b\) in terms of Bessel functions:
sage: y = function('y')(x) sage: a, b = var('a, b') sage: diffeq = x^2*diff(y,x,x) + x*diff(y,x) + x^2*y == 0 sage: f = desolve(diffeq, y, [1, a, b]); f (a*bessel_Y(1, 1) + b*bessel_Y(0, 1))*bessel_J(0, x)/(bessel_J(0, 1)*bessel_Y(1, 1) - bessel_J(1, 1)*bessel_Y(0, 1)) - (a*bessel_J(1, 1) + b*bessel_J(0, 1))*bessel_Y(0, x)/(bessel_J(0, 1)*bessel_Y(1, 1) - bessel_J(1, 1)*bessel_Y(0, 1))For more examples, see the docstring for
Bessel()
.
AUTHORS:
Some of the documentation here has been adapted from David Joyner’s original documentation of Sage’s special functions module (2006).
REFERENCES:
- sage.functions.bessel.Bessel(*args, **kwds)#
A function factory that produces symbolic I, J, K, and Y Bessel functions. There are several ways to call this function:
Bessel(order, type)
Bessel(order)
– type defaults to ‘J’Bessel(order, typ=T)
Bessel(typ=T)
– order is unspecified, this is a 2-parameter functionBessel()
– order is unspecified, type is ‘J’
where
order
can be any integer and T must be one of the strings ‘I’, ‘J’, ‘K’, or ‘Y’.See the EXAMPLES below.
EXAMPLES:
Construction of Bessel functions with various orders and types:
sage: Bessel() bessel_J sage: Bessel(1)(x) bessel_J(1, x) sage: Bessel(1, 'Y')(x) bessel_Y(1, x) sage: Bessel(-2, 'Y')(x) bessel_Y(-2, x) sage: Bessel(typ='K') bessel_K sage: Bessel(0, typ='I')(x) bessel_I(0, x)
Evaluation:
sage: f = Bessel(1) sage: f(3.0) 0.339058958525936 sage: f(3) bessel_J(1, 3) sage: f(3).n(digits=50) 0.33905895852593645892551459720647889697308041819801 sage: g = Bessel(typ='J') sage: g(1,3) bessel_J(1, 3) sage: g(2, 3+I).n() 0.634160370148554 + 0.0253384000032695*I sage: abs(numerical_integral(1/pi*cos(3*sin(x)), 0.0, pi)[0] - Bessel(0, 'J')(3.0)) < 1e-15 True
Symbolic calculus:
sage: f(x) = Bessel(0, 'J')(x) sage: derivative(f, x) x |--> -1/2*bessel_J(1, x) + 1/2*bessel_J(-1, x) sage: derivative(f, x, x) x |--> 1/4*bessel_J(2, x) - 1/2*bessel_J(0, x) + 1/4*bessel_J(-2, x)
Verify that \(J_0\) satisfies Bessel’s differential equation numerically using the
test_relation()
method:sage: y = bessel_J(0, x) sage: diffeq = x^2*derivative(y,x,x) + x*derivative(y,x) + x^2*y == 0 sage: diffeq.test_relation(proof=False) True
Conversion to other systems:
sage: x,y = var('x,y') sage: f = Bessel(typ='K')(x,y) sage: expected = f.derivative(y) sage: actual = maxima(f).derivative('_SAGE_VAR_y').sage() sage: bool(actual == expected) True
Compute the particular solution to Bessel’s Differential Equation that satisfies \(y(1) = 1\) and \(y'(1) = 1\), then verify the initial conditions and plot it:
sage: y = function('y')(x) sage: diffeq = x^2*diff(y,x,x) + x*diff(y,x) + x^2*y == 0 sage: f = desolve(diffeq, y, [1, 1, 1]); f (bessel_Y(1, 1) + bessel_Y(0, 1))*bessel_J(0, x)/(bessel_J(0, 1)*bessel_Y(1, 1) - bessel_J(1, 1)*bessel_Y(0, 1)) - (bessel_J(1, 1) + bessel_J(0, 1))*bessel_Y(0, x)/(bessel_J(0, 1)*bessel_Y(1, 1) - bessel_J(1, 1)*bessel_Y(0, 1)) sage: f.subs(x=1).n() # numerical verification 1.00000000000000 sage: fp = f.diff(x) sage: fp.subs(x=1).n() 1.00000000000000 sage: f.subs(x=1).simplify_full() # symbolic verification 1 sage: fp = f.diff(x) sage: fp.subs(x=1).simplify_full() 1 sage: plot(f, (x,0,5)) Graphics object consisting of 1 graphics primitive
Plotting:
sage: f(x) = Bessel(0)(x); f x |--> bessel_J(0, x) sage: plot(f, (x, 1, 10)) Graphics object consisting of 1 graphics primitive sage: plot([ Bessel(i, 'J') for i in range(5) ], 2, 10) Graphics object consisting of 5 graphics primitives sage: G = Graphics() sage: G += sum([ plot(Bessel(i), 0, 4*pi, rgbcolor=hue(sin(pi*i/10))) for i in range(5) ]) sage: show(G)
A recreation of Abramowitz and Stegun Figure 9.1:
sage: G = plot(Bessel(0, 'J'), 0, 15, color='black') sage: G += plot(Bessel(0, 'Y'), 0, 15, color='black') sage: G += plot(Bessel(1, 'J'), 0, 15, color='black', linestyle='dotted') sage: G += plot(Bessel(1, 'Y'), 0, 15, color='black', linestyle='dotted') sage: show(G, ymin=-1, ymax=1)
- class sage.functions.bessel.Function_Bessel_I#
Bases:
BuiltinFunction
The Bessel I function, or the Modified Bessel Function of the First Kind.
DEFINITION:
\[I_\nu(x) = i^{-\nu} J_\nu(ix)\]EXAMPLES:
sage: bessel_I(1, x) bessel_I(1, x) sage: bessel_I(1.0, 1.0) 0.565159103992485 sage: n = var('n') sage: bessel_I(n, x) bessel_I(n, x) sage: bessel_I(2, I).n() -0.114903484931900
Examples of symbolic manipulation:
sage: a = bessel_I(pi, bessel_I(1, I)) sage: N(a, digits=20) 0.00026073272117205890524 - 0.0011528954889080572268*I sage: f = bessel_I(2, x) sage: f.diff(x) 1/2*bessel_I(3, x) + 1/2*bessel_I(1, x)
Special identities that bessel_I satisfies:
sage: bessel_I(1/2, x) sqrt(2)*sqrt(1/(pi*x))*sinh(x) sage: eq = bessel_I(1/2, x) == bessel_I(0.5, x) sage: eq.test_relation() True sage: bessel_I(-1/2, x) sqrt(2)*sqrt(1/(pi*x))*cosh(x) sage: eq = bessel_I(-1/2, x) == bessel_I(-0.5, x) sage: eq.test_relation() True
Examples of asymptotic behavior:
sage: limit(bessel_I(0, x), x=oo) +Infinity sage: limit(bessel_I(0, x), x=0) 1
High precision and complex valued inputs:
sage: bessel_I(0, 1).n(128) 1.2660658777520083355982446252147175376 sage: bessel_I(0, RealField(200)(1)) 1.2660658777520083355982446252147175376076703113549622068081 sage: bessel_I(0, ComplexField(200)(0.5+I)) 0.80644357583493619472428518415019222845373366024179916785502 + 0.22686958987911161141397453401487525043310874687430711021434*I
Visualization (set plot_points to a higher value to get more detail):
sage: plot(bessel_I(1,x), (x,0,5), color='blue') Graphics object consisting of 1 graphics primitive sage: complex_plot(bessel_I(1, x), (-5, 5), (-5, 5), plot_points=20) Graphics object consisting of 1 graphics primitive
ALGORITHM:
Numerical evaluation is handled by the mpmath library. Symbolics are handled by a combination of Maxima and Sage (Ginac/Pynac).
REFERENCES:
- class sage.functions.bessel.Function_Bessel_J#
Bases:
BuiltinFunction
The Bessel J Function, denoted by bessel_J(\(\nu\), x) or \(J_\nu(x)\). As a Taylor series about \(x=0\) it is equal to:
\[J_\nu(x) = \sum_{k=0}^\infty \frac{(-1)^k}{k! \Gamma(k+\nu+1)} \left(\frac{x}{2}\right)^{2k+\nu}\]The parameter \(\nu\) is called the order and may be any real or complex number; however, integer and half-integer values are most common. It is defined for all complex numbers \(x\) when \(\nu\) is an integer or greater than zero and it diverges as \(x \to 0\) for negative non-integer values of \(\nu\).
For integer orders \(\nu = n\) there is an integral representation:
\[J_n(x) = \frac{1}{\pi} \int_0^\pi \cos(n t - x \sin(t)) \; dt\]This function also arises as a special case of the hypergeometric function \({}_0F_1\):
\[J_\nu(x) = \frac{x^n}{2^\nu \Gamma(\nu + 1)} {}_0F_1\left(\nu + 1, -\frac{x^2}{4}\right).\]EXAMPLES:
sage: bessel_J(1.0, 1.0) 0.440050585744933 sage: bessel_J(2, I).n(digits=30) -0.135747669767038281182852569995 sage: bessel_J(1, x) bessel_J(1, x) sage: n = var('n') sage: bessel_J(n, x) bessel_J(n, x)
Examples of symbolic manipulation:
sage: a = bessel_J(pi, bessel_J(1, I)); a bessel_J(pi, bessel_J(1, I)) sage: N(a, digits=20) 0.00059023706363796717363 - 0.0026098820470081958110*I sage: f = bessel_J(2, x) sage: f.diff(x) -1/2*bessel_J(3, x) + 1/2*bessel_J(1, x)
Comparison to a well-known integral representation of \(J_1(1)\):
sage: A = numerical_integral(1/pi*cos(x - sin(x)), 0, pi) sage: A[0] # abs tol 1e-14 0.44005058574493355 sage: bessel_J(1.0, 1.0) - A[0] < 1e-15 True
Integration is supported directly and through Maxima:
sage: f = bessel_J(2, x) sage: f.integrate(x) 1/24*x^3*hypergeometric((3/2,), (5/2, 3), -1/4*x^2)
Visualization (set plot_points to a higher value to get more detail):
sage: plot(bessel_J(1,x), (x,0,5), color='blue') Graphics object consisting of 1 graphics primitive sage: complex_plot(bessel_J(1, x), (-5, 5), (-5, 5), plot_points=20) Graphics object consisting of 1 graphics primitive
ALGORITHM:
Numerical evaluation is handled by the mpmath library. Symbolics are handled by a combination of Maxima and Sage (Ginac/Pynac).
Check whether the return value is real whenever the argument is real (github issue #10251):
sage: bessel_J(5, 1.5) in RR True
REFERENCES:
- class sage.functions.bessel.Function_Bessel_K#
Bases:
BuiltinFunction
The Bessel K function, or the modified Bessel function of the second kind.
DEFINITION:
\[K_\nu(x) = \frac{\pi}{2} \frac{I_{-\nu}(x)-I_\nu(x)}{\sin(\nu \pi)}\]EXAMPLES:
sage: bessel_K(1, x) bessel_K(1, x) sage: bessel_K(1.0, 1.0) 0.601907230197235 sage: n = var('n') sage: bessel_K(n, x) bessel_K(n, x) sage: bessel_K(2, I).n() -2.59288617549120 + 0.180489972066962*I
Examples of symbolic manipulation:
sage: a = bessel_K(pi, bessel_K(1, I)); a bessel_K(pi, bessel_K(1, I)) sage: N(a, digits=20) 3.8507583115005220156 + 0.068528298579883425456*I sage: f = bessel_K(2, x) sage: f.diff(x) -1/2*bessel_K(3, x) - 1/2*bessel_K(1, x) sage: bessel_K(1/2, x) sqrt(1/2)*sqrt(pi)*e^(-x)/sqrt(x) sage: bessel_K(1/2, -1) -I*sqrt(1/2)*sqrt(pi)*e sage: bessel_K(1/2, 1) sqrt(1/2)*sqrt(pi)*e^(-1)
Examples of asymptotic behavior:
sage: bessel_K(0, 0.0) +infinity sage: limit(bessel_K(0, x), x=0) +Infinity sage: limit(bessel_K(0, x), x=oo) 0
High precision and complex valued inputs:
sage: bessel_K(0, 1).n(128) 0.42102443824070833333562737921260903614 sage: bessel_K(0, RealField(200)(1)) 0.42102443824070833333562737921260903613621974822666047229897 sage: bessel_K(0, ComplexField(200)(0.5+I)) 0.058365979093103864080375311643360048144715516692187818271179 - 0.67645499731334483535184142196073004335768129348518210260256*I
Visualization (set plot_points to a higher value to get more detail):
sage: plot(bessel_K(1,x), (x,0,5), color='blue') Graphics object consisting of 1 graphics primitive sage: complex_plot(bessel_K(1, x), (-5, 5), (-5, 5), plot_points=20) Graphics object consisting of 1 graphics primitive
ALGORITHM:
Numerical evaluation is handled by the mpmath library. Symbolics are handled by a combination of Maxima and Sage (Ginac/Pynac).
REFERENCES:
- class sage.functions.bessel.Function_Bessel_Y#
Bases:
BuiltinFunction
The Bessel Y functions, also known as the Bessel functions of the second kind, Weber functions, or Neumann functions.
\(Y_\nu(z)\) is a holomorphic function of \(z\) on the complex plane, cut along the negative real axis. It is singular at \(z = 0\). When \(z\) is fixed, \(Y_\nu(z)\) is an entire function of the order \(\nu\).
DEFINITION:
\[Y_n(z) = \frac{J_\nu(z) \cos(\nu z) - J_{-\nu}(z)}{\sin(\nu z)}\]Its derivative with respect to \(z\) is:
\[\frac{d}{dz} Y_n(z) = \frac{1}{z^n} \left(z^n Y_{n-1}(z) - n z^{n-1} Y_n(z) \right)\]EXAMPLES:
sage: bessel_Y(1, x) bessel_Y(1, x) sage: bessel_Y(1.0, 1.0) -0.781212821300289 sage: n = var('n') sage: bessel_Y(n, x) bessel_Y(n, x) sage: bessel_Y(2, I).n() 1.03440456978312 - 0.135747669767038*I sage: bessel_Y(0, 0).n() -infinity sage: bessel_Y(0, 1).n(128) 0.088256964215676957982926766023515162828
Examples of symbolic manipulation:
sage: a = bessel_Y(pi, bessel_Y(1, I)); a bessel_Y(pi, bessel_Y(1, I)) sage: N(a, digits=20) 4.2059146571791095708 + 21.307914215321993526*I sage: f = bessel_Y(2, x) sage: f.diff(x) -1/2*bessel_Y(3, x) + 1/2*bessel_Y(1, x)
High precision and complex valued inputs (see github issue #4230):
sage: bessel_Y(0, 1).n(128) 0.088256964215676957982926766023515162828 sage: bessel_Y(0, RealField(200)(1)) 0.088256964215676957982926766023515162827817523090675546711044 sage: bessel_Y(0, ComplexField(200)(0.5+I)) 0.077763160184438051408593468823822434235010300228009867784073 + 1.0142336049916069152644677682828326441579314239591288411739*I
Visualization (set plot_points to a higher value to get more detail):
sage: plot(bessel_Y(1,x), (x,0,5), color='blue') Graphics object consisting of 1 graphics primitive sage: complex_plot(bessel_Y(1, x), (-5, 5), (-5, 5), plot_points=20) Graphics object consisting of 1 graphics primitive
ALGORITHM:
Numerical evaluation is handled by the mpmath library. Symbolics are handled by a combination of Maxima and Sage (Ginac/Pynac).
REFERENCES:
- class sage.functions.bessel.Function_Hankel1#
Bases:
BuiltinFunction
The Hankel function of the first kind
DEFINITION:
\[H_\nu^{(1)}(z) = J_{\nu}(z) + iY_{\nu}(z)\]EXAMPLES:
sage: hankel1(3, x) hankel1(3, x) sage: hankel1(3, 4.) 0.430171473875622 - 0.182022115953485*I sage: latex(hankel1(3, x)) H_{3}^{(1)}\left(x\right) sage: hankel1(3., x).series(x == 2, 10).subs(x=3).n() # abs tol 1e-12 0.309062682819597 - 0.512591541605233*I sage: hankel1(3, 3.) 0.309062722255252 - 0.538541616105032*I
REFERENCES:
[AS-Bessel] see 9.1.6
- class sage.functions.bessel.Function_Hankel2#
Bases:
BuiltinFunction
The Hankel function of the second kind
DEFINITION:
\[H_\nu^{(2)}(z) = J_{\nu}(z) - iY_{\nu}(z)\]EXAMPLES:
sage: hankel2(3, x) hankel2(3, x) sage: hankel2(3, 4.) 0.430171473875622 + 0.182022115953485*I sage: latex(hankel2(3, x)) H_{3}^{(2)}\left(x\right) sage: hankel2(3., x).series(x == 2, 10).subs(x=3).n() # abs tol 1e-12 0.309062682819597 + 0.512591541605234*I sage: hankel2(3, 3.) 0.309062722255252 + 0.538541616105032*I
REFERENCES:
[AS-Bessel] see 9.1.6
- class sage.functions.bessel.Function_Struve_H#
Bases:
BuiltinFunction
The Struve functions, solutions to the non-homogeneous Bessel differential equation:
\[x^2\frac{d^2y}{dx^2}+x\frac{dy}{dx}+(x^2-\alpha^2)y=\frac{4\bigl(\frac{x}{2}\bigr)^{\alpha+1}}{\sqrt\pi\Gamma(\alpha+\tfrac12)},\]\[\mathrm{H}_\alpha(x) = y(x)\]EXAMPLES:
sage: struve_H(-1/2,x) sqrt(2)*sqrt(1/(pi*x))*sin(x) sage: struve_H(2,x) struve_H(2, x) sage: struve_H(1/2,pi).n() 0.900316316157106
REFERENCES:
- class sage.functions.bessel.Function_Struve_L#
Bases:
BuiltinFunction
The modified Struve functions.
\[\mathrm{L}_\alpha(x) = -i\cdot e^{-\frac{i\alpha\pi}{2}}\cdot\mathrm{H}_\alpha(ix)\]EXAMPLES:
sage: struve_L(2,x) struve_L(2, x) sage: struve_L(1/2,pi).n() 4.76805417696286 sage: diff(struve_L(1,x),x) 1/3*x/pi - 1/2*struve_L(2, x) + 1/2*struve_L(0, x)
REFERENCES:
- class sage.functions.bessel.SphericalBesselJ#
Bases:
BuiltinFunction
The spherical Bessel function of the first kind
DEFINITION:
\[j_n(z) = \sqrt{\frac{\pi}{2z}} \,J_{n + \frac{1}{2}}(z)\]EXAMPLES:
sage: spherical_bessel_J(3, x) spherical_bessel_J(3, x) sage: spherical_bessel_J(3 + 0.2 * I, 3) 0.150770999183897 - 0.0260662466510632*I sage: spherical_bessel_J(3, x).series(x == 2, 10).subs(x=3).n() 0.152051648665037 sage: spherical_bessel_J(3, 3.) 0.152051662030533 sage: spherical_bessel_J(2.,3.) # rel tol 1e-10 0.2986374970757335 sage: spherical_bessel_J(4, x).simplify() -((45/x^2 - 105/x^4 - 1)*sin(x) + 5*(21/x^2 - 2)*cos(x)/x)/x sage: integrate(spherical_bessel_J(1,x)^2,(x,0,oo)) 1/6*pi sage: latex(spherical_bessel_J(4, x)) j_{4}\left(x\right)
REFERENCES:
- class sage.functions.bessel.SphericalBesselY#
Bases:
BuiltinFunction
The spherical Bessel function of the second kind
DEFINITION:
\[y_n(z) = \sqrt{\frac{\pi}{2z}} \,Y_{n + \frac{1}{2}}(z)\]EXAMPLES:
sage: spherical_bessel_Y(3, x) spherical_bessel_Y(3, x) sage: spherical_bessel_Y(3 + 0.2 * I, 3) -0.505215297588210 - 0.0508835883281404*I sage: spherical_bessel_Y(-3, x).simplify() ((3/x^2 - 1)*sin(x) - 3*cos(x)/x)/x sage: spherical_bessel_Y(3 + 2 * I, 5 - 0.2 * I) -0.270205813266440 - 0.615994702714957*I sage: integrate(spherical_bessel_Y(0, x), x) -1/2*Ei(I*x) - 1/2*Ei(-I*x) sage: integrate(spherical_bessel_Y(1,x)^2,(x,0,oo)) -1/6*pi sage: latex(spherical_bessel_Y(0, x)) y_{0}\left(x\right)
REFERENCES:
- class sage.functions.bessel.SphericalHankel1#
Bases:
BuiltinFunction
The spherical Hankel function of the first kind
DEFINITION:
\[h_n^{(1)}(z) = \sqrt{\frac{\pi}{2z}} \,H_{n + \frac{1}{2}}^{(1)}(z)\]EXAMPLES:
sage: spherical_hankel1(3, x) spherical_hankel1(3, x) sage: spherical_hankel1(3 + 0.2 * I, 3) 0.201654587512037 - 0.531281544239273*I sage: spherical_hankel1(1, x).simplify() -(x + I)*e^(I*x)/x^2 sage: spherical_hankel1(3 + 2 * I, 5 - 0.2 * I) 1.25375216869913 - 0.518011435921789*I sage: integrate(spherical_hankel1(3, x), x) Ei(I*x) - 6*gamma(-1, -I*x) - 15*gamma(-2, -I*x) - 15*gamma(-3, -I*x) sage: latex(spherical_hankel1(3, x)) h_{3}^{(1)}\left(x\right)
REFERENCES:
- class sage.functions.bessel.SphericalHankel2#
Bases:
BuiltinFunction
The spherical Hankel function of the second kind
DEFINITION:
\[h_n^{(2)}(z) = \sqrt{\frac{\pi}{2z}} \,H_{n + \frac{1}{2}}^{(2)}(z)\]EXAMPLES:
sage: spherical_hankel2(3, x) spherical_hankel2(3, x) sage: spherical_hankel2(3 + 0.2 * I, 3) 0.0998874108557565 + 0.479149050937147*I sage: spherical_hankel2(1, x).simplify() -(x - I)*e^(-I*x)/x^2 sage: spherical_hankel2(2,i).simplify() -e sage: spherical_hankel2(2,x).simplify() (-I*x^2 - 3*x + 3*I)*e^(-I*x)/x^3 sage: spherical_hankel2(3 + 2*I, 5 - 0.2*I) 0.0217627632692163 + 0.0224001906110906*I sage: integrate(spherical_hankel2(3, x), x) Ei(-I*x) - 6*gamma(-1, I*x) - 15*gamma(-2, I*x) - 15*gamma(-3, I*x) sage: latex(spherical_hankel2(3, x)) h_{3}^{(2)}\left(x\right)
REFERENCES:
- sage.functions.bessel.spherical_bessel_f(F, n, z)#
Numerically evaluate the spherical version, \(f\), of the Bessel function \(F\) by computing \(f_n(z) = \sqrt{\frac{1}{2}\pi/z} F_{n + \frac{1}{2}}(z)\). According to Abramowitz & Stegun, this identity holds for the Bessel functions \(J\), \(Y\), \(K\), \(I\), \(H^{(1)}\), and \(H^{(2)}\).
EXAMPLES:
sage: from sage.functions.bessel import spherical_bessel_f sage: spherical_bessel_f('besselj', 3, 4) mpf('0.22924385795503024') sage: spherical_bessel_f('hankel1', 3, 4) mpc(real='0.22924385795503024', imag='-0.21864196590306359')


Hello there, awesome person!
i am sawri
computer
semsung
hp
This is a link to GitHub!
tablet
dell
semsung
hp
mobile
dell
semsung
hp


1 Samuel 11:12
And the people said unto Samuel, Who is he that said, Shall Saul reign over us? bring the men, that we may put them to death.


-
pragmatics esl lesson plans
Great Library: Canadian Legislation Online
Annotated links to selected sources of Canadian legislation available on the Internet. . Justice Laws; Revised Statutes; Canada Gazette; Parliament of Canada . Newfoundland and Labrador; Northwest Territories; Nova Scotia; Nunavut .
http://rc.lsuc.on.ca/library/research_law_ca_legis.htm
-
repairing steering pump seals
Constitution Acts, 1867 to 1982 - Lois du Canada - Justice
Powers of the Parliament. Marginal note:Legislative Authority of Parliament of Canada. 91. . Uniformity of Laws in Ontario, Nova Scotia, and New Brunswick .
http://laws-lois.justice.gc.ca/eng/Const/page-4.html
-
mr crowley keyboard tab
Human Rights Act - The Nova Scotia Legislature
(b) "Commission" means the Nova Scotia Human Rights Commission; . public body or officer empowered by an Act of the Parliament of Canada with respect .
http://nslegislature.ca/legc/statutes/humanrt.htm
-
humphrey advanced guestbook 2.3.1
History of Nova Scotia: The Road To Being Canada (Book 3 ...
(There is an important point to be made: The representatives of Nova Scotia, New . And so an act of the British Parliament was passed in order "to protect the .
http://www.blupete.com/Hist/NovaScotiaBk3/Ch47.htm
-
traditional houses in mexico
British North America Act 1867
An act for the Union of Canada, Nova Scotia, and New Brunswick, and the . Continuance of existing election laws until Parliament of Canada otherwise .
http://www.legislation.gov.uk/ukpga/Vict/30-31/3/contents
-
chemistry labs easy experiment
Constitution Act 1867 - The Canadian Encyclopedia
The Constitution Act of 1867, originally the BRITISH NORTH AMERICA ACT , a . Nova Scotia and New Brunswick into a federal state with a parliamentary .
http://www.thecanadianencyclopedia.com/articles/constitution-act-1867
-
on stage speaker stands
Nova Scotia: The Cradle of Canadian Parliamentary Democracy ...
Nova Scotia: The Cradle of Canadian Parliamentary Democracy. Two hundred and fifty years ago, on October 2, 1758, Nova Scotia's first legislative assembly .
http://www.thecanadianencyclopedia.com/featured/nova-scotia-the-cradle-of-canadian-parliamentary-democracy
-
entering exhibits into evidence in texas
Bill 57, Constitution Day Act, 2012 - the Legislative Assembly of ...
Mar 29, 2012 . The British North America Act, 1867 later patriated as the . united the modern- day provinces of Ontario, Quebec, Nova Scotia and New Brunswick. . the system of Canadian federalism, the houses of Parliament of Canada, .
http://www.ontla.on.ca/web/bills/bills_detail.do?locale=en&Intranet=&BillID=2602
-
2001 nissan pathfinder mil
Introduction - UBC Faculty of Law
Act of Parliament etc. to extend to colony when made applicable to such colony . Six Months after the passing of this Act, the Provinces of Canada, Nova Scotia, .
http://faculty.law.ubc.ca/myoung/constitution/docs/Presentation%20introductory%20lecture.pptm
-
could ghosts cause global warming
Government Legislation - Canadian Payday Loan Association ...
News, Reports, Gov't Legislation . Parliament of Canada, Ontario. British Columbia, New Brunswick. Alberta, Nova Scotia. Saskatchewan, Prince Edward Island .
http://www.cpla-acps.ca/english/medialegislation.php
-
rocket dogs shoe brand
British North America Act 1867 Document - The Canadian ...
An Act for the Union of Canada, Nova Scotia, and New Brunswick, and the Government . There shall be One Parliament for Canada, consisting of the Queen, .
http://www.thecanadianencyclopedia.com/articles/british-north-america-act-1867-document
-
midas jobs in north carolina
Canada as constituted - Constitution Society
WHEREAS the Provinces of Canada, Nova Scotia and New Brunswick have . All Powers, Authorities and Functions which under any Act of the Parliament of .
http://www.constitution.org/cons/canada.txt
-
new bungalows in kitchener waterloo
Canada in the Making - Constitutional History
Photograph: Centre Block, Parliament Buildings under construction, 1865 - NAC/ ANC . With the passing of the British North America Act in 1867, Canada became a . A Proclamation for Uniting the Province of Canada, Nova Scotia and New .
http://www.canadiana.ca/citm/themes/constitution/constitution13_e.html
-
pragmatics esl lesson plans
Canada - Nova Scotia province | legal-laws info | law courts - legal ...
Senate, House of Commons & Library of Parliament; Supreme Court of Canada · Department of . Nova Scotia Government Legislation: Statutes & Regulations .
http://www.canadalegal.info/prov-novascotia/index.html
-
fidelity home loan corp
Part 1 - British North America Act, 1867 - Enactment no. 1
An Act for the Union of Canada, Nova Scotia, and New Brunswick, and the . And whereas on the Establishment of the Union by Authority of Parliament it is .
http://canada.justice.gc.ca/eng/pi/const/lawreg-loireg/p1t11.html
-
native insights essay competion
How law is made - Legal Information Society of Nova Scotia
Nova Scotians are subject to laws set out in legislation and case law. Legislation: 1. The Statutes of Canada, which are laws passed by the Canadian Parliament .
http://www.legalinfo.org/legal-help-the-legal-system/how-law-is-made.html
-
top science fiction writers
History of Nova Scotia; Book.2; Part 2; Ch. 6., Acts of Parliament ...
It should be remembered that the colonists were not the only British subjects suffering from taxes. Before the war Britain's national debt had stood at 60 million £s .
http://www.blupete.com/Hist/NovaScotiaBk2/Part2/Ch06.htm
-
vacuum cleaners salt lake city
The Canadian Constitution - Canada's system of Justice
Aug 3, 2012 . Canada, in contrast, became a country by an act of the Parliament of . the British colonies of Upper and Lower Canada, Nova Scotia, and New .
http://www.justice.gc.ca/eng/dept-min/pub/just/05.html
-
govenor scholar for the arts ky
Part 3 - British North America Act, 1867 - Enactment no. 1
55 of the Constitution Act, 1982 and has never been superseded by any other report . in this Act) the exclusive Legislative Authority of the Parliament of Canada extends to all . Uniformity of Laws in Ontario, Nova Scotia, and New Brunswick.
http://canada.justice.gc.ca/eng/pi/const/lawreg-loireg/p1t13.html
-
south beach diet wieght loss
Confederation | Our Country, Our Parliament
Once passed, it became known as the British North America Act, or the BNA Act. This Act brought together the three provinces of Nova Scotia, New Brunswick .
http://www.parl.gc.ca/About/Parliament/Education/OurCountryOurParliament/html_booklet/confederation-e.html


LeadsList
The LeadsList class can be instanciated only from the main class it's intended for internal use only and is not exported from the package
Constructor Summary
| Public Constructor | ||
| public |
|
Member Summary
| Public Members | ||
| public |
parent: * |
Method Summary
| Public Methods | ||
| public |
Creates a new leads list. |
|
| public |
Deletes an existing leads list. |
|
| public |
Returns all the leads lists already saved in your account. |
|
| public |
Retrieves all the fields of a leads list. |
|
| public |
Updates an existing leads list. |
Public Constructors
public constructor() source
Public Members
public parent: * source
Public Methods
public create(options: Object, callback: Function): * source
Creates a new leads list. The parameters must be passed as a JSON hash.
Return:
| * |
Example:
hunter.leadsList.create({
name: 'New leads list'
}, (err, res) => {
console.log(res);
})
public delete(id: number, callback: Function): * source
Deletes an existing leads list.
Return:
| * |
Example:
hunter.leadsList.delete(1, (err, res) => {
console.log(res);
})
public list(options: object, callback: Function): * source
Returns all the leads lists already saved in your account. The leads lists are returned in sorted order, with the most recent leads lists appearing first.
Return:
| * |
Example:
hunter.leadsList.list({
offset: 0,
limit: 20
}, (err, res) => {
console.log(res);
})
public retrieve(id: number, callback: Function): * source
Retrieves all the fields of a leads list.
Return:
| * |
Example:
hunter.leadsList.retrieve(1, (err, res) => {
console.log(res);
})


Constructing a Tully-Fisher relation from galaxies observed by the SAMI survey.
$$\frac{GMm}{r^2} = \frac{mv^2}{r}$$
$$\frac{G(M/L)L}{r} = v^2$$
$$\frac{G(M/L)L}{v^2} = r$$
$$I = \frac{L}{2\pi r^2}$$
$$\textrm{where L is the intrinsic luminosity of the galaxy,}$$
$$\textrm{r is the radius of the galaxy and}$$
$$\textrm{I is it's surface brightness.}$$
$$r = \{\frac{L}{2\pi I}\}^{1/2}$$
$$\textrm{substituting for r, we get}$$
$$\frac{G(M/L)L}{v^2} = \{\frac{L}{2\pi I}\}^{1/2}$$
$$\{G\frac{M}{L}\}^2 2\pi I L^2 = L v^4$$
$$kL \propto v^4$$
$$\textrm{where}$$
$$k = \{G\frac{M}{L}\}^2 2\pi I$$
Here we assume that I, the surface brightness of galaxies is constant for all type of galaxies and that the M/L ratio is also constant. In reality, the presence of low surface brightness galaxies and high surface brightness galaxies increases scatter in the Tully-Fisher relationship.
A major part of the ARIES training school is data analysis and as part of a team of 5, I was studying the polarization of light from a star forming region Stock 8 in the constellation Auriga. The data was collected using the ARIES Imaging Polarimeter instrument (AImPol) at the ARIES 1.04m telescope.
We measured the stokes parameters of multiple stars and estimated the overall polarization of light. We estimated the density of dust in the star forming region using the polarization and using standard stars. We also differentiated between field stars and foreground stars by studying the amount of polarization.


Event Handling
Blur:
Focus:
Click
double click
keydown
keyup
rose
lily
Jasmine
lotus
load
unload
Name:
select
mouse over
mouse out


Collection
IteratorCollection of Pages.
Traits
Properties
| array | $items | array$items | from ArrayAccess |
Methods
Constructor to initialize array.
Returns the value at specified offset.
Magic method to determine if the attribute is set
Returns current page.
Returns current slug.
This method is called after Iterator::rewind() and Iterator::next() to check if the current position is valid.
Convert function calls for the existing keys into their values.
Remove item from the list.
Sorts elements from the list and returns a copy of the list in the proper order
No description
Create a copy of this collection
Set parameters to the Collection
Reorder collection.
Check to see if this item is the first in the collection.
Check to see if this item is the last in the collection.
Gets the previous sibling based on current position.
Gets the next sibling based on current position.
Returns the adjacent sibling based on a direction.
Returns the item in the current position.
Returns the items between a set of date ranges of either the page date field (default) or an arbitrary datetime page field where end date is optional Dates can be passed in as text that strtotime() can process http://php.net/manual/en/function.strtotime.php
Creates new collection with only visible pages
Creates new collection with only non-visible pages
Creates new collection with only modular pages
Creates new collection with only non-modular pages
Creates new collection with only published pages
Creates new collection with only non-published pages
Creates new collection with only routable pages
Creates new collection with only non-routable pages
Creates new collection with only pages of the specified type
Creates new collection with only pages of one of the specified types
Creates new collection with only pages of one of the specified access levels
Details
at line 26
__construct(
array $items = array(),
array $params = array(),
Pages $pages = null)
Constructor to initialize array.
in
ArrayAccess at line 21
bool
offsetExists(
mixed $offset)
Whether or not an offset exists.
at line 102
mixed
offsetGet(
mixed $offset)
Returns the value at specified offset.
in
ArrayAccess at line 43
offsetSet(
mixed $offset,
mixed $value)
Assigns a value to the specified offset.
in
ArrayAccess at line 57
offsetUnset(
mixed $offset)
Unsets an offset.
in
ArrayAccessWithGetters at line 21
__set(
mixed $offset,
mixed $value)
Magic setter method
in
ArrayAccessWithGetters at line 32
mixed
__get(
mixed $offset)
Magic getter method
in
ArrayAccessWithGetters at line 43
boolean
__isset(
mixed $offset)
Magic method to determine if the attribute is set
in
ArrayAccessWithGetters at line 53
__unset(
mixed $offset)
Magic method to unset the attribute
at line 79
mixed
current()
Returns current page.
at line 90
mixed
key()
Returns current slug.
in
Iterator at line 47
void
next()
Moves the current position to the next element.
in
Iterator at line 62
void
rewind()
Rewinds back to the first element of the Iterator.
in
Iterator at line 73
bool
valid()
This method is called after Iterator::rewind() and Iterator::next() to check if the current position is valid.
in
Countable at line 20
int
count()
Implements Countable interface.
in
Serializable at line 20
string
serialize()
Returns string representation of the object.
in
Serializable at line 30
unserialize(
string $serialized)
Called during unserialization of the object.
in
Export at line 23
array
toArray()
Convert object into an array.
in
Export at line 37
string
toYaml(
int $inline = 3,
int $indent = 2)
Convert object into YAML string.
in
Export at line 47
string
toJson()
Convert object into JSON string.
in
Iterator at line 31
mixed
__call(
string $key,
mixed $args)
Convert function calls for the existing keys into their values.
in
Iterator at line 39
__clone()
Clone the iterator.
in
Iterator at line 53
string
__toString()
Convents iterator to a comma separated list.
at line 114
remove($key = null)
Remove item from the list.
in
Iterator at line 73
mixed
prev()
Return previous item.
in
Iterator at line 84
mixed|bool
nth(
int $key)
Return nth item.
in
Iterator at line 95
mixed
first()
Get the first item
in
Iterator at line 106
mixed
last()
Get the last item
in
Iterator at line 117
$this
reverse()
Reverse the Iterator
in
Iterator at line 127
string|bool
indexOf(
mixed $needle)
in
Iterator at line 142
$this
shuffle()
Shuffle items.
in
Iterator at line 164
$this
slice(
int $offset,
int $length = null)
Slice the list.
in
Iterator at line 177
$this
random(
int $num = 1)
Pick one or more random entries.
in
Iterator at line 205
$this
filter(
callable $callback = null)
Filter elements from the list
in
Iterator at line 231
$this|array
sort(
callable $callback = null,
bool $desc = false)
Sorts elements from the list and returns a copy of the list in the proper order
at line 34
params()
at line 45
$this
addPage(
Page $page)
Add a single page to a collection
at line 57
Collection
copy()
Create a copy of this collection
at line 68
$this
setParams(
array $params)
Set parameters to the Collection
at line 137
$this
order(
string $by,
string $dir = 'asc',
array $manual = null)
Reorder collection.
at line 150
boolean
isFirst(
string $path)
Check to see if this item is the first in the collection.
at line 165
boolean
isLast(
string $path)
Check to see if this item is the last in the collection.
at line 180
Page
prevSibling(
string $path)
Gets the previous sibling based on current position.
at line 191
Page
nextSibling(
string $path)
Gets the next sibling based on current position.
at line 203
Page
adjacentSibling(
string $path,
integer $direction = 1)
Returns the adjacent sibling based on a direction.
at line 223
Page
currentPosition(
string $path)
Returns the item in the current position.
at line 241
$this
dateRange($startDate,
bool $endDate = false, $field = false)
Returns the items between a set of date ranges of either the page date field (default) or an arbitrary datetime page field where end date is optional Dates can be passed in as text that strtotime() can process http://php.net/manual/en/function.strtotime.php
at line 267
Collection
visible()
Creates new collection with only visible pages
at line 286
Collection
nonVisible()
Creates new collection with only non-visible pages
at line 305
Collection
modular()
Creates new collection with only modular pages
at line 324
Collection
nonModular()
Creates new collection with only non-modular pages
at line 343
Collection
published()
Creates new collection with only published pages
at line 362
Collection
nonPublished()
Creates new collection with only non-published pages
at line 381
Collection
routable()
Creates new collection with only routable pages
at line 402
Collection
nonRoutable()
Creates new collection with only non-routable pages
at line 421
Collection
ofType($type)
Creates new collection with only pages of the specified type
at line 441
Collection
ofOneOfTheseTypes($types)
Creates new collection with only pages of one of the specified types
at line 461
Collection
ofOneOfTheseAccessLevels($accessLevels)
Creates new collection with only pages of one of the specified access levels


Where Are The Bikes?
This application allows you to check at a glance the current state of a complete bike sharing system in a map.
Let's start by choosing a city:
Loading...
And a representation:
Bike availability
Slot availability
Station opening
Bonus stations
Banking station
Bikes:
Slots:
Loading...


--- title: Blog Archive permalink: "/blog-archive/" ---
{{ post.title }} {{ post.date | date_to_string }}


Hello, CS50!
Home
About
Demo 1
Demo 2
This app will tell you where you are. Click the button below to get your coordinates.
Locate!


| Created: | 4/29/2013 12:00:00 AM |
| Modified: | 4/30/2013 3:39:13 PM |
| Project: | |
| Advanced: |
| Attribute | ||
|
Public Identifier. Type UBLVersionID |
||
Details:
|
||
|
Public Identifier. Type CustomizationID |
||
Details:
|
||
|
Public Identifier. Type ProfileID |
||
Details:
|
||
|
Public Identifier. Type ProfileExecutionID |
||
Details:
|
||
|
Public Identifier. Type ID |
||
Details:
|
||
|
Public Indicator. Type CopyIndicator |
||
Details:
|
||
|
Public Identifier. Type UUID |
||
Details:
|
||
|
Public Identifier. Type ContractFolderID |
||
Details:
|
||
|
Public Date. Type IssueDate |
||
Details:
|
||
|
Public Time. Type IssueTime |
||
Details:
|
||
|
Public Text. Type Note |
||
Details:
|
||
|
Public Text. Type RegulatoryDomain |
||
Details:
|
||
|
Public Indicator. Type PublishAwardIndicator |
||
Details:
|
| Element | Source Role | Target Role |
|
«ABIE» Contracting Party Class |
Name: |
Name: |
|
Details:
The contracting party.
|
||
|
«ABIE» Customer Party Class |
Name: |
Name: Originator Customer Party |
|
Details:
The party who originated Order.
|
||
|
«ABIE» Document Reference Class |
Name: |
Name: Previous Document Reference |
|
Details:
A reference to a previously sent document.
|
||
|
«ABIE» Document Reference Class |
Name: |
Name: Minutes Document Reference |
|
Details:
A reference to a set of minutes.
|
||
|
«ABIE» Party Class |
Name: |
Name: Receiver Party |
|
Details:
The party receiving this document.
|
||
|
«ABIE» Procurement Project Class |
Name: |
Name: |
|
Details:
An overall definition of this procurement project.
|
||
|
«ABIE» Procurement Project Lot Class |
Name: |
Name: |
|
Details:
One of the procurement project lots into which this contract can be split.
|
||
|
«ABIE» Signature Class |
Name: |
Name: |
|
Details:
A signature applied to this document.
|
||
|
«ABIE» Tender Result Class |
Name: |
Name: |
|
Details:
A result of the bid opening in the tendering process.
|
||
|
«ABIE» Tendering Process Class |
Name: |
Name: |
|
Details:
A description of the tendering process itself.
|
||
|
«ABIE» Tendering Terms Class |
Name: |
Name: |
|
Details:
The tendering terms associated with this tendering process.
|


#IMPORTS
from IPython import display
import numpy as np
import matplotlib.pyplot as plt
from scipy import misc
from sklearn.cluster import KMeans
from sklearn.metrics import pairwise_distances_argmin
from sklearn.datasets import load_sample_image
from sklearn.utils import shuffle
from time import time
from PIL import Image
import six
from io import StringIO
In computer graphics, color quantization or color image quantization is a process that reduces the number of distinct colors used in an image, usually with the intention that the new image should be as visually similar as possible to the original image.
An example image in 24-bit RGB color The same image reduced to a palette of 16-bit colors
image_name="img1.jpg"
display.HTML(''.format("http://eskipaper.com/images/landscape-wallpaper-hd-40.jpg")) #To display the image
#To load the image as an numpy array
image = misc.imread(image_name)
print(image)
print(image.shape)
# Seperating width height and no. of channels
w, h, d = original_shape = tuple(image.shape)
print("Widht:",w)
print("Height:",h)
print("Channels/Dimension:",d)
print("Each channel for RGB and Range is [0 -255]")
print("If each channel required 1 byte of space which means 3 bytes for each pixel")
print("\nThen for whole image it will require {} x {} x {} = {} bytes".format(w,h,d,w*h*d))
print("Which comes around {} Mb".format((w*h*d)/(10000000)))
display.HTML(''.format("http://konukoii.com/blog/wp-content/uploads/2017/01/RunyanKmeans.gif"))
Given k , the Llyod algorithm works as follows:
n_colors = 64 #Value of k
# Convert to floats instead of the default 8 bits integer coding. Dividing by 255 is important so that
# plt.imshow behaves works well on float data (need to be in the range [0-1])
image = np.array(image, dtype=np.float64) / 255
# # Load Image and transform to a 2D numpy array.
# w, h, d = original_shape = tuple(image.shape)
# print(w,h,d)
assert d == 3 #The code forward runs for 3 channel only
Earlier we had each pixel as list inside row and each row was stored as list in bigger list. Converting such that we have just each list of pixel inside a list
image_array = np.reshape(image, (w * h, d))
print(image_array)
print(image_array.shape)
%%javascript
//To make the output area non-scrollable
IPython.OutputArea.prototype._should_scroll = function(lines) {
return false;
}
print("Fitting model on a small sub-sample of the data")
t0 = time() #has time in seconds since epoch(1970)
#Take only 2000 random points to train our k-means
image_array_sample = shuffle(image_array, random_state=0)[:2000]
#Using k-means to create k(64) clusters
#Cluster of close RGB colour are grouped together and labeled using their centroid(geometric mean)
kmeans = KMeans(n_clusters=n_colors, random_state=0)
knnsample = kmeans.fit(image_array_sample)
#total seconds taken for fitting
print("done in %0.3fs." % (time() - t0))
# print("Sample Array size:",image_array_sample.shape)
print("\nK means Labels:\n",kmeans.labels_)
print("\nCluster Centers/ Centroids:\n",kmeans.cluster_centers_[:5])
# Get labels for all points
print("Predicting color indices on the full image (k-means)")
t0 = time()
labels = kmeans.predict(image_array)
print("done in %0.3fs." % (time() - t0))
print("Predicted Labels:",labels)
#Taking random 64 points from top 1000 array elements
codebook_random = shuffle(image_array[:1000], random_state=0)[:n_colors + 1]
print(codebook_random[:5])
print("Predicting color indices on the full image (random)")
t0 = time()
labels_random = pairwise_distances_argmin(codebook_random,image_array,axis=0)
print("done in %0.3fs." % (time() - t0))
print(labels_random)
#Taking random 64 points from top 1000 array elements
codebook_random2 = shuffle(image_array, random_state=0)[:n_colors + 1]
print(codebook_random2[:5])
print("Predicting color indices on the full image (random)")
t0 = time()
labels_random2 = pairwise_distances_argmin(codebook_random2,image_array,axis=0)
print("done in %0.3fs." % (time() - t0))
print(labels_random2)
def recreate_image(codebook, labels, w, h):
"""Recreate the (compressed) image from the code book & labels"""
d = codebook.shape[1]
image = np.zeros((w, h, d))
label_idx = 0
#For each pixel setting the color of its nearest cluster mean
for i in range(w):
for j in range(h):
image[i][j] = codebook[labels[label_idx]]
label_idx += 1
return image
# Displaying original image
plt.figure(1)
plt.clf()
ax = plt.axes([0, 0, 1, 1])
plt.axis('off')
s= "Original image ("+(str)(w*h*d)+" colors)"
plt.title(s)
plt.imshow(image)
#Displaying Image using k-means with 64 colors
plt.figure(2)
plt.clf()
ax = plt.axes([0, 0, 1, 1])
plt.axis('off')
plt.title('Quantized image (64 colors, K-Means)')
plt.imshow(recreate_image(kmeans.cluster_centers_, labels, w, h))
#Displaying Image using Random Algorithm top 1000 elements
plt.figure(3)
plt.clf()
ax = plt.axes([0, 0, 1, 1])
plt.axis('off')
plt.title('Quantized image (64 colors, Random[top 1000 elements])')
plt.imshow(recreate_image(codebook_random, labels_random, w, h))
#Displaying Image using Random Algorithm whole array
plt.figure(4)
plt.clf()
ax = plt.axes([0, 0, 1, 1])
plt.axis('off')
plt.title('Quantized image (64 colors, Random)')
plt.imshow(recreate_image(codebook_random2, labels_random2, w, h))
plt.show()


{% extends "sqlshare_web/base.html" %} {% block title %}SQLSHARE: Permission Denied{% endblock %} {% block content %}
You don't have permission to view this dataset.


Work
&
Life
Life Balancing and Work Simplifaction Platform
Work
&
Life
Log Out Successful
Thanks for using Work&Life
Log In Again


CrimPapers
Articles published on 28 August 2019
On 28 August 2019, 9 new articles were published in 8 journals.
The Commemoration of Death, Organizational Memory, and Police Culture by Michael Sierra‐arévalo
Introduction: Queer(y)ing Justice by Matthew Ball, Trudie Broderick, Justin Ellis, Angela Dwyer, Nicole L. Asquith
Renegotiating Police Legitimacy Through Amateur Video and Social Media: Lessons From the Police Excessive Force At the 2013 Sydney Gay and Lesbian Mardi Gras Parade by Justin Ellis
Do Prostitution Advertisements Reduce Violence Against Women? A Methodological Examination of Cunningham, Deangelo, and Tripp Findings
Adolescent Reproductive and Sexual Coercion: Measurement Invariance in A Population-Based Sample of Male and Female High School Students
Americans’ Views of Efficacy Toward Campus Sexual Assault Reform by Christina Mancini, Kristen M. Budd
Exploring the Impact of Retirement on Police Officers Wellbeing by Christine Carney, Lyndel Bates, Elise Sargeant
Book Review: Anastasia Chamberlen, Embodying Punishment: Emotions, Identities, and Lived Experiences in Women’s Prisons by Diana Miranda
Women’s Risk and Needs Assessment (wrna) in the Czech Republic by Tereza Trejbalová, Emily J. Salisbury


My Team
Steve
Manager
Employee ID: 1
Email:
<EMAIL_ADDRESS>Office#: 1
Billy
Engineer
Employee ID: 2
Email:
<EMAIL_ADDRESS>Github:
billybob
Jeff
Intern
Employee ID: 3
Email:
<EMAIL_ADDRESS>School: U of M


Elusive eDetailer
The Elusive eDetailer is an HTML5/Javascript Framework for rapid development of eDetail presentations. The framework provides tools and methods for loading and navigating slides, altering navigation paths, displaying lightbox/overlay content, and generating navigational elements.
Latest Version: 0.00.001
Author: Roger Soucy
Copyright: (c) 2014 Elusive Concepts, LLC
Obtaining the Framework
Source Files
The source files may be downloaded in either a ZIP archive of the latest stable version, or accessed directly from the GitHub repository.
Stable Package: Framework v0.0 GitHub Repository: https://github.com/ElusiveConcepts/eDetailer
Installation and Usage
[coming soon]
Allowing File Access Locally
Because the framework relies on AJAX to load pages, if you attempt to load the framework locally, most browsers will give you an error and fail to load the framework.
To correct this, you can enable local file access on Google Chrome with the
following command line switches:
--allow-file-access-from-files
--disable-web-security
To open Chrome on a Mac with these switches, use the following terminal command:
open /Applications/Google\ Chrome.app --args --allow-file-access-from-files --disable-web-security
Framework File and Folder Structure
- index.html
- css/framework.css
- css/uiskin.css
- css/pages.css
- js/framework.js
- js/framework.min.js
- js/pages.js
- images/
index.html
[coming soon]
framework.js
[coming soon]
framework.css
[coming soon]
For More Information
[coming soon]
License
This content is copyright (c) 2013-2014 Roger Soucy.
The eDetail Presentation Framework is free software, licensed under the MIT License.
See the file LICENSE
in this distribution for more details.


Highly experienced team player with 15 years of support background before taking the plunge into the world of Web Development. In my current role as a Web Developer I am responsible for...
When not online, I can be found spending time with my wife and our beautiful daughter.
Click image for more info
Here is some more information about this product that is only revealed once clicked on.
Click image for more info
Here is some more information about this product that is only revealed once clicked on.
Click image for more info
Here is some more information about this product that is only revealed once clicked on.
Click image for more info
Here is some more information about this product that is only revealed once clicked on.


Object Oriented Programming is for primarily adding new data to existing methods
Functional Programming is for primarily adding new ways to manipulate more seldom changing data
Contrast of the two shows that of course a balance of the two is usually what emerges from a project's requirements. But again, primarily seems to be the key word, so whichever style benefits the project more greatly is more likely to be the overall approach taken.


Preparation time
less than 30 mins
Cooking time
less than 10 mins
Serves
Serves 1
Heat the vegetable oil in a wok until very hot. Season the sliced beef with the Chinese five-spice powder, salt and freshly ground black pepper. Add the beef to the hot wok and fry over a very high heat for 30 seconds.
Add the sliced pepper, spring onions and ginger and fry for 1-2 minutes. Add the soy sauce and sesame oil and stir to coat. Add a splash of boiling water, stir well and spoon into a serving bowl.
To serve, garnish with toasted sesame seeds, coriander and chopped chives.


A database needs to do two things When we are given the data, we should store the data and when asked for the data, we should return the data.
There are big differences between storage engines optimized for transactional workloads, and those optimized for analytics.
Exploring the distinction:
Keep data geographically close to users
Allow the system to continue working even if some of the parts have failed (to increase availability)
Scale out the number of machines that can read queries
Maintaining consistency among the shards
Considerations:
Synchronous or async replication
How to handle failed replicas
Replication lag
One of the replicas is designated as the leader. When clients want to write to the database, they must send their requests to the leader, which first writes the new data to its local storage.
The other replicas are known as followers. whenever the leader writes new data to its local storage, it also sends the data change to all its followers as part of a replication log / change stream.
Synchronous replication: leader waits until follower has confirmed that it received a write before reporting success to the user and making it visible to other clients.
Asynchronous replication: leader sends a replication but does not wait for a response.
Synchronocity:
Follower is guaranteed to have an up-to-date copy of data that is consistent withe hte leader
If synchronous follower doesn’t response, write cannot be processed.
Hence, proposal of semi-synchrocity.
Clients are constantly writing to database, and data is always in flux so standard file copy would see different parts of the database at different points in time.
Lock database and copy, but it goes against idea of high availability.
Take consistent snapshot of leader’s database at some point of time. Copy snapshot.
One leader, and all writes must go through it.


Completely failed files: 1; Completely failed subtests: 6; Failure level: 6/38 (15.79%)
| Test | Ch54 | Ed25 | Ff51 |
|---|---|---|---|
| /pointerlock/idlharness.html (6/24, 25.00%, 15.79% of total) | OK | OK | OK |
| Element must be primary interface of window.document.documentElement | FAIL | FAIL | FAIL |
| Stringification of window.document.documentElement | FAIL | FAIL | FAIL |
| Document must be primary interface of window.document | FAIL | FAIL | FAIL |
| Stringification of window.document | FAIL | FAIL | FAIL |
| Document interface: window.document must inherit property "onpointerlockchange" with the proper type (0) | FAIL | FAIL | FAIL |
| Document interface: window.document must inherit property "onpointerlockerror" with the proper type (1) | FAIL | FAIL | FAIL |


Valentine:
Did Klaus order some ice liquor?
Hmm... How strange! He knows very well how rare that stuff is!
If I'm to make some, I'll need some ingredients. Would you be willing to bring them to me?
"I'll do it!"


Functions | |
| int | sqlo_alloc_lob_desc (sqlo_db_handle_t dbh, sqlo_lob_desc_t *loblpp) |
| Allocate a lob descriptor. | |
| int | sqlo_free_lob_desc (sqlo_db_handle_t dbh, sqlo_lob_desc_t *loblpp) |
| Free a lob descriptor. | |
| int | sqlo_lob_write_buffer (sqlo_db_handle_t dbh, sqlo_lob_desc_t loblp, unsigned int loblen, void *bufp, unsigned int bufl, unsigned int piece) |
| Write lob data from buffer into the lob column. | |
| int | sqlo_lob_append_buffer (sqlo_db_handle_t dbh, sqlo_lob_desc_t loblp, unsigned int loblen, void *bufp, unsigned int bufl, unsigned int piece) |
| Append lob data from buffer to the lob column. | |
| int | sqlo_lob_write_stream (sqlo_db_handle_t dbh, sqlo_lob_desc_t loblp, unsigned int filelen, FILE *fp) |
| Write lob data from a file into the lob column. | |
| int | sqlo_lob_get_length (sqlo_db_handle_t dbh, sqlo_lob_desc_t loblp, unsigned int *loblenp) |
| Get the length of a lob. | |
| int | sqlo_lob_read_buffer (sqlo_db_handle_t dbh, sqlo_lob_desc_t loblp, unsigned int loblen, void *bufp, unsigned int bufl) |
| Read lob data from lob column into a buffer. | |
| int | sqlo_lob_read_stream (sqlo_db_handle_t dbh, sqlo_lob_desc_t loblp, unsigned int loblen, FILE *fp) |
| Read lob data from lob column into a stream. |
|
|
Allocate a lob descriptor.
|
|
|
Free a lob descriptor. Frees the descriptor and sets *loblp to NULL.
|
|
|
Append lob data from buffer to the lob column.
|
|
|
Get the length of a lob.
|
|
|
Read lob data from lob column into a buffer. Reads data from the lob and writes it into the supplied buffer. Use sqlo_lob_get_length to get the loblen you have to use here.
|
|
|
Read lob data from lob column into a stream. Use sqlo_lob_get_length to get the loblen you have to use here.
|
|
|
Write lob data from buffer into the lob column.
|
|
|
Write lob data from a file into the lob column. This function reads the data from the stream and writes it into the lob column via sqlo_lob_write_buffer.
|


Beat winter with up to 60% off waterproof jackets and boots at the Blacks pre-Black Friday sale
Stay warm and dry thanks to big savings on The North Face, Jack Wolfskin, Merrell, Berghaus and others
by Claire DaviesBlack Friday and Cyber Monday are nearly upon us, which means now is the perfect time to find some great deals on technical clothing and footwear to keep you warm and dry outdoors, whether you’re looking for a new waterproof jacket, some warm wellies and hiking boots, or a form-fitting fleece jacket to team with a snug base layer.
With that in mind, right now you can save up to 60% on outdoors gear at the Blacks Big Brand Event. The sale includes GPS multi-sport watches for outdoors activities, plus a range of backpacking equipment, climbing and camping gear, and all manner of technical clothing, shoes and accessories.
- Looking for more great sales? Browse the Best Black Friday deals UK
There are hundreds of items currently discounted, but we’re mostly eyeing up the abundant sale range of waterproof jackets, hiking boots and fleece jackets. If you’re short on time yet don’t want to miss out on a juicy deal, don’t worry, as here we’ve rounded-up our favourites currently featured in the event and while stocks last.
The North Face Women's Evolve II Triclimate 3-in-1 HyVent Jacket: Now £136 | Was £170
This three-in-one jacket for women sports a waterproof and breathable HyVent fabric shell and a removable fleece inner. Want to wear the shell without the fleece or vice versa? Simply zip the inner out. Two hand pockets keep your digits warm on a walk.
VIEW DEAL
Jack Wolfskin Men’s Watson Zip Fleece: Now £39 | Was £65
Stay warm outdoors by throwing on this mid-weight fleece – then layer it under an insulated jacket when the temperature dips. The Watson is made from Nanuk 200 polyester fleece for added warmth, with a high collar to keep the wind out.
VIEW DEAL
Trekmates Chamonix GTX Mittens: Now £32.40 | Was £45
Looking for warm and waterproof gloves for winter sports and adventures? You just found them. A deep pile lining boosts in-glove warmth, with rubberised zones to enhance grip. While this is a good price, we have seen the XS/S size for £24.99 at Winfields.
VIEW DEAL
Merrell Men’s Ontario Mid Walking Boots: Now £112 | Was £140
The Brown and Black colours of this popular Merrell boot are now reduced to £112 in a range of sizes (less availability in the Brown). The Green is even cheaper at £99.97, but only in men’s UK sizes 8 and 9. The boots have a waterproof finish and feel very comfy on.
VIEW DEAL
Berghaus Women’s Prism II Micro Fleece: Now £45 | Was £60
Berghaus is known for its snuggly fleece jackets, and we're feeling the soft, lightweight and breathable Prism II Micro Fleece. It zips all the way up for full protection in colder climes, and has two zippered handwarmer pockets plus an elasticated waist and sleeves.
VIEW DEAL
Mountain Equipment Men’s Rupal Gore-Tex Jacket: Now £216 | Was £300
Mountain Equipment make durable waterproof jackets and the Rupal, also available on sale for women, is no different. It utilises a three-layer Gore-Tex 75D fabric to protect you from bad weather, and has a helmet and beanie hat-friendly hood.
VIEW DEAL
The North Face Women's Ultra Fastpack III Mid Gore-Tex Hiking Boots: £150 | Was £120
While they may look gloriously retro, there’s nothing vintage about the tech used in these boots. They're built to help you move fast and light over hills, with a Fastfoam base boosting comfort and energy return. They’re waterproof too, so fine to wear in the rain.
VIEW DEAL
There are tons of top outdoors brands involved, including the following – click on a brand name to go through to its own area of the Blacks Big Brand Event sale:
- Garmin
- Salomon
- Eurohike
- Suunto
- Craghoopers
- Adidas
- Vango
- Leatherman
- The North Face
- Jack Wolfskin
- Merrell
- Berghaus
- Mountain Equipment
While Blacks states that you can save up to 60% on some items in its Big Brand Event sale, discounts do range widely, with some items on sale for over half price while others have a much lower discount.
You will also find that some items, such as hiking boots, come in a variety of colours, and some colours may be even cheaper. Just take the Merrell Ontario Mid’s above as an example – the green is cheaper than the black.
So if you aren’t too bothered about buying an item in a specific colour, you could walk away with even more of a bargain, providing the item is still available in your size. And that’s the other thing to remember with sales such as these: some items (certainly not all) can sell out fast, so retailers may further reduce the pricing of the remaining few sizes just to clear the stock to make room for new lines.
Looking for more great deals but this time for your home, fitness regime or even your commute or winter holidays? Well, in addition to Amazon and Blacks outdoors running huge sales, a whole host of retailers across the globe are already starting their holiday sales. The ones to check out now include:


Dynamic CL-HTTP Output Generation
The current version of this site is implemented statically using tables:
- Each page is a table of two rows: a heading line (one item) and
a pair of items.
- The second row is a navigation table and the real "contents" of
the page.
It has been suggested that we provide output tailored to different
needs or preferences: tables, no tables, frames, etc. The author of the
current site has also noticed that it is difficult in the current
static implementation to maintain navigational cues as new pages are
added, or as the design of the display of navigation cues is changed.
It is proposed that the dynamic serving capabilities of CL-HTTP be
used to address both these issues. The author of this plan (howard@elwoodcorp.com,) does
not have access to CL-HTTP, so better ideas are solicited! Perhaps
someone has done all this already?
The idea is that the basic contents of the pages are stored in text
files, and the server keeps a database of what files are known, what
groups these files belong to, and some information about the groups.
Pages and navigational displays are then dynamically created to meet
the various preferences.
Throughout this proposal, pages are refered to as being created
dynamically. For performance reasons, these might actually be created
once and cached, but this does not change the model.
Here's the proposal:
- The "contents" of each current .htm file is copied to
a .text file of the same name. These consitute the "known pages".
- The server has an ordered list of areas. Each area has a name, a
color, and an ordered list of known pages. Each page has a title and
the name of the .text file that holds its contents, and possibly
another ordered list of known pages.
- A welcome page gives the option of using forms, tables or simple
(i.e. non-tables, non-forms) pages. Selecting the tables or simple
format brings up a specialized table/contents.htm or
simple/contents.htm page. Selecting the frames format brings up a
frameset which defines a narrow navigation frame on the left and
displays frame/contents.htm on the right.
- There are three abstract URLs defined for each "known page":
- table/file.htm displays in the same format as is
currently used.
- frame/file.htm keeps the current navigation table in a
separate frame, allowing the contents to scroll independently.
- simple/file.htm displays the contents without tables, but
adds a simple horizontal navigational bar at the top and bottom of the
page.
- There are three filters defined that convert general html to the
appropriate specialized contents. The only specialization currently
required is for anchors:
- The URLs of "known pages" must be translated to the appopriate
simple/file, table/, or frame/ URL.
- The frame filter must add the "display" target for "known pages"
and the "_top" target for all other HREFs. It must also add an onClick
event for links to "known pages" which invokes JavaScript to update
the navigation frame with the correct information.
- There is a navigation bar generator that generates the
appropriate html based on the format and the "known page" being
displayed. The frame and tables format use the same table style
currently used, while the simple format uses a three line format
corresponding to the general links, area listings, and pages within
the current area of the current format. The generator uses the
database of pages and the current page to determine:
- The links used in the up, forward and back arrows.
- The current area, to be displayed in bold.
- The listing of other pages in the same area, with the current
page in bold.
The generated contents are passed through the formatting filter to fix
up the "known page" HREFs.
- It seems likely that the the W3P presentation system should be
used. A NAVIGATION-BAR presentation type would be defined, with
specialized methods for SIMPLE, TABLE, and FORM views.
Here are some related issues:
- It is mentioned above that for performance reasons, it may be
desirable to cache a static snapshot of all pages. It may be
desirable to do this for other reasons as well. People without
CL-HTTP serving capabilities might want to make a mirror of the site.
A static snapshot would facilitate this. One possibility is to
provide an update snapshot function that uses W4 to create not only a new
static version of the site, but .tgz files as well.
- The welcome page gives us a place to display pointers to other
non-English language versions. The structure also makes it easy
to create foreign language versions - provided they either also use CL-HTTP
or make a static mirror.
- This scheme also makes it easy to generate a static content-only
version suitable for printing.
- In the non-simple versions, it would be nice if the navigation
bar had a pull down menu for each area that showed the pages within
that area. Perhaps this could be done by making the navigation bar a
form?


WARNING: These are proof-of-concept calculators designed to give a general idea of how taxes are calculated in the simplest of scenarios. They should in no way be considered advice, or binding, or predictive. Consult a tax professional for actual advice.
Do you have a workplace pension but still want to invest to supplement that, and you're not sure if you should invest in an RRSP, or keep your investments in an unregistered account? The RRSP will give you tax-back today at your marginal rate, but you'll pay tax on your withdrawals at your retirement marginal rate. Okay, but what if you take a gap-year between retirement and collecting a pension? You could withdraw your whole RRSP and pay your average tax rate on that; then collect your pension the next year. What about that Scenario?
Check out the Year by Year RRSP vs Uniregistered Retirement Savings Calculator to answer questions like these.
Okay, but for today: if you get some money and wonder if you should keep it in an unregistered account, add it to your RRSP, or your TFSA, and the tax implications if you get dividend, interest, or capital gains interest in each of those types of accounts; check out the more general Tax Calculator.


| 1 | /* | |
| 2 | * Licensed to the Apache Software Foundation (ASF) under one or more | |
| 3 | * contributor license agreements. See the NOTICE file distributed with | |
| 4 | * this work for additional information regarding copyright ownership. | |
| 5 | * The ASF licenses this file to You under the Apache License, Version 2.0 | |
| 6 | * (the "License"); you may not use this file except in compliance with | |
| 7 | * the License. You may obtain a copy of the License at | |
| 8 | * | |
| 9 | * http://www.apache.org/licenses/LICENSE-2.0 | |
| 10 | * | |
| 11 | * Unless required by applicable law or agreed to in writing, software | |
| 12 | * distributed under the License is distributed on an "AS IS" BASIS, | |
| 13 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| 14 | * See the License for the specific language governing permissions and | |
| 15 | * limitations under the License. | |
| 16 | */ | |
| 17 | package org.apache.commons.collections4.functors; | |
| 18 | ||
| 19 | import java.io.Serializable; | |
| 20 | ||
| 21 | import org.apache.commons.collections4.Predicate; | |
| 22 | import org.apache.commons.collections4.Transformer; | |
| 23 | ||
| 24 | /** | |
| 25 | * Transformer implementation that will call one of two closures based on whether a predicate evaluates | |
| 26 | * as true or false. | |
| 27 | * | |
| 28 | * @param  The input type for the transformer | |
| 29 | * @param <O> The output type for the transformer | |
| 30 | * | |
| 31 | * @since 4.1 | |
| 32 | * @version $Id: IfTransformer.java 1686855 2015-06-22 13:00:27Z tn $ | |
| 33 | */ | |
| 34 | public class IfTransformer implements Transformer, Serializable { | |
| 35 | ||
| 36 | /** Serial version UID */ | |
| 37 | private static final long serialVersionUID =<PHONE_NUMBER>242014252L; | |
| 38 | ||
| 39 | /** The test */ | |
| 40 | private final Predicate<? super I> iPredicate; | |
| 41 | /** The transformer to use if true */ | |
| 42 | private final Transformer<? super I, ? extends O> iTrueTransformer; | |
| 43 | /** The transformer to use if false */ | |
| 44 | private final Transformer<? super I, ? extends O> iFalseTransformer; | |
| 45 | ||
| 46 | /** | |
| 47 | * Factory method that performs validation. | |
| 48 | * | |
| 49 | * @param  input type for the transformer | |
| 50 | * @param <O> output type for the transformer | |
| 51 | * @param predicate predicate to switch on | |
| 52 | * @param trueTransformer transformer used if true | |
| 53 | * @param falseTransformer transformer used if false | |
| 54 | * @return the if transformer | |
| 55 | * @throws NullPointerException if either argument is null | |
| 56 | */ | |
| 57 | public static  Transformer ifTransformer(final Predicate<? super I> predicate, | |
| 58 | final Transformer<? super I, ? extends O> trueTransformer, | |
| 59 | final Transformer<? super I, ? extends O> falseTransformer) { | |
| 60 |
1
1. ifTransformer : negated conditional → KILLED |
if (predicate == null) { |
| 61 | throw new NullPointerException("Predicate must not be null"); | |
| 62 | } | |
| 63 |
2
1. ifTransformer : negated conditional → KILLED 2. ifTransformer : negated conditional → KILLED |
if (trueTransformer == null || falseTransformer == null) { |
| 64 | throw new NullPointerException("Transformers must not be null"); | |
| 65 | } | |
| 66 | ||
| 67 |
1
1. ifTransformer : mutated return of Object value for org/apache/commons/collections4/functors/IfTransformer::ifTransformer to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return new IfTransformer(predicate, trueTransformer, falseTransformer); |
| 68 | } | |
| 69 | ||
| 70 | /** | |
| 71 | * Factory method that performs validation. | |
| 72 | *
 | |
| 73 | * This factory creates a transformer that just returns the input object when | |
| 74 | * the predicate is false. | |
| 75 | * | |
| 76 | * @param <T> input and output type for the transformer | |
| 77 | * @param predicate predicate to switch on | |
| 78 | * @param trueTransformer transformer used if true | |
| 79 | * @return the if transformer | |
| 80 | * @throws NullPointerException if either argument is null | |
| 81 | */ | |
| 82 | public static <T> Transformer<T, T> ifTransformer( | |
| 83 | final Predicate<? super T> predicate, | |
| 84 | final Transformer<? super T, ? extends T> trueTransformer) { | |
| 85 | ||
| 86 |
1
1. ifTransformer : negated conditional → KILLED |
if (predicate == null) { |
| 87 | throw new NullPointerException("Predicate must not be null"); | |
| 88 | } | |
| 89 |
1
1. ifTransformer : negated conditional → KILLED |
if (trueTransformer == null) { |
| 90 | throw new NullPointerException("Transformer must not be null"); | |
| 91 | } | |
| 92 | ||
| 93 |
1
1. ifTransformer : mutated return of Object value for org/apache/commons/collections4/functors/IfTransformer::ifTransformer to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return new IfTransformer<T, T>(predicate, trueTransformer, NOPTransformer.<T>nopTransformer()); |
| 94 | } | |
| 95 | ||
| 96 | /** | |
| 97 | * Constructor that performs no validation. | |
| 98 | * Use the static factory method ifTransformer if you want that. | |
| 99 | * | |
| 100 | * @param predicate predicate to switch on, not null | |
| 101 | * @param trueTransformer transformer used if true, not null | |
| 102 | * @param falseTransformer transformer used if false, not null | |
| 103 | */ | |
| 104 | public IfTransformer(final Predicate<? super I> predicate, | |
| 105 | final Transformer<? super I, ? extends O> trueTransformer, | |
| 106 | final Transformer<? super I, ? extends O> falseTransformer) { | |
| 107 | ||
| 108 | super(); | |
| 109 | iPredicate = predicate; | |
| 110 | iTrueTransformer = trueTransformer; | |
| 111 | iFalseTransformer = falseTransformer; | |
| 112 | } | |
| 113 | ||
| 114 | /** | |
| 115 | * Transforms the input using the true or false transformer based to the result of the predicate. | |
| 116 | * | |
| 117 | * @param input the input object to transform | |
| 118 | * @return the transformed result | |
| 119 | */ | |
| 120 | public O transform(final I input) { | |
| 121 |
1
1. transform : negated conditional → KILLED |
if(iPredicate.evaluate(input)){ |
| 122 |
1
1. transform : mutated return of Object value for org/apache/commons/collections4/functors/IfTransformer::transform to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return iTrueTransformer.transform(input); |
| 123 | } else { | |
| 124 |
1
1. transform : mutated return of Object value for org/apache/commons/collections4/functors/IfTransformer::transform to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return iFalseTransformer.transform(input); |
| 125 | } | |
| 126 | } | |
| 127 | ||
| 128 | /** | |
| 129 | * Gets the predicate. | |
| 130 | * | |
| 131 | * @return the predicate | |
| 132 | */ | |
| 133 | public Predicate<? super I> getPredicate(){ | |
| 134 |
1
1. getPredicate : mutated return of Object value for org/apache/commons/collections4/functors/IfTransformer::getPredicate to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return iPredicate; |
| 135 | } | |
| 136 | ||
| 137 | /** | |
| 138 | * Gets the transformer used when true. | |
| 139 | * | |
| 140 | * @return the transformer | |
| 141 | */ | |
| 142 | public Transformer<? super I, ? extends O> getTrueTransformer() { | |
| 143 |
1
1. getTrueTransformer : mutated return of Object value for org/apache/commons/collections4/functors/IfTransformer::getTrueTransformer to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return iTrueTransformer; |
| 144 | } | |
| 145 | ||
| 146 | /** | |
| 147 | * Gets the transformer used when false. | |
| 148 | * | |
| 149 | * @return the transformer | |
| 150 | */ | |
| 151 | public Transformer<? super I, ? extends O> getFalseTransformer() { | |
| 152 |
1
1. getFalseTransformer : mutated return of Object value for org/apache/commons/collections4/functors/IfTransformer::getFalseTransformer to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return iFalseTransformer; |
| 153 | } | |
| 154 | } | |
Mutations | ||
| 60 |
1.1 |
|
| 63 |
1.1 2.2 |
|
| 67 |
1.1 |
|
| 86 |
1.1 |
|
| 89 |
1.1 |
|
| 93 |
1.1 |
|
| 121 |
1.1 |
|
| 122 |
1.1 |
|
| 124 |
1.1 |
|
| 134 |
1.1 |
|
| 143 |
1.1 |
|
| 152 |
1.1 |


Youths to be equipped for voluntary work
by Special CorrespondentWith proper training and motivation, the youth of Kerala can take on responsible assignments and respond well to situations, Speaker P.Sreeramakrishnan said here on Monday.
Inaugurating the passing out parade of the Kerala Voluntary Youth Action Force formed by the Kerala State Youth Welfare Board, he said the exemplary social commitment and readiness to take on challenges of the youth was on display during the floods that ravaged the State twice.
He said the voluntary youth action force had the potential to emerge as the nucleus of voluntary youth movements in Kerala and the country as a whole.
Mr.Sreeramakrishnan also released the guidelines for the action force.
He, along with Devaswom Minister Kadakampally Surendran, received the salute at the passing out parade of 405 volunteers who completed the second phase of training.
The volunteers will, in turn, train other youth at the panchayat level. Apart from physical training, the new volunteers will also be equipped to take up programmes on water conservation, environmental protection and waste disposal.
Youth Welfare Board member Santhosh Kala presided. Board vice chairman P.Biju and Youth Commission chairperson Chintha Jerome were among those present at the function.


If the ticket has been assigned to a user, this contains the assigner and assignee user IDs.
The assigner is the person who assigned the ticket. The assignee is the person who will call the ticket for service.
{ "assigner": 1459, "assignee": 1460 }
If the person has assigned a ticket to themselves, the assigner and assignee will be equal.
{ "assigner": 1459, "assignee": 1459 }
If the ticket has been called, then this object contains the time the ticket was called, in ISO8601 format, with milliseconds.
{ "date": "2017-10-31T17:30:00.000Z" }
If the ticket has been cancelled, this contains the time the ticket was cancelled, in ISO8601 format, and the ID of the User who cancelled the ticket.
{ "date": "2017-10-31T17:30:00.000Z", "canceller": 1445 }
An object that contains the creation timestamp of the ticket in ISO8601 format, with milliseconds.
{ "date": "2017-10-31T17:30:00.000Z" }
The e-mail address of the visitor. For example<EMAIL_ADDRESS>List of custom fields and their values attached to the ticket.
The first name of the visitor. For example, "Jane".
This ticket's unique ID. For example, 14995020
List of interactions of this ticket.
List of the ticket's labels.
The last name of the visitor. For example, "Smith".
The ID of the line that this ticket belongs to. All tickets belong to a line. For example, 14142.
List of SMS messages exchanged with this visitor.
If the ticket has been reordered, this will contain an ISO8601 timestamp with milliseconds that should be preferred over the "created date" to sort tickets by.
"orderAfter": "2017-10-31T17:30:00.000Z"
To sort tickets chronologically, taking into account reordering, the orderAfter date should be preferred before the created date:
const tickets = [ ... ]; tickets.sort((ticketA, ticketB) => { const timeA = ticketA.orderAfter || ticketA.created.date; const timeB = ticketB.orderAfter || ticketB.created.date; return new Date(timeA) - new Date(timeB); });
The phone number of the visitor. For example:<PHONE_NUMBER>
If the ticket has been marked served, then this object contains the time the ticket was served, in ISO8601 format, with milliseconds.
Describes how the visitor was added into the queue.
PHONE - The visitor used the discontinued Qminder Remote Queuing app.
MANUAL - The visitor was added into the queue by a clerk.
NAME - The visitor added themselves into a queue via iPad Sign-In (a Name Device).
PRINTER - The visitor used a printer (discontinued) to queue up.
The current status of this ticket.
Generated using TypeDoc
Represents a person in the queue. Every time someone is added to the queue, a ticket is created in Qminder. The ticket contains the person's name, phone number, email address or other custom fields.
Tickets belong to lines. Tickets can have many TicketExtras.
If the location has SMS enabled, some visitors may exchange messages with the location. Those messages are stored with the ticket in the TicketMessages list.
Methods that work with Tickets can be found under {@link TicketService}, or
Qminder.tickets
.For example:
To create a Ticket, call {@link TicketService.create}. To search for tickets, call {@link TicketService.search}.


--- layout: default title: Robert Alfredson keywords: Robert Alfredson description: Home page of Robert Alfredson ---
This page has been intentionally left blank.
This page has been intentionally left blank.
T his page has been intentionally left blank.
Th is page has been intentionally left blank.
Thi s page has been intentionally left blank.
This page has been intentionally left blank.
This page has been intentionally left blank.
This p age has been intentionally left blank.
This pa ge has been intentionally left blank.
This pag e has been intentionally left blank.
This page has been intentionally left blank.
This page has been intentionally left blank.
This page h as been intentionally left blank.
This page ha s been intentionally left blank.
This page has been intentionally left blank.
This page has been intentionally left blank.
This page has b een intentionally left blank.
This page has be en intentionally left blank.
This page has bee n intentionally left blank.
This page has been intentionally left blank.
This page has been intentionally left blank.
This page has been i ntentionally left blank.
This page has been in tentionally left blank.
This page has been int entionally left blank.
This page has been inte ntionally left blank.
This page has been inten tionally left blank.
This page has been intent ionally left blank.
This page has been intenti onally left blank.
This page has been intentio nally left blank.
This page has been intention ally left blank.
This page has been intentionally left blank.
This page has been intentional ly left blank.
This page has been intentionall y left blank.
This page has been intentionally left blank.
This page has been intentionally left blank.
This page has been intentionally l eft blank.
This page has been intentionally le ft blank.
This page has been intentionally lef t blank.
This page has been intentionally left blank.
This page has been intentionally left blank.
This page has been intentionally left b lank.
This page has been intentionally left bl ank.
This page has been intentionally left bla nk.
This page has been intentionally left blank.
This page has been intentionally left blank.
This page has been intentionally left blank.
Daily Page, a site for interactive journaling,
Gdangsk, my photography blog,
Some bad jokes,
Some stuff on my walls
Playlist: 1 2 3 4 5 6 7 8 9 10 11 12 13
Helping people:
{% for item in site.data.helping_people %}
{{ item.name }}{% if forloop.last == false %},
{% endif %}
{% endfor %}
Fun:
Forgotten music of 2003 to 2012,
How to make steam engines,
The oldest surviving page on the
World Wide Web,
Stories: A Falafel House Divided
Web design respectfully pilfered from home page of Edward Mendelson


{% extends "schedule/base.html" %} {% load i18n %} {% load scheduletags %} {% load placeholder_tags %} {% block body %}
Begin:{% blocktrans with event.start|date:_("DATETIME_FORMAT") as start_date %}{{ start_date }}{% endblocktrans %}
Ende:{% blocktrans with event.end|date:_("DATETIME_FORMAT") as end_date %}{{ end_date }}{% endblocktrans %}
{% if event.rule %}Reoccurs:{{ event.rule }} until {% blocktrans with event.end_recurring_period|date:_("DATETIME_FORMAT") as end_recurring_date %}{{ end_recurring_date }}{% endblocktrans %}
{% endif %}


Hello Worlds!
- David Nishikawa
A towel is just about the most massively useful thing any interstellar Hitchhiker can carry. Partly it has great practical value. You can wrap it around you for warmth as you bound across the cold moons of Jaglan Beta; you can lie on it on the brilliant marble-sanded beaches of Santraginus V, inhaling the heady sea vapours; you can sleep under it beneath the stars which shine so redly on the desert world of Kakrafoon; use it to sail a miniraft down the slow heavy River Moth; wet it for use in hand-to-hand combat; wrap it round your head to ward off noxious fumes or avoid the gaze of the Ravenous Bugblatter Beast of Traal (a mind-bogglingly stupid animal, it assumes that if you can't see it, it can't see you — daft as a brush, but very very ravenous); you can wave your towel in emergencies as a distress signal, and of course you can dry yourself off with it if it still seems to be clean enough.
More importantly, a towel has immense psychological value. For some reason, if a strag (strag: nonhitchhiker) discovers that a hitchhiker has his towel with him, he will automatically assume that he is also in possession of a toothbrush, washcloth, soap, tin of biscuits, flask, compass, map, ball of string, gnat spray, wet-weather gear, space suit etc., etc. Furthermore, the strag will then happily lend the hitchhiker any of these or a dozen other items that the hitchhiker might accidentally have "lost." What the strag will think is that any man who can hitch the length and breadth of the Galaxy, rough it, slum it, struggle against terrible odds, win through and still knows where his towel is, is clearly a man to be reckoned with.
Douglas Adams, The Hitchhiker's Guide to the Galaxy


the and for were was with laEBLN-v EBLNs from The that cluster sequences are protein Fig bornavirus using acid cells elephant laEBLN- which amino {background (Fig proteins data laEBLN-v, African have EBLN into sequence Click LINK additional afrotherian file. here used identified between encoded margin exon ratio {border-style laEBLN mRNAs PCR RNA []. containing dN/dS expression laEBLN-v/v px;} #ffffff;} ORFs may these upstream Biology Molecular endogenous regions TMEMB been each genome loci number: phylogenetic respectively. shown suggesting DNA analysis expressed host indicate mRNA cells. genomes genomic nucleotide site tree EBLNs. RT-PCR These addition, also detected encoding plasmids polyclonal products their Research conducted derived diluted localization not positions than transcribed transcription (TIF) (lane afrotherians elephant, extracted observed other performed respectively, splice tBLASTn those viral (A) LACF-NANAI LACF-NANAII Table Techniques according after bornavirus-like cellular functional genomes. has homologous human its luciferase min more negative primer search sites species start tissues virus (B) Cape Cell Fig), Fig). Multiple Sequence above accession afrotherians. alignment cell donor elements gene golden laEBLN-v. lane likelihood product promoter px; rabbit selection under vector whole {font-family < (XLSX) EBLNs, Nucleotide Protein Sequencing System [–]. against all animal antiserum codon collected contained font-size function lines membrane min. nucleoprotein primers region retroviruses size staining two °C. (Promega) (TOYOBO) (accession (e.g., ,-fold Biol Each Endogenous FLAG-tagged Genomic His-tagged HorieM, Kit LACF-NANAI, ORF SCIN TMEMB. Table). TomonagaK. among ancient antibody arrows cDNA cells, double; element evolution final found instructions. laEBLN-, localized manufacturer’s min, mole novel onto partial proteins. rlaEBLN-v should show through total (Ca/AMDV) (New (Promega). (TIFF) Afrotherian Analysis Animal Asian B). Evol. Florida Fluor HondaT, Immunohistochemical KobayashiY, LACF-NANAII, Methods Mol Nihon SuzukiY, Table. Taq University University, ability acquired ancestral antibodies appeared associated average bold border-color border-width both compared duplicate encode estimated event evidence evolutionary first gained genes genome. information integration interior intron laEBLNs ligated maintained muscle non-retroviral nuclear nucleus only polyA provided rabbits red relatively samples sec, single solid; suggest this times values volume well {font-style {font-weight > (GE (Invitrogen) (Life -fold After Blend Borna Buffer, CpG Da, EVEs England Gene Japan[], LINE- Life Mini Ministry Oa/ALYB, PLoS Pc/ABRQ, Plasmid RNAseq Sciences TSS Tm/AHIN, Total Virol. When [,]. africana amplify analyses assay biology boxes branches control courier; designed different disease downstream em; endoplasmic entire established flanking ground hydropathy hydrophilic immunohistochemical incubated infection intrinsic known liver localizations long mRNAs. mammalian manatee, manatus noted observations obtained originated pairs primers, proteins, pt;} purified rER recombinant related represent results reverse room same selected solution some temperature. test. transformed ubiquitously ver. where without


--- layout: post-classic title: "Notebook for University?" desc: "Time to get a programming notebook for university" thumbnail: "6eaf5f6e98e063a305f6c92fda48ed9e.jpg" categories: article tags: {} ---
Well it's time to get a notebook, considering that I've mainly only been a desktop user and picking the correct one is harder than previously anticipated.
Inevitably it's impossible to get the 'perfect notebook' so choosing what features are the most important, might give a better idea.
Considering this is going to used for programming I'm considering doing with a Macbook just to use xcode to develop iOS apps. However if possible I'd rather make my desktop a hackintosh.
So far the best and most appealing option I've found is the 'Lenovo ThinkPad Yoga'.
I've never been very fond of the Thinkpad brand, since it's more of a business brand. The internet do claim that the keyboard is great with a very tactile feel, good performance, 1080p IPS...bla bal bla, However it does have a 12,5" screen which does seem a bit small.
I'll defiantly try to get a hands on it, before buying it and see if it's any good.


timer_delete - delete a POSIX per-process timer
#include <time.h>
int timer_delete(timer_t timerid);
Link with -lrt.
Feature Test Macro Requirements for glibc (see feature_test_macros(7)):
timer_delete():
_POSIX_C_SOURCE >= 199309L
timer_delete() deletes the timer whose ID is given in timerid. If
the timer was armed at the time of this call, it is disarmed before being
deleted. The treatment of any pending signal generated by the deleted timer is
unspecified.
On success, timer_delete() returns 0. On failure, -1 is returned, and
errno is set to indicate the error.
- EINVAL
- timerid is not a valid timer ID.
This system call is available since Linux 2.6.
POSIX.1-2001, POSIX.1-2008.
clock_gettime(2), timer_create(2), timer_getoverrun(2),
timer_settime(2), time(7)
This page is part of release 5.05 of the Linux man-pages project. A
description of the project, information about reporting bugs, and the latest
version of this page, can be found at https://www.kernel.org/doc/man-pages/.


SLIDING DOORS A film review by Steve Rhodes Copyright 1998 Steve Rhodes
RATING (0 TO ****): **
SLIDING DOORS takes a what-if look at romance. What are those tiny changes that could have had an immense impact on your love life? Who is that special someone that you could have met but didn't because you entered a crowded room a minute too late or too early? And that tragic time you found your lover in someone's arms, what if you had come home just a bit later and missed seeing them together? This is the promising premise of SLIDING DOORS.
 The picture then backs up time so that Helen just manages to slip through the train's sliding doors. This plot device sets up two parallel universes in which all of the story's characters exist.
In one, Helen walks in on her boyfriend, Gerry, played with his usual doleful eyes by John Lynch from CAL, who is in bed with his old girl friend Lydia. Jeanne Tripplehorn, who was the sexier of the two female leads in BASIC INSTINCT, plays Lydia. For those hoping to see Tripplehorn recreate some of the animal passion she demonstrated in BASIC INSTINCT, you'll be sorry to know that she doesn't. Her scenes are the standard ones, in which she's quickly caught and then promptly jumps out of bed. Helen goes on to meet and fall for a married man named James (John Hannah). James is as gregariously happy as Gerry is inertly melancholy.
In another scenario, Helen comes home just after Lydia has left. She does, however, begin to get suspicious when certain clues to Gerry's affair begin to turn up.
First-time writer and director Peter Howitt uses a bag of old cliches to tell his story. A typically cliched scene that rings false is the one in which Gerry gives his full and complete confession to Helen. She manages to fall completely asleep just as his admission of guilt begins.
The slowly paced movie switches back and forth between the two scenarios without managing to make either compelling. Rarely effective as a comedy or a romance, the film finally finds its footing towards the end when it dips into pathos.
With its light-hearted spirit, SLIDING DOORS would be a hard film to dislike. On the other hand, if you want more than Paltrow's enchanting smile, you would be advised to look elsewhere.
SLIDING DOORS runs 1:45 but feels longer. It is rated R for sex and mild profanity and would be fine for most teenagers.
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 Emojifuck - facebook's choice!
To learn how brainfuck works, click here
For a tour of emojifuck, click here
Tip: click File > Load project to load
fun code samples!
Okay! I've saved the data that was here so you can play
and experiment. When you're done, you can revert to start
or just exit tour mode!
In tour mode, hover over different parts of the layout and an
infobox will appear to guide you.
Note: all current data will be saved if you reload/close the tab.
65
| Ctrl+S | Save project to LocalStorage |
| Ctrl+L / Ctrl+O | Open project from LocalStorage |
| Alt+N | Create new project |
| F6 | Run code |
| Ctrl+F6 | Clean up and run code |
| Alt+A | Open ASCII table window |
| Alt+V | Toggle ASCII/Emoji view mode |
| Ctrl+M | Get memory dump from executed code |
| Alt+C | Clear console |
| Esc | While running - halt execution |
| Esc | Close windows. Will not halt execution if closing window. |
| Space | While running - play/pause execution |
| Tab | While running and paused - Jump to next instruction |


Barrister Felix Eze, Fel Eze Chambers, Solicitors & Advocates. 06 BP 1409 Akpakpa Dodomey, Cotonou - Benin Republic<EMAIL_ADDRESS>Ant:
I am Barrister Felix Eze, an attorney at law. This mail is written to solicit your assistance to be presented as next of kin to my deceased client Mr Ronald Lake. He made a fixed deposit valued US 3.5M,(Three Million, Five Hundred Thousand US Dollars) on September 1998 for 36 months maturity, with an intent of putting up a gold mining company here in Cotonou and upon the maturity this bank started contacting him but to no avail On 31 January, 2000, my clientele along with his wife died in a plane crash of Alaska Airlines Flight number 261. You shall read more about the crash on visiting this site(http://www.cnn.com/2000/US/02/01/alaska.airlines.list/) The Governing Body of the bank has contacted me on this matter, based on the fact that his supposed next of kin, happened to die in the said crash and I am yet to provide any other Next of Kin to lay claim to the fund.
Under a clear and legitimate agreement with you, I shall seek your consent to be presented as the next of Kin,so that the proceeds of this account now valued US 4.1 million, will be paid to you, so that the Bank will not confiscate this fund, as the banking law and guidelines here stipulates that if such money remained unclaimed after four years, the money will be transfered into the bank treasury as unclaimed fund For the sake of transparency on this matter, you are free to make immediate contact with me through my mailbox or phone line, for further information related to this matter.
Thank you very much for your anticipated acceptance while I expect your prompt response.
Yours faithfully, Barr, Felix Eze You can contact me through my mailbox<EMAIL_ADDRESS>for further information.


[§87A-17] Group life insurance benefits or group life insurance program. The board may provide benefits under a group life insurance benefits program or group life insurance program to employees. [L 2001, c 88, pt of §1]


Can AI easily mimic Caravaggio?
Artificial Intelligence technology performed an awesome show last year. Mimicking artistic style of Fine Art is surprisingly successful, which can be obviously proved by the popularity of a photo-editing application, Prisma .
The key algorithm of mimicking artistic style is neural networks , and this paper, Neural Algorithm of Artistic Style , elaborates the details of implementing neural networks. There are some open-source implementations of this algorithm on Github, like this and this . These guys have done good job, and most of images they got are pretty fancy and fantastic.
For example, Anish Athalye used these two images to produce a new image with Leonid Afremov style.
Given the open-source implementation and the amazing result, I was definitely eager to mimic more masterpieces. Therefore, I installed neural style , and tried to combine my picture with Caravaggio ’s style.
The original photo: my teammates and I were working for Datafest competition 2016
Caravaggio’s work, which I used to learn his style from:
However, it took my mac pro about 12 hours to run 100 iterations, and I don’t think the result is similar to any Caravaggio’s work at all (
The problem might be this algorithm is good at capturing styles of modern artists like Van Gogh and Claude Monet because the way they used color and brush are very characteristic. While what makes Caravaggio stand out is how he portrayed varies religious figures by realistic observation of physical and emotional human states and dramatic use of lighting. In addition, Caravaggio is also the best story teller in Fine Art history. Therefore, the styles of classical artists are harder to mimic for present AI technology because of their intricacy and delicacy.
Can AI easily easily mimic artists like Caravaggio? My answer is: we still have a long way to go.