We present a GPU accelerated toolbox for shaping the light propagation through multimode fibre using a spatial light modulator (SLM). The light is modulated before being coupled to the proximal end of the fibre in order to achieve arbitrary light patterns at the distal end of the fibre. First, the toolbox optimises the acquisition time of the transformation matrix of the fibre by synchronous op...

In this paper we propose the usage of a framework combining standard deontic logic (SDL) and non-monotonic logic programming – deontic logic programs (DLP) – to represent and reason about normative systems.

Miyaji et.al proposed a fully functional(i.e., satisfying unforgeability, exculpability,anonymity, traceability, unlinkability, and revocability.) group signature over only known-order groups, that is based only on Discrete logarithm related assumptions, specifically, multiple DLP they proposed in the same paper [MU04]. In this paper, we point out their scheme and an improved scheme [ZZW05] do ...

A structured light system provides a dense sampling of 3D coordinates from visible surfaces in a scene. This paper compares several methods for determining the principle frame, Gaussian curvature, and mean curvature at each visible surface point from this data. The principle frame, etc, parameterize a model which completely characterizes the local surface geometry. Given the local surface model...

We present a generalization of the scalar importance function employed by Metropolis Light Transport (MLT) and related Markov chain rendering algorithms. Although MLT is known for its user-designable mutation rules, we demonstrate that its scalar contribution function is similarly programmable in an unbiased manner. Normally, MLT samples light paths with a tendency proportional to their brightn...

In this paper we propose a binary field variant of the Joux-Lercier medium-sized Function Field Sieve, which results not only in complexities as low as Lqn(1/3, 2/3) for computing arbitrary logarithms, but also in an heuristic polynomial time algorithm for finding the discrete logarithms of degree one elements. To illustrate the efficiency of the method, we have successfully solved the DLP in t...

In Sept. 1990, the present authors firstly discussed DLP over composite number and presented an ID-based Key Sharing Scheme referred to as MK1. In 1991, Maurer and Yacobi presented a scheme, referred to as MY, which is similar to our scheme, MK1. Unfortunately the schemes MK1 and MY are not secure. In Dec. 1990, the present authors presented a secure ID-based key sharing scheme referred to as M...

Goals are used to define the behavior of (pro-active) agents. It is our view that the goals of an agent can be seen as a knowledge base of the situations that it wants to achieve. It is therefore in a natural way that we use Dynamic Logic Programming (DLP), an extension of AnswerSet Programming that allows for the representation of knowledge that changes with time, to represent the goals of the...

We detail the development of deformable surface models to track nonrigid objects undergoing motion, using real time range data acquired from our sensor. The surface model for an object consists of B-spline tensor product patchs, augmented with a dynamic and measurement model. To maximise performance, careful consideration is made of where to make the next range measurements, based on the curren...

Gaudry and Schost gave a low-memory algorithm for solving the 2-dimensional discrete logarithm problem. We present an improvement to their algorithm and extend this improvement to the general multidimensional DLP. An important component of the algorithm is a multidimensional pseudorandom walk which we analyse thoroughly in the 1 and 2 dimensional cases as well as giving some discussion for high...