BACKGROUND Serial tissue expansion is performed to remove giant congenital melanocytic nevi. However, there have been no studies comparing the expansion rate between the subsequent and preceding expansions. In this study, we analyzed the rate of expansion in accordance with the number of surgeries, expander location, expander size, and sex. METHODS A retrospective analysis was performed in pe...

A multi-variable optimization program has been developed to investigate the performance of Wet Organic Rankine Cycles for low temperature heat recovery applications. This cycle model contains a detailed thermodynamic model of the twin-screw expander, and the methods used to match the operation of the expander to the requirements of the cycle are described. The capability of the cycle model has ...

We study the scalability of consensus-based distributed optimization algorithms by considering two questions: How many processors should we use for a given problem, and how often should they communicate when communication is not free? Central to our analysis is a problem-specific value r which quantifies the communication/computation tradeoff. We show that organizing the communication among nod...

The cutoff phenomenon describes a sharp transition in the convergence of an ergodic finite Markov chain to equilibrium. Of particular interest is understanding this convergence for the simple random walk on a bounded-degree expander graph. The first example of a family of bounded-degree graphs where the random walk exhibits cutoff in total-variation was provided only very recently, when the aut...

The statistical analysis of massive and complex data sets will require the development of algorithms that depend on distributed computing and collaborative inference. Inspired by this, we propose a collaborative framework that aims to estimate the unknown mean θ of a random variable X. In the model we present, a certain number of calculation units, distributed across a communication network rep...

We study regular graphs in which the random walks starting from a positive fraction of vertices have small mixing time. prove that any such graph is virtually an expander and has no separator. This answers question Pak [SODA: Proceedings Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial Applied Mathematics, Philadelphia, PA, 2002, pp. 321–328]. As corollary, ...

Prepectoral breast reconstruction is increasingly popular. This study compares complications between 2 subpectoral and 1 prepectoral breast reconstruction technique. METHODS Between 2008 and 2015, 294 two-staged expander breast reconstructions in 213 patients were performed with 1 of 3 surgical techniques: (1) Prepectoral, (2) subpectoral with acellular dermal matrix (ADM) sling ("Classic"), ...

Abstract Powering the adjacency matrix of an expander graph results in a better higher degree. In this paper we seek analogue operation for high-dimensional (HD) expanders. We show that naive approach to powering does not preserve HD expansion and define new power operation, using geodesic walks on quotients Bruhat–Tits buildings. Applying expanders degrees. The crux proof is combinatorial stud...

A spin system is a framework in which the vertices of graph are assigned spins from finite set. The interactions between neighbouring give rise to weights, so assignment can also be viewed as weighted homomorphism. problem approximating partition function (the aggregate weight assignments) or sampling resulting probability distribution typically intractable for general graphs. In this work, we ...

Expander graphs are useful in the design and analysis of communication networks. Mukhopadhyay et al. introduced a method to generate a family of expander graphs based on nongroup two predecessor single attractor Cellular Automata(CA). In this paper we propose a method to generate a family of expander graphs based on 60/102 Null Boundary CA(NBCA) which is a group CA. The spectral gap generated b...