Sea ice emissivity modelling: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Wavelength
→‎Effective permittivity: removing 1 hyphen: —> "vertically oriented"—WP:HYPHEN, sub-subsection 3, point 4
 
en>Yobot
m WP:CHECKWIKI errors fixed + general fixes using AWB (8961)
Line 1: Line 1:
I own many different knives now and most considerably more expensive. However, I all the time come again to my Adventurer. It’s light weight, in costly (lately around $forty), has just enough instruments to be helpful and not so many that you simply spend 5 minutes digging via [http://www.thebestpocketknifereviews.com/best-combat-knife-fightingtactical-pocket-knives-reviews/ best tactical fixed blade knives] trying to find the right tool, and is very sturdy. As an Urban Survivalist , what I most like about it's that it's not intimidating to people who are not accustomed to seeing different people caring a pocket knife, “Oh, it’s just a good ole Swiss Military Knife.”<br><br>Within the knife neighborhood Chris Reeve is synonymous with quality and innovation and no dialogue of best pocket knives is complete without mentioning the Sebenza. The Chris Reeve Sebenza has lengthy been regarded by the industry as probably the greatest folding knives money can purchase. It has a titanium frame lock design that mixes simplicity with durability and a blade constructed from S35VN chrome steel that ceaselessly retains its edge. As soon as opened and locked the knife feels as stable as a set blade and holds [http://www.baycalling.com/wiki/Tactical_Pocket_Knives comfortably] in the hand. The standard is actually second to none and it’ll shave the hairs in your chin right out of the box!<br><br>It is light-weight and has a robust design development. It has a locking switch technology which makes sure you are security from the blade deployment. It has an excellent stable handle that provides a [http://wiki.Ippk.ru/index.php?title=Best_Combat_Knife superb grip] which doesn’t slip away or fall off from the hand. This knife provides all spherical efficiency that's actually glorious. The SOG Flash II has obtained a total of 110+ positive customer critiques with a rating of four.5 out of five on Amazon. It is extremely reasonably priced to purchase as a result of it costs lower than $40.<br><br>Though Bowie knives are quite expensive paying an enormous amount is probably not obligatory when you already know the value ranges acceptable for an authentic Bowie knife. Before you buy a Bowie knife , just remember to have in contrast costs extensively to get the perfect deal. Bowie knives are popular collectors' objects and are generally placed on the rare class especially these which can be known to have been made by the unique makers prior to now. Some companies which might be known to make Bowie knives are Bronks Knifework, JP Miller, Al Warren Customized Knife, Steve Mullin, Jim Ferguson, JP Holmes Custom, Knife Werks and more.<br><br>The tea bag ought to keep shoved up in opposition to the infected area and the internal cheek, where the epithelial cells of the fragile tissue lining of the mouth and gums are essentially the most receptive, for a minimum of an hour half of as a result of this offers the tannins more concentrated at first to pull all the things out slowly with out stunning the physique system like lancing and draining from a dentist would cause. This can be a safer but more time-consuming methodology of healing. Most people want on the spot gratification and I am sorry to say, this therapy is NOT prompt but effective.<br><br>The button used for opening the Entourage is giant sufficient that you could simply make contact with it along with your proper thumb, and there may be an enhanced spring design for improved and sooner opening occasions of the blade. I found my sample had the front pivot pin just a tad too tight, and it only took about half a turn with a Torx head driver, to get the strain a bit looser and more to my own liking. The blade appeared a bit sluggish springing out of the handle scales - but now it is perfect.<br><br>Lexan is a popular choice for window glass substitute all through your private home. A preferred model name, Lexan is Normal Electric's model of sheet polycarbonate - a specialty plastic - which is both robust and sturdy. A lot lighter than a comparable sheet of glass, polycarbonate is infinitely stronger; even when struck with highly effective [http://www.knifecenter.com wholesale knives] blows from sledgehammers, polycarbonate is not going to break. It is the identical material used for bulletproof home windows in banks or on the presidential limousine windows. Considered a better insulator than glass, Lexan is made of a sustainable, recyclable material. Replacing your fiberglass door with Lexan is pretty easy project.
'''Witsenhausen's [[counterexample]]''', shown in the figure below, arises in a deceptively simple [[toy problem]] in decentralized [[stochastic control]]. It was formulated by [[Hans witsenhausen|Hans Witsenhausen]] in 1968.<ref>A counterexample in stochastic optimum control. SIAM J. Control Volume 6, Issue 1, pp. 131–147 (February 1968)</ref> It is a counterexample to a natural conjecture that one can generalize a key result of centralized [[linear-quadratic-Gaussian control]] systems: that affine (linear) control laws are optimal. Witsenhausen showed that there exists a nonlinear control law that outperforms all linear laws. The problem of finding the optimal control law remains unsolved.<ref name=Ho>Review of the Witsenhausen problem. Yu-Chi Ho. Proceedings of the 47th IEEE Conference on Decision and Control (CDC), pp. 1611–1613, 2008.</ref>
 
[[File:WitsenhausenCounterexample.jpg]]
 
The statement of the counterexample is simple: two controllers attempt to control the system by attempting to bring the state close to zero in exactly two time steps. There is a cost on the input <math>u_1</math> of the first controller, and the state <math>x_2</math> after the input of the second controller. The input <math>u_2</math> of the second controller is free, but its observations <math>y_2=x_1+z</math> are noisy. The objective is to minimize an average cost function, <math>k^2E[u_1^2]+E[x_2^2]</math>, where the average is over the randomness in the initial state <math>x_0</math> and the observation noise <math>z</math>, both of which are distributed independently and in a Gaussian manner.
 
==The significance of the problem==
The counterexample lies at the intersection of [[control theory]] and [[information theory]]. Due to its hardness, the problem of finding the optimal control law has also received attention from the [[theoretical computer science]] community. The importance of the problem was recently reflected upon in the 47th IEEE Conference on Decision and Control (CDC) 2008, Cancun, Mexico,<ref name=Ho/> where an entire session was dedicated to understanding the counterexample 40 years after it was first formulated.
 
The problem is of conceptual significance in decentralized control because it shows that it is important for the controllers to communicate<ref>Information and Control: Witsenhausen revisited. Mitter and Sahai. Learning, control and hybrid systems, 1999 – Springer.</ref> with each other implicitly in order to minimize the cost. This suggests that control actions in decentralized control may have a dual role: those of control and communication.
 
==The hardness of the problem==
The hardness of the problem is attributed to the fact that information of the second controller depends on the decisions of the first controller.<ref>Team Decision Theory and Information Structures. Yu-Chi Ho. Proceedings of the IEEE, Vol. 68, No.6, JUNE 1980</ref> Variations considered by [[Tamer Basar]] <ref>Variations on the Theme of the Witsenhausen Counterexample. Tamer Basar. 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9–11, 2008.</ref> show that the hardness is also because of the structure of the performance index and the coupling of different decision variables. It has also been shown that problems of the spirit of Witsenhausen's counterexample become simpler if the [[transmission delay]] along an external channel that connects the controllers is smaller than the [[propagation delay]] in the problem. However, this result requires the channels to be perfect and instantaneous,<ref>Rotkowitz, M.; Cogill, R.; Lall, S.; , "A Simple Condition for the Convexity of Optimal Control over Networks with Delays," Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. 44th IEEE Conference on , vol., no., pp. 6686–6691, 12–15 December 2005</ref> and hence is of limited applicability. In practical situations, the channel is always imperfect, and thus one can not assume that decentralized control problems are simple in presence of external channels.
 
A justification of the failure of attempts that discretize the problem came from the computer science literature: [[Christos Papadimitriou]] and John Tsitsiklis showed that the discrete version of the counterexample is  [[NP-complete]].<ref>Intractable problems in control theory. [[Christos Papadimitriou]] and John Tsitsiklis.  24th IEEE Conference on Decision and Control, 1985</ref>
 
==Attempts at obtaining a solution==
A number of numerical attempts have been made to solve the counterexample. Focusing on a particular choice of problem parameters <math>(k=0.2,\;\sigma_0=5)</math>, researchers have obtained strategies by [[discretization]] and using [[neural networks]].<ref>Numerical solutions to the Witsenhausen counterexample by approximating networks. Baglietto, Parisini, Zoppoli IEEE Trans. Automatic Control. 2001.</ref> Further research (notably, the work of [[Yu-Chi Ho]],<ref>The Witsenhausen counterexample: A hierarchical search approach for nonconvex optimization problems. Lee, Lau, Ho. IEEE Trans. Automatic Control, 2001</ref> and the work of Li, Marden and [[Jeff S. Shamma|Shamma]] <ref>Learning approaches to the Witsenhausen counterexample from a view of potential games. Li, Marden, Shamma. IEEE Conference on Decision and Control, 2009</ref>) has obtained slightly improved costs for the same parameter choice. The first provably approximately optimal strategies appeared recently (Grover, Park, Sahai) <ref>The finite-dimensional Witsenhausen Counterexample. Grover, Sahai and Park. IEEE WiOpt 2010, ConCom workshop, Seoul, Korea.</ref> where [[information theory]] is used to understand the communication in the counterexample. The optimal solution of the counterexample is still an open problem.
 
==References==
{{Reflist}}
 
{{Use dmy dates|date=September 2010}}
 
{{DEFAULTSORT:Witsenhausen's Counterexample}}
[[Category:Control theory]]
[[Category:Stochastic control]]

Revision as of 22:48, 7 March 2013

Witsenhausen's counterexample, shown in the figure below, arises in a deceptively simple toy problem in decentralized stochastic control. It was formulated by Hans Witsenhausen in 1968.[1] It is a counterexample to a natural conjecture that one can generalize a key result of centralized linear-quadratic-Gaussian control systems: that affine (linear) control laws are optimal. Witsenhausen showed that there exists a nonlinear control law that outperforms all linear laws. The problem of finding the optimal control law remains unsolved.[2]

The statement of the counterexample is simple: two controllers attempt to control the system by attempting to bring the state close to zero in exactly two time steps. There is a cost on the input of the first controller, and the state after the input of the second controller. The input of the second controller is free, but its observations are noisy. The objective is to minimize an average cost function, , where the average is over the randomness in the initial state and the observation noise , both of which are distributed independently and in a Gaussian manner.

The significance of the problem

The counterexample lies at the intersection of control theory and information theory. Due to its hardness, the problem of finding the optimal control law has also received attention from the theoretical computer science community. The importance of the problem was recently reflected upon in the 47th IEEE Conference on Decision and Control (CDC) 2008, Cancun, Mexico,[2] where an entire session was dedicated to understanding the counterexample 40 years after it was first formulated.

The problem is of conceptual significance in decentralized control because it shows that it is important for the controllers to communicate[3] with each other implicitly in order to minimize the cost. This suggests that control actions in decentralized control may have a dual role: those of control and communication.

The hardness of the problem

The hardness of the problem is attributed to the fact that information of the second controller depends on the decisions of the first controller.[4] Variations considered by Tamer Basar [5] show that the hardness is also because of the structure of the performance index and the coupling of different decision variables. It has also been shown that problems of the spirit of Witsenhausen's counterexample become simpler if the transmission delay along an external channel that connects the controllers is smaller than the propagation delay in the problem. However, this result requires the channels to be perfect and instantaneous,[6] and hence is of limited applicability. In practical situations, the channel is always imperfect, and thus one can not assume that decentralized control problems are simple in presence of external channels.

A justification of the failure of attempts that discretize the problem came from the computer science literature: Christos Papadimitriou and John Tsitsiklis showed that the discrete version of the counterexample is NP-complete.[7]

Attempts at obtaining a solution

A number of numerical attempts have been made to solve the counterexample. Focusing on a particular choice of problem parameters , researchers have obtained strategies by discretization and using neural networks.[8] Further research (notably, the work of Yu-Chi Ho,[9] and the work of Li, Marden and Shamma [10]) has obtained slightly improved costs for the same parameter choice. The first provably approximately optimal strategies appeared recently (Grover, Park, Sahai) [11] where information theory is used to understand the communication in the counterexample. The optimal solution of the counterexample is still an open problem.

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

30 year-old Entertainer or Range Artist Wesley from Drumheller, really loves vehicle, property developers properties for sale in singapore singapore and horse racing. Finds inspiration by traveling to Works of Antoni Gaudí.

  1. A counterexample in stochastic optimum control. SIAM J. Control Volume 6, Issue 1, pp. 131–147 (February 1968)
  2. 2.0 2.1 Review of the Witsenhausen problem. Yu-Chi Ho. Proceedings of the 47th IEEE Conference on Decision and Control (CDC), pp. 1611–1613, 2008.
  3. Information and Control: Witsenhausen revisited. Mitter and Sahai. Learning, control and hybrid systems, 1999 – Springer.
  4. Team Decision Theory and Information Structures. Yu-Chi Ho. Proceedings of the IEEE, Vol. 68, No.6, JUNE 1980
  5. Variations on the Theme of the Witsenhausen Counterexample. Tamer Basar. 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9–11, 2008.
  6. Rotkowitz, M.; Cogill, R.; Lall, S.; , "A Simple Condition for the Convexity of Optimal Control over Networks with Delays," Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. 44th IEEE Conference on , vol., no., pp. 6686–6691, 12–15 December 2005
  7. Intractable problems in control theory. Christos Papadimitriou and John Tsitsiklis. 24th IEEE Conference on Decision and Control, 1985
  8. Numerical solutions to the Witsenhausen counterexample by approximating networks. Baglietto, Parisini, Zoppoli IEEE Trans. Automatic Control. 2001.
  9. The Witsenhausen counterexample: A hierarchical search approach for nonconvex optimization problems. Lee, Lau, Ho. IEEE Trans. Automatic Control, 2001
  10. Learning approaches to the Witsenhausen counterexample from a view of potential games. Li, Marden, Shamma. IEEE Conference on Decision and Control, 2009
  11. The finite-dimensional Witsenhausen Counterexample. Grover, Sahai and Park. IEEE WiOpt 2010, ConCom workshop, Seoul, Korea.