Готові списки джерел за темами / Coded data storage

Добірка наукової літератури з теми "Coded data storage"

Автор: Grafiati

Опубліковано: 12 березня 2024

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Coded data storage".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Coded data storage":

Oggier, Frédérique, and Anwitaman Datta. "On Grid Quorums for Erasure Coded Data." Entropy 23, no. 2 (January 30, 2021): 177. http://dx.doi.org/10.3390/e23020177.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

We consider the problem of designing grid quorum systems for maximum distance separable (MDS) erasure code based distributed storage systems. Quorums are used as a mechanism to maintain consistency in replication based storage systems, for which grid quorums have been shown to produce optimal load characteristics. This motivates the study of grid quorums in the context of erasure code based distributed storage systems. We show how grid quorums can be built for erasure coded data, investigate the load characteristics of these quorum systems, and demonstrate how sequential consistency is achieved even in the presence of storage node failures.

Ojima, Masahiro, Atsushi Saito, Toshimitsu Kaku, Masaru Ito, Yoshito Tsunoda, Shinji Takayama, and Yutaka Sugita. "Compact magnetooptical disk for coded data storage." Applied Optics 25, no. 4 (February 15, 1986): 483. http://dx.doi.org/10.1364/ao.25.000483.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ditlbacher, H., J. R. Krenn, B. Lamprecht, A. Leitner, and F. R. Aussenegg. "Spectrally coded optical data storage by metal nanoparticles." Optics Letters 25, no. 8 (April 15, 2000): 563. http://dx.doi.org/10.1364/ol.25.000563.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ditlbacher, Harald, Joachim Rudolf Krenn, Bernhard Lamprecht, Alfred Leitner, and Franz Rembert Aussenegg. "Metal Nanoparticles for Spectrally Coded Optical Data Storage." Optics and Photonics News 11, no. 12 (December 1, 2000): 43. http://dx.doi.org/10.1364/opn.11.12.000043.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ojima, M., Y. Tsunoda, T. Maeda, T. Kaku, A. Saito, S. Takayama, and Y. Sugita. "Compact Magneto-Optical Disk for Coded Data Storage." IEEE Translation Journal on Magnetics in Japan 1, no. 6 (September 1985): 698–99. http://dx.doi.org/10.1109/tjmj.1985.4548917.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Liu, Chengjian, Qiang Wang, Xiaowen Chu, Yiu-Wing Leung, and Hai Liu. "ESetStore: An Erasure-Coded Storage System With Fast Data Recovery." IEEE Transactions on Parallel and Distributed Systems 31, no. 9 (September 1, 2020): 2001–16. http://dx.doi.org/10.1109/tpds.2020.2983411.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Huang, Jianzhong, Panping Zhou, Xiao Qin, Yanqun Wang, and Changsheng Xie. "Optimizing Erasure-Coded Data Archival for Replica-Based Storage Clusters." Computer Journal 62, no. 2 (August 3, 2018): 247–62. http://dx.doi.org/10.1093/comjnl/bxy079.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Xiang, Yu, Tian Lan, Vaneet Aggarwal, and Yih-Farn R. Chen. "Joint Latency and Cost Optimization for Erasure-Coded Data Center Storage." IEEE/ACM Transactions on Networking 24, no. 4 (August 2016): 2443–57. http://dx.doi.org/10.1109/tnet.2015.2466453.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Tajeddine, Razane, Oliver W. Gnilke, and Salim El Rouayheb. "Private Information Retrieval From MDS Coded Data in Distributed Storage Systems." IEEE Transactions on Information Theory 64, no. 11 (November 2018): 7081–93. http://dx.doi.org/10.1109/tit.2018.2815607.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Xu, Liangliang, Min Lyu, Zhipeng Li, Yongkun Li, and Yinlong Xu. "Deterministic Data Distribution for Efficient Recovery in Erasure-Coded Storage Systems." IEEE Transactions on Parallel and Distributed Systems 31, no. 10 (October 1, 2020): 2248–62. http://dx.doi.org/10.1109/tpds.2020.2987837.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Coded data storage":

Licona-Nunez, Jorge Estuardo. "M-ary Runlength Limited Coding and Signal Processing for Optical Data Storage." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/5195.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Recent attempts to increase the capacity of the compact disc (CD) and digital versatile disc (DVD) have explored the use of multilevel recording instead of binary recording. Systems that achieve an increase in capacity of about three times that of conventional CD have been proposed for production. Marks in these systems are multilevel and fixed-length as opposed to binary and variable length in CD and DVD. The main objective of this work is to evaluate the performance of multilevel ($M$-ary) runlength-limited (RLL) coded sequences in optical data storage. First, the waterfilling capacity of a multilevel optical recording channel ($M$-ary ORC) is derived and evaluated. This provides insight into the achievable user bit densities, as well as a theoretical limit against which simulated systems can be compared. Then, we evaluate the performance of RLL codes on the $M$-ary ORC. A new channel model that includes the runlength constraint in the transmitted signal is used. We compare the performance of specific RLL codes, namely $M$-ary permutation codes, to that of real systems using multilevel fixed-length marks for recording and the theoretical limits. The Viterbi detector is used to estimate the original recorded symbols from the readout signal. Then, error correction is used to reduce the symbol error probability. We use a combined ECC/RLL code for phrase encoding. We evaluate the use of trellis coded modulation (TCM) for amplitude encoding. The detection of the readout signal is also studied. A post-processing algorithm for the Viterbi detector is introduced, which ensures that the detected word satisfies the code constraints. Specifying the codes and detector for the $M$-ary ORC gives a complete system whose performance can be compared to that of the recently developed systems found in the literature and the theoretical limits calculated in this research.

Bothin, Anton. "A Model for Company Document Digitization (CODED) : Proposal for a Process Model for Digitizing Company Documents." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-292785.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

There exists many companies which wish to transition toward a more digital workflow. However, many of these companies lack the technical expertise required to undertake such an endeavor. To assist companies in this area, a digitization process model could be used as a stepping-stone toward successful digitization. Currently, however, there exists no such digitization process model. The purpose of this thesis is to suggest such a digitization process model. The goal is to help companies in digitizing their documents and their workflow. The research question used to reach this goal pertains to how a digitization process model should be structured. Due to the lack of currently existing digitization process models, different process models within the field of software engineering where analyzed as a basis. The research was qualitative and explorative in its nature, and it followed design science as its research paradigm. An extensive literature study was conducted before development of the model began. The model was evaluated using interviews together with action research. These interviews focused on evaluating the model based on five criteria which had been defined: (1) interviewee credibility, (2) semantic correctness, (3) syntactic correctness, (4) usefulness, and (5) process flexibility. The results of this thesis is the company document digitization process model (CODED), which, as the name suggests, is a proposed process model for document digitization. This model has been based on information gathered by, partly the literature study, and partly the interviews. The literature study proved the model to be unique, since no similar model existed prior to this thesis. While the interviews proved the model to be valid, since it accomplished all evaluation criteria which had been defined.
Det är många företag som vill gå mot att digitalisera sitt arbetsflöde. Många av dessa företag har däremot en avsaknad av den tekniska expertis som krävs. För att assistera företag i detta skulle en processmodell kunna användas som ett redskap för framgångsrik dokumentdigitalisering. Problemet är att det just nu inte existerar någon sådan processmodell för dokumentdigitalisering. Syftet med denna avhandling är att föreslå en processmodell för digitalisering. Målet är att hjälpa företag i att digitalisera både deras dokument och deras arbetsflöde. Hur en sådan processmodell skulle kunna struktureras är denna rapports forskningsfråga. Det fanns ingen existerande modell att utgå ifrån. Därför användes andra modeller inom området för programvaruteknik som en bas under forskningen. Forskningen var kvantitative och explorativ, och den använde designvetenskap som ett forskningsparadigm. En omfattande litteraturstudie genomfördes innan utvecklingen av processmodellen påbörjades. Modellen evaluerades utifrån intervjuer tillsammans med aktionsforskning. Där intervjuerna har fokuserat på att evaluera modellen utifrån fem kriterier: (1) trovärdighet, (2) semantisk korrekthet, (3) syntaktisk korrekthet, (4) användbarhet, och (5) flexibilitet. Resultatet av denna avhandling är ett förslag till en processmodell för att digitalisera dokument, vid namnet CODED (company document digitization process model). Den föreslagna modellen har baserat både på information som samlats från litteraturstudien, och information från intervjuerna. Litteraturstudien visade att processmodellen är unik, då det ej existerade någon likartad modell tidigare. Intervjuerna visade att modellen är valid, då den uppfyllde de definierade evalueringskriterierna.

Ali, Muhammad. "Stockage de données codées et allocation de tâches pour les centres de données à faible consommation d'énergie." Electronic Thesis or Diss., CY Cergy Paris Université, 2023. http://www.theses.fr/2023CYUN1243.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Les centres de données sont responsables d'une part importante de la consommation mondiale d'énergie. Cette consommation devrait augmenter dans les années à venir, en raison de la demande croissante de services pour les centres de données. Par conséquent, le besoin d'opérations de centres de données efficaces sur le plan énergétique et à faible émission de carbone augmente rapidement.Cette recherche se concentre sur la conception et la mise en œuvre d'un centre de données à faible émission de carbone et à haut rendement énergétique, alimenté par l'énergie solaire et l'hydrogène, ce qui lui confère une indépendance par rapport au réseau électrique. En conséquence, le centre de données est limité par la limite supérieure de la consommation d'énergie, qui est de 10KWh. La contrainte d'utilisation maximale de l'énergie impose plusieurs défis à la conception, à l'utilisation de l'énergie et à la durabilité du centre de données.Ce travail contribue tout d'abord à la conception d'un centre de données à faible consommation d'énergie tout en respectant la contrainte énergétique globale. Nous avons essayé d'économiser l'énergie du centre de données par un choix judicieux du matériel tout en conservant les performances du centre de données. La deuxième contribution de notre travail fournit des protocoles précieux tels que la réparation paresseuse dans le stockage distribué des données, le placement des tâches et les techniques de gestion de l'énergie pour réduire davantage la consommation d'énergie du centre de données. Grâce aux efforts combinés du bon choix de matériel, de protocoles et de techniques, nous avons réduit de manière significative la consommation d'énergie globale du centre de données
Data centers are responsible for a significant portion of global energy consumption. This consumption is expected to grow in the coming years, driven by the increasing demand for data center services. Therefore, the need for energy-efficient, low-carbon data center operations is growing rapidly.This research focuses on designing and implementing a low-carbon, energy-efficient data center powered by solar and hydrogen, granting it independence from the power grid. As a result, the data center is limited by the upper bound on the energy consumption, which is 10KWh. The maximum usage of energy-constraint imposes several challenges to the design, energy usage, and sustainability of the data center.The work first contributes to designing a low-power budget data center while respecting the overall energy constraint. We tried to save the energy usage of the data center through the right choice of hardware while keeping the performance of the data center intact. The second contribution of our work provides valuable protocols like lazy repair in distributed data storage, job placement, and power management techniques to further reduce the data center's energy usage. With the combined efforts of the right choice of hardware, protocols, and techniques, we significantly reduced the overall energy consumption of the data center

Argon, Cenk. "Turbo product codes for optical communications and data storage." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/15350.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Yang, Sizhen Michael. "Construction of low-density parity-check codes for data storage and transmission." Diss., The University of Arizona, 2004. http://hdl.handle.net/10150/280665.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This dissertation presents a new class of irregular low-density parity-check (LDPC) codes of moderate length and high rate. The codes in this class admit low-complexity encoding and have lower error rate floors than other irregular LDPC code design approaches. It is also shown that this class of LDPC codes is equivalent to a class of systematic serial turbo codes and is an extension of irregular repeat-accumulate codes. A code design algorithm based on the combination of density evolution and differential evolution optimization with a modified cost function is presented. Moderate-length, high-rate codes with no error-rate floors down to a bit error-rate of 10-9 are presented. Although our focus is on moderate-length, high-rate codes, the proposed coding scheme is applicable to irregular LDPC codes with other lengths and rates. Applications of these codes to magnetic data storage and wireless transmission channels are then studied. In the case of data storage, we assume an EPR4 partial response model with noise bursts which models media defects and thermal asperities. We show the utility of sending burst noise channel state information to both the partial response detector and the decoder. Doing so eliminates the error rate curve flattening seen by other researchers. The simulation results presented have demonstrated that LDPC codes are very effective against noise bursts and, in fact, are superior to Reed-Solomon codes in the regime simulated. We also have presented an algorithm for finding the maximum resolvable erasure-burst length, Lmax, for a given LDPC code. The simulation results make the possibility of an error control system based solely on an LDPC code very promising. For the wireless communication channel, we assume two types of Gilbert-Elliott channels and design LDPC codes for such channels. Under certain assumptions, this model leads us to what we call the burst-erasure channel with AWGN (BuEC-G), in which bits are received in Gaussian noise or as part of an erasure burst. To design codes for this channel, we take a "shortcut" and instead design codes for the burst-erasure channel (BuEC) in which a bit is received correctly or it is received as an erasure, with erasures occurring in bursts. We show that optimal BuEC code ensembles are equal to optimal binary erasure channel (BEC) code ensembles and we design optimal codes for these channels. The burst-erasure efficacy can also be measured by the maximum resolvable erasure-burst length Lmax. Finally, we present error-rate results which demonstrate the superiority of the designed codes on the BuEC-G over other codes that appear in the literature.

Takashima, Yuzuru, Guanghao Chen, and Bo E. Miller. "Eigenmode multiplexing with SLM for volume holographic data storage." SPIE-INT SOC OPTICAL ENGINEERING, 2017. http://hdl.handle.net/10150/626290.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The cavity supports the orthogonal reference beam families as its eigenmodes while enhancing the reference beam power. Such orthogonal eigenmodes are used as additional degree of freedom to multiplex data pages, consequently increase storage densities for volume Holographic Data Storage Systems (HDSS) when the maximum number of multiplexed data page is limited by geometrical factor. Image bearing holograms are multiplexed by orthogonal phase code multiplexing via Hermite- Gaussian eigenmodes in a Fe: LiNbO3 medium with a 532 nm laser at multiple Bragg angles by using Liquid Crystal on Silicon (LCOS) spatial light modulators (SLMs) in reference arms. Total of nine holograms are recorded with three angular and three eigenmode.

Chang, 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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In the last decade, cloud storage systems has experienced a rapid growth to account for an important part of cloud-based services. Among them, OpenStack Swift is a open source software to implement an object storage system. Meanwhile, storage providers are making great effort to ensure the quality of their services. One of the key factors of storage systems is the data durability. Fault tolerance mechanisms play an important role in ensuring the data availability. Existing approaches like replication and RAID are used to protect data from lost, while with their own drawbacks. Erasure coding comes as a novel concept applied in the storage systems for the concern of data availability. Studies showed that it is able to provide fault tolerance with redundancies while reducing the capacity overhead, offering a tradeoff between performanc eand cost. This project did an in-depth investigation on the OpenStack Swift and the erasure coding approach. Analysis on erasure coded and replication systems are performed to compare the features of both approaches. A prototype of custom erasure code is implemented as an extension to Swift, offering data storage with promising reliability and performance.
Molnlagring 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.

Gastón, Brasó Bernat. "Coding techniques for distributed storage." Doctoral thesis, Universitat Autònoma de Barcelona, 2013. http://hdl.handle.net/10803/129277.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Encara que l'emmagatzematge online d'informació és un negoci creixent, no està exempt de problemàtiques, una d'elles és la persistència i accessibilitat de les dades. Cal replicar les dades de manera que si es perd una còpia no es perdi la informació de forma definitiva. Malauradament, la replicació de dades (coneguda com a ``backup'') no és una solució eficient, ja que introdueix molta redundància que provoca sobre costos. Els codis correctors d'errors són coneguts per augmentar la persistència i l'accessibilitat de les dades minimitzant la redundància necessària. Però el seu us introdueix altres problemes com l'anomenat ``repair problem'': com substituir un node d'emmagatzematge descarregant el mínim de dades dels altres nodes. En aquesta dissertació, estudiem l'estat de l'art pel que fa als codis aplicats a sistemes d'emmagatzematge distribuïts, com per exemple el ``cloud storage''. També ens introduïm al ``repair problem'' des de la vessant més aplicada, usant topologies de sistemes reals com els ``data centers''. Concretament, aportem una família de codis regeneratius que anomenem quasi-cyclic flexible regenerating codes i que es caracteritza per minimitzar l'ús de recursos computacionals en el procés de regeneració d'un node. Alhora, aquesta solució minimitza les dades emmagatzemades i l'ample de banda necessari per regenerar un node que falla. També estudiem el cas en que els costos de descàrrega de les dades no són homogenis. En concret, ens centrem en el cas dels racks, on els nodes d'emmagatzematge estan distribuïts en racks, i el cost de descàrrega de dades dels nodes en el mateix rack és molt menor que el cost de descàrrega de dades dels nodes en un altre rack. Aquest nou model generalitza els models teòrics anteriors i ens permet comprovar que els costos poden disminuir si adaptem el model teòric a la topologia concreta del sistema d'emmagatzematge distribuït.
Online data storage is often regarded as a growing business, yet many unresolved issues linger in this specific field and prevent researchers from driving it to full capacity. Data replication (most commonly known as backup) is simply not efficient when improving persistence and accessibility of such data. Error correcting codes are known for their efficiency when adding redundancy to avoid lose of information. Unfortunately, the use of error correcting codes entail additional problems such as the repair problem: how do we replace a storage node downloading as less data as possible from other nodes. In this dissertation, we deepen on state-of-the-art of codes applied to distributed storage systems. Additionally, a family of regenerative codes which we call quasi-cyclic flexible regenerating codes is provided. Quasi-cyclic flexible minimum storage regenerating (QCFMSR) codes are constructed and their existence is well-proven. Quasi-cyclic flexible regenerating codes with minimum bandwidth constructed from a base QCFMSR code are also provided. Quasi-cyclic flexible regenerating codes are very interesting because of their simplicity and low complexity. They allow exact repair-by-transfer in the minimum bandwidth case and an exact pseudo repair-by-transfer in the MSR case, where operations are needed only when a new node enters into the system replacing a lost one. Finally, we propose a new model whereby storage nodes are placed in two racks. This unprecedented two-rack model is generalized to any number of racks. In this specific set-up, storage nodes have different repair costs depending on the rack where they are placed. A threshold function, which minimizes the amount of stored data per node and bandwidth needed to regenerate a failed node, is also shown. This latter threshold function generalizes those given by previous distributed storage models. Tradeoff curves obtained from this threshold function are compared with those obtained from previous models, and it is shown that this new model outperforms previous ones in terms of repair cost.

Harvey, Brett D. "A code of practice for practitioners in private healthcare: a privacy perspective." Thesis, Nelson Mandela Metropolitan University, 2007. http://hdl.handle.net/10948/521.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Whereas there are various initiatives to standardize the storage, processing and use of electronic patient information in the South African health sector, the sector is fragmented through the adoption of various approaches on national, provincial and district levels. Divergent IT systems are used in the public and private health sectors (“Recommendations of the Committee on …” 2003). Furthermore, general practitioners in some parts of the country still use paper as a primary means of documentation and storage. Nonetheless, the use of computerized systems is increasing, even in the most remote rural areas. This leads to the exposure of patient information to various threats that are perpetuated through the use of information technology. Irrespective of the level of technology adoption by practitioners in private healthcare practice, the security and privacy of patient information remains of critical importance. The disclosure of patient information whether intentional or not, can have dire consequences for a patient. In general, the requirements pertaining to the privacy of patient information are controlled and enforced through the adoption of legislation by the governing body of a country. Compared with developed nations, South Africa has limited legislation to help enforce privacy in the health sector. Conversely, Australia, New Zealand and Canada have some of the most advanced legislative frameworks when it comes to the privacy of patient information. In this dissertation, the Australian, New Zealand, Canadian and South African health sectors and the legislation they have in place to ensure the privacy of health information, will be investigated. Additionally, codes of practice and guidelines on privacy of patient information for GPs, in the afore-mentioned countries, will be investigated to form an idea as to what is needed in creating and formulating a new code of practice for the South African GP, as well as a pragmatic tool (checklist) to check adherence to privacy requirements.

Jafarizadeh, Saber. "Distributed coding and algorithm optimization for large-scale networked systems." Thesis, The University of Sydney, 2014. http://hdl.handle.net/2123/13238.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In this thesis design and optimization of several distributed algorithms in large-scale networked systems is studied. The studied algorithms operate on networks of autonomous agents in general including the sensor networks and the ad hoc networks. The main focus here is on distributed algorithms operating on large-scale networks. This is due to their robustness to node failure and ability to extend according to the size and topology of the system. Regarding the optimization of the studied algorithms, it is aimed to increase their convergence rate to their equilibrium state considering the constraints of the system including the available bandwidth, memory and power for each agent. The first topic addresses the optimization of two algorithms; namely the distributed random gossip algorithm and the distributed average consensus algorithm. The underlying graph of the network is exploited to provide an analytical solution to the semidefinite programming formulation of the problems. In the second topic, two distributed algorithms are proposed for increasing data persistency in wireless sensor networks based on LT and Raptor codes. In the proposed algorithms, the sensed data is disseminated using random walks with the non-uniform stationary distribution. A new distributed method is proposed for assigning the transition probabilities of the random walks. The third topic studies distributed coding of LT codes in Y networks where multiple sources communicate with the same destination through a common relay node. The Adaptive Distributed LT coding algorithm is proposed that combines the LT codes with the network coding technique. The fourth topic addresses optimization of the LT codes for short message lengths. Unlike previous formulations, the provided novel semidefinite programming formulation has finite number of constraints while it is free of approximation.

Більше джерел

Книги з теми "Coded data storage":

Institute, American National Standards. American national standard for information sciences: Extended latin alphabet coded character set for bibliographic use. New York, N.Y. (1430 Broadway, New York 10018): ANSI, 1985.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Immink, Kees A. Schouhamer. Codes for mass data storage systems. 2nd ed. The Netherlands: Shannon Foundation Publishers, 2004.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kurtas, Erozan. Advanced error control techniques for data storage systems. Boca Raton, FL: Taylor & Francis, 2005.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Massey, David E. Pulse code modulation (PCM) data storage and analysis using a microcomputer. Wallops Island, Va: Goddard Space Flight Center, 1986.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

H, Deng Robert, Illinois Institute of Technology. Dept. of Electrical & Computer Engineering, and United States. National Aeronautics and Space Administration, eds. Error control for reliable digital data transmission and storage systems: Final report. Chicago, IL: Dept. of Electrical & Computer Engineering, Illinois Institute of Technology, 1985.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Carrasco, Rolando Antonio. Non-binary error control coding for wireless communication and data storage. Chichester, West Sussex, U.K: Wiley, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Rogosa, Morrison. Coding microbiological data for computers. New York: Springer-Verlag, 1986.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Texas System of Natural Laboratories. International base line data coding system (IBLDCS): A method for relating and analyzing national resource data. Edited by Travis Nevenna Tsanoff and Margulis Lynn 1938-2011. 2nd ed. Austin, Tex: Texas System of Natural Laboratories, 2004.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Texas System of Natural Laboratories. International base line data coding system: A methodology for interrelating resource data records and developing analyses of resource problems. Edited by Travis Nevenna Tsanoff and Margulis Lynn 1938-2011. 2nd ed. Austin, Tex: Texas System of Natural Laboratories, 2000.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Blackwell, Cassandra D. National Water Data Exchange (NAWDEX): Explanations of codes used in the master water data index. [Reston, Va.?]: U.S. Dept. of the Interior, Geological Survey, 1985.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Coded data storage":

Denz, C., K. O. Müller, F. Visinka, and T. Tschudi. "A Demonstration Platform for Phase-Coded Multiplexing." In Holographic Data Storage, 419–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-540-47864-5_28.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Xiao, Yifei, Shijie Zhou, Linpeng Zhong, and Zhao Zhang. "Sector Error-Oriented Durability-Aware Fast Repair in Erasure-Coded Cloud Storage Systems." In Data Mining and Big Data, 445–59. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-7502-7_41.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Huang, Qiang, Hui Chen, Bing Wei, Jigang Wu, and Limin Xiao. "Data Delta Based Hybrid Writes for Erasure-Coded Storage Systems." In Lecture Notes in Computer Science, 171–82. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-93571-9_14.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Venkatesan, Vinodh, and Ilias Iliadis. "Effect of Codeword Placement on the Reliability of Erasure Coded Data Storage Systems." In Quantitative Evaluation of Systems, 241–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40196-1_20.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ling, Zhang, Kuang Ji-shun, and You zhi-qiang. "Test Data Compression Using Four-Coded and Sparse Storage for Testing Embedded Core." In Algorithms and Architectures for Parallel Processing, 434–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13136-3_44.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wei, Bing, Jigang Wu, Xiaosong Su, Qiang Huang, and Yujun Liu. "Adaptive Updates for Erasure-Coded Storage Systems Based on Data Delta and Logging." In Parallel and Distributed Computing, Applications and Technologies, 187–97. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96772-7_18.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Deng, Mingzhu, Ming Zhao, Fang Liu, Zhiguang Chen, and Nong Xiao. "DA Placement: A Dual-Aware Data Placement in a Deduplicated and Erasure-Coded Storage System." In Algorithms and Architectures for Parallel Processing, 358–77. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-05051-1_25.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Marcus, B. "Modulation Codes for Holographic Recording." In Holographic Data Storage, 283–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-540-47864-5_17.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Jaminet, Jean, Gabriel Esquivel, and Shane Bugni. "Serlio and Artificial Intelligence: Problematizing the Image-to-Object Workflow." In Proceedings of the 2021 DigitalFUTURES, 3–12. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-5983-6_1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

AbstractVirtual design production demands that information be increasingly encoded and decoded with image compression technologies. Since the Renaissance, the discourses of language and drawing and their actuation by the classical disciplinary treatise have been fundamental to the production of knowledge within the building arts. These early forms of data compression provoke reflection on theory and technology as critical counterparts to perception and imagination unique to the discipline of architecture. This research examines the illustrated expositions of Sebastiano Serlio through the lens of artificial intelligence (AI). The mimetic powers of technological data storage and retrieval and Serlio’s coded operations of orthographic projection drawing disclose other aesthetic and formal logics for architecture and its image that exist outside human perception. Examination of aesthetic communication theory provides a conceptual dimension of how architecture and artificial intelligent systems integrate both analog and digital modes of information processing. Tools and methods are reconsidered to propose alternative AI workflows that complicate normative and predictable linear design processes. The operative model presented demonstrates how augmenting and interpreting layered generative adversarial networks drive an integrated parametric process of three-dimensionalization. Concluding remarks contemplate the role of human design agency within these emerging modes of creative digital production.

Pääkkönen, Joonas, Camilla Hollanti, and Olav Tirkkonen. "Device-to-Device Data Storage with Regenerating Codes." In Multiple Access Communications, 57–69. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23440-3_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Coded data storage":

Chandramouli, Athreya, Abhinav Vaishya, and Prasad Krishnan. "Coded Data Rebalancing for Distributed Data Storage Systems with Cyclic Storage." In 2022 IEEE Information Theory Workshop (ITW). IEEE, 2022. http://dx.doi.org/10.1109/itw54588.2022.9965756.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Saito, Atsushi, Takeshi Maeda, Hisataka Sugiyama, and Yoshito Tsunoda. "High Storage Density Optical Disks using Pit Edge Recording on Pb-Te-Se Thin Film." In Optical Data Storage. Washington, D.C.: Optica Publishing Group, 1987. http://dx.doi.org/10.1364/ods.1987.wd2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Optical disk file is suitable for high density recording, read-only and write-once type are on the market. For write-once type optical disk, higher data transfer rate and higher density recording are required for the future development. Present write-once optical disk uses the recording method of making a circular pit corresponding to coded-data ”1”. On the other hand, pit-edge recording, namely, the leading or trailing edge of a pit corresponding to coded-data ”1”, can achieve about twice higher BPI (bit-per-inch) than that of the former method. Up to the present, the ablative recording media have been thought to be difficult to apply this pit-edge recording because of their uncontrollabi1ity of pit shapes. However, this problem can be solved by introducing a new compensation technique during writing and reading the data.

Lee, Ojus Thomas, S. D. Madhu Kumar, and Priya Chandran. "Erasure coded storage systems for cloud storage — challenges and opportunities." In 2016 International Conference on Data Science and Engineering (ICDSE). IEEE, 2016. http://dx.doi.org/10.1109/icdse.2016.7823943.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ojima, Masahiro, Atsushi Saito, Toshimitsu Kaku, Masaru Ito, Yoshito Tsunoda, Shinji Takayama, and Yutaka Sugita. "Magneto-Optical Disk For Coded Data Storage." In 1985 Los Angeles Technical Symposium, edited by Robert A. Sprague. SPIE, 1985. http://dx.doi.org/10.1117/12.946425.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Maeda, Takeshi, Atushi Saitoo, Hisataka Sugiyama, Masahiro Ojima, Shinichi Arai, and Kazuo Shigematu. "High Speed, Large Capacity Optical Disk, Using Pit-edge Recording and MCAV Method." In Optical Data Storage. Washington, D.C.: Optica Publishing Group, 1991. http://dx.doi.org/10.1364/ods.1991.wd1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

A large size optical disk (for example, in 300 mm diameter) has been applied to document files and archived coded data files. Recently, demands for larger capacity and higher speed are growing greatly. Therefore, we developted a write once optical disk (300 mm in diameter), which adopts the pit-edge recording(1)method and the MCAV (modified constant angular velocity) method to achieve high linear density. No optical disk system combining the above two methods has yet been developed. In addition, new techniques must still be developed to satisfy the requirements of large capacity and high speed using these two methods. In this paper, new techniques we have developed are discussed.

Katayama, R., A. Ohba, Y. Komatsu, and Y. Ono. "Compact Optical Head Module Integrated with Chip Elements for Magneto-Optical Disks." In Optical Data Storage. Washington, D.C.: Optica Publishing Group, 1994. http://dx.doi.org/10.1364/ods.1994.wb3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Magneto-optical disk drives have been put to practical use for coded data file and digital video file applications. However, in order that they are more widely used as personal computer peripherals or portable video disk recorders, optical heads need to be more compact. A hybrid chip integration technology for a laser diode, a photodiode, etc. is effective for this purpose1). The application of a polarizing holographic optical element (HOE) also meets this requirement, because it can possess many optical functions, such as polarizing beam splitter and error signal detection2). This paper proposes a newly designed compact optical head module for magneto-optical disks, combining the hybrid chip integration technology and the polarizing HOE. The module size is ϕ10mm × t11mm.

Sheth, Utsav, Sanghamitra Dutta, Malhar Chaudhari, Haewon Jeong, Yaoqing Yang, Jukka Kohonen, Teemu Roos, and Pulkit Grover. "An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation." In 2018 IEEE International Conference on Big Data (Big Data). IEEE, 2018. http://dx.doi.org/10.1109/bigdata.2018.8622429.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Yang, Jame J., and Michael R. Wang. "Novel Coded High Density Optical Disk Data Storage." In Frontiers in Optics. Washington, D.C.: OSA, 2005. http://dx.doi.org/10.1364/fio.2005.ftuy2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Aatish, Chiniah, and Mungur Avinash. "Data Management in Erasure-Coded Distributed Storage Systems." In 2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID). IEEE, 2020. http://dx.doi.org/10.1109/ccgrid49817.2020.00018.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Esmaili, Kyumars Sheykh, Aatish Chiniah, and Anwitaman Datta. "Efficient updates in cross-object erasure-coded storage systems." In 2013 IEEE International Conference on Big Data. IEEE, 2013. http://dx.doi.org/10.1109/bigdata.2013.6691658.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Coded data storage":

Tarko, Andrew P., Jose Thomaz, and Mario Romero. SNIP Light User Manual. Purdue University, 2020. http://dx.doi.org/10.5703/1288284317136.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

A systemic approach to identifying road locations that exhibit safety problems was provided by the Safety Needs Identification Program (SNIP and SNIP2) developed by the Purdue University Center for Road Safety (CRS). The new version SNIP Light has been developed to provide other uses with planning level traffic safety analysis capability for a wider range of uses including Metropolitan Planning Agencies (MPOs) who want the tool for planning cost-effective safety programs in their metropolitan areas. The SNIP Light reduces the demand of computing and data storage resources and replaces the SQL server database system an integrated module coded in-house which is considerably faster than the original component. Furthermore, certain proficiency required to install and use the old version is no longer needed thanks to the intuitive single-window interface and executing file operations in the background without the user’s involvement. Some operations, such as optimizing funding of safety projects, are removed to simplify the tool.

Calijuri, Mónica, and Andrés Muñoz Miranda. CACAO: Accounting and Organizational Data Storage and Consultation System: Open-Source Software for Tax Administrations. Inter-American Development Bank, March 2023. http://dx.doi.org/10.18235/0004758.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

CACAO is a web platform that allows for the receipt, validation, processing, and analysis of accounting data from taxpayers in a standardized manner. Developed in open-source code, the platform's goal is to facilitate the transmission of taxpayer data and optimize the use and analysis of accounting data by tax administrations in Latin America and the Caribbean.

Best, Cody, Carl Hart, and Michael Muhlestein. Data acquisition software for impedance tube measurements. Engineer Research and Development Center (U.S.), October 2022. http://dx.doi.org/10.21079/11681/45740.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Transmission impedance tube measurements are necessary to measure the asymmetric acoustic property known as Willis coupling. However, software is required to measure and store data from an impedance tube for acoustic material characterization. This report details the overall structure of custom-developed software built from low-level functions. Software libraries from the data acquisition system as well as the HDF5 file system are the basis for the code. A command line user interface guides a user through the necessary steps in data collection.

Radulescu, Georgeta, and Peter Stefanovic. Review of Experimental Data for Validating Computer Codes Used in Shielding Calculations for Spent Fuel Storage and Transportation Systems. Office of Scientific and Technical Information (OSTI), September 2022. http://dx.doi.org/10.2172/1894203.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Parks, C. V., B. L. Broadhead, O. W. Hermann, J. S. Tang, S. N. Cramer, J. C. Gauthey, B. L. Kirk, and R. W. Roussin. Assessment of shielding analysis methods, codes, and data for spent fuel transport/storage applications. [Radiation dose rates from shielded spent fuels and high-level radioactive waste]. Office of Scientific and Technical Information (OSTI), July 1988. http://dx.doi.org/10.2172/6783967.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhylenko, Tetyana I. Auto Checker of Higher Mathematics - an element of mobile cloud education. [б. в.], July 2020. http://dx.doi.org/10.31812/123456789/3895.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

We analyzed the main cloud services in the article. We also described the main contribution of mobile cloud technology to education. The article presents the author’s development from the field of mobile cloud education in higher mathematics. The design architecture of this application is described in detail: QR generator and scanner, authorization, sending tasks. Block diagrams and images are presented that clearly demonstrate the operation of the application. We showed an example of solving the integral from the section of integral calculus for higher mathematics and showed how to download the answer in the form of a QR code and find out whether it is correct or incorrect (this can be seen by the color on the smart phone screen). It is shown how this technology helps the teacher save time for checking assignments completed by students. This confirms its effectiveness. Such an application provides students and teachers with the ability to store and process data on a cloud computing platform.

Mehmood, Hamid, Surya Karthik Mukkavilli, Ingmar Weber, Atsushi Koshio, Chinaporn Meechaiya, Thanapon Piman, Kenneth Mubea, Cecilia Tortajada, Kimberly Mahadeo, and Danielle Liao. Strategic Foresight to Applications of Artificial Intelligence to Achieve Water-related Sustainable Development Goals. United Nations University Institute for Water, Environment and Health, April 2020. http://dx.doi.org/10.53328/lotc2968.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The report recommends that: 1) Policymakers should conduct holistic assessments of social, economic, and cultural factors before AI adoption in the water sector, as prospective applications of AI are case- specific. It is also important to conduct baseline studies to measure the implementation capacity, return on investment, and impact of intervention. 2) To ensure positive development outcomes, policies regarding the use of AI for water-related challenges should be coupled with capacity and infrastructure development policies. Capacity development policies need to address the AI and Information and Communications Technology (ICT) needs for the AI-related skill development of all water-related stakeholders. Infrastructure development policies should address the underlying requirements of computation, energy, data generation, and storage. The sequencing of these policies is critical. 3) To mitigate the predicted job displacement that will accompany AI-led innovation in the water sector, policies should direct investments towards enabling a skilled workforce by developing water sector-related education at all levels. This skilled workforce should be strategically placed to offset dependency on the private sector. 4) Water-related challenges are cross-cutting running from grassroots to the global level and require an understanding of the water ecosystem. It is important for countries connected by major rivers and watersheds to collaborate in developing policies that advance the use of AI to address common water-related challenges. 5) A council or agency with representation from all stakeholders should be constituted at the national level, to allow for the successful adoption of AI by water agencies. This council or agency should be tasked with the development of policies, guidelines, and codes of conduct for the adoption of AI in the water-sector. These key policy recommendations can be used as primary guidelines for the development of strategies and plans to use AI to help achieve water-related SDGs.