Water
Firstly note that a hydrated body burns fat at a higher rate when compared to a dehydrated body – by miles!
It is so important that your body remains hydrated throughout the course of the plan and moving forwards.
Aim to consume 3.75 litres of water daily in order to ensure the body remains hydrated pre, during and post high intensity exercise. Please note this is in ADDITION to things like green tea, protein drinks etc. Sometimes you can feel a little bloated at first (it won’t last though) getting used to this new amount but believe me your body needs it.
It is of the highest importance that during your workouts and first thing upon rising in the morning you hydrate.
Other drinks
Feel free to drink green tea throughout the day. You can also drink fruit and herbal teas providing they do not contain more than 1g sugar per serving.
If you want to have coffee please limit to 1-2 cup(s) per day and ensure no sugar is added. If you drink too much coffee your body can become reliant on the caffeine. Please use WHOLE MILK to maximise the natural goodness of un-processed milk.
You are permitted 1-2 diet soft drinks (i.e. diet coke, coke zero etc.) per day if you wish – drinking more than this will not affect fat loss but it’s not great for the gut.
Alcohol
SPECIAL NOTE: You won’t like to hear is but Alcohol could be the one thing holding you back from getting the body you want.
Unlike macronutrients such as carbohydrates, proteins and fats, alcohol supplies what I often refer to as empty calories: calories without nutrition. To make matters worse, it is the first fuel to be used when combined with carbohydrates, fats and proteins, postponing the fat-burning process and contributing to greater fat storage. Try your best to cut out alcohol as much possible while on the plan. However, life is for living and it’s important to enjoy nights out so if you do decide to have a drink do not panic. Get back on it the next day and win!


| Cell editing | Ctrl-C | Copy |
| Ctrl-X | Cut | |
| Ctrl-V | Paste | |
| Ctrl-Z | Undo | |
| Ctrl-Y | Redo | |
| Ctrl-Space | Code auto-complete | |
| Alt-F11 | Toggle fullscreen editor | |
| Esc | Exit fullscreen editor | |
| Cell Evaluation: | Ctrl-Enter | Evaluate |
| Shift-Enter | Evaluate and move focus to next cell. | |
| Notebook editing: | Ctrl-Shift-A | Add a new code cell |
| Ctrl-Shift-E | Pop up evaluator selector | |
| Ctrl-S | Save notebook | |
| Ctrl-Alt-Up | Move cell up | |
| Ctrl-Alt-Down | Move cell down | |
| Ctrl-Alt-D | Delete cell | |
| Ctrl-Alt-Hide | Hide cell | |
| Cell navigation: | Alt-Down (or Alt-J) | Move focus to next code cell |
| Alt-Up (or Alt-K) | Move focus to previous code cell |
| Ctrl-N | Create new empty notebook | |
| Ctrl-Shift-N | Create new default notebook |
| Cell editing | ⌘-C | Copy |
| ⌘-X | Cut | |
| ⌘-V | Paste | |
| ⌘-Z | Undo | |
| ⌘-Y | Redo | |
| ⌘-Space | Code auto-complete | |
| Alt-F11 | Toggle fullscreen editor | |
| Esc | Exit fullscreen editor | |
| Cell Evaluation: | ⌘-Enter | Evaluate |
| Shift-Enter | Evaluate and move focus to next cell. | |
| Notebook editing: | ⌘-Shift-A | Add a new code cell |
| ⌘-Shift-E | Pop up evaluator selector | |
| ⌘-S | Save notebook | |
| ⌘-Alt-Up | Move cell up | |
| ⌘-Alt-Down | Move cell down | |
| ⌘-Alt-D | Delete cell | |
| ⌘-Alt-Hide | Hide cell | |
| Cell navigation: | Alt-Down (or Alt-J) | Move focus to next code cell |
| Alt-Up (or Alt-K) | Move focus to previous code cell |
| ⌘-N | Create new empty notebook | |
| ⌘-Shift-N | Create new default notebook |


--- layout: mocks title: Card --- Card 🃏 What is the difference between harmonic and inharmonic waves? Belongs to unit 📖 Complex Waves 👂🏿 Follow 💬 Talk 🎢 History 🌳 Edit Choice Card 🧐 What is the difference between harmonic and inharmonic waves? Both harmonics and inharmonics are integer multiples of the fundamental. (One is not an integer multiple.) Inharmonics are integer multiples, harmonics are not. (The opposite is true.) Harmonics are integer multiples, inharmonics are not. (Correct!) Neither harmonics nor inharmonics are integer multiples of the fundamental. (One is an integer multiple.) Order: Random Max Options: 4
Card 🃏
Belongs to unit 📖 Complex Waves
What is the difference between harmonic and inharmonic waves?


This page uses Elix 7.0 and Elix 8.0 components side-by-side.
Elix 7.0 DateComboBox:
Elix 8.0 DateComboBox:


This is our expected timeline for the Content Commerce project. Each deliverable and the projected amount of time it should take is shown below.
We anticipate the process to require a total of 20 weeks.


Service Worker API Examples
Offline First / Fallback Content - Fallback page
OOPS! You are seeing me because you are offline!


Defines the CCT cooling type.
int jmpSetCctCoolingType (int typeFlag);
typeFlag [input]
Integer that specifies the cooling profile to consider when running a CCT calculation. This parameter can take one of the following values:
JMP_CCT_COOLING_CONSTANT |
To assume the cooling is of a constant rate, i.e., a constant cooling profile. |
JMP_CCT_COOLING_NEWTONIAN |
To assume the cooling is of a Newtonian (or natural) type, i.e., a Newtonian cooling profile. |
JMP_STATUS_OK |
Request has been successfully completed. |
JMP_STATUS_ERROR |
An error has occurred. |
| Headers | jmpcore.h jmpcct.h |
| Library | jmpcct.lib /jmpcct_x64.lib |
| DLL | jmpcct.dll /jmpcct_x64.dll |


Something is different this time. I remember.
Usually we only remember snippets, or what’s relevant to our current task. But this time I remember everything.
I remember my last life: 80 years spent so that eventually a train would run 5 minutes late. I remember the one before that: so much shorter, with a violent end on the front lines — so that one could be saved. And the one before that, which took 3 of us, years of training, and sacrifices you wouldn’t believe. For such a small victory. Dozens of lives, reaching back into history. Each dimmer and less clear than the next.
I still don’t know how many of us there are, or how many lives I’ve lived. All I know is that we are put down here to do a job, to alter Fate. Sometimes we close off potential futures, sometimes we make room for others.
Most lives, I just have a feeling. I know what I’m supposed to do. What I Need to do. And once it is accomplished— well then nothing else much matters. Sometimes we live out a natural lifetime, sometimes we are quickly ushered back to await our next assignments. But either way, They put us down here to do a job for them.
This time though, I don’t have that feeling. I’m not sure what it is I’m supposed to do. Normally it is clear a couple decades in, but this time… I’m not sure. I remember everything though. I remember the rules, and as I write, it all becomes more clear.
They put us down here to change things. Because They cannot manifest or interfere on their own, They must use us. But there are only so many of us, and They all want to make different changes.
Their changes have been getting bigger recently. Fate used to be able to correct for them within a generation or two. And we used to be assured of a rest or a sabbatical in this world between jobs. But this life, it feels different.
Maybe that’s why I remember. The world is drifting further from where should be. They have been interfering too much.
I don’t know why I’m writing this all down, or even why I remember. I just feel compelled to. Like I Need to. Maybe if I write it down, one of the others will find it. Maybe they’ll be able to act differently. Maybe I’ll find it on my next life, and figure out what is going on. How to fix it.
Maybe…
It’s funny, I almost feel complete now. With so much work left to do, I am almost at peace. With a life time ahead of me. But I think I understand now.
We were the tools of the Gods. But now, I am an instrument of Fate.


This is page 4!
there are:
three pictures
three text files
three links to other pages
file10
file11
file12
page5
page3
page2


The MHD momentum equation of plasmas is given by
|
| (55) |
where ρ, ρq, ℙ, J, E, and B are mass density, charge density, thermal pressure tensor, current density, electric ﬁeld, and magnetic ﬁeld, respectively. The electric ﬁeld force ρqE is usually ignored due to either ρq = 0 or E = 0. Further assume that there is no plasma ﬂow (u = 0, the ﬂow eﬀect is discussed in A.2) and the plasma pressure is isotropic, then the steady state momentum equation (force balance equation) is written
|
| (56) |
where P is the scalar plasma pressure.
Is the force balance (56) always satisﬁed in a real toakamak discharge? To answer this question, we need to go back to the original momentum equation (55). The imbalance between J × B and ∇P will give rise to the compressional Alfven waves, the time-scale of which, τA, is much shorter than the time-scale τ we are interested in. Therefore, on the time scale τ and for slow ﬂow with u < Cs, where Cs is the the sound speed, the leading order of the momentum equation is the force balance (56). (to be sure, I need to think about this again). This reasoning is from Youwen Sun[24].


This inspection detects usages of DefaultListCellRenderer - which causes ugly UI under GTK+ L&F. Please use ListCellRendererWrapper (or its inheritors) instead.


--- layout: blank_page title: Research Interests ---
My research interests center around programming languages and software engineering. In my work I look to provide formal guarantees of program properties in a way that is meaningful for real-world application.
Currently, I'm a PhD student at Northeastern University, where I study programming languages and software engineering. I'm advised by Arjun Guha and I'm a member of the Programming Research Laboratory. Previously I was a PhD student at UMass Amherst, where I was additionally advised by Yuriy Brun, and a member of the PLASMA lab.
However, I'm relatively new to Massachusetts, as I grew up for most of my life in California. For my undergraduate degree, I completed a double major in math and computer science at UC Davis. Meanwhile, I interned in industry for 3 summers, once at FileMaker, and twice at Apple, where I worked on the AppKit user interface library for macOS. After interning in industry I decided to pursue a PhD in computer science, and specifically programming languages, so I can work to drive the field forward in creating correct, safe, and secure software more easily.
In addition to programming languages research, I like to somewhat regularly write blog posts about various topics, and I enjoy dabbling in machine learning, as well as abstract algebra and topology on the pure math side. Outside of academics I enjoy practicing martial arts (in particular Tai Chi, Wing Chun, and Taekwondo), playing music, and archery. I also love to travel with my amazing wife Jessie Lin to see awesome sights.


Broadcaster
Log In
Sign Up
Sign Up
First Name
Last Name
Email
Username
Phone Number
Password
Comfirm Password
Create Account


"""Elliptical geometrical entities.
Contains
* Ellipse
* Circle
"""
from __future__ import division, print_function
from sympy.core import S, pi, sympify
from sympy.core.logic import fuzzy_bool
from sympy.core.numbers import Rational, oo
from sympy.core.compatibility import range
from sympy.core.symbol import Dummy
from sympy.simplify import simplify, trigsimp
from sympy.functions.elementary.miscellaneous import sqrt
from sympy.functions.elementary.trigonometric import cos, sin
from sympy.geometry.exceptions import GeometryError
from sympy.polys import DomainError, Poly, PolynomialError
from sympy.polys.polyutils import _not_a_coeff, _nsort
from sympy.solvers import solve
from sympy.utilities.iterables import uniq
from sympy.utilities.misc import filldedent
from sympy.utilities.decorator import doctest_depends_on
from .entity import GeometryEntity, GeometrySet
from .point import Point
from .line import Line, LinearEntity
from .util import _symbol, idiff
import random
[docs]class Ellipse(GeometrySet):
"""An elliptical GeometryEntity.
Parameters
==========
center : Point, optional
Default value is Point(0, 0)
hradius : number or SymPy expression, optional
vradius : number or SymPy expression, optional
eccentricity : number or SymPy expression, optional
Two of `hradius`, `vradius` and `eccentricity` must be supplied to
create an Ellipse. The third is derived from the two supplied.
Attributes
==========
center
hradius
vradius
area
circumference
eccentricity
periapsis
apoapsis
focus_distance
foci
Raises
======
GeometryError
When `hradius`, `vradius` and `eccentricity` are incorrectly supplied
as parameters.
TypeError
When `center` is not a Point.
See Also
========
Circle
Notes
-----
Constructed from a center and two radii, the first being the horizontal
radius (along the x-axis) and the second being the vertical radius (along
the y-axis).
When symbolic value for hradius and vradius are used, any calculation that
refers to the foci or the major or minor axis will assume that the ellipse
has its major radius on the x-axis. If this is not true then a manual
rotation is necessary.
Examples
========
>>> from sympy import Ellipse, Point, Rational
>>> e1 = Ellipse(Point(0, 0), 5, 1)
>>> e1.hradius, e1.vradius
(5, 1)
>>> e2 = Ellipse(Point(3, 1), hradius=3, eccentricity=Rational(4, 5))
>>> e2
Ellipse(Point2D(3, 1), 3, 9/5)
Plotting:
>>> from sympy.plotting.pygletplot import PygletPlot as Plot
>>> from sympy import Circle, Segment
>>> c1 = Circle(Point(0,0), 1)
>>> Plot(c1) # doctest: +SKIP
[0]: cos(t), sin(t), 'mode=parametric'
>>> p = Plot() # doctest: +SKIP
>>> p[0] = c1 # doctest: +SKIP
>>> radius = Segment(c1.center, c1.random_point())
>>> p[1] = radius # doctest: +SKIP
>>> p # doctest: +SKIP
[0]: cos(t), sin(t), 'mode=parametric'
[1]: t*cos(1.546086215036205357975518382),
t*sin(1.546086215036205357975518382), 'mode=parametric'
"""
def __new__(
cls, center=None, hradius=None, vradius=None, eccentricity=None,
**kwargs):
hradius = sympify(hradius)
vradius = sympify(vradius)
eccentricity = sympify(eccentricity)
if center is None:
center = Point(0, 0)
else:
center = Point(center)
if len(center) != 2:
raise ValueError('The center of "{0}" must be a two dimensional point'.format(cls))
if len(list(filter(None, (hradius, vradius, eccentricity)))) != 2:
raise ValueError('Exactly two arguments of "hradius", '
'"vradius", and "eccentricity" must not be None."')
if eccentricity is not None:
if hradius is None:
hradius = vradius / sqrt(1 - eccentricity**2)
elif vradius is None:
vradius = hradius * sqrt(1 - eccentricity**2)
if hradius == vradius:
return Circle(center, hradius, **kwargs)
return GeometryEntity.__new__(cls, center, hradius, vradius, **kwargs)
@property
def ambient_dimension(self):
return 2
@property
def center(self):
"""The center of the ellipse.
Returns
=======
center : number
See Also
========
sympy.geometry.point.Point
Examples
========
>>> from sympy import Point, Ellipse
>>> p1 = Point(0, 0)
>>> e1 = Ellipse(p1, 3, 1)
>>> e1.center
Point2D(0, 0)
"""
return self.args[0]
@property
def hradius(self):
"""The horizontal radius of the ellipse.
Returns
=======
hradius : number
See Also
========
vradius, major, minor
Examples
========
>>> from sympy import Point, Ellipse
>>> p1 = Point(0, 0)
>>> e1 = Ellipse(p1, 3, 1)
>>> e1.hradius
3
"""
return self.args[1]
@property
def vradius(self):
"""The vertical radius of the ellipse.
Returns
=======
vradius : number
See Also
========
hradius, major, minor
Examples
========
>>> from sympy import Point, Ellipse
>>> p1 = Point(0, 0)
>>> e1 = Ellipse(p1, 3, 1)
>>> e1.vradius
1
"""
return self.args[2]
@property
def minor(self):
"""Shorter axis of the ellipse (if it can be determined) else vradius.
Returns
=======
minor : number or expression
See Also
========
hradius, vradius, major
Examples
========
>>> from sympy import Point, Ellipse, Symbol
>>> p1 = Point(0, 0)
>>> e1 = Ellipse(p1, 3, 1)
>>> e1.minor
1
>>> a = Symbol('a')
>>> b = Symbol('b')
>>> Ellipse(p1, a, b).minor
b
>>> Ellipse(p1, b, a).minor
a
>>> m = Symbol('m')
>>> M = m + 1
>>> Ellipse(p1, m, M).minor
m
"""
ab = self.args[1:3]
if len(ab) == 1:
return ab[0]
a, b = ab
o = a - b < 0
if o == True:
return a
elif o == False:
return b
return self.vradius
@property
def major(self):
"""Longer axis of the ellipse (if it can be determined) else hradius.
Returns
=======
major : number or expression
See Also
========
hradius, vradius, minor
Examples
========
>>> from sympy import Point, Ellipse, Symbol
>>> p1 = Point(0, 0)
>>> e1 = Ellipse(p1, 3, 1)
>>> e1.major
3
>>> a = Symbol('a')
>>> b = Symbol('b')
>>> Ellipse(p1, a, b).major
a
>>> Ellipse(p1, b, a).major
b
>>> m = Symbol('m')
>>> M = m + 1
>>> Ellipse(p1, m, M).major
m + 1
"""
ab = self.args[1:3]
if len(ab) == 1:
return ab[0]
a, b = ab
o = b - a < 0
if o == True:
return a
elif o == False:
return b
return self.hradius
@property
def area(self):
"""The area of the ellipse.
Returns
=======
area : number
Examples
========
>>> from sympy import Point, Ellipse
>>> p1 = Point(0, 0)
>>> e1 = Ellipse(p1, 3, 1)
>>> e1.area
3*pi
"""
return simplify(S.Pi * self.hradius * self.vradius)
@property
def circumference(self):
"""The circumference of the ellipse.
Examples
========
>>> from sympy import Point, Ellipse
>>> p1 = Point(0, 0)
>>> e1 = Ellipse(p1, 3, 1)
>>> e1.circumference
12*Integral(sqrt((-8*_x**2/9 + 1)/(-_x**2 + 1)), (_x, 0, 1))
"""
from sympy import Integral
if self.eccentricity == 1:
return 2*pi*self.hradius
else:
x = Dummy('x', real=True)
return 4*self.major*Integral(
sqrt((1 - (self.eccentricity*x)**2)/(1 - x**2)), (x, 0, 1))
@property
def eccentricity(self):
"""The eccentricity of the ellipse.
Returns
=======
eccentricity : number
Examples
========
>>> from sympy import Point, Ellipse, sqrt
>>> p1 = Point(0, 0)
>>> e1 = Ellipse(p1, 3, sqrt(2))
>>> e1.eccentricity
sqrt(7)/3
"""
return self.focus_distance / self.major
@property
def periapsis(self):
"""The periapsis of the ellipse.
The shortest distance between the focus and the contour.
Returns
=======
periapsis : number
See Also
========
apoapsis : Returns greatest distance between focus and contour
Examples
========
>>> from sympy import Point, Ellipse
>>> p1 = Point(0, 0)
>>> e1 = Ellipse(p1, 3, 1)
>>> e1.periapsis
-2*sqrt(2) + 3
"""
return self.major * (1 - self.eccentricity)
@property
def apoapsis(self):
"""The apoapsis of the ellipse.
The greatest distance between the focus and the contour.
Returns
=======
apoapsis : number
See Also
========
periapsis : Returns shortest distance between foci and contour
Examples
========
>>> from sympy import Point, Ellipse
>>> p1 = Point(0, 0)
>>> e1 = Ellipse(p1, 3, 1)
>>> e1.apoapsis
2*sqrt(2) + 3
"""
return self.major * (1 + self.eccentricity)
@property
def focus_distance(self):
"""The focale distance of the ellipse.
The distance between the center and one focus.
Returns
=======
focus_distance : number
See Also
========
foci
Examples
========
>>> from sympy import Point, Ellipse
>>> p1 = Point(0, 0)
>>> e1 = Ellipse(p1, 3, 1)
>>> e1.focus_distance
2*sqrt(2)
"""
return Point.distance(self.center, self.foci[0])
@property
def foci(self):
"""The foci of the ellipse.
Notes
-----
The foci can only be calculated if the major/minor axes are known.
Raises
======
ValueError
When the major and minor axis cannot be determined.
See Also
========
sympy.geometry.point.Point
focus_distance : Returns the distance between focus and center
Examples
========
>>> from sympy import Point, Ellipse
>>> p1 = Point(0, 0)
>>> e1 = Ellipse(p1, 3, 1)
>>> e1.foci
(Point2D(-2*sqrt(2), 0), Point2D(2*sqrt(2), 0))
"""
c = self.center
hr, vr = self.hradius, self.vradius
if hr == vr:
return (c, c)
# calculate focus distance manually, since focus_distance calls this
# routine
fd = sqrt(self.major**2 - self.minor**2)
if hr == self.minor:
# foci on the y-axis
return (c + Point(0, -fd), c + Point(0, fd))
elif hr == self.major:
# foci on the x-axis
return (c + Point(-fd, 0), c + Point(fd, 0))
@property
def bounds(self):
"""Return a tuple (xmin, ymin, xmax, ymax) representing the bounding
rectangle for the geometric figure.
"""
h, v = self.hradius, self.vradius
return (self.center.x - h, self.center.y - v, self.center.x + h, self.center.y + v)
[docs] def rotate(self, angle=0, pt=None):
"""Rotate ``angle`` radians counterclockwise about Point ``pt``.
Note: since the general ellipse is not supported, only rotations that
are integer multiples of pi/2 are allowed.
Examples
========
>>> from sympy import Ellipse, pi
>>> Ellipse((1, 0), 2, 1).rotate(pi/2)
Ellipse(Point2D(0, 1), 1, 2)
>>> Ellipse((1, 0), 2, 1).rotate(pi)
Ellipse(Point2D(-1, 0), 2, 1)
"""
if self.hradius == self.vradius:
return self.func(*self.args)
if (angle/S.Pi).is_integer:
return super(Ellipse, self).rotate(angle, pt)
if (2*angle/S.Pi).is_integer:
return self.func(self.center.rotate(angle, pt), self.vradius, self.hradius)
# XXX see https://github.com/sympy/sympy/issues/2815 for general ellipes
raise NotImplementedError('Only rotations of pi/2 are currently supported for Ellipse.')
[docs] def scale(self, x=1, y=1, pt=None):
"""Override GeometryEntity.scale since it is the major and minor
axes which must be scaled and they are not GeometryEntities.
Examples
========
>>> from sympy import Ellipse
>>> Ellipse((0, 0), 2, 1).scale(2, 4)
Circle(Point2D(0, 0), 4)
>>> Ellipse((0, 0), 2, 1).scale(2)
Ellipse(Point2D(0, 0), 4, 1)
"""
c = self.center
if pt:
pt = Point(pt)
return self.translate(*(-pt).args).scale(x, y).translate(*pt.args)
h = self.hradius
v = self.vradius
return self.func(c.scale(x, y), hradius=h*x, vradius=v*y)
[docs] def reflect(self, line):
"""Override GeometryEntity.reflect since the radius
is not a GeometryEntity.
Examples
========
>>> from sympy import Circle, Line
>>> Circle((0, 1), 1).reflect(Line((0, 0), (1, 1)))
Circle(Point2D(1, 0), -1)
>>> from sympy import Ellipse, Line, Point
>>> Ellipse(Point(3, 4), 1, 3).reflect(Line(Point(0, -4), Point(5, 0)))
Traceback (most recent call last):
...
NotImplementedError:
General Ellipse is not supported but the equation of the reflected
Ellipse is given by the zeros of: f(x, y) = (9*x/41 + 40*y/41 +
37/41)**2 + (40*x/123 - 3*y/41 - 364/123)**2 - 1
Notes
=====
Until the general ellipse (with no axis parallel to the x-axis) is
supported a NotImplemented error is raised and the equation whose
zeros define the rotated ellipse is given.
"""
from .util import _uniquely_named_symbol
if line.slope in (0, oo):
c = self.center
c = c.reflect(line)
return self.func(c, -self.hradius, self.vradius)
else:
x, y = [_uniquely_named_symbol(name, self, line) for name in 'xy']
expr = self.equation(x, y)
p = Point(x, y).reflect(line)
result = expr.subs(zip((x, y), p.args
), simultaneous=True)
raise NotImplementedError(filldedent(
'General Ellipse is not supported but the equation '
'of the reflected Ellipse is given by the zeros of: ' +
"f(%s, %s) = %s" % (str(x), str(y), str(result))))
[docs] def encloses_point(self, p):
"""
Return True if p is enclosed by (is inside of) self.
Notes
-----
Being on the border of self is considered False.
Parameters
==========
p : Point
Returns
=======
encloses_point : True, False or None
See Also
========
sympy.geometry.point.Point
Examples
========
>>> from sympy import Ellipse, S
>>> from sympy.abc import t
>>> e = Ellipse((0, 0), 3, 2)
>>> e.encloses_point((0, 0))
True
>>> e.encloses_point(e.arbitrary_point(t).subs(t, S.Half))
False
>>> e.encloses_point((4, 0))
False
"""
p = Point(p)
if p in self:
return False
if len(self.foci) == 2:
# if the combined distance from the foci to p (h1 + h2) is less
# than the combined distance from the foci to the minor axis
# (which is the same as the major axis length) then p is inside
# the ellipse
h1, h2 = [f.distance(p) for f in self.foci]
test = 2*self.major - (h1 + h2)
else:
test = self.radius - self.center.distance(p)
return fuzzy_bool(test.is_positive)
@doctest_depends_on(modules=('pyglet',))
[docs] def tangent_lines(self, p):
"""Tangent lines between `p` and the ellipse.
If `p` is on the ellipse, returns the tangent line through point `p`.
Otherwise, returns the tangent line(s) from `p` to the ellipse, or
None if no tangent line is possible (e.g., `p` inside ellipse).
Parameters
==========
p : Point
Returns
=======
tangent_lines : list with 1 or 2 Lines
Raises
======
NotImplementedError
Can only find tangent lines for a point, `p`, on the ellipse.
See Also
========
sympy.geometry.point.Point, sympy.geometry.line.Line
Examples
========
>>> from sympy import Point, Ellipse
>>> e1 = Ellipse(Point(0, 0), 3, 2)
>>> e1.tangent_lines(Point(3, 0))
[Line(Point2D(3, 0), Point2D(3, -12))]
>>> # This will plot an ellipse together with a tangent line.
>>> from sympy.plotting.pygletplot import PygletPlot as Plot
>>> from sympy import Point, Ellipse
>>> e = Ellipse(Point(0,0), 3, 2)
>>> t = e.tangent_lines(e.random_point())
>>> p = Plot()
>>> p[0] = e # doctest: +SKIP
>>> p[1] = t # doctest: +SKIP
"""
p = Point(p)
if self.encloses_point(p):
return []
if p in self:
delta = self.center - p
rise = (self.vradius ** 2)*delta.x
run = -(self.hradius ** 2)*delta.y
p2 = Point(simplify(p.x + run),
simplify(p.y + rise))
return [Line(p, p2)]
else:
if len(self.foci) == 2:
f1, f2 = self.foci
maj = self.hradius
test = (2*maj -
Point.distance(f1, p) -
Point.distance(f2, p))
else:
test = self.radius - Point.distance(self.center, p)
if test.is_number and test.is_positive:
return []
# else p is outside the ellipse or we can't tell. In case of the
# latter, the solutions returned will only be valid if
# the point is not inside the ellipse; if it is, nan will result.
x, y = Dummy('x'), Dummy('y')
eq = self.equation(x, y)
dydx = idiff(eq, y, x)
slope = Line(p, Point(x, y)).slope
# TODO: Replace solve with solveset, when this line is tested
tangent_points = solve([slope - dydx, eq], [x, y])
# handle horizontal and vertical tangent lines
if len(tangent_points) == 1:
assert tangent_points[0][
0] == p.x or tangent_points[0][1] == p.y
return [Line(p, p + Point(1, 0)), Line(p, p + Point(0, 1))]
# others
return [Line(p, tangent_points[0]), Line(p, tangent_points[1])]
[docs] def is_tangent(self, o):
"""Is `o` tangent to the ellipse?
Parameters
==========
o : GeometryEntity
An Ellipse, LinearEntity or Polygon
Raises
======
NotImplementedError
When the wrong type of argument is supplied.
Returns
=======
is_tangent: boolean
True if o is tangent to the ellipse, False otherwise.
See Also
========
tangent_lines
Examples
========
>>> from sympy import Point, Ellipse, Line
>>> p0, p1, p2 = Point(0, 0), Point(3, 0), Point(3, 3)
>>> e1 = Ellipse(p0, 3, 2)
>>> l1 = Line(p1, p2)
>>> e1.is_tangent(l1)
True
"""
inter = None
if isinstance(o, Ellipse):
inter = self.intersection(o)
if isinstance(inter, Ellipse):
return False
return (inter is not None and len(inter) == 1
and isinstance(inter[0], Point))
elif isinstance(o, LinearEntity):
inter = self._do_line_intersection(o)
if inter is not None and len(inter) == 1:
return inter[0] in o
else:
return False
elif isinstance(o, Polygon):
c = 0
for seg in o.sides:
inter = self._do_line_intersection(seg)
c += len([True for point in inter if point in seg])
return c == 1
else:
raise NotImplementedError("Unknown argument type")
[docs] def normal_lines(self, p, prec=None):
"""Normal lines between `p` and the ellipse.
Parameters
==========
p : Point
Returns
=======
normal_lines : list with 1, 2 or 4 Lines
Examples
========
>>> from sympy import Line, Point, Ellipse
>>> e = Ellipse((0, 0), 2, 3)
>>> c = e.center
>>> e.normal_lines(c + Point(1, 0))
[Line(Point2D(0, 0), Point2D(1, 0))]
>>> e.normal_lines(c)
[Line(Point2D(0, 0), Point2D(0, 1)), Line(Point2D(0, 0), Point2D(1, 0))]
Off-axis points require the solution of a quartic equation. This
often leads to very large expressions that may be of little practical
use. An approximate solution of `prec` digits can be obtained by
passing in the desired value:
>>> e.normal_lines((3, 3), prec=2)
[Line(Point2D(-38/47, -85/31), Point2D(9/47, -21/17)),
Line(Point2D(19/13, -43/21), Point2D(32/13, -8/3))]
Whereas the above solution has an operation count of 12, the exact
solution has an operation count of 2020.
"""
p = Point(p)
# XXX change True to something like self.angle == 0 if the arbitrarily
# rotated ellipse is introduced.
# https://github.com/sympy/sympy/issues/2815)
if True:
rv = []
if p.x == self.center.x:
rv.append(Line(self.center, slope=oo))
if p.y == self.center.y:
rv.append(Line(self.center, slope=0))
if rv:
# at these special orientations of p either 1 or 2 normals
# exist and we are done
return rv
# find the 4 normal points and construct lines through them with
# the corresponding slope
x, y = Dummy('x', real=True), Dummy('y', real=True)
eq = self.equation(x, y)
dydx = idiff(eq, y, x)
norm = -1/dydx
slope = Line(p, (x, y)).slope
seq = slope - norm
# TODO: Replace solve with solveset, when this line is tested
yis = solve(seq, y)[0]
xeq = eq.subs(y, yis).as_numer_denom()[0].expand()
if len(xeq.free_symbols) == 1:
try:
# this is so much faster, it's worth a try
xsol = Poly(xeq, x).real_roots()
except (DomainError, PolynomialError, NotImplementedError):
# TODO: Replace solve with solveset, when these lines are tested
xsol = _nsort(solve(xeq, x), separated=True)[0]
points = [Point(i, solve(eq.subs(x, i), y)[0]) for i in xsol]
else:
raise NotImplementedError(
'intersections for the general ellipse are not supported')
slopes = [norm.subs(zip((x, y), pt.args)) for pt in points]
if prec is not None:
points = [pt.n(prec) for pt in points]
slopes = [i if _not_a_coeff(i) else i.n(prec) for i in slopes]
return [Line(pt, slope=s) for pt,s in zip(points, slopes)]
[docs] def arbitrary_point(self, parameter='t'):
"""A parameterized point on the ellipse.
Parameters
==========
parameter : str, optional
Default value is 't'.
Returns
=======
arbitrary_point : Point
Raises
======
ValueError
When `parameter` already appears in the functions.
See Also
========
sympy.geometry.point.Point
Examples
========
>>> from sympy import Point, Ellipse
>>> e1 = Ellipse(Point(0, 0), 3, 2)
>>> e1.arbitrary_point()
Point2D(3*cos(t), 2*sin(t))
"""
t = _symbol(parameter)
if t.name in (f.name for f in self.free_symbols):
raise ValueError(filldedent('Symbol %s already appears in object '
'and cannot be used as a parameter.' % t.name))
return Point(self.center.x + self.hradius*cos(t),
self.center.y + self.vradius*sin(t))
[docs] def plot_interval(self, parameter='t'):
"""The plot interval for the default geometric plot of the Ellipse.
Parameters
==========
parameter : str, optional
Default value is 't'.
Returns
=======
plot_interval : list
[parameter, lower_bound, upper_bound]
Examples
========
>>> from sympy import Point, Ellipse
>>> e1 = Ellipse(Point(0, 0), 3, 2)
>>> e1.plot_interval()
[t, -pi, pi]
"""
t = _symbol(parameter)
return [t, -S.Pi, S.Pi]
[docs] def random_point(self, seed=None):
"""A random point on the ellipse.
Returns
=======
point : Point
See Also
========
sympy.geometry.point.Point
arbitrary_point : Returns parameterized point on ellipse
Notes
-----
A random point may not appear to be on the ellipse, ie, `p in e` may
return False. This is because the coordinates of the point will be
floating point values, and when these values are substituted into the
equation for the ellipse the result may not be zero because of floating
point rounding error.
Examples
========
>>> from sympy import Point, Ellipse, Segment
>>> e1 = Ellipse(Point(0, 0), 3, 2)
>>> e1.random_point() # gives some random point
Point2D(...)
>>> p1 = e1.random_point(seed=0); p1.n(2)
Point2D(2.1, 1.4)
The random_point method assures that the point will test as being
in the ellipse:
>>> p1 in e1
True
Notes
=====
An arbitrary_point with a random value of t substituted into it may
not test as being on the ellipse because the expression tested that
a point is on the ellipse doesn't simplify to zero and doesn't evaluate
exactly to zero:
>>> from sympy.abc import t
>>> e1.arbitrary_point(t)
Point2D(3*cos(t), 2*sin(t))
>>> p2 = _.subs(t, 0.1)
>>> p2 in e1
False
Note that arbitrary_point routine does not take this approach. A value
for cos(t) and sin(t) (not t) is substituted into the arbitrary point.
There is a small chance that this will give a point that will not
test as being in the ellipse, so the process is repeated (up to 10
times) until a valid point is obtained.
"""
from sympy import sin, cos, Rational
t = _symbol('t')
x, y = self.arbitrary_point(t).args
# get a random value in [-1, 1) corresponding to cos(t)
# and confirm that it will test as being in the ellipse
if seed is not None:
rng = random.Random(seed)
else:
rng = random
for i in range(10): # should be enough?
# simplify this now or else the Float will turn s into a Float
c = 2*Rational(rng.random()) - 1
s = sqrt(1 - c**2)
p1 = Point(x.subs(cos(t), c), y.subs(sin(t), s))
if p1 in self:
return p1
raise GeometryError(
'Having problems generating a point in the ellipse.')
[docs] def equation(self, x='x', y='y'):
"""The equation of the ellipse.
Parameters
==========
x : str, optional
Label for the x-axis. Default value is 'x'.
y : str, optional
Label for the y-axis. Default value is 'y'.
Returns
=======
equation : sympy expression
See Also
========
arbitrary_point : Returns parameterized point on ellipse
Examples
========
>>> from sympy import Point, Ellipse
>>> e1 = Ellipse(Point(1, 0), 3, 2)
>>> e1.equation()
y**2/4 + (x/3 - 1/3)**2 - 1
"""
x = _symbol(x)
y = _symbol(y)
t1 = ((x - self.center.x) / self.hradius)**2
t2 = ((y - self.center.y) / self.vradius)**2
return t1 + t2 - 1
def _do_line_intersection(self, o):
"""
Find the intersection of a LinearEntity and the ellipse.
All LinearEntities are treated as a line and filtered at
the end to see that they lie in o.
"""
hr_sq = self.hradius ** 2
vr_sq = self.vradius ** 2
lp = o.points
ldir = lp[1] - lp[0]
diff = lp[0] - self.center
mdir = Point(ldir.x/hr_sq, ldir.y/vr_sq)
mdiff = Point(diff.x/hr_sq, diff.y/vr_sq)
a = ldir.dot(mdir)
b = ldir.dot(mdiff)
c = diff.dot(mdiff) - 1
det = simplify(b*b - a*c)
result = []
if det == 0:
t = -b / a
result.append(lp[0] + (lp[1] - lp[0]) * t)
# Definite and potential symbolic intersections are allowed.
elif (det > 0) != False:
root = sqrt(det)
t_a = (-b - root) / a
t_b = (-b + root) / a
result.append( lp[0] + (lp[1] - lp[0]) * t_a )
result.append( lp[0] + (lp[1] - lp[0]) * t_b )
return [r for r in result if r in o]
def _do_ellipse_intersection(self, o):
"""The intersection of an ellipse with another ellipse or a circle.
Private helper method for `intersection`.
"""
x = Dummy('x', real=True)
y = Dummy('y', real=True)
seq = self.equation(x, y)
oeq = o.equation(x, y)
# TODO: Replace solve with solveset, when this line is tested
result = solve([seq, oeq], [x, y])
return [Point(*r) for r in list(uniq(result))]
[docs] def intersection(self, o):
"""The intersection of this ellipse and another geometrical entity
`o`.
Parameters
==========
o : GeometryEntity
Returns
=======
intersection : list of GeometryEntity objects
Notes
-----
Currently supports intersections with Point, Line, Segment, Ray,
Circle and Ellipse types.
See Also
========
sympy.geometry.entity.GeometryEntity
Examples
========
>>> from sympy import Ellipse, Point, Line, sqrt
>>> e = Ellipse(Point(0, 0), 5, 7)
>>> e.intersection(Point(0, 0))
[]
>>> e.intersection(Point(5, 0))
[Point2D(5, 0)]
>>> e.intersection(Line(Point(0,0), Point(0, 1)))
[Point2D(0, -7), Point2D(0, 7)]
>>> e.intersection(Line(Point(5,0), Point(5, 1)))
[Point2D(5, 0)]
>>> e.intersection(Line(Point(6,0), Point(6, 1)))
[]
>>> e = Ellipse(Point(-1, 0), 4, 3)
>>> e.intersection(Ellipse(Point(1, 0), 4, 3))
[Point2D(0, -3*sqrt(15)/4), Point2D(0, 3*sqrt(15)/4)]
>>> e.intersection(Ellipse(Point(5, 0), 4, 3))
[Point2D(2, -3*sqrt(7)/4), Point2D(2, 3*sqrt(7)/4)]
>>> e.intersection(Ellipse(Point(100500, 0), 4, 3))
[]
>>> e.intersection(Ellipse(Point(0, 0), 3, 4))
[Point2D(-363/175, -48*sqrt(111)/175), Point2D(-363/175, 48*sqrt(111)/175), Point2D(3, 0)]
>>> e.intersection(Ellipse(Point(-1, 0), 3, 4))
[Point2D(-17/5, -12/5), Point2D(-17/5, 12/5), Point2D(7/5, -12/5), Point2D(7/5, 12/5)]
"""
if isinstance(o, Point):
if o in self:
return [o]
else:
return []
elif isinstance(o, LinearEntity):
# LinearEntity may be a ray/segment, so check the points
# of intersection for coincidence first
return self._do_line_intersection(o)
elif isinstance(o, Circle):
return self._do_ellipse_intersection(o)
elif isinstance(o, Ellipse):
if o == self:
return self
else:
return self._do_ellipse_intersection(o)
return o.intersection(self)
[docs] def evolute(self, x='x', y='y'):
"""The equation of evolute of the ellipse.
Parameters
==========
x : str, optional
Label for the x-axis. Default value is 'x'.
y : str, optional
Label for the y-axis. Default value is 'y'.
Returns
=======
equation : sympy expression
Examples
========
>>> from sympy import Point, Ellipse
>>> e1 = Ellipse(Point(1, 0), 3, 2)
>>> e1.evolute()
2**(2/3)*y**(2/3) + (3*x - 3)**(2/3) - 5**(2/3)
"""
if len(self.args) != 3:
raise NotImplementedError('Evolute of arbitrary Ellipse is not supported.')
x = _symbol(x)
y = _symbol(y)
t1 = (self.hradius*(x - self.center.x))**Rational(2, 3)
t2 = (self.vradius*(y - self.center.y))**Rational(2, 3)
return t1 + t2 - (self.hradius**2 - self.vradius**2)**Rational(2, 3)
def __eq__(self, o):
"""Is the other GeometryEntity the same as this ellipse?"""
return isinstance(o, GeometryEntity) and (self.center == o.center and
self.hradius == o.hradius and
self.vradius == o.vradius)
def __hash__(self):
return super(Ellipse, self).__hash__()
def __contains__(self, o):
if isinstance(o, Point):
x = Dummy('x', real=True)
y = Dummy('y', real=True)
res = self.equation(x, y).subs({x: o.x, y: o.y})
return trigsimp(simplify(res)) is S.Zero
elif isinstance(o, Ellipse):
return self == o
return False
def _svg(self, scale_factor=1., fill_color="#66cc99"):
"""Returns SVG ellipse element for the Ellipse.
Parameters
==========
scale_factor : float
Multiplication factor for the SVG stroke-width. Default is 1.
fill_color : str, optional
Hex string for fill color. Default is "#66cc99".
"""
from sympy.core.evalf import N
c = N(self.center)
h, v = N(self.hradius), N(self.vradius)
return (
'<ellipse fill="{1}" stroke="#555555" '
'stroke-width="{0}" opacity="0.6" cx="{2}" cy="{3}" rx="{4}" ry="{5}"/>'
).format(2. * scale_factor, fill_color, c.x, c.y, h, v)
[docs]class Circle(Ellipse):
"""A circle in space.
Constructed simply from a center and a radius, or from three
non-collinear points.
Parameters
==========
center : Point
radius : number or sympy expression
points : sequence of three Points
Attributes
==========
radius (synonymous with hradius, vradius, major and minor)
circumference
equation
Raises
======
GeometryError
When trying to construct circle from three collinear points.
When trying to construct circle from incorrect parameters.
See Also
========
Ellipse, sympy.geometry.point.Point
Examples
========
>>> from sympy.geometry import Point, Circle
>>> # a circle constructed from a center and radius
>>> c1 = Circle(Point(0, 0), 5)
>>> c1.hradius, c1.vradius, c1.radius
(5, 5, 5)
>>> # a circle costructed from three points
>>> c2 = Circle(Point(0, 0), Point(1, 1), Point(1, 0))
>>> c2.hradius, c2.vradius, c2.radius, c2.center
(sqrt(2)/2, sqrt(2)/2, sqrt(2)/2, Point2D(1/2, 1/2))
"""
def __new__(cls, *args, **kwargs):
c, r = None, None
if len(args) == 3:
args = [Point(a) for a in args]
if Point.is_collinear(*args):
raise GeometryError(
"Cannot construct a circle from three collinear points")
from .polygon import Triangle
t = Triangle(*args)
c = t.circumcenter
r = t.circumradius
elif len(args) == 2:
# Assume (center, radius) pair
c = Point(args[0])
r = sympify(args[1])
if not (c is None or r is None):
return GeometryEntity.__new__(cls, c, r, **kwargs)
raise GeometryError("Circle.__new__ received unknown arguments")
@property
def radius(self):
"""The radius of the circle.
Returns
=======
radius : number or sympy expression
See Also
========
Ellipse.major, Ellipse.minor, Ellipse.hradius, Ellipse.vradius
Examples
========
>>> from sympy import Point, Circle
>>> c1 = Circle(Point(3, 4), 6)
>>> c1.radius
6
"""
return self.args[1]
@property
def vradius(self):
"""
This Ellipse property is an alias for the Circle's radius.
Whereas hradius, major and minor can use Ellipse's conventions,
the vradius does not exist for a circle. It is always a positive
value in order that the Circle, like Polygons, will have an
area that can be positive or negative as determined by the sign
of the hradius.
Examples
========
>>> from sympy import Point, Circle
>>> c1 = Circle(Point(3, 4), 6)
>>> c1.vradius
6
"""
return abs(self.radius)
@property
def circumference(self):
"""The circumference of the circle.
Returns
=======
circumference : number or SymPy expression
Examples
========
>>> from sympy import Point, Circle
>>> c1 = Circle(Point(3, 4), 6)
>>> c1.circumference
12*pi
"""
return 2 * S.Pi * self.radius
[docs] def equation(self, x='x', y='y'):
"""The equation of the circle.
Parameters
==========
x : str or Symbol, optional
Default value is 'x'.
y : str or Symbol, optional
Default value is 'y'.
Returns
=======
equation : SymPy expression
Examples
========
>>> from sympy import Point, Circle
>>> c1 = Circle(Point(0, 0), 5)
>>> c1.equation()
x**2 + y**2 - 25
"""
x = _symbol(x)
y = _symbol(y)
t1 = (x - self.center.x)**2
t2 = (y - self.center.y)**2
return t1 + t2 - self.major**2
[docs] def intersection(self, o):
"""The intersection of this circle with another geometrical entity.
Parameters
==========
o : GeometryEntity
Returns
=======
intersection : list of GeometryEntities
Examples
========
>>> from sympy import Point, Circle, Line, Ray
>>> p1, p2, p3 = Point(0, 0), Point(5, 5), Point(6, 0)
>>> p4 = Point(5, 0)
>>> c1 = Circle(p1, 5)
>>> c1.intersection(p2)
[]
>>> c1.intersection(p4)
[Point2D(5, 0)]
>>> c1.intersection(Ray(p1, p2))
[Point2D(5*sqrt(2)/2, 5*sqrt(2)/2)]
>>> c1.intersection(Line(p2, p3))
[]
"""
if isinstance(o, Circle):
if o.center == self.center:
if o.radius == self.radius:
return o
return []
dx, dy = (o.center - self.center).args
d = sqrt(simplify(dy**2 + dx**2))
R = o.radius + self.radius
if d > R or d < abs(self.radius - o.radius):
return []
a = simplify((self.radius**2 - o.radius**2 + d**2) / (2*d))
x2 = self.center.x + (dx * a/d)
y2 = self.center.y + (dy * a/d)
h = sqrt(simplify(self.radius**2 - a**2))
rx = -dy * (h/d)
ry = dx * (h/d)
xi_1 = simplify(x2 + rx)
xi_2 = simplify(x2 - rx)
yi_1 = simplify(y2 + ry)
yi_2 = simplify(y2 - ry)
ret = [Point(xi_1, yi_1)]
if xi_1 != xi_2 or yi_1 != yi_2:
ret.append(Point(xi_2, yi_2))
return ret
return Ellipse.intersection(self, o)
[docs] def scale(self, x=1, y=1, pt=None):
"""Override GeometryEntity.scale since the radius
is not a GeometryEntity.
Examples
========
>>> from sympy import Circle
>>> Circle((0, 0), 1).scale(2, 2)
Circle(Point2D(0, 0), 2)
>>> Circle((0, 0), 1).scale(2, 4)
Ellipse(Point2D(0, 0), 2, 4)
"""
c = self.center
if pt:
pt = Point(pt)
return self.translate(*(-pt).args).scale(x, y).translate(*pt.args)
c = c.scale(x, y)
x, y = [abs(i) for i in (x, y)]
if x == y:
return self.func(c, x*self.radius)
h = v = self.radius
return Ellipse(c, hradius=h*x, vradius=v*y)
[docs] def reflect(self, line):
"""Override GeometryEntity.reflect since the radius
is not a GeometryEntity.
Examples
========
>>> from sympy import Circle, Line
>>> Circle((0, 1), 1).reflect(Line((0, 0), (1, 1)))
Circle(Point2D(1, 0), -1)
"""
c = self.center
c = c.reflect(line)
return self.func(c, -self.radius)
from .polygon import Polygon


Data Scientist @ Stitch Fix
GitHubCode for fun
BlogsLearn for Life
InstgramRecord for Past
Operations Research @ Columbia Univeristy
Aerospace Eng. @ UM, Ann Arbor
Electrical and Computer Eng. @ SJTU


DimSumJS
Next meetup
The next DimSumJS will take place at the end of November.
If you have any questions, please ask them on the GitHub issue.
What's all this then?
DimSumJS is an informal lunchtime meetup for JavaScript developers to eat delicious dim sum and discuss the pressing issues of the day.
Callbacks vs promises (fibers, wat), semi-colons vs no semi-colons, es6 modules, whatever controversy is engulfing the node.js community this week, etc.
Where do you meet?
Currently there's a meetup in Chinatown, Central London. Others may follow.
How does it work?
Grab a ticket when a meetup is announced, then we'll book a table. On the day everyone turns up and chooses enough dishes to fill the table, we share the food and then split the bill at the end.
How much will I spend?
Typically everyone picks two-three dishes each which with tea comes to about £10 including tip.
But I'm rubbish at JavaScript
So was everyone once, no-one will mind. If you've got an interest in JavaScript and you like dim sum, this is the meetup for you.
I'm sold, where do I sign up?
Meetups will be announced on the GitHub repo as issues - watch the repo to be notified of new meetups.
But I'm not in Central London
Watch the repository for your nearest location to find out when the next meetup is. Maybe start one if you've got a good dim sum place nearby?
This all sounds a lot like SushiJS
Yes it does. We applaud SushiJS and thank them for paving the way, but although sushi is delicious sometimes you just want little hot steamed parcels of joy.


's Homepage
Information
Username:
Email Address:
Age:
Cash:
Add credit to your account:
Money amount:
Add


Catalytic converter thefts increase tenfold in 2019
Part contains precious metals which can be sold separately
Thefts of catalytic converters have increased tenfold from the beginning of the year, according to new insurance data.
Data compiled by AA insurance services found that in January 2019, eight vehicles had their catalytic converters stolen compared to 79 which were stolen during October.
Some drivers were severely unlucky and had their catalytic converters stolen twice which required them to make two separate insurance claims.
Despite catalytic converter thefts making up a small proportion of insurance claims as a whole, the number of instances has been on the increase since January 2018.
March 2018, for instance, saw three catalytic converters stolen whereas a year later in 2019, this had increased to 10. April was another month with a significant increase from two thefts in 2018 to 19 in 2019.
Janet Connor, managing director for AA insurance services says; “A tenfold increase in claims for catalytic converters due to theft is a shocking revelation.
“Criminals are being bold and brash by stealing converters in broad daylight, as they believe passers-by won’t question someone tinkering underneath a car.
“Where possible, drivers should park in a garage or in a well-lit area. Manufacturers have also developed anti-theft devices which can be attached to the fixings and give the converter a unique serial number. Concerned drivers should contact their dealer for further information.
“Scrap dealers and online auction sites have a role to play too, by making appropriate checks to ensure the parts being sold or scrapped have not been illegally gained.”
Catalytic converters are removed from vehicles because they contain precious metals such as palladium, rhodium and platinum. As a result, they are often sold for strong scrap values or traded privately.


Custom excerpt separator
Custom excerpt separator
Welcome to the 4th post on cobalt.rs!
Something below the separator.


iOS 10.2.1 Jailbreak "Saïgon" Released
A jailbreak for iOS 10.2.1 has finally arrived, after 7 and a half months, dubbed "Saïgon"
This jailbreak is still in beta!
It uses exploits from well-known iOS developers, including Ian Beer, Adam Donenfeld and Luca Todesco.
The exploit works on all 64-bit devices, including the iPhone 7 and iPhone 7 Plus, and uses the KPP bypass from extra_recipe, making it compatible with Apple A10 devices.
It's semi-untethered, meaning it requires you to launch the app to jailbreak your device upon every reboot.
Supported Devices
- iPhone SE (10.2.1)
- iPhone 6/Plus (10.2.1)
- iPhone 6s/Plus (10.2.1)
- iPad Mini 4 (10.2.1) (Not tested)
- iPad Air 2 (10.2.1)
- iPhone 6s (10.3.1) (not yet)
Installation
- Download the .ipa file and Cydia Impactor
- Open Cydia Impactor and connect your device
-
Drag the
Saïgon.ipa
file onto the Cydia Impactor window - Enter your Apple ID (Email and Password)
- Open Settings → General → Profiles & Device Management
- Trust the new certificate and open Saïgon
- Tap 'Jailbreak' and enjoy!


Welcome to we_create's website! We are a small Arduino user group based in Collegedale, Tennessee. We host collaborative projects that we post on the Arduino project hub, Arduino IDE development, occasional group meetups, product reviews, and more. We put our main focus on offering tutorials, building with the IoT, and helping our environment with the use of Arduino, although we also use participate in robotics and smart home building.
We use mostly Arduino, although sometimes we will hook it up with other hardware such as Raspberry Pi, Amazon Echo and other Alexa-compatible items, ESP8266's, and more. Our goal is to help the world become a better place through Arduino while keeping in line with the Arduino User Groups Manifesto.
To learn more about Arduino, click here. To learn more about Arduino User Groups, click here. To see our some of our awesome projects, click here. To see our boss tutorials, click here. For our blog (which is the bomb-diggity), click here. If you have any questions (or money), click here.
Thanks for visiting, and enjoy!


Families In the Wild: A Kinship Recognition Benchmark
Download
If FIW is used or found useful please cite related Publications.
Please fill out registration and agree to terms for download link
https://forms.gle/w1FBVX9YWheHs6VB7
FIW README can be found on Github https://github.com/visionjo/fiw
Terms of Use
By downloading the image data you agree to the following terms:
Please email questions, comments, bugs, ideas to Joseph Robinson.
- You will use the data only for non-commercial research and educational purposes.
- You will NOT distribute the above images.
- Northeastern University makes no representations or warranties regarding the data, including but not limited to warranties of non-infringement or fitness for a particular purpose.
- You accept full responsibility for your use of the data and shall defend and indemnify Northeastern University, including its employees, officers and agents, against any and all claims arising from your use of the data, including but not limited to your use of any copies of copyrighted images that you may create from the data.
Please email questions, comments, bugs, ideas to Joseph Robinson.


DICE search for user made level pitches, here is my own level pitch.
Let me hear what you think. I already sent this to DICE.
high-ashes.pdf
xXJumpyXx
Helping Hand
My eyes hurt, too much light grey and white colours.
I could see this map in BF3 for sure, but with some other colours added. The current maps are all so bright and sunny, BF3 needs darker maps or maps with some colour variations.


All linebreaks are replaced with \r\n and the end of the header is replaced with \r\n\r\n.
An HTTP response will only be included if the HTTP response header field is populated.


A replacement for process.exit that ensures stdio are fully drained before exiting.
To make a long story short, if process.exit
is called on Windows, script output is often truncated when pipe-redirecting stdout
or stderr
. This module attempts to work around this issue by waiting until those streams have been completely drained before actually calling process.exit
.
See Node.js issue #3584 for further reference.
Tested in OS X 10.8, Windows 7 on Node.js 0.8.25 and 0.10.18.
Based on some code by @vladikoff.
Install the module with: npm install exit
```javascript var exit = require(‘exit’);
// These lines should appear in the output, EVEN ON WINDOWS. console.log(“omg”); console.error(“yay”);
// process.exit(5); exit(5);
// These lines shouldn’t appear in the output. console.log(“wtf”); console.error(“bro”); ```
In Windows, clone the repo and cd to the test\fixtures
directory. The only difference between log.js and log-broken.js is that the former uses exit
while the latter calls process.exit
directly.
This test was done using cmd.exe, but you can see the same results using | grep "std"
in either PowerShell or git-bash.
``` C:\node-exit\test\fixtures>node log.js 0 10 stdout stderr 2>&1 | find “std” stdout 0 stderr 0 stdout 1 stderr 1 stdout 2 stderr 2 stdout 3 stderr 3 stdout 4 stderr 4 stdout 5 stderr 5 stdout 6 stderr 6 stdout 7 stderr 7 stdout 8 stderr 8 stdout 9 stderr 9
| C:\node-exit\test\fixtures>node log-broken.js 0 10 stdout stderr 2>&1 | find “std” |
C:\node-exit\test\fixtures> ```
In lieu of a formal styleguide, take care to maintain the existing coding style. Add unit tests for any new or changed functionality. Lint and test your code using Grunt.
2013-11-26 - v0.1.2 - Fixed a bug with hanging processes.
2013-09-26 - v0.1.1 - Fixed some bugs. It seems to actually work now!
2013-09-20 - v0.1.0 - Initial release.
Copyright (c) 2013 “Cowboy” Ben Alman
Licensed under the MIT license.


Background
I was a straight A student back in high school and at least the stereotype for me was that taking as many AP Classes as possible and getting good grades in them meant that I was smart. For me doing more and doing well was a sense of satisfaction. I came into my freshman year at Berkeley with the same mindset. I was at a school with some of the brightest kids in the country and I needed to somehow set myself apart from everyone. Many times I heard sayings like
“Take your first semester at Berkeley easy, it’s a big adjustment and a different rigor” - random Berkeley student
I would then proceed to look at all the averages of classes I was gonna take on Berkeley Time and scoff at people getting Bs or B+s in these classes. I’ve always been above average and what was to change in college. Oh how wrong I was


Photobox
CSS3 image gallery jQuery plugin
A lightweight image gallery modal window script which uses only CSS3 for silky-smooth animations and transitions, utilizes GPU rending, which can be completely controlled and themed directly from the CSS.
Supports: Firefox, Chrome and IE8+
(This plugin has nothing to do with Flickr)
Github project page


Independent Candidate Wins Yaroslavl Mayoral Race | Russia | RIA ...
Apr 2, 2012 . Yevgeny Urlashov, an independent candidate, won Sunday's . by the winning candidate exceeds the legal limit by 10 percent or more, the .
http://en.rian.ru/russia/20120402/172551700.html
Treatment for Herniated or Bulging Discs
Statement of Preliminary Findings and Conclusions - OSCE
Russian Federation, Presidential Election 4 March 2012 . Also, overly restrictive candidate registration requirements limited genuine . The corresponding provisions of the law disadvantage independent candidates and are not in .
http://www.osce.org/odihr/88667
Russia's Local Elections: Politics in Spite of Putin | World Affairs ...
Protests and parliamentary elections in Russia loosened the Kremlin's grip on . and financial pressure from the executive, this requirement gives Moscow ample . a ban on independent candidatesanother decision that the new federal law .
http://www.worldaffairsjournal.org/article/russia%E2%80%99s-local-elections-politics-spite-putin
legal requirements independent candidate russia Herniated or Bulging Discs
Super PAC - The New York Times
Oct 17, 2012 . Mayor Michael R. Bloomberg of New York, a billionaire and registered independent, will back candidates in close . three of his biggest policy initiatives: legalizing same-sex marriage, . Book Details American Minutiae for Russians . Loss of conservation requirements could lead to the destruction of .
http://www.nytimes.com/2012/10/18/nyregion/bloomberg-forming-super-pac-to-influence-2012-races.html
Independent candidate beats United Russia's man RT
Mar 19, 2012 . An independent candidate has beaten his United Russia rival to become the mayor of Togliatti.
http://rt.com/news/prime-time/united-russia-elections-fail-912/
Official Impairment Listing for Spinal Disorders
Parties and Candidates ACE Electoral Knowledge Network
Many legal frameworks allow persons to register and contest the elections even if they are . The role of independent candidates is more important in countries with . Even if the procedural requirements for gaining access to the ballot are the .
http://aceproject.org/ace-en/topics/pc/onePage
- online spanish christmas music (narrowing of the spine)
Unfair requirements for independent candidates - The Denver Post
Jan 6, 2010 . Unfair requirements for independent candidates. If you belong to a . But under Colorado law, the only way the candidates could be placed on the Nov. 2, 2010 . Russian premier jokes about secret files on aliens · Gun turns .
http://www.denverpost.com/opinion/ci_14128446Russia: The New Struggle With Putin - The New York Review of Books
Oct 10, 2012 . With voters in seventy-three of Russia's eighty-three regions going to . Meanwhile, the new law on elections for governors has introduced a requirement for . In another case, a promising, seemingly independent candidate, .
http://www.nybooks.com/blogs/nyrblog/2012/oct/10/russia-new-struggle-putin/
Independent candidate: is it legal or not? « Democracy and Society
Aug 10, 2012 . In order to become a legal Deputy Candidate, they have to be . date at the last minute; some require the candidate to be a Party member. . Scholars and Independent Candidates argue that those local . Select Category, Africa (171), Asia and Pacific (78), Europe and Russia (75), Latin America (27) .
http://www.democracyandsociety.com/blog/2012/08/10/independent-candidate-is-it-legal-or-not/
Medical-Vocational Allowance for Herniated Disc
How to run for the Russian presidency - Russian Elections - Al ...
Feb 28, 2012 . This ruled out the aspiring independent candidate Nicolai Levashov. . The legal requirements are the easy part, according Grigorii Golosov, .
http://www.aljazeera.com/indepth/features/2012/02/201222192724794518.html
Independent (politician) - Wikipedia, the free encyclopedia
In contesting elections, independent candidates are required by law to spend less . Former president Dmitry Medvedev was offered to join United Russia but .
http://en.wikipedia.org/wiki/Independent_(politician)
Appealing a Denial of Benefits
How the Presidential Electoral System Works - Russia Votes
Mar 1, 2012 . Putin's decision satisfied the formal requirement of Russia's . Other legally registered parties can nominate candidates within the same time scale and . In 2008 eleven independent candidates registered supporters' groups.
http://www.russiavotes.org/president/presidency_electoral_system.php