Showing papers by "SDM College of Engineering and Technology published in 2010"

Modeling user context for Interactive Context Aware TV

Abstract: With the advent of ubiquitous computing environments it has become increasingly important for applications to take full advantage of Context aware computing to increase the satisfaction of the users in entertainment services. The contextual information, such as, environmental, social, task, Spatio-temporal and personal information has to be considered to offer greater services to the user without any explicit requests and to resolve conflict among multiple users. Also with the increasing amount of research on Interactive Context Aware TVs, users are interacting with them in an evermore convenient way. An efficient model for representing and capturing context for Interactive Context Aware TV is required. In this paper, we are presenting a model to define and represent Context in the user perspective for Interactive Context aware TV. The proposed Model is applicable to both single and multiuser environments.

Interactive Democratic Group Preference Algorithm for Interactive Context Aware TV

Abstract: With the advent of ubiquitous computing environments it has become increasingly important for applications to take full advantage of Context aware computing to increase the satisfaction of the users in entertainment services The contextual information, such as, user location, user's profile, user interest, user role, user age, etc has to be considered to offer greater services to the user without any explicit requests and to resolve conflict among multiple user In this paper, we propose a group aware TV Program recommendation algorithm for multiple viewers of a digital TV that rates and selects TV programs based on group preferences The motto of this paper is to enable context aware applications to offer services to multiple users by resolving service conflicts among users if any and hence by increasing the satisfaction of the users

A criterion for (non-)planarity of the transformation graph Gxyz when xyz = – + +

Abstract: The transformation graph G –++ of G is the graph with vertex set V(G) ∪ E(G) in which the vertex x and y are joined by an edge if one of the following conditions holds: (i) x, y ∈ V(G) and x and y are not adjacent in G, (ii) x, y ∈ E(G) and x and y are adjacent in G, (iii) one of x and y is in V(G) and the other is in E(G), and they are incident in G. In this paper we present characterizations of graphs whose transformation graphs G –++ are eulerian, outerplanar, maximal outerplanar or minimally nonouterplanar. Further we establish a necessary and sufficient condition for the transformation graphs G –++ to have crossing number one or two.

Modeling of coverage preserving algorithm using object oriented methodology with UML

Abstract: Visual sensor network collect visual data, which are rich in information and hence offer tremendous potential for many applications such as automated surveillance and traffic monitoring. Hence it is necessary to design scalable network architecture to support several heterogeneous and independent applications. The angle coverage problem aims to identify a set of sensors that preserve all the angles of view of the object while fulfilling the image resolution requirement. In order to save transmission energy, the number of images to be sent should be minimized. A coverage preserving algorithm will be developed with the help of coverage cost metrics to identify the cluster head from a set of sensors to ensure balanced energy consumption. The Unified Modeling Language (UML) is the most widely known and used notation for object oriented analysis and design. UML diagrams presented in the paper with the help Visual Paradigm, helps to design and implement the coverage problem.

Efficiency of FEC coding in IP networks

Abstract: We propose a model-based analytic approach for evaluating the overall efficiency of Forward Error Correction (FEC) coding combined with interleaving in combating packet losses in IP networks. The loss of various packets during the data transmission can be reduced by using FEC coding. This unified approach provides an integrated framework for exploring the tradeoffs between the key coding parameters such as interleaving depths, channel coding rates and block lengths. The Reed-Solomon codes facilitate the selection of optimal coding strategy used for text based and multimedia applications with various user Quality-of-Service (QoS) requirements and system constraints. In this paper, we have evaluated the efficiency of FEC coding with interleaving in IP networks and observed that 99% of efficiency of error correction in the network.