Dissertationen zum Thema „Effacement bit à bit“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Dissertationen für die Forschung 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.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
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 QuelleXiao, Xin, Bane Vasic und Shu Lin. „MULTI-BIT BIT-FLIPPING ALGORITHM FOR COLUMN WEIGHT-4 LDPC CODES“. International Foundation for Telemetering, 2017. http://hdl.handle.net/10150/627015.
Der volle Inhalt der Quelle吳景濤 und King-to Ng. „A novel bit allocation buffer control algorithm for low bit-rate videocompression“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31221518.
Der volle Inhalt der QuelleZimic, Sheila. „Internetgenerationen bit för bit : Representationer av IT och ungdom i ett informationssamhälle“. Doctoral thesis, Mittuniversitetet, Avdelningen för informations- och kommunikationssystem, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-21926.
Der volle Inhalt der QuelleSimón, Gallego Carlos. „Bit-Torrent in Erlang“. Thesis, Uppsala University, Department of Information Technology, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-98284.
Der volle Inhalt der QuelleThe goal of my project has been to programme a Bit-torrent application using Erlang language. A Bit-Torrent application permits the user to download files from the system and share files at the same time. The reason Erlang was chosen is because this programming language has suitable features for concurrency and distributed system.
The most important aspect I have considered in my project has been to manage a proper behaviour of the system, more than the simply fact of transferring stuff. This way, the program will be able to response to changes immediately. The changes could be: a user uploads a new file to share with other peers, a file is removed, new chunks of a file appear… and others like that.
My Bit-Torrent system contains five modules: Bittorrent, Tracker, Statistic, Server and User module, and all of them will be explained going into details in this document.
Burgess, George, und Lloyd Bridges. „Single Board Bit Synchronizer“. International Foundation for Telemetering, 1989. http://hdl.handle.net/10150/614628.
Der volle Inhalt der QuelleASIC developments have made it possible to include the essential signal processing functions for data detection, clock recovery, and NCO in a single custom-designed chip. Using this chip and PLDs enabled the implementation of a fully-featured bit synchronizer on a single VME board in a rack-mountable 1.75" high, 19" wide chassis. This represents a space savings of 2/3 over existing units. The data rates supported are 250 bps to 5Mbps (2.5 Mbps biphase).
Grayson, Neil R. „The Bit - Collected Stories“. The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1555428898931184.
Der volle Inhalt der QuelleMontalvo, Ramirez Luis Anibal. „VLSI implementation of control section of overlapped 3-bit scanning 64-bit multiplier“. Ohio : Ohio University, 1986. http://www.ohiolink.edu/etd/view.cgi?ohiou1183141735.
Der volle Inhalt der QuelleBlue, Ryan. „The bit probe model for membership queries [electronic resource] : non-adaptive bit queries /“. College Park, Md.: University of Maryland, 2009. http://hdl.handle.net/1903/9649.
Der volle Inhalt der QuelleThesis research directed by: Dept. of Computer Science. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Ng, King-to. „A novel bit allocation buffer control algorithm for low bit-rate video compression /“. Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20192733.
Der volle Inhalt der QuelleWyman, Richard Hayden. „Bit-plane differential EZW for the compression of video for available bit-rate channels“. Thesis, Imperial College London, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.313533.
Der volle Inhalt der QuelleWilson-Scorgie, Dorothea Jane. „Every last bit of you“. Thesis, University of British Columbia, 2013. http://hdl.handle.net/2429/44885.
Der volle Inhalt der QuelleAmbrose, D. „Diamond core bit performance analysis“. Thesis, University of Nottingham, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.378761.
Der volle Inhalt der QuelleAhmad, Nurul Nadia. „Minimum bit error ratio beamforming“. Thesis, University of Southampton, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.418966.
Der volle Inhalt der QuelleFREITAS, LUCAS DE. „MANGUE: BIT, SCENE AND AUTORSHIP“. PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2013. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=28349@1.
Der volle Inhalt der QuelleFUNDAÇÃO DE APOIO À PESQUISA DO ESTADO DO RIO DE JANEIRO
O Manguebit, cena Mangue ou, como é mais comumente conhecido, Manguebeat, movimentação cultural que eclodiu em Recife no início dos anos de 1990, foi abordado por duas dimensões dos impactos que os usos dos aparatos tecnológicos tiveram em relação à autoria. Primeiro, refletiu-se sobre os diferentes horizontes de expectativas mais ou menos rascunhados pelas próprias mídias (LP, K7, CD etc.), nos diversos momentos em que os articuladores do Manguebit as utilizaram em experimentos musicais. Dos K7, o amadorismo e descentramento da figura unitária do autor, às práticas da indústria fonográfica quando contrata alguns mangueboys, o profissional e o filtro imposto pelas estratégias de marketing – negociações do choque de distintos modus operandi. Depois, a construção da cena Mangue foi abordada a partir das estratégias coletivas e o uso de equipamentos e espaços precários enquanto condições de existência, as saídas encontradas pelos mangueboys para a formação de uma cena cultural num momento de extrema hostilidade ao contemporâneo e de forte tensionamento socioeconômico – criação de circuitos alternativos a partir de festas, bares, festivais e coletâneas, o investimento em amplas parcerias e autopromoção.
Manguebit, Mangue scene or, as is more commonly known, Manguebeat – a cultural movement which pop up in Recife in early 1990 – was addressed using two different dimensions of the impacts brought by the use of technological devices on the matter of authorship. First, this study reflects on the different horizons of expectations more or less framed by the media themselves (LP, K7, CD etc.), in the distinct moments in which the organizers of Manguebit utilized them in their musical experiments. From K7 – the amateurism and decentration of unitary figure of the author – to the practices of the music industry when hires some mangueboys, and the professional posture and filters imposed by marketing strategies – including negotiations after shock of different modus operandi. Then development of the Mangue scene was discussed from collective strategies and the use of precarious equipment and spaces as existence conditions, the way outs created by mangueboys to the formation of a cultural scene at a time of extreme hostility to the contemporary and strong socioeconomic tension – creation of alternative circuits with parties, bars, festivals and compilations, extensive investment in partnerships and self-promotion.
Esterina, Ria. „Commercialization of bit-patterned media“. Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/54199.
Der volle Inhalt der QuelleThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student submitted PDF version of thesis.
Includes bibliographical references (p. 75-79).
Realm of data storage density has expanded from gigabyte- to terabyte-domain. In such a high areal density, bit-patterned media is a promising candidate to overcome the superparamagnetic limit faced by the conventional continuous media. However, the patterned media concept has not been realized in mass production due to several reasons. Beside the stringent requirement of high-resolution lithography, high production cost is inevitably the major challenging problem. If a low-cost mass fabrication scheme is available, bit-patterned media will be an innovative way in hard disk technology to achieve a storage density beyond 1 Tb/in². The objective of this thesis is to review the patterned media technology and discuss its challenges and commercialization viability. A possible mass-production scheme is discussed. Electron beam lithography and self assembly process of block copolymer are used to fabricate the master template. To ensure high throughput, template replication as well as disk fabrication are carried out by UV-nanoimprint lithography (UV-NIL). Considering the large opportunity of patterned media to enter the market, a business plan was constructed. Enormous profit was proved to be possible when the barrier of technology, intellectual property, and funding can be surpassed. Therefore, patterned media shows to be superior in terms of performance and cost compared to the conventional media.
by Ria Esterina.
M.Eng.
Kritzinger, Carl. „Low bit rate speech coding“. Thesis, Stellenbosch : University of Stellenbosch, 2006. http://hdl.handle.net/10019.1/2078.
Der volle Inhalt der QuelleDespite enormous advances in digital communication, the voice is still the primary tool with which people exchange ideas. However, uncompressed digital speech tends to require prohibitively high data rates (upward of 64kbps), making it impractical for many applications. Speech coding is the process of reducing the data rate of digital voice to manageable levels. Parametric speech coders or vocoders utilise a-priori information about the mechanism by which speech is produced in order to achieve extremely efficient compression of speech signals (as low as 1 kbps). The greater part of this thesis comprises an investigation into parametric speech coding. This consisted of a review of the mathematical and heuristic tools used in parametric speech coding, as well as the implementation of an accepted standard algorithm for parametric voice coding. In order to examine avenues of improvement for the existing vocoders, we examined some of the mathematical structure underlying parametric speech coding. Following on from this, we developed a novel approach to parametric speech coding which obtained promising results under both objective and subjective evaluation. An additional contribution by this thesis was the comparative subjective evaluation of the effect of parametric speech coding on English and Xhosa speech. We investigated the performance of two different encoding algorithms on the two languages.
Guadiana, Juan M., und Fil Macias. „ENCRYPTED BIT ERROR RATE TESTING“. International Foundation for Telemetering, 2002. http://hdl.handle.net/10150/607507.
Der volle Inhalt der QuelleEnd-to-End testing is a tool for verifying that Range Telemetry (TM) System Equipment will deliver satisfactory performance throughout a planned flight test. A thorough test verifies system thresholds while gauging projected mission loading all in the presence of expected interference. At the White Sands Missile Range (WSMR) in New Mexico, system tests are routinely conducted by Range telemetry Engineers and technicians in the interest of ensuring highly reliable telemetry acquisition. Even so, flight or integration tests are occasionally halted, unable to complete these telemetry checks. The Navy Standard Missile Program Office and the White Sands Missile Range, have proactively conducted investigations to identify and eliminate problems. A background discussion is provided on the serious problems with the launcher acquisition, which were resolved along the way laying the ground work for effective system testing. Since there were no provisions to test with the decryption equipment an assumption must be made. Encryption is operationally transparent and reliable. Encryption has wide application, and for that reason the above assumption must be made with confidence. A comprehensive mission day encrypted systems test is proposed. Those involved with encrypted telemetry systems, and those experiencing seemingly unexplainable data degradations and other problems with or without encryption should review this information.
Loebner, Christopher E. „Bit Error Problems with DES“. International Foundation for Telemetering, 1993. http://hdl.handle.net/10150/611877.
Der volle Inhalt der QuelleThe Data Encryption Standard (DES) was developed in 1977 by IBM for the National Bureau of Standards (NBS) as a standard way to encrypt unclassified data for security protection. When the DES decrypts the encrypted data blocks, it assumes that there are no bit errors in the data blocks. It is the object of this project to determine the Hamming distance between the original data block and the data block after decryption if there occurs a single bit error anywhere in the encrypted bit block of 64 bits. This project shows that if a single bit error occurs anywhere in the 64-bit encrypted data block, a mean Hamming distance of 32 with a standard deviation of 4 is produced between the original bit block an the decrypted bit block. Furthermore, it is highly recommended by this project to use a forward error correction scheme like BCH (127, 64) or Reed-Solomon (127, 64) so that the probability of this bit error occurring is decreased.
Al-Rababa'a, Ahmad. „Arithmetic bit recycling data compression“. Doctoral thesis, Université Laval, 2016. http://hdl.handle.net/20.500.11794/26759.
Der volle Inhalt der QuelleLa compression des données est la technique informatique qui vise à réduire la taille de l'information pour minimiser l'espace de stockage nécessaire et accélérer la transmission des données dans les réseaux à bande passante limitée. Plusieurs techniques de compression telles que LZ77 et ses variantes souffrent d'un problème que nous appelons la redondance causée par la multiplicité d'encodages. La multiplicité d'encodages (ME) signifie que les données sources peuvent être encodées de différentes manières. Dans son cas le plus simple, ME se produit lorsqu'une technique de compression a la possibilité, au cours du processus d'encodage, de coder un symbole de différentes manières. La technique de compression par recyclage de bits a été introduite par D. Dubé et V. Beaudoin pour minimiser la redondance causée par ME. Des variantes de recyclage de bits ont été appliquées à LZ77 et les résultats expérimentaux obtenus conduisent à une meilleure compression (une réduction d'environ 9% de la taille des fichiers qui ont été compressés par Gzip en exploitant ME). Dubé et Beaudoin ont souligné que leur technique pourrait ne pas minimiser parfaitement la redondance causée par ME, car elle est construite sur la base du codage de Huffman qui n'a pas la capacité de traiter des mots de code (codewords) de longueurs fractionnaires, c'est-à-dire qu'elle permet de générer des mots de code de longueurs intégrales. En outre, le recyclage de bits s'appuie sur le codage de Huffman (HuBR) qui impose des contraintes supplémentaires pour éviter certaines situations qui diminuent sa performance. Contrairement aux codes de Huffman, le codage arithmétique (AC) peut manipuler des mots de code de longueurs fractionnaires. De plus, durant ces dernières décennies, les codes arithmétiques ont attiré plusieurs chercheurs vu qu'ils sont plus puissants et plus souples que les codes de Huffman. Par conséquent, ce travail vise à adapter le recyclage des bits pour les codes arithmétiques afin d'améliorer l'efficacité du codage et sa flexibilité. Nous avons abordé ce problème à travers nos quatre contributions (publiées). Ces contributions sont présentées dans cette thèse et peuvent être résumées comme suit. Premièrement, nous proposons une nouvelle technique utilisée pour adapter le recyclage de bits qui s'appuie sur les codes de Huffman (HuBR) au codage arithmétique. Cette technique est nommée recyclage de bits basé sur les codes arithmétiques (ACBR). Elle décrit le cadriciel et les principes de l'adaptation du HuBR à l'ACBR. Nous présentons aussi l'analyse théorique nécessaire pour estimer la redondance qui peut être réduite à l'aide de HuBR et ACBR pour les applications qui souffrent de ME. Cette analyse démontre que ACBR réalise un recyclage parfait dans tous les cas, tandis que HuBR ne réalise de telles performances que dans des cas très spécifiques. Deuxièmement, le problème de la technique ACBR précitée, c'est qu'elle requiert des calculs à précision arbitraire. Cela nécessite des ressources illimitées (ou infinies). Afin de bénéficier de cette dernière, nous proposons une nouvelle version à précision finie. Ladite technique devienne ainsi efficace et applicable sur les ordinateurs avec les registres classiques de taille fixe et peut être facilement interfacée avec les applications qui souffrent de ME. Troisièmement, nous proposons l'utilisation de HuBR et ACBR comme un moyen pour réduire la redondance afin d'obtenir un code binaire variable à fixe. Nous avons prouvé théoriquement et expérimentalement que les deux techniques permettent d'obtenir une amélioration significative (moins de redondance). À cet égard, ACBR surpasse HuBR et fournit une classe plus étendue des sources binaires qui pouvant bénéficier d'un dictionnaire pluriellement analysable. En outre, nous montrons qu'ACBR est plus souple que HuBR dans la pratique. Quatrièmement, nous utilisons HuBR pour réduire la redondance des codes équilibrés générés par l'algorithme de Knuth. Afin de comparer les performances de HuBR et ACBR, les résultats théoriques correspondants de HuBR et d'ACBR sont présentés. Les résultats montrent que les deux techniques réalisent presque la même réduction de redondance sur les codes équilibrés générés par l'algorithme de Knuth.
Data compression aims to reduce the size of data so that it requires less storage space and less communication channels bandwidth. Many compression techniques (such as LZ77 and its variants) suffer from a problem that we call the redundancy caused by the multiplicity of encodings. The Multiplicity of Encodings (ME) means that the source data may be encoded in more than one way. In its simplest case, it occurs when a compression technique with ME has the opportunity at certain steps, during the encoding process, to encode the same symbol in different ways. The Bit Recycling compression technique has been introduced by D. Dubé and V. Beaudoin to minimize the redundancy caused by ME. Variants of bit recycling have been applied on LZ77 and the experimental results showed that bit recycling achieved better compression (a reduction of about 9% in the size of files that have been compressed by Gzip) by exploiting ME. Dubé and Beaudoin have pointed out that their technique could not minimize the redundancy caused by ME perfectly since it is built on Huffman coding, which does not have the ability to deal with codewords of fractional lengths; i.e. it is constrained to generating codewords of integral lengths. Moreover, Huffman-based Bit Recycling (HuBR) has imposed an additional burden to avoid some situations that affect its performance negatively. Unlike Huffman coding, Arithmetic Coding (AC) can manipulate codewords of fractional lengths. Furthermore, it has attracted researchers in the last few decades since it is more powerful and flexible than Huffman coding. Accordingly, this work aims to address the problem of adapting bit recycling to arithmetic coding in order to improve the code effciency and the flexibility of HuBR. We addressed this problem through our four (published) contributions. These contributions are presented in this thesis and can be summarized as follows. Firstly, we propose a new scheme for adapting HuBR to AC. The proposed scheme, named Arithmetic-Coding-based Bit Recycling (ACBR), describes the framework and the principle of adapting HuBR to AC. We also present the necessary theoretical analysis that is required to estimate the average amount of redundancy that can be removed by HuBR and ACBR in the applications that suffer from ME, which shows that ACBR achieves perfect recycling in all cases whereas HuBR achieves perfect recycling only in very specific cases. Secondly, the problem of the aforementioned ACBR scheme is that it uses arbitrary-precision calculations, which requires unbounded (or infinite) resources. Hence, in order to benefit from ACBR in practice, we propose a new finite-precision version of the ACBR scheme, which makes it efficiently applicable on computers with conventional fixed-sized registers and can be easily interfaced with the applications that suffer from ME. Thirdly, we propose the use of both techniques (HuBR and ACBR) as the means to reduce the redundancy in plurally parsable dictionaries that are used to obtain a binary variable-to-fixed length code. We theoretically and experimentally show that both techniques achieve a significant improvement (less redundancy) in this respect, but ACBR outperforms HuBR and provides a wider class of binary sources that may benefit from a plurally parsable dictionary. Moreover, we show that ACBR is more flexible than HuBR in practice. Fourthly, we use HuBR to reduce the redundancy of the balanced codes generated by Knuth's algorithm. In order to compare the performance of HuBR and ACBR, the corresponding theoretical results and analysis of HuBR and ACBR are presented. The results show that both techniques achieved almost the same significant reduction in the redundancy of the balanced codes generated by Knuth's algorithm.
Merrill, Elise. „Blossoming Bit by Bit: Exploring the Role of Theatre Initiatives in the Lives of Criminalized Women“. Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/32176.
Der volle Inhalt der QuelleWei, Lan. „Implementation of Pipelined Bit-parallel Adders“. Thesis, Linköping University, Department of Electrical Engineering, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1943.
Der volle Inhalt der QuelleBit-parallel addition can be performed using a number of adder structures with different area and latency. However, the power consumption of different adder structures is not well studied. Further, the effect of pipelining adders to increase the throughput is not well studied. In this thesis four different adders are described, implemented in VHDL and compared after synthesis. The results give a general idea of the time-delay-power tradeoffs between the adder structures. Pipelining is shown to be a good technique for increasing the circuit speed.
Oskarsson, Jakob. „Tribological testing of drill bit inserts“. Thesis, Uppsala universitet, Tillämpad materialvetenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-160584.
Der volle Inhalt der QuelleBose, Gourav. „The 128-bit block cipher MARS“. FIU Digital Commons, 2003. http://digitalcommons.fiu.edu/etd/1770.
Der volle Inhalt der QuellePlain, Simon E. M. „Bit rate scalability in audio coding“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0034/MQ64243.pdf.
Der volle Inhalt der QuelleAnhari, Alireabout:za Kenarsari. „Rehashing the bit-interleaved coded modulation“. Thesis, University of British Columbia, 2009. http://hdl.handle.net/2429/22473.
Der volle Inhalt der QuelleAbdul, Gaffar Altaf Munawar. „Bit-width optimisation for arithmetic hardware“. Thesis, Imperial College London, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.420977.
Der volle Inhalt der QuelleNg, Chiu-wa, und 吳潮華. „Bit-stream signal processing on FPGA“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B41633842.
Der volle Inhalt der QuelleBicket, John C. (John Charles). „Bit-rate selection in wireless networks“. Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/34116.
Der volle Inhalt der QuelleIncludes bibliographical references (p. 49-50).
This thesis evaluates bit-rate selection techniques to maximize throughput over wireless links that are capable of multiple bit-rates. The key challenges in bit-rate selection are determining which bit-rate provides the most throughput and knowing when to switch to another bit-rate that would provide more throughput. This thesis presents the SampleRate bit-rate selection algorithm. SampleRate sends most data packets at the bit-rate it believes will provide the highest throughput. SampleRate periodically sends a data packet at some other bit-rate in order to update a record of that bit-rate's loss rate. SampleRate switches to a different bit-rate if the throughput estimate based on the other bit-rate's recorded loss rate is higher than the current bit-rate's throughput. Measuring the loss rate of each supported bit-rate would be inefficient because sending packets at lower bit-rates could waste transmission time, and because successive unicast losses are time-consuming for bit-rates that do not work. SampleRate addresses this problem by only sampling at bit-rates whose lossless throughput is better than the current bit-rate's throughput. SampleRate also stops probing at a bit-rate if it experiences several successive losses. This thesis presents measurements from indoor and outdoor wireless networks that demonstrate that SampleRate performs as well or better than other bit-rate selection algorithms.
(cont.) SampleRate performs better than other algorithms on links where all bit-rates suffer from significant loss.
by John C. Bicket.
S.M.
Lam, S. C. K. „Gallium arsenide bit-serial integrated circuits“. Thesis, University of Edinburgh, 1990. http://hdl.handle.net/1842/11027.
Der volle Inhalt der QuelleMoen, Selmer, und Charles Jones. „BIT RATE AGILITY FOR EFFICIENT TELEMETRY“. International Foundation for Telemetering, 2003. http://hdl.handle.net/10150/606754.
Der volle Inhalt der QuelleThe Bit Rate Agile Onboard Telemetry Formatting (BRAOTF) system was developed by Killdeer Mountain Manufacturing to address increasing demands on the efficiency of telemetry systems. The BRAOTF thins and reorders data streams, adjusting the bit rate of a pulse code modulation (PCM) stream using a bit-locked loop to match the desired information rate exactly. The BRAOTF accomplishes the adjustment in hardware, synthesizing a clock whose operating frequency is derived from the actual timing of the input format. Its firmware manages initialization and error management. Testing has confirmed that the BRAOTF implementation meets its design goals.
Cubiss, Christopher. „Low bit-rate image sequence coding“. Thesis, University of Edinburgh, 1994. http://hdl.handle.net/1842/13506.
Der volle Inhalt der QuelleCarlson, John R. „Specifying and Evaluating PCM Bit Synchronizers“. International Foundation for Telemetering, 1989. http://hdl.handle.net/10150/614626.
Der volle Inhalt der QuelleAs we enter the 1990's PCM Bit Synchronizers continue to be of major importance to data recovery systems. This paper explains the specification of PCM Bit Synchronizers and provides insight into real world performance requirements and verification methods. Topics include: Theoretical bit error ratio for wideband versus prefiltered data, probability of cycle slip, jitter, transitition density and transition gaps. The merits of multiple and/or adaptive, loop bandwidth, input signal dynamic range, and embedded Viterbi decoders are also discussed. Emphasis is on the new high data rate applications, but the concepts apply to the specification of bit synchronizers in general.
CHAKRABORTY, S. K., und R. K. RAJANGAM. „PROGRAMMABLE HIGH BIT RATE FRAME SYNCHRONISER“. International Foundation for Telemetering, 1989. http://hdl.handle.net/10150/614490.
Der volle Inhalt der QuelleThe first Indian Remote Sensing Satellite was launched on 17th March 1988 from a Soviet Cosmodrome into a 904 Km Polar Sunsynchronous orbit. The data transmission from the satellite is at 5.2 Mega Bits/sec in S-Band and 10.4 Mega Bits/sec in X-Band. The payload data is formatted into custom made 8328 words format. A programmable unique versatile frame sync and Decommutation unit has been developed to test the data from the data handling system during its various phases of development. The system works upto 50 Mega Bits/sec and can handle frame sync code length upto 128 bits and a frame length of 2 Exp 20 bits. Provision has been made for programming the allowable bit errors as well as bit slippages, using a front panel setting. This paper describes the design and implementation of such a high bit rate frame synchroniser developed specially for IRS Spacecraft application. It will also highlight the performance of the system.
Butler, Madeline J., und Calvin L. James. „Single Chip Fixed Frequency Bit Synchronizer“. International Foundation for Telemetering, 1989. http://hdl.handle.net/10150/614687.
Der volle Inhalt der QuelleOver the past several years programmable logic devices have become a very attractive alternative to the application specific, Very Large Scale Integrated (VLSI) design approach. This trend is mainly due to the low cost and short design to production cycle time. This paper will describe a single chip, fixed frequency suboptimum bit synchronizer design which was implemented utilizing a programmable logic device. The bit synchronizer presented here is modeled after a Digital Transition Tracking Loop (DTTL) for symbol estimation, and employs a first-order Incremental Phase Modulator (IPM) for closed-loop symbol synchronization. Although the material presented below focuses on square wave subcarriers, with the appropriate modifications, this synchronizer will also process NRZ symbols. The Bit Error Rate (BER) and tracking performance is modeled and compared to optimum designs. The bit synchronizer presented here was developed for the Space Transportation System program under contract NAS5-27600 for meteorological data evaluation from the European Space Agency's (ESA) METEOSAT Spacecraft.
Begley, Mary. „Faces on a Bit of Ivory“. UNF Digital Commons, 1990. http://digitalcommons.unf.edu/etd/94.
Der volle Inhalt der QuelleGimenes, Roseli. „Literatura brasileira: do átomo ao bit“. Pontifícia Universidade Católica de São Paulo, 2016. https://tede2.pucsp.br/handle/handle/19509.
Der volle Inhalt der QuelleMade available in DSpace on 2016-12-06T18:29:22Z (GMT). No. of bitstreams: 1 Roseli Gimenes.pdf: 3008590 bytes, checksum: 803e8f7533a4e976710ffe76d8fd6d11 (MD5) Previous issue date: 2016-11-04
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
The main aim of this work is to feature the development of Brazilian literature considering principally, and from the nineteenth century onwards, the so-called literature of invention such as Memórias Póstumas de Brás Cubas by Machado de Assis, analyzing diachronically and synchronically the works of Gregório de Matos, during the Baroque period, Tomás Antonio Gonzaga, during Arcadismo, Oswald de Andrade during Modernism and, in the contemporary scene, the book A festa by Ivan Angelo, in terms of its interaction with the printed book, to finally focus on the cyberliterature by Clarah Averbuck, and the concrete and digital poetry by Augusto de Campos. When looking for the signs of printed and digital narratives in Brazilian literature, certain conclusions can be reached that show a poetry of invention and interaction, the influence of concrete poetry in cyberliterature as well as the marks of concretism in hyper digital short stories. As regards the teaching of literature, even in Distance Education, we have as our aim to observe the cognitive process of the students of Portuguese at university level, in private institutions, and their relationship with printed and digital narratives when studying Brazilian literature. This work also has as one of its hypotheses to prove the relevance of poetic works created by computers and having artificial intelligence as their starting point. This kind of literary works already foreshadows robots that tell stories, participate in scientific actions, and win chess matches, at the time that create meaningful narratives that will, eventually substitute poetic works, among other human actions and emotions. This part of the research was based on the works of theoreticians, such as John Searle who, with his metaphoric experience of The Chinese Room argued against strong artificial intelligence, and Roger Schank who, through the observation of children and, opposing Searle´s theories, believes in the learning process carried out by machines. The theoretical readings that vied the present research and conclusions on literature and the new technologies found inspiration, in particular, in the works of Lucia Santaella and her concept of “extended literature” and literature in the web, the works of contemporary literary theory critics such as Haroldo de Campos and Augusto de Campos, as well as the already canonical works on literary theory, for the analysis of printed works, prior to cyber literature by Alfredo Bosi, Antonio Cândido and Marisa Lajolo, among others, which waver in between the printed and the digital. It is to be expected that the discovery that creation, invention and interaction are inherent to poetical literary works will inspire teachers of Brazilian literature in their also inventive, creative and interactive interpretations done in class, in turn leading their students to surf the social medias, like blogs, magazines and literary sites, not only in search of entertainment but also of knowledge
O objetivo deste trabalho é colocar em destaque o percurso da literatura brasileira considerando escrituras, principalmente, a partir do século XIX, de caráter de invenção, como as Memórias Póstumas de Brás Cubas, de Machado de Assis, analisando diacrônica e sincronicamente obras e autores como Gregório de Matos, no Barroco, Tomás Antônio Gonzaga, no Arcadismo, e Oswald de Andrade, no Modernismo, observando qualidades de literatura de invenção; passando ao contemporâneo pela obra A festa, de Ivan Ângelo, apostando em sua interatividade ainda em livro impresso, à ciberliteratura de Clarah Averbuck, nas redes sociais, e à poesia concreta e digital de Augusto de Campos, aliada às novas tecnologias digitais. A buscar indagações sobre estilos de literatura impressa e digital, chegam-se a resultados que apontam criação poética de invenção e interatividade na literatura brasileira, da influência da poesia concreta aos fazeres da poesia ciberliterária, assim como de marcas do concretismo nos hipercontos digitais. Ao lado de questões acerca do ensinoaprendizagem, inclusive no ensino a distância de literatura brasileira, procuramos observar o perfil cognitivo dos alunos de cursos de Letras de instituições privadas e suas relações com o mundo impresso e digital quando trabalham a literatura brasileira. O trabalho também tenta alcançar a hipótese da criação poética feita por computadores a partir da inteligência artificial que já se prenuncia em instigantes trabalhos de robôs que contam histórias, participam de ações científicas e que ganham partidas de xadrez, mas que também constroem o sentido de que poderão substituir as criações poéticas, entre outras ações e emoções humanas, partindo de teorias como as de John Searle, que com sua metafórica experiência O quarto chinês argumenta desfavoravelmente à inteligência artificial forte, e Roger Schank que também com experiências na observação de crianças, contrário a Searle, aposta na aprendizagem pelas máquinas. As leituras teóricas que propiciaram as indagações e os resultados sobre literatura e novas tecnologias partiram, notadamente, das obras de Lucia Santaella a respeito de “literatura expandida”, de literatura nas redes sociais, assim como no apoio de contemporâneos da teoria literária como Haroldo de Campos e Augusto de Campos, sem deixar de percorrer os cânones dessa teoria literária para a análise de obras impressas e anteriores à ciberliteratura, como Alfredo Bosi, Antônio Candido e Marisa Lajolo- que navega entre o impresso e o digital-, entre outros. A descoberta de que a criação, a invenção e a interatividade são motes das obras poéticas literárias, esperamos, possa incentivar o trabalho de professores em suas análises também inventivas, criativas e interativas em suas aulas de literatura brasileira, incentivando seus alunos a perscrutarem os caminhos das redes sociais não apenas em busca de entretenimento, mas também de estudo em blogues, revistas e sites literários
Adler, W. Alexander III. „Testing and Understanding Screwdriver Bit Wear“. Thesis, Virginia Tech, 1998. http://hdl.handle.net/10919/36701.
Der volle Inhalt der QuelleMaster of Science
Liu, Chun Hung. „Bit-depth expansion and tone mapping /“. View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?ECED%202008%20LIU.
Der volle Inhalt der QuelleNg, Chiu-wa. „Bit-stream signal processing on FPGA“. Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B41633842.
Der volle Inhalt der QuelleBoppana, Naga Venkata Vijaya Krishna. „16-bit Digital Adder Design in 250nm and 64-bit Digital Comparator Design in 90nm CMOS Technologies“. Wright State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=wright1420674477.
Der volle Inhalt der Quelle