in this paper, a numerical solution for a system of linear fredholm integro-differential equations by means of the sinc method is considered. this approximation reduces the system of integro-differential equations to an explicit system of algebraic equations. the exponential convergence rate $o(e^{-k sqrt{n}})$ of the method is proved. the analytical results are illustrated with numerical examp...

We present a system for fall detection in which the fall hypothesis, generated on the basis of accelerometric data, is validated by k-NN based classifier operating on depth features. We show that validation of the alarms in such a way leads to lower ratio of false alarms. We demonstrate the detection performance of the system using publicly available data. We discuss algorithms for person detec...

In the point set embeddability problem, we are given a plane graph G with n vertices and a point set S with n points. Now the goal is to answer the question whether there exists a straight-line drawing of G such that each vertex is represented as a distinct point of S as well as to provide an embedding if one does exist. Recently, in [15], a complete characterization for this problem on a speci...

Serum Phylloquinone Concentrations in a Normal Population of Children as Compared with the Reference Interval in Adults, Willy E. Lambert, Lutgart Vanneste, Andr#{233} P. De Leenheer (Lab. voor Med. Biochem. en voor Klin. Anal., Harelbekestraat, 72 B9000 Gent, Belgium), and Olivier Am#{233}dee-Manesme (INSERM, U56 et Dept. de P#{233}diatrie, Hopital de Bic#{234}tre, 78, rue du G#{233}neral-Lecl...

We consider various encodings that support range Top-k queries on a two-dimensional array containing elements from a total order. For an m × n array, with m ≤ n, we first propose an almost optimal encoding for answering one-sided Top-k queries, whose query range is restricted to [1 . . .m][1 . . . a], for 1 ≤ a ≤ n. Next, we propose an encoding for the general Top-k queries that takes m2 lg ((k...

We prove that the united K-theory functor is a surjective functor from the category of real simple purely infinite C*-algebras to the category of countable acyclic CRT-modules.

Let G be a finite group and H,K be two subgroups of G. We introduce the relative non-normal graph of K with respect to H , denoted by NH,K, which is a bipartite graph with vertex sets HHK and KNK(H) and two vertices x ∈ H HK and y ∈ K NK(H) are adjacent if xy / ∈ H, where HK =Tk∈K Hk and NK(H) = {k ∈ K : Hk = H}. We determined some numerical invariants and state that when this graph is planar or...

In probability theory and stat ist ics, a categorical distribut ion (occasionally "discrete distribut ion" or "mult inomial distribut ion", both imprecise usages) is a probability distribut ion that describes the result of a random event that can take on one of K possible outcomes, with the probability of each outcome separately specif ied. There is not necessarily an underlying ordering of the...