Dissertations / Theses on the topic 'Erasure of the subject'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Erasure of the subject.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Gaudin, Denys. "Ecriture et voix : clinique du recours à l'écrit chez des sujets psychotiques." Thesis, Aix-Marseille, 2018. http://www.theses.fr/2018AIXM0021.
Full textWe examine the issue of a link between voice and writing in psychosis. Relying on psychotic subjects who say they write what they hear through voices, we study the nature of this shifting from voice to letter. As a first step, we specify what we mean by voice. We detail what psychotic subjects teach us about the mechanisms involved in the moment of the hallucinated voice. By doing so, we point out the part of jouissance involved in voice.As a second step, we focus on their writing practices, the moment when they take note, when they put down on paper what they hear through voices. We endeavour to elucidate the issues of this movement. We are led to examine the regulating function of writing. Therefore, we refer to the lacanian concept of letter as « littoral » or « godet ». Moreover, patients’ words led us to specify how writing could be a way to make the voice “go away”, a way to separate. The works and the testimonies of writers lead us to go on exploring a field where the artist always precedes the clinician. We refer to James Joyce, to Louis Wolfson, and especially, to Samuel Beckett’s works. We try to grasp the indications they give about a link between voice and writing. The purpose is to test the hypothesis which states that, in psychosis, the use of writing can be a way to treat the voice
Jhupsee, Sneha. "Erasure layering." Master's thesis, University of Cape Town, 2018. http://hdl.handle.net/11427/28065.
Full textDenan, Françoise. "Souffrance au travail et discours capitaliste : une lecture lacanienne subversive." Electronic Thesis or Diss., Paris 8, 2022. http://www.theses.fr/2022PA080079.
Full textDebates in the media oppose workers psychology against working conditions. A review of studies by sociologists of work shows that it is possible to articulate these opposing elements differently, based on various causalities: anomie, a deregulation that blurs the limits (Durkheim); a specific, meaningless company language (Gaulejac); a repression of thought (Dejours).Freud and Lacan are both readers of Marx. Freud makes him an adversary who disregards the death drive whilst Lacan pays him a strong homage, retracing in his footsteps the Hegelian dialectic of master and slave thanks to the paradigm of discourses. Two major concepts can be deduced from this: the master-signifier, which demonstrates the injunctive power of language, and the surplus-jouissance, the counterpart of the restrictions imposed on jouissance that Lacan makes the very principle of capitalism.However, science and the financialisation of contemporary economics pulverise the discourse, eradicating the subject in favour of accounting, removing any barrier to jouissance, which has become an inalienable right. The reign of numbers only allows us to think in terms of a continuity that unfolds ad infinitum (1 + 1 + 1 +…) and no longer of opposing elements (allowed / forbidden) that are likely to put limits on excess.Leaving a capitalist discourse supposes a new way of handling of the language. By making resonate the hitherto concealed jouissance, the psychoanalyst gives everyone a chance to reappropriate their own language and thereby to say no to always-more. The desire which arises creates a new social bond and makes it possible to think of an alternative political system to the globalized governance by numbers
Aksak, Cagan. "Landauer Erasure For Quantum Systems." Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/2/12611047/index.pdf.
Full texts thought experiment on a demon performing microscopic actions and violating the second law of thermodynamics has been a challenging paradox for a long time. It is finally resolved in the seventies and eighties by using Landauer&rsquo
s principle, which state that erasing information is necessarily accompanied with a heat dumped to the environment. The purpose of this study is to describe the heat dumped to the environment associated with erasure operations on quantum systems. To achieve this, first a brief introduction to necessary tools like density matrix formalism, quantum operators and entropy are given. Second, the Maxwell&rsquo
s demon and Szilard model is described. Also the connection between information theory and physics is discussed via this model. Finally, heat transfer operators associated with quantum erasure operations are defined and all of their properties are obtained.
Demay, Gregory. "Source Coding for Erasure Channels." Thesis, KTH, Kommunikationsteori, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-55297.
Full textAlex, Stacey Margaret. "Resisting Erasure: Undocumented Latinx Narratives." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1563164119840926.
Full textKang, Hyunsook. "Is Plane Conflation Bracket Erasure?" Department of Linguistics, University of Arizona (Tucson, AZ), 1988. http://hdl.handle.net/10150/227252.
Full textCai, Jing. "A study of erasure correcting codes." Thesis, University of Plymouth, 2010. http://hdl.handle.net/10026.1/1650.
Full textPAIBA, FRANKLIN ANTONIO SANCHEZ. "BIDIMENSIONAL FOUNTAIN CODES FOR ERASURE CHANNELS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2008. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=12457@1.
Full textEsta dissertação aborda o estudo de códigos fontanais (códigos LT e códigos Raptor) que são uma classe de códigos criados para a transmissão de dados de maneira confiável e eficiente através de canais os quais podem ser modelados como canais com apagamento. Os códigos LT e códigos Raptor são denominados códigos fontanais, devido a que eles são uma boa aproximação para o conceito de fontanas digitais. Além disso, eles são classificados como códigos de taxa versátil, no sentido que o número de símbolos codificados que podem ser gerados a partir dos dados de entrada é potencialmente ilimitado. Códigos LT são capazes de recuperar, com probabilidade maior do que (1 − delta), um conjunto de k símbolos de entrada a partir de quaisquer k + O((raiz quadrada de k)(ln(2))(k/delta)) símbolos codificados recebidos, com uma média de O(k ln(k/delta)) operações XOR. Os códigos Raptor são uma extensão de códigos LT, na qual o processo de codificação é composto de duas etapas: um código de bloco de comprimento fixo (denominado pré- código) e um código LT com uma distribuição de graus apropriada. Investigou-se o desempenho dos códigos LT usando duas novas distribuições de graus (Sóliton Robusta Melhorada e Sóliton Robusta Truncada) e foi proposto um modelo de códigos LT Bidimensionais, na qual os símbolos de entrada são agrupados em forma de matriz. Neste esquema os blocos correspondentes às linhas da matriz são codificados usando um código LT e, em seguida, a matriz resultante tem suas colunas também codificadas usando um código LT. Ainda que a complexidade do esquema tenha sido dobrada o desempenho alcançado pelos códigos LT Bidimensionais superou o desempenho dos códigos LT convencionais para situações em que a qualidade do canal BEC é elevada.
Fountain Codes (LT Codes and Raptor Codes) are a class of codes proposed to efficient and reliably transmit data through Erasure Channels. LT Codes and Raptor Codes are a good approximation to the concept of digital fountain and as such are named as fountain codes. They are said to be rateless codes in the sense that the number of symbols produced by the encoder could grow, potentially, to infinite. With probability of success larger than (1−delta), a decoder of an LT code based scheme can recover the k transmitted symbols from any received block of k + O((square root k)(ln(2))(k/delta)) correct symbols with an average of O(k ln(k/delta)) XOR operations. Raptor codes are an extension of the LT codes idea, with a tandem scheme where a fixed length block code (namely a pre- code) is followed by an LT code that uses a properly chosen degree distribution. In this dissertation the performance of LT codes with two recently proposed degree distributions, the Improved Robust Soliton and the Truncated Soliton Robust Distribution were investigated. A new scheme called Bidimensional LT Codes, has been proposed. In this scheme the input symbols are structured in a matrix form and afterwards the blocks corresponding to the lines of the matrix are encoded with an LT code. The columns of the new matrix so obtained are next encoded with a similar LT code. The complexity of the new scheme is doubled and yet its performance only just surpasses that of the conventional LT scheme for high quality BEC.
Rehman, Sadia. "This is My Family: An Erasure." The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1492399220029598.
Full textDavids, Margaret. "Erasure: An Additive and Subtractive Act." VCU Scholars Compass, 2019. https://scholarscompass.vcu.edu/etd/5866.
Full textProvest, Ian S., of Western Sydney Nepean University, of Performance Fine Arts and Design Faculty, and School of Design. "Concepts of viewpoint and erasure: Botany Bay." THESIS_FPFAD_SD_Provest_I.xml, 1996. http://handle.uws.edu.au:8081/1959.7/790.
Full textMaster of Arts (Hons) (Visual Arts)
Provest, I. S. "Concepts of viewpoint and erasure : Botany Bay /." View thesis, 1996. http://library.uws.edu.au/adt-NUWS/public/adt-NUWS20030910.162554/index.html.
Full textTalebi-Rafsanjan, Siamak. "Image restoration techniques for bursty erasure channels." Thesis, King's College London (University of London), 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.406409.
Full textMishra-Linger, Richard Nathan. "Irrelevance, Polymorphism, and Erasure in Type Theory." PDXScholar, 2008. https://pdxscholar.library.pdx.edu/open_access_etds/2674.
Full textZepeda, Salvatierra Joaquin Alejandro. "Tanden filterbank DFT code for bursty erasure correction." Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=99553.
Full textFollowing a survey of DFT decoding algorithms, we present herein the Tandem Filterbank/DFT Code (TFBD). The TFBD code consists of a tandem arrangement of a filterbank and DFT encoder that effectively creates DFT codes along the rows (temporal codevectors) and columns (subband codevectors) of the frame under analysis. The tandem arrangement ensures that subband codevectors (the frame columns) will be DFT codes, and we show how the temporal codevectors (frame rows) can also be interpreted as DFT codes. All the subband and temporal codevectors can be used to reconstruct samples entirely independently of each other. An erasure burst along a particular codevector can then be broken up by reconstructing some lost samples along the remaining orientation; these samples can then be used as received samples in reconstructing the original codevector, a technique that we refer to as pivoting. Expressions related to the performance of the Tandem Filterbank/DFT (TFBD) code, including an expression for the temporal code reconstruction error and for temporal-to-subband pivoting operations, are derived and verified through simulations. The expressions also prove useful in the selection of the many parameters specifying a TFBD encoder. The design process is illustrated for two sample TFBD codes that are then compared to a benchmark DFT code at the same rate. The results show that the TFBD encoder is capable of reconstruction error improvements that are more than four orders of magnitude better than that of the benchmark DFT code.
Jeffries, Sean Joseph. "Imprint erasure and DNA demethylation in mouse development." Thesis, University of Cambridge, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608949.
Full textZheng, Chenbo. "Error and erasure decoding for a CDPD system." Thesis, This resource online, 1996. http://scholar.lib.vt.edu/theses/available/etd-08222008-063125/.
Full textApollonio, Pietrofrancesco. "Erasure error correcting codes applied to DTN communications." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amslaurea.unibo.it/6852/.
Full textTomás, Estevan Virtudes. "Complete-MDP convolutional codes over the erasure channel." Doctoral thesis, Universidad de Alicante, 2010. http://hdl.handle.net/10045/18325.
Full textGiotta, Gina Nicole. "Disappeared: erasure in the age of mechanical writing." Diss., University of Iowa, 2011. https://ir.uiowa.edu/etd/2705.
Full textAzeem, Muhammad Moazam. "Erasure Correcting Codes for Opportunistic Spectrum Access (OSA)." Thesis, Paris, CNAM, 2014. http://www.theses.fr/2014CNAM1002/document.
Full textThe emergence of new devices especially the smartphones and tablets having a lot of new applications have rocketed the wireless traffic in recent years and this is the cause of main surge in the demand of radio spectrum. There is a need of either more spectrum or to use existing spectrum more efficiently due to dramatic increase in the demand of limited spectrum. Among the new dynamic access schemes designed to use the spectrum more efficiently opportunistic spectrum access (OSA) is currently addressed when one or more secondary users (SU) are allowed to access the channel when the PU is not transmitting. The erasure correcting codes are therefore envisioned to recover the lost data due to sensing impairments. We define the parameter efficiency of SU and optimize it in-terms of spectrum utilization keeping into account sensing impairments, code parameters and the activity of PU. Finally, the spectrum access for multiple secondary users is addressed when there is no primary and each user has equal right to access the channel. The interesting scenarios are Cognitive radio networks and WiFi where 802.11 protocol gives the specification for MAC layer. The throughput curvesachieved by retransmission and using various erasure correcting codes are compared. This modification in MAC layer will reduce the long waiting time to access the channel, as the number of users are increased
Azeem, Muhammad Moazam. "Erasure Correcting Codes for Opportunistic Spectrum Access (OSA)." Electronic Thesis or Diss., Paris, CNAM, 2014. http://www.theses.fr/2014CNAM1002.
Full textThe emergence of new devices especially the smartphones and tablets having a lot of new applications have rocketed the wireless traffic in recent years and this is the cause of main surge in the demand of radio spectrum. There is a need of either more spectrum or to use existing spectrum more efficiently due to dramatic increase in the demand of limited spectrum. Among the new dynamic access schemes designed to use the spectrum more efficiently opportunistic spectrum access (OSA) is currently addressed when one or more secondary users (SU) are allowed to access the channel when the PU is not transmitting. The erasure correcting codes are therefore envisioned to recover the lost data due to sensing impairments. We define the parameter efficiency of SU and optimize it in-terms of spectrum utilization keeping into account sensing impairments, code parameters and the activity of PU. Finally, the spectrum access for multiple secondary users is addressed when there is no primary and each user has equal right to access the channel. The interesting scenarios are Cognitive radio networks and WiFi where 802.11 protocol gives the specification for MAC layer. The throughput curvesachieved by retransmission and using various erasure correcting codes are compared. This modification in MAC layer will reduce the long waiting time to access the channel, as the number of users are increased
Greenan, Kevin M. "Reliability and power-efficiency in erasure-coded storage systems /." Diss., Digital Dissertations Database. Restricted to UC campuses, 2009. http://uclibs.org/PID/11984.
Full textKalichini, Gladys. "FyaMoneka: exploring the erasure of women within Zambian history." Thesis, Rhodes University, 2018. http://hdl.handle.net/10962/63186.
Full textZeng, Weifei. "Coding and scheduling optimization over packet erasure broadcast channels." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/71501.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 93-97).
Throughput and per-packet delay can present strong trade-offs that are important in the cases of delay sensitive applications. In this thesis, we investigate such trade-offs using a random linear network coding scheme for one or more receivers in single hop wireless packet erasure broadcast channels. We capture the delay sensitivities across different types of network applications using a class of delay metrics based on the norms of packet arrival times. With these delay metrics, we establish a unified framework to characterize the rate and delay requirements of applications and optimize system parameters. In the single receiver case, we demonstrate the trade-off between average packet delay, which we view as the inverse of throughput, and maximum ordered inter-arrival delay for various system parameters. For a single broadcast channel with multiple receivers having different delay constraints and feedback delays, we jointly optimize the coding parameters and time-division scheduling parameters at the transmitters. We formulate the optimization problem as a Generalized Geometric Program (GGP). This approach allows the transmitters to adjust adaptively the coding and scheduling parameters for efficient allocation of network resources under varying delay constraints. In the case where the receivers are served by multiple non-interfering wireless broadcast channels, the same optimization problem is formulated as a Signomial Program, which is NP-hard in general. We provide approximation methods using successive formulation of geometric programs and show the convergence of approximations. Practical issues of implementing proposed coding and optimization scheme on existing layered network architecture are also discussed.
by Weifei Zeng.
S.M.
Ahmad, Shakeel. "Optimized Network-Adaptive Multimedia Transmission Over Packet Erasure Channels." [S.l. : s.n.], 2008. http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-70706.
Full textChilders, Thomas Edward. "File transfer with erasure coding over wireless sensor networks." Thesis, Monterey, Calif. : Naval Postgraduate School, 2009. http://edocs.nps.edu/npspubs/scholarly/theses/2009/Mar/09Mar%5FChilders.pdf.
Full textThesis Advisors: McEachen, John ; Tummala, Murali. "March 2009." Description based on title screen as viewed on April 23, 2009. Author subject terms: Wireless Communication, Wireless Sensor Networks, Data Transmission. Includes bibliographical references (p. 81-82). Also available in print.
Nagasubramanian, Karthik. "Code design for erasure channels with limited or noisy feedback." [College Station, Tex. : Texas A&M University, 2007. http://hdl.handle.net/1969.1/ETD-TAMU-2065.
Full textLe, Dang Quang. "Opportunistic multicasting scheduling using erasure-correction coding over wireless channels." Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=95215.
Full textDans les communications sans-fil, la diffusion se prête naturellement aux services efficaces de multidiffusion tandis que les variations des gains de canal, parmi les liens avec les différents utilisateurs, permettent de promouvoir la diversité multiutilisateur qui peut être utilisée pour améliorer la performance de multidiffusion. Ce mémoire propose une méthode d'ordonnancement multidiffusion opportuniste en utilisant un code correcteur d'effacement pour exploiter conjointement le gain de multidiffusion ainsi que les diversités temporelle, spectrale et multiutilisateurs disponibles dans les communications sans fil. La méthode proposée n'envoie qu'une seule copie, sur les créneaux temporels et spectraux, à un seuil de transmission sélectionné pour tous les utilisateurs appartenant au groupe de multidiffusion et en utilisant un code correcteur d'effacement pour récupérer les paquets effacés lorsque le rapport signal sur bruit (SNR) instantané du lien entre Station de Base et un utilisateur est insuffisant. Sur un canal à évanouissement uniforme, un cadre analytique est développé pour établir la sélection optimale du seuil de transmission et le taux de codage à effacement pour atteindre le meilleur débit de multidiffusion sous l'effet de différentes conditions d'évanouissement. Les résultats numériques montrent que la méthode proposée surpasse en performance à la fois les méthodes Pire-Utilisateur et Meilleur-Utilisateur pour une ample plage de SNR. Les résultats montrent aussi que la diversité multiutilisateur est supérieure à bas SNR tandis que le gain multidiffusion est plus significatif à haut SNR. De plus, pour étudier le rôle de la connaissance du canal, la méthode proposée est considérée pour deux cas: (i) avec connaissance complète du canal et (ii) avec seulement une connaissance partielle du type d'évanouissement et SNR moyen. Notre étude indique que la connaissance complète du canal est avantageuse pour$
Parikh, Salil (Salil Arvind) 1971. "On the use of erasure codes in unreliable data networks." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/33159.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 62-64).
Modern data networks are approaching the state where a large number of independent and heterogeneous paths are available between a source node and destination node. In this work, we explore the case where each path has an independent level of reliability characterized by a probability of path failure. Instead of simply repeating the message across all the paths, we use the path diversity to achieve reliable transmission of messages by using a coding technique known as an erasure correcting code. We develop a model of the network and present an analysis of the system that invokes the Central Limit Theorem to approximate the total number of bits received from all the paths. We then optimize the number of bits to send over each path in order to maximize the probability of receiving a sufficient number of bits at the destination to reconstruct the message using the erasure correcting code. Three cases are investigated: when the paths are very reliable, when the paths are very unreliable, and when the paths have a probability of failure within an interval surrounding 0.5. We present an overview of the mechanics of an erasure coding process applicable to packet-based transactions. Finally, as avenues for further research, we discuss several applications of erasure coding in networks that have only a single path between source and destination: for latency reduction in interactive web sessions; as a transport layer for critical messaging; and an application layer protocol for high-bandwidth networks.
by Salil Parikh.
S.M.
Small-Clouden, Lystra. "Globalization, assimilation, culture erasure| A review of Trinidad and Tobago." Thesis, Capella University, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3723119.
Full textThe objective of this study was to examine the relationship between globalization and assimilation (dependent variables), and four contributing factors of culture, value, norms, and identity (independent variables) to determine whether managers in Trinidad and Tobago devalue their own culture to assimilate into a global culture. A researcher-constructed survey questionnaire was used to collect data from a random sample of respondents. The survey was analyzed utilizing both parametric and nonparametric statistical tools to answer five Research Subquestions. The one-sample t test was an appropriate tool to establish construct reliability and validity of assumptions for this quantitative study. Values were established to support the level of statistical significance for (p < 0.05) effect as follows: a medium effect size (f2 = .15), alpha = .0.05, power = .80, yielding an acceptable sample size of 85 participants. Based on the evaluation of the statistical data, it was concluded (a) there was an impact of demographic factors on culture, values, norms, and identity; (b) global factors had no impact on culture, values, norms and identity; (c) the Trinidad and Tobago manager assimilated during international business meetings; (d) there was an impact of assimilation on culture, values, norms and identity in Trinidad and Tobago; and (e) there was no change in management behavior during international business meetings. Three implications resulted from the findings. First, from a theoretical perspective, based on the analysis of culture, managers were unaware of culture erasure. Second, from a scientific merit perspective, the ANOVA method optimized and validated causal-comparative effect of both measurement and structural models with the inclusion of interrelationships effects between variables. Finally, from a practical perspective, respondents perceived global factors had no impact on culture, but assimilation had a negative impact on culture. Based on the results, it was assumed the unique and distinguishable aspects of culture are disappearing, and the effects of globalization and assimilation have caused an unconscious reprogramming of collective behaviors, which resulted in culture erasure.
Phillips, Linzy. "Erasure-correcting codes derived from Sudoku & related combinatorial structures." Thesis, University of South Wales, 2013. https://pure.southwales.ac.uk/en/studentthesis/erasurecorrecting-codes-derived-from-sudoku--related-combinatorial-structures(b359130e-bfc2-4df0-a6f5-55879212010d).html.
Full textScherer, Frank F. "A culture of erasure, orientalism and Chineseness in Cuba, 1847-1997." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape2/PQDD_0017/MQ59204.pdf.
Full textAitken, D. G. "Error control coding for mixed wireless and internet packet erasure channels." Thesis, University of Surrey, 2008. http://epubs.surrey.ac.uk/804436/.
Full textKane, Peter William. "Representation and meaning : the erasure of mediation in contemporary text theory." Thesis, University of Canterbury. Department of English, 1988. http://hdl.handle.net/10092/3801.
Full textElliott, Matthew Edwin. "Erasure and reform Los Angeles literature and the reconstruction of the past /." College Park, Md. : University of Maryland, 2004. http://hdl.handle.net/1903/2075.
Full textThesis research directed by: English Language and Literature. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Wang, Chia-Wen. "Bounds on the map threshold of iterative decoding systems with erasure noise." Thesis, Texas A&M University, 2008. http://hdl.handle.net/1969.1/86027.
Full textChang, Cheng. "Reliable and secure storage with erasure codes for OpenStack Swift in PyECLib." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-202972.
Full textMolnlagring system har upplevt en snabb tillväxt att spela en viktig roll i molnbaserade tjänster under det senaste decenniet. Bland annat är Openstack Swift en programvara med öppen källköd som ska införa som object lagring system. Dessutom har molnlagring system gjort stora ansträngar för att säkerställa kvaliten av sina tjänster. En av de viktigaste faktorerna av molnlagring system är datashållbarheten. Feltoleransmekanismer spelar en viktig roll för att grantera datastillgångår. Bland annat finns det Replikering och RAID används för att skydda data från förlorade trots att de drabbas av många nackdelar. Erasure kodning kommer som nytt koncept som kan tillämpas i lagringssystem för angelägenheten av datastillgänglighet. Forskningar har visat att det kan ge feltolerans med uppsägningar och samtidigt minska kapaciteten och erbjuder en kompromiss mellan prestanda och kostnad. Projekten gjorde en fördjupad undersökning på Openstack Swift och erasure kodning. Analyserna på raderingskodade och replikationssystem har vidtagits för att jämföra egenskaperna hos båda metoder. En prototyp av anpassade radering koden är att implementeras som förlängning till Swift och erbjuder datalagring med lovande tillförlitlighet och prestanda.
Thie, Johnson Electrical Engineering & Telecommunications Faculty of Engineering UNSW. "Optimal erasure protection assignment for scalably compressed data over packet-based networks." Awarded by:University of New South Wales. Electrical Engineering and Telecommunications, 2004. http://handle.unsw.edu.au/1959.4/19373.
Full textVishwanathan, Roopa Tate Stephen R. "Power-benefit analysis of erasure encoding with redundant routing in sensor networks." [Denton, Tex.] : University of North Texas, 2006. http://digital.library.unt.edu/permalink/meta-dc-5426.
Full textAlivizatou, M. E. "Preservation, erasure and representation : rethinking 'intangible heritage' in a comparative museum ethnography." Thesis, University College London (University of London), 2009. http://discovery.ucl.ac.uk/18749/.
Full textSilvaroli, Antonio. "Design and Analysis of Erasure Correcting Codes in Blockchain Data Availability Problems." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021.
Find full textWu, Chentao. "Improve the Performance and Scalability of RAID-6 Systems Using Erasure Codes." VCU Scholars Compass, 2012. http://scholarscompass.vcu.edu/etd/2894.
Full textVishwanathan, Roopa. "Power-benefit analysis of erasure encoding with redundant routing in sensor networks." Thesis, University of North Texas, 2006. https://digital.library.unt.edu/ark:/67531/metadc5426/.
Full textLiu, Chengjian. "ESetStore: an erasure-coding based distributed storage system with fast data recovery." HKBU Institutional Repository, 2018. https://repository.hkbu.edu.hk/etd_oa/507.
Full textHubbertz, Andrew Paul. "Subject clitics and subject extraction in Somali." Thesis, McGill University, 1991. http://catalog.hathitrust.org/api/volumes/oclc/32079883.html.
Full textLaskey, Patrick Joshua. "A Poetics of Translation Transduction| Lifting the Erasure on What Always-already Was." Thesis, The American University of Paris (France), 2019. http://pqdtopen.proquest.com/#viewpdf?dispub=13871587.
Full textDorman, Andrew. "Cosmetic Japaneseness : cultural erasure and cultural performance in Japanese film exports (2000-2010)." Thesis, University of St Andrews, 2014. http://hdl.handle.net/10023/6354.
Full textKim, Brian Y. "Superficial Seoul: Cultivating the Episodic, Exotic, & Erotic in a Culture of Erasure." University of Cincinnati / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1470043571.
Full text