nanofibrous scaffolds produced by electrospinning have attracted much attention, recently. aligned and random nanofibrous scaffolds of poly (vinyl alcohol) (pva), poly (ε-caprolactone) (pcl) and nanohydroxyapatite  (nha) were fabricated by electrospinning method in this study. the composite nanofibrous scaffolds were subjected to detailed analysis. morphological investigations revealed that the...

We investigate the power of migration in online scheduling for parallel identical machines. Our objective is to maximize the total processing time of accepted jobs. Once we decide to accept a job, we have to complete it before its deadline d that satisfies d ≥ (1 + ε) · p + r, where p is the processing time, r the submission time and the slack ε > 0 a system parameter. Typically, the hard case ...

We show that every n-point tree metric admits a (1 + ε)-embedding into ` C(ε) logn 1 , for every ε > 0, where C(ε) ≤ O ( ( 1ε ) 4 log 1ε ) ) . This matches the natural volume lower bound up to a factor depending only on ε. Previously, it was unknown whether even complete binary trees on n nodes could be embedded in ` O(logn) 1 with O(1) distortion. For complete d-ary trees, our construction ach...

We show that for any ε > 0 there is an XOR game G = G(ε) with Θ(ε−1/5) inputs for one player and Θ(ε−2/5) inputs for the other player such that Ω(ε−1/5) ebits are required for any strategy achieving bias that is at least a multiplicative factor (1 − ε) from optimal. This gives an exponential improvement in both the number of inputs or outputs and the noise tolerance of any previously-known self...

We prove that any extended formulation that approximates the matching polytope on nvertex graphs up to a factor of (1 + ε) for any 2 n ≤ ε ≤ 1 must have at least ( n α/ε ) defining inequalities where 0 < α < 1 is an absolute constant. This is tight as exhibited by the (1 + ε) approximating linear program obtained by dropping the odd set constraints of size larger than (1 + ε)/ε from the descrip...