A 3GPP open-ID framework

Currently Mobile Network Operators (MNO) rely on an authentication, authorization and profile management architecture which has proved, by its generalized use and acceptance, as being appropriate. The use of a secure component, the SIM-Card, provides a set of capabilities not seen in other access architectures and an advantage for MNOs. Nevertheless upcoming requirements in terms of open interfaces, new services and customer demands are questioning the actual architecture. This paper presents a novel approach to authentication and profile management that can be reused by both MNOs and 3rd party providers to answer the upcoming requirements. Here, a user is able to store his own identity information in different places, while taking advantage of the strong authentication mechanisms provided by the MNO. Furthermore, by integrating MNOs' generic authentication architecture with user-centric identity management, we are creating a generic way for service providers to reuse this authentication infrastructure, providing both single sign-on and strong authentication. Copyright © 2010 The authors

A Self-organizing and Self-configuration Algorithm for Resource Management in Service-oriented Systems

With the ever increasing deployment of service-oriented distributed systems in large-scale and heterogeneous computing environments, clustering and communication overlay topology design has become more and more important to address several challenging issues and conflicting requirements, such as efficient scheduling and distribution of services among computing resources, reducing communication cost between services, high performance service and resource discovery while considering both inter-service and inter-node properties and also increasing the load distribution and the load balance. In this paper, a four-stage hierarchical clustering algorithm is proposed which automates the process of the optimally composing communicating groups in a dynamic way while preserving the proximity of the nodes. The simulation results show the performance of the algorithm with respect to load balance, scalability and efficiency

Coherent State Path Integrals in the Weyl Representation

We construct a representation of the coherent state path integral using the Weyl symbol of the Hamiltonian operator. This representation is very different from the usual path integral forms suggested by Klauder and Skagerstan in \cite{Klau85}, which involve the normal or the antinormal ordering of the Hamiltonian. These different representations, although equivalent quantum mechanically, lead to different semiclassical limits. We show that the semiclassical limit of the coherent state propagator in Weyl representation is involves classical trajectories that are independent on the coherent states width. This propagator is also free from the phase corrections found in \cite{Bar01} for the two Klauder forms and provides an explicit connection between the Wigner and the Husimi representations of the evolution operator.Comment: 23 page

HARD: Hybrid Adaptive Resource Discovery for Jungle Computing

In recent years, Jungle Computing has emerged as a distributed computing paradigm based on simultaneous combination of various hierarchical and distributed computing environments which are composed by large number of heterogeneous resources. In such a computing environment, the resources and the underlying computation and communication infrastructures are highly-hierarchical and heterogeneous. This creates a lot of difficulty and complexity for finding the proper resources in a precise way in order to run a particular job on the system efficiently. This paper proposes Hybrid Adaptive Resource Discovery (HARD), a novel efficient and highly scalable resource-discovery approach which is built upon a virtual hierarchical overlay based on self-organization and self-adaptation of processing resources in the system, where the computing resources are organized into distributed hierarchies according to a proposed hierarchical multi-layered resource description model. The proposed approach supports distributed query processing within and across hierarchical layers by deploying various distributed resource discovery services and functionalities in the system which are implemented using different adapted algorithms and mechanisms in each level of hierarchy. The proposed approach addresses the requirements for resource discovery in Jungle Computing environments such as high-hierarchy, high-heterogeneity, high-scalability and dynamicity. Simulation results show significant scalability and efficiency of the proposed approach over highly heterogeneous, hierarchical and dynamic computing environments

Índice de Ecossistemas Fluviais (IEF): uma proposta para monitoramento da qualidade de ecossistemas fluviais no Brasil.

O habitat ciliar desempenha um papel fundamental na determinação da saúde geral dos ecossistemas aquáticos . A análise dest e ecossistema em conjunto com os dados de análise s hidrológicas e geomorfoló gi c a s do canal nos permite avaliar e monitorar os ecossistemas fluviais . O objetivo do presente trabalho é descrever o desenvolvimento de um índice de monitoramento de ecossistemas fluviais que pode ser utilizado em campo com a análise de características quantitativas (composição química) e qualitativas ( análise visual do estado hidromorfológico e ecológico ) . O índice foi aplicado na caracterização de duas bacias hidrográficas na região de Ponta Grossa, no Paraná , e foi bastante eficiente como forma de avaliação primária . O índice IEF pode ser considerado uma ferramenta importante p ara gestores e pesquisadores que não possuem recursos para monitor amento de ecossistemas fluviais , para avaliação de bacias hidrográficas, a partir d as condições da vegetação ripá ria (seção 1) e do canal (seção 2)

A Specification-based Anycast Scheme for Scalable Resource Discovery in Distributed Systems

Anycast is a powerful paradigm for managing and locating resources in large scale distributed computing systems. This paper presents a novel specification-based anycasting scheme for resource discovery in such environments. The effectiveness of our proposal is demonstrated through simulation results, in which we observed a remarkable performance enhancement in different aspects (such as discovery latency, discovery cost, discovery load, etc.) over similar non-anycast based discovery methods

Dynamic noise, chaos and parameter estimation in population biology

We revisit the parameter estimation framework for population biological dynamical systems, and apply it to calibrate various models in epidemiology with empirical time series, namely influenza and dengue fever. When it comes to more complex models such as multi-strain dynamics to describe the virus–host interaction in dengue fever, even the most recently developed parameter estimation techniques, such as maximum likelihood iterated filtering, reach their computational limits. However, the first results of parameter estimation with data on dengue fever from Thailand indicate a subtle interplay between stochasticity and the deterministic skeleton. The deterministic system on its own already displays complex dynamics up to deterministic chaos and coexistence of multiple attractors

Geometric combinatorial algebras: cyclohedron and simplex

In this paper we report on results of our investigation into the algebraic structure supported by the combinatorial geometry of the cyclohedron. Our new graded algebra structures lie between two well known Hopf algebras: the Malvenuto-Reutenauer algebra of permutations and the Loday-Ronco algebra of binary trees. Connecting algebra maps arise from a new generalization of the Tonks projection from the permutohedron to the associahedron, which we discover via the viewpoint of the graph associahedra of Carr and Devadoss. At the same time that viewpoint allows exciting geometrical insights into the multiplicative structure of the algebras involved. Extending the Tonks projection also reveals a new graded algebra structure on the simplices. Finally this latter is extended to a new graded Hopf algebra (one-sided) with basis all the faces of the simplices.Comment: 23 figures, new expanded section about Hopf algebra of simplices, with journal correction