Wan Ainun Mior Othman

The dual basis functions for the generalized Ball basis of odd degree

Abstract An explicit formula for the dual basis functions to the generalized Ball basis of odd degree is derived by applying an extension of Marsdens identity. These dual functionals are then used to derive both a change of basis formula from the Bezier basis to the generalized Ball basis and a subdivision formula for the generalized Ball curves.

Encounter based fuzzy logic routing in delay tolerant networks

Abstract Delay tolerant networks (DTNs) are a newest class of networks that have the ability to provide connectivity to areas that are yet to be served by conventional networks. Routing in DTN is a tough task because nodes have no prior information about the partitioned network and transfer opportunities between peer nodes are limited. A node in a DTN delivers messages to the destination using the store and forward strategy. Messages are transmitted to multiple intermediate relay nodes encountered in order to increase the opportunity for the message to reach the destination. Encounter duration is the time period in which a pair or more mobile nodes move into the communication range of each other and hence are able to transfer messages between them. Since the node movements are arbitrary, the encounter duration is unpredictable. This research work proposes a novel encounter based fuzzy logic routing (EFLR) scheme to maximize message delivery with reduced overhead. The fuzzy based utility computation is used for finding a better node to forward messages as well as to drop messages from buffer. Simulation results reveal that EFLR performs better than other existing DTN routing protocols.

Phase-sensitive collective atomic inversion with the inclusion of dipole-dipole interaction

Abstract It is shown that the static dipole-dipole interaction influences the steady-state collective mean atomic inversion for two-atom resonance fluorescence in a broadband squeezed vacuum.

Classification of Totally Umbilical CR-Statistical Submanifolds in Holomorphic Statistical Manifolds with Constant Holomorphic Curvature

In 1985, Amari [1] introduced an interesting manifold, i.e., statistical manifold in the context of information geometry. The geometry of such manifolds includes the notion of dual connections, called conjugate connections in affine geometry, it is closely related to affine geometry. A statistical structure is a generalization of a Hessian one, it connects Hessian geometry.

Geometric aspects of CR-warped product submanifolds of T-manifolds

In this paper, we study CR-warped product submanifolds of T-manifolds. We prove that the CR-warped product submanifolds with invariant fiber are trivial warped products and provide a characterizati...

Composite order bilinear pairing on elliptic curve for dual system encryption

In this paper, we explore the pairing-based cryptography on elliptic curve. The security of protocols using composite order bilinear pairing on elliptic curve depends on the difficulty of factoring the number N. Here, we show how to construct composite ordinary pairing-friendly elliptic curve having the subgroup of composite order N by using Cocks-Pinch Method. We also introduce dual system encryption to transform Identity-Based Encryption (IBE) scheme built over prime-order bilinear, to composite order bilinear groups. The new Identity-Based Encryption (IBE) is secured since it uses the Dual System Encryption methodology which guaranteed full security of the new IBE system.

Prime Factorization without Using Any Approximations

Factoring number is a non-trivial operation, and that fact is the source of a lot of cryptographic algorithms. Many cryptosystems are based on the factorization of large integers. In this paper, factorization algorithm based on number theory is proposed and get the exact prime factorization without any approximations. The major advantages of the proposed method are listed and the disadvantages of the existing factorization algorithm based on square root approximation are highlighted. The time complexity of the proposed method is less because there is no recursive steps in this proposed algorithm.