My private cloud--granting federated access to cloud resources

We describe the research undertaken in the six month JISC/EPSRC funded My Private Cloud project, in which we built a demonstration cloud file storage service that allows users to login to it, by using their existing credentials from a configured trusted identity provider. Once authenticated, users are shown a set of accounts that they are the owners of, based on their identity attributes. Once users open one of their accounts, they can upload and download files to it. Not only that, but they can then grant access to their file resources to anyone else in the federated system, regardless of whether their chosen delegate has used the cloud service before or not. The system uses standard identity management protocols, attribute based access controls, and a delegation service. A set of APIs have been defined for the authentication, authorisation and delegation processes, and the software has been released as open source to the community. A public demonstration of the system is available online

One Dimensional nnary Density Classification Using Two Cellular Automaton Rules

Suppose each site on a one-dimensional chain with periodic boundary condition may take on any one of the states $0,1,..., n-1$, can you find out the most frequently occurring state using cellular automaton? Here, we prove that while the above density classification task cannot be resolved by a single cellular automaton, this task can be performed efficiently by applying two cellular automaton rules in succession.Comment: Revtex, 4 pages, uses amsfont

Enabling the Autonomic Management of Federated Identity Providers

The autonomic management of federated authorization infrastructures (federations) is seen as a means for improving the monitoring and use of a service provider’s resources. However, federations are comprised of independent management domains with varying scopes of control and data ownership. The focus of this paper is on the autonomic management of federated identity providers by service providers located in other domains, when the identity providers have been diagnosed as the source of abuse. In particular, we describe how an autonomic controller, external to the domain of the identity provider, exercises control over the issuing of privilege attributes. The paper presents a conceptual design and implementation of an effector for an identity provider that is capable of enabling cross-domain autonomic management. The implementation of an effector for a SimpleSAMLphp identity provider is evaluated by demonstrating how an autonomic controller, together with the effector, is capable of responding to malicious abuse

Low-momentum ring diagrams of neutron matter at and near the unitary limit

We study neutron matter at and near the unitary limit using a low-momentum ring diagram approach. By slightly tuning the meson-exchange CD-Bonn potential, neutron-neutron potentials with various $^1S_0$ scattering lengths such as $a_s=-12070fm$ and $+21fm$ are constructed. Such potentials are renormalized with rigorous procedures to give the corresponding $a_s$-equivalent low-momentum potentials $V_{low-k}$, with which the low-momentum particle-particle hole-hole ring diagrams are summed up to all orders, giving the ground state energy $E_0$ of neutron matter for various scattering lengths. At the limit of $a_s\to \pm \infty$, our calculated ratio of $E_0$ to that of the non-interacting case is found remarkably close to a constant of 0.44 over a wide range of Fermi-momenta. This result reveals an universality that is well consistent with the recent experimental and Monte-Carlo computational study on low-density cold Fermi gas at the unitary limit. The overall behavior of this ratio obtained with various scattering lengths is presented and discussed. Ring-diagram results obtained with $V_{low-k}$ and those with $G$-matrix interactions are compared.Comment: 9 pages, 7 figure

Speech enhancement using the constrained-optimization technique

Author name used in this publication: W. LiAuthor name used in this publication: W. C. SiuVersion of RecordPublishe

New approaches without postprocessing to FIR system identification using selected order cumulants

Version of RecordPublishe

On Linear Operator Channels over Finite Fields

Motivated by linear network coding, communication channels perform linear operation over finite fields, namely linear operator channels (LOCs), are studied in this paper. For such a channel, its output vector is a linear transform of its input vector, and the transformation matrix is randomly and independently generated. The transformation matrix is assumed to remain constant for every T input vectors and to be unknown to both the transmitter and the receiver. There are NO constraints on the distribution of the transformation matrix and the field size. Specifically, the optimality of subspace coding over LOCs is investigated. A lower bound on the maximum achievable rate of subspace coding is obtained and it is shown to be tight for some cases. The maximum achievable rate of constant-dimensional subspace coding is characterized and the loss of rate incurred by using constant-dimensional subspace coding is insignificant. The maximum achievable rate of channel training is close to the lower bound on the maximum achievable rate of subspace coding. Two coding approaches based on channel training are proposed and their performances are evaluated. Our first approach makes use of rank-metric codes and its optimality depends on the existence of maximum rank distance codes. Our second approach applies linear coding and it can achieve the maximum achievable rate of channel training. Our code designs require only the knowledge of the expectation of the rank of the transformation matrix. The second scheme can also be realized ratelessly without a priori knowledge of the channel statistics.Comment: 53 pages, 3 figures, submitted to IEEE Transaction on Information Theor

Finding The Sign Of A Function Value By Binary Cellular Automaton

Given a continuous function $f(x)$, suppose that the sign of $f$ only has finitely many discontinuous points in the interval $[0,1]$. We show how to use a sequence of one dimensional deterministic binary cellular automata to determine the sign of $f(\rho)$ where $\rho$ is the (number) density of 1s in an arbitrarily given bit string of finite length provided that $f$ satisfies certain technical conditions.Comment: Revtex, uses amsfonts, 10 page