We develop a Tong-step surface-following version of the method of analytic centers for the fractional-linear problem min{to [ toB(x) A ( x ) E H, B (x ) E K, x C G}, where H is a closed convex domain, K is a convex cone contained in the recessive cone of H, G is a convex domain and B (.), A (.) are affine mappings. Tracing a two-dimensional surface of analytic centers rather than the usual path...

We develop a long-step surface-following version of the method of analytic centers for the fractional-linear problem min {t0 | t0B(x)−A(x) ∈ H, B(x) ∈ K, x ∈ G} , where H is a closed convex domain, K is a convex cone contained in the recessive cone of H, G is a convex domain and B(·), A(·) are affine mappings. Tracing a twodimensional surface of analytic centers rather than the usual path of ce...

Many real-world classification applications fall into the class of positive and unlabeled learning problems. The existing techniques almost all are based on the two-step strategy. This paper proposes a new reliable negative extracting algorithm for step 1. We adopt kNN algorithm to rank the similarity of unlabeled examples from the k nearest positive examples, and set a threshold to label some ...

The kinetics of reaction between 4-methylaniline (1), dimethyl acetylenedicarboxylate (2) and formaldehyde (4) has been theoretically investigated to gain further insight into the reaction mechanism. The results of theoretical calculations were achieved using the ab initio method at the HF/6-311g (d, p) level of theory in gas phase. The mechanism of this reaction had 5 steps. Theoretical kineti...

In this paper a new macroscopic k-ε model is developed and validated for turbulent flow through porous media for a wide range of porosities. The morphology of porous media is simulated by a periodic array of square cylinders. In the first step, calculations based on microscopic v2 − f model are conducted using a Galerkin/Least-Squares finite element formulation, employing equalorder bilinear ve...

This paper presents a new approach to the problem of verifying safety properties of concurrent programs with shared memory and interleaving semantics. Our method builds on and extends contextbounded analysis (CBA), in which thread interleavings are considered only up to K context switches. In a K-induction argument, the base case establishes that the property holds for the first K steps (first ...

this paper introduces a new method for accelerating current sluggish fem and improving memory demand in fem problems with high node resolution or bulky structures. like most of the numerical methods, fem results to a matrix equation which normally has huge dimension. breaking the main matrix equation into several smaller size matrices, the solving procedure can be accelerated. for implementing ...

K-means is undoubtedly the most widely used partitional clustering algorithm. Unfortunately, the nearest neighbor search step of this algorithm can be computationally expensive, as the distance between each input vector and all cluster centers need to be calculated. To accelerate this step, a computationally inexpensive distance estimation method can be tried first, resulting in the rejection o...

This paper represents another step in overcoming a drawback of K-Means, its lack of defense against noisy features, by using feature weights in the criterion. The Weighted K-Means method by Huang et al. is extended to the corresponding Minkowski metric for measuring distances. Under Minkowski metric the feature weights become intuitively appealing feature rescaling factors in a conventional K-M...

We present an efficient method for collision detection in the black-box KDS model for a set S of n objects in the plane. In this model we receive the object locations at regular time steps and we know a bound dmax on the maximum displacement of any object within one time step. Our method maintains, in O((λ+k)n) time per time step, a compressed quadtree on the bounding-box vertices of the object...