Valuation using discounted cash flows - Revision history

en>Funandtrvl: tag

2014-12-23T01:48:13Z

tag

← Older revision		Revision as of 03:48, 23 December 2014
Line 1:		Line 1:
	~~[[File:Separating axis theorem2008.png\|right\|thumb\|Illustration of the hyperplane separation theorem.]]~~		Emilia Shryock is my name but you can call me something you like. South Dakota is her beginning place but she needs to transfer simply because of her family. Body building is 1 of the issues I love most. I am a meter reader but I strategy on altering it.<br><br>my site: [http://www.teenvalley.net/user/RLay std home test]
	~~In [[geometry]], the '''hyperplane separation theorem'''~~ is either of two theorems about disjoint [[convex set]]s in ''n''-dimensional [[Euclidean space]]. In the first version of the theorem, if both these sets are closed and at least one of them is compact, then there is a hyperplane in between them and even two parallel hyperplanes in between them separated by a gap. ~~In the second version, if both disjoint convex sets are open, then there~~ is ~~a hyperplane in between them,~~ but ~~not necessarily any gap. An axis which is orthogonal~~ to ~~a separating hyperplane is a '''separating axis''',~~ because ~~the orthogonal projections~~ of ~~the convex bodies onto the axis are disjoint~~.

	~~The hyperplane separation theorem~~ is ~~due to [[Hermann Minkowski]]. The [[Hahn–Banach_theorem#Hahn–Banach_separation_theorem\|Hahn–Banach separation theorem]] generalizes the result to [[topological vector spaces]].~~

	~~A related result is the [[supporting hyperplane theorem]].In [[geometry]], a '''maximum-margin hyperplane''' is a [[hyperplane]] which separates two 'clouds'~~ of ~~points and is at equal distance from~~ the ~~two~~. ~~The margin between the hyperplane and the clouds is maximal. See the article on [[Support Vector Machines]] for more details.~~

	~~== Proof ==~~

	~~Let ''A'' and ''B'' be two disjoint, closed, convex sets, and suppose that ''A'' is [[compact space\|compact]]. Then ''A'' and ''B'' have~~ a ~~closest pair of points ''p'' and ''q''. (The distance function ''d''(''p'',''B'') is a continuous function that vanishes only~~ on ~~''B'', and since ''A'' is compact,~~ it must have a positive minimum ''p'' on ''A''.) Then any hyperplane ''H'' which is perpendicular to the segment ''I''(''p'',''q'') from ''p'' to ''q'', and which meets the interior of this segment, must separate ''A'' from ''B''.

	For the second version of the theorem, suppose that A and B are disjoint, convex, and open. Then they can be exhausted by sequences of compact, convex subsets ''A''<sub>''n''</sub> and ''B''<sub>''n''</sub>. The first version of the theorem supplies a sequence of separating hyperplanes ''H''<sub>''n''</sub> which must have a subsequence that converges to a hyperplane ''H''. This hyperplane must separate ''A'' from ''B''.

	~~== Counterexamples and uniqueness ==~~

	If one of ''A'' or ''B'' is not convex, then there are many possible counterexamples. For example, ''A'' and ''B'' could be concentric circles. A more subtle counterexample is one in which ''A'' and ''B'' are both closed but neither one is compact. ~~For example, if ''A'' is a closed half plane and B is bounded by one arm of a hyperbola, then there is no separating hyperplane:~~

	~~:<math>A = \{(x,y) : x \le 0\}~~<~~/math~~>
	:<~~math~~>~~B = \{(x,y)~~ : ~~x > 0, y \geq 1/x \}.\ </math>~~

	(Although, by an instance of the second theorem, there is a hyperplane that separates their interiors.) Another type of counterexample has ''A'' compact and ''B'' open. For example, A can be a closed square and B can be an open square that touches ''A''.

	In the first version of the theorem, evidently the separating hyperplane is never unique. In the second version, it may or may not be unique. Technically a separating axis is never unique because it can be translated; in the second version of the theorem, a separating axis can be unique up to translation.

	~~==Use in collision detection==~~

	~~[[File:Separating axis theorem2.svg\|right\|thumb\|The theorem does not apply if one of the bodies is not convex.]]~~

	~~'''The separating axis theorem'''(SAT) says that:~~

	~~Two convex objects do not overlap if there exists a line (called axis) onto which the two objects' projections do not overlap.~~

	~~SAT suggests an algorithm for testing whether two convex solids intersect or not.~~

	~~Regardless of dimensionality, the separating axis is always a line.~~
	~~For example, in 3D, the space is separated by planes, but the separating axis is perpendicular to the separating plane.~~

	The separating axis theorem can be applied for fast [[collision detection]] between polygon meshes. Each [[face (geometry)\|face]]'s [[surface normal\|normal]] or other feature directions is used as a separating axis, as well as the cross products. Note that this yields possible separating axes, not separating lines/planes.

	~~If the cross products were not used, certain edge-on-edge non-colliding cases would be treated as colliding. For increased efficiency, parallel axes may be calculated as a single axis.~~

	~~==References==~~
	*{{cite book
	~~\| last = Golshtein~~
	~~\| first = E. G.~~
	~~\| coauthors = Tretyakov, N.V.; translated by Tretyakov, N.V.~~
	~~\| title = Modified Lagrangians and monotone maps in optimization~~
	~~\| publisher = New York: Wiley~~
	~~\| date = 1996~~
	~~\| isbn = 0-471-54821-9~~
	~~\| page = 6~~
	}}
	*{{cite book
	~~\| last = Shimizu~~
	~~\| first = Kiyotaka~~
	~~\| coauthors = Ishizuka, Yo; Bard, Jonathan F.~~
	~~\| title = Nondifferentiable and two-level mathematical programming~~
	~~\| publisher = Boston: Kluwer Academic Publishers~~
	~~\| date = 1997~~
	~~\| isbn = 0-7923-9821-1~~
	~~\| page = 19~~
	}}

	~~==External links==~~
	* [http://www.~~metanetsoftware~~.~~com~~/~~technique~~/~~tutorialA.html Collision detection and response]~~

	~~{{Functional Analysis}}~~

	~~{{DEFAULTSORT:Separating Axis Theorem}}~~
	~~[[Category:Theorems in convex geometry]]~~

	~~[[de:Trennungssatz]]~~
	~~[[fr:Séparation des convexes]~~]

en>Yobot: WP:CHECKWIKI error fixes using AWB (9494)

2013-09-23T19:38:28Z

WP:CHECKWIKI error fixes using AWB (9494)

← Older revision		Revision as of 21:38, 23 September 2013
Line 1:		Line 1:
	Hi there. ~~Allow me begin by introducing~~ the ~~author~~, ~~her name~~ is ~~Myrtle Cleary~~. He is ~~really fond~~ of ~~doing ceramics but he~~ is ~~struggling~~ to ~~find time~~ for it. ~~Hiring~~ is ~~my profession~~. ~~California~~ is ~~our birth place~~.<br><br>~~My web site~~ :: ~~at home std test~~ ([http://www.~~neweracinema~~.com/~~tube~~/~~user/D69E funny post~~])		[[File:Separating axis theorem2008.png\|right\|thumb\|Illustration of the hyperplane separation theorem.]]
			In [[geometry]], the '''hyperplane separation theorem''' is either of two theorems about disjoint [[convex set]]s in ''n''-dimensional [[Euclidean space]]. In the first version of the theorem, if both these sets are closed and at least one of them is compact, then there is a hyperplane in between them and even two parallel hyperplanes in between them separated by a gap. In the second version, if both disjoint convex sets are open, then there is a hyperplane in between them, but not necessarily any gap. An axis which is orthogonal to a separating hyperplane is a '''separating axis''', because the orthogonal projections of the convex bodies onto the axis are disjoint.

			The hyperplane separation theorem is due to [[Hermann Minkowski]]. The [[Hahn–Banach_theorem#Hahn–Banach_separation_theorem\|Hahn–Banach separation theorem]] generalizes the result to [[topological vector spaces]].

			A related result is the [[supporting hyperplane theorem]].In [[geometry]], a '''maximum-margin hyperplane''' is a [[hyperplane]] which separates two 'clouds' of points and is at equal distance from the two. The margin between the hyperplane and the clouds is maximal. See the article on [[Support Vector Machines]] for more details.

			== Proof ==

			Let ''A'' and ''B'' be two disjoint, closed, convex sets, and suppose that ''A'' is [[compact space\|compact]]. Then ''A'' and ''B'' have a closest pair of points ''p'' and ''q''. (The distance function ''d''(''p'',''B'') is a continuous function that vanishes only on ''B'', and since ''A'' is compact, it must have a positive minimum ''p'' on ''A''.) Then any hyperplane ''H'' which is perpendicular to the segment ''I''(''p'',''q'') from ''p'' to ''q'', and which meets the interior of this segment, must separate ''A'' from ''B''.

			For the second version of the theorem, suppose that A and B are disjoint, convex, and open. Then they can be exhausted by sequences of compact, convex subsets ''A''<sub>''n''</sub> and ''B''<sub>''n''</sub>. The first version of the theorem supplies a sequence of separating hyperplanes ''H''<sub>''n''</sub> which must have a subsequence that converges to a hyperplane ''H''. This hyperplane must separate ''A'' from ''B''.

			== Counterexamples and uniqueness ==

			If one of ''A'' or ''B'' is not convex, then there are many possible counterexamples. For example, ''A'' and ''B'' could be concentric circles. A more subtle counterexample is one in which ''A'' and ''B'' are both closed but neither one is compact. For example, if ''A'' is a closed half plane and B is bounded by one arm of a hyperbola, then there is no separating hyperplane:

			:<math>A = \{(x,y) : x \le 0\}</math>
			:<math>B = \{(x,y) : x > 0, y \geq 1/x \}.\ </math>

			(Although, by an instance of the second theorem, there is a hyperplane that separates their interiors.) Another type of counterexample has ''A'' compact and ''B'' open. For example, A can be a closed square and B can be an open square that touches ''A''.

			In the first version of the theorem, evidently the separating hyperplane is never unique. In the second version, it may or may not be unique. Technically a separating axis is never unique because it can be translated; in the second version of the theorem, a separating axis can be unique up to translation.

			==Use in collision detection==

			[[File:Separating axis theorem2.svg\|right\|thumb\|The theorem does not apply if one of the bodies is not convex.]]

			'''The separating axis theorem'''(SAT) says that:

			Two convex objects do not overlap if there exists a line (called axis) onto which the two objects' projections do not overlap.

			SAT suggests an algorithm for testing whether two convex solids intersect or not.

			Regardless of dimensionality, the separating axis is always a line.
			For example, in 3D, the space is separated by planes, but the separating axis is perpendicular to the separating plane.

			The separating axis theorem can be applied for fast [[collision detection]] between polygon meshes. Each [[face (geometry)\|face]]'s [[surface normal\|normal]] or other feature directions is used as a separating axis, as well as the cross products. Note that this yields possible separating axes, not separating lines/planes.

			If the cross products were not used, certain edge-on-edge non-colliding cases would be treated as colliding. For increased efficiency, parallel axes may be calculated as a single axis.

			==References==
			*{{cite book
			\| last = Golshtein
			\| first = E. G.
			\| coauthors = Tretyakov, N.V.; translated by Tretyakov, N.V.
			\| title = Modified Lagrangians and monotone maps in optimization
			\| publisher = New York: Wiley
			\| date = 1996
			\| isbn = 0-471-54821-9
			\| page = 6
			}}
			*{{cite book
			\| last = Shimizu
			\| first = Kiyotaka
			\| coauthors = Ishizuka, Yo; Bard, Jonathan F.
			\| title = Nondifferentiable and two-level mathematical programming
			\| publisher = Boston: Kluwer Academic Publishers
			\| date = 1997
			\| isbn = 0-7923-9821-1
			\| page = 19
			}}

			==External links==
			* [http://www.metanetsoftware.com/technique/tutorialA.html Collision detection and response]

			{{Functional Analysis}}

			{{DEFAULTSORT:Separating Axis Theorem}}
			[[Category:Theorems in convex geometry]]

			[[de:Trennungssatz]]
			[[fr:Séparation des convexes]]

120.153.60.5: /* Basic formula for firm valuation using DCF model */

2012-04-22T02:52:24Z

Basic formula for firm valuation using DCF model

New page

Hi there. Allow me begin by introducing the author, her name is Myrtle Cleary. He is really fond of doing ceramics but he is struggling to find time for it. Hiring is my profession. California is our birth place.<br><br>My web site :: at home std test ([http://www.neweracinema.com/tube/user/D69E funny post])