Existing Repair Techniques Research Articles

Hyperbaric oxygen treatment promotes tendon-bone interface healing in a rabbit model of rotator cuff tears.

Due to the high-intensity pressure that the shoulder cuff endures, it is prone to traumas and tears. The main critical function of the shoulder cuff muscles is to effectively facilitate shoulder movement and securely maintain the humeral head in the precise center of the joint cavity to prevent superior migration during abduction processes. Shoulder cuff injuries typically involve the muscle-tendon-bone interface, but existing repair techniques do not always guarantee complete and secure healing, leading to retears. Hyperbaric oxygen therapy, as an auxiliary treatment, can significantly promote the muscle-tendon-bone healing process. To explore the impact of hyperbaric oxygen therapy on the bone-tendon interface healing process in a rabbit model specifically designed for shoulder cuff tears, an experiment was conducted on New Zealand white rabbits by performing a full-thickness tear of the supraspinatus tendon in the left shoulder, followed by 2 hours per day of 100% oxygen treatment at 2 absolute atmospheres for 5 days. The results indicate that hyperbaric oxygen therapy significantly enhances vascularization at the interface between the shoulder cuff and tendon-bone, promotes collagen fiber regeneration in the tendon, improves the tensile strength of the tendon-bone complex, and does not have a significant effect on biomechanical stability. This suggests that hyperbaric oxygen therapy has a significant positive impact on the histological and biomechanical healing of shoulder cuff tears in rabbits, expediting the healing process of the tendon-bone interface.

The Use of Cranial Aneurysm Clips for Repair of Incidental Lumbar Durotomy: Operative Technique and Case Series

BackgroundIncidental durotomy is a common complication of posterior lumbar spine surgery, however effective and durable methods for primary repair remain elusive. Multiple existing techniques have previously been reported and extensively described including sutured repair and non-penetrating titanium clips. The use of cranial aneurysm clips for primary repair of lumbar durotomy serves as a safe and effective alternative to obtain watertight closure of a dural tear. MethodsWe performed a retrospective review of patients at a single institution who underwent primary repair of an incidental lumbar durotomy with use of an aneurysm clip during open posterior lumbar surgery between 2012 and 2023. Patient demographics, operative details, and postoperative metrics were collected and examined to evaluate the safety and efficacy of the novel technique. ResultsA total of 51 patients were included for analysis. Four patients underwent durotomy repair with aneurysm clip alone, 27 patients were repaired with aneurysm clip and fibrin glue, and 20 patients had repair with aneurysm clip, fibrin glue, and a collagen dural substitute. Three (5.9%) patients reported headaches, 2 (3.9%) with psuedomeningocele, and 1 (2%) with wound leakage. Two (3.9%) patients had treatment failure with return to OR for repair of CSF leak. ConclusionWe report the largest series of patients undergoing primary repair of incidental durotomy with the use of an aneurysm clip. Utilization of an aneurysm clip is noted to be a safe, quick and effective method of primary repair when compared to existing repair techniques such as sutured repair or non-penetrating titanium clips.

Boosting Erasure-Coded Multi-Stripe Repair in Rack Architecture and Heterogeneous Clusters: Design and Analysis

Large-scale distributed storage systems have introduced erasure codes to guarantee high data reliability, yet inevitably at the expense of high repair costs. In practice, storage nodes are usually divided into different racks, and data blocks in storage nodes are often organized into multiple stripes independently manipulated by erasure code. Due to the scarcity and heterogeneity of the cross-rack bandwidth, the cross-rack network transmission dominates the entire repair costs. We argue that when erasure code is deployed in a rack architecture, existing repair techniques are limited in different aspects: neglecting the heterogeneous cross-rack bandwidth, less consideration for multi-stripe failure, and no special treatment on repair link scheduling. In this paper, we present CMRepair, a <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Cross-rack Multi-stripe Repair</i> technique that aims to reduce the repair time for multi-stripes failure repair in heterogeneous erasure-coded clusters. CMRepair first carefully chooses the nodes for reading/repairing blocks and searches for the multi-stripe repair solution. It adopts different algorithms to adjust per stripe solution, including the Computation Time Priority (CTP) algorithm based on the greedy idea and the Repair Time Priority (RTP) algorithm based on the meta-heuristics idea. Furthermore, CMRepair selectively schedules the execution orders of cross-rack links, with the primary objective of saturating the unused upload/download bandwidth resources and avoiding network congestion. The experiments show that CMRepair with the CTP algorithm can reduce 27.59%-58.12% of the repair time while only introducing negligible computation overhead, and CMRepair with the RTP algorithm can reduce 33.52%-97.75% of the repair time in an acceptable computation time, over existing repair techniques.

On the Design of Composite Patch Repair for Strengthening of Marine Plates Subjected to Compressive Loads

Marine structures are susceptible to corrosion that accelerates material wastage. This phenomenon could lead to thickness reduction to the extent in which local buckling instabilities may occur. The majority of existing repair techniques require welding, which is a restricting factor in flammable environments where hot work is prohibited. A novel repair methodology that has attracted the research focus for over two decades is the adhesive bonding of a composite patch on a ship’s damaged plating. Although most studies have been focused on patch repair against crack propagation, restoring the initial buckling strength of corroded marine plates is of high interest. In this work, this technique is assessed using numerical experimentation through finite element analysis (FEA) with the patch’s dimensions as design parameters. The results are then evaluated using a design-of-experiments (DOE) approach by generating a response surface from central composite design (CCD) points. Applying this methodology to various plates and patches makes it possible to create a repair design procedure that specifies the minimum patch requirements depending on the metal substrate’s dimensions and corrosion realized.

Repair Pipelining for Erasure-coded Storage: Algorithms and Evaluation

We propose repair pipelining , a technique that speeds up the repair performance in general erasure-coded storage. By carefully scheduling the repair of failed data in small-size units across storage nodes in a pipelined manner, repair pipelining reduces the single-block repair time to approximately the same as the normal read time for a single block in homogeneous environments. We further design different extensions of repair pipelining algorithms for heterogeneous environments and multi-block repair operations. We implement a repair pipelining prototype, called ECPipe , and integrate it as a middleware system into two versions of Hadoop Distributed File System (HDFS) (namely, HDFS-RAID and HDFS-3) as well as Quantcast File System. Experiments on a local testbed and Amazon EC2 show that repair pipelining significantly improves the performance of degraded reads and full-node recovery over existing repair techniques.

Real-Time Repair of Business Processes Based on Alternative Operations in Case of Uncertainty

Owing to the continual evolution of business processes, differences often occur between observable behavior in the event log and the actual operation of the given process model. Whether an iterative and observable deviation occurs between the event log and the process model is in general uncertain. Existing repair techniques add only observable deviations in a fixed manner, which makes it difficult to consider the fitness and the precision of the results simultaneously. To solve this limitation, this study proposes a method of repair that can improve precision as much as possible without affecting the fitness of the results as well as the number of repair-related activities. Patterns of behavior that cannot be replayed are determined by refined reachable activity structures and conformance checks of behavioral relationships. They are optimized by constructing repair or configuration operations. The two operations can be switched based on the identification of iterative observable deviation in the given pattern of behavior during repair. To assess this, datasets from simulated and empirically acquired business processes were used. The proposed method improved the precision of six datasets by 12% on average. Deviations were repeatedly generated by the cycle, because of which the average precision improved by 21% on three datasets with loops.

Test-Equivalence Analysis for Automatic Patch Generation

Automated program repair is a problem of finding a transformation (called a patch) of a given incorrect program that eliminates the observable failures. It has important applications such as providing debugging aids, automatically grading student assignments, and patching security vulnerabilities. A common challenge faced by existing repair techniques is scalability to large patch spaces, since there are many candidate patches that these techniques explicitly or implicitly consider. The correctness criteria for program repair is often given as a suite of tests. Current repair techniques do not scale due to the large number of test executions performed by the underlying search algorithms. In this work, we address this problem by introducing a methodology of patch generation based on a test-equivalence relation (if two programs are “test-equivalent” for a given test, they produce indistinguishable results on this test). We propose two test-equivalence relations based on runtime values and dependencies, respectively, and present an algorithm that performs on-the-fly partitioning of patches into test-equivalence classes. Our experiments on real-world programs reveal that the proposed methodology drastically reduces the number of test executions and therefore provides an order of magnitude efficiency improvement over existing repair techniques, without sacrificing patch quality.

Combining quantitative and logical data cleaning

Quantitative data cleaning relies on the use of statistical methods to identify and repair data quality problems while logical data cleaning tackles the same problems using various forms of logical reasoning over declarative dependencies. Each of these approaches has its strengths: the logical approach is able to capture subtle data quality problems using sophisticated dependencies, while the quantitative approach excels at ensuring that the repaired data has desired statistical properties. We propose a novel framework within which these two approaches can be used synergistically to combine their respective strengths. We instantiate our framework using (i) metric functional dependencies, a type of dependency that generalizes functional dependencies (FDs) to identify inconsistencies in domains where only large differences in metric data are considered to be a data quality problem, and (ii) repairs that modify the inconsistent data so as to minimize statistical distortion, measured using the Earth Mover's Distance. We show that the problem of computing a statistical distortion minimal repair is NP-hard. Given this complexity, we present an efficient algorithm for finding a minimal repair that has a small statistical distortion using EMD computation over semantically related attributes. To identify semantically related attributes, we present a sound and complete axiomatization and an efficient algorithm for testing implication of metric FDs. While the complexity of inference for some other FD extensions is co-NP complete, we show that the inference problem for metric FDs remains linear, as in traditional FDs. We prove that every instance that can be generated by our repair algorithm is set-minimal (with no unnecessary changes). Our experimental evaluation demonstrates that our techniques obtain a considerably lower statistical distortion than existing repair techniques, while achieving similar levels of efficiency.

Modified technique for mitral repair without ring annuloplasty

Mitral valve repair is the procedure of choice to correct mitral regurgitation. Most operative techniques use an annuloplasty ring to provide stability and durability to the correction. We present a modification of existing repair techniques, without the use of an annuloplasty ring, in which plication sutures allow both annular remodeling and stability. Clinical and echocardiographic follow-up in our series of 60 patients with a mean follow-up of 29 months is presented.