In this paper, two protocols are presented for private intersection detection of moving objects’ trajectories. Assuming that the movement trajectory an object can be described by a time-dependent polynomial function, problem finding points is simplified to common roots corresponding polynomials. Thereafter, GrObner Basis used design novel secure protocol Another also designed based on distance ...

Recent research indicates that trust is important in helping users overcome perceptions of risk and uncertainty as well as promoting the acceptance of a specific technology. While prior studies have investigated different underlying bases of trust, little research has empirically tested all bases in one comprehensive model and evaluated the relative effect of various bases on subsequent trustin...

Information technology both facilitates and exacerbates the need for organizations to manage growing information and knowledge bases. Soon, the only successful enterprises may be the ones who have successfully evolved into learning organizations. The philosophical bases underlying traditional decision support systems (DSS) are ill equipped to handle this explosion of information, today’s rapidl...

In 1992, V. Weispfenning proved the existence of Comprehensive Gröbner Bases (CGB) and gave an algorithm for computing one. That algorithm was not very efficient and not canonical. Using his suggestions, A. Montes obtained in 2002 a more efficient algorithm (DISPGB) for Discussing Parametric Gröbner Bases. Inspired by its philosophy, V. Weispfenning defined, in 2002, how to obtain a Canonical C...

In 1992, V. Weispfenning proved the existence of Comprehensive Gröbner Bases (CGB) and gave an algorithm to compute one. That algorithm was not very efficient and not canonical. Using his suggestions, A. Montes obtained in 2002 a more efficient algorithm (DISPGB) for Discussing Parametric Gröbner Bases. Inspired in its philosophy, V. Weispfenning defined, in 2002, how to obtain a Canonical Comp...

G-Frames in Hilbert spaces are a redundant set of operators which yield a representation for each vector in the space. In this paper we investigate the connection between g-frames, g-orthonormal bases and g-Riesz bases. We show that a family of bounded operators is a g-Bessel sequences if and only if the Gram matrix associated to its denes a bounded operator.

Monomial ideals and toric rings are closely related. By consider a Grobner basis we can always associated to any ideal I in a polynomial ring a monomial ideal in≺I, in some special situations the monomial ideal in≺I is square free. On the other hand given any monomial ideal I of a polynomial ring S, we can define the toric K[I] ⊂ S. In this paper we will study toric rings defined by Segre embed...