A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Filters
What can coding theory do for storage systems?
2013
ACM SIGACT News
Preserved Fulltext
Optimal update-complexity MDS array codes The prospects of deploying in storage systems array codes that have both optimal redundancy (MDS) and optimal update complexity have motivated significant coding-theory ...
One of these constructions is the Zigzag code [25] , which simultaneously achieves the MDS property, optimal update complexity, and optimal rebuilding. ...
doi:10.1145/2447712.2447734
fatcat:vqggf6c3gzhiript23pizutsmy
Distributed computing column 49
2013
ACM SIGACT News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Optimal update-complexity MDS array codes The prospects of deploying in storage systems array codes that have both optimal redundancy (MDS) and optimal update complexity have motivated significant coding-theory ...
One of these constructions is the Zigzag code [25] , which simultaneously achieves the MDS property, optimal update complexity, and optimal rebuilding. ...
doi:10.1145/2447712.2447733
fatcat:fzgejp4kkrhulhbf4osyq47zba
Applied Erasure Coding in Networks and Distributed Storage
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Methods from both coding and information theory have been applied to network coding, Optical Packet Switching (OPS) networks and distributed storage systems. ...
The demand for new ultra-fast and highly reliable coding techniques for data at rest and for data in transit is a major research challenge. ...
of parameters. • A code construction optimized for repair locality and update complexity by relaxing the MDS requirement. ...
arXiv:1803.01358v1
fatcat:ooellwzlkzekxdhm75snjpeggu
OpenEC: Toward Unified and Configurable Erasure Coding Management in Distributed Storage Systems
2019
USENIX Conference on File and Storage Technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Experiments on a local cluster and Amazon EC2 show that OpenEC preserves both the operational performance and the properties of erasure coding solutions; OpenEC can also automatically optimize erasure ...
coding operations to improve repair performance. ...
Runhui Li is now with Sangfor Technologies and is the corresponding author. ...
dblp:conf/fast/LiLLH19
fatcat:pcf46ibkkrb7njqb2ej4xxu4am
Interaction between Record Matching and Data Repairing
2014
Journal of Data and Information Quality
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Nevertheless, we propose efficient algorithms to clean data via both matching and repairing. ...
We give a full treatment of fundamental problems associated with data cleaning via matching and repairing, including the static analyses of constraints and rules taken together, and the complexity, termination ...
Li is supported in part by NGFR 973 grant 2006CB303000 and NSFC grant 60533110. Shuai is supported in part by NGFR 973 grant 2011CB302602 and NSFC grants 90818028 and 60903149.
References ...
doi:10.1145/2567657
dblp:journals/jdiq/FanM0Y14
fatcat:edr2al7uavfrjf6ebqkwagh24u
Erasure Coding for Distributed Storage: An Overview
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Efficient repair calls for erasure codes that in the face of node failure, are efficient in terms of minimizing the amount of repair data transferred over the network, the amount of data accessed at a ...
repair the ubiquitous Reed-Solomon code. ...
desirable properties such as optimal access and optimal update. ...
arXiv:1806.04437v1
fatcat:6ivmg6n44jhtjal26btpwjbkpy
Coding Theory for Inference, Learning and Optimization (Dagstuhl Seminar 18112)
2018
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This report documents the program and the outcomes of Dagstuhl Seminar 18112, "Coding Theory for Inference, Learning and Optimization." ...
encountered in these settings in terms of thresholds in channel coding theory. ...
tolerance, optimal updates). ...
doi:10.4230/dagrep.8.3.60
dblp:journals/dagstuhl-reports/LohMPU18
fatcat:j6hzkkbykjaqvl47k24orl5rlu
Enhancing Automated Program Repair through Fine-tuning and Prompt Engineering
[article]
2023
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
Other Versions
However, the practical application of using LLMs in the context of automated program repair is still a long way off based on our manual analysis of the generated repaired codes by the learning models. ...
models fine-tuned with datasets containing both code review and subsequent code changes notably outperformed each of the previous models. ...
The structure of this few-shot prompt is given in Listing 2. 4) Repaired Code Generation: Both GPT-3.5-Turbo and Code-DaVinci-Edit-001 models are available via the OpenAI API. ...
arXiv:2304.07840v2
fatcat:6f6s4glawzhlpocok57ang4ilm
Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second ...
The concatenated coding scheme brings together a maximum rank distance (MRD) code as an outer code and either a globally regenerating or a locally repairable code as an inner code. ...
(Zigzag code [6] ). This class of optimal repair MDS array codes [6] is based on generalized permutation matrices. ...
arXiv:1312.3194v1
fatcat:bkjttlxrtvcx7msin5z4svhkne
Interaction between record matching and data repairing
2011
Proceedings of the 2011 international conference on Management of data - SIGMOD '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Nevertheless, we propose efficient algorithms to clean data via both matching and repairing. ...
This paper studies a new problem in connection with data cleaning, namely, the interaction between record matching and data repairing. ...
(i) While [Fan et al. 2010 ] aims to fix a single tuple via matching with editing rules (derived from MDs), we repair a database via both matching (MDs) and repairing (CFDs), a task far more challenging ...
doi:10.1145/1989323.1989373
dblp:conf/sigmod/FanLMTY11
fatcat:4hdaewhxqzf5di2vqz2hghtykm
Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Third, we present a new construction for MDS convertible codes which matches the proposed lower bound and is thus bandwidth-optimal during conversion. ...
In this paper, we initiate the study on the fundamental limits on bandwidth used during code conversion and present constructions for bandwidth-optimal convertible codes. ...
In Section V, we propose an explicit construction for bandwidth-optimal MDS convertible codes in the merge regime, including the transformation to make the construction simultaneously bandwidth-optimal ...
arXiv:2008.12707v1
fatcat:xdpkpjagpvezrocwmtdxa3xc4m
BMCloud: Minimizing Repair Bandwidth and Maintenance Cost in Cloud Storage
2013
Mathematical Problems in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The system employs both functional repair and exact repair while it inherits advantages from the both. ...
Compared with existing solutions, BMCloud can be used in engineering to save repair bandwidth and degrade maintenance significantly. ...
While in MBR codes, because we are concerned with the minimum bandwidth, MDS codes and non-MDS codes can be used. After Rashmi et al. ...
doi:10.1155/2013/756185
fatcat:6nsyk23645hrpnnydueb7q7tg4
Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This thesis makes several significant contributions to the theory of both Regenerating (RG) and Locally Recoverable (LR) codes. ...
level (length of a vector code symbol) of a sub-class of RG codes called optimal-access RG codes. ...
of failed node and optimal update (optimal update is not defined here. ...
arXiv:1806.04474v1
fatcat:3bcnr3gtyvcpfaehltlsi5nf5u
Dependencies revisited for improving data quality
2008
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This allows us to study the interaction between matching and cleaning rules in a uniform framework, and automatically deduce new matching rules via implication analysis of the dependencies. ...
The increasing demand for data quality technology has also motivated revisions of classical dependencies, to capture more inconsistencies in real-life data, and to match, repair and query the inconsistent ...
The work is supported in part by EPSRC GR/S63205/01, GR/T27433/01 and EP/E029213/1.
References ...
doi:10.1145/1376916.1376940
dblp:conf/pods/Fan08
fatcat:uyfve5cp4vfwfph3i7mfrus3yq
Integrative Modeling of Macromolecular Assemblies from Low to Near-Atomic Resolution
2015
Computational and Structural Biotechnology Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present concise descriptions of the two methods and their most popular alternatives, along with select illustrative applications to protein/nucleic acid assemblies involved in DNA replication and repair ...
While conventional high-resolution techniques in structural biology are challenged by the size and flexibility of many biological assemblies, recent advances in low-resolution techniques such as cryo-electron ...
.), the Molecular Basis Diseases fellowship at Georgia State University to (X.X) and the APHL/CDC Bioinformatics for Public Health postdoctoral fellowship to (X.X). ...
doi:10.1016/j.csbj.2015.08.005
pmid:26557958
pmcid:PMC4588362
fatcat:7wxo75j2vvhwtg3jwbf7mhevsy
« Previous
Showing results 1 — 15 out of 4,777 results