One of the basic requirements of service providers is to deliver fast processing, highly available, scalable, redundant and unobtrusive AAA services. In this paper we present incorporation of Diameter service into a legacy switching system. Our approach is based on a component architecture and the use of open source software to speed-up the development cycle. The main idea is to multiply critic...

To date, the tightest upper and lower-bounds for the active learning of general concept classes have been in terms of a parameter of the learning problem called the splitting index. We provide, for the first time, an efficient algorithm that is able to realize this upper bound, and we empirically demonstrate its good performance.

The Extensible Authentication Protocol (EAP) provides a standard mechanism for support of various authentication methods. This document defines the Command-Codes and AVPs necessary for a Diameter Hiller & Zorn [Page 1] INTERNET-DRAFT Diameter EAP Application June 2002 node to support the PPP Extensible Authentication Protocol (EAP). 1. Conventions used in this document The key words "MUST", "MU...

In a generalized Maker-Breaker positional game, Maker and Breaker play in turns. Maker makes a moves in each turn and Breaker makes b moves in each turn. We choose Maker to be the first player, although this nearly always makes no difference in the outcome of the game. We call such games (a : b)-games. If a = b, the game is fair, otherwise it is biased. If a = b > 1, the game is accelerated. In...

We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is restricted to a continues region (Imprecise model) or a finite set of points (Indecisive model). Given a set of inexact points in one of Imprecise or Indecisive models, we wish to provide a lower-bound on the diameter...