Tone mapping: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Su-steve
m 3) Local Contrast preservation: Improved spacing below Eqn 6.
 
en>TiagoTiago
m Purpose and methods: i want more info about "gradient domain", so i made it a link in hopes someone will eventually write an article about it
Line 1: Line 1:
<br><br>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.<br><br>Here are some common dental emergencies:<br>Toothache: The most common dental emergency. This generally means a badly decayed tooth. As the pain affects the tooth'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.<br><br>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.<br><br>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.<br><br>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.<br><br>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.<br><br>Broken Jaw: If you suspect the patient'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.<br><br>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.<br><br>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.<br><br>If you cherished this short article and you would like to obtain extra facts pertaining to [http://www.youtube.com/watch?v=90z1mmiwNS8 dentist DC] kindly pay a visit to the web-site.
The notion of '''institution'''  has been created by [[Joseph Goguen]] and [[Rod Burstall]] in the late 1970s
in order to deal with the  "population explosion among the [[logical system]]s used in
[[computer science]]". The notion tries to capture the essence of the concept of "logical system".
With this, it is possible to develop concepts of [[specification language]]s (like structuring of specifications, parameterization, implementation, refinement, development), [[proof calculi]] and even [[tool]]s in a way completely independent of the underlying logical system. There are also [[morphism]]s that allow to relate and translate logical systems. Important applications of this are re-use of logical structure (also called borrowing), heterogeneous specification and combination of logics. Recently, [[institutional model theory]] has generalized many notions and deep results of [[model theory]].
 
==Definition==
The theory of institutions does not assume anything about the nature of the logical system. That is, [[Interpretation (logic)|model]]s and [[Sentence (mathematical logic)|sentences]] may be arbitrary objects; the only assumption being that there is a '''satisfaction relation''' between models and sentences, telling whether a sentence holds in a model or not. Satisfaction is inspired by [[T-schema|Tarski's truth definition]], but can in fact be any binary relation.
A crucial feature of institutions now is that models, sentences and their satisfaction are always being considered to live in some vocabulary or context  (called '''signature''') that defines the (non-logical) symbols that may be used in sentences and that need to be interpreted in models. Moreover, '''signature morphisms''' allow to extend signatures, change notation etc. Nothing is assumed about signatures and signature morphisms except that signature morphisms can be composed; this amounts to having a  
[[Category (mathematics)|category]] of signatures and morphisms. Finally, it is assumed that signature morphisms lead to translations of sentences and models in a way that satisfaction is preserved. While sentences are translated along with signature morphisms (think of symbols being replaced along the morphism), models are translated (or better: reduced) '''against''' signature morphisms: for example, in case of a signature extension, a model of the (larger) target signature may be reduced to a model of the (smaller) source signature by just forgetting some components of the model.
 
Formally, an institution consists of
 
* a [[Category (mathematics)|category]] <math>Sign</math> of '''signatures''',
* a [[functor]] <math>sen:Sign \to </math>[[Category of sets|Set]] giving, for each signature <math>\Sigma</math>, the set of '''sentences''' <math>sen(\Sigma)</math>, and for each signature morphism <math>\sigma:\Sigma\to\Sigma'</math>, the '''sentence translation map''' <math>sen(\sigma):sen(\Sigma)\to sen(\Sigma')</math>, where often <math>sen(\sigma)(\varphi)</math> is written as <math>\sigma(\varphi)</math>,
* a [[functor]] <math>Mod:Sign^{op}\to</math>[[Category of small categories|Cat]] giving, for each signature <math>\Sigma</math>, the category of '''models''' <math>Mod(\Sigma)</math>, and for each signature morphism <math>\sigma:\Sigma\to\Sigma'</math>, the '''reduct functor''' <math>Mod(\sigma):Mod(\Sigma')\to Mod(\Sigma)</math>, where often <math>Mod(\sigma)(M')</math> is written as <math>M'|_{\sigma}</math>,
* a satisfaction [[Binary relation|relation]] <math>{\models_{\Sigma}}\subseteq|{Mod(\Sigma)|\times sen(\Sigma)}</math> for each <math>\Sigma\in Sign</math>,
 
such that for each <math>\sigma:\Sigma\to\Sigma'</math> in <math>Sign</math> the following '''satisfaction condition'''  holds:
 
<math>M'\models_{\Sigma'}\sigma(\varphi)</math> if and only if <math>M'|_{\sigma}
\models_{\Sigma} \varphi</math>
 
for each <math>M'\in Mod(\Sigma')</math> and <math>\varphi\in sen(\Sigma)</math>.
 
The satisfaction condition expresses that truth is invariant under change of notation
(and also under enlargement or quotienting of context).
 
Strictly speaking, the model functor ends in the [[quasi-category]] of all large categories.
 
==Examples of Institutions==
* [[Propositional logic]]
* [[First-order logic]]
* [[Higher-order logic]]
* [[Intuitionistic logic]]
* [[Modal logic]]
* [[Temporal logic]]
* [[Web Ontology Language]] (OWL)
* [[Common logic]]
* [[Common Algebraic Specification Language]] (CASL)
 
==Papers==
* [[Joseph Goguen|J. A. Goguen]] and R. M. Burstall, Introducing Institutions, Lecture Notes in Computer Science 164, pp.&nbsp;221–256, 1984.
* J. A. Goguen and R. M. Burstall, Institutions: Abstract Model Theory for Specification and Programming, Journal of the Association for Computing Machinery 39, pp.&nbsp;95–146, 1992.
* J. Meseguer, General Logics, Logic Colloquium 87, pp.&nbsp;275–329, North Holland, 1989.
* J. A. Goguen and G. Rosu, Institution morphisms, Formal aspects of computing 13, pp.&nbsp;274–307, 2002.
* D. Sannella and A. Tarlecki, Specifications in an arbitrary institution, Information and Computation 76, pp.&nbsp;165–210, 1988
* T. Mossakowski, J. A. Goguen, R. Diaconescu, A. Tarlecki. What is a Logic?. In Jean-Yves Beziau (Ed.), Logica Universalis, pp.&nbsp;113–133. Birkhäuser 2005.
 
==External links==
*[http://www-cse.ucsd.edu/users/goguen/projs/inst.html Institutions by Joseph Goguen]
*[http://www.informatik.uni-bremen.de/flirts/ Formalism, Logic, Institution - Relating, Translating and Structuring] (including large bibliography)
*[http://www.imar.ro/~diacon/publications.html#Institutions__institution-independent Razvan Diaconescu's publication list] - contains recent work on institutional model theory
 
==See also==
* [[Entailment system]]
* [[Abstract model theory]]
* [[Institutional model theory]]
 
[[Category:Theoretical computer science]]
[[Category:Model theory]]

Revision as of 10:01, 5 September 2013

The notion of institution has been created by Joseph Goguen and Rod Burstall in the late 1970s in order to deal with the "population explosion among the logical systems used in computer science". The notion tries to capture the essence of the concept of "logical system". With this, it is possible to develop concepts of specification languages (like structuring of specifications, parameterization, implementation, refinement, development), proof calculi and even tools in a way completely independent of the underlying logical system. There are also morphisms that allow to relate and translate logical systems. Important applications of this are re-use of logical structure (also called borrowing), heterogeneous specification and combination of logics. Recently, institutional model theory has generalized many notions and deep results of model theory.

Definition

The theory of institutions does not assume anything about the nature of the logical system. That is, models and sentences may be arbitrary objects; the only assumption being that there is a satisfaction relation between models and sentences, telling whether a sentence holds in a model or not. Satisfaction is inspired by Tarski's truth definition, but can in fact be any binary relation. A crucial feature of institutions now is that models, sentences and their satisfaction are always being considered to live in some vocabulary or context (called signature) that defines the (non-logical) symbols that may be used in sentences and that need to be interpreted in models. Moreover, signature morphisms allow to extend signatures, change notation etc. Nothing is assumed about signatures and signature morphisms except that signature morphisms can be composed; this amounts to having a category of signatures and morphisms. Finally, it is assumed that signature morphisms lead to translations of sentences and models in a way that satisfaction is preserved. While sentences are translated along with signature morphisms (think of symbols being replaced along the morphism), models are translated (or better: reduced) against signature morphisms: for example, in case of a signature extension, a model of the (larger) target signature may be reduced to a model of the (smaller) source signature by just forgetting some components of the model.

Formally, an institution consists of

such that for each σ:ΣΣ in Sign the following satisfaction condition holds:

MΣσ(φ) if and only if M|σΣφ

for each MMod(Σ) and φsen(Σ).

The satisfaction condition expresses that truth is invariant under change of notation (and also under enlargement or quotienting of context).

Strictly speaking, the model functor ends in the quasi-category of all large categories.

Examples of Institutions

Papers

  • J. A. Goguen and R. M. Burstall, Introducing Institutions, Lecture Notes in Computer Science 164, pp. 221–256, 1984.
  • J. A. Goguen and R. M. Burstall, Institutions: Abstract Model Theory for Specification and Programming, Journal of the Association for Computing Machinery 39, pp. 95–146, 1992.
  • J. Meseguer, General Logics, Logic Colloquium 87, pp. 275–329, North Holland, 1989.
  • J. A. Goguen and G. Rosu, Institution morphisms, Formal aspects of computing 13, pp. 274–307, 2002.
  • D. Sannella and A. Tarlecki, Specifications in an arbitrary institution, Information and Computation 76, pp. 165–210, 1988
  • T. Mossakowski, J. A. Goguen, R. Diaconescu, A. Tarlecki. What is a Logic?. In Jean-Yves Beziau (Ed.), Logica Universalis, pp. 113–133. Birkhäuser 2005.

External links

See also