‎let $x$ be a real normed  space, then  $c(subseteq x)$  is  functionally  convex  (briefly, $f$-convex), if  $t(c)subseteq bbb r $ is  convex for all bounded linear transformations $tin b(x,r)$; and $k(subseteq x)$  is  functionally   closed (briefly, $f$-closed), if  $t(k)subseteq bbb r $ is  closed  for all bounded linear transformations $tin b(x,r)$. we improve the    krein-milman theorem  ...

‎Let $X$ be a real normed  space, then  $C(subseteq X)$  is  functionally  convex  (briefly, $F$-convex), if  $T(C)subseteq Bbb R $ is  convex for all bounded linear transformations $Tin B(X,R)$; and $K(subseteq X)$  is  functionally   closed (briefly, $F$-closed), if  $T(K)subseteq Bbb R $ is  closed  for all bounded linear transformations $Tin B(X,R)$. We improve the    Krein-Milman theorem  ...

BACKGROUND Real-world studies on anticoagulants are mostly performed on health insurance databases, limited to reported events, and sometimes far from every-day issues in family practice. We assess the presence of data for safe monitoring of oral anticoagulants in general practice, and compare patients' knowledge of taking an anticoagulant between vitamin K antagonists (VKA) and direct anticoag...

the potassium pools of five major physiographic units of urmia region in western azarbaijan province were studied to investigate the distribution of k forms as a function of clay mineralogy and physiographic units. for this, soil samples from different horizons of ten pedons were selected and analyzed for physiochemical properties, mineralogy of clay fraction, and forms of k. analyses of xrd re...

We prove in this paper that the expected value of the objective function of the k-means++ algorithm for samples converges to population expected value. As k-means++, for samples, provides with constant factor approximation for k-means objectives, such an approximation can be achieved for the population with increase of the sample size. This result is of potential practical relevance when one is...

In this note we showed that a p(≥ 2)-center location problem in general networks can be transformed to the well known Klee’s measure problem [3]. This resulted in an improved algorithm for the continuous case with running time O(mn2 ∗ n log n). The previous best result for the problem is O(mnα(n) log n) where α(n) is the inverse Ackermann function [9]. When the underlying network is a partial k...

In a geometric k-clustering problem the goal is to partition a set of points in R into k subsets such that a certain cost function of the clustering is minimized. We present data structures for orthogonal range-clustering queries on a point set S: given a query box Q and an integer k > 2, compute an optimal k-clustering for S ∩Q. We obtain the following results. – We present a general method to...

The enumeration of shortest paths in cubic grid is presented here. The cubic grid considers three neighborhods— 6-neighborhood (face connectivity), 18-neighborhood (edge connectivity), and 26-neighborhood (vertex connectivity). The formulation for distance metrics are given here. L1, D18, and L∞ are the three metrics for 6-neighborhood, 18-neighborhood, and 26-neighborhood. The problem is to fi...

Thrombin plays an essential role in haemostasis and thrombosis; therefore, anticoagulant strategies focus on direct or indirect inhibition of thrombin or factor Xa. Over the last 60 years, key players in antithrombotic treatment have been unfractionated heparin and vitamin K antagonists (VAKs), such as coumarin. New oral anticoagulants, with different mechanisms of action and administration, ha...