656,422 research outputs found
Workpiece Alignment for Hybrid Laser Aided Part Repair Process
Work piece alignment is a key issue for hybrid laser aided part repair, a process utilizing
both machining and laser deposition. Proper alignment can greatly improve the accuracy of the
repair process. This paper introduces a method for aligning a physical work piece and a CAD
model using a Renishaw touch probe and software tools. Also discussed is a model for
computing 5-axis CNC positions based on a desired work piece orientation.Mechanical Engineerin
Avoiding Unnecessary Information Loss: Correct and Efficient Model Synchronization Based on Triple Graph Grammars
Model synchronization, i.e., the task of restoring consistency between two
interrelated models after a model change, is a challenging task. Triple Graph
Grammars (TGGs) specify model consistency by means of rules that describe how
to create consistent pairs of models. These rules can be used to automatically
derive further rules, which describe how to propagate changes from one model to
the other or how to change one model in such a way that propagation is
guaranteed to be possible. Restricting model synchronization to these derived
rules, however, may lead to unnecessary deletion and recreation of model
elements during change propagation. This is inefficient and may cause
unnecessary information loss, i.e., when deleted elements contain information
that is not represented in the second model, this information cannot be
recovered easily. Short-cut rules have recently been developed to avoid
unnecessary information loss by reusing existing model elements. In this paper,
we show how to automatically derive (short-cut) repair rules from short-cut
rules to propagate changes such that information loss is avoided and model
synchronization is accelerated. The key ingredients of our rule-based model
synchronization process are these repair rules and an incremental pattern
matcher informing about suitable applications of them. We prove the termination
and the correctness of this synchronization process and discuss its
completeness. As a proof of concept, we have implemented this synchronization
process in eMoflon, a state-of-the-art model transformation tool with inherent
support of bidirectionality. Our evaluation shows that repair processes based
on (short-cut) repair rules have considerably decreased information loss and
improved performance compared to former model synchronization processes based
on TGGs.Comment: 33 pages, 20 figures, 3 table
Exact Optimized-cost Repair in Multi-hop Distributed Storage Networks
The problem of exact repair of a failed node in multi-hop networked
distributed storage systems is considered. Contrary to the most of the current
studies which model the repair process by the direct links from surviving nodes
to the new node, the repair is modeled by considering the multi-hop network
structure, and taking into account that there might not exist direct links from
all the surviving nodes to the new node. In the repair problem of these
systems, surviving nodes may cooperate to transmit the repair traffic to the
new node. In this setting, we define the total number of packets transmitted
between nodes as repair-cost. A lower bound of the repaircost can thus be found
by cut-set bound analysis. In this paper, we show that the lower bound of the
repair-cost is achievable for the exact repair of MDS codes in tandem and grid
networks, thus resulting in the minimum-cost exact MDS codes. Further, two
suboptimal (achievable) bounds for the large scale grid networks are proposed.Comment: (To appear in ICC 2014
Generic Secure Repair for Distributed Storage
This paper studies the problem of repairing secret sharing schemes, i.e.,
schemes that encode a message into shares, assigned to nodes, so that
any nodes can decode the message but any colluding nodes cannot infer
any information about the message. In the event of node failures so that shares
held by the failed nodes are lost, the system needs to be repaired by
reconstructing and reassigning the lost shares to the failed (or replacement)
nodes. This can be achieved trivially by a trustworthy third-party that
receives the shares of the available nodes, recompute and reassign the lost
shares. The interesting question, studied in the paper, is how to repair
without a trustworthy third-party. The main issue that arises is repair
security: how to maintain the requirement that any colluding nodes,
including the failed nodes, cannot learn any information about the message,
during and after the repair process? We solve this secure repair problem from
the perspective of secure multi-party computation. Specifically, we design
generic repair schemes that can securely repair any (scalar or vector) linear
secret sharing schemes. We prove a lower bound on the repair bandwidth of
secure repair schemes and show that the proposed secure repair schemes achieve
the optimal repair bandwidth up to a small constant factor when dominates
, or when the secret sharing scheme being repaired has optimal rate. We
adopt a formal information-theoretic approach in our analysis and bounds. A
main idea in our schemes is to allow a more flexible repair model than the
straightforward one-round repair model implicitly assumed by existing secure
regenerating codes. Particularly, the proposed secure repair schemes are simple
and efficient two-round protocols
Virtual series-system models of imperfect repair
Novel models of imperfect repair are fitted to classic reliability datasets. The models suppose that a virtual system comprises a component and a remainder in series. On failure of the component, the component is renewed, and on failure of the remainder, the component is renewed
and the remainder is minimally repaired. It follows that the repair process is a counting process that is the superposition of a renewal process and a Poisson process. The repair effect, that is, the extent to the system is repaired by renewal of the component, depends on the relative intensities of the superposed processes. The repair effect may be negative, when the intensity of the part that is a renewal process is a decreasing function. Other special cases of the model exist (renewal process,
Poisson process, superposed renewal process and homogeneous Poisson process). Model fit is
important because the nature of the model and corresponding parameter values determine the
effectiveness of maintenance, which we also consider. A cost-minimizing repair policy may be determined provided the cost of preventive-repair is less than the cost of corrective-repair and the repairable part is ageing. If the remainder is ageing, then policy needs to be adapted as it ages
Scheduling aircraft’s engines repair process: a mathematical model
In this talk, we discuss a scheduling problem
that originated at TAP - Maintenance & Engineering
- the maintenance, repair and overhaul
organization of Portugal’s leading airline. In the
repair process of aircrafts’ engines, the operations
to be scheduled may be executed on a
certain workstation by any processor of a given
set, and the objective is to minimize the total
weighted tardiness. A mixed integer linear programming
formulation, based on the flexible job
shop scheduling, is presented here, along with
computational experiment on a real instance,
provided by TAP-ME, from a regular working
week. The model was also tested using benchmarking instances available in literature
- …