With the recent advancements in mobile technology and wireless communication like Bluetooth conne... more With the recent advancements in mobile technology and wireless communication like Bluetooth connectivity and Wi-Fi, accessing web services from mobile devices has become a focal point of research. Due to limitation of resource capabilities in mobile devices, however they are not always capable of consuming web services or web applications that are available on the Internet. This paper presents a middleware-based architecture that could be integrated into GSM network for discovery and invocation of Web Services from heterogeneous mobile devices. Our proposed middleware detects a new mobile device when it enters in its coverage area, authenticates it and then advertises the available services. The mobile device can then invoke any of the discovered services dynamically. This paper shows how the middleware makes different sorts of connection like Bluetooth connection with Bluetooth-enabled device, socket connection with Wi-Fi-enabled device and GPRS connection with a device when it is ...
Keywords: Content-based image retrieval, high curvature points, fuzzy feature evaluation index, c... more Keywords: Content-based image retrieval, high curvature points, fuzzy feature evaluation index, color, invariant moments. This paper proposes a new image retrieval scheme using visually significant features. Clusters of points around significant curvature regions (high, medium, weak type) are extracted to obtain a representative image. Illumination, viewpoint invariant color features are computed from those points for evaluating similarity between images. Relative importance of the features are evaluated using a fuzzy entropy based measure computed from relevant and irrelevant set of the retrieved images marked by the users. The performance of the system is tested using different set of examples from general purpose image database. Robustness of the system has also been shown when the images have undergone different transformations. 1
1993 Euromicro Workshop on Parallel and Distributed Processing
A communication structure for a binary n-cube is proposed, which consists of hierarchically order... more A communication structure for a binary n-cube is proposed, which consists of hierarchically ordered virtual networks corresponding to the cube. It is shown that the structure is deadlock-free and can support adaptive and fault-tolerant routing strategies. The software as well as the hardware support required for implementing wormhole routing are discussed. The applicability of the method for networks like k-ary
Proceedings of the Fifth Distributed Memory Computing Conference, 1990.
A unidirectional loop of message passing computers may be made deadlock-free by incorporating cer... more A unidirectional loop of message passing computers may be made deadlock-free by incorporating certain constraints. The present paper proposes a method for synthesizing a deadlock-free communicating kernel using the loop as the basic structure. The solution provides all the possible minimum distance paths between any two nodes of a binary n-cube. A minimum redundancy communicating structure for the hypercube is
With the recent advancements in mobile technology and wireless communication like Bluetooth conne... more With the recent advancements in mobile technology and wireless communication like Bluetooth connectivity and Wi-Fi, accessing web services from mobile devices has become a focal point of research. Due to limitation of resource capabilities in mobile devices, however they are not always capable of consuming web services or web applications that are available on the Internet. This paper presents a middleware-based architecture that could be integrated into GSM network for discovery and invocation of Web Services from heterogeneous mobile devices. Our proposed middleware detects a new mobile device when it enters in its coverage area, authenticates it and then advertises the available services. The mobile device can then invoke any of the discovered services dynamically. This paper shows how the middleware makes different sorts of connection like Bluetooth connection with Bluetooth-enabled device, socket connection with Wi-Fi-enabled device and GPRS connection with a device when it is ...
Keywords: Content-based image retrieval, high curvature points, fuzzy feature evaluation index, c... more Keywords: Content-based image retrieval, high curvature points, fuzzy feature evaluation index, color, invariant moments. This paper proposes a new image retrieval scheme using visually significant features. Clusters of points around significant curvature regions (high, medium, weak type) are extracted to obtain a representative image. Illumination, viewpoint invariant color features are computed from those points for evaluating similarity between images. Relative importance of the features are evaluated using a fuzzy entropy based measure computed from relevant and irrelevant set of the retrieved images marked by the users. The performance of the system is tested using different set of examples from general purpose image database. Robustness of the system has also been shown when the images have undergone different transformations. 1
1993 Euromicro Workshop on Parallel and Distributed Processing
A communication structure for a binary n-cube is proposed, which consists of hierarchically order... more A communication structure for a binary n-cube is proposed, which consists of hierarchically ordered virtual networks corresponding to the cube. It is shown that the structure is deadlock-free and can support adaptive and fault-tolerant routing strategies. The software as well as the hardware support required for implementing wormhole routing are discussed. The applicability of the method for networks like k-ary
Proceedings of the Fifth Distributed Memory Computing Conference, 1990.
A unidirectional loop of message passing computers may be made deadlock-free by incorporating cer... more A unidirectional loop of message passing computers may be made deadlock-free by incorporating certain constraints. The present paper proposes a method for synthesizing a deadlock-free communicating kernel using the loop as the basic structure. The solution provides all the possible minimum distance paths between any two nodes of a binary n-cube. A minimum redundancy communicating structure for the hypercube is
Uploads
Papers by Pradip Das