نتایج جستجو برای: running with ball

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

Background. A field study conducted by researchers found the balls used by visual impairment students at school basically used the sound by a small bell inside the ball. However, the sound emitted from the ball is very limited, the ball will sound when it is moved. This makes it difficult for students with visual impairments to find a missing ball that not emitted makes a sound. Objectives. A ...

2013
M. Ramezani T. Neitzert

Mechanical alloying has recently attracted considerable attention as researchers strive to enhance nanocomposite properties and extend their utility. The process can be performed at room temperature and homogeneous nanocomposite powders can be produced. In this paper, we investigated the effect of different ball milling parameters and operating conditions (milling time, ball size, processing co...

2007
Martin Fürer Shiva Prasad Kasiviswanathan

Efficient algorithms are presented for constructing spanners in geometric intersection graphs. For a unit ball graph in R, a (1+ǫ)-spanner with O(nǫ) edges is obtained using efficient partitioning of the space into hypercubes and solving bichromatic closest pair problems. The spanner construction has almost equivalent complexity to the construction of Euclidean minimum spanning trees. The resul...

2018
Divesh Aggarwal Priyanka Mukhopadhyay

Blomer and Naewe[BN09] modified the randomized sieving algorithm of Ajtai, Kumar and Sivakumar[AKS01] to solve the shortest vector problem (SVP). The algorithm starts with $N = 2^{O(n)}$ randomly chosen vectors in the lattice and employs a sieving procedure to iteratively obtain shorter vectors in the lattice. The running time of the sieving procedure is quadratic in $N$. We study this problem ...

2007
Pankaj K. Agarwal Sharath Kumar

Given a set of points P = {p1, p2 . . . , pn} ⊂ R, the 1-center problem is to determine the smallest radius ball containing P . Let x be the center of the ball and let r be its radius. We can express the problem of finding the 1-center as the following optimization problem. min r, ||x− pi|| ≤ r ∀i ≤ n In order to avoid computing square roots, we can reformulate the problem as: min r ||x− pi|| ≤...

A disk Wang-Bézier type generalized Ball curve is a Wang-Bézier type generalized Ball curve whose control points are disks in a plane. It can be viewed as a parametric curve with error tolerances. In this paper, we discuss the problem of degree reduction of disk Wang-Bézier type generalized Ball curve, that is, bounding disk Wang-Bézier type generalized Ball curves with lower degree disk Wa...

Journal: :SIAM Journal on Optimization 2008
Selin Damla Ahipasaoglu E. Alper Yildirim

Given A := {a, . . . , am} ⊂ Rn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of A. In this note, given an approximate solution to the minimum enclosing ball problem, we propose a simple procedure to identify and eliminate points in A that are guaranteed to lie in the interior of the minimum-radius ball enclosing A. Our computational result...

Ali Kamali Moaveni Bahram Rezai, Mohammad Noaparast,

The aim of this research work was to investigate on the ball filling estimation of Miduk semi-autogenous (SAG) Mill via an utilized method. Miduk copper concentrator is located in Kerman Province, Iran, and its size reduction stage includes one gyratory crusher which feeds one SAG mill (9.75 dia.(m)*3.88 length(m)) following two parallel ball mills (5dia.(m)*7lenght(m)). After SAG mill, a tromm...

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

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