نتایج جستجو برای: k ε model

تعداد نتایج: 2428879  

Journal: :IOP conference series 2023

Abstract A new concept design Catamaran Decommissioning Unit has been developed by Research Center for Hydrodynamics Technology Indonesia. The catamaran a unique shape, however in order to achieve resilient and sustainable the decommissioning unit as it resistance analysis both model testing numerical calculation must be conducted. value from needs validated with results towing tank. of scaling...

2014
DRAGOS GHIOCA

Let k be a an algebraically closed field of arbitrary characteristic, and we let h : A(k(t)) −→ R≥0 be the usual Weil height for the n-dimensional affine space corresponding to the function field k(t) (extended to its algebraic closure). We prove that for any affine variety V ⊂ A defined over k(t), there exists a positive real number ε := ε(V ) such that if P ∈ V (k(t)) and h(P ) < ε, then P ∈ ...

2017
Timothy M. Chan Konstantinos Tsakalidis

We study a longstanding problem in computational geometry: 2-d dynamic orthogonal range reporting. We present a new data structure achieving O ( logn log logn + k ) optimal query time and O ( log2/3+o(1) n ) update time (amortized) in the word RAM model, where n is the number of data points and k is the output size. This is the first improvement in over 10 years of Mortensen’s previous result [...

Compressible gas flow inside a convergent-divergent nozzle and its exhaust plume atdifferent nozzle pressure ratios (NPR) have been numerically studied with severalturbulence models. The numerical results reveal that, the SST k–ω model give the bestresults compared with other models in time and accuracy. The effect of changes in value ofdivergence half-angle (ε ) on the nozzle performance, thru...

2011
Xiaoxun Sun Min Li

We study the challenges of protecting privacy of individuals in the large public survey rating data in this chapter. Recent study shows that personal information in supposedly anonymous movie rating records is de-identified. The survey rating data usually contains both ratings of sensitive and non-sensitive issues. The ratings of sensitive issues involve personal privacy. Even though the survey...

Journal: :Mathematics in Computer Science 2010
Jean-Daniel Boissonnat Arijit Ghosh

We propose an algorithm to sample and mesh a k-submanifold M of positive reach embedded in R. The algorithm first constructs a crude sample of M. It then refines the sample according to a prescribed parameter ε, and builds a mesh that approximates M. Differently from most algorithms that have been developped for meshing surfaces of R, the refinement phase does not rely on a subdivision of R (su...

Journal: :CoRR 2016
Daniel J. Hsu Matus Telgarsky

This paper investigates the following natural greedy procedure for clustering in the bi-criterion setting: iteratively grow a set of centers, in each round adding the center from a candidate set that maximally decreases clustering cost. In the case of k-medians and k-means, the key results are as follows. • When the method considers all data points as candidate centers, then selecting O(k log(1...

Journal: :journal of hydraulic structures 2013
r. ghaldarbandi m.h. keshavarz keshavarz h. hakimzadeh

in this paper, effects of the cross shore and groyne wall slopes on flow parameters around an impermeable groyne were considered using a three-dimensional numerical cfd model (i.e., fluent). the k-ε turbulence model was used to evaluate the reynolds stresses. the model was first applied to a vertical groyne on a flat bed and the model results were compared with the relevant experimental data. t...

2001
Antonio Pich

The long-distance contributions to K → 2π amplitudes can be pinned down, using well established Chiral Perturbation Theory techniques. The strong S–wave rescattering of the two final pions generates sizeable chiral loop corrections, which have an important impact on the direct CP violation ratio ε/ε [1,2]. Including all large logarithmic corrections, both at short and long distances, the Standa...

2016
Zengfeng Huang Pan Peng

In this paper we study graph problems in dynamic streaming model, where the input is defined by a sequence of edge insertions and deletions. As many natural problems require Ω(n) space, where n is the number of vertices, existing works mainly focused on designing Õ(n) space algorithms. Although sublinear in the number of edges for dense graphs, it could still be too large for many applications ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید