We measured the K-band luminosity function using a complete sample of 4192 morphologically-typed 2MASS galaxies with Ks = 20 mag/arcsec 2 isophotal magnitudes 7 < K 20 < 11:25 mag spread over 2:12 str. Early-type (T ?0:5) and late-type (T > ?0:5) galaxies have similarly shaped luminosity functions, for H 0 = 100h km s ?1 Mpc ?1 , such that the late-type galaxies slightly dominate the K-band lum...

We aim to introduce a k-Struve function and investigate its various properties, including mainly certain inequalities associated with this function. One of the inequalities given here is pointed out to be related to the so-called classical Turán-type inequality. We also present a differential equation, several recurrence relations, and integral representations for this k-Struve function.

Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...

We prove that the work function algorithm is (n ? 1)-competitive for the k-server problem, where n is the number of points in the metric space. This gives improved upper bounds when k + 3 n 2k ?1; in particular, it shows that the work function algorithm is optimal for k = n ? 1.

k-means is the basic method applied in many data clustering problems. As is known, its natural modification can be applied to projection clustering by changing the cost function from the squared-distance from the point to the squared distance from the affine subspace. However, to apply thus approach we need the beforehand knowledge of the dimension. In this paper we show how to modify this appr...

Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. We approach this setting from a case-based perspective and propose a sophisticated k-NN framework as an alternative to previous binary decomposition techniques. It exhibits the appealing property of transparency and is based on an aggregation model which allows to incorporate a br...

The first general decomposition theorem for the k-server problem is presented. Whereas all previous theorems are for the case of a finite metric with k + 1 points, the theorem given here allows an arbitrary number of points in the underlying metric space. This theorem implies O(polylog(k))-competitive algorithms for certain metric spaces consisting of a polylogarithmic number of widely separate...

in this study, a temperature-dependent of the dispersion coefficients is calculated from equation state.the lennard-jones lj (12-6-3) effective pair potential function and simple thermodynamic argumentwith the input pvt data of liquid metals are used to calculate the dispersion coefficients. the dispersioncoefficients ( , , ) 3 6 12 c c c are found to be a linear function of 1/t1+α , where t is...