Telecommunications is increasingly vital to the society at large, and has become essential to business, academic, as well as social activities. Due to the necessity to have access to telecommunications, the deployment requires regulations and policy. Otherwise, the deployment of the infrastructures would contribute to environment, and human complexities rather than ease of use. However, the for...

Watkins has conjectured that if R is the rank of the group of rational points of an elliptic curve E over the rationals, then 2 divides the modular parametrisation degree. We show, for a certain class of E, chosen to make things as easy as possible, that this divisibility would follow from the statement that a certain 2adic deformation ring is isomorphic to a certain Hecke ring, and is a comple...

This paper outlines the operational concepts of recently proposed Interleaved Division Multiple Access (IDMA) scheme. Some interesting features of Interleaved Division Multiple Access (IDMA) over conventional Code Division Multiple Access (CDMA) are explained including its performance, simple receiver structure as well as spectral efficiency. The basic principle of IDMA is that interleaver is d...

Passports issued nowadays have an embedded RFID chip that carries digitally signed biometric information. Access to this chip is wireless, which introduces a security risk, in that an attacker could access a person’s passport without the owner knowing. While there are measures in place to prevent unauthorised access to the data in the passport, we show that it is easy to remotely detect the pre...

Transactions provide a useful programming paradigm for maintaining logical consistency, arbitrating concurrent access, and managing recovery. In traditional UNIX systems, the only easy way of using transactions is to purchase a database system. Such systems are often slow, costly, and may not provide the exact functionality desired. This paper presents the design, implementation, and performanc...

The debts’ clearing problem is about clearing all the debts in a group of n entities (eg. persons, companies) using a minimal number of money transaction operations. In a previous paper we conjectured the problem to be NP-complete. In this paper we prove that it is NP-hard in the strong sense and also NP-easy. We also show the same results for a restricted version of the problem.

To facilitate the implementation of workflows, enterprise and workflow system vendors typically provide sets of workflow templates for their software. Each of these templates depicts a variant of how a particular business process can be supported by the software. The user of such a system can save the effort of creating the models and the links to system components from scratch by selecting and...

Access control is facing many challenges for information protection in ubiquitous and cloud computing. In particularly, dynamic access control is a central problem that contexts are ever-changing in volatile interactive applications. This paper proposes a model for privacy preserving which is a CA5W1HOnto-based dynamic access control that model makes use of the ontological concept using 5W1H to...