Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Dyadic_transformation> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Dyadic_transformation abstract "The dyadic transformation (also known as the dyadic map, bit shift map, 2x mod 1 map, Bernoulli map, doubling map or sawtooth map) is the mapping (i.e., recurrence relation) produced by the rule .Equivalently, the dyadic transformation can also be defined as the iterated function map of the piecewise linear function The name bit shift map arises because, if the value of an iterate is written in binary notation, the next iterate is obtained by shifting the binary point one bit to the right, and if the bit to the left of the new binary point is a "one", replacing it with a zero.The dyadic transformation provides an example of how a simple 1-dimensional map can give rise to chaos.".
- Dyadic_transformation thumbnail Dyadic_trans.gif?width=300.
- Dyadic_transformation wikiPageExternalLink gkw.pdf.
- Dyadic_transformation wikiPageID "1501024".
- Dyadic_transformation wikiPageRevisionID "580690940".
- Dyadic_transformation hasPhotoCollection Dyadic_transformation.
- Dyadic_transformation subject Category:Chaotic_maps.
- Dyadic_transformation type Artifact100021939.
- Dyadic_transformation type ChaoticMaps.
- Dyadic_transformation type Creation103129123.
- Dyadic_transformation type Map103720163.
- Dyadic_transformation type Object100002684.
- Dyadic_transformation type PhysicalEntity100001930.
- Dyadic_transformation type Representation104076846.
- Dyadic_transformation type Whole100003553.
- Dyadic_transformation comment "The dyadic transformation (also known as the dyadic map, bit shift map, 2x mod 1 map, Bernoulli map, doubling map or sawtooth map) is the mapping (i.e., recurrence relation) produced by the rule .Equivalently, the dyadic transformation can also be defined as the iterated function map of the piecewise linear function The name bit shift map arises because, if the value of an iterate is written in binary notation, the next iterate is obtained by shifting the binary point one bit to the right, and if the bit to the left of the new binary point is a "one", replacing it with a zero.The dyadic transformation provides an example of how a simple 1-dimensional map can give rise to chaos.".
- Dyadic_transformation label "Bernoulli-Abbildung".
- Dyadic_transformation label "Dyadic transformation".
- Dyadic_transformation label "Décalage de Bernoulli (mathématiques)".
- Dyadic_transformation sameAs Bernoulli-Abbildung.
- Dyadic_transformation sameAs Décalage_de_Bernoulli_(mathématiques).
- Dyadic_transformation sameAs m.05691b.
- Dyadic_transformation sameAs Q826704.
- Dyadic_transformation sameAs Q826704.
- Dyadic_transformation sameAs Dyadic_transformation.
- Dyadic_transformation wasDerivedFrom Dyadic_transformation?oldid=580690940.
- Dyadic_transformation depiction Dyadic_trans.gif.
- Dyadic_transformation isPrimaryTopicOf Dyadic_transformation.
