<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=80.202.0.0%2F16</id>
	<title>formulasearchengine - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=80.202.0.0%2F16"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/wiki/Special:Contributions/80.202.0.0/16"/>
	<updated>2026-07-09T04:57:49Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Relative_permeability&amp;diff=252496</id>
		<title>Relative permeability</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Relative_permeability&amp;diff=252496"/>
		<updated>2014-07-23T23:03:16Z</updated>

		<summary type="html">&lt;p&gt;80.202.201.13: /* LET-type */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Marvella is what you can contact her but it&#039;s not the most feminine title out there. Managing individuals is what I do and the salary has been truly satisfying. One of the things she loves most is to do aerobics and now she is attempting to make cash with it. Years ago we moved to North Dakota.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Feel free to surf to my web page - [http://javly.com/?p=56362 javly.com]&lt;/div&gt;</summary>
		<author><name>80.202.201.13</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=River_delta&amp;diff=225051</id>
		<title>River delta</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=River_delta&amp;diff=225051"/>
		<updated>2014-03-02T19:05:34Z</updated>

		<summary type="html">&lt;p&gt;80.202.213.4: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;It is very common to have a dental emergency -- a fractured tooth, an abscess, or severe pain when chewing. Over-the-counter pain medication is just masking the problem. Seeing an emergency dentist is critical to getting the source of the problem diagnosed and corrected as soon as possible.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Here are some common dental emergencies:&amp;lt;br&amp;gt;Toothache: The most common dental emergency. This generally means a badly decayed tooth. As the pain affects the tooth&#039;s nerve, treatment involves gently removing any debris lodged in the cavity being careful not to poke deep as this will cause severe pain if the nerve is touched. Next rinse vigorously with warm water. Then soak a small piece of cotton in oil of cloves and insert it in the cavity. This will give temporary relief until a dentist can be reached.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;At times the pain may have a more obscure location such as decay under an old filling. As this can be only corrected by a dentist there are two things you can do to help the pain. Administer a pain pill (aspirin or some other analgesic) internally or dissolve a tablet in a half glass (4 oz) of warm water holding it in the mouth for several minutes before spitting it out. DO NOT PLACE A WHOLE TABLET OR ANY PART OF IT IN THE TOOTH OR AGAINST THE SOFT GUM TISSUE AS IT WILL RESULT IN A NASTY BURN.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Swollen Jaw: This may be caused by several conditions the most probable being an abscessed tooth. In any case the treatment should be to reduce pain and swelling. An ice pack held on the outside of the jaw, (ten minutes on and ten minutes off) will take care of both. If this does not control the pain, an analgesic tablet can be given every four hours.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Other Oral Injuries: Broken teeth, cut lips, bitten tongue or lips if severe means a trip to a dentist as soon as possible. In the mean time rinse the mouth with warm water and place cold compression the face opposite the injury. If there is a lot of bleeding, apply direct pressure to the bleeding area. If bleeding does not stop get patient to the emergency room of a hospital as stitches may be necessary.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Prolonged Bleeding Following Extraction: Place a gauze pad or better still a moistened tea bag over the socket and have the patient bite down gently on it for 30 to 45 minutes. The tannic acid in the tea seeps into the tissues and often helps stop the bleeding. If bleeding continues after two hours, call the dentist or take patient to the emergency room of the nearest hospital.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Broken Jaw: If you suspect the patient&#039;s jaw is broken, bring the upper and lower teeth together. Put a necktie, handkerchief or towel under the chin, tying it over the head to immobilize the jaw until you can get the patient to a dentist or the emergency room of a hospital.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Painful Erupting Tooth: In young children teething pain can come from a loose baby tooth or from an erupting permanent tooth. Some relief can be given by crushing a little ice and wrapping it in gauze or a clean piece of cloth and putting it directly on the tooth or gum tissue where it hurts. The numbing effect of the cold, along with an appropriate dose of aspirin, usually provides temporary relief.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;In young adults, an erupting 3rd molar (Wisdom tooth), especially if it is impacted, can cause the jaw to swell and be quite painful. Often the gum around the tooth will show signs of infection. Temporary relief can be had by giving aspirin or some other painkiller and by dissolving an aspirin in half a glass of warm water and holding this solution in the mouth over the sore gum. AGAIN DO NOT PLACE A TABLET DIRECTLY OVER THE GUM OR CHEEK OR USE THE ASPIRIN SOLUTION ANY STRONGER THAN RECOMMENDED TO PREVENT BURNING THE TISSUE. The swelling of the jaw can be reduced by using an ice pack on the outside of the face at intervals of ten minutes on and ten minutes off.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;If you have any kind of inquiries concerning where and how you can make use of [http://www.youtube.com/watch?v=90z1mmiwNS8 dentist DC], you could contact us at our webpage.&lt;/div&gt;</summary>
		<author><name>80.202.213.4</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Hypot&amp;diff=23048</id>
		<title>Hypot</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Hypot&amp;diff=23048"/>
		<updated>2013-10-31T01:56:43Z</updated>

		<summary type="html">&lt;p&gt;80.202.214.27: Added javascript to list of programming languages&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:Osipkov-Merritt-Models.jpg|thumb|200px|Osipkov-Merritt distribution functions, derived from galaxy models obeying [[Jaffe&#039;s law]] in the density. The isotropic model, &amp;lt;math&amp;gt;f=f(E)&amp;lt;/math&amp;gt;, is plotted with the heavy line.]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Osipkov–Merritt models&#039;&#039;&#039; (named for Leonid Osipkov and [[David Merritt]]) are mathematical representations of spherical stellar systems ([[galaxies]], [[star clusters]], [[globular clusters]] etc.).  The Osipkov-Merritt formula generates a one-parameter family of [[phase-space]] [[distribution function]]s that reproduce a specified density profile (representing stars) in a specified gravitational potential (in which the stars move). The density and potential need not be self-consistently related.  &lt;br /&gt;
A free parameter adjusts the degree of velocity anisotropy, from [[isotropic]] to completely [[wikt:radial|radial]] motions.  The method is a generalization of [[Eddington&#039;s formula]]&amp;lt;ref&amp;gt;[[Arthur Eddington|Eddington, A.]] (1916), [http://adsabs.harvard.edu/abs/1916MNRAS..76..572E  The distribution of stars in globular clusters,] &#039;&#039;Mon. Not. R. Astron. Soc.&#039;&#039;, &#039;&#039;&#039;76&#039;&#039;&#039;, 572&amp;lt;/ref&amp;gt;  for constructing isotropic spherical models. &lt;br /&gt;
&lt;br /&gt;
The method was derived independently by its two eponymous discoverers.&amp;lt;ref&amp;gt;Osipkov, L. P. (1979), [http://adsabs.harvard.edu/abs/1979PAZh....5...77O  Spherical systems of gravitating bodies with an ellipsoidal velocity distribution,] &#039;&#039;Pis&#039;ma v Astron. Zhur.&#039;&#039;, &#039;&#039;&#039;5&#039;&#039;&#039;, 77&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;Merritt&amp;quot;&amp;gt;[[David Merritt|Merritt, D.]] (1985), [http://adsabs.harvard.edu/abs/1985AJ.....90.1027M  Spherical stellar systems with spheroidal velocity distributions,] &#039;&#039;Astron. J.&#039;&#039;, &#039;&#039;&#039;90&#039;&#039;&#039;, 1027&amp;lt;/ref&amp;gt; The latter derivation includes two additional families of models (Type IIa, b) with tangentially anisotropic motions.&lt;br /&gt;
&lt;br /&gt;
==Derivation==&lt;br /&gt;
&lt;br /&gt;
According to [[Jeans&#039;s theorem]], the [[phase-space]] density of stars &#039;&#039;f&#039;&#039; must be expressible in terms of the isolating [[integrals of motion]], which in a spherical stellar system are the [[energy]] &#039;&#039;E&#039;&#039; and the [[angular momentum]] &#039;&#039;J&#039;&#039;. The Osipkov-Merritt &#039;&#039;[[ansatz]]&#039;&#039; is&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;f = f(Q) = f(E+J^2/2r_a^2)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &#039;&#039;r&amp;lt;sub&amp;gt;a&amp;lt;/sub&amp;gt;&#039;&#039;, the &amp;quot;anisotropy radius&amp;quot;, is a free parameter. This &#039;&#039;ansatz&#039;&#039; implies that &#039;&#039;f&#039;&#039; is constant on spheroids in velocity space since&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
2Q = v_r^2 + (1+r^2/r_a^2)v_t^2 + 2\Phi(r)&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
where &#039;&#039;v&#039;&#039;&amp;lt;sub&amp;gt;r&amp;lt;/sub&amp;gt;, &#039;&#039;v&#039;&#039;&amp;lt;sub&amp;gt;t&amp;lt;/sub&amp;gt; are velocity components parallel and perpendicular to the radius vector &#039;&#039;r&#039;&#039; and Φ(&#039;&#039;r&#039;&#039;) is the [[gravitational potential]].&lt;br /&gt;
&lt;br /&gt;
The density &#039;&#039;ρ&#039;&#039; is the integral over velocities of &#039;&#039;f&#039;&#039;:&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\rho(r) = 2\pi\int\int f(E,J) v_t dv_t dv_r&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
which can be written&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\rho(r) = {2\pi\over r^2} \int_\Phi^0 dQ f(Q) \int_0^{2r^2(Q-\Phi)/(1+r^2/r_a^2)} dJ^2\left[2(Q-\Phi)-(J^2/r^2)(1+r^2/r_a^2)\right]^{-1/2}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
or&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\rho(r) = {4\pi\over 1+r^2/r_a^2} \int_\Phi^0 dQ \sqrt{2(Q-\Phi)}f(Q).&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This equation has the form of an [[Abel integral equation]] and can be inverted to give &#039;&#039;f&#039;&#039; in terms of &#039;&#039;ρ&#039;&#039;:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
f(Q) = {\sqrt{2}\over 4\pi^2} {d\over dQ} \int_Q^0 {d\Phi\over\sqrt{\Phi-Q}} {d\rho^&#039;\over d\Phi},\ \ \ \ \ \rho^&#039;(\Phi) = \left[1+r(\Phi)^2/r_a^2\right]\rho\left[r(\Phi)\right].&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Properties==&lt;br /&gt;
&lt;br /&gt;
Following a derivation similar to the one above, the velocity dispersions in an Osipkov–Merritt model satisfy&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
{\sigma_r^2\over\sigma_t^2} = 1 + {r^2\over r_a^2}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The motions are nearly radial (&amp;lt;math&amp;gt;\sigma_r\gg\sigma_t&amp;lt;/math&amp;gt;) for &amp;lt;math&amp;gt;r\gg r_a&amp;lt;/math&amp;gt; and nearly isotropic (&amp;lt;math&amp;gt;\sigma_r\approx\sigma_t&amp;lt;/math&amp;gt;) for &amp;lt;math&amp;gt;r\ll r_a&amp;lt;/math&amp;gt;.  This is a desirable feature, since stellar systems that form via [[gravitational collapse]] have isotropic cores and radially-anisotropic envelopes.&amp;lt;ref&amp;gt;van Albada, T. (1983), [http://adsabs.harvard.edu/abs/1982MNRAS.201..939V  Dissipationless galaxy formation and the R to the 1/4-power law,] &#039;&#039;Mon. Not. R. Astron. Soc.&#039;&#039;, &#039;&#039;&#039;201&#039;&#039;&#039;, 939&amp;lt;/ref&amp;gt;   &lt;br /&gt;
&lt;br /&gt;
If &#039;&#039;r&amp;lt;sub&amp;gt;a&amp;lt;/sub&amp;gt;&#039;&#039; is assigned too small a value, &#039;&#039;f&#039;&#039; may be negative for some &#039;&#039;Q&#039;&#039;. This is a consequence of the fact that spherical mass models can not always be reproduced by purely radial orbits.  Since the number of stars on an orbit can not be negative, values of &#039;&#039;r&amp;lt;sub&amp;gt;a&amp;lt;/sub&amp;gt;&#039;&#039; that generate negative &#039;&#039;f&#039;&#039;&#039;s are unphysical. This result can be used to constrain the maximum degree of anisotropy of spherical galaxy models.&amp;lt;ref name=Merritt/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In his 1985 paper, Merritt defined two additional families of models (&amp;quot;Type II&amp;quot;) that have isotropic cores and tangentially anisotropic envelopes.  Both families assume &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;f = f(E-J^2/2r_a^2)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
In Type IIa models, the orbits become completely circular at &#039;&#039;r=r&amp;lt;sub&amp;gt;a&amp;lt;/sub&amp;gt;&#039;&#039; and remain so at all larger radii.&lt;br /&gt;
In Type IIb models, stars beyond &#039;&#039;r&amp;lt;sub&amp;gt;a&amp;lt;/sub&amp;gt;&#039;&#039; move on orbits of various eccentricities, although the motion is always biased toward circular. In both families, the tangential velocity dispersion undergoes a jump as &#039;&#039;r&#039;&#039; increases past &#039;&#039;r&amp;lt;sub&amp;gt;a&amp;lt;/sub&amp;gt;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
Carollo &#039;&#039;et al.&#039;&#039; (1995)&amp;lt;ref&amp;gt;Carollo, C. M. &#039;&#039;et al.&#039;&#039; (1995), [http://adsabs.harvard.edu/abs/1995MNRAS.276.1131C  Velocity profiles of Osipkov-Merritt models,] &#039;&#039;Mon. Not. R. Astron. Soc.&#039;&#039;, &#039;&#039;&#039;276&#039;&#039;&#039;, 1131&amp;lt;/ref&amp;gt; derive many observable properties of Type I Osipkov–Merritt models.&lt;br /&gt;
&lt;br /&gt;
==Applications==&lt;br /&gt;
&lt;br /&gt;
Typical applications of Osipkov–Merritt models include:&lt;br /&gt;
&lt;br /&gt;
-- modelling of [[star cluster]]s,&amp;lt;ref&amp;gt;Lupton, R.&#039;&#039; et al.&#039;&#039; (1989), [http://adsabs.harvard.edu/abs/1989ApJ...347..201L  The internal velocity dispersions of three young star clusters in the Large Magellanic Cloud,] &#039;&#039;Astrophys. J.&#039;&#039;, &#039;&#039;&#039;347&#039;&#039;&#039;, 201&amp;lt;/ref&amp;gt; [[galaxies]],&amp;lt;ref&amp;gt;Nolthenius, R. and [[Holland Ford|Ford, H.]] (1987), [http://adsabs.harvard.edu/abs/1986ApJ...305..600N  The mass and halo dispersion profile of M32,] &#039;&#039;Astrophys. J.&#039;&#039;, &#039;&#039;&#039;305&#039;&#039;&#039;, 600&amp;lt;/ref&amp;gt; [[dark matter halo]]s &amp;lt;ref&amp;gt;Sotnikova, N. Ya. and Rodionov, S. A. (2008), [http://adsabs.harvard.edu/abs/2008arXiv0809.3946S  Anisotropic Models of Dark Halos,] &#039;&#039;Astron. Lett.&#039;&#039;, &#039;&#039;&#039;34&#039;&#039;&#039;, 664-674&amp;lt;/ref&amp;gt; and [[galaxy cluster]]s;&amp;lt;ref&amp;gt;Lokas, E. and Mamon, G. (2001), [http://adsabs.harvard.edu/abs/2001MNRAS.321..155L  Properties of spherical galaxies and clusters with an NFW density profile,] &#039;&#039;Mon. Not. R. Astron. Soc.&#039;&#039;, &#039;&#039;&#039;321&#039;&#039;&#039;, 155&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
-- constructing anisotropic galaxy models for studies of dynamical [[Instability#Instabilities of stellar systems|instabilities]].&amp;lt;ref&amp;gt;May, A. and [[James Binney|Binney, J.]] (1986), [http://adsabs.harvard.edu/abs/1986MNRAS.221P..13M  Testing the stability of stellar systems,] &#039;&#039;Mon. Not. R. Astron. Soc.&#039;&#039;, &#039;&#039;&#039;221&#039;&#039;&#039;, 13&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Saha, P. (1991), [http://adsabs.harvard.edu/abs/1991MNRAS.248..494S  Unstable modes of a spherical stellar system,] &#039;&#039;Mon. Not. R. Astron. Soc.&#039;&#039;, &#039;&#039;&#039;248&#039;&#039;&#039;, 494&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
&lt;br /&gt;
* [[Stellar dynamics]]&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&lt;br /&gt;
{{reflist|2}}&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Osipkov-Merritt model}}&lt;br /&gt;
[[Category:Astrophysics]]&lt;/div&gt;</summary>
		<author><name>80.202.214.27</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Relative_permeability&amp;diff=16069</id>
		<title>Relative permeability</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Relative_permeability&amp;diff=16069"/>
		<updated>2013-08-31T20:50:45Z</updated>

		<summary type="html">&lt;p&gt;80.202.39.62: /* Corey-type */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{technical|date=June 2012}}&lt;br /&gt;
&#039;&#039;&#039;Stochastic approximation&#039;&#039;&#039; methods are a family of iterative [[stochastic optimization]] [[algorithm]]s that attempt to find zeroes or extrema of functions which cannot be computed directly, but only estimated via noisy observations.&lt;br /&gt;
&lt;br /&gt;
Mathematically, this refers to solving:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; \min_{x \in \Theta}\; f(x) = \mathbb E[F(x,\xi)] &amp;lt;/math&amp;gt;&lt;br /&gt;
where the objective is to find the parameter &amp;lt;math&amp;gt;x \in \Theta&amp;lt;/math&amp;gt;, which minimizes &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; for some unknown random variable, &amp;lt;math&amp;gt;\xi &amp;lt;/math&amp;gt;.  Denoting &amp;lt;math&amp;gt;d&amp;lt;/math&amp;gt; as the dimension of the parameter &amp;lt;math&amp;gt;x &amp;lt;/math&amp;gt;, we can assume that while the domain &amp;lt;math&amp;gt;\Theta \subset \mathbb R^d &amp;lt;/math&amp;gt; is known, the objective function, &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt;, cannot be computed exactly, but instead approximated via simulation. This can be intuitively explained as follows. &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is the original function we want to minimize. However, due to noise, &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; can not be evaluated exactly. This situation is modeled by the function &amp;lt;math&amp;gt;F(x,\xi)&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;\xi&amp;lt;/math&amp;gt; represents the noise and is a random variable. Since &amp;lt;math&amp;gt;\xi&amp;lt;/math&amp;gt; is a random variable, so is the value of &amp;lt;math&amp;gt;F(x,\xi)&amp;lt;/math&amp;gt;. The objective is then to minimize &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt;, but through evaluating &amp;lt;math&amp;gt;F(x,\xi)&amp;lt;/math&amp;gt;. A reasonable way to do this is to minimize the expectancy of &amp;lt;math&amp;gt;F(x,\xi)&amp;lt;/math&amp;gt;, i.e., &amp;lt;math&amp;gt;\mathbb E[F(x,\xi)]&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
The first, and prototypical, algorithms of this kind are the &#039;&#039;&#039;Robbins-Monro&#039;&#039;&#039; and &#039;&#039;&#039;Kiefer-Wolfowitz&#039;&#039;&#039; algorithms.&lt;br /&gt;
&lt;br /&gt;
==Robbins–Monro algorithm==&lt;br /&gt;
The Robbins–Monro algorithm, introduced in 1951 by [[Herbert Robbins]] and Sutton Monro,&amp;lt;ref name=&amp;quot;rm&amp;quot;&amp;gt;{{cite doi|10.1214/aoms/1177729586}}&amp;lt;/ref&amp;gt; presented a methodology for solving a root finding problem, where the function is represented as an expected value. Assume that we have a function &amp;lt;math&amp;gt;M(x)&amp;lt;/math&amp;gt;, and a constant &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt;, such that the equation &amp;lt;math&amp;gt;M(x) = \alpha&amp;lt;/math&amp;gt; has a unique root at &amp;lt;math&amp;gt;x=\theta&amp;lt;/math&amp;gt;. It is assumed that while we cannot directly observe the function &amp;lt;math&amp;gt;M(x)&amp;lt;/math&amp;gt;, we can instead obtain measurements of the random variable &amp;lt;math&amp;gt;N(x)&amp;lt;/math&amp;gt; where &amp;lt;math&amp;gt;\mathbb E[N(x)] = M(x)&amp;lt;/math&amp;gt;. The structure of the algorithm is to then generate iterates of the form:&lt;br /&gt;
&lt;br /&gt;
::&amp;lt;math&amp;gt;x_{n+1}-x_n=a_n(\alpha-N(x_n))&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Here, &amp;lt;math&amp;gt;a_1, a_2, \dots&amp;lt;/math&amp;gt;   is a sequence of positive step sizes. [[Herbert Robbins|Robbins]] and Monro proved &amp;lt;ref name=&amp;quot;rm&amp;quot; /&amp;gt;&amp;lt;sup&amp;gt;, Theorem 2&amp;lt;/sup&amp;gt; that &amp;lt;math&amp;gt;x_n&amp;lt;/math&amp;gt; [[convergence of random variables|converges]] in &amp;lt;math&amp;gt;L^2&amp;lt;/math&amp;gt; (and hence also in probability) to &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; provided that:&lt;br /&gt;
* &amp;lt;math&amp;gt;N(x)&amp;lt;/math&amp;gt; is uniformly bounded,&lt;br /&gt;
* &amp;lt;math&amp;gt;M(x)&amp;lt;/math&amp;gt; is nondecreasing,&lt;br /&gt;
* &amp;lt;math&amp;gt;M&#039;(\theta)&amp;lt;/math&amp;gt; exists and is positive, and&lt;br /&gt;
* The sequence &amp;lt;math&amp;gt;a_n&amp;lt;/math&amp;gt; satisfies the following requirements:&lt;br /&gt;
:: &amp;lt;math&amp;gt;\qquad \sum^{\infty}_{n=0}a_n = \infty \quad \mbox{ and } \quad \sum^{\infty}_{n=0}a^2_n &amp;lt; \infty \quad &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A particular sequence of steps which satisfy these conditions, and was suggested by Robbins–Monro, have the form: &amp;lt;math&amp;gt;a_n=a/n&amp;lt;/math&amp;gt;, for &amp;lt;math&amp;gt; a &amp;gt; 0 &amp;lt;/math&amp;gt;. Other series are possible but in order to average out the noise in &amp;lt;math&amp;gt;N(x)&amp;lt;/math&amp;gt;, the above condition must be met.&lt;br /&gt;
&lt;br /&gt;
===Complexity results===&lt;br /&gt;
#If &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; is twice continuously differentiable, and strongly convex, and the minimizer of &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; belongs to the interior of &amp;lt;math&amp;gt;\Theta&amp;lt;/math&amp;gt;, then the Robbins-Monro algorithm will achieve the asymptotically optimal convergence rate, with respect to the objective function, being &amp;lt;math&amp;gt;\mathbb E[f(x_n) - f^*] = O(1/n)&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;f^*&amp;lt;/math&amp;gt; is the minimal value of &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; over &amp;lt;math&amp;gt;x \in \Theta&amp;lt;/math&amp;gt;.&amp;lt;ref name=&amp;quot;jsacks&amp;quot;&amp;gt;{{cite doi|10.1214/aoms/1177706619}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;NJLS&amp;quot;&amp;gt;{{cite doi|10.1137/070704277}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
# Conversely, in the general convex case, where we lack both the assumption of smoothness and strong convexity, Nemirovski and Yudin &amp;lt;ref name=&amp;quot;NYcomp&amp;quot;&amp;gt;Problem Complexity and Method Efficiency in Optimization, A. Nemirovski and D. Yudin, &#039;&#039;Wiley -Intersci. Ser. Discrete Math&#039;&#039; &#039;&#039;&#039;15&#039;&#039;&#039; &#039;&#039;John Wiley&#039;&#039; &#039;&#039;New York&#039;&#039; (1983) .&amp;lt;/ref&amp;gt; have shown that the asymptotically optimal convergence rate, with respect to the objective function values, is &amp;lt;math&amp;gt;O(1/\sqrt{n})&amp;lt;/math&amp;gt;. They have also proven that this rate cannot be improved.&lt;br /&gt;
&lt;br /&gt;
===Subsequent developments===&lt;br /&gt;
While the Robbins-Monro algorithm is theoretically able to achieve &amp;lt;math&amp;gt; O(1/n)&amp;lt;/math&amp;gt; under the assumption of twice continuous differentiability and strong convexity, it can perform quite poorly upon implementation. This is primarily due to the fact that the algorithm is very sensitive to the choice of the step size sequence, and the supposed asymptotically optimal step size policy can be quite harmful in the beginning.&amp;lt;ref name=&amp;quot;NJLS&amp;quot; /&amp;gt;&amp;lt;ref name=&amp;quot;jcsbook&amp;quot;&amp;gt;Introduction to Stochastic Search and Optimization: Estimation, Simulation and Control, J.C. Spall, &#039;&#039;John Wiley&#039;&#039; &#039;&#039;Hoboken, NJ&#039;&#039;, (2003).&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
To overcome this shortfall,  Polyak and Juditsky,&amp;lt;ref name=&amp;quot;pj&amp;quot;&amp;gt;{{cite doi|10.1137/0330046}}&amp;lt;/ref&amp;gt; presented a method of accelerating Robbins-Monro through the use of longer steps, and averaging of the iterates. The algorithm would have the following structure:&lt;br /&gt;
::&amp;lt;math&amp;gt; x_{n+1} - x_n = b_n(\alpha - N(x_n)), \qquad \bar{x}_n = \frac{1}{n} \sum^{n-1}_{i=0} x_i &amp;lt;/math&amp;gt;&lt;br /&gt;
The convergence of &amp;lt;math&amp;gt; \bar{x}_n &amp;lt;/math&amp;gt; to the unique root &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; relies on the condition that the step sequence &amp;lt;math&amp;gt;\{b_n\}&amp;lt;/math&amp;gt; decreases sufficiently slowly. That is&lt;br /&gt;
::&amp;lt;math&amp;gt; b_n \rightarrow 0, \qquad \frac{b_n - b_{n+1}}{b_n} = o(b_n)&amp;lt;/math&amp;gt;&lt;br /&gt;
Therefore, the sequence &amp;lt;math&amp;gt;b_n = n^{-\alpha}&amp;lt;/math&amp;gt; with &amp;lt;math&amp;gt;0 &amp;lt; \alpha &amp;lt; 1&amp;lt;/math&amp;gt; satisfies this restriction, but &amp;lt;math&amp;gt;\alpha = 1&amp;lt;/math&amp;gt; does not, hence the longer steps. Under the assumptions outlined in the Robbins-Monro algorithm, the resulting modification will result in the same asymptotically  optimal convergence rate &amp;lt;math&amp;gt;O(1/n)&amp;lt;/math&amp;gt; yet with a more robust step size policy.&amp;lt;ref name =&amp;quot;pj&amp;quot; /&amp;gt; &lt;br /&gt;
&lt;br /&gt;
Prior to this, the idea of using longer steps and averaging the iterates had already been proposed by Nemirovski and Yudin &amp;lt;ref name=&amp;quot;NY&amp;quot;&amp;gt;On Cezari&#039;s convergence of the steepest descent method for approximating saddle points of convex-concave functions, A. Nemirovski and D. Yudin, &#039;&#039;Dokl. Akad. Nauk SSR&#039;&#039; &#039;&#039;&#039;2939&#039;&#039;&#039;, (1978 (Russian)), Soviet Math. Dokl. &#039;&#039;&#039;19&#039;&#039;&#039; (1978 (English)).&amp;lt;/ref&amp;gt; for the cases of solving the stochastic optimization problem with continuous convex objectives and for convex-concave saddle point problems. These algorithms were observed to attain the nonasymptotic rate &amp;lt;math&amp;gt;O(1/\sqrt{n})&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
==Kiefer-Wolfowitz algorithm==&lt;br /&gt;
The Kiefer-Wolfowitz algorithm,&amp;lt;ref name = &amp;quot;KW&amp;quot;&amp;gt;{{cite doi|10.1214/aoms/1177729392}}&amp;lt;/ref&amp;gt; was introduced in 1952, and was motivated by the publication of the Robbins-Monro algorithm. However, the algorithm was presented as a method which would stochastically estimate the maximum of a function. Let &amp;lt;math&amp;gt;M(x) &amp;lt;/math&amp;gt; be a function which has a maximum at the point &amp;lt;math&amp;gt;\theta &amp;lt;/math&amp;gt;. It is assumed that &amp;lt;math&amp;gt;M(x)&amp;lt;/math&amp;gt; is unknown, however, certain observations &amp;lt;math&amp;gt;N(x)&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;\mathbb E[N(x)] = M(x)&amp;lt;/math&amp;gt;, can be made at any point &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;. The structure of the algorithm follows a gradient-like method, with the iterates being generated as follows:&lt;br /&gt;
::&amp;lt;math&amp;gt; x_{n+1} = x_n + a_n \bigg(\frac{N(x_n + c_n) - N(x_n -c_n)}{c_n} \bigg) &amp;lt;/math&amp;gt;&lt;br /&gt;
where the gradient of &amp;lt;math&amp;gt;M(x)&amp;lt;/math&amp;gt; is approximated using finite differences. The sequence &amp;lt;math&amp;gt;\{c_n\}&amp;lt;/math&amp;gt; specifies the sequence of finite difference widths used for the gradient approximation, while the sequence &amp;lt;math&amp;gt;\{a_n\}&amp;lt;/math&amp;gt; specifies a sequence of positive step sizes taken along that direction. Kiefer and Wolfowitz proved that, if &amp;lt;math&amp;gt;M(x)&amp;lt;/math&amp;gt; satisfied certain regularity conditions, then &amp;lt;math&amp;gt;x_n&amp;lt;/math&amp;gt; will converge to &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; provided that:&lt;br /&gt;
* The function &amp;lt;math&amp;gt;f(x)&amp;lt;/math&amp;gt; has a unique point of maximum (minimum) and is strong concave (convex)&lt;br /&gt;
** The algorithm was first presented with the requirement that the function &amp;lt;math&amp;gt;f(\cdot)&amp;lt;/math&amp;gt; maintains strong global convexity (concavity) over the entire feasible space. Given this condition is too restrictive to impose over the entire domain, Kiefer and Wolfowitz proposed that it is sufficient to impose the condition over a compact set &amp;lt;math&amp;gt;C_0 \subset \mathbb R^d&amp;lt;/math&amp;gt; which is known to include the optimal solution.&lt;br /&gt;
*The selected sequences &amp;lt;math&amp;gt;\{a_n\}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\{c_n\}&amp;lt;/math&amp;gt; must be infinite sequences of positive numbers such that:&lt;br /&gt;
::&amp;lt;math&amp;gt;\mbox{1. } \quad c_n \rightarrow 0, \quad a_n \rightarrow 0 \quad \mbox{ as } \quad n \rightarrow \infty &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
::&amp;lt;math&amp;gt; \mbox{2. } \quad \sum^\infty_{n=0} a_n = \infty, \qquad \sum^\infty_{n=0} \frac{a^2_n}{c^2_n} &amp;lt; \infty &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A suitable choice of sequences, as recommended by Kiefer and Wolfowitz, would be &amp;lt;math&amp;gt;a_n = 1/n&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;c_n = n^{-1/3}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
===Subsequent developments and important issues===&lt;br /&gt;
#The Kiefer Wolfowitz algorithm requires that for each gradient computation, at least &amp;lt;math&amp;gt;d+1&amp;lt;/math&amp;gt; different parameter values must be simulated for every iteration of the algorithm, where &amp;lt;math&amp;gt;d &amp;lt;/math&amp;gt; is the dimension of the search space. This means that when &amp;lt;math&amp;gt;d&amp;lt;/math&amp;gt; is large, the Kiefer-Wolfowitz algorithm will require substantial computational effort per iteration, leading to slow convergence.&lt;br /&gt;
## To address this problem, Spall, proposed the use of [[Simultaneous perturbation stochastic approximation|simultaneous perturbations]] to estimate the gradient. This method would require only two simulations per iteration, regardless of the dimension &amp;lt;math&amp;gt;d&amp;lt;/math&amp;gt;.&amp;lt;ref name = &amp;quot;Jsp&amp;quot;&amp;gt;{{cite doi|10.1109/TAC.2000.880982}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
#In the conditions required for convergence, the ability to specify a predetermined compact set that fulfills strong convexity (or concavity) and contains the unique solution can be difficult to find. With respect to real world applications, if the domain is quite large, these assumptions can be fairly restrictive and highly unrealistic.&lt;br /&gt;
&lt;br /&gt;
==Further developments==&lt;br /&gt;
An extensive theoretical literature has grown up around these algorithms, concerning conditions for convergence, rates of convergence,  multivariate and other generalizations, proper choice of step size, possible noise models, and so on.&amp;lt;ref name=&amp;quot;kushneryin&amp;quot;&amp;gt;{{cite doi|10.1007/978-1-4899-2696-8}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;&#039;&#039;Stochastic Approximation and Recursive Estimation&#039;&#039;, Mikhail Borisovich Nevel&#039;son and Rafail Zalmanovich Has&#039;minskiĭ, translated by Israel Program for Scientific Translations and B. Silver, Providence, RI: American Mathematical Society, 1973, 1976. ISBN 0-8218-1597-0.&amp;lt;/ref&amp;gt;   These methods are also applied in [[control theory]], in which case the unknown function which we wish to optimize or find the zero of may vary in time. In this case, the step size &amp;lt;math&amp;gt;a_n&amp;lt;/math&amp;gt; should not converge to zero but should be chosen so as to track the function.&amp;lt;ref name=&amp;quot;kushneryin&amp;quot;/&amp;gt;&amp;lt;sup&amp;gt;, 2nd ed., chapter 3&amp;lt;/sup&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[C. Johan Masreliez]] and [[R. Douglas Martin]] were the first to apply &lt;br /&gt;
stochastic approximation to [[Robust statistics|robust]] [[estimation]].&amp;lt;ref&amp;gt;{{cite doi|10.1109/TIT.1975.1055386}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Stochastic gradient descent]]&lt;br /&gt;
*[[Stochastic optimization]]&lt;br /&gt;
*[[Simultaneous perturbation stochastic approximation]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Stochastic Approximation}}&lt;br /&gt;
[[Category:Stochastic optimization]]&lt;br /&gt;
[[Category:Statistical approximations]]&lt;/div&gt;</summary>
		<author><name>80.202.39.62</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Test_(assessment)&amp;diff=269358</id>
		<title>Test (assessment)</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Test_(assessment)&amp;diff=269358"/>
		<updated>2012-08-31T06:45:32Z</updated>

		<summary type="html">&lt;p&gt;80.202.75.217: /* History */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Four or five years ago, a reader of some of my columns bought the domain name jamesaltucher.com and gave it to me as a birthday gift. It was a total surprise to me. I didn&#039;t even know the reader. I hope one day we meet.&amp;lt;br&amp;gt;Two years ago a friend of mine, Tim Sykes, insisted I had to have a blog. He set it up for me. He even wrote the &amp;quot;About Me&amp;quot;. I didn&#039;t want a blog. I had nothing to say. But about 6 or 7 months ago I decided I wanted to take this blog seriously. I kept putting off changing the &amp;quot;About Me&amp;quot; which was no longer really about me and maybe never was.&amp;lt;br&amp;gt;A few weeks ago I did a chapter in one of the books in Seth Godin&#039;s &amp;quot;The Domino Project&amp;quot;. The book is out and called &amp;quot;No Idling&amp;quot;. Mohit Pewar organized it (here&#039;s Mohit&#039;s blog) and sent me a bunch of questions recently. It&#039;s intended to be an interview on his blog but I hope Mohit forgives me because I want to use it as my new &amp;quot;About Me&amp;quot; also.&amp;lt;br&amp;gt;1. You are a trader, investor, writer, and entrepreneur? Which of these roles you enjoy the most and why?&amp;lt;br&amp;gt;When I first moved to New York City in 1994 I wanted to be everything to everyone. I had spent the six years prior to that writing a bunch of unpublished novels and unpublished short stories. I must&#039;ve sent out 100s of stories to literary journals. I got form rejections from every publisher, journal, and agent I sent my novels and stories to.&amp;lt;br&amp;gt;Now, in 1994, everything was possible. The money was in NYC. Media was here. I lived in my 10�10 room and pulled suits out of a garbage bag every morning but it didn&#039;t matter...the internet was revving up and I knew how to build a [http://Www.reddit.com/r/howto/search?q=website website]. One of the few in the city. My sister warned me though: nobody here is your friend. Everybody wants something&amp;lt;br&amp;gt;&lt;br /&gt;
And I wanted something. I wanted the fleeting feelings of success, for the first time ever, in order to feel better about myself. I wanted a girl next to me. I wanted to build and sell companies and finally prove to everyone I was the smartest. I wanted to do a TV show. I wanted to write books&amp;lt;br&amp;gt;&lt;br /&gt;
But everything involved having a master. Clients. Employers. Investors. Publishers. The market (the deadliest master of all). Employees. I was a slave to everyone for so many years. And the more shackles I had on, the lonelier I got&amp;lt;br&amp;gt;&lt;br /&gt;
Much of the time, even when I had those moments of success, I didn&#039;t know how to turn it into a better life. I felt ugly and then later, I felt stupid when I would let the success dribble away down the sink&amp;lt;br&amp;gt;&lt;br /&gt;
I love writing because every now and then that ugliness turns into honesty. When I write, I&#039;m only a slave to myself. When I do all of those other things you ask about, I&#039;m a slave to everyone else&amp;lt;br&amp;gt;&lt;br /&gt;
Some links&amp;lt;br&amp;gt;&lt;br /&gt;
33 Unusual Tips to Being a Better Write&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;quot;The Tooth&amp;lt;br&amp;gt;&lt;br /&gt;
(one of my favorite posts on my blog&amp;lt;br&amp;gt;&lt;br /&gt;
2. What inspires you to get up and start working/writing every day&amp;lt;br&amp;gt;&lt;br /&gt;
The other day I had breakfast with a fascinating guy who had just sold a piece of his fund of funds. He told me what &amp;quot;fracking&amp;quot; was and how the US was going to be a major oil player again. We spoke for two hours about a wide range of topics, including what happens when we can finally implant a google chip in our brains&amp;lt;br&amp;gt;&lt;br /&gt;
After that I had to go onto NPR because I firmly believe that in one important respect we are degenerating as a country - we are graduating a generation of indentured servants who will spend 50 years or more paying down their student debt rather than starting companies and curing cancer. So maybe I made a difference&amp;lt;br&amp;gt;&lt;br /&gt;
Then I had lunch with a guy I hadn&#039;t seen in ten years. In those ten years he had gone to jail and now I was finally taking the time to forgive him for something he never did to me. I felt bad I hadn&#039;t helped him when he was at his low point. Then I came home and watched my kid play clarinet at her school. Then I read until I fell asleep. Today I did nothing but write. Both days inspired me&amp;lt;br&amp;gt;&lt;br /&gt;
It also inspires me that I&#039;m being asked these questions. Whenever anyone asks me to do anything I&#039;m infinitely grateful. Why me? I feel lucky. I like it when someone cares what I think. I&#039;ll write and do things as long as anyone cares. I honestly probably wouldn&#039;t write if nobody cared. I don&#039;t have enough humility for that, I&#039;m ashamed to admit&amp;lt;br&amp;gt;&lt;br /&gt;
3. Your new book &amp;quot;How to be the luckiest person alive&amp;quot; has just come out. What is it about&amp;lt;br&amp;gt;&lt;br /&gt;
When I was a kid I thought I needed certain things: a college education from a great school, a great home, a lot of money, someone who would love me with ease. I wanted people to think I was smart. I wanted people to think I was even special.  And as I grew older more and more goals got added to the list: a high chess rating,  [http://www.pcs-systems.co.uk/Images/celinebag.aspx http://www.pcs-systems.co.uk/Images/celinebag.aspx] a published book, perfect weather, good friends,  respect in various fields, etc. I lied to myself that I needed these things to be happy. The world was going to work hard to give me these things, I thought. But it turned out the world owed me no favors&amp;lt;br&amp;gt;&lt;br /&gt;
And gradually, over time, I lost everything I had ever gained. Several times.  I&#039;ve paced at night so many times wondering what the hell was I going to do next or trying not to care. The book is about regaining your sanity, regaining your happiness, finding luck in all the little pockets of life that people forget about. It&#039;s about turning away from the religion you&#039;ve been hypnotized into believing into the religion you can find inside yourself every moment of the day&amp;lt;br&amp;gt;&lt;br /&gt;
[Note: in a few days I&#039;m going to do a post on self-publishing and also how to get the ebook for free. The link above is to the paperback. Kindle should be ready soon also.&amp;lt;br&amp;gt;&lt;br /&gt;
Related link: Why I Write Books Even Though I&#039;ve Lost Money On Every Book I&#039;ve Ever Writte&amp;lt;br&amp;gt;&lt;br /&gt;
4. Is it possible to accelerate success? If yes, how&amp;lt;br&amp;gt;&lt;br /&gt;
Yes, and it&#039;s the only way I know actually to achieve success. It&#039;s by following the Daily Practice I outline in this post:&amp;lt;br&amp;gt;&lt;br /&gt;
It&#039;s the only way I know to exercise every muscle from the inside of you to the outside of you. I firmly believe that happiness starts with that practice&amp;lt;br&amp;gt;&lt;br /&gt;
5. You say that discipline, persistence and psychology are important if one has to achieve success. How can one work on improving &amp;quot;psychology&amp;quot; part&amp;lt;br&amp;gt;&lt;br /&gt;
Success doesn&#039;t really mean anything. People want to be happy in a harsh and unforgiving world. It&#039;s very difficult. We&#039;re so lucky most of us live in countries without major wars. Our kids aren&#039;t getting killed by random gunfire. We all have cell phones. We all can communicate with each other on the Internet. We have Google to catalog every piece of information in history!  We are so amazingly lucky already&amp;lt;br&amp;gt;&lt;br /&gt;
How can it be I was so lucky to be born into such a body? In New York City of all places? Just by being born in such a way on this planet was an amazing success&amp;lt;br&amp;gt;&lt;br /&gt;
So what else is there? The fact is that most of us, including me, have a hard time being happy with such ready-made success. We quickly adapt and want so much more out of life. It&#039;s not wars or disease that kill us. It&#039;s the minor inconveniences that add up in life. It&#039;s the times we feel slighted or betrayed. Or even slightly betrayed. Or overcharged. Or we miss a train. Or it&#039;s raining today. Or the dishwasher doesn&#039;t work. Or the supermarket doesn&#039;t have the food we like. We forget how good the snow tasted when we were kids. Now we want gourmet food at every meal&amp;lt;br&amp;gt;&lt;br /&gt;
Taking a step back, doing the Daily Practice I outline in the question above. For me, the results of that bring me happiness. That&#039;s success. Today. And hopefully tomorrow&amp;lt;br&amp;gt;&lt;br /&gt;
6. You advocate not sending kids to college. What if kids grow up and then blame their parents about not letting them get a college education&amp;lt;br&amp;gt;&lt;br /&gt;
I went to one of my kid&#039;s music recitals yesterday. She was happy to see me. I hugged her afterwards. She played &amp;quot;the star wars theme&amp;quot; on the clarinet. I wish I could&#039;ve played that for my parents. My other daughter has a dance recital in a few weeks. I tried to give her tips but she laughed at me. I was quite the breakdancer in my youth. The nerdiest breakdancer on the planet. I want to be present for them. To love them. To let them always know that in their own dark moments, they know I will listen to them. I love them. Even when they cry and don&#039;t always agree with me. Even when they laugh at me because sometimes I act like a clown&amp;lt;br&amp;gt;&lt;br /&gt;
Later, if they want to blame me for anything at all then I will still love them. That&#039;s my &amp;quot;what if&amp;quot;&amp;lt;br&amp;gt;&lt;br /&gt;
Two posts&amp;lt;br&amp;gt;&lt;br /&gt;
I want my daughters to be lesbian&amp;lt;br&amp;gt;&lt;br /&gt;
Advice I want to give my daughter&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
7. Four of your favorite posts from The Altucher Confidential&amp;lt;br&amp;gt;&lt;br /&gt;
As soon as I publish a post I get scared to death. Is it good? Will people re-tweet? Will one part of the audience of this blog like it at the expense of another part of the audience. Will I get Facebook Likes? I have to stop clinging to these things but you also need to respect the audience. I don&#039;t know. It&#039;s a little bit confusing to me. I don&#039;t have the confidence of a real writer yet&amp;lt;br&amp;gt;&lt;br /&gt;
Here are four of my favorites&amp;lt;br&amp;gt;&lt;br /&gt;
How I screwed Yasser Arafat out of $2mm (and lost another $100mm in the process&amp;lt;br&amp;gt;&lt;br /&gt;
It&#039;s Your Fault&amp;lt;br&amp;gt;&lt;br /&gt;
I&#039;m Guilty of Torturing Wome&amp;lt;br&amp;gt;&lt;br /&gt;
The Girl Whose Name Was a Curs&amp;lt;br&amp;gt;&lt;br /&gt;
Although these three are favorites I really don&#039;t post anything unless it&#039;s my favorite of that moment&amp;lt;br&amp;gt;&lt;br /&gt;
8. 3 must-read books for aspiring entrepreneurs&amp;lt;br&amp;gt;&lt;br /&gt;
The key in an entrepreneur book: you want to learn business. You want to learn how to honestly communicate with your customers. You want to stand out&amp;lt;br&amp;gt;&lt;br /&gt;
The Essays of Warren Buffett by Lawrence Cunningha&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;quot;The Thank you Economy&amp;quot; by Gary Vaynerchu&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;quot;Purple cow&amp;quot; by Seth Godi&amp;lt;br&amp;gt;&lt;br /&gt;
9. I love your writing, so do so many others out there. Who are your favorite writers&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;quot;Jesus&#039;s Son&amp;quot; by Denis Johnson is the best collection of short stories ever written. I&#039;m afraid I really don&#039;t like his novels though&amp;lt;br&amp;gt;&lt;br /&gt;
&amp;quot;Tangents&amp;quot; by M. Prado. A beautiful series of graphic stories about relationships&amp;lt;br&amp;gt;&lt;br /&gt;
Other writers: Miranda July, Ariel Leve, Mary Gaitskill, Charles Bukowski, Celine, Sam Lipsyte, William Vollmann, Raymond Carver. Arthur Nersesian. Stephen Dubner&amp;lt;br&amp;gt;&lt;br /&gt;
Many writers are only really good storytellers. Most writers come out of a cardboard factory MFA system and lack a real voice. A real voice is where every word exposes ten levels of hypocrisy in the world and brings us all the way back to see reality. The writers above have their own voices, their own pains, and their unique ways of expressing those pains. Some of them are funny. Some a little more dark. I wish I could write 1/10 as good as any of them&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
10. You are a prolific writer. Do you have any hacks that help you write a lot in little time&amp;lt;br&amp;gt;&lt;br /&gt;
Coffee, plus everything else coffee does for you first thing in the morning&amp;lt;br&amp;gt;&lt;br /&gt;
Only write about things you either love or hate. But if you hate something, try to find a tiny gem buried in the bag of dirt so you can reach in when nobody is looking and put that gem in your pocket. Stealing a diamond in all the shit around us and then giving it away for free via writing is a nice little hack, Being fearless precisely when you are most scared is the best hack&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
11. I totally get and love your idea about bleeding as a writer, appreciate if you share more with the readers of this blog&amp;lt;br&amp;gt;&lt;br /&gt;
Most people worry about what other people think of them. Most people worry about their health. Most people are at a crossroads and don&#039;t know how to take the next step and which road to take it on. Everyone is in a perpetual state of &#039;where do I put my foot next&#039;. Nobody, including me, can avoid that&amp;lt;br&amp;gt;&lt;br /&gt;
You and I both need to wash our faces in the morning, brush our teeth, shower, shit, eat, fight the weather, fight the colds that want to attack us if we&#039;re not ready. Fight loneliness or learn how to love and appreciate the people who want to love you back. And learn how to forgive and love the people who are even more stupid and cruel than we are. We&#039;re afraid to tell each other these things because they are all both disgusting and true&amp;lt;br&amp;gt;&lt;br /&gt;
You and I both have the same color blood. If I cut my wrist open you can see the color of my blood. You look at it and see that it&#039;s the same color as yours. We have something in common. It doesn&#039;t have to be shameful. It&#039;s just red. Now we&#039;re friends. No matter whom you are or where you are from. I didn&#039;t have to lie to you to get you to be my friend&amp;lt;br&amp;gt;&lt;br /&gt;
Related Links&amp;lt;br&amp;gt;&lt;br /&gt;
How to be a Psychic in Ten Easy Lesson&amp;lt;br&amp;gt;&lt;br /&gt;
My New Year&#039;s Resolution in 199&amp;lt;br&amp;gt;&lt;br /&gt;
12. What is your advice for young entrepreneurs&amp;lt;br&amp;gt;&lt;br /&gt;
Only build something you really want to use yourself. There&#039;s got to be one thing you are completely desperate for and no matter where you look you can&#039;t find it. Nobody has invented it yet. So there you go - you invent it. If there&#039;s other people like you, you have a business. Else. You fail. Then do it again. Until it works. One day it will&amp;lt;br&amp;gt;&lt;br /&gt;
Follow these 100 Rules&amp;lt;br&amp;gt;&lt;br /&gt;
The 100 Rules for Being a Good Entrepreneur&amp;lt;br&amp;gt;&lt;br /&gt;
And, in particular this&amp;lt;br&amp;gt;&lt;br /&gt;
The Easiest Way to Succeed as an Entrepreneu&amp;lt;br&amp;gt;&lt;br /&gt;
In my just released book I have more chapters on my experiences as an entrepreneur&amp;lt;br&amp;gt;&lt;br /&gt;
13. I advocate the concept of working at a job while building your business. You have of course lived it. Now as you look back, what is your take on this? Is it possible to make it work while sailing on two boats&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
Your boss wants everything out of you. He wants you to work 80 hours a week. He wants to look good taking credit for your work. He wants your infinite loyalty. So you need something back&amp;lt;br&amp;gt;&lt;br /&gt;
Exploit your employer. It&#039;s the best way to get good experience, clients, contacts. It&#039;s a legal way to steal. It&#039;s a fast way to be an entrepreneur because you see what large companies with infinite money are willing to pay for. If you can provide that, you make millions. It&#039;s how many great businesses have started and will always start. It&#039;s how every exit I&#039;ve had started&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
14. Who is a &amp;quot;person with true moral fiber&amp;quot;? In current times are there any role models who are people with true moral fiber&amp;lt;br&amp;gt;&lt;br /&gt;
I don&#039;t really know the answer. I think I know a few people like that. I hope I&#039;m someone like that. And I pray to god the people I&#039;m invested in are like that and my family is like that&amp;lt;br&amp;gt;&lt;br /&gt;
I find most people to be largely mean and stupid, a vile combination. It&#039;s not that I&#039;m pessimistic or cynical. I&#039;m very much an optimist. It&#039;s just reality. Open the newspaper or turn on the TV and watch these people&amp;lt;br&amp;gt;&lt;br /&gt;
Moral fiber atrophies more quickly than any muscle on the body. An exercise I do every morning is to promise myself that &amp;quot;I&#039;m going to save a life today&amp;quot; and then leave it in the hands of the Universe to direct me how I can best do that. Through that little exercise plus the Daily Practice described above I hope to keep regenerating that fiber&amp;lt;br&amp;gt;&lt;br /&gt;
15.   Your message to the readers of this blog&amp;lt;br&amp;gt;&lt;br /&gt;
Skip dinner. But follow me on Twitter.&amp;lt;br&amp;gt;&lt;br /&gt;
Read more posts on The Altucher Confidential �&lt;br /&gt;
More from The Altucher Confidentia&amp;lt;br&amp;gt;&lt;br /&gt;
Life is Like a Game. Here�s How You Master ANY Gam&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
Step By Step Guide to Make $10 Million And Then Totally Blow &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
Can You Do One Page a Day?&lt;/div&gt;</summary>
		<author><name>80.202.75.217</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=CompactFlash&amp;diff=227954</id>
		<title>CompactFlash</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=CompactFlash&amp;diff=227954"/>
		<updated>2012-08-25T17:17:10Z</updated>

		<summary type="html">&lt;p&gt;80.202.134.100: /* Technical details */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Luke is a celebrity within the making as well as the profession expansion initially 2nd to his third stadium recording,  And , may be the evidence. He burst to the picture in 1999 along with his unique blend of down-home convenience, motion picture star excellent seems and  words, is placed t in a significant way. The brand new recor on the country chart and #2 around the pop graphs, building it the next greatest debut at that time of 2015 for the country performer. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;The kid of the ,  understands persistence and willpower are   [http://minioasis.com kenny chesney denver] key elements with regards to an effective  job- . His initial album,  Keep Me, generated the Top  reaches “All My Pals Say” and “Country Man,” while his  hard work, Doin’  Issue, found the artist-3 right No. 7 men and women:  In addition Getting in touch with Is really a Very good Factor.”&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Inside the tumble of 2011, Concert tour: Bryan  And which had an amazing selection of , such as Downtown. “It’s much like you are receiving a   acceptance to travel to another level, claims these designers that were an element of the  Concert toursmore than right into a larger amount of designers.” It covered as among the best  excursions in their twenty-season record.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Look into my   [http://lukebryantickets.iczmpbangladesh.org luke bryan cheap tickets] web-site; [http://lukebryantickets.neodga.com lukebrya]&lt;/div&gt;</summary>
		<author><name>80.202.134.100</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Collision_response&amp;diff=266014</id>
		<title>Collision response</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Collision_response&amp;diff=266014"/>
		<updated>2012-02-01T21:55:40Z</updated>

		<summary type="html">&lt;p&gt;80.202.19.252: Corrected typo&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Pocket doorways are top-of-the-line ways to surround of an area without having to have doors in the way in which when they are opened. Whether or not you employ a pocket door for a closet or pantry door or go all out and install two abutting pocket doors for a double door opening into a main bedroom or dining room, pocket doors are versatile enough in each dimension and magnificence to please your subtle tastes or your fundamental necessities. I am assuming right here that for those who drew or used metal, you had a damned good motive. That is a subject for a much more detailed (to not point out PROFESSIONAL) therapy - see Introduction&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Pocket clips might be broken if they are unintentionally caught on international objects while carrying. To assist stop such occurrences, [http://Www.Bimbao.net/GeColls SOG recommends] that you just put on your knife in your front pocket, with the [http://www.derpsahd.byethost8.com/entry.php?508-Best-Cheap-Machete knife inside] your pocket. If, for whatever cause, your clip bends or breaks and also you want to receive a alternative, fill out the Clip Request Kind, or e-mail/call SOG&#039;s guarantee department. Harm to a knife deal with as a result of a clip has snagged isn&#039;t thought-about &amp;quot;normal,&amp;quot; and any such damage will probably be assessed below warranty. Be taught more about [http://Voipservicedirectory.com/forums/index.php?a=member&amp;amp;m=2079311 replacing pocket] clips in Knife &amp;amp; Instrument Care. Again to top&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Basic Whittling Strategies. It goes without saying but you have to be sure. Keep fingers and all other body components away from knife edges. Take no chances. Every knife stroke you make should be away from your physique. Never stroke in the direction of your physique. You already know you&#039;re just asking for it. Use a wide [http://Www.thebestpocketknifereviews.com/best-survival-machete-on-the-market-today/ Best Jungle Machete]-beveled knife edge to chop tender wooden or semi-gentle wood. Conversely, use a slender-beveled knife edge to cut hardwood. Whenever you need a powerful edge to chop hardwood, the more slender the bevel, the stronger the innovative. So that you thought you would herald a kitchen knife to cut the birthday cake delivered to work? Nope, prohibited.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;If this issues to you, there are some really attention-grabbing tales out there. Made in USA, made in France, made in Germany, handmade by artisans, invented or carried by a famous historic figure, etc, etc. We don’t have enough area on the entire web’s laborious drives to cowl all these histories. So we’ll let you dig on that. Maybe you’ll determine with one model and respect their particular values. Attempt to find a knife with a really sturdy body, I choose a metallic body, however I notice that fashionable plastics are very robust and durable so having a plastic body is ok in case you are proud of the knife.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;A lifetime warranty is out there and guarantees the travel merchandise to be free from manufacturing defects in materials and workmanship. Regular put on and tear shouldn&#039;t be covered, but there are generous choices obtainable for repair or refurbishing straight from the manufacturing facility. Victorinox is a world famous, outdated brand and so they have customer service and warranty down pat. You won&#039;t be disenchanted in a Victorinox product buy. Victorinox is even so protecting with their model, that they solely allow a handful of trusted retailers to sell their journey gear products on-line. They&#039;ve pre-screened online merchants for you so you already know that you should have a very good experience before you start.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;The Clip Point blade is among the hottest kinds. The highest side of this knife is straight from the handle to the mid blade space. It then curves downward and barely back up to the tip of the knife The curved area on prime of the innovative is named the &amp;quot;clip&amp;quot;. This sort of knife is widespread in fixed blade knives Put on gloves. Consider it this manner, when you lower your arms or fingers, you&#039;re achieved. You won&#039;t have the ability to whittle at all till it heals. Put on them, a minimum of until you&#039;ve developed some real ability at handling the knife&lt;/div&gt;</summary>
		<author><name>80.202.19.252</name></author>
	</entry>
</feed>