PURPOSE To describe a trypan blue dye staining technique under air, a modification of the previously described 30 G needle under-air technique. DESIGN This is a prospective, randomized study of 1,000 eyes of 952 patients undergoing phacoemulsification in a private practice setting from January 2015 to August 2016. Three variants as a modification of the previously known 30 G needle technique ...

A graph G is called a pairwise compatibility graph (PCG) if there exists a positive edge weighted tree T and two non-negative real numbers dmin and dmax such that each leaf lu of T corresponds to a node u ∈ V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (lu, lv) ≤ dmax, where dT (lu, lv) is the sum of the weights of the edges on the unique path from lu to lv in T . In this paper we ...

A graph G is called a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dmin and dmax such that each leaf lu of T corresponds to a vertex u ∈ V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT,w(lu, lv) ≤ dmax where dT,w(lu, lv) is the sum of the weights of the edges on the unique path from lu to lv in T . In this note, we show ...

A graph G = (V, E) is a pairwise compatibility graph (PCG) if there exists an edgeweighted tree T and two non-negative real numbers dmin and dmax such that each leaf u of T is a node of V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax where dT (u, v) is the sum of weights of the edges on the unique path from u to v in T . The main issue on these graphs consists in charac...

We propose a distributed first-order augmented Lagrangian (DFAL) algorithm to minimize the sum of composite convex functions, where each term in the sum is a private cost function belonging to a node, and only nodes connected by an edge can directly communicate with each other. This optimization model abstracts a number of applications in distributed sensing and machine learning. We show that a...

where α ∈ Fqm is an element of order n and gcd(b, n) = 1. This is a cyclic Reed-Solomon (RS) code with dmin = n − k + 1. Adding roots at all the conjugates of { α, α, . . . , αa+(n−k)b } (w.r.t. the subfield K = Fq) also allows one to define a length-n BCH subcode over Fq with dmin ≥ n−k+ 1. Also, any decoder that corrects all patterns of up to t = b(n− k)/2c errors for the original RS code can...

For a secret sharing scheme, two parameters dmin and dcheat are defined in [1] and [2]. These two parameters measure the errorcorrecting capability and the secret-recovering capability of the secret sharing scheme against cheaters. Some general properties of the parameters have been studied in [1-3]. The MDS secret-sharing scheme is defined in [2] and it is proved that MDS perfect secret sharin...

This paper deals with the design of low-rate sparse-graph codes with linear minimum distance (dmin) in the blocklength. First, we define a necessary condition that a quite general family of graphical codes has to satisfy in order to have linear dmin.The condition generalizes results known for turbo codes [9] and LDPC codes. Secondly, we try to justify the necessity to introduce degree-1 bits (t...

A computationally efficient global optimization method, the adaptive particle swarm optimization (APSO), is proposed for the synthesis of uniform and Gaussian amplitude arrays of two cases, i.e., the prior constraint in the synthesis of the element positions for both the cases is dmin = 0.5 λ, where dmin is the minimum distance between two adjacent elements. The upper limit in the distance betw...