Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „Effacement bit à bit“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Effacement bit à bit" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Effacement bit à bit"
Jacks, Philip J. „The Composition of Giorgio Vasari'sRicordanze: Evidence from an Unknown Draft“. Renaissance Quarterly 45, Nr. 4 (1992): 739–84. http://dx.doi.org/10.2307/2862635.
Der volle Inhalt der QuelleThompson, Seth. „Bit by Bit“. Afterimage 33, Nr. 3 (November 2005): 43–44. http://dx.doi.org/10.1525/aft.2005.33.3.43.
Der volle Inhalt der QuelleJaye, Nathan. „Bit by Bit“. CFA Institute Magazine 25, Nr. 2 (März 2014): 34–37. http://dx.doi.org/10.2469/cfm.v25.n2.11.
Der volle Inhalt der QuelleValantin, Robert, und David Balson. „Bit by Bit“. Media Asia 14, Nr. 1 (Januar 1987): 19–20. http://dx.doi.org/10.1080/01296612.1987.11727009.
Der volle Inhalt der QuelleCarnie, Jamie. „Bit by bit“. New Scientist 218, Nr. 2923 (Juni 2013): 31. http://dx.doi.org/10.1016/s0262-4079(13)61618-8.
Der volle Inhalt der QuelleHumphreys, Olivia. „Mourning Bit by Bit“. British Journal of Psychotherapy 35, Nr. 1 (29.01.2019): 127–30. http://dx.doi.org/10.1111/bjp.12439.
Der volle Inhalt der QuelleCave, Richard C. „Graphing, Bit by Bit“. Mathematics Teacher 88, Nr. 5 (Mai 1995): 372–431. http://dx.doi.org/10.5951/mt.88.5.0372.
Der volle Inhalt der QuelleLucky, R. W. „A bit is a bit is a bit? [Reflections]“. IEEE Spectrum 31, Nr. 7 (Juli 1994): 15. http://dx.doi.org/10.1109/6.294930.
Der volle Inhalt der QuelleLyngstad, Torkild Hovde. „Matthew Salganik: Bit by bit“. Norsk sosiologisk tidsskrift 3, Nr. 03 (03.06.2019): 231–34. http://dx.doi.org/10.18261/issn.2535-2512-2019-03-06.
Der volle Inhalt der QuelleGeorgescu, Iulia. „A bit on the bit“. Nature Physics 12, Nr. 9 (September 2016): 888. http://dx.doi.org/10.1038/nphys3878.
Der volle Inhalt der QuelleDissertationen zum Thema "Effacement bit à bit"
Knight, Michael K. „Bit by bit“. Claremont Graduate University, 2010. http://ccdl.libraries.claremont.edu/u?/stc,82.
Der volle Inhalt der QuelleMelul, Franck. „Développement d'une nouvelle génération de point mémoire de type EEPROM pour les applications à forte densité d'intégration“. Electronic Thesis or Diss., Aix-Marseille, 2022. http://www.theses.fr/2022AIXM0266.
Der volle Inhalt der QuelleThe objective of this thesis was to develop a new generation of EEPROM memory for high reliability and high density applications. First, an innovative memory cell developed by STMicroelectronics - eSTM (Split-gate charge storage memory with buried vertical selection transistor) - was studied as a reference cell. In a second part, to improve the reliability of the eSTM cell and to allow a more aggressive miniaturization of the EEPROM cell, a new memory architecture has been proposed: the BitErasable cell. It showed an excellent reliability and allowed to bring elements of under-standing on the degradation mechanisms present in these memory devices with buried selection transistor. This new architecture also offers the possibility to individually erase cells in a memory array: bit by bit. Aware of the great interest of bit-by-bit erasing, a new erasing mechanism by hot hole injection has been proposed for the eSTM cell. It has shown performances and a level of reliability perfectly compatible with the industrial requirements of Flash-NOR applications
Malm, Martin. „Beckholmen bit för bit“. Thesis, KTH, Arkitektur, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-150351.
Der volle Inhalt der QuelleThe only active shipyard in the Stockholm region with capacity for large ships and the archipelago fleet is situated at Beckholmen. Large investments in infrastructure and buildings are needed in order to secure the enviroment and worker safety. The city has presented a proposal for new planning enabeling these investments. As the investment are large and the site is sensitive the project has many potential risks, especially if the shipyard should encounter economic difficulties in the future. In the citys planning proposal presented in 2012 the whole program for the shipyard is contained within one single volume. The question at issue in ”Beckholmen bit by bit” thus is if planning that splits the program into separate buildings and permits incremental growth is prefarable. After program studies, volume and plan studies the conclusion is that there are many advantages with planning that encourages incremental growth of the shipyard at Beckholmen, especially if the building design is open to change from the beginning. A proposal of a planning and design fulfilling these qualities is also presented.
Hoesel, Stan van. „De constructie van de informatiesnelweg "bit by bit" /“. [Maastricht : Maastricht : Universiteit Maastricht] ; University Library, Maastricht University [Host], 2001. http://arno.unimaas.nl/show.cgi?fid=13064.
Der volle Inhalt der QuelleKaraer, Arzu. „Optimum bit-by-bit power allocation for minimum distortion transmission“. Texas A&M University, 2005. http://hdl.handle.net/1969.1/4760.
Der volle Inhalt der QuelleSandvik, Jørgen Moe. „En variabel bit lengde 9-bit 50MS/S SAR ADC“. Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for elektronikk og telekommunikasjon, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-20654.
Der volle Inhalt der QuelleJames, Calvin L. „ENHANCE BIT SYNCHRONIZER BIT ERROR PERFORMANCE WITH A SINGLE ROM“. International Foundation for Telemetering, 1990. http://hdl.handle.net/10150/613417.
Der volle Inhalt der QuelleAlthough prefiltering prevents the aliasing phenomenon with discrete signal processing, degradation in bit error performance results even when the prefilter implementation is ideal. Degradation occurs when decisions are based on statistics derived from correlated samples, processed by a sample mean estimator. i.e., a discrete linear filter. However, an orthonormal transformation can be employed to eliminate prefiltered sample statistical dependencies, thus permitting the sample mean estimator to provide near optimum performance. This paper will present mathematical justification for elements which adversely affect the bit synchronizer’s decision process and suggest an orthonormal transform alternative. The suggested transform can be implemented in most digital bit synchronizer designs with the addition of a Read Only Memory (ROM).
Fontana, Giulia <1993>. „BIT or no BIT? La tutela degli investimenti italiani all’estero“. Master's Degree Thesis, Università Ca' Foscari Venezia, 2018. http://hdl.handle.net/10579/12317.
Der volle Inhalt der QuelleSegars, Tara. „8-Bit Hunger“. Kent State University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=kent1619176909244462.
Der volle Inhalt der QuelleNäslund, Mats. „Bit extraction, hard-core predicates and the bit security of RSA“. Doctoral thesis, KTH, Numerical Analysis and Computer Science, NADA, 1998. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-2687.
Der volle Inhalt der QuelleBücher zum Thema "Effacement bit à bit"
Kammer, Manfred. Bit um Bit. Stuttgart: J.B. Metzler, 1997. http://dx.doi.org/10.1007/978-3-476-03996-5.
Der volle Inhalt der QuelleSanfield, Steve. Bit by bit. New York: Philomel Books, 1995.
Den vollen Inhalt der Quelle findenArnold, Virginia A. Bit by bit. New York: Macmillan Pub. Co., 1987.
Den vollen Inhalt der Quelle findenLeonard, Stock Lois, Hrsg. Bit by bit. New York: Macmillan/McGraw-Hill School Publishing Company, 1993.
Den vollen Inhalt der Quelle findenKalicharan, Noel. Julia - Bit by Bit. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-73936-2.
Der volle Inhalt der QuelleCreasey, D. J. Progress bit by bit. Birmingham: University of Birmingham, 1988.
Den vollen Inhalt der Quelle findenHayes, Leatha B. Blossom bit by bit. Flushing, MI: Autarkee Press, 1998.
Den vollen Inhalt der Quelle findenOmland, Ib. Arkitektur--bit for bit. [Oslo]: Kolofon Forlag, 2021.
Den vollen Inhalt der Quelle finden1949-, Cave John, Technology Enhancement Programme und Engineering Council, Hrsg. TEP bit by bit controller. London: Engineering Council, 1995.
Den vollen Inhalt der Quelle findenHiroyuki, Tango, Hrsg. Mega-bit memory technology: From mega-bit to giga-bit. Amsterdam: Gordon and Breach, 1998.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Effacement bit à bit"
Kammer, Manfred. „Einleitung“. In Bit um Bit, 1–7. Stuttgart: J.B. Metzler, 1997. http://dx.doi.org/10.1007/978-3-476-03996-5_1.
Der volle Inhalt der QuelleKammer, Manfred. „Materialsammlung und -ordnung“. In Bit um Bit, 8–23. Stuttgart: J.B. Metzler, 1997. http://dx.doi.org/10.1007/978-3-476-03996-5_2.
Der volle Inhalt der QuelleKammer, Manfred. „Die Gestaltung des Manuskripts“. In Bit um Bit, 24–104. Stuttgart: J.B. Metzler, 1997. http://dx.doi.org/10.1007/978-3-476-03996-5_3.
Der volle Inhalt der QuelleKammer, Manfred. „Hilfen bei der Erstellung von Manuskripten“. In Bit um Bit, 105–28. Stuttgart: J.B. Metzler, 1997. http://dx.doi.org/10.1007/978-3-476-03996-5_4.
Der volle Inhalt der QuelleKammer, Manfred. „Elektronische Suchhilfen“. In Bit um Bit, 129–43. Stuttgart: J.B. Metzler, 1997. http://dx.doi.org/10.1007/978-3-476-03996-5_5.
Der volle Inhalt der QuelleAkins, Kathleen, und Martin Hahn. „Colour bit-by-bit“. In Conscious and Unconscious Mentality, 274–310. London: Routledge, 2023. http://dx.doi.org/10.4324/9781003409526-19.
Der volle Inhalt der QuelleWeik, Martin H. „bit“. In Computer Science and Communications Dictionary, 124. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1595.
Der volle Inhalt der QuelleWeik, Martin H. „bit-by-bit asynchronous operation“. In Computer Science and Communications Dictionary, 125. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1596.
Der volle Inhalt der QuelleKroening, Daniel, und Ofer Strichman. „Bit Vectors“. In Decision Procedures, 135–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-50497-0_6.
Der volle Inhalt der QuelleVan Hoey, Jo. „Bit Operations“. In Beginning x64 Assembly Programming, 133–45. Berkeley, CA: Apress, 2019. http://dx.doi.org/10.1007/978-1-4842-5076-1_16.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Effacement bit à bit"
Cho, Christopher J., und Timothy J. Norman. „Bit by bit“. In ICAIF'21: 2nd ACM International Conference on AI in Finance. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3490354.3494380.
Der volle Inhalt der QuelleChen, Junwei, Yangbo Zhang, Xiao Kang und Huaying Shu. „Bit and Bit Product Thinking“. In 2013 International Conference on Advanced Computer Science and Electronics Information. Paris, France: Atlantis Press, 2013. http://dx.doi.org/10.2991/icacsei.2013.170.
Der volle Inhalt der QuelleFryklund, Bob. „Changing the Game Bit by Bit“. In Offshore Technology Conference. Offshore Technology Conference, 2010. http://dx.doi.org/10.4043/21076-ms.
Der volle Inhalt der QuelleLiu, Bo, Yuhao Sun und Bo Liu. „Translational Bit-by-Bit Multi-bit Quantization for CRNN on Keyword Spotting“. In 2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC). IEEE, 2019. http://dx.doi.org/10.1109/cyberc.2019.00082.
Der volle Inhalt der QuelleTang, Guang-Ming, Kazuyoshi Takagi und Naofumi Takagi. „A 4-Bit Bit-Slice Multiplier for a 32-Bit RSFQ Microprocessor“. In 2015 15th International Superconductive Electronics Conference (ISEC). IEEE, 2015. http://dx.doi.org/10.1109/isec.2015.7383428.
Der volle Inhalt der QuelleWells, Michael, Tim Marvel und Chad Beuershausen. „Bit Balling Mitigation in PDC Bit Design“. In IADC/SPE Asia Pacific Drilling Technology Conference and Exhibition. Society of Petroleum Engineers, 2008. http://dx.doi.org/10.2118/114673-ms.
Der volle Inhalt der QuelleUlichney, Robert A., und Shiufun Cheung. „Pixel bit-depth increase by bit replication“. In Photonics West '98 Electronic Imaging, herausgegeben von Giordano B. Beretta und Reiner Eschbach. SPIE, 1998. http://dx.doi.org/10.1117/12.298285.
Der volle Inhalt der QuelleMacini, Paolo, Matteo Magagni und Pietro Valente. „Drill-Bit Catalog and Bit Index: a New Method for Bit Performance Evaluation“. In SPE Latin American and Caribbean Petroleum Engineering Conference. Society of Petroleum Engineers, 2005. http://dx.doi.org/10.2118/94798-ms.
Der volle Inhalt der QuelleLo, Yun-Chen, und Ren-Shuo Liu. „Bit-Serial Cache: Exploiting Input Bit Vector Repetition to Accelerate Bit-Serial Inference“. In 2023 60th ACM/IEEE Design Automation Conference (DAC). IEEE, 2023. http://dx.doi.org/10.1109/dac56929.2023.10247749.
Der volle Inhalt der QuelleMatsumoto, Takashi, Tony Dunnigan und Maribeth Back. „Post-bit“. In the 13th annual ACM international conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1101149.1101197.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Effacement bit à bit"
Stokke, Knut Bjørn, und Eli Havnen. "Bit for bit" utbygging i kystsonen. Oslo: By- og regionforskningsinstituttet NIBR, 2009. http://dx.doi.org/10.7577/nibr/samarbeidsrapport/2009/1.
Der volle Inhalt der QuelleHerrero Gutiérrez, FJ. Del verbo al bit. Revista Latina de Comunicación Social, Dezember 2016. http://dx.doi.org/10.4185/cac115.
Der volle Inhalt der QuelleHerrero Gutiérrez, FJ, und C. Mateos Martín. Del verbo al bit. Revista Latina de Comunicación Social, Dezember 2016. http://dx.doi.org/10.4185/cac116.
Der volle Inhalt der QuelleThomson, M. Greasing the QUIC Bit. RFC Editor, August 2022. http://dx.doi.org/10.17487/rfc9287.
Der volle Inhalt der QuelleKatagi, M., und S. Moriai. The 128-Bit Blockcipher CLEFIA. RFC Editor, März 2011. http://dx.doi.org/10.17487/rfc6114.
Der volle Inhalt der QuelleMuley, P., und M. Aissaoui, Hrsg. Pseudowire Preferential Forwarding Status Bit. RFC Editor, Februar 2013. http://dx.doi.org/10.17487/rfc6870.
Der volle Inhalt der QuelleBergman, O., und C. B. Thorn. String bit models for superstring. Office of Scientific and Technical Information (OSTI), Dezember 1995. http://dx.doi.org/10.2172/179289.
Der volle Inhalt der QuelleMumm, R. H., und S. A. Parker. BMD/ADA Bit-Oriented Message Definer: A Tool to Define Bit-Oriented Messages in Ada. Fort Belvoir, VA: Defense Technical Information Center, Dezember 1990. http://dx.doi.org/10.21236/ada233576.
Der volle Inhalt der QuelleHerrero Gutiérrez, FJ, C. Mateos Martín, S. Toledano Buendía, A. Ardèvol Abreu und M. Trenta. Del verbo al bit. Segunda edición. Revista Latina de Comunicación Social, Februar 2017. http://dx.doi.org/10.4185/cac116edicion2.
Der volle Inhalt der QuelleAndersen, S., A. Duric, H. Astrom, R. Hagen, W. Kleijn und J. Linden. Internet Low Bit Rate Codec (iLBC). RFC Editor, Dezember 2004. http://dx.doi.org/10.17487/rfc3951.
Der volle Inhalt der Quelle