<?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=131.169.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=131.169.0.0%2F16"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/wiki/Special:Contributions/131.169.0.0/16"/>
	<updated>2026-09-07T16:47:52Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=FFAG_accelerator&amp;diff=265923</id>
		<title>FFAG accelerator</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=FFAG_accelerator&amp;diff=265923"/>
		<updated>2014-07-21T09:19:08Z</updated>

		<summary type="html">&lt;p&gt;131.169.37.129: /* Continuing development */ fixed typo. that section is confusing&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
&lt;br /&gt;
boucles bondissantes. Hommes ou femmes aec des cheeux plus courts b��n��ficieront de la IV Mini Styler qui est ��galement id��al pour des boucles serr��es. redresseurs GHD origine peuent ��tre achet��s en ligne et les salons de coiffure. Il ya cinq nouelles couleurs chaudes au choix aec des titres frais. Chacun ient aec son propre ��tui de transport et un tampon de protection contre la chaleur. rs peu co?teux. redressement cheeux en plus de produits de coiffage de regard�� sur des entreprises comme GHD Styler, qui indique fantastique our de cheeux boucl��s, est un atout pour obtenir une dame qui a besoin d&#039;��tre belle.&lt;br /&gt;
&lt;br /&gt;
 M��me dame de recherche moyen peut se r����ler ��tre un attrait GHD traailler aec un lisseur cheeux cr��pus, en raison du fait parenir aux parents des ��l��es en difficult�� du coll��ge est souent la r��ponse. Les foires de fournisseurs de programme donnent San iego ��coles m��res et les p��res la chance de r��aliser et de communiquer aec toutes les entreprises de tutorat et de choisir un seul que les meilleures combinaisons exigences ?&lt;br /&gt;
&lt;br /&gt;
leurs ��l��es. Coll��ges qui n��cessitent Aider ans plusieurs cas de straighener ghd, complet San iego coll��ges serait la situation en auront besoin. La loi n �� Youngster Gauche conduite f��d��ral fournit s��lections pour la m��re et le p��re de San iego ?coles ��tudiants qui fr��quentent les campus qui ont ��t�� class��s comme &amp;quot;Programme d&#039;am��lioration? pour tout minimale d&#039;une ann��e scolaire en particulier. trillions par an sur traitement de bien-��tre dans le Usa.&lt;br /&gt;
&lt;br /&gt;
 Pourquoi sommes-nous ne receons pas plus sain autres pr��occupations pertinentes concernant otre bien-��tre pour mendier des solutions, par exemple, pourquoi, imm��diatement apr��s plus de ans de nombreux ��tant donn�� que la ?guerre contre le cancer&amp;quot; a ��t�� d��clar��, En raison de tous ces mereilleux aantages, les salons de coiffure �� traers le monde utilisent stylers GHD. Cependant, il existe diff��rents types de produits disponibles dans cette gamme.&lt;br /&gt;
&lt;br /&gt;
 Ce qui suit est un bref aper?u sur la fa?on de choisir le plus appropri�� pour ous. Gambler motif par les ��normes quantit��s SIR de PERSONNES de l&#039;chec. GHD Australie mars boursier E S��paration rues?��chec , E PERSONNES Nombreuses taient durante Faillite. Manque de dtermination rapide GHD cher. L&#039;ensemble des Gens qui russissent may tre dtermin Rapidement et rsolument m��tro, Le perdant du mod��le de courbure, les moins de sections sont n��cessaires. . Lorsque ous utilisez le peigne de queue de rat de diiser les cheeux en sections r��alisables, eiller �� ne pas creuser le peigne dans le cuir cheelu.&lt;br /&gt;
&lt;br /&gt;
 Il ya en fait cinq ariables utilis��es pour ��aluer otre score. Historique des paiements est certainement l&#039;un des ��l��ments les plus importants dans d��terminer otre pointage de cr��dit. [http://tinyurl.com/pyhzj3n ghd lisseur] cheeux de la note sera bas��e sur cet ��l��ment. R��pondre �� os paiements de la dette de carte de cr��dit en temps opportun aidera otre score. Cr��ation retard de paiement fera l&#039;autre. Lisseur GHD sont enus �� r��aliser os r��es d&#039;aoir des cheeux g��rable, droit et lisse sans tracas dans quelques minutes.&lt;br /&gt;
&lt;br /&gt;
 GHD se tournent les t��tes partout sans se plaindre. Plus ��tonnant encore, ous ne regarderez plus la m��me fille deux fois aec GHD car GHD ous aidera �� porter un regard diff��rent aec des coiffures super ��l��gant et chic �� chaque fois que ous sortez aec la coiffure diff��rente.&lt;/div&gt;</summary>
		<author><name>131.169.37.129</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Self-phase_modulation&amp;diff=242873</id>
		<title>Self-phase modulation</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Self-phase_modulation&amp;diff=242873"/>
		<updated>2014-07-02T10:23:34Z</updated>

		<summary type="html">&lt;p&gt;131.169.134.242: /* Theory */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Hello. Allow me introduce the author. Her name is Emilia Shroyer but it&#039;s not the most feminine title out there. California is  home std test kit where I&#039;ve always been living and I adore each working day residing here. Managing people has been his day occupation for a while. One of  [http://www.alhuloul.com/?p=235037 http://www.alhuloul.com/] the [http://Homestdtests.org/ extremely] best issues in the world for him is to gather  [http://www.january-yjm.com/xe/index.php?mid=video&amp;amp;document_srl=182582 http://www.january-yjm.com/xe/index.php?mid=video&amp;amp;document_srl=182582] badges but he is struggling to find time for it.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Visit my homepage; at home  at home std test std testing ([http://Xrambo.com/user/NEme click this link here now])&lt;/div&gt;</summary>
		<author><name>131.169.134.242</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Differential_nonlinearity&amp;diff=18867</id>
		<title>Differential nonlinearity</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Differential_nonlinearity&amp;diff=18867"/>
		<updated>2014-01-31T10:26:57Z</updated>

		<summary type="html">&lt;p&gt;131.169.212.195: /* Formula */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{One source|date=March 2011}}&lt;br /&gt;
[[File:Linear Potential Sweep.JPG|right|400px|thumb|&#039;&#039;&#039;Linear potential sweep&#039;&#039;&#039;]]&lt;br /&gt;
&#039;&#039;&#039;Linear sweep voltammetry&#039;&#039;&#039; is a [[Voltammetry|voltammetric method]] where the current at a [[working electrode]] is measured while the potential between the working electrode and a [[reference electrode]] is swept linearly in time.  Oxidation or reduction of species is registered as a peak or trough in the current signal at the potential at which the species begins to be oxidized or reduced.&lt;br /&gt;
&lt;br /&gt;
== Experimental method ==&lt;br /&gt;
The experimental setup for linear sweep voltammetry utilizes a potentiostat and a three-electrode setup to deliver a potential to a solution and monitor its change in current. The three-electrode setup consists of a working electrode, an auxiliary electrode, and a reference electrode. The potentiostat delivers the potentials through the three-electrode setup. A potential, E, is delivered through the working electrode. The slope of the potential vs. time graph is called the scan rate and can range from mV/s to 1,000,000&amp;amp;nbsp;V/s.&amp;lt;ref&amp;gt;{{cite web|last=Tissue|first=Brian M.|title=Linear Sweep Voltammetry|website=CHP|url=http://www.files.chem.vt.edu/chem-ed/echem/linsweep.html}}&amp;lt;/ref&amp;gt; At higher scan rates the current is found to increase which improves the signal to noise ratio. Therefore higher scan rates lead to better signal to noise ratios.&lt;br /&gt;
&lt;br /&gt;
The working electrode is where the oxidation/reduction reactions occur. The equation below gives an example of an oxidation occurring at the surface of the working electrode. ES is the standard reduction potential of A. As E approaches ES the current on the surface increases and when E=ES then the concentration of [A] = [A-] at the surface.&amp;lt;ref&amp;gt;{{cite web|last=|first=|title=Voltammetry|website=CHP|url=http://mail.chiangmai.ac.th/~scijjkmn/voltammetry.htm}}&amp;lt;/ref&amp;gt; As the molecules on the surface of the working electrode or oxidized/reduced they move away from the surface and new molecules come into contact with the surface of the working electrode. This flow of molecules to and from the working electrode causes the current.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A+e^-=A^-&amp;lt;/math&amp;gt;    E_s=0.00V&lt;br /&gt;
&lt;br /&gt;
Oxidation of molecule A at the surface of the working electrode&lt;br /&gt;
&lt;br /&gt;
The auxiliary and reference electrode work in unison to balance out the charge added or removed by the working electrode. The auxiliary electrode balances the working electrode, but in order to know how much potential it has to add or remove it relies on the reference electrode. The reference electrode has a known reduction potential. The auxiliary electrode tries to keep the reference electrode at a certain reduction potential and to do this it has to balance the working electrode.&amp;lt;ref&amp;gt;{{cite book|last=Kounaves|first=Samuel P.|title=Voltammetric Techniques. Handbook of Instrumental Techniques for Analytical Chemistry|pages=709–725}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Characterization ==&lt;br /&gt;
Linear sweep voltammetry can identify unknown species and determine the concentration of solutions. E1/2 can be used to identify the unknown species while the height of the limiting current can determine the concentration. The sensitivity of current changes vs. voltage can be increased by increasing the scan rate. Higher potentials per second result in more oxidation/reduction of a species at the surface of the working electrode.&lt;br /&gt;
&lt;br /&gt;
== Variations ==&lt;br /&gt;
For reversible reactions cyclic voltammetry can be used to find information about the forward reaction and the reverse reaction. Like linear sweep voltammetry, cyclic voltammetry applies a linear potential over time and at a certain potential the potentiostat will reverse the potential applied and sweep back to the beginning point. Cyclic voltammetry provides information about the oxidation and reduction reactions.&lt;br /&gt;
&lt;br /&gt;
== Applications ==&lt;br /&gt;
While cyclic voltammetry is applicable to most cases where linear sweep voltammetry is used, there are some instances where linear sweep voltammetry is more useful. In cases where the reaction is irreversible cyclic voltammetry will not give any additional data that linear sweep voltammetry would give us.&amp;lt;ref&amp;gt;{{cite web|title=Instrumentation, Pine Research. Linear Sweep Voltammetry|year=2008|website=CHP|url=http://www.voltammetry.net/pine/aftermath/echem/linear_sweep_voltammetry.}}&amp;lt;/ref&amp;gt; &lt;br /&gt;
In one example,&amp;lt;ref&amp;gt;{{cite paper|last=Cheng|first=Shaoan|last=Xing|first=Defeng|last=Call|first=Douglas F|last=Logan|first=Bruce E.|title=Direct Biological Conversion of Electrical Current into Methane by Electromethanogenesis|year=2009|journal=Environ. Sci. Technol.|pages=3953–3958.}}&amp;lt;/ref&amp;gt; linear voltammetry was used to examine direct methane production via a biocathode. Since the production of methane from CO2 is an irreversible reaction, cyclic voltammetry did not present any distinct advantage over linear sweep voltammetry. This group found that the biocathode produced higher current densities than a plain carbon cathode and that methane can be produced from a direct electrical current without the need of hydrogen gas.&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
* [[Cyclic voltammetry]]&lt;br /&gt;
* [[Electroanalytical Methods]]&lt;br /&gt;
* Linear Sweep Voltammetry/Cyclic Voltammetry. [Online] http://www.basinc.com/mans/EC_epsilon/Techniques/CycVolt/cv.html.&lt;br /&gt;
* webmaster@ceb.cam.ac.uk. Linear Sweep and Cyclic Voltametry: The Principles. Department of Chemical Engineering and Biotechnology, University of Cambridge. [Online] http://www.ceb.cam.ac.uk/pages/linear-sweep-and-cyclic-voltametry-the-principles.html.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{Reflist}}&lt;br /&gt;
&lt;br /&gt;
{{Electroanalytical}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Electroanalytical methods]]&lt;/div&gt;</summary>
		<author><name>131.169.212.195</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Fano_factor&amp;diff=12430</id>
		<title>Fano factor</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Fano_factor&amp;diff=12430"/>
		<updated>2014-01-27T12:48:55Z</updated>

		<summary type="html">&lt;p&gt;131.169.212.195: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In [[linear algebra]], an &#039;&#039;&#039;augmented matrix&#039;&#039;&#039; is a [[matrix (mathematics)|matrix]] obtained by appending the columns of two given matrices, usually for the purpose of performing the same [[elementary row operations]] on each of the given matrices.&lt;br /&gt;
&lt;br /&gt;
Given the matrices &#039;&#039;A&#039;&#039; and &#039;&#039;B&#039;&#039;, where&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
A =&lt;br /&gt;
  \begin{bmatrix}&lt;br /&gt;
    1 &amp;amp; 3 &amp;amp; 2 \\&lt;br /&gt;
    2 &amp;amp; 0 &amp;amp; 1 \\&lt;br /&gt;
    5 &amp;amp; 2 &amp;amp; 2&lt;br /&gt;
  \end{bmatrix}&lt;br /&gt;
, \quad&lt;br /&gt;
B =&lt;br /&gt;
  \begin{bmatrix}&lt;br /&gt;
    4 \\&lt;br /&gt;
    3 \\&lt;br /&gt;
    1&lt;br /&gt;
  \end{bmatrix},&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
the augmented matrix (&#039;&#039;A&#039;&#039;|&#039;&#039;B&#039;&#039;) is written as&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
(A|B)=&lt;br /&gt;
  \left[\begin{array}{ccc|c}&lt;br /&gt;
    1 &amp;amp; 3 &amp;amp; 2 &amp;amp; 4 \\&lt;br /&gt;
    2 &amp;amp; 0 &amp;amp; 1 &amp;amp; 3 \\&lt;br /&gt;
    5 &amp;amp; 2 &amp;amp; 2 &amp;amp; 1&lt;br /&gt;
  \end{array}\right].&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This is useful when solving [[system of linear equations|systems of linear equations]].  &lt;br /&gt;
&lt;br /&gt;
For a given number of unknowns, the number of solutions to a system of linear equations depends only on the rank of the matrix representing the system and the rank of the corresponding augmented matrix. Specifically, according to the [[Rouché–Capelli theorem]], any system of linear equations is [[System of linear equations#Consistency|inconsistent]] (has no solutions) if the [[rank (linear algebra)|rank]] of the augmented matrix is greater than the rank of the [[coefficient matrix]]; if, on the other hand, the ranks of these two matrices are equal, the system must have at least one solution. The solution is unique if and only if the rank equals the number of variables. Otherwise the general solution has &#039;&#039;k&#039;&#039; free parameters where &#039;&#039;k&#039;&#039; is the difference between the number of variables and the rank; hence in such a case there are an infinitude of solutions.&lt;br /&gt;
&lt;br /&gt;
An augmented matrix may also be used to find the inverse of a matrix by combining it with the [[identity matrix]].&lt;br /&gt;
&lt;br /&gt;
== Examples ==&lt;br /&gt;
===Matrix inverse===&lt;br /&gt;
Let &#039;&#039;C&#039;&#039; be the square 2×2 matrix &lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
C = &lt;br /&gt;
  \begin{bmatrix}&lt;br /&gt;
    1 &amp;amp; 3 \\&lt;br /&gt;
    -5 &amp;amp; 0&lt;br /&gt;
  \end{bmatrix}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
To find the inverse of C we create (&#039;&#039;C&#039;&#039;|&#039;&#039;I&#039;&#039;) where I is the 2×2 [[identity matrix]]. We then reduce the part of (&#039;&#039;C&#039;&#039;|&#039;&#039;I&#039;&#039;) corresponding to &#039;&#039;C&#039;&#039; to the identity matrix using only [[elementary row operations]] on (&#039;&#039;C&#039;&#039;|&#039;&#039;I&#039;&#039;). &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(C|I) = &lt;br /&gt;
  \left[\begin{array}{cc|cc}&lt;br /&gt;
    1 &amp;amp; 3 &amp;amp; 1 &amp;amp; 0\\&lt;br /&gt;
    -5 &amp;amp; 0 &amp;amp; 0 &amp;amp; 1&lt;br /&gt;
  \end{array}\right]&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(I|C^{-1}) = &lt;br /&gt;
  \left[\begin{array}{cc|cc}&lt;br /&gt;
    1 &amp;amp; 0 &amp;amp; 0 &amp;amp; -\frac{1}{5} \\&lt;br /&gt;
    0 &amp;amp; 1 &amp;amp; \frac{1}{3} &amp;amp; \frac{1}{15}&lt;br /&gt;
  \end{array}\right]&lt;br /&gt;
&amp;lt;/math&amp;gt;,&lt;br /&gt;
&lt;br /&gt;
the right part of which is the inverse of the original matrix.&lt;br /&gt;
&lt;br /&gt;
===Existence and number of solutions===&lt;br /&gt;
&lt;br /&gt;
Consider the system of equations&lt;br /&gt;
&lt;br /&gt;
:&#039;&#039;x&#039;&#039; + &#039;&#039;y&#039;&#039; + 2&#039;&#039;z&#039;&#039; = 3&lt;br /&gt;
:&#039;&#039;x&#039;&#039; + &#039;&#039;y&#039;&#039; + &#039;&#039;z&#039;&#039; = 1&lt;br /&gt;
:2&#039;&#039;x&#039;&#039; + 2&#039;&#039;y&#039;&#039; + 2&#039;&#039;z&#039;&#039; = 2.&lt;br /&gt;
&lt;br /&gt;
The coefficient matrix is &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
A = &lt;br /&gt;
  \begin{bmatrix}&lt;br /&gt;
    1 &amp;amp; 1 &amp;amp; 2 \\&lt;br /&gt;
    1 &amp;amp; 1 &amp;amp; 1 \\&lt;br /&gt;
    2 &amp;amp; 2 &amp;amp; 2 \\&lt;br /&gt;
  \end{bmatrix},&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and the augmented matrix is&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(A|B) = &lt;br /&gt;
  \left[\begin{array}{ccc|c}&lt;br /&gt;
    1 &amp;amp; 1 &amp;amp; 2 &amp;amp; 3\\&lt;br /&gt;
    1 &amp;amp; 1 &amp;amp; 1 &amp;amp; 1 \\&lt;br /&gt;
    2 &amp;amp; 2 &amp;amp; 2 &amp;amp; 2&lt;br /&gt;
  \end{array}\right].&lt;br /&gt;
&amp;lt;/math&amp;gt; &lt;br /&gt;
&lt;br /&gt;
Since both of these have the same rank, namely 2, there exists at least one solution; and since their rank is less than the number of unknowns, the latter being 3, there are an infinite number of solutions.&lt;br /&gt;
&lt;br /&gt;
In contrast, consider the system&lt;br /&gt;
&lt;br /&gt;
:&#039;&#039;x&#039;&#039; + &#039;&#039;y&#039;&#039; + 2&#039;&#039;z&#039;&#039; = 3&lt;br /&gt;
:&#039;&#039;x&#039;&#039; + &#039;&#039;y&#039;&#039; + &#039;&#039;z&#039;&#039; = 1&lt;br /&gt;
:2&#039;&#039;x&#039;&#039; + 2&#039;&#039;y&#039;&#039; + 2&#039;&#039;z&#039;&#039; = 5.&lt;br /&gt;
&lt;br /&gt;
The coefficient matrix is &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
A = &lt;br /&gt;
  \begin{bmatrix}&lt;br /&gt;
    1 &amp;amp; 1 &amp;amp; 2 \\&lt;br /&gt;
    1 &amp;amp; 1 &amp;amp; 1 \\&lt;br /&gt;
    2 &amp;amp; 2 &amp;amp; 2 \\&lt;br /&gt;
  \end{bmatrix},&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and the augmented matrix is&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(A|B) = &lt;br /&gt;
  \left[\begin{array}{ccc|c}&lt;br /&gt;
    1 &amp;amp; 1 &amp;amp; 2 &amp;amp; 3\\&lt;br /&gt;
    1 &amp;amp; 1 &amp;amp; 1 &amp;amp; 1 \\&lt;br /&gt;
    2 &amp;amp; 2 &amp;amp; 2 &amp;amp; 5&lt;br /&gt;
  \end{array}\right].&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In this example the coefficient matrix has rank 2 while the augmented matrix has rank 3; so this system of equations has no solution. Indeed, an increase in the number of linearly independent rows has made the system of equations &#039;&#039;&#039;inconsistent&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
===Solution of a linear system===&lt;br /&gt;
As used in linear algebra, an augmented matrix is used to represent the [[coefficients]] and the [[solution vector]] of each equation set.&lt;br /&gt;
For the set of equations&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
\begin{align}&lt;br /&gt;
x + 2y + 3z &amp;amp;= 0 \\&lt;br /&gt;
3x + 4y + 7z &amp;amp;= 2 \\&lt;br /&gt;
6x + 5y + 9z &amp;amp;= 11&lt;br /&gt;
\end{align}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
the coefficients and constant terms give the matrices&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
A =&lt;br /&gt;
\begin{bmatrix}&lt;br /&gt;
1 &amp;amp; 2 &amp;amp; 3 \\&lt;br /&gt;
3 &amp;amp; 4 &amp;amp; 7 \\&lt;br /&gt;
6 &amp;amp; 5 &amp;amp; 9&lt;br /&gt;
\end{bmatrix}&lt;br /&gt;
, \quad&lt;br /&gt;
B = &lt;br /&gt;
\begin{bmatrix}&lt;br /&gt;
0 \\&lt;br /&gt;
2 \\&lt;br /&gt;
11&lt;br /&gt;
\end{bmatrix},&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and hence give the augmented matrix&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
(A|B) =&lt;br /&gt;
  \left[\begin{array}{ccc|c}&lt;br /&gt;
1 &amp;amp; 2 &amp;amp; 3 &amp;amp; 0 \\&lt;br /&gt;
3 &amp;amp; 4 &amp;amp; 7 &amp;amp; 2 \\&lt;br /&gt;
6 &amp;amp; 5 &amp;amp; 9 &amp;amp; 11&lt;br /&gt;
  \end{array}\right]&lt;br /&gt;
&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Note that the rank of the coefficient matrix, which is 3, equals the rank of the augmented matrix, so at least one solution exists; and since this rank equals the number of unknowns, there is exactly one solution.&lt;br /&gt;
&lt;br /&gt;
To obtain the solution, row operations can be performed on the augmented matrix to obtain the identity matrix on the left side, yielding&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
 \left[\begin{array}{ccc|c}&lt;br /&gt;
1 &amp;amp; 0 &amp;amp; 0 &amp;amp; 4 \\&lt;br /&gt;
0 &amp;amp; 1 &amp;amp; 0 &amp;amp; 1 \\&lt;br /&gt;
0 &amp;amp; 0 &amp;amp; 1 &amp;amp; -2 \\&lt;br /&gt;
  \end{array}\right],&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
so the solution of the system is (&#039;&#039;x&#039;&#039;, &#039;&#039;y&#039;&#039;, &#039;&#039;z&#039;&#039;) = (4, 1, -2).&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
* Marvin Marcus and Henryk Minc, &#039;&#039;A survey of matrix theory and matrix inequalities&#039;&#039;, [[Dover Publications]], 1992, ISBN 0-486-67102-X.  Page 31.&lt;br /&gt;
&lt;br /&gt;
[[Category:Matrices]]&lt;/div&gt;</summary>
		<author><name>131.169.212.195</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Weak_hypercharge&amp;diff=8966</id>
		<title>Weak hypercharge</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Weak_hypercharge&amp;diff=8966"/>
		<updated>2013-08-01T16:53:50Z</updated>

		<summary type="html">&lt;p&gt;131.169.207.137: /* Definition */  Use T_3 in table heading to match formulation used in text&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Use dmy dates|date=July 2013}}&lt;br /&gt;
{{More footnotes|date=October 2010}}&lt;br /&gt;
[[Image:Ic-photo-Intel--C8253.JPG|thumb|Intel C8253]]&lt;br /&gt;
[[Image:Intel 8253 and 8254.svg|thumb|{{nowrap|Programmable interval timer}} {{nowrap|Intel 8253}}. {{nowrap|Intel 8254}} has the same pinout.]]&lt;br /&gt;
The [[Intel]] &#039;&#039;&#039;8253&#039;&#039;&#039; and &#039;&#039;&#039;8254&#039;&#039;&#039; are [[Programmable Interval Timer]]s (PITs), which perform timing and counting functions. They were primarily designed for the [[Intel 8080]]/[[Intel 8085|8085]]-processors, but later used in x86-systems. They (or an equivalent circuit embedded in a larger chip) are found in all [[IBM PC compatible]]s.&lt;br /&gt;
&lt;br /&gt;
== History ==&lt;br /&gt;
The 8253 was used in IBM PC compatibles since their introduction in 1981.&amp;lt;ref&amp;gt;{{cite web |url=http://www.microsoft.com/whdc/system/sysinternals/mm-timer.mspx |title=Guidelines For Providing Multimedia Timer Support |date=20 September 2002 |accessdate=2010-10-13}}&amp;lt;/ref&amp;gt; In modern times, this PIT is not included as a separate chip in an x86 PC. Rather, its functionality is included as part of the motherboard&#039;s [[southbridge (computing)|southbridge]] chipset. In some modern chipsets, this change may show up as measurable timing differences in accessing a PIT using the [[x86]] [[I/O address]] space. Reads and writes to such a PIT&#039;s registers in the I/O address space may complete much faster.&lt;br /&gt;
&lt;br /&gt;
Newer motherboards also include a counter through the [[Advanced Configuration and Power Interface]] (ACPI), a counter on the Local Advanced Programmable Interrupt Controller ([[Local APIC]]), and a [[High Precision Event Timer]]. The CPU itself also provides the [[Time Stamp Counter]] (TSC) facility.&lt;br /&gt;
&lt;br /&gt;
== Features ==&lt;br /&gt;
[[Image:Intel 8253 block diagram.svg|thumb|Block diagram of {{nowrap|Intel 8253}}]]&lt;br /&gt;
&lt;br /&gt;
The timer has three counters, called channels. Each channel can be programmed to operate in one of six modes. Once programmed, the channels can perform their tasks independently. The timer is usually assigned to [[Interrupt request|IRQ]]-0 (highest priority hardware interrupt) because of the critical function it performs and because so many devices depend on it.&amp;lt;ref&amp;gt;{{cite web|url=http://download.intel.com/design/archives/periphrl/docs/23124406.pdf|title= Intel 82c54 PIT Datasheet}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Counters ===&lt;br /&gt;
There are 3 [[counters]] (or [[timer]]s), which are labeled as &#039;&#039;&#039;Counter 0&#039;&#039;&#039;, &#039;&#039;&#039;Counter 1&#039;&#039;&#039; and &#039;&#039;&#039;Counter 2&#039;&#039;&#039;.&amp;lt;ref name=&amp;quot;Intel 8254&amp;quot;&amp;gt;{{cite web|title=8254/82C54: Introduction to Programmable Interval Timer|url=http://www.intel.com/design/archives/periphrl/docs/7203.htm?wapkw=8254|publisher=Intel Corporation|accessdate=21 August 2011}}&amp;lt;/ref&amp;gt; Each counter has 2 input pins – &#039;&#039;&#039;CLK&#039;&#039;&#039; ([[clock]] input) and &#039;&#039;&#039;GATE&#039;&#039;&#039; – and 1-pin, &#039;&#039;&#039;OUT&#039;&#039;&#039;, for data output. The 3 counters are 16-bit down counters independent of each other, and can be easily read by the [[Central processing unit|CPU]].&amp;lt;ref&amp;gt;{{cite web|title=MSM 82c53 Datasheet|url=http://www.sharpmz.org/download/8253.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In the original IBM PCs, the first counter (selected by setting A1=A0=0, see &#039;&#039;&#039;Control Word Register&#039;&#039;&#039; below) is used to generate a [[clock signal|timekeeping]] interrupt. The second counter (A1=0, A0=1) is used to trigger the refresh of [[DRAM]] memory. The last counter (A1=1, A0=0) is used to generate tones via the [[PC speaker]].&lt;br /&gt;
&lt;br /&gt;
Besides the counters, a typical Intel 8253 microchip also contains the following components:&lt;br /&gt;
&lt;br /&gt;
=== Data/Bus Buffer ===&lt;br /&gt;
This block contains the logic to buffer the data bus to / from the microprocessor, and to the internal registers. It has 8 input pins, usually labelled as D7..D0, where D7 is the [[most significant bit|MSB]].&lt;br /&gt;
&lt;br /&gt;
=== Read/Write Logic ===&lt;br /&gt;
The &#039;&#039;&#039;Read/Write Logic&#039;&#039;&#039; block has 5 pins, which are listed below. Notice that &#039;&#039;&#039;/X&#039;&#039;&#039; denotes an active low signal.&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;/RD&#039;&#039;&#039;: read signal&lt;br /&gt;
* &#039;&#039;&#039;/WR&#039;&#039;&#039;: write signal&lt;br /&gt;
* &#039;&#039;&#039;/CS&#039;&#039;&#039;: chip select signal&lt;br /&gt;
* &#039;&#039;&#039;A0&#039;&#039;&#039;, &#039;&#039;&#039;A1&#039;&#039;&#039;: address lines&lt;br /&gt;
&lt;br /&gt;
Operation mode of the PIT is changed by setting the above hardware signals. For example, to write to the &#039;&#039;&#039;Control Word Register&#039;&#039;&#039;, one needs to set /CS=0, /RD=1, /WR=0, A1=A0=1.&lt;br /&gt;
&lt;br /&gt;
=== Control Word Register ===&lt;br /&gt;
Port 43h R/W&amp;lt;br /&amp;gt;&lt;br /&gt;
Port 53h R/W – second chip ...&amp;lt;br /&amp;gt;&lt;br /&gt;
&amp;lt;br /&amp;gt;&lt;br /&gt;
This register contains the programmed information which will be sent (by the [[microprocessor]]) to the device. It defines how the PIT logically works. Each access to these ports takes about 1 µs.&lt;br /&gt;
&lt;br /&gt;
To initialize the counters, the microprocessor must write a control word (CW) in this register. This can be done by setting proper values for the pins of the &#039;&#039;&#039;Read/Write Logic&#039;&#039;&#039; block and then by sending the control word to the &#039;&#039;&#039;Data/Bus Buffer&#039;&#039;&#039; block.&lt;br /&gt;
&lt;br /&gt;
The control word register contains 8 bits, labeled D7..D0 (D7 is the [[most significant bit|MSB]]).&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Bit#&lt;br /&gt;
! D7&lt;br /&gt;
! D6&lt;br /&gt;
! D5&lt;br /&gt;
! D4&lt;br /&gt;
! D3&lt;br /&gt;
! D2&lt;br /&gt;
! D1&lt;br /&gt;
! D0&lt;br /&gt;
! Short Description&lt;br /&gt;
|-&lt;br /&gt;
! Name&lt;br /&gt;
! SC1&lt;br /&gt;
! SC0&lt;br /&gt;
! RW1&lt;br /&gt;
! RW0&lt;br /&gt;
! M2&lt;br /&gt;
! M1&lt;br /&gt;
! M0&lt;br /&gt;
! BCD&lt;br /&gt;
! &lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! 0&lt;br /&gt;
! 0&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! Counter 0 at port 40h R/W&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! 0&lt;br /&gt;
! 1&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! Counter 1 at port 41h R/W&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! 1&lt;br /&gt;
! 0&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! Counter 2 at port 42h R/W&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 0&lt;br /&gt;
! 0&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! Counter Latch, value can be read out in the way RW1, RW0 was set before. The value is held until it is read out or overwritten.&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 0&lt;br /&gt;
! 1&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! Read/Write bits 0..7  of counter value&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 1&lt;br /&gt;
! 0&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! Read/Write bits 8..15 of counter value&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 1&lt;br /&gt;
! 1&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 2xRead/2xWrite bits 0..7 then 8..15 of counter value&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 0&lt;br /&gt;
! 0&lt;br /&gt;
! 0&lt;br /&gt;
! x&lt;br /&gt;
! Mode 0: Interrupt on Terminal Count&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 0&lt;br /&gt;
! 0&lt;br /&gt;
! 1&lt;br /&gt;
! x&lt;br /&gt;
! Mode 1: Hardware Retriggerable One-Shot&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 0&lt;br /&gt;
! 1&lt;br /&gt;
! 0&lt;br /&gt;
! x&lt;br /&gt;
! Mode 2: Rate Generator&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 0&lt;br /&gt;
! 1&lt;br /&gt;
! 1&lt;br /&gt;
! x&lt;br /&gt;
! Mode 3: Square Wave&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 1&lt;br /&gt;
! 0&lt;br /&gt;
! 0&lt;br /&gt;
! x&lt;br /&gt;
! Mode 4: Software Triggered Strobe&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 1&lt;br /&gt;
! 0&lt;br /&gt;
! 1&lt;br /&gt;
! x&lt;br /&gt;
! Mode 5: Hardware Triggered Strobe (Retriggerable)&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 0&lt;br /&gt;
! Counter is a 16 bit binary counter(0..65535,FFFFh)&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 1&lt;br /&gt;
! Counter is a 16 bit decimal counter 4 x 4bit decades(0..9999)&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
! &lt;br /&gt;
|-&lt;br /&gt;
! Name&lt;br /&gt;
! 1&lt;br /&gt;
! 1&lt;br /&gt;
! _____&lt;br /&gt;
count&lt;br /&gt;
! _____&lt;br /&gt;
status&lt;br /&gt;
! C2&lt;br /&gt;
! C1&lt;br /&gt;
! C0&lt;br /&gt;
! 0&lt;br /&gt;
! &lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! 1&lt;br /&gt;
! 1&lt;br /&gt;
! 0&lt;br /&gt;
! 1&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 0&lt;br /&gt;
! Counter(C0..C2) value(s) can be read out.&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! 1&lt;br /&gt;
! 1&lt;br /&gt;
! 1&lt;br /&gt;
! 0&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 0&lt;br /&gt;
! Counter&#039;s(C0..C2) state(s) can be read out.&lt;br /&gt;
see below Status Byte&lt;br /&gt;
|-&lt;br /&gt;
! &lt;br /&gt;
! 1&lt;br /&gt;
! 1&lt;br /&gt;
! 0&lt;br /&gt;
! 0&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! x&lt;br /&gt;
! 0&lt;br /&gt;
! Counter&#039;s(C0..C2) value(s) and state(s) can be read out.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
When setting the PIT, the microprocessor first sends a control message, then a count message to the PIT. The counting process will start after the PIT has received these messages, and, in some cases, if it detects the rising [[signal edge|edge]] from the &#039;&#039;&#039;GATE&#039;&#039;&#039; input signal.&lt;br /&gt;
&lt;br /&gt;
On PCs the address for timer0 (chip) is at port 40h..43h like described and the second timer1 (chip) is at 50h..53h.&lt;br /&gt;
&lt;br /&gt;
=== Status Byte ===&lt;br /&gt;
8 bit&amp;lt;br /&amp;gt;&lt;br /&gt;
The Status Byte is read like a 8 bit counter value (port 40h..42h R).&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Bit#    D7    D6    D5    D4    D3    D2    D1    D0&lt;br /&gt;
Name  output  null  RW1  RW0    M2    M1    M0   BCD&lt;br /&gt;
             count&lt;br /&gt;
        -------------------------------------------&lt;br /&gt;
        0     x     x     x     x     x     x     x    Out Pin is 0&lt;br /&gt;
        1     x     x     x     x     x     x     x    Out Pin is 1&lt;br /&gt;
        -------------------------------------------&lt;br /&gt;
        x     0     x     x     x     x     x     x    The value of the latch is loaded into the counter.&lt;br /&gt;
                                                       A new value can be written to the latch.&lt;br /&gt;
        x     1     x     x     x     x     x     x    Counter value is 0.&lt;br /&gt;
        -------------------------------------------&lt;br /&gt;
        x     x     =     =     =     =     =     =    like defined in the Control Word Register&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Operation Modes ==&lt;br /&gt;
The D3, D2, and D1 bits of the &#039;&#039;&#039;Control Word&#039;&#039;&#039; set the operating mode of the timer. There are 6 modes in total; for modes 2 and 3, the D3 bit is ignored, so the missing modes 6 and 7 are aliases for modes 2 and 3. Notice that, for modes 0, 2, 3 and 4, &#039;&#039;&#039;GATE&#039;&#039;&#039; must be set to &#039;&#039;&#039;HIGH&#039;&#039;&#039; to enable counting. For mode 5, the rising edge of &#039;&#039;&#039;GATE&#039;&#039;&#039; starts the count. For details on each mode, see the reference links.&lt;br /&gt;
&lt;br /&gt;
=== Mode 0 (000): Interrupt on Terminal Count ===&lt;br /&gt;
Mode 0 is used for the generation of accurate time delay under software control. In this mode, the counter will start counting from the initial &#039;&#039;&#039;COUNT&#039;&#039;&#039; value loaded into it, down to 0. Counting rate is equal to the input clock frequency.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;OUT&#039;&#039;&#039; pin is set low after the &#039;&#039;&#039;Control Word&#039;&#039;&#039; is written, and counting starts one clock cycle after the &#039;&#039;&#039;COUNT&#039;&#039;&#039; programmed. &#039;&#039;&#039;OUT&#039;&#039;&#039; remains low until the counter reaches 0, at which point &#039;&#039;&#039;OUT&#039;&#039;&#039; will be set high until the counter is reloaded or the &#039;&#039;&#039;Control Word&#039;&#039;&#039; is written. The Gate signal should remain active high for normal counting. If Gate goes low counting get terminated and current count is latched till Gate pulse goes high again.&lt;br /&gt;
&lt;br /&gt;
=== Mode 1 (001): Programmable One Shot ===&lt;br /&gt;
In this mode 8253 can be used as [[Monostable Multivibrator]]. &#039;&#039;&#039;GATE&#039;&#039;&#039; input is used as trigger input.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;OUT&#039;&#039;&#039; will be initially high. &#039;&#039;&#039;OUT&#039;&#039;&#039; will go low on the &#039;&#039;&#039;CLK&#039;&#039;&#039; pulse following a trigger to begin the one-shot pulse, and will remain low until the Counter reaches zero. &#039;&#039;&#039;OUT&#039;&#039;&#039; will then go high and remain high until the &#039;&#039;&#039;CLK&#039;&#039;&#039; pulse after the next trigger.&lt;br /&gt;
&lt;br /&gt;
After writing the Control Word and initial count, the Counter is armed. A trigger results in loading the Counter and setting &#039;&#039;&#039;OUT&#039;&#039;&#039; low on the next &#039;&#039;&#039;CLK&#039;&#039;&#039; pulse, thus starting the one-shot pulse. An initial count of &#039;&#039;&#039;N&#039;&#039;&#039; will result in a one-shot pulse &#039;&#039;&#039;N CLK&#039;&#039;&#039; cycles in duration.&lt;br /&gt;
&lt;br /&gt;
The one-shot is retriggerable, hence &#039;&#039;&#039;OUT&#039;&#039;&#039; will remain low for &#039;&#039;&#039;N CLK&#039;&#039;&#039; pulses after any trigger. The one-shot pulse can be repeated without rewriting the same count into the counter. &#039;&#039;&#039;GATE&#039;&#039;&#039; has no effect on &#039;&#039;&#039;OUT&#039;&#039;&#039;. If a new count is written to the Counter during a oneshot pulse, the current one-shot is not affected unless the counter is retriggered. In that case, the Counter is loaded with the new count and the oneshot pulse continues until the new count expires.&lt;br /&gt;
&lt;br /&gt;
=== Mode 2 (X10): Rate Generator ===&lt;br /&gt;
In this mode, the device acts as a divide-by-n counter, which is commonly used to generate a real-time clock interrupt.&lt;br /&gt;
&lt;br /&gt;
Like other modes, counting process will start the next clock cycle after &#039;&#039;&#039;COUNT&#039;&#039;&#039; is sent. &#039;&#039;&#039;OUT&#039;&#039;&#039; will then remain high until the counter reaches 1, and will go low for one clock pulse. &#039;&#039;&#039;OUT&#039;&#039;&#039; will then go high again, and the whole process repeats itself.&lt;br /&gt;
&lt;br /&gt;
The time between the high pulses depends on the preset count in the counter&#039;s register, and is calculated using the following formula:&lt;br /&gt;
&lt;br /&gt;
Value to be loaded into counter = &amp;lt;math&amp;gt; {\it f_{input}} \over {\it f_{output}} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Note that the values in the &#039;&#039;&#039;COUNT&#039;&#039;&#039; register range from &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; to 1; the register never reaches zero.&lt;br /&gt;
&lt;br /&gt;
=== Mode 3 (X11): Square Wave Generator ===&lt;br /&gt;
This mode is similar to mode 2. However, the duration of the high and low clock pulses of the output will be different from mode 2.&lt;br /&gt;
&lt;br /&gt;
Suppose &#039;&#039;&#039;n&#039;&#039;&#039; is the number loaded into the counter (the &#039;&#039;&#039;COUNT&#039;&#039;&#039; message), the output will be&lt;br /&gt;
* high for &amp;lt;math&amp;gt;n \over 2&amp;lt;/math&amp;gt; counts, and low for &amp;lt;math&amp;gt;n \over 2&amp;lt;/math&amp;gt; counts, if &#039;&#039;&#039;n&#039;&#039;&#039; is even.&lt;br /&gt;
* high for &amp;lt;math&amp;gt;n+1 \over 2&amp;lt;/math&amp;gt; counts, and low for &amp;lt;math&amp;gt;n-1 \over 2&amp;lt;/math&amp;gt; counts, if &#039;&#039;&#039;n&#039;&#039;&#039; is odd.&lt;br /&gt;
&lt;br /&gt;
=== Mode 4 (100): Software Triggered Strobe ===&lt;br /&gt;
After &#039;&#039;&#039;Control Word&#039;&#039;&#039; and &#039;&#039;&#039;COUNT&#039;&#039;&#039; is loaded, the output will remain high until the counter reaches zero. The counter will then generate a low pulse for 1 clock cycle (a strobe) – after that the output will become high again.&lt;br /&gt;
&lt;br /&gt;
=== Mode 5 (101): Hardware Triggered Strobe ===&lt;br /&gt;
This mode is similar to mode 4. However, the counting process is triggered by the &#039;&#039;&#039;GATE&#039;&#039;&#039; input.&lt;br /&gt;
&lt;br /&gt;
After receiving the &#039;&#039;&#039;Control Word&#039;&#039;&#039; and &#039;&#039;&#039;COUNT&#039;&#039;&#039;, the output will be set high. Once the device detects a rising edge on the &#039;&#039;&#039;GATE&#039;&#039;&#039; input, it will start counting. When the counter reaches 0, the output will go low for one clock cycle – after that it will become high again, to repeat the cycle on the next rising edge of &#039;&#039;&#039;GATE&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
== Programming Considerations ==&lt;br /&gt;
On x86 PCs, many video card BIOS and system BIOS will reprogram the second counter for their own use. Reprogramming typically happens during video mode changes, when the video BIOS may be executed, and during system management mode and power saving state changes, when the system BIOS may be executed. This prevents any serious alternative uses of the timer&#039;s second counter on many x86 systems.&lt;br /&gt;
&lt;br /&gt;
The timer that is used by the system on x86 PCs is Channel 0, and its clock ticks at a theoretical value of 1193181.8181... [[Hertz|Hz]], i.e. one third of the [[NTSC]] color [[subcarrier]] frequency, which comes from dividing the system clock (14.31818&amp;amp;nbsp;MHz) by 12. This is a holdover of the very first [[Color Graphics Adapter|CGA]] PCs – they derived all necessary frequencies from a single [[crystal oscillator|quartz crystal]], and to make TV output possible, this quartz had to run at a multiple of the NTSC color subcarrier frequency.&lt;br /&gt;
&lt;br /&gt;
As stated above, Channel 0 is implemented as a counter. Typically, the initial value of the counter is set by sending bytes to the Control, then Data I/O Port registers (the value 36h sent to port 43h, then the low byte to port 40h, and port 40h again for the high byte). The counter counts &#039;&#039;down&#039;&#039; to zero, then sends a [[hardware interrupt]] (IRQ 0, INT 8) to the [[CPU]]. The counter then resets to its initial value and begins to count down again. The fastest possible interrupt frequency is a little over a half of a megahertz. The slowest possible frequency, which is also the one normally used by computers running [[MS-DOS]] or compatible operating systems, is about 18.2&amp;amp;nbsp;Hz. Under these [[real mode]] operating systems, the BIOS accumulates the number of INT 8 calls that it receives in real mode address 0040:006c, which can be read by a program.&lt;br /&gt;
&lt;br /&gt;
As a timer counts down, its value can also be read directly by reading its I/O port &#039;&#039;twice&#039;&#039;, first for the low byte, and then for the high byte. However, in free-running counter applications such as in the x86 PC, it is necessary to first write a [[latch (electronics)|latch]] command for the desired channel to the control register, so that both bytes read will belong to one and the same value.&lt;br /&gt;
&lt;br /&gt;
== Literature ==&lt;br /&gt;
* Gilluwe, Frank van. &#039;&#039;The Undocumented PC&#039;&#039;. A-W Developers Press, 1997. ISBN 0-201-47950-8&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* [http://bochs.sourceforge.net/techspec/intel-82c54-timer.pdf.gz 82C54 Datasheet]&lt;br /&gt;
* [http://www.sharpmz.org/mz-700/8253ovview.htm Overview of the Intel 8253 PIT chip]&lt;br /&gt;
* [http://www.sharpmz.org/mz-700/memio.htm Intel 8253 complete datasheets]&lt;br /&gt;
* [http://www.intel.com/design/archives/periphrl/docs/7178.htm?wapkw=8253 8254/82C54 Programmable Interval Timer FAQ]&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
{{Reflist}}&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:8253}}&lt;br /&gt;
[[Category:Intel chipsets]]&lt;br /&gt;
[[Category:IBM PC compatibles]]&lt;br /&gt;
[[Category:I/O Chips]]&lt;/div&gt;</summary>
		<author><name>131.169.207.137</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Talk:S-matrix&amp;diff=307479</id>
		<title>Talk:S-matrix</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Talk:S-matrix&amp;diff=307479"/>
		<updated>2013-05-19T15:57:08Z</updated>

		<summary type="html">&lt;p&gt;131.169.87.137: /* Definition */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Hostgator is a huge independently owned hosting company running from several state of the art facilities in Dallas, Texas. Hostgator was established in 2002, since then they have proliferated and currently host over 400,000 websites. They are also widely thought about to be the worlds leading service provider of reseller hosting accounts. At present they supply hosting to over 10,000 individual reseller account clients.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;[http://www.google.de/url?url=https://www.facebook.com/HostgatorCoupons2015&amp;amp;rct=j&amp;amp;q=&amp;amp;esrc=s&amp;amp;sa=U&amp;amp;ei=ppYoVd2xO8at7AaWnoA4&amp;amp;ved=0CD0QFjAE&amp;amp;usg=AFQjCNFtydyU23YsyEBeSrFyhX_1kPPCpw google.de]Hostgator offers many various web hosting bundles, and accommodate a broad range of customers.  If you beloved this posting and you would like to receive extra info with regards to [http://orichinese.com/groups/check-out-these-web-hosting-options-that-really-work-well/ Hostgator Discount] kindly take a look at our own page. From the first time webmaster who needs basic, tension free of cost hosting for their personal website; all the means with to large corporations, who need specialist dedicated hosting services.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Hostgator&#039;s hosting bundles can be divided into three groups; basic shared hosting strategies (suitable for the large bulk people), reseller hosting plans (these are generally for people and businesses that wish to &amp;quot;resell&amp;quot; their account resources to customers of their own), and finally committed server plans (these accounts give consumer their own server, so they do not have to share its resources with anybody else). Extremely few of us will every require a dedicated server so this review will concentrate on the shared hosting strategies that Hostgator offer.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Functions&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Hostgator&#039;s 3 primary shared hosting strategies are called: &amp;quot;Hatchling&amp;quot; (the entry level plan priced at $6.95 / month), &amp;quot;Infant&amp;quot; (this is the most popular plan, and it is most likely to please the requirements of an extremely large range of customers), and &amp;quot;Swamp&amp;quot; (much the same as the &amp;quot;Baby&amp;quot; plan, but with boosts in bandwidth and disk area, priced at $14.95 / month).&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;For a full list of attributes and a side by side contrast of all hosting plans you ought to go to Hostgator&#039;s site below. Below is a testimonial of the most important functions of the &amp;quot;Infant&amp;quot; strategy, this is most likely the most appropriate bundle for a lot of users, and it is our favorite plan.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Disk area 100GB - This quantity has been recently updated by Hostgator from 5GB to a massive 100GB. All individuals are likely to find it impossible to exhaust this amount of disk area.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Bandwidth 1000GB/month - Also enhanced is the bandwidth allocation, from 75GB to a seemingly excessive 1000GB. Once again virtually zero possibility of utilizing all that, however it&#039;s nice to understand that you absolutely will not be dealing with extra fees for going over your limitation, even if you have an extremely busy site(s).&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Site Studio website builder - This is a fantastic complimentary program that allows you to develop your website from scratch. There is no demand to take my word for it, as Hostgator provides us with a demo variation of the software application on their site!&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Endless add-on domains - This really is the stand out attribute of this hosting plan (the &amp;quot;Hatchling&amp;quot; strategy just permits 1 domain), and allows you to host as lots of websites as you such as on a single account, at no additional expense. This permits you to make complete use of your enormous bandwidth and disk area allowances, and host numerous websites at a portion of the normal cost.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;99.9 % Uptime guarantee - This essentially tells us that Hostgator is a significant host providing a reliable service. If uptime drops below this figure in any given month then you don&#039;t pay for that months hosting, it&#039;s as easy as that! We would never consider utilizing a host that did not provide a solid uptime assurance; this is purely because there is only one great reason why a host will not offer an uptime guarantee - unreliable uptime!&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;30 Day refund assurance - This has actually become a rather conventional function in the web hosting community, though it&#039;s good to have for included assurance.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Immediate setup - A lot of hosting carriers take 24-48 hours to setup your account however Hostgator promises to have you working in under 15 minutes (they do not charge a setup cost either)!&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Unlimited MySQL data sources - This is very beneficial since each Fantastico (see below) script requires its own MySQL data source.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Fantastico DeLuxe - This excellent program enables you to instantaneously install over 50 scripts through your control panel. Scripts consist of blogs, online forums, galleries, buying carts, and more.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Endless email accounts - Permits you to have as numerous, or as couple of, different e-mail addresses as you like.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;cPanel control board - At the heart of any hosting experience is the control board, luckily Hostgator makes use of among the best units around, a cPanel. It&#039;s well set out and easy to operate. It includes numerous features and provides excellent efficiency. Best of all, there is a complete working demo on the Hostgator site, so you can check it out yourself!&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Customer service and technical support&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Hostgator gives us 24/7 phone support, and live online talk. The reality that you are provided 2 choices to get instantaneous technical support at any time of the day is wonderful. Our experience has always been great when contacting Hostgator, their operatives are really polite and most importantly they seem to understand their things when dealing with technical concerns. However, we always recommend calling them yourself prior to signing up. Inquire a question and see if you&#039;re made an impression on by their response. This constantly tells you a lot about a company!&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Efficiency&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;The performance from Hostgator&#039;s servers is excellent! Hostgator location much tighter restrictions on the variety of websites sharing the same server compared to most other shared hosting providers. This gives greater reliability due to the fact that less strain is put on the servers; and it likewise greatly enhances the rate at which your internet pages run.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Server performance is another among the vital locations where Hostgator identify themselves from the group of various other web hosts.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Our verdict&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Generally there is so much to such as about the way Hostgator does business, they really do seem to have a good grasp on exactly what the average consumer requires from a web hosting supplier. Seldom do you come across reports of unhappy Hostgator customers, and after hosting with them ourselves we now know why! At simply $9.95 / month for the &amp;quot;Infant&amp;quot; plan (which includes unrestricted domains); anybody looking to host more than one website has a quite easy decision to make.&lt;/div&gt;</summary>
		<author><name>131.169.87.137</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Dimensional_reduction&amp;diff=248117</id>
		<title>Dimensional reduction</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Dimensional_reduction&amp;diff=248117"/>
		<updated>2012-07-09T19:36:35Z</updated>

		<summary type="html">&lt;p&gt;131.169.105.6: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The writer is known as Wilber Pegues. The preferred hobby for him and his kids is to perform lacross and he&#039;ll be starting something else along with it. He is an purchase clerk and it&#039;s something he truly appreciate. Alaska is the only place I&#039;ve been residing in but now I&#039;m considering other choices.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Visit my site; certified psychics - [http://help.ksu.edu.sa/node/65129 click through the following website page] -&lt;/div&gt;</summary>
		<author><name>131.169.105.6</name></author>
	</entry>
</feed>