in the present paper, among other results, a decomposition formula is given for the w-bounded continuous negative definite functions of a topological *-semigroup s with a weight function w into a proper h*-algebra a in terms of w-bounded continuous positive definite a-valued functions on s. a generalization of a well-known result of k. harzallah is obtained. an earlier conjecture of the author ...

We prove several new results concerning k-sets of point sets on the 2-sphere (equivalently, for signed point sets in the plane) and k-sets in 3-space. Specific results include spherical generalizations of (i) Lovász’ lemma (regarding the number of spherical k-edges intersecting a given great circle) and of (ii) the crossing identity for kedges due to Andrzejak et al. As a new ingredient compare...

The network measurement community has proposed multiple machine learning (ML) methods for traffic classification during the last years. Although several research works have reported accuracies over 90%, most network operators still use either obsolete (e.g., port-based) or extremely expensive (e.g., pattern matching) methods for traffic classification. We argue that one of the barriers to the r...

We investigate the notion of K-triviality for closed sets and continuous functions. Every K-trivial closed set contains a K-trivial real. There exists a K-trivial Π 1 class with no computable elements. For any K-trivial degree d, there is a K-trivial continuous function of degree d.

Information streams provide today a prevalent way of publishing and consuming content on the Web, especially due to the great success of social networks. Top-k queries over the streams of interest allow limiting results to the most relevant content, while continuous processing of such queries is the most effective approach in large scale systems. However, current systems fail in combining conti...

A k nearest neighbor (k-NN) query retrieves k objects in a given objects set which are closest to the query point q. Processing continuous k-nearest neighbor (k-NN) query over moving objects in location-dependent application requires that the frequent location updates of moving objects and intensive continuous k-NN queries must be efficiently processed at the same time. In this paper, we propos...

in this paper, we use petrov-galerkin elements such as continuous and discontinuous lagrange-type k-0 elements and hermite-type 3-1 elements to find an approximate solution for linear fredholm integro-differential equations on $[0,1]$. also we show the efficiency of this method by some numerical examples