A (k, ε)-non-malleable extractor is a function nmExt : {0, 1}×{0, 1} → {0, 1} that takes two inputs, a weak source X ∼ {0, 1} of min-entropy k and an independent uniform seed s ∈ {0, 1}, and outputs a bit nmExt(X, s) that is ε-close to uniform, even given the seed s and the value nmExt(X, s′) for an adversarially chosen seed s′ 6= s. Dodis and Wichs (STOC 2009) showed the existence of (k, ε)-no...

We study the following problem: given a real number k and an integer d, what is the smallest ε such that any fractional (k+ε)-precoloring of vertices at pairwise distances at least d of a fractionally k-colorable graph can be extended to a fractional (k+ ε)coloring of the whole graph? The exact values of ε were known for k ∈ {2} ∪ [3,∞) and any d. We determine the exact values of ε for k ∈ (2, ...

Characteristics of rotor blade tip clearance flow in axial compressors can significantly affect their performance and stable operation. It may also increase blade vibrations and cause detrimental noises. Therefore, this paper is contributed to investigate tip leakage flow in a low speed isolated axial compressor rotor blades row. Simulations are carried out on near-stall condition, which is val...

We specifically analyzed Cayley trees with degree k ∈ {2, · · · 6}. For each link (i, j), the weight of a loan lij was drawn uniformly in [1 − ε, 1 + ε]. We analyzed 4 values of ε, from 0.1 to 0.4, in addition to ε = 0. This was done for 102 networks for each degree k and perturbation ε, and the resulting number of failures was measured. Figure A shows the results for R = 1.02, r = 1.01, f = 50...

This analysis investigates the distortion of flow measurement and the increase of cavitation along orifice flowmeter. The analysis using the numerical method (CFD) validated the distortion of flow measurement through the inlet velocity profile considering the convergence and grid dependency. Realizable k-e model was selected and y+ was about 50 in this numerical analysis. This analysis also est...

Explicit constructions of binary linear codes that are efficiently list-decodable up to a fraction (1/2−ε) of errors are given. The codes encode k bits into n = poly(k/ε) bits and are constructible and list-decodable in time polynomial in k and 1/ε (in particular, in our results ε need not be constant and can even be polynomially small in n). These results give the best known polynomial depende...

We report on a calculation of εK/εK at next-to-leading in the 1/Nc expansion and to lowest order in Chiral Perturbation Theory. We discuss the short-distance matching, the scale and scheme dependence as well as the long-distance short-distance matching. We include the two known chiral corrections to our result and discuss further order p4 corrections to it. September 2000 Work supported in part...