Topological Complexity of Frictional Interfaces: Friction Networks

Through research conducted in this study, a network approach to the correlation patterns of void spaces in rough fractures (crack type II) was developed. We characterized friction networks with several networks characteristics. The correlation among network properties with the fracture permeability is the result of friction networks. The revealed hubs in the complex aperture networks confirmed the importance of highly correlated groups to conduct the highlighted features of the dynamical aperture field. We found that there is a universal power law between the nodes' degree and motifs frequency (for triangles it reads T(k)\proptok{\beta} ({\beta} \approx2\pm0.3)). The investigation of localization effects on eigenvectors shows a remarkable difference in parallel and perpendicular aperture patches. Furthermore, we estimate the rate of stored energy in asperities so that we found that the rate of radiated energy is higher in parallel friction networks than it is in transverse directions. The final part of our research highlights 4 point sub-graph distribution and its correlation with fluid flow. For shear rupture, we observed a similar trend in sub-graph distribution, resulting from parallel and transversal aperture profiles (a superfamily phenomenon)

Network-Configurations of Dynamic Friction Patterns

The complex configurations of dynamic friction patterns-regarding real time contact areas- are transformed into appropriate networks. With this transformation of a system to network space, many properties can be inferred about the structure and dynamics of the system. Here, we analyze the dynamics of static friction, i.e. nucleation processes, with respect to "friction networks". We show that networks can successfully capture the crack-like shear ruptures and possible corresponding acoustic features. We found that the fraction of triangles remarkably scales with the detachment fronts. There is a universal power law between nodes' degree and motifs frequency (for triangles, it reads T(k)\proptok{\beta} ({\beta} \approx2\pm0.4)). We confirmed the obtained universality in aperture-based friction networks. Based on the achieved results, we extracted a possible friction law in terms of network parameters and compared it with the rate and state friction laws. In particular, the evolutions of loops are scaled with power law, indicating the aggregation of cycles around hub nodes. Also, the transition to slow rupture is scaled with the fast variation of local heterogeneity. Furthermore, the motif distributions and modularity space of networks -in terms of withinmodule degree and participation coefficient-show non-uniform general trends, indicating a universal aspect of energy flow in shear ruptures

Broadcasting in Noisy Radio Networks

The widely-studied radio network model [Chlamtac and Kutten, 1985] is a graph-based description that captures the inherent impact of collisions in wireless communication. In this model, the strong assumption is made that node $v$ receives a message from a neighbor if and only if exactly one of its neighbors broadcasts. We relax this assumption by introducing a new noisy radio network model in which random faults occur at senders or receivers. Specifically, for a constant noise parameter $p \in [0,1)$, either every sender has probability $p$ of transmitting noise or every receiver of a single transmission in its neighborhood has probability $p$ of receiving noise. We first study single-message broadcast algorithms in noisy radio networks and show that the Decay algorithm [Bar-Yehuda et al., 1992] remains robust in the noisy model while the diameter-linear algorithm of Gasieniec et al., 2007 does not. We give a modified version of the algorithm of Gasieniec et al., 2007 that is robust to sender and receiver faults, and extend both this modified algorithm and the Decay algorithm to robust multi-message broadcast algorithms. We next investigate the extent to which (network) coding improves throughput in noisy radio networks. We address the previously perplexing result of Alon et al. 2014 that worst case coding throughput is no better than worst case routing throughput up to constants: we show that the worst case throughput performance of coding is, in fact, superior to that of routing -- by a $\Theta(\log(n))$ gap -- provided receiver faults are introduced. However, we show that any coding or routing scheme for the noiseless setting can be transformed to be robust to sender faults with only a constant throughput overhead. These transformations imply that the results of Alon et al., 2014 carry over to noisy radio networks with sender faults.Comment: Principles of Distributed Computing 201

Acromioclavicular Joint Fixation Using an Acroplate Combined With a Coracoclavicular Screw

Background: Appropriate treatment of acromioclavicular joint dislocation is controversial. Acroplate fixation is one of the most common treatment methods of acromioclavicular joint (ACJ) dislocation. Based on the risk of re-dislocation after Acroplate fixation, we assumed that combined fixation with an Acroplate and a coracoclavicular screw helps improve the outcome. Objectives: The main purpose of the current study was to compare the outcome of ACJ dislocation treated with an Acroplate alone and in combination with coracoclavicular screw. Patients and Methods: This study was carried out on 40 patients with ACJ dislocation types III to VI who were divided randomly into two equal groups: Acroplate group (P) and Acroplate in combination with coracoclavicular screw group (P + S). The screws were extracted 3-6 months postoperatively. The patients were followed for 1 year and Imatani’s score was calculated. Finally, the data were compared between the groups. Results: The mean Imatani’s score was significantly higher in P + S group (83.4 ± 14.1) than P group (81.2 ± 10.3) (P < 0.001). The mean duration of surgery was the same in the two groups (59.8 ± 9.4 minutes in group P V.s 64.3 ± 10.9 minutes in group P + S; P = 0.169). There were no cases of re-dislocation, degenerative changes and ossification and all patients returned to their previous jobs or sporting activities. Conclusions: Using a coracoclavicular screw combined with an Acroplate can improve the patients’ function after ACJ disruption without any significant increase in surgical duration. Authors recommend this technique in the fixation of ACJ dislocation

Random Contractions and Sampling for Hypergraph and Hedge Connectivity

We initiate the study of hedge connectivity of undirected graphs, motivated by dependent edge failures in real-world networks. In this model, edges are partitioned into groups called hedges that fail together. The hedge connectivity of a graph is the minimum number of hedges whose removal disconnects the graph. We give a polynomial-time approximation scheme and a quasi-polynomial exact algorithm for hedge connectivity. This provides strong evidence that the hedge connectivity problem is tractable, which contrasts with prior work that established the intractability of the corresponding s−t min-cut problem. Our techniques also yield new combinatorial and algorithmic results in hypergraph connectivity. Next, we study the behavior of hedge graphs under uniform random sampling of hedges. We show that unlike graphs, all cuts in the sample do not converge to their expected value in hedge graphs. Nevertheless, the min-cut of the sample does indeed concentrate around the expected value of the original min-cut. This leads to a sharp threshold on hedge survival probabilities for graph disconnection. To the best of our knowledge, this is the first network reliability analysis under dependent edge failures

Lower Bounds for Structuring Unreliable Radio Networks

In this paper, we study lower bounds for randomized solutions to the maximal independent set (MIS) and connected dominating set (CDS) problems in the dual graph model of radio networks---a generalization of the standard graph-based model that now includes unreliable links controlled by an adversary. We begin by proving that a natural geographic constraint on the network topology is required to solve these problems efficiently (i.e., in time polylogarthmic in the network size). We then prove the importance of the assumption that nodes are provided advance knowledge of their reliable neighbors (i.e, neighbors connected by reliable links). Combined, these results answer an open question by proving that the efficient MIS and CDS algorithms from [Censor-Hillel, PODC 2011] are optimal with respect to their dual graph model assumptions. They also provide insight into what properties of an unreliable network enable efficient local computation.Comment: An extended abstract of this work appears in the 2014 proceedings of the International Symposium on Distributed Computing (DISC

Accumulation and bunching of positrons

Results from a positron accumulator that operates efficiently over a range of repetition rates from 100 to 1000 Hz are presented. Moderated β‐decay positrons from a radioactive source are accumulated in a Penning‐style trap. At a repetition rate of 250 Hz an accumulation efficiency of ∼25% has been achieved. Two techniques for reducing the time spread of the positron pulses have been investigated. The most successful method reduces the pulse width from 120 ns to 20 ns.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/87600/2/487_1.pd