Search results

Jump to navigation Jump to search
  • [[Category:Systems theory]] ...
    528 bytes (80 words) - 09:20, 13 July 2013
  • [[File:Minkowski diagram - asymmetric.svg|thumb|In the theory of relativity both observers assign the event at A to different times.]] ...systems in Minkowski spacetime. As seen to the right, different coordinate systems will disagree on an object's spatial orientation and/or position in time. A ...
    3 KB (486 words) - 17:18, 1 September 2016
  • * 概率论(Probability Theory) # [[Combinatorics (Fall 2010)/Finite set systems|Finite set systems]] | [http://lamda.nju.edu.cn/yinyt/notes/comb2010/comb7.pdf slides] ...
    12 KB (1,494 words) - 14:27, 3 September 2011
  • ...ne by the Babylonians; Ancient Greeks, like [[Ptolemy]] later extended the theory. [[Category:Coordinate systems]] ...
    2 KB (271 words) - 22:25, 4 November 2016
  • ...[[Abstract algebra]] || [[Linear algebra]] || [[Order theory]] || [[Graph theory]] ...l equation]]s || [[Dynamical systems theory|Dynamical systems]] || [[Chaos theory]] ...
    9 KB (1,088 words) - 18:04, 22 August 2017
  • :<font size=3>'''题目''': The approximability of ferromagnetic 2-spin systems ...egree graphs, I will present the zero-free region for ferromagnetic 2-spin systems, which implies an FPTAS based on the method introduced by Barvinok. On the ...
    16 KB (900 words) - 04:52, 13 November 2020
  • :<font size=3>'''题目''': The approximability of ferromagnetic 2-spin systems ...egree graphs, I will present the zero-free region for ferromagnetic 2-spin systems, which implies an FPTAS based on the method introduced by Barvinok. On the ...
    16 KB (900 words) - 04:54, 13 November 2020
  • ...ies. Later, in the early 90s, [[Ralph Greenberg]] has suggested an Iwasawa theory for [[motive (algebraic geometry)|motives]]. ...dditive group of [[p-adic integer]]s. That group, usually written Γ in the theory and with multiplicative notation, can be found as a subgroup of Galois grou ...
    5 KB (835 words) - 22:27, 8 March 2013
  • ...tegers are all in the real numbers. There are also more complicated number systems than the real numbers, such as the [[complex number]]s. Every real number i [[Category:Number theory]] ...
    6 KB (971 words) - 01:36, 21 August 2017
  • ...r [[computer]] [[simulation]] of a relatively complex system. For complex systems, there are many equations and many variables, not just two or three. In man This method generalizes to systems with additional variables. ...
    10 KB (1,386 words) - 15:51, 19 June 2016
  • :<font size=3>'''题目''': The approximability of ferromagnetic 2-spin systems ...egree graphs, I will present the zero-free region for ferromagnetic 2-spin systems, which implies an FPTAS based on the method introduced by Barvinok. On the ...
    20 KB (1,328 words) - 14:52, 20 November 2020
  • == Theory of the Big Bang == ...far beyond our vision. They could have formed their own galaxies and solar systems too. ...
    5 KB (898 words) - 00:12, 25 April 2016
  • ...r) that forms the basis of [[quantum mechanics]], one of the most accurate theory of how [[subatomic particle]]s behave. It is a mathematical equation that w ...e [[conservation of energy|energy is constant]] in many important physical systems (for example: an [[electron]] in an [[atom]]), the second equation of the s ...
    7 KB (1,105 words) - 21:06, 26 June 2017
  • ...struct. Planck units are only one system of [[natural units]] among other systems. They are considered unique, because these units are not based on propertie ...f these constants can be associated with at least one fundamental physical theory: ''c'' with [[special relativity]], ''G'' with [[general relativity]] and [ ...
    4 KB (570 words) - 21:33, 20 October 2014
  • :'''Abstract''':Scalable, coherent many-body systems are of fundamental interest, which could ultimately enable a quantum machin ...be constructed efficiently, realizing these objects in realistic physical systems is a challenging task. Here, we demonstrate experimental generation and det ...
    24 KB (1,651 words) - 02:56, 12 March 2024
  • In formal [[number theory]] a '''Gödel numbering''' is a [[function (mathematics)|function]] which as ...]]s can then represent some form or function. A [[numbering (computability theory)|numbering]] of the set of [[computable function]]s can then be represented ...
    5 KB (850 words) - 23:57, 1 January 2015
  • |align="center"|陈嘉|| Algorithmic Game Theory.<br>Strategic games; mechanism design; combinatorial auction; Vickrey aucti |align="center"|尹一通|| Approximate counting; correlation decay; spin systems. || ...
    4 KB (455 words) - 07:53, 28 December 2011
  • :'''Abstract''': Most people interact with machine learning systems on a daily basis. Such interactions often happen in strategic environments ...re the challenges that arise at the interface of machine learning and game theory: selfish agents may interact with machine learning algorithms strategically ...
    12 KB (1,731 words) - 06:09, 29 April 2019
  • ...ity, Mechanical Engineering, 1939.</ref> Inspired by the high pressure jet systems used in hydraulic mining in the gold fields, Knight developed a bucketed wh ==Theory of operation== ...
    15 KB (2,242 words) - 18:49, 30 May 2017
  • ...].<ref>{{cite book|first=Christopher G. |last=Small |title=The statistical theory of shape |year=1996 |publisher=Springer p4 |isbn=0-387-94729-9 }}</ref> In ...r means an animal must take on complicated oxygen pumping and distributing systems to reach all the cells".'' ...
    4 KB (585 words) - 20:57, 12 March 2013
  • ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...Sperner, which uses concepts called '''shadows''' and '''shades''' of set systems. ...
    24 KB (4,365 words) - 11:50, 5 June 2013
  • ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...Sperner, which uses concepts called '''shadows''' and '''shades''' of set systems. ...
    25 KB (4,389 words) - 09:05, 12 January 2011
  • ...s and Rado, called the sunflower lemma, is a famous result in extremal set theory, and has some important applications in Boolean circuit complexity. ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...
    25 KB (4,523 words) - 13:54, 27 December 2015
  • ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...Sperner, which uses concepts called '''shadows''' and '''shades''' of set systems. ...
    25 KB (4,408 words) - 01:20, 10 November 2011
  • '''Special relativity''' (or '''the special theory of relativity''') is a theory in [[physics]] that was developed and explained by [[Albert Einstein]] in 1 ...ved in [[luminiferous aether]]. Various tiny effects were expected if this theory were true. Gradually it seemed these predictions were not going to work out ...
    15 KB (2,495 words) - 16:23, 9 April 2017
  • ...s and Rado, called the sunflower lemma, is a famous result in extremal set theory, and has some important applications in Boolean circuit complexity. ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...
    32 KB (5,780 words) - 13:32, 2 December 2017
  • ...s and Rado, called the sunflower lemma, is a famous result in extremal set theory, and has some important applications in Boolean circuit complexity. ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...
    32 KB (5,780 words) - 02:49, 24 November 2016
  • ...s and Rado, called the sunflower lemma, is a famous result in extremal set theory, and has some important applications in Boolean circuit complexity. ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...
    32 KB (5,780 words) - 07:54, 28 November 2019
  • ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...Sperner, which uses concepts called '''shadows''' and '''shades''' of set systems. ...
    32 KB (5,800 words) - 07:57, 21 May 2014
  • *[[set theory]] *[[Banach space]] theory ...
    16 KB (2,241 words) - 05:01, 18 January 2017
  • ...olecular orbital]]s. This is used in the [[Hückel method]], [[ligand field theory]], and the [[Woodward–Hoffmann rules]]. Another idea on a larger scale is t ...ic point groups was published in 1936 by Rosenthal and Murphy.<ref>''Group Theory and the Vibrations of Polyatomic Molecules'' Jenny E. Rosenthal and G. M. M ...
    19 KB (2,913 words) - 21:36, 4 November 2015
  • ...s and Rado, called the sunflower lemma, is a famous result in extremal set theory, and has some important applications in Boolean circuit complexity. ...ult, called Sperner's theorem today, initiated the studies of extremal set theory. ...
    50 KB (8,991 words) - 12:23, 21 May 2023
  • | title = Schaum's outline of theory and problems of linear algebra | title = Cauchy and the spectral theory of matrices ...
    13 KB (1,723 words) - 07:13, 11 November 2016
  • ...en.wikipedia.org/wiki/Computational_learning_theory computational learning theory]. ...on is found by Vapnik and Chervonenkis, who use the framework to develop a theory of classifications. ...
    25 KB (4,480 words) - 04:58, 17 November 2010
  • ...en.wikipedia.org/wiki/Computational_learning_theory computational learning theory]. ...on is found by Vapnik and Chervonenkis, who use the framework to develop a theory of classifications. ...
    25 KB (4,480 words) - 08:23, 16 August 2011
  • == Systems of Distinct Representatives (SDR)== {{Theorem|Hall's Theorem (graph theory form)| ...
    19 KB (3,610 words) - 14:17, 19 June 2013
  • == Systems of Distinct Representatives (SDR)== {{Theorem|Hall's Theorem (graph theory form)| ...
    19 KB (3,610 words) - 08:59, 28 May 2014
  • ...4mhz.de/cook.html|title = Proceedings of the Third Annual ACM Symposium on Theory of Computing|pages = 151–158}}</ref> ...able to check <math>1,000,000</math> combinations per second using current systems.<!--How to remove the need for annual editorial review of this eventually o ...
    15 KB (2,427 words) - 22:24, 16 August 2017
  • *The letters ''m'' and ''b'' are constants.<ref>{{cite book|title=Theory and Problems of Beginning Finite Mathematics|last1=Lipschutz|first1=Seymour ...his form is often used in [[geometry]] and in [[system of linear equations|systems of linear equations]]. ...
    14 KB (2,194 words) - 00:02, 2 January 2015
  • == Systems of Distinct Representatives (SDR)== {{Theorem|Hall's Theorem (graph theory form)| ...
    23 KB (4,382 words) - 05:07, 5 November 2010
  • == Systems of Distinct Representatives (SDR)== {{Theorem|Hall's Theorem (graph theory form)| ...
    23 KB (4,382 words) - 02:41, 17 August 2011
  • In probability theory class we have learned the basic concepts of '''events''' and '''random vari ...f events and random variables are related to the foundation of probability theory, which is not the topic of this class. Here we only give an informal descri ...
    34 KB (5,979 words) - 13:52, 20 September 2010
  • == Systems of Distinct Representatives (SDR)== {{Theorem|Hall's Theorem (graph theory form)| ...
    33 KB (6,636 words) - 05:50, 13 June 2023
  • == Systems of Distinct Representatives (SDR)== {{Theorem|Hall's Theorem (graph theory form)| ...
    33 KB (6,643 words) - 11:00, 20 December 2019
  • == Systems of Distinct Representatives (SDR)== {{Theorem|Hall's Theorem (graph theory form)| ...
    33 KB (6,643 words) - 03:26, 22 December 2015
  • == Systems of Distinct Representatives (SDR)== {{Theorem|Hall's Theorem (graph theory form)| ...
    33 KB (6,643 words) - 07:40, 18 December 2017
  • == Systems of Distinct Representatives (SDR)== {{Theorem|Hall's Theorem (graph theory form)| ...
    33 KB (6,643 words) - 10:48, 4 December 2016
  • Note that (*) and (**) are both linear systems with unique solution, thus <math>\tau_{u,v}=\phi_{u,v}</math>. Since electrical networks are linear systems, we can super-pose <math>A</math> and <math>C</math> (summing up the voltag ...
    40 KB (7,046 words) - 08:04, 2 June 2014
  • Note that (*) and (**) are both linear systems with unique solution, thus <math>\tau_{u,v}=\phi_{u,v}</math>. Since electrical networks are linear systems, we can super-pose <math>A</math> and <math>C</math> (summing up the voltag ...
    40 KB (7,046 words) - 10:00, 13 December 2015
  • Note that (*) and (**) are both linear systems with unique solution, thus <math>\tau_{u,v}=\phi_{u,v}</math>. Since electrical networks are linear systems, we can super-pose <math>A</math> and <math>C</math> (summing up the voltag ...
    40 KB (7,049 words) - 15:11, 8 June 2013
  • ...non-linear approach, the orbital approaches at a slightly off angle. The π-systems ability to rotate as the small molecule approaches is crucial in forming ne ...curs through a non-linear approach (see figure 2 at right). However, while theory clearly favors a non-linear approach, there are no obvious experimental imp ...
    13 KB (2,026 words) - 03:33, 17 October 2014