Search results
Jump to navigation
Jump to search
- ...n on [[formal language]]s which formalises the action of [[gene splicing]] in [[molecular biology]]. A '''splicing language''' is a language generated b :<math> r(L) = \{ xady : xabq, pcdy \in L \} \ . </math> ...3 KB (433 words) - 04:29, 30 June 2016
- In [[mathematical cryptography]], a '''Kleinian integer''' is a [[complex numb ...)|ring]] called the '''Kleinian ring''', which is the [[ring of integers]] in the imaginary [[quadratic field]] <math>\mathbb{Q}(\sqrt{-7})</math>. This ...1 KB (196 words) - 10:26, 20 January 2022
- In [[linear algebra]], let {{math|1=''A'' = (''a<sub>ij</sub>'')}} b ...ix Iterative Analysis |publisher=[[Springer Science+Business Media]] |year=2006 |isbn=1-4020-3555-1 |edition=2nd |page=92 |chapter=Basic Iterative Methods ...917 bytes (120 words) - 23:54, 5 November 2024
- ...Second Preimages for SMASH |series=Lecture Notes in Computer Science |year=2006|volume=4377|pages=101–111|doi=10.1007/11967668_7|isbn=978-3-540-69327-7}}</ ...Cryptographic Hash Function], Accessed 23 November 2009</ref> SMASH comes in two versions: 256-bit and 512-bit. Each version was supposed to rival [[SHA ...2 KB (331 words) - 16:47, 22 August 2023
- ...divided into sixteen chapters and covers all the commonly discussed topics in such texts including planetary positions, timekeeping and calendar constru ...=41 |issue=1 Supplement |pages=S56-S65 |url=https://cahc.jainuniversity.ac.in/assets/ijhs/Vol41_1_11_Supplement_Grahalaghavam.pdf |access-date=11 January ...6 KB (833 words) - 12:56, 13 January 2025
- ...hresholds |eprint=math/0603218 }}</ref> It was proven in a paper published in 2024.<ref name=pp24/> ...when [[phase transition]]s occur in systems.<ref name=":0" /> For example, in a [[random network]] with <math>N</math> nodes, where each edge is included ...3 KB (420 words) - 23:49, 27 February 2025
- ...is an electronic [[true RMS converter]] invented by [[David E. Blackmer]] in 1971. The Blackmer detector, coupled with the [[Blackmer gain cell]], forms ...hesis theory was developed by [[Douglas Frey]] in 1993.{{sfn|Roberts|Leung|2006|p=11}} ...8 KB (1,091 words) - 19:48, 11 April 2021
- {{Short description|Matroid in which every permutation is a symmetry}} ...e definition is that every [[permutation]] of the elements is a [[Symmetry in mathematics|symmetry]]. ...6 KB (968 words) - 23:21, 18 July 2020
- In mathematics and computer science, the '''critical exponent''' of a finite or infinite sequence of symbols ov ...factors which are β-powers for any β ≥ α.<ref name=K281>{{harvtxt|Krieger|2006}} p.281</ref> ...5 KB (757 words) - 23:40, 5 September 2022
- ...mber|real]])<br /><math>\lambda > 0\,</math> (real)<br /><math>\mathbf{W} \in\mathbb{R}^{D\times D}</math> scale matrix ([[positive-definite matrix|pos. support =<math>\boldsymbol\mu\in\mathbb{R}^D ; \boldsymbol\Lambda \in\mathbb{R}^{D\times D}</math> [[covariance matrix]] ([[positive-definite mat ...5 KB (623 words) - 21:05, 24 April 2023
- In [[polymer science]] '''Flory–Rehner equation''' is an equation that describes the mixing of [ It describes the equilibrium swelling of a lightly crosslinked polymer in terms of crosslink density and the quality of the [[solvent]]. ...4 KB (580 words) - 11:59, 9 March 2023
- ...solution]] containing 2 g of [[glucose]] and 2 g of [[fructose]] in a total of 5 g of solution contains 2/(2+2)=50% glucose on a dry basis ...ddition to the dry basis, other bases are used:{{sfn|Iowa State University|2006|p=1}} ...4 KB (526 words) - 20:09, 22 February 2025
- ...ter scientist, and textbook author. She is a professor emerita of computer science at [[Indiana University–Purdue University Indianapolis]]{{r|iupui}} and at ...tson University]] in 1962,{{r|green}} and completed a Ph.D. in mathematics in 1969 at [[Arizona State University]]. Her dissertation, ''Some Results on < ...6 KB (815 words) - 05:34, 7 June 2024
- In [[graph theory]], a '''nonblocker''' is a subset of vertices in an [[undirected graph]], all of which are adjacent to vertices outside of t The computational problem of finding the largest nonblocker in a graph was formulated by {{harvtxt|Papadimitriou|Yannakakis|1991}}, who ob ...5 KB (708 words) - 06:40, 18 July 2024
- In [[graph theory]], a branch of [[mathematics]], two graphs ''G'' and ''H'' a Homomorphic equivalence also comes up in the theory of [[database]]s. Given a [[database schema]], two [[instance (d ...1 KB (216 words) - 17:31, 14 August 2024
- ...=math/0603493}} (published in vol. 2 of the Proceedings of the ICM, Madrid 2006, pages 813–826)</ref> Mabuchi is known for introducing the [[Mabuchi functi ...ginal Japanese by Hisashi Kobayashi)</ref> There he graduated with a Ph.D. in 1977 with thesis ''C3-Actions and Algebraic Threefolds with Ample Tangent B ...6 KB (781 words) - 19:27, 8 February 2023
- In [[mathematics]], an '''automatic semigroup''' is a finitely generated [[sem ...least one representative in <math>L</math> and such that for each <math>a \in A \cup \{\varepsilon\}</math>, the relation consisting of pairs <math>(u,v) ...6 KB (772 words) - 21:51, 25 February 2025
- {{short description|Intermittent increases and decreases in activity}} ...statistics]], '''burstiness''' is the intermittent increases and decreases in activity or [[frequency]] of an event.<ref name="Lambiotte">Lambiotte, R. ( ...3 KB (492 words) - 05:03, 9 September 2024
- ...a [[photography|(digital or film) imaging system]] is typically described in the terms of the signal level that yields a threshold level of SNR. Industry standards define sensitivity in terms of the [[Film speed|ISO film speed]] equivalent, using SNR thresholds ...3 KB (445 words) - 16:00, 10 February 2024
- | caption = Pixton at the Workshop ''[[Moduli space|Moduli Spaces]] in Algebraic Geometry'', [[Mathematical Research Institute of Oberwolfach|Ober ...an American [[mathematician]] at the [[University of Michigan]]. He works in [[enumerative geometry]], and is also known for his [[chess]] playing, wher ...10 KB (1,404 words) - 04:17, 2 November 2024