subject:(compression)

University of Georgia

1. Chattopadhyay, Siddhartha. Content aware multimedia transcoding for resource constrained environments.

Degree: PhD, Computer Science, 2007, University of Georgia

URL: http://purl.galileo.usg.edu/uga_etd/chattopadhyay_siddhartha_200712_phd

► The use of multimedia on mobile devices is fast becoming widespread and popular. Since mobile devices are typically resource constrained in terms of network bandwidth,… (more)

▼ The use of multimedia on mobile devices is fast becoming widespread and popular. Since mobile devices are typically resource constrained in terms of network bandwidth, battery power and available screen resolution, it is often necessary to formulate special encoding techniques in order to optimize for power consumption, and network bandwidth, during multimedia data playback and streaming. This dissertation reports the design and implementation of several novel content aware algorithms for compact representation, and dissemination, of multimedia data suitable for power -and -network constrained environments. The multimedia sub domains of computer animation data, videos, and images, have been considered. Content aware data processing is a key theme in all the proposed algorithms. Content information for animation data, represented as Motion Capture (MoCap) data, has been derived from the hierarchical structure of the virtual human associated with the data. For video sequences and images, low level content information, such as gradients, motion, curvature etc. have been detected, and exploited, in the proposed algorithms. Another key theme in the proposed algorithms is the elimination, or reduction, of spatio-temporal redundancy, occurring in MoCap and video sequences. The third key theme is the use of domain specific customization of data, in order to render the multimedia data more suited for resource-constrained environments. Several novel algorithms, based on these three key concepts, have been proposed for MoCap data compression suitable for power-and-network constrained devices. Several content aware image and video transcoding algorithms have been proposed, which transcode images and video sequences as multi-resolution, multi-layered representations, in order to allow power - and - network bandwidth adaptive video playback and dissemination. Results have shown significant power -and -network bandwidth - adaptive capabilities of the videos, which surpass performance of existing standards of layered video encoding. Further, several caching schemes have been developed in order to disseminate videos created using the proposed technologies to power -and network bandwidth - constrained clients over the Internet, resulting in cache designs with improved performance compared to existing cache designs. INDEX TERMS: MoCap compression, content aware video encoding, BAP-Sparsing, BAP-Indexing, BAP-Sparse-Indexing, FMOE-MR, MMR, Ligne-Claire video, HLV, QAPD, content aware image encoding, layered video encoding, multi-resolution video, layered video caching, cache replacement policy, LGDS Advisors/Committee Members: Suchendra M. Bhandarkar.

Subjects/Keywords: MoCap compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chattopadhyay, S. (2007). Content aware multimedia transcoding for resource constrained environments. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/chattopadhyay_siddhartha_200712_phd

Chicago Manual of Style (16^th Edition):

Chattopadhyay, Siddhartha. “Content aware multimedia transcoding for resource constrained environments.” 2007. Doctoral Dissertation, University of Georgia. Accessed February 24, 2020. http://purl.galileo.usg.edu/uga_etd/chattopadhyay_siddhartha_200712_phd.

MLA Handbook (7^th Edition):

Chattopadhyay, Siddhartha. “Content aware multimedia transcoding for resource constrained environments.” 2007. Web. 24 Feb 2020.

Vancouver:

Chattopadhyay S. Content aware multimedia transcoding for resource constrained environments. [Internet] [Doctoral dissertation]. University of Georgia; 2007. [cited 2020 Feb 24]. Available from: http://purl.galileo.usg.edu/uga_etd/chattopadhyay_siddhartha_200712_phd.

Council of Science Editors:

Chattopadhyay S. Content aware multimedia transcoding for resource constrained environments. [Doctoral Dissertation]. University of Georgia; 2007. Available from: http://purl.galileo.usg.edu/uga_etd/chattopadhyay_siddhartha_200712_phd

Texas A&M University

2. Husin, Nur Azuan Bin. Impact of Seed Cotton Compression on Cottonseed Quality.

Degree: MS, Biological and Agricultural Engineering, 2016, Texas A&M University

URL: http://hdl.handle.net/1969.1/156809

► Cotton is harvested as seed cotton, which includes fiber attached to seeds mixed with extraneous matter like leaves and stems. A module builder is used… (more)

▼ Cotton is harvested as seed cotton, which includes fiber attached to seeds mixed with extraneous matter like leaves and stems. A module builder is used to compress the seed cotton into large rectangular modules that allow in-field storage until being transported to a ginning facility, where the fiber and seed are separated and cleaned. On-board module-building systems are now being used on harvesters and offer virtually continuous harvesting, without the need to transfer seed cotton to a separate module builder. With their smaller size and shape, these packages could possibly be transported more economically by loading multiple packages on a truck. However, their density is similar to traditional modules, so any transport advantage is minimal. Transportation costs could be reduced significantly by creating higher-density cotton packages at harvest. Compression of seed cotton to levels observed with module-building systems has not proven to damage cottonseed, but some research has shown that higher compression levels could cause damage. Moisture content and storage duration may also influence the effect of compression on the seed. The objective of this research was to quantify the effects of these factors, individually and in combination, on cottonseed across two cotton varieties. Humidity chambers were used to achieve desired experimental seed cotton moisture levels. A miniature bale press (16.6 x 8.3 x 6.2 in.) was used to compress bales of seed cotton to different densities. Germination and seed crackage were quantified to determine the impact on the cottonseed. Data analyses indicated that compression density, moisture content, storage time and position of the sample in the bale were all significantly related to seed damage; however, cotton variety was not significantly related. Moisture was most strongly related to reduction in germination, while compression density was most strongly related to increasing crackage. Compression above 24 lbs/ft³ was clearly associated with higher percentages of cracked seed. Advisors/Committee Members: Thomasson, John A (advisor), Morgan, Gaylon D (committee member), Ge, Yufeng (committee member).

Subjects/Keywords: Compression; Cottonseed

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Husin, N. A. B. (2016). Impact of Seed Cotton Compression on Cottonseed Quality. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/156809

Chicago Manual of Style (16^th Edition):

Husin, Nur Azuan Bin. “Impact of Seed Cotton Compression on Cottonseed Quality.” 2016. Masters Thesis, Texas A&M University. Accessed February 24, 2020. http://hdl.handle.net/1969.1/156809.

MLA Handbook (7^th Edition):

Husin, Nur Azuan Bin. “Impact of Seed Cotton Compression on Cottonseed Quality.” 2016. Web. 24 Feb 2020.

Vancouver:

Husin NAB. Impact of Seed Cotton Compression on Cottonseed Quality. [Internet] [Masters thesis]. Texas A&M University; 2016. [cited 2020 Feb 24]. Available from: http://hdl.handle.net/1969.1/156809.

Council of Science Editors:

Husin NAB. Impact of Seed Cotton Compression on Cottonseed Quality. [Masters Thesis]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/156809

3. Wang, Wei-Ying. Image Compression and Data Clustering: New Takes on Some Old Problems.

Degree: Department of Applied Mathematics, 2017, Brown University

URL: https://repository.library.brown.edu/studio/item/bdr:733554/

► We explore two topics in this thesis: (1) entropy rate on images, and (2) robust generalized clustering method. On the first topic, we examine the… (more)

▼ We explore two topics in this thesis: (1) entropy rate on images, and (2) robust generalized clustering method. On the first topic, we examine the idea behind lossless compression algorithms. Specifically, we look into the predictive context modeling method, which currently dominates this field. Without assuming the ergodicity, we prove that the optimal compression rate can be achieved with large context under stationary conditions and some small assumptions. The convergence can be specified by ergodic components of the underlying stationary probability, which generalizes the Shannon-McMillian-Breimen theorem to 2D non-ergodic source. To utilize the theorem and to examine the performance of the existing compression algorithms, we built a provably optimal image compression scheme CBIC, the comparison-based image compression algorithm. Experiments show that CBIC is slightly better then a state of the art algorithm, CALIC. Also, the compression rate of CBIC improved slowly when we scale up the context size, which indicates the existing image compression algorithms are already near optimal For the second topic, we propose an unsupervised clustering algorithm that is able to cluster to multiple linear structures (“instances”) within the data, by minimizing a suitable loss function. The loss function is built out of “sparse distances” between data points and structures, meaning that it encourages structures that pass through one or more data points. At the same time, the loss function is highly resistant to “outliers.” Moreover, in some situations the minimizer of the loss function is interpolating, implying that every instance is defined by a small and known number of data points. In these cases, an otherwise NP-hard problem becomes polynomial. Specifically, n data points in d dimension can be clustered to m (d-1 dimensional) hyperplanes in time that is exponential in m but polynomial in n. Advisors/Committee Members: Geman, Stuart (Advisor), Harrison, Matthew (Reader), Bienenstock, Elie (Reader).

Subjects/Keywords: Image compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wang, W. (2017). Image Compression and Data Clustering: New Takes on Some Old Problems. (Thesis). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:733554/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Wang, Wei-Ying. “Image Compression and Data Clustering: New Takes on Some Old Problems.” 2017. Thesis, Brown University. Accessed February 24, 2020. https://repository.library.brown.edu/studio/item/bdr:733554/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Wang, Wei-Ying. “Image Compression and Data Clustering: New Takes on Some Old Problems.” 2017. Web. 24 Feb 2020.

Vancouver:

Wang W. Image Compression and Data Clustering: New Takes on Some Old Problems. [Internet] [Thesis]. Brown University; 2017. [cited 2020 Feb 24]. Available from: https://repository.library.brown.edu/studio/item/bdr:733554/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang W. Image Compression and Data Clustering: New Takes on Some Old Problems. [Thesis]. Brown University; 2017. Available from: https://repository.library.brown.edu/studio/item/bdr:733554/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rochester Institute of Technology

4. Goodenow, Daniel P. A reference guide to JPEG compression.

Degree: Computer Science (GCCIS), 1993, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/188

Not provided. Advisors/Committee Members: Cost, Frank.

Subjects/Keywords: Compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Goodenow, D. P. (1993). A reference guide to JPEG compression. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/188

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Goodenow, Daniel P. “A reference guide to JPEG compression.” 1993. Thesis, Rochester Institute of Technology. Accessed February 24, 2020. https://scholarworks.rit.edu/theses/188.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Goodenow, Daniel P. “A reference guide to JPEG compression.” 1993. Web. 24 Feb 2020.

Vancouver:

Goodenow DP. A reference guide to JPEG compression. [Internet] [Thesis]. Rochester Institute of Technology; 1993. [cited 2020 Feb 24]. Available from: https://scholarworks.rit.edu/theses/188.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Goodenow DP. A reference guide to JPEG compression. [Thesis]. Rochester Institute of Technology; 1993. Available from: https://scholarworks.rit.edu/theses/188

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

5. Kelley, James Alan. Secure Data Compression and Error Correcting Codes for Networks and Cloud Storage.

Degree: PhD, Computer Science, 2015, Brown University

URL: https://repository.library.brown.edu/studio/item/bdr:419483/

► We present several novel constructions—combining cryptography, error correcting codes (ECCs), and data compression—that find ready application in enhancing security and fault-tolerance in cloud storage. We… (more)

▼ We present several novel constructions—combining cryptography, error correcting codes (ECCs), and data compression—that find ready application in enhancing security and fault-tolerance in cloud storage. We demonstrate this by presenting a simple (yet novel) secure cloud storage scheme (which can be used on top of any cloud service provider) that provides strong guarantees of integrity and fault-tolerance, and we show the different enhancements possible using our constructions. Our constructions provably achieve strong theoretical properties and are quite practical as well. First, we consider the problem of combining data compression with encryption to provide a primitive that performs both operations at once. This work provides the first formal definitions of security for schemes that combine compression and encryption. We present two compressing ciphers that are the first to provably achieve these strong guarantees of privacy and security. Moreover, one construction is quite practical and provides data compression ratios and speeds comparable to standard algorithms, as demonstrated with a detailed set of experiments. Second, we utilize cryptographic primitives to enhance erasure codes to withstand adversarial corruption of the encoded data. As part of this, we present a new adversarial model for ECCs which is more powerful than previously considered. We then provide two constructions, called authenticated error correcting codes, that transform an erasure code into an ECC and are provably secure in our model. The first scheme combines digital signatures and list decoding while the second uses a message authentication code (MAC), a non-malleable cipher, and a pseudorandom permutation. Finally, we present cryptographically enhanced LT codes (a fast, rateless erasure code) which are able to provide error correction over an adversarial channel. LT codes encode data via a sparse bipartite graph where each output symbol is the XOR of a random subset of the message symbols. All prior work on LT codes only considered random erasures or random errors (e.g., additive white Gaussian noise) and would fail under adversaries that exploit the encoding graph. We define a new framework for analyzing the security of rateless codes and provide three provably secure constructions: (1) a basic scheme that is used as a subroutine in the other schemes; (2) a scalable, block-oriented fixed-rate scheme; and (3) a scalable, block-oriented rateless scheme. All of these schemes maintain both asymptotic and practical efficiency—the latter we demonstrate experimentally. Advisors/Committee Members: Tamassia, Roberto (Director), Fonseca, Rodrigo (Reader), Triandopoulos, Nikos (Reader).

Subjects/Keywords: data compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kelley, J. A. (2015). Secure Data Compression and Error Correcting Codes for Networks and Cloud Storage. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:419483/

Chicago Manual of Style (16^th Edition):

Kelley, James Alan. “Secure Data Compression and Error Correcting Codes for Networks and Cloud Storage.” 2015. Doctoral Dissertation, Brown University. Accessed February 24, 2020. https://repository.library.brown.edu/studio/item/bdr:419483/.

MLA Handbook (7^th Edition):

Kelley, James Alan. “Secure Data Compression and Error Correcting Codes for Networks and Cloud Storage.” 2015. Web. 24 Feb 2020.

Vancouver:

Kelley JA. Secure Data Compression and Error Correcting Codes for Networks and Cloud Storage. [Internet] [Doctoral dissertation]. Brown University; 2015. [cited 2020 Feb 24]. Available from: https://repository.library.brown.edu/studio/item/bdr:419483/.

Council of Science Editors:

Kelley JA. Secure Data Compression and Error Correcting Codes for Networks and Cloud Storage. [Doctoral Dissertation]. Brown University; 2015. Available from: https://repository.library.brown.edu/studio/item/bdr:419483/

University of Victoria

6. Han, Dan. A new progressive lossy-to-lossless coding method for 2.5-D triangle meshes with arbitrary connectivity.

Degree: Department of Electrical and Computer Engineering, 2016, University of Victoria

URL: http://hdl.handle.net/1828/7614

► A new progressive lossy-to-lossless coding framework for 2.5-dimensional (2.5-D) triangle meshes with arbitrary connectivity is proposed by combining ideas from the previously proposed average-difference image-tree… (more)

Subjects/Keywords: mesh compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Han, D. (2016). A new progressive lossy-to-lossless coding method for 2.5-D triangle meshes with arbitrary connectivity. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7614

Chicago Manual of Style (16^th Edition):

Han, Dan. “A new progressive lossy-to-lossless coding method for 2.5-D triangle meshes with arbitrary connectivity.” 2016. Masters Thesis, University of Victoria. Accessed February 24, 2020. http://hdl.handle.net/1828/7614.

MLA Handbook (7^th Edition):

Han, Dan. “A new progressive lossy-to-lossless coding method for 2.5-D triangle meshes with arbitrary connectivity.” 2016. Web. 24 Feb 2020.

Vancouver:

Han D. A new progressive lossy-to-lossless coding method for 2.5-D triangle meshes with arbitrary connectivity. [Internet] [Masters thesis]. University of Victoria; 2016. [cited 2020 Feb 24]. Available from: http://hdl.handle.net/1828/7614.

Council of Science Editors:

Han D. A new progressive lossy-to-lossless coding method for 2.5-D triangle meshes with arbitrary connectivity. [Masters Thesis]. University of Victoria; 2016. Available from: http://hdl.handle.net/1828/7614

University of New Orleans

7. Sajja, Abhilash. Forensic Reconstruction of Fragmented Variable Bitrate MP3 files.

Degree: MS, Computer Science, 2010, University of New Orleans

URL: https://scholarworks.uno.edu/td/1258

► File carving is a technique used to recover data from a digital device without the help of file system metadata. The current file carvers use… (more)

Subjects/Keywords: Data; Compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sajja, A. (2010). Forensic Reconstruction of Fragmented Variable Bitrate MP3 files. (Thesis). University of New Orleans. Retrieved from https://scholarworks.uno.edu/td/1258

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Sajja, Abhilash. “Forensic Reconstruction of Fragmented Variable Bitrate MP3 files.” 2010. Thesis, University of New Orleans. Accessed February 24, 2020. https://scholarworks.uno.edu/td/1258.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Sajja, Abhilash. “Forensic Reconstruction of Fragmented Variable Bitrate MP3 files.” 2010. Web. 24 Feb 2020.

Vancouver:

Sajja A. Forensic Reconstruction of Fragmented Variable Bitrate MP3 files. [Internet] [Thesis]. University of New Orleans; 2010. [cited 2020 Feb 24]. Available from: https://scholarworks.uno.edu/td/1258.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sajja A. Forensic Reconstruction of Fragmented Variable Bitrate MP3 files. [Thesis]. University of New Orleans; 2010. Available from: https://scholarworks.uno.edu/td/1258

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Texas State University – San Marcos

8. Mulpuri, Naga Sai Gowtham. Dynamic Unbounded Integer Compression.

Degree: MS, Computer Science, 2016, Texas State University – San Marcos

URL: https://digital.library.txstate.edu/handle/10877/7743

► One of the important applications of data compression is inverted indexes compression, which is a lossless compression. Presently, most of the internet search engines such… (more)

Subjects/Keywords: Integer; Compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mulpuri, N. S. G. (2016). Dynamic Unbounded Integer Compression. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/7743

Chicago Manual of Style (16^th Edition):

Mulpuri, Naga Sai Gowtham. “Dynamic Unbounded Integer Compression.” 2016. Masters Thesis, Texas State University – San Marcos. Accessed February 24, 2020. https://digital.library.txstate.edu/handle/10877/7743.

MLA Handbook (7^th Edition):

Mulpuri, Naga Sai Gowtham. “Dynamic Unbounded Integer Compression.” 2016. Web. 24 Feb 2020.

Vancouver:

Mulpuri NSG. Dynamic Unbounded Integer Compression. [Internet] [Masters thesis]. Texas State University – San Marcos; 2016. [cited 2020 Feb 24]. Available from: https://digital.library.txstate.edu/handle/10877/7743.

Council of Science Editors:

Mulpuri NSG. Dynamic Unbounded Integer Compression. [Masters Thesis]. Texas State University – San Marcos; 2016. Available from: https://digital.library.txstate.edu/handle/10877/7743

University of New South Wales

9. Shen, Zhenliang. Binary shape coding and lossless image compression.

Degree: Electrical Engineering, 2010, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/50434 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9328/SOURCE01?view=true

► As the amount of information is increased in modern life, the need for more efficient methods to represent this information grows as well. This information… (more)

▼ As the amount of information is increased in modern life, the need for more efficient methods to represent this information grows as well. This information can be in a variety of forms, such as speech, still image, text, and video, etc. The aim of data compression is to provide efficient methods to represent information. Data compression is very important in the storage and transmission of digital image and video. According to the application, data compression can be classified into two areas: lossy compression and lossless compression. Lossy compression can provide highly compressed ratios than lossless compression, but at the cost of some loss information. Lossless compression is applied in some particular applications for which the compressed data must be reconstructed to be identical to the original information. This thesis presents new approaches to lossless image compression, applied in binary image compression (i.e. binary shape coding) for object-based video compression, and grey-scale image compression. In a binary shape video sequence, each the pixel has value '1' within an object and value '0' for the background, where each pixel is either completely inside the object or completely outside it, i.e. there is no blending of pixels at object boundaries. The main purpose of binary shape coding is to use fewer bits to describe the object boundary information. There are many types of coding methods in the binary shape coding. Most of them exploit the high correlation between adjacent pixels to provide high coding efficiency. In this thesis, we propose a new approach to binary shape coding based on quad-tree block-based CAE coding. The original image is decomposed into different new images with different resolution. Coding is then performed on 3-symbol quad-tree blocks instead of the original binary pixels. The quad-tree structure can remove the spatial redundancy efficiently. The low resolution image costs fewer bits to locate the boundary block information. High resolution image gives more details around the boundary block. This technique can be used in either an Intra mode (i.e. no information from other frames is used) or an Inter mode (in which information from the previous frame is used to further improve the coding efficiency). The efficiency of quad-tree structure is highly dependent on the complexity of shape and motion of the object. An optimal pruning quad-tree prunes the inefficient branches in the quad-tree structure and has most efficient expression for all binary shapes. A fast and simplified algorithm of optimal pruning quad-tree coding is also proposed in this thesis. In comparison of MPEG-4 CAE, the proposed approach gives significant improvement in both Intra and Inter coding. Lossless image compression typically includes two parts: transformation and coding. For reasons of computational efficiency, the transformation must be linear and integer. In natural image, the content in a small region has high correlation, which means lots of redundancy can be removed. Predictive models tailored to… Advisors/Committee Members: Frater, Michael, Information Technology & Electrical Engineering, Australian Defence Force Academy, UNSW, Arnold, John, Information Technology & Electrical Engineering, Australian Defence Force Academy, UNSW.

Subjects/Keywords: Binary shape coding; Image compression; Data compression; High-performance compression algorithm; Lossy compression; Lossless compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shen, Z. (2010). Binary shape coding and lossless image compression. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/50434 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9328/SOURCE01?view=true

Chicago Manual of Style (16^th Edition):

Shen, Zhenliang. “Binary shape coding and lossless image compression.” 2010. Doctoral Dissertation, University of New South Wales. Accessed February 24, 2020. http://handle.unsw.edu.au/1959.4/50434 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9328/SOURCE01?view=true.

MLA Handbook (7^th Edition):

Shen, Zhenliang. “Binary shape coding and lossless image compression.” 2010. Web. 24 Feb 2020.

Vancouver:

Shen Z. Binary shape coding and lossless image compression. [Internet] [Doctoral dissertation]. University of New South Wales; 2010. [cited 2020 Feb 24]. Available from: http://handle.unsw.edu.au/1959.4/50434 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9328/SOURCE01?view=true.

Council of Science Editors:

Shen Z. Binary shape coding and lossless image compression. [Doctoral Dissertation]. University of New South Wales; 2010. Available from: http://handle.unsw.edu.au/1959.4/50434 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9328/SOURCE01?view=true

University of Miami

10. Koc, Basar. Lossless Compression of Images.

Degree: MS, Computer Science (Arts and Sciences), 2014, University of Miami

URL: https://scholarlyrepository.miami.edu/oa_theses/477

► Data compression is a challenging process with important practical applications. Specialized techniques for lossy and lossless data compression have been the subject of numerous investigations… (more)

Subjects/Keywords: Image Compression; Lossless Data Compression; PDT; BWT

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Koc, B. (2014). Lossless Compression of Images. (Thesis). University of Miami. Retrieved from https://scholarlyrepository.miami.edu/oa_theses/477

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Koc, Basar. “Lossless Compression of Images.” 2014. Thesis, University of Miami. Accessed February 24, 2020. https://scholarlyrepository.miami.edu/oa_theses/477.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Koc, Basar. “Lossless Compression of Images.” 2014. Web. 24 Feb 2020.

Vancouver:

Koc B. Lossless Compression of Images. [Internet] [Thesis]. University of Miami; 2014. [cited 2020 Feb 24]. Available from: https://scholarlyrepository.miami.edu/oa_theses/477.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Koc B. Lossless Compression of Images. [Thesis]. University of Miami; 2014. Available from: https://scholarlyrepository.miami.edu/oa_theses/477

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

11. Shi, Yongfang. Fast mode decision algorithms for high efficiency video coding (HEVC) and image matting.

Degree: 2013, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-7974 ; https://doi.org/10.14711/thesis-b1240243 ; http://repository.ust.hk/ir/bitstream/1783.1-7974/1/th_redirect.html

► The High Efficiency Video Coding (HEVC) is the next generation video coding standard beyond H.264/AVC. As a newly established standard mainly targeted for the efficient… (more)

▼ The High Efficiency Video Coding (HEVC) is the next generation video coding standard beyond H.264/AVC. As a newly established standard mainly targeted for the efficient compression of high-definition (HD) video and ultra-HD contents, HEVC adopts many new techniques and more elaborate coding tools such as nested quad-tree structure, advanced motion vector prediction (AMVP), asymmetric motion partition (AMP), etc. In HEVC, the basic processing unit– coding tree unit (CTU) has a larger size of 64 × 64 luma samples and adopts a nested quad-tree based partitioning scheme which supports a hierarchy up to 4, compared to merely 16 × 16 macroblock (MB) and a limited choice of block sizes in H.264/AVC. Also, HEVC has 35 intra prediction modes (IPM) while H.264/AVC has only up to 9 modes for intra prediction. Although these new techniques contribute a lot to the coding efficiency gain of the HEVC encoder, they add significant complexity to the encoder. Thus it is of great importance to study fast algorithms to make it more practical in real applications. To speed up the HEVC encoder, we propose two fast algorithms in this thesis. The first fast algorithm is called fast PU quad-tree depth decision (FPDD) algorithm and speeds up the encoding process by skipping less probable PU sizes. It is achieved by making use of the inherent correlation of PU quad-tree structure between current CTU and its spatial and temporal neighbors. To reduce error propagation, we also propose a confidence grading scheme to prevent CTUs with bad prediction from being referred to by others. Results show that FPDD algorithm provides averagely 20.0% (up to 39.3%) encoding time reduction whilst causing negligible RD performance loss (0.2% BD-Rate increase on average) compared with HM 7.0. The second one is called fast rough mode decision (FRMD) algorithm which further reduces the number of IPM for full RDO process. In FRMD, we analyzed the costs generated by rough mode decision (RMD), which has already been incorporated in the HM software. We found that the RMD costs listed by mode number generally follow the same trend with the rate-distortion optimization (RDO) costs. Further, the local salient modes, whose RMD costs have a significant drop compared with adjacent modes, tend to be promising competitors for the optimal mode. Based on these observations, we further reduced the number of the candidates for the RDO process. Experimental results show that FRMD algorithm achieves averagely 19.0% (up to 33.6%) encoding time saving whilst causing negligible RD performance loss (0.4% BD-Rate increase on average) compared with HM 7.0 anchor. Apart from the above video technology research, the thesis also contains my recent work on natural image matting which is a classical topic but has aroused more and more attention recently. Basically, natural image matting refers to the problem of extracting regions of interest such as foreground object from an image based on user inputs like scribbles or trimap. More specifically, we need to estimate the color information…

Subjects/Keywords: Video compression ; Digital video ; Image compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shi, Y. (2013). Fast mode decision algorithms for high efficiency video coding (HEVC) and image matting. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7974 ; https://doi.org/10.14711/thesis-b1240243 ; http://repository.ust.hk/ir/bitstream/1783.1-7974/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Shi, Yongfang. “Fast mode decision algorithms for high efficiency video coding (HEVC) and image matting.” 2013. Thesis, Hong Kong University of Science and Technology. Accessed February 24, 2020. http://repository.ust.hk/ir/Record/1783.1-7974 ; https://doi.org/10.14711/thesis-b1240243 ; http://repository.ust.hk/ir/bitstream/1783.1-7974/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Shi, Yongfang. “Fast mode decision algorithms for high efficiency video coding (HEVC) and image matting.” 2013. Web. 24 Feb 2020.

Vancouver:

Shi Y. Fast mode decision algorithms for high efficiency video coding (HEVC) and image matting. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2020 Feb 24]. Available from: http://repository.ust.hk/ir/Record/1783.1-7974 ; https://doi.org/10.14711/thesis-b1240243 ; http://repository.ust.hk/ir/bitstream/1783.1-7974/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shi Y. Fast mode decision algorithms for high efficiency video coding (HEVC) and image matting. [Thesis]. Hong Kong University of Science and Technology; 2013. Available from: http://repository.ust.hk/ir/Record/1783.1-7974 ; https://doi.org/10.14711/thesis-b1240243 ; http://repository.ust.hk/ir/bitstream/1783.1-7974/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Missouri – Columbia

12. Zhao, Xiwen. Resource-efficient portable video communication system design for wildlife monitoring and interaction tracking.

Degree: 2011, University of Missouri – Columbia

URL: http://hdl.handle.net/10355/14467

► In this research, we focus on algorithm development and system design for resource-efficient portable video communication system design and their application in wildlife monitoring and… (more)

Subjects/Keywords: image compression; video compression; wildlife monitoring; DeerCam

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhao, X. (2011). Resource-efficient portable video communication system design for wildlife monitoring and interaction tracking. (Thesis). University of Missouri – Columbia. Retrieved from http://hdl.handle.net/10355/14467

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Zhao, Xiwen. “Resource-efficient portable video communication system design for wildlife monitoring and interaction tracking.” 2011. Thesis, University of Missouri – Columbia. Accessed February 24, 2020. http://hdl.handle.net/10355/14467.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Zhao, Xiwen. “Resource-efficient portable video communication system design for wildlife monitoring and interaction tracking.” 2011. Web. 24 Feb 2020.

Vancouver:

Zhao X. Resource-efficient portable video communication system design for wildlife monitoring and interaction tracking. [Internet] [Thesis]. University of Missouri – Columbia; 2011. [cited 2020 Feb 24]. Available from: http://hdl.handle.net/10355/14467.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhao X. Resource-efficient portable video communication system design for wildlife monitoring and interaction tracking. [Thesis]. University of Missouri – Columbia; 2011. Available from: http://hdl.handle.net/10355/14467

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Alberta

13. Fech, Jennifer. Caring for the radial artery post-angiogram: A pilot study on a comparison of three methods of compression.

Degree: Master of Nursing, Faculty of Nursing, 2010, University of Alberta

URL: https://era.library.ualberta.ca/files/5q47rq06s

► A coronary angiogram (CATH) is the diagnostic tool used to visualize the coronary arteries of a person’s heart. These arteries can be accessed through the… (more)

Subjects/Keywords: angiogram; transradial; compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Fech, J. (2010). Caring for the radial artery post-angiogram: A pilot study on a comparison of three methods of compression. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/5q47rq06s

Chicago Manual of Style (16^th Edition):

Fech, Jennifer. “Caring for the radial artery post-angiogram: A pilot study on a comparison of three methods of compression.” 2010. Masters Thesis, University of Alberta. Accessed February 24, 2020. https://era.library.ualberta.ca/files/5q47rq06s.

MLA Handbook (7^th Edition):

Fech, Jennifer. “Caring for the radial artery post-angiogram: A pilot study on a comparison of three methods of compression.” 2010. Web. 24 Feb 2020.

Vancouver:

Fech J. Caring for the radial artery post-angiogram: A pilot study on a comparison of three methods of compression. [Internet] [Masters thesis]. University of Alberta; 2010. [cited 2020 Feb 24]. Available from: https://era.library.ualberta.ca/files/5q47rq06s.

Council of Science Editors:

Fech J. Caring for the radial artery post-angiogram: A pilot study on a comparison of three methods of compression. [Masters Thesis]. University of Alberta; 2010. Available from: https://era.library.ualberta.ca/files/5q47rq06s

California State University – Sacramento

14. Shah, Riken. Wavelet based image compression on the Texas Instrument video processing board TMS320DM6437.

Degree: MS, Electrical and Electronic Engineering, 2011, California State University – Sacramento

URL: http://hdl.handle.net/10211.9/1336

► Time has become a crucial issue in today???s lifestyle and to keep up the pace with the world we need to come up with technologies… (more)

Subjects/Keywords: Wavelet; Image; Compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shah, R. (2011). Wavelet based image compression on the Texas Instrument video processing board TMS320DM6437. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.9/1336

Chicago Manual of Style (16^th Edition):

Shah, Riken. “Wavelet based image compression on the Texas Instrument video processing board TMS320DM6437.” 2011. Masters Thesis, California State University – Sacramento. Accessed February 24, 2020. http://hdl.handle.net/10211.9/1336.

MLA Handbook (7^th Edition):

Shah, Riken. “Wavelet based image compression on the Texas Instrument video processing board TMS320DM6437.” 2011. Web. 24 Feb 2020.

Vancouver:

Shah R. Wavelet based image compression on the Texas Instrument video processing board TMS320DM6437. [Internet] [Masters thesis]. California State University – Sacramento; 2011. [cited 2020 Feb 24]. Available from: http://hdl.handle.net/10211.9/1336.

Council of Science Editors:

Shah R. Wavelet based image compression on the Texas Instrument video processing board TMS320DM6437. [Masters Thesis]. California State University – Sacramento; 2011. Available from: http://hdl.handle.net/10211.9/1336

California State University – Sacramento

15. Gandhi, Bhavin Ketankumar. Embedded design of audio acquisition system.

Degree: MS, Electrical and Electronic Engineering, 2011, California State University – Sacramento

URL: http://hdl.handle.net/10211.9/1329

► The audio processing is of great importance in today???s world of portable mobile devices for large data storage. The purpose of the project is to… (more)

Subjects/Keywords: Audio; Compression; Microcontroller

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gandhi, B. K. (2011). Embedded design of audio acquisition system. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.9/1329

Chicago Manual of Style (16^th Edition):

Gandhi, Bhavin Ketankumar. “Embedded design of audio acquisition system.” 2011. Masters Thesis, California State University – Sacramento. Accessed February 24, 2020. http://hdl.handle.net/10211.9/1329.

MLA Handbook (7^th Edition):

Gandhi, Bhavin Ketankumar. “Embedded design of audio acquisition system.” 2011. Web. 24 Feb 2020.

Vancouver:

Gandhi BK. Embedded design of audio acquisition system. [Internet] [Masters thesis]. California State University – Sacramento; 2011. [cited 2020 Feb 24]. Available from: http://hdl.handle.net/10211.9/1329.

Council of Science Editors:

Gandhi BK. Embedded design of audio acquisition system. [Masters Thesis]. California State University – Sacramento; 2011. Available from: http://hdl.handle.net/10211.9/1329

University of Victoria

16. Salehi, Ebad. Employing directive based compression solutions on accelerators global memory under OpenACC.

Degree: Department of Electrical and Computer Engineering, 2016, University of Victoria

URL: http://hdl.handle.net/1828/7284

► Programmers invest extensive development effort to optimize a GPU program to achieve peak performance. Achieving this requires an efficient usage of global memory, and avoiding… (more)

Subjects/Keywords: Accelerators; OpenACC; Compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Salehi, E. (2016). Employing directive based compression solutions on accelerators global memory under OpenACC. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7284

Chicago Manual of Style (16^th Edition):

Salehi, Ebad. “Employing directive based compression solutions on accelerators global memory under OpenACC.” 2016. Masters Thesis, University of Victoria. Accessed February 24, 2020. http://hdl.handle.net/1828/7284.

MLA Handbook (7^th Edition):

Salehi, Ebad. “Employing directive based compression solutions on accelerators global memory under OpenACC.” 2016. Web. 24 Feb 2020.

Vancouver:

Salehi E. Employing directive based compression solutions on accelerators global memory under OpenACC. [Internet] [Masters thesis]. University of Victoria; 2016. [cited 2020 Feb 24]. Available from: http://hdl.handle.net/1828/7284.

Council of Science Editors:

Salehi E. Employing directive based compression solutions on accelerators global memory under OpenACC. [Masters Thesis]. University of Victoria; 2016. Available from: http://hdl.handle.net/1828/7284

Montana Tech

17. Xiong, Khaty. Poor Anima.

Degree: MFA, 2013, Montana Tech

URL: https://scholarworks.umt.edu/etd/755

► At the root of this project is the struggle of my bicultural identity—the practice of composing in a non-native language and the act of speaking… (more)

▼ At the root of this project is the struggle of my bicultural identity—the practice of composing in a non-native language and the act of speaking one’s native language that possesses no written form (though captured in the synthetic Romanized Popular Alphabet, initially for religious conversion, and now, for study, for something). As a second-generation Hmong-American, I am constantly haunted by the Hmong narrative, a story that is “inherently” my own as it is unbelonging to me, elements of my core being stemming from that of the Secret War in Vietnam, diaspora, and cultural brokenness. The poems presented here exhaustively meditate on such chaos, both internal and external, (the humility of) the Hmong life, a life of exile. More intimately, these poems examine speech locked inside the body, violence inflicted upon the self (and onto others), the weight of worthlessness despite “Hmong” meaning “one who is free”—one who is free of worthlessness. The “use” of language (particularly writtenness) is an integral part of my inquiry into said identity, making the writing experience an ultimate, ritualistic paradox of praying, seeing, and meditating. Like many tribal groups, the Hmong’s orally based culture emphasizes the function of the ear—the ability to listen, a super sense to be exercised for awareness—and the mouth for the ability to converse and tell stories. A hybrid of listening and telling stories can be found in the art of "hais kwv txhiaj," or sung poetry, an important practice for every Hmong man or woman. These songs or poems are essentially spoken, improvisational ballads that touch on life experiences or themes of said experiences—being a young adult, an orphan, and or a widow to name a few—each song revealing complex landscapes of both body and mind, and their relationship to the world. While I never successfully learned how to sing my own “life stories,” I chose the foreign art of writing as a form of channeling my own songs, letting the page face my pain, my hunger for belonging and truth, internalizing the inscapes of my fears, those songs that continue to haunt.

Subjects/Keywords: Negotiations; Compression; Hauntology

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Xiong, K. (2013). Poor Anima. (Thesis). Montana Tech. Retrieved from https://scholarworks.umt.edu/etd/755

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Xiong, Khaty. “Poor Anima.” 2013. Thesis, Montana Tech. Accessed February 24, 2020. https://scholarworks.umt.edu/etd/755.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Xiong, Khaty. “Poor Anima.” 2013. Web. 24 Feb 2020.

Vancouver:

Xiong K. Poor Anima. [Internet] [Thesis]. Montana Tech; 2013. [cited 2020 Feb 24]. Available from: https://scholarworks.umt.edu/etd/755.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xiong K. Poor Anima. [Thesis]. Montana Tech; 2013. Available from: https://scholarworks.umt.edu/etd/755

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

McMaster University

18. Liang, Xiao. Study of Uniaxial Compression Process for AA7075 Aluminum Alloy.

Degree: MASc, 2018, McMaster University

URL: http://hdl.handle.net/11375/22859

►

An experimental and complementary FE modeling study was conducted to characterize the room and elevated temperature uniaxial compressive deformation behavior of AA7075-T6 and O-temper materials.… (more)

▼

An experimental and complementary FE modeling study was conducted to characterize the room and elevated temperature uniaxial compressive deformation behavior of AA7075-T6 and O-temper materials. The experiments consisted of testing cylindrical and cubic specimens prepared from a rolled and heat-treated plate stock of AA7075 alloy. The tests were conducted in the lower range of elevated temperatures up to 300 °C, at several different test speeds in rolling and transverse orientations, as well as under isothermal and non-isothermal test conditions. The test results were analyzed in terms of true stress-train responses of the two tempers under the above experimental conditions. The deformed test specimens were also observed for surface features and deformed microstructures in the interior of the specimen under the above experimental conditions. A suitable strain rate and temperature dependent constitutive hardening law, in the form of modified Voce-Kocks law, was developed and coded as a UMAT subroutine in ABAQUS FE code to simulate the uniaxial compression experiments and compare the experimental and model results. In general, good general agreement was obtained between experiments and model predictions. A suitable fracture criterion, in the form of Tresca fracture model, was also implemented as a VUMAT subroutine in ABAQUS FE code to simulate the uniaxial compression experiments and predict fracture mode and other characteristics. Once again, good general agreement was obtained between room temperature fracture shapes and model predictions. The experimental and model results collectively provide a broad-based understanding of the effect of temperature, strain rate, material anisotropy, temperature field on material flow and deformed shapes of cylinders and cubic specimens, the nature of deformation (predominantly shear along two intersecting shear directions) and fracture (predominantly shear). The constraints to deformation at the corners in the cubic specimen yielded rather complex curvature development in deformed cubes. The non-isothermal rapid heating of test specimens using electrical resistance heating and subsequent compression of the specimen provided results similar to the isothermal case. However, the electrical resistance method offers a cost-effective process to form smaller high quality components in forming modes such as hot upsetting.

Thesis

Master of Applied Science (MASc)

Advisors/Committee Members: Jain, Mukesh, Mechanical Engineering.

Subjects/Keywords: AA7075 Aluminum; Compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liang, X. (2018). Study of Uniaxial Compression Process for AA7075 Aluminum Alloy. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/22859

Chicago Manual of Style (16^th Edition):

Liang, Xiao. “Study of Uniaxial Compression Process for AA7075 Aluminum Alloy.” 2018. Masters Thesis, McMaster University. Accessed February 24, 2020. http://hdl.handle.net/11375/22859.

MLA Handbook (7^th Edition):

Liang, Xiao. “Study of Uniaxial Compression Process for AA7075 Aluminum Alloy.” 2018. Web. 24 Feb 2020.

Vancouver:

Liang X. Study of Uniaxial Compression Process for AA7075 Aluminum Alloy. [Internet] [Masters thesis]. McMaster University; 2018. [cited 2020 Feb 24]. Available from: http://hdl.handle.net/11375/22859.

Council of Science Editors:

Liang X. Study of Uniaxial Compression Process for AA7075 Aluminum Alloy. [Masters Thesis]. McMaster University; 2018. Available from: http://hdl.handle.net/11375/22859

19. Langiu, Alessio. Optimal Parsing for dictionary text compression : Parsing optimal pour la compression du texte par dictionnaire.

Degree: Docteur es, Informatique, 2012, Université Paris-Est

URL: http://www.theses.fr/2012PEST1091

► 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… (more)

▼ 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 compression ou d'une classe d'algorithmes de compression homogène. Les contraintes de l'algorithme de compression sont, par exemple, le dictionnaire lui-même, c'est-à-dire l'ensemble dynamique de phrases disponibles, et combien une phrase pèse sur le texte comprimé, c'est-à-dire quelle est la longueur du mot de code qui représente la phrase, appelée aussi le coût du codage d'un pointeur de dictionnaire. En plus de 30 ans d'histoire de la compression de texte par dictionnaire, une grande quantité d'algorithmes, de variantes et d'extensions sont apparus. Cependant, alors qu'une telle approche de la compression du texte est devenue l'une des plus appréciées et utilisées dans presque tous les processus de stockage et de communication, seuls quelques algorithmes de parsing optimaux ont été présentés. Beaucoup d'algorithmes de compression manquent encore d'optimalité pour leur parsing, ou du moins de la preuve de l'optimalité. Cela se produit parce qu'il n'y a pas un modèle général pour le problème de parsing qui inclut tous les algorithmes par dictionnaire et parce que les parsing optimaux existants travaillent sous des hypothèses trop restrictives. Ce travail focalise sur le problème de parsing et présente à la fois un modèle général pour la compression des textes basée sur les dictionnaires appelé la théorie Dictionary-Symbolwise et un algorithme général de parsing qui a été prouvé être optimal sous certaines hypothèses réalistes. Cet algorithme est appelé Dictionary-Symbolwise Flexible Parsing et couvre pratiquement tous les cas des algorithmes de compression de texte basés sur dictionnaire ainsi que la grande classe de leurs variantes où le texte est décomposé en une séquence de symboles et de phrases du dictionnaire. Dans ce travail, nous avons aussi considéré le cas d'un mélange libre d'un compresseur par dictionnaire et d'un compresseur symbolwise. Notre Dictionary-Symbolwise Flexible Parsing couvre également ce cas-ci. Nous avons bien un algorithme de parsing optimal dans le cas de compression Dictionary-Symbolwise où le dictionnaire est fermé par préfixe et le coût d'encodage des pointeurs du dictionnaire est variable. Le compresseur symbolwise est un compresseur symbolwise classique qui fonctionne en temps linéaire, comme le sont de nombreux codeurs communs à longueur variable. Notre algorithme fonctionne sous l'hypothèse qu'un graphe spécial, qui sera décrit par la suite, soit bien défini. Même si cette condition n'est pas… Advisors/Committee Members: Crochemore, Maxime (thesis director).

Subjects/Keywords: Compression du texte; Compression par dictionnaire; Parsing optimal; Text Compression; Dictionary compression; Optimal parsing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Langiu, A. (2012). Optimal Parsing for dictionary text compression : Parsing optimal pour la compression du texte par dictionnaire. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2012PEST1091

Chicago Manual of Style (16^th Edition):

Langiu, Alessio. “Optimal Parsing for dictionary text compression : Parsing optimal pour la compression du texte par dictionnaire.” 2012. Doctoral Dissertation, Université Paris-Est. Accessed February 24, 2020. http://www.theses.fr/2012PEST1091.

MLA Handbook (7^th Edition):

Langiu, Alessio. “Optimal Parsing for dictionary text compression : Parsing optimal pour la compression du texte par dictionnaire.” 2012. Web. 24 Feb 2020.

Vancouver:

Langiu A. Optimal Parsing for dictionary text compression : Parsing optimal pour la compression du texte par dictionnaire. [Internet] [Doctoral dissertation]. Université Paris-Est; 2012. [cited 2020 Feb 24]. Available from: http://www.theses.fr/2012PEST1091.

Council of Science Editors:

Langiu A. Optimal Parsing for dictionary text compression : Parsing optimal pour la compression du texte par dictionnaire. [Doctoral Dissertation]. Université Paris-Est; 2012. Available from: http://www.theses.fr/2012PEST1091

Université Laval

20. Chiriac, Dragos. Le contrôle de la compression, de la prise de son au matriçage : une approche intégrée pour l'examen de problèmes relatifs à la perte de la gamme dynamique causée par la compression lors du matriçage.

Degree: 2014, Université Laval

URL: http://hdl.handle.net/20.500.11794/25011

►

Dans le cadre de notre mémoire, nous nous intéressons aux moyens d’obtenir des niveaux de sonie élevés, particulièrement lorsqu’une telle pratique est pertinente (dans notre… (more)

Subjects/Keywords: Compression audio; Sonie

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chiriac, D. (2014). Le contrôle de la compression, de la prise de son au matriçage : une approche intégrée pour l'examen de problèmes relatifs à la perte de la gamme dynamique causée par la compression lors du matriçage. (Thesis). Université Laval. Retrieved from http://hdl.handle.net/20.500.11794/25011

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Chiriac, Dragos. “Le contrôle de la compression, de la prise de son au matriçage : une approche intégrée pour l'examen de problèmes relatifs à la perte de la gamme dynamique causée par la compression lors du matriçage.” 2014. Thesis, Université Laval. Accessed February 24, 2020. http://hdl.handle.net/20.500.11794/25011.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Chiriac, Dragos. “Le contrôle de la compression, de la prise de son au matriçage : une approche intégrée pour l'examen de problèmes relatifs à la perte de la gamme dynamique causée par la compression lors du matriçage.” 2014. Web. 24 Feb 2020.

Vancouver:

Chiriac D. Le contrôle de la compression, de la prise de son au matriçage : une approche intégrée pour l'examen de problèmes relatifs à la perte de la gamme dynamique causée par la compression lors du matriçage. [Internet] [Thesis]. Université Laval; 2014. [cited 2020 Feb 24]. Available from: http://hdl.handle.net/20.500.11794/25011.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chiriac D. Le contrôle de la compression, de la prise de son au matriçage : une approche intégrée pour l'examen de problèmes relatifs à la perte de la gamme dynamique causée par la compression lors du matriçage. [Thesis]. Université Laval; 2014. Available from: http://hdl.handle.net/20.500.11794/25011

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Melbourne

21. Kuruppu, Shanika Sewwandini. Compression of large DNA databases.

Degree: 2012, University of Melbourne

URL: http://hdl.handle.net/11343/37308

► The thesis explores algorithms to efficiently store and access repetitive DNA sequence collections produced by large-scale genome sequencing projects. First, existing general-purpose and DNA compression… (more)

▼ The thesis explores algorithms to efficiently store and access repetitive DNA sequence collections produced by large-scale genome sequencing projects. First, existing general-purpose and DNA compression algorithms are evaluated for their suitability for compressing large collections of DNA sequences. Then two novel algorithms for compressing large collections of DNA sequences are introduced. The first algorithm is COMRAD, which is a disk-based dictionary compression algorithm that iteratively detects repetitions that occur across multiple sequences, and substitutes them with non-terminals. The method showed that repeats can be feasibly detected across multiple sequences for relatively large collections, while preserving sequence boundaries. The second algorithm is RLZ, which compresses highly similar sequence collections using a simple LZ77 parsing of each sequence with respect to a sequence chosen to be the reference. RLZ was also extended to conduct non-greedy LZ77 parsing, and with the combination of a few other optimisations, the algorithm indirectly detects and encodes approximate matches. RLZ is memory efficient, and is one of the fastest DNA sequence compression algorithms existing to date, both in terms of the compression and decompression speed. Both COMRAD and RLZ can compress sequence collections of fully assembled chromosomes and genomes, as well as sets of contigs and reads. Both algorithms also support individual sequence extraction and random access queries on compressed sets. RLZ was also extended to a full self-index by enabling substring searching on compressed sets with some limitations on detecting substrings. Since the effectiveness of RLZ compression depends on the reference sequence chosen for a collection, techniques for constructing reference sequences that better represent the collection were also explored. The results showed that using a reference sequence constructed with repeats detected by dictionary compressors leads to significant improvements in the compressed sizes produced by RLZ.

Subjects/Keywords: DNA; compression; bioinformatics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kuruppu, S. S. (2012). Compression of large DNA databases. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/37308

Chicago Manual of Style (16^th Edition):

Kuruppu, Shanika Sewwandini. “Compression of large DNA databases.” 2012. Doctoral Dissertation, University of Melbourne. Accessed February 24, 2020. http://hdl.handle.net/11343/37308.

MLA Handbook (7^th Edition):

Kuruppu, Shanika Sewwandini. “Compression of large DNA databases.” 2012. Web. 24 Feb 2020.

Vancouver:

Kuruppu SS. Compression of large DNA databases. [Internet] [Doctoral dissertation]. University of Melbourne; 2012. [cited 2020 Feb 24]. Available from: http://hdl.handle.net/11343/37308.

Council of Science Editors:

Kuruppu SS. Compression of large DNA databases. [Doctoral Dissertation]. University of Melbourne; 2012. Available from: http://hdl.handle.net/11343/37308

University of Oklahoma

22. Nelson, Michael. Compressing and Performing Algorithms on Massively Large Networks.

Degree: PhD, 2019, University of Oklahoma

URL: http://hdl.handle.net/11244/323259

► Networks are represented as a set of nodes (vertices) and the arcs (links) connecting them. Such networks can model various real-world structures such as social… (more)

▼ Networks are represented as a set of nodes (vertices) and the arcs (links) connecting them. Such networks can model various real-world structures such as social networks (e.g., Facebook), information networks (e.g., citation networks), technological networks (e.g., the Internet), and biological networks (e.g., gene-phenotype network). Analysis of such structures is a heavily studied area with many applications. However, in this era of big data, we find ourselves with networks so massive that the space requirements inhibit network analysis. Since many of these networks have nodes and arcs on the order of billions to trillions, even basic data structures such as adjacency lists could cost petabytes to zettabytes of storage. Storing these networks in secondary memory would require I/O access (i.e., disk access) during analysis, thus drastically slowing analysis time. To perform analysis efficiently on such extensive data, we either need enough main memory for the data structures and algorithms, or we need to develop compressions that require much less space while still being able to answer queries efficiently. In this dissertation, we develop several compression techniques that succinctly represent these real-world networks while still being able to efficiently query the network (e.g., check if an arc exists between two nodes). Furthermore, since many of these networks continue to grow over time, our compression techniques also support the ability to add and remove nodes and edges directly on the compressed structure. We also provide a way to compress the data quickly without any intermediate structure, thus giving minimal memory overhead. We provide detailed analysis and prove that our compression is indeed succinct (i.e., achieves the information-theoretic lower bound). Also, we empirically show that our compression rates outperform or are equal to existing compression algorithms on many benchmark datasets. We also extend our technique to time-evolving networks. That is, we store the entire state of the network at each time frame. Studying time-evolving networks allows us to find patterns throughout the time that would not be available in regular, static network analysis. A succinct representation for time-evolving networks is arguably more important than static graphs, due to the extra dimension inflating the space requirements of basic data structures even more. Again, we manage to achieve succinctness while also providing fast encoding, minimal memory overhead during encoding, fast queries, and fast, direct modification. We also compare against several benchmarks and empirically show that we achieve compression rates better than or equal to the best performing benchmark for each dataset. Finally, we also develop both static and time-evolving algorithms that run directly on our compressed structures. Using our static graph compression combined with our differential technique, we find that we can speed up matrix-vector multiplication by reusing previously computed products. We compare… Advisors/Committee Members: Radhakrishnan, Sridhar (advisor), Changwook, Kim (committee member), Cheng, Qi (committee member), Grant, Christan (committee member), Nicholson, Charles (committee member).

Subjects/Keywords: arbitrary; graph; compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Nelson, M. (2019). Compressing and Performing Algorithms on Massively Large Networks. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/323259

Chicago Manual of Style (16^th Edition):

Nelson, Michael. “Compressing and Performing Algorithms on Massively Large Networks.” 2019. Doctoral Dissertation, University of Oklahoma. Accessed February 24, 2020. http://hdl.handle.net/11244/323259.

MLA Handbook (7^th Edition):

Nelson, Michael. “Compressing and Performing Algorithms on Massively Large Networks.” 2019. Web. 24 Feb 2020.

Vancouver:

Nelson M. Compressing and Performing Algorithms on Massively Large Networks. [Internet] [Doctoral dissertation]. University of Oklahoma; 2019. [cited 2020 Feb 24]. Available from: http://hdl.handle.net/11244/323259.

Council of Science Editors:

Nelson M. Compressing and Performing Algorithms on Massively Large Networks. [Doctoral Dissertation]. University of Oklahoma; 2019. Available from: http://hdl.handle.net/11244/323259

Queens University

23. Zhu, Junjie. Lossless Triangle Mesh Compression .

Degree: Computing, 2013, Queens University

URL: http://hdl.handle.net/1974/8131

► Triangle meshes have been widely used in many fields such as digital archives, computer-assisted design and in the game industry. The topic we are particularly… (more)

Subjects/Keywords: Lossless; Compression; Mesh

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhu, J. (2013). Lossless Triangle Mesh Compression . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/8131

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Zhu, Junjie. “Lossless Triangle Mesh Compression .” 2013. Thesis, Queens University. Accessed February 24, 2020. http://hdl.handle.net/1974/8131.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Zhu, Junjie. “Lossless Triangle Mesh Compression .” 2013. Web. 24 Feb 2020.

Vancouver:

Zhu J. Lossless Triangle Mesh Compression . [Internet] [Thesis]. Queens University; 2013. [cited 2020 Feb 24]. Available from: http://hdl.handle.net/1974/8131.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhu J. Lossless Triangle Mesh Compression . [Thesis]. Queens University; 2013. Available from: http://hdl.handle.net/1974/8131

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Queens University

24. Schumacher, Yvonne. Comparison of Two Loading Surface Preparation Methods on Rat Vertebral Bodies for Compression Testing .

Degree: Mechanical and Materials Engineering, 2013, Queens University

URL: http://hdl.handle.net/1974/8359

► Osteoporosis is a disease characterized by bone loss affecting 10% of the US population over 50 years old. The spine is one critical area affected… (more)

▼ Osteoporosis is a disease characterized by bone loss affecting 10% of the US population over 50 years old. The spine is one critical area affected by the disease. The effectiveness of experimental treatments can be tested on an ovariectomized rat osteoporosis model. As a result, lumbar vertebral bodies are often mechanically tested in uniaxial compression in order to determine whether or not the mechanical properties of the bone in ovariectomized rats improve with treatment. The irregular shape of rat vertebral bodies requires some specimen preparation to create two parallel loading surfaces for uniaxial compression testing. Two specimen preparation methods are reported in the current body of literature. One cuts the cranial and caudal surfaces to make them parallel to each other. The other cuts the caudal surface and uses bone cement to create a flat loading surface at the cranial end. In this thesis a total of twenty rat vertebral bodies were tested. Ten were prepared with a cut specimen preparation method and ten with an embedding method. Each specimen was tested in uniaxial compression and was microCT scanned before and after testing. Eleven parameters were calculated from the mechanical testing data and compared between the two groups using Student’s t-tests. The specimens were also categorized into six failure modes and locations observed in the microCT images. The embedded specimens showed a lower stiffness (p = 0.026), greater yield displacement (p = 0.007) and apparent strain at failure (p = 0.050). These differences were largely attributed to the embedded specimens being 1 mm taller than the cut specimens. The shorter size of the cut specimens affected the mechanical parameters. The cut specimens were easier to prepare and were less sensitive to end effect failures. The embedded specimens kept the endplate, which distributes the load from the intervertebral disk through the vertebral body, intact. In addition, the embedded specimens exhibited two failure modes, endplate failure and failure at the center of the vertebral body, observed in ex vivo human lumbar vertebral body testing, which suggests the interaction of the vertebral body with the endplate is an important factor in vertebral body failure in uniaxial compression testing. In conclusion, neither preparation method showed an overwhelming advantage over the other, and experimental parameters should be considered when choosing a loading surface preparation method.

Subjects/Keywords: Compression Testing; Bone

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Schumacher, Y. (2013). Comparison of Two Loading Surface Preparation Methods on Rat Vertebral Bodies for Compression Testing . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/8359

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Schumacher, Yvonne. “Comparison of Two Loading Surface Preparation Methods on Rat Vertebral Bodies for Compression Testing .” 2013. Thesis, Queens University. Accessed February 24, 2020. http://hdl.handle.net/1974/8359.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Schumacher, Yvonne. “Comparison of Two Loading Surface Preparation Methods on Rat Vertebral Bodies for Compression Testing .” 2013. Web. 24 Feb 2020.

Vancouver:

Schumacher Y. Comparison of Two Loading Surface Preparation Methods on Rat Vertebral Bodies for Compression Testing . [Internet] [Thesis]. Queens University; 2013. [cited 2020 Feb 24]. Available from: http://hdl.handle.net/1974/8359.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schumacher Y. Comparison of Two Loading Surface Preparation Methods on Rat Vertebral Bodies for Compression Testing . [Thesis]. Queens University; 2013. Available from: http://hdl.handle.net/1974/8359

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

25. -0371-5522. Memory compression for higher effective capacity and bandwidth.

Degree: PhD, Electrical and Computer Engineering, 2019, University of Texas – Austin

URL: http://dx.doi.org/10.26153/tsw/5812

► Many important client and data-center applications need large memory capacity and high memory bandwidth to achieve their performance and energy efficiency goals. With the increase… (more)

Subjects/Keywords: Memory; Memory architecture; Compression; Memory compression; Main memory compression; GPU; GPU compression; Methodology; Compression methodology; Data movement

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

-0371-5522. (2019). Memory compression for higher effective capacity and bandwidth. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/5812

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16^th Edition):

-0371-5522. “Memory compression for higher effective capacity and bandwidth.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed February 24, 2020. http://dx.doi.org/10.26153/tsw/5812.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7^th Edition):

-0371-5522. “Memory compression for higher effective capacity and bandwidth.” 2019. Web. 24 Feb 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-0371-5522. Memory compression for higher effective capacity and bandwidth. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2020 Feb 24]. Available from: http://dx.doi.org/10.26153/tsw/5812.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-0371-5522. Memory compression for higher effective capacity and bandwidth. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/5812

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of North Texas

26. Kiselyov, Oleg E. Multiresolutional/Fractal Compression of Still and Moving Pictures.

Degree: 1993, University of North Texas

URL: https://digital.library.unt.edu/ark:/67531/metadc278779/

► The scope of the present dissertation is a deep lossy compression of still and moving grayscale pictures while maintaining their fidelity, with a specific goal… (more)

Subjects/Keywords: Image compression.; multiresolutional compression; fractal compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kiselyov, O. E. (1993). Multiresolutional/Fractal Compression of Still and Moving Pictures. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278779/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Kiselyov, Oleg E. “Multiresolutional/Fractal Compression of Still and Moving Pictures.” 1993. Thesis, University of North Texas. Accessed February 24, 2020. https://digital.library.unt.edu/ark:/67531/metadc278779/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Kiselyov, Oleg E. “Multiresolutional/Fractal Compression of Still and Moving Pictures.” 1993. Web. 24 Feb 2020.

Vancouver:

Kiselyov OE. Multiresolutional/Fractal Compression of Still and Moving Pictures. [Internet] [Thesis]. University of North Texas; 1993. [cited 2020 Feb 24]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278779/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kiselyov OE. Multiresolutional/Fractal Compression of Still and Moving Pictures. [Thesis]. University of North Texas; 1993. Available from: https://digital.library.unt.edu/ark:/67531/metadc278779/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Texas State University – San Marcos

27. Azimi Moghaddam, Sahar. GPU Execution Tracing and Compression.

Degree: MS, Computer Science, 2017, Texas State University – San Marcos

URL: https://digital.library.txstate.edu/handle/10877/7738

► Program tracing is widely used for debugging and performance optimization. Whenever a program is traced, the overhead in terms of extra runtime and in terms… (more)

Subjects/Keywords: GPU execution tracing; GPU trace compression; Trace compression; Parallel programming; Data compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Azimi Moghaddam, S. (2017). GPU Execution Tracing and Compression. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/7738

Chicago Manual of Style (16^th Edition):

Azimi Moghaddam, Sahar. “GPU Execution Tracing and Compression.” 2017. Masters Thesis, Texas State University – San Marcos. Accessed February 24, 2020. https://digital.library.txstate.edu/handle/10877/7738.

MLA Handbook (7^th Edition):

Azimi Moghaddam, Sahar. “GPU Execution Tracing and Compression.” 2017. Web. 24 Feb 2020.

Vancouver:

Azimi Moghaddam S. GPU Execution Tracing and Compression. [Internet] [Masters thesis]. Texas State University – San Marcos; 2017. [cited 2020 Feb 24]. Available from: https://digital.library.txstate.edu/handle/10877/7738.

Council of Science Editors:

Azimi Moghaddam S. GPU Execution Tracing and Compression. [Masters Thesis]. Texas State University – San Marcos; 2017. Available from: https://digital.library.txstate.edu/handle/10877/7738

28. Tikkireddy, Lakshmi Venkata Sai Sri. Dictionary-based Compression Algorithms in Mobile Packet Core.

Degree: 2019, , Blekinge Institute of Technology

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18813

► With the rapid growth in technology, the amount of data to be transmitted and stored is increasing. The efficiency of information retrieval and storage… (more)

Subjects/Keywords: Data Compression; Lossless compression; LZ4; Brotli; Zstandard; Deflate; Dictionary-based compression.; Computer Sciences; Datavetenskap (datalogi)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tikkireddy, L. V. S. S. (2019). Dictionary-based Compression Algorithms in Mobile Packet Core. (Thesis). , Blekinge Institute of Technology. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18813

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Tikkireddy, Lakshmi Venkata Sai Sri. “Dictionary-based Compression Algorithms in Mobile Packet Core.” 2019. Thesis, , Blekinge Institute of Technology. Accessed February 24, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18813.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Tikkireddy, Lakshmi Venkata Sai Sri. “Dictionary-based Compression Algorithms in Mobile Packet Core.” 2019. Web. 24 Feb 2020.

Vancouver:

Tikkireddy LVSS. Dictionary-based Compression Algorithms in Mobile Packet Core. [Internet] [Thesis]. , Blekinge Institute of Technology; 2019. [cited 2020 Feb 24]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18813.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tikkireddy LVSS. Dictionary-based Compression Algorithms in Mobile Packet Core. [Thesis]. , Blekinge Institute of Technology; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18813

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Utah

29. Merryweather, Andrew S. Model development for the estimation of back compressive force and subsequent low back disorder risk.

Degree: MS;, Mechanical Engineering;, 2007, University of Utah

URL: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/812/rec/779

► Low back disorders (LBD) continue to be a costly problem in the workplace. Employees and employers both suffer loses from the effects of low back… (more)

Subjects/Keywords: Backache; Spinal cord compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Merryweather, A. S. (2007). Model development for the estimation of back compressive force and subsequent low back disorder risk. (Masters Thesis). University of Utah. Retrieved from http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/812/rec/779

Chicago Manual of Style (16^th Edition):

Merryweather, Andrew S. “Model development for the estimation of back compressive force and subsequent low back disorder risk.” 2007. Masters Thesis, University of Utah. Accessed February 24, 2020. http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/812/rec/779.

MLA Handbook (7^th Edition):

Merryweather, Andrew S. “Model development for the estimation of back compressive force and subsequent low back disorder risk.” 2007. Web. 24 Feb 2020.

Vancouver:

Merryweather AS. Model development for the estimation of back compressive force and subsequent low back disorder risk. [Internet] [Masters thesis]. University of Utah; 2007. [cited 2020 Feb 24]. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/812/rec/779.

Council of Science Editors:

Merryweather AS. Model development for the estimation of back compressive force and subsequent low back disorder risk. [Masters Thesis]. University of Utah; 2007. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/812/rec/779

University of Alberta

30. Orsten, Sterling. Dynamically learning efficient server/client network protocols for networked simulations.

Degree: MS, Department of Computing Science, 2011, University of Alberta

URL: https://era.library.ualberta.ca/files/1g05fc10f

► With the rise of services like Steam and Xbox Live, multiplayer support has become essential to the success of many commercial video games. Explicit, server-client… (more)

Subjects/Keywords: networking; games; software engineering; compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Orsten, S. (2011). Dynamically learning efficient server/client network protocols for networked simulations. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/1g05fc10f

Chicago Manual of Style (16^th Edition):

Orsten, Sterling. “Dynamically learning efficient server/client network protocols for networked simulations.” 2011. Masters Thesis, University of Alberta. Accessed February 24, 2020. https://era.library.ualberta.ca/files/1g05fc10f.

MLA Handbook (7^th Edition):

Orsten, Sterling. “Dynamically learning efficient server/client network protocols for networked simulations.” 2011. Web. 24 Feb 2020.

Vancouver:

Orsten S. Dynamically learning efficient server/client network protocols for networked simulations. [Internet] [Masters thesis]. University of Alberta; 2011. [cited 2020 Feb 24]. Available from: https://era.library.ualberta.ca/files/1g05fc10f.

Council of Science Editors:

Orsten S. Dynamically learning efficient server/client network protocols for networked simulations. [Masters Thesis]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/1g05fc10f

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations