In (5), GF is the Fermi coupling, the functions zi(μ) and yi(μ) are the Wilson coefficients and τ = −VtdV ∗ ts/VudV ∗ us. According to the standard parameterization of the CKM matrix, in order to determine ε/ε , we only need to consider the yi(μ) components, which control the CP -violating part of the lagrangian. The coefficients yi(μ), and zi(μ) contain all the dependence of short-distance phy...

A pressure-based implicit procedure to solve the Euler and Navier-Stokes equations on a nonorthogonal mesh with collocated finite volume formulation is described. The boundedness criteria for this procedure are determined from Normalized Variable diagram (NVD) scheme.The procedure incorporates the ε−k eddy-viscosity turbulence model. The algorithm is tested for inviscid and turbulent transonic ...

Let k[ε]2 := k[ε]/(ε2). The single valued real analytic n-polylogarithm Ln : C → R is fundamental in the study of weight n motivic cohomology over a field k, of characteristic 0. In this paper, we extend the construction in Ünver (Algebra Number Theory 3:1–34, 2009) to define additive n-polylogarithms lin:k[ε]2 → k and prove that they satisfy functional equations analogous to those of Ln . Unde...

We consider a second order damped-vibration equation Mẍ + D(ε)ẋ + Kx = 0, where M, D(ε), K are real, symmetric matrices of order n. The damping matrix D(ε) is defined by D(ε) = Cu + C(ε), where Cu presents internal damping and rank(C(ε)) = r, where ε is dampers’ viscosity. We present an algorithm which derives a formula for the trace of the solution X of the Lyapunov equation AX + XA = −B, as a...

In this paper we present distributed testing algorithms of graph properties in the CONGEST-model [CHFSV16]. Concretely, a distributed one-sided error ε-tester for a property P meets the following specification: if the network has the property P, then all of the network’s processors should output YES, and if the network is ε-far from having the property, according to a predetermined distance mea...

In this paper, we study the k-forest problem in the model of resource augmentation. In the k-forest problem, given an edge-weighted graph G(V,E), a parameter k, and a set of m demand pairs ⊆ V × V , the objective is to construct a minimum-cost subgraph that connects at least k demands. The problem is hard to approximate—the best-known approximation ratio is O(min{√n, √ k}). Furthermore, k-fores...

A comparative assessment is done on the effectiveness of some developed and reported macroscopic and mesoscopic models deployed for addressing the three-dimensional thermo-fluidic transport during high-power laser surface alloying process. The macroscopic models include the most celebrated k–ε turbulence model and the large eddy simulation (LES) model, whereas a kinetic theory-based lattice Bol...

k-Anonymity and ε-differential privacy are two mainstream privacy models, the former introduced to anonymize data sets and the latter to limit the knowledge gain that results from the inclusion of one individual in the data set. Whereas basic k-anonymity only protects against identity disclosure, t-closeness was presented as an extension of k-anonymity that also protects against attribute discl...