Image de couverture de livre

Mechanical alphabet, TM1357 (Low res.)

Fuente: Zenodo

Enregistré dans:

Détails bibliographiques
Auteur principal:	Tekniskamuseet
Format:	Recurso digital
Publié:	Zenodo 2017
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Mechanical alphabet, TM1356
par: Tekniskamuseet
Publié: (2017)

Substitutions on compact alphabets
par: Mañibo, Neil, et autres
Publié: (2022)

Substitutions on compact alphabets
par: Neil Mañibo, et autres
Publié: (2025)

Olh@res
Publié: (2021)

Poster Abstracts (by alphabetic order)
par:
Publié: (2011)

Ocean Primary Productivity at OPPWG_1357
par: OReilly, J
Publié: (2003)

ENSEMBITS: an alphabet of protein conformational ensembles
par: Shi, Kaiwen, et autres
Publié: (2026)

Optimizing alphabet reduction pairs of arrays
par: Culus, Jean-François, et autres
Publié: (2024)

Speaker’s Oral presentations (by alphabetic order)
par:
Publié: (2011)

Documentation of sediment core PS1357-2
par: van Enst, J W, et autres
Publié: (2005)

Oceanography at CTD/bottle station IFREMER_1357
par: IFREMER
Publié: (2001)

Uptake and leaching of octahydro-1,3,5,7-tetranitro-1,3,5,7-tetrazocine by hybrid poplar trees
Publié: (2002)

Sorption and degradation of octahydro-1,3,5,7-tetra-nitro-1,3,5,7-tetra-zocine in soil
Publié: (2003)

Thermal Gradient Effects on Local Hotspot Ignition in 1,3,5,7‐Tetranitro‐1,3,5,7‐tetrazocane (HMX)
par: Brenden W. Hamilton, et autres
Publié: (2025)

Similarities and dissimilarities between English and Uzbek alphabets.
par: Boymuratov Alijon
Publié: (2023)

merszym/alphabet: Version v0.6
par: Merlin Szymanski
Publié: (2026)

merszym/alphabet: Version v0.3
par: Merlin Szymanski
Publié: (2026)

merszym/alphabet: Version v0.2
par: Merlin Szymanski
Publié: (2026)

Reduced complexities for sequences over finite alphabets
par: Campbell, John M., et autres
Publié: (2025)

The reflection complexity of sequences over finite alphabets
par: Allouche, Jean-Paul, et autres
Publié: (2024)

Prescribed distinct-digit growth in countable alphabets
par: Lee, Ying Wai
Publié: (2026)

Universal channel coding for general output alphabet
par: Hayashi, Masahito
Publié: (2015)

Orientable sequences over non-binary alphabets
par: Alhakim, Abbas, et autres
Publié: (2024)

Combinatorial alphabet-dependent bounds for insdel codes
par: Kong, Xiangliang, et autres
Publié: (2024)

Galois LCD codes over mixed alphabets
par: Bajalan, Maryam, et autres
Publié: (2022)

Impact of articles written in non‐alphabet languages
par: Joe Iwanaga, et autres
Publié: (2024)

El concepto de "res" en los juristas romanos, II: Las "res communes omnium"
par: Juan David Terrazas Ponce
Publié: (2012)

Reliable computation by large-alphabet formulas in the presence of noise
par: Tan, Andrew K., et autres
Publié: (2023)

The complexity of finite smooth words over binary alphabets
par: Cassaigne, Julien, et autres
Publié: (2026)

Neuroscience applied to learning alphabetic principles: new proposals
par: Leonor Scliar-Cabral
Publié: (2012)

Diatom distribution in IODP Hole 318-U1357B
par: Crosta, Xavier, et autres
Publié: (2020)

Core summary for IODP Hole 318-U1357A
par: Escutia Dotti, Carlota, et autres
Publié: (2013)

Core summary for IODP Hole 318-U1357B
par: Escutia Dotti, Carlota, et autres
Publié: (2013)

Core summary for IODP Hole 318-U1357C
par: Escutia Dotti, Carlota, et autres
Publié: (2013)

Moduli of real (res. quaternionic) L-connections
par: Jaiswal, Ayush
Publié: (2024)

Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case
par: Arunachalam, Srinivasan, et autres
Publié: (2021)

Information-to-energy trade-offs and the optimal alphabet of polymer replication
par: Hernández, Damián G.
Publié: (2026)

Minimal subshifts of prescribed mean dimension over general alphabets
par: Wang, Xiangtong, et autres
Publié: (2024)

Worst-case optimal adaptive alphabetic prefix-free coding
par: Gagie, Travis
Publié: (2021)

A pumping-like lemma for languages over infinite alphabets
par: Danieli, Yoav
Publié: (2025)