Zaloguj się

Gotowe bibliografie tematyczne / Text compression / Rozprawy doktorskie

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Text compression.

Rozprawy doktorskie na temat „Text compression”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 25 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Text compression”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.

1

Wilson, Timothy David. "Animation of text compression algorithms." Thesis, University of Canterbury. Computer Science, 1992. http://hdl.handle.net/10092/9570.

Pełny tekst źródła

Streszczenie:

It has been said that, there is no particular mystery in animation ... it's very simple and like anything that is simple, it is about the hardest thing in the world to do. Text compression is about finding ways of representing text with the smallest amount of data such that it can be restored to its original state. Text compression algorithms are abstract concepts and bringing them into the visual domain is difficult but the effort can bring insight both to the student and to the researcher. This thesis presents some animations of text compression methods and observations about producing good

Style APA, Harvard, Vancouver, ISO itp.

2

Branavan, Satchuthananthavale Rasiah Kuhan. "High compression rate text summarization." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44368.

Pełny tekst źródła

Streszczenie:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.<br>Includes bibliographical references (p. 95-97).<br>This thesis focuses on methods for condensing large documents into highly concise summaries, achieving compression rates on par with human writers. While the need for such summaries in the current age of information overload is increasing, the desired compression rate has thus far been beyond the reach of automatic summarization systems. The potency of our summarization methods is due to their in-depth modelling of document cont

Style APA, Harvard, Vancouver, ISO itp.

3

Langiu, Alessio. "Optimal Parsing for dictionary text compression." Thesis, Paris Est, 2012. http://www.theses.fr/2012PEST1091/document.

Pełny tekst źródła

Streszczenie:

Les algorithmes de compression de données basés sur les dictionnaires incluent une stratégie de parsing pour transformer le texte d'entrée en une séquence de phrases du dictionnaire. Etant donné un texte, un tel processus n'est généralement pas unique et, pour comprimer, il est logique de trouver, parmi les parsing possibles, celui qui minimise le plus le taux de compression finale. C'est ce qu'on appelle le problème du parsing. Un parsing optimal est une stratégie de parsing ou un algorithme de parsing qui résout ce problème en tenant compte de toutes les contraintes d'un algorithme de compre

Style APA, Harvard, Vancouver, ISO itp.

4

Ong, Ghim Hwee. "Text compression for transmission and storage." Thesis, Loughborough University, 1989. https://dspace.lboro.ac.uk/2134/13790.

Pełny tekst źródła

Streszczenie:

The increasing use of computers for document preparation and publishing coupled with a growth in the general information management facilities available on computers has meant that most documents exist in computer processable form during their lifetime. This has led to a substantial increase in the demand for data storage facilities, which frequently seems to exceed the provision of storage facilities, despite the advances in storage technology. Furthermore, there is growing demand to transmit these textual documents from one use to another, rather than use a printed form for transfer between

Style APA, Harvard, Vancouver, ISO itp.

5

Jones, Greg 1963-2017. "RADIX 95n: Binary-to-Text Data Conversion." Thesis, University of North Texas, 1991. https://digital.library.unt.edu/ark:/67531/metadc500582/.

Pełny tekst źródła

Streszczenie:

This paper presents Radix 95n, a binary to text data conversion algorithm. Radix 95n (base 95) is a variable length encoding scheme that offers slightly better efficiency than is available with conventional fixed length encoding procedures. Radix 95n advances previous techniques by allowing a greater pool of 7-bit combinations to be made available for 8-bit data translation. Since 8-bit data (i.e. binary files) can prove to be difficult to transfer over 7-bit networks, the Radix 95n conversion technique provides a way to convert data such as compiled programs or graphic images to printable ASC

Style APA, Harvard, Vancouver, ISO itp.

6

He, Meng. "Indexing Compressed Text." Thesis, University of Waterloo, 2003. http://hdl.handle.net/10012/1143.

Pełny tekst źródła

Streszczenie:

As a result of the rapid growth of the volume of electronic data, text compression and indexing techniques are receiving more and more attention. These two issues are usually treated as independent problems, but approaches of combining them have recently attracted the attention of researchers. In this thesis, we review and test some of the more effective and some of the more theoretically interesting techniques. Various compression and indexing techniques are presented, and we also present two compressed text indices. Based on these techniques, we implement an compressed full-text

Style APA, Harvard, Vancouver, ISO itp.

7

Blandon, Julio Cesar. "A novel lossless compression technique for text data." FIU Digital Commons, 1999. http://digitalcommons.fiu.edu/etd/1694.

Pełny tekst źródła

Streszczenie:

The focus of this thesis is placed on text data compression based on the fundamental coding scheme referred to as the American Standard Code for Information Interchange or ASCII. The research objective is the development of software algorithms that result in significant compression of text data. Past and current compression techniques have been thoroughly reviewed to ensure proper contrast between the compression results of the proposed technique with those of existing ones. The research problem is based on the need to achieve higher compression of text files in order to save valuable memory s

Style APA, Harvard, Vancouver, ISO itp.

8

Thaper, Nitin 1975. "Using compression for source-based classification of text." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/86595.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Zhang, Nan. "TRANSFORM BASED AND SEARCH AWARE TEXT COMPRESSION SCHEMES AND COMPRESSED DOMAIN TEXT RETRIEVAL." Doctoral diss., University of Central Florida, 2005. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/3938.

Pełny tekst źródła

Streszczenie:

In recent times, we have witnessed an unprecedented growth of textual information via the Internet, digital libraries and archival text in many applications. While a good fraction of this information is of transient interest, useful information of archival value will continue to accumulate. We need ways to manage, organize and transport this data from one point to the other on data communications links with limited bandwidth. We must also have means to speedily find the information we need from this huge mass of data. Sometimes, a single site may also contain large collections of data such as

Style APA, Harvard, Vancouver, ISO itp.

10

Linhares, Pontes Elvys. "Compressive Cross-Language Text Summarization." Thesis, Avignon, 2018. http://www.theses.fr/2018AVIG0232/document.

Pełny tekst źródła

Streszczenie:

La popularisation des réseaux sociaux et des documents numériques a rapidement accru l'information disponible sur Internet. Cependant, cette quantité massive de données ne peut pas être analysée manuellement. Parmi les applications existantes du Traitement Automatique du Langage Naturel (TALN), nous nous intéressons dans cette thèse au résumé cross-lingue de texte, autrement dit à la production de résumés dans une langue différente de celle des documents sources. Nous analysons également d'autres tâches du TALN (la représentation des mots, la similarité sémantique ou encore la compression de p

Style APA, Harvard, Vancouver, ISO itp.

11

Carlsson, Yvonne. "Genericitet i text." Doctoral thesis, Stockholms universitet, Institutionen för nordiska språk, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-81330.

Pełny tekst źródła

Streszczenie:

This dissertation examines genericity from a textual perspective. The material consists of popular science texts about species of animals. The investigation concerns both the distribution of different forms of generic noun phrases and the boundary between generic and non-generic noun phrases. The analytical tools are taken from Accessibility Theory and Blending Theory. Two separate studies have been undertaken. The results of the first study indicate that generic reference on the whole follows the same principles of accessibility as non-generic reference, although there are some differences th

Style APA, Harvard, Vancouver, ISO itp.

12

Bell, Timothy. "A unifying theory and improvements for existing approaches to text compression." Thesis, University of Canterbury. Computer Science, 1986. http://hdl.handle.net/10092/8411.

Pełny tekst źródła

Streszczenie:

More than 40 different schemes for performing text compression have been proposed in the literature. Many of these schemes appear to use quite different approaches, such as Huffman coding, dictionary substitution, predictive modelling, and modelling with Finite State Automata (FSA). From the many schemes in the literature, a representative sample has been selected to include all schemes of current interest (i.e. schemes which are in popular use, or those which have been proposed recently). The main result given in the thesis is that each of these schemes disguises some form of variable-order M

Style APA, Harvard, Vancouver, ISO itp.

13

Martin, Wickus. "A lossy, dictionary -based method for short message service (SMS) text compression." Master's thesis, University of Cape Town, 2009. http://hdl.handle.net/11427/6415.

Pełny tekst źródła

Streszczenie:

Short message service (SMS) message compression allows either more content to be fitted into a single message or fewer individual messages to be sent as part of a concatenated (or long) message. While essentially only dealing with plain text, many of the more popular compression methods do not bring about a massive reduction in size for short messages. The Global System for Mobile communications (GSM) specification suggests that untrained Huffman encoding is the only required compression scheme for SMS messaging, yet support for SMS compression is still not widely available on current handsets

Style APA, Harvard, Vancouver, ISO itp.

14

Tao, Tao. "COMPRESSED PATTERN MATCHING FOR TEXT AND IMAGES." Doctoral diss., University of Central Florida, 2005. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2739.

Pełny tekst źródła

Streszczenie:

The amount of information that we are dealing with today is being generated at an ever-increasing rate. On one hand, data compression is needed to efficiently store, organize the data and transport the data over the limited-bandwidth network. On the other hand, efficient information retrieval is needed to speedily find the relevant information from this huge mass of data using available resources. The compressed pattern matching problem can be stated as: given the compressed format of a text or an image and a pattern string or a pattern image, report the occurrence(s) of the pattern in the tex

Style APA, Harvard, Vancouver, ISO itp.

15

Matsubara, Shigeki, Yoshihide Kato, and Seiji Egawa. "Sentence Compression by Removing Recursive Structure from Parse Tree." Springer, 2008. http://hdl.handle.net/2237/15113.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Hertz, David. "Secure Text Communication for the Tiger XS." Thesis, Linköping University, Department of Electrical Engineering, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-8011.

Pełny tekst źródła

Streszczenie:

<p>The option of communicating via SMS messages can be considered available in all GSM networks. It therefore constitutes a almost universally available method for mobile communication.</p><p>The Tiger XS, a device for secure communication manufactured by Sectra, is equipped with an encrypted text message transmission system. As the text message service of this device is becoming increasingly popular and as options to connect the Tiger XS to computers or to a keyboard are being researched, the text message service is in need of upgrade.</p><p>This thesis proposes amendments to the existing pro

Style APA, Harvard, Vancouver, ISO itp.

17

Gardner-Stephen, Paul Mark, and paul gardner-stephen@flinders edu au. "Explorations In Searching Compressed Nucleic Acid And Protein Sequence Databases And Their Cooperatively-Compressed Indices." Flinders University. Computer Science, Engineering & Mathematics, 2008. http://catalogue.flinders.edu.au./local/adt/public/adt-SFU20081111.105047.

Pełny tekst źródła

Streszczenie:

Nucleic acid and protein databases such as GenBank are growing at a rate that perhaps eclipses even Moores Law of increase in computational power. This poses a problem for the biological sciences, which have become increasingly dependant on searching and manipulating these databases. It was once reasonably practical to perform exhaustive searches of these databases, for example using the algorithm described by Smith and Waterman, however it has been many years since this was the case. This has led to the development of a series of search algorithms, such as FASTA, BLAST and BLAT, that are eac

Style APA, Harvard, Vancouver, ISO itp.

18

Young, David A. "Compression of Endpoint Identifiers in Delay Tolerant Networking." Ohio University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1385559406.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Tam, Wai I. "Compression, indexing and searching of a large structured-text database in a library monitoring and control system (LiMaCS)." Thesis, University of Macau, 1998. http://umaclib3.umac.mo/record=b1636991.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Malatji, Promise Tshepiso. "The development of accented English synthetic voices." Thesis, University of Limpopo, 2019. http://hdl.handle.net/10386/2917.

Pełny tekst źródła

Streszczenie:

Thesis (M. Sc. (Computer Science)) --University of Limpopo, 2019<br>A Text-to-speech (TTS) synthesis system is a software system that receives text as input and produces speech as output. A TTS synthesis system can be used for, amongst others, language learning, and reading out text for people living with different disabilities, i.e., physically challenged, visually impaired, etc., by native and non-native speakers of the target language. Most people relate easily to a second language spoken by a non-native speaker they share a native language with. Most online English TTS synthesis systems ar

Style APA, Harvard, Vancouver, ISO itp.

21

Borggren, Lukas. "Automatic Categorization of News Articles With Contextualized Language Models." Thesis, Linköpings universitet, Artificiell intelligens och integrerade datorsystem, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-177004.

Pełny tekst źródła

Streszczenie:

This thesis investigates how pre-trained contextualized language models can be adapted for multi-label text classification of Swedish news articles. Various classifiers are built on pre-trained BERT and ELECTRA models, exploring global and local classifier approaches. Furthermore, the effects of domain specialization, using additional metadata features and model compression are investigated. Several hundred thousand news articles are gathered to create unlabeled and labeled datasets for pre-training and fine-tuning, respectively. The findings show that a local classifier approach is superior t

Style APA, Harvard, Vancouver, ISO itp.

22

Shang, Guokan. "Spoken Language Understanding for Abstractive Meeting Summarization Unsupervised Abstractive Meeting Summarization with Multi-Sentence Compression and Budgeted Submodular Maximization. Energy-based Self-attentive Learning of Abstractive Communities for Spoken Language Understanding Speaker-change Aware CRF for Dialogue Act Classification." Thesis, Institut polytechnique de Paris, 2021. http://www.theses.fr/2021IPPAX011.

Pełny tekst źródła

Streszczenie:

Grâce aux progrès impressionnants qui ont été réalisés dans la transcription du langage parlé, il est de plus en plus possible d'exploiter les données transcrites pour des tâches qui requièrent la compréhension de ce que l'on dit dans une conversation. Le travail présenté dans cette thèse, réalisé dans le cadre d'un projet consacré au développement d'un assistant de réunion, contribue aux efforts en cours pour apprendre aux machines à comprendre les dialogues des réunions multipartites. Nous nous sommes concentrés sur le défi de générer automatiquement les résumés abstractifs de réunion.Nous p

Style APA, Harvard, Vancouver, ISO itp.

23

Sjöstrand, Björn. "Evaluation of Compression Testing and Compression Failure Modes of Paperboard : Video analysis of paperboard during short-span compression and the suitability of short- and long-span compression testing of paperboard." Thesis, Karlstads universitet, Institutionen för ingenjörs- och kemivetenskaper (from 2013), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-27519.

Pełny tekst źródła

Streszczenie:

The objectives of the thesis were to find the mechanisms that govern compression failures in paperboard and to find the link between manufacturing process and paperboard properties. The thesis also investigates two different test methods and evaluates how suitable they are for paperboard grades. The materials are several commercial board grades and a set of hand-formed dynamic sheets that are made to mimic the construction of commercial paperboard. The method consists of mounting a stereomicroscope on a short-span compression tester and recording the compression failure on video, long-span com

Style APA, Harvard, Vancouver, ISO itp.

24

Gattis, Sherri L. "Ruggedized Television Compression Equipment for Test Range Systems." International Foundation for Telemetering, 1988. http://hdl.handle.net/10150/615062.

Pełny tekst źródła

Streszczenie:

International Telemetering Conference Proceedings / October 17-20, 1988 / Riviera Hotel, Las Vegas, Nevada<br>The Wideband Data Protection Program was necessitated from the need to develop digitized, compressed video to enable encryption.

Style APA, Harvard, Vancouver, ISO itp.

25

Jas, Abhijit. "Test vector compression techniques for systems-on-chip /." Full text (PDF) from UMI/Dissertation Abstracts International, 2001. http://wwwlib.umi.com/cr/utexas/fullcit?p3008359.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Rocher, Tatiana. "Compression et indexation de séquences annotées." Thesis, Lille 1, 2018. http://www.theses.fr/2018LIL1I004/document.

Pełny tekst źródła

Streszczenie:

Cette thèse en algorithmique du texte étudie la compression, l'indexation et les requêtes sur un texte annoté. Un texte annoté est un texte sur lequel nous ajoutons des informations. Ce peut être par exemple une recombinaison V(D)J, un marqueur de globules blancs, où le texte est une séquence ADN et les annotations sont des noms de gènes. Le système immunitaire d'une personne se représente par un ensemble de recombinaisons V(D)J. Avec le séquençage à haut débit, on peut avoir accès à des millions de recombinaisons V(D)J qui sont stockées et doivent pouvoir être retrouvées et comparées rapideme

Style APA, Harvard, Vancouver, ISO itp.

27

Langiu, Alessio. "Parsing optimal pour la compression du texte par dictionnaire." Phd thesis, Université Paris-Est, 2012. http://tel.archives-ouvertes.fr/tel-00804215.

Pełny tekst źródła

Streszczenie:

Les algorithmes de compression de données basés sur les dictionnaires incluent une stratégie de parsing pour transformer le texte d'entrée en une séquence de phrases du dictionnaire. Etant donné un texte, un tel processus n'est généralement pas unique et, pour comprimer, il est logique de trouver, parmi les parsing possibles, celui qui minimise le plus le taux de compression finale. C'est ce qu'on appelle le problème du parsing. Un parsing optimal est une stratégie de parsing ou un algorithme de parsing qui résout ce problème en tenant compte de toutes les contraintes d'un algorithme de compre

Style APA, Harvard, Vancouver, ISO itp.

28

Navickas, T. A., and S. G. Jones. "PULSE CODE MODULATION DATA COMPRESSION FOR AUTOMATED TEST EQUIPMENT." International Foundation for Telemetering, 1991. http://hdl.handle.net/10150/612065.

Pełny tekst źródła

Streszczenie:

International Telemetering Conference Proceedings / November 04-07, 1991 / Riviera Hotel and Convention Center, Las Vegas, Nevada<br>Development of automated test equipment for an advanced telemetry system requires continuous monitoring of PCM data while exercising telemetry inputs. This requirements leads to a large amount of data that needs to be stored and later analyzed. For example, a data stream of 4 Mbits/s and a test time of thirty minutes would yield 900 Mbytes of raw data. With this raw data, information needs to be stored to correlate the raw data to the test stimulus. This lea

Style APA, Harvard, Vancouver, ISO itp.

29

Poirier, Régis. "Compression de données pour le test des circuits intégrés." Montpellier 2, 2004. http://www.theses.fr/2004MON20119.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Khayat, Moghaddam Elham. "On low power test and low power compression techniques." Diss., University of Iowa, 2011. https://ir.uiowa.edu/etd/997.

Pełny tekst źródła

Streszczenie:

With the ever increasing integration capability of semiconductor technology, today's large integrated circuits require an increasing amount of data to test them which increases test time and elevated requirements of tester memory. At the same time, as VLSI design sizes and their operating frequencies continue to increase, timing-related defects are high proportion of the total chip defects and at-speed test is crucial. DFT techniques are widely used in order to improve the testability of a design. While DFT techniques facilitate generation and application of tests, they may cause the test vect

Style APA, Harvard, Vancouver, ISO itp.

31

Zacharia, Nadime. "Compression and decompression of test data for scan-based designs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0004/MQ44048.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Zacharia, Nadime. "Compression and decompression of test data for scan based designs." Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=20218.

Pełny tekst źródła

Streszczenie:

Traditional methods to test integrated circuits (ICs) require enormous amount of memory, which make them increasingly expensive and unattractive. This thesis addresses this issue for scan-based designs by proposing a method to compress and decompress input test patterns. By storing the test patterns in a compressed format, the amount of memory required to test ICs can be reduced to manageable levels. The thesis describes the compression and decompression scheme in details. The proposed method relies on the insertion of a decompression unit on the chip. During test application, the patterns are

Style APA, Harvard, Vancouver, ISO itp.

33

Pateras, Stephen. "Correlated and cube-contained random patterns : test set compression techniques." Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=70300.

Pełny tekst źródła

Streszczenie:

Two novel methods to reduce the number of random test patterns required to fully test a circuit are proposed in this thesis. In the concept of correlated random patterns, reductions in a circuit's random pattern test length are achieved by taking advantage of correlations measured between values applied at different input positions in a complete deterministic test set. Instead of being generated independently, correlated inputs have their random values generated from a common source with each input's value then individually biased at a rate necessary to match the measured correlation. In the c

Style APA, Harvard, Vancouver, ISO itp.

34

Dalmasso, Julien. "Compression de données de test pour architecture de systèmes intégrés basée sur bus ou réseaux et réduction des coûts de test." Thesis, Montpellier 2, 2010. http://www.theses.fr/2010MON20061/document.

Pełny tekst źródła

Streszczenie:

Les circuits intégrés devenant de plus en plus complexes, leur test demande des efforts considérables se répercutant sur le coût de développement et de production de ces composants. De nombreux travaux ont donc porté sur la réduction du coût de ce test en utilisant en particulier les techniques de compression de données de test. Toutefois ces techniques n'adressent que des coeurs numériques dont les concepteurs détiennent la connaissance de toutes les informations structurelles et donc en pratique n'adressent que le test de sous-blocs d'un système complet. Dans cette thèse, nous proposons tout

Style APA, Harvard, Vancouver, ISO itp.

35

Willis, Stephen, and Bernd Langer. "A Duel Compression Ethernet Camera Solution for Airborne Applications." International Foundation for Telemetering, 2014. http://hdl.handle.net/10150/577522.

Pełny tekst źródła

Streszczenie:

ITC/USA 2014 Conference Proceedings / The Fiftieth Annual International Telemetering Conference and Technical Exhibition / October 20-23, 2014 / Town and Country Resort & Convention Center, San Diego, CA<br>Camera technology is now ubiquitous with smartphones, laptops, automotive and industrial applications frequently utilizing high resolution imagine sensors. Increasingly there is a demand for high-definition cameras in the aerospace market - however, such cameras must have several considerations that do not apply to average consumer use including high reliability and being ruggedized for har

Style APA, Harvard, Vancouver, ISO itp.

36

Junior, Célio Anderson da Silva. "Avaliação das propriedades mecânicas de ossos de coelhas submetidas à administração de glicocorticóides." Universidade de São Paulo, 2003. http://www.teses.usp.br/teses/disponiveis/82/82131/tde-11122003-143837/.

Pełny tekst źródła

Streszczenie:

O corticóide é usado nas várias especialidades médicas por ser um fármaco de potente efeito anti-inflamatório e imunossupressor, no entanto, é capaz de produzir algumas alterações metabólicas quando administrado por uso prolongado. Desta forma o presente estudo teve como objetivo avaliar as possíveis alterações nas propriedades mecânicas de osso cortical e trabecular de coelhas albinas, quando submetidas à administração de corticoesteróide em altas doses e por tempo prolongado, através de ensaio mecânico de flexão em três pontos em tíbia e fêmures avaliados como estrutura, além de ensaios mec

Style APA, Harvard, Vancouver, ISO itp.

37

Limprasert, Tawan. "Behaviour of soil, soil-cement and soil-cement-fiber under multiaxial test." Ohio University / OhioLINK, 1995. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1179260769.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

Lancel, Jerome. "Analysis and test of a centrifugal compressor." Thesis, University of Sussex, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.250183.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Chen, Liang-Chih, and 陳良智. "On Text Compression Algorithms." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/68972127981738088023.

Pełny tekst źródła

Streszczenie:

碩士<br>國立清華大學<br>資訊科學研究所<br>85<br>The purpose of this thesis is to make a comprehensive survey about text compression and find out an optimal algorithm for it. There have been some famous algorithms in this realm. How these algorithms work and why they compress data well are two topics we most concern about, so we survey these algorithms and analyze the superiority and limitation of them from the theoretical viewpoint at first. Then, the performance of algorithms are evaluated by experiments. Finally, the context modeling is suggested to improve the compression ratio further. By that, almost al

Style APA, Harvard, Vancouver, ISO itp.

40

"Text compression for Chinese documents." Chinese University of Hong Kong, 1995. http://library.cuhk.edu.hk/record=b5888571.

Pełny tekst źródła

Streszczenie:

by Chi-kwun Kan.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 1995.<br>Includes bibliographical references (leaves 133-137).<br>Abstract --- p.i<br>Acknowledgement --- p.iii<br>Chapter 1 --- Introduction --- p.1<br>Chapter 1.1 --- Importance of Text Compression --- p.1<br>Chapter 1.2 --- Historical Background of Data Compression --- p.2<br>Chapter 1.3 --- The Essences of Data Compression --- p.4<br>Chapter 1.4 --- Motivation and Objectives of the Project --- p.5<br>Chapter 1.5 --- Definition of Important Terms --- p.6<br>Chapter 1.5.1 --- Data Models --- p.6<br>Chapter 1.5.2

Style APA, Harvard, Vancouver, ISO itp.

41

Liou, Chin-yuan, and 劉欽源. "Text compression schemes : a comparison." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/77425729174310677189.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Perera, Paththamestrige. "Syntactic Sentence Compression for Text Summarization." Thesis, 2013. http://spectrum.library.concordia.ca/977725/1/Paththamestrige_MSc_F2013.pdf.

Pełny tekst źródła

Streszczenie:

Abstract Automatic text summarization is a dynamic area in Natural Language Processing that has gained much attention in the past few decades. As a vast amount of data is accumulating and becoming available online, providing automatic summaries of specific subjects/topics has become an important user requirement. To encourage the growth of this research area, several shared tasks are held annually and different types of benchmarks are made available. Early work on automatic text summarization focused on improving the relevance of the summary content but now the trend is more towards gener

Style APA, Harvard, Vancouver, ISO itp.

43

Zhang, Xiaoxi. "Efficient Parallel Text Compression on GPUs." Thesis, 2011. http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10308.

Pełny tekst źródła

Streszczenie:

This paper demonstrates an efficient text compressor with parallel Lempel-Ziv-Markov chain algorithm (LZMA) on graphics processing units (GPUs). We divide LZMA into two parts, match finder and range encoder. We parallel both parts and achieve competitive performance with freeArc on AMD 6-core 2.81 GHz CPU. We measure match finder time, range encoder compression time and demonstrate realtime performance on a large dataset: 10 GB web pages crawled by IRLbot. Our parallel range encoder is 15 times faster than sequential algorithm (FastAC) with static model.

Style APA, Harvard, Vancouver, ISO itp.

44

LANGIU, Alessio. "Optimal Parsing for Dictionary Text Compression." Doctoral thesis, 2012. http://hdl.handle.net/10447/94651.

Pełny tekst źródła

Streszczenie:

Dictionary-based compression algorithms include a parsing strategy to transform the input text into a sequence of dictionary phrases. Given a text, such process usually is not unique and, for compression purpose, it makes sense to find one of the possible parsing that minimize the final compression ratio. This is the parsing problem. An optimal parsing is a parsing strategy or a parsing algorithm that solve the parsing problem taking account of all the constraints of a compression algorithm or of a class of homogeneous compression algorithms. Compression algorithm constrains are, for in

Style APA, Harvard, Vancouver, ISO itp.

45

Ye, Yan. "Text image compression based on pattern matching /." Diss., 2002. http://wwwlib.umi.com/cr/ucsd/fullcit?p3036946.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

"Context-based compression algorithms for text and image data." 1997. http://library.cuhk.edu.hk/record=b5889317.

Pełny tekst źródła

Streszczenie:

Wong Ling.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.<br>Includes bibliographical references (leaves 80-85).<br>ABSTRACT --- p.1<br>Chapter 1. --- INTRODUCTION --- p.2<br>Chapter 1.1 --- motivation --- p.4<br>Chapter 1.2 --- Original Contributions --- p.5<br>Chapter 1.3 --- thesis Structure --- p.5<br>Chapter 2. --- BACKGROUND --- p.7<br>Chapter 2.1 --- information theory --- p.7<br>Chapter 2.2 --- early compression --- p.8<br>Chapter 2.2.1 --- Some Source Codes --- p.10<br>Chapter 2.2.1.1 --- Huffman Code --- p.10<br>Chapter 2.2.1.2 --- Tutstall Code --- p.10<br>Ch

Style APA, Harvard, Vancouver, ISO itp.

47

Wen, Chih-Ming, and 溫智旻. "Text Compression Using a Word-Based Large Alphabet." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/74710510610120099923.

Pełny tekst źródła

Streszczenie:

碩士<br>國立臺灣科技大學<br>資訊工程系<br>93<br>In this thesis, some word-based large-alphabet text compression schemes are studied. After a word token is parsed from an English or Chinese text file, its occurrence probability is predicted with blended predictive models or with partially matched predictive model. Then, this probability is encoded in the module of arithmetic coding. In order to improve the speed of our compression schemes, we have also studied some data structures and their corresponding processing methods under the condition of large alphabet size. For the schemes studied here, we have imp

Style APA, Harvard, Vancouver, ISO itp.

48

HUANG, PING-FENG, and 黃品丰. "Recovering corrupted text files with dictionary-based compression." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/8npz55.

Pełny tekst źródła

Streszczenie:

碩士<br>逢甲大學<br>通訊工程學系<br>106<br>The pace of present technology development now days is getting faster and faster. The new technologies created enormous amount of data over internet and they are growing exponentially. To store all these data pushes for the highly efficient data compression techniques. These data compression algorithms make the transfer of data faster than ever and storage space smaller than ever. However, most of the data compression techniques concentrated on high compression ration rather than data recovery of corrupted compressed files. A compressed file will be unable to

Style APA, Harvard, Vancouver, ISO itp.

49

Chuang, Yu-Ting, and 莊侑頲. "Text Detection in Color Images and Compound Document Compression." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/91068801328009029959.

Pełny tekst źródła

Streszczenie:

碩士<br>國立臺灣大學<br>電信工程學研究所<br>91<br>Abstract As the growth of multimedia components, News, magazines, Web pages, etc are everywhere in our life. However, text in these documents plays an important role when people need to realize details of their downloaded data. Besides that, in order to make people who speak different languages know content of these data easily, text localization and translation in color images are becoming more and more important, it is clear that good text translation can be achieved if we can accurately localize text regions. In order to achieve good t

Style APA, Harvard, Vancouver, ISO itp.

50

Lin, Wen Long, and 林文隆. "Wavelet-Based Color Document Compression with Graph and Text Segmentation." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/03869862444590817113.

Pełny tekst źródła

Streszczenie:

碩士<br>國立交通大學<br>電機與控制工程學系<br>86<br>In this thesis, we use the technology of graph and text segmentationin wavelet coefficients to separate graph and text in color document. Zero-Tree encodes the part of graph-image, and the part of text-image is coded by the method of multi-plain text coding. Color-number, the ratio of projection variance, and fractal dimension which are different in graph and text part of the block give us the information manipulate the segmentation. Because of the chara

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!