Result-oriented services that provide mobility on demand seem to be a promising means of meeting both societal trends and environmental sustainability targets. In this paper, we investigate the contribution of Information Systems (IS) to drive this substantial business model change towards sustainable mobility from a customer’s perspective. While doing so, we focus on the specific case of carsh...

In the past few years, the European Commission has financed several projects to examine how new technologies could improve the sustainability of European cities. These technologies concern new public transportation modes such as guided buses to form high capacity networks similar to light rail but at a lower cost and better flexibility, PRT (Personal Rapid Transit) and cybercars (small urban ve...

We give a scheme for loss tolerantly building a linear optical quantum memory which itself is tolerant to qubit loss. We use the encoding recently introduced in [1] and give a method for efficiently achieving this. The entire approach resides within the “one-way” model for quantum computing [2]. Our results suggest that it is possible to build a loss tolerant quantum memory, such that if the re...

In this paper, a three-way microvalve system composed of three independent one-way valve units is presented. Each valve unit has a membrane, which is actuated by external negative air pressure. Intervals between the valve units are smaller than 780 μm, which opens up the possibility of realizing a high-density microvalve array. The small intervals were realized by providing the system with a la...

Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build a UOWHF which compresses by εn bits, at the cost of εn invocations of the one-way permutation. We show that this construction is not far from optimal, in the following sense: there exists an oracle relative to which t...

Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build a UOWHF which compresses by "n bits, at the cost of "n invocations of the one-way permutation. We show that this construction is not far from optimal, in the following sense: there exists an oracle relative to which t...

M. S. Tame,1, 2, ∗ B. A. Bell,3 C. Di Franco,4 W. J. Wadsworth,5 and J. G. Rarity3 1University of KwaZulu-Natal, School of Chemistry and Physics, 4001 Durban, South Africa 2National Institute for Theoretical Physics, University of KwaZulu-Natal,Durban 4001, South Africa 3Photonics Group, Department of Electrical and Electronic Engineering, University of Bristol, Merchant Venturers Building, Woo...

This paper presents the Generalized Randomized Iterate of a (regular) one-way function f and show that it can be used to build Universal One-Way Hash Function (UOWHF) families with O(n) key length. We then show that Shoup’s technique for UOWHF domain extension can be used to improve the efficiency of the previous construction. We present the Reusable Generalized Randomized Iterate which consist...

Present day's efforts for building up an operative quantum computer soon will take shape. One of the main challenges to this task is to implement qubit coherence in a practical way. We make emphasis on the structure of the nuclear qubits in a one-way quantum computer as a source of coherence enhancement. The form factor, accounting for the nuclear qubit structure of the model, is the magnetogyr...

This study was an attempt to investigate what metacognitive strategies are specifically employed by English learners when it comes to different speaking task types.60 students at advanced level (female) were randomly selected and given an OPT as a test of homogeneity. They were assigned to experimental and control groups. The MS questionnaire (Oxford, 1990) was also administered to see what MS ...