Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506
Browse
15 results
Search Results
Item Virtual medical board: A distributed Bayesian agent based approach(Knowledge Systems Institute Graduate School office@ksi.edu, 2013) Dutta, A.; Acharya, S.; Krishna, A.; Bhattacharya, S.Distributed Decision Making has become of increasing importance to get solution of different real life problems. Application of agent and multi agent system in this Distributed Decision Support System is an evolving paradigm. One of such real life problem is medical board formation. But always formation of a medical board with a group of expert physicians may not be always possible due to lack of infrastructure, availability, time etc. In these situations the role of multi agent based distributed decision making can comes into play. In this paper we develop a Virtual Medical Board System in which a number of software agents (expert agents) act as a group of expert physicians with knowledge base(KB), reasoning capability. They coordinate with each other to diagnose a patient. © © 2013 by Knowledge Systems Institute Graduate School.Item Data reduction by removal of lurkers in OSN(2013) Sumith, S.; Annappa, B.; Bhattacharya, S.With the advent of internet, online social network is seen as playing a very important role in connecting people and a platform to share ideas. In the current scenario, given restriction on resources available for advertisement, the best place to sell one's product would definitely be these online social networks. The popularity of social network has influenced the computer researchers to ponder on the question on who are the people playing vital roles in information spread. This paper reviews the state of art work done previously in estimation of influence in Online Social Network(OSN) and proposes an innovative idea to improve the existing influence estimation algorithm in terms of search space and runtime. © 2013 IEEE.Item Modeling and analysis of deadlock driven dynamic priority scheduling(2013) Hazra, R.; Kanjilal, A.; Dey, S.; Bhattacharya, S.Specifying and designing Real Time Software Systems (RTSS) is a complex matter, because it requires logical correctness as well as timing correctness. Unified Modeling Language (UML), the standard visual object-oriented modeling language, is suitable to deal with this complexity. In RTSS, scheduling of tasks with hard deadlines has been an important area of research in today's life. In this paper a model is developed using UML 2.0 to highlight the deadlock occurrence as a drawback of Priority Inheritance Protocol (PIP). Further an improved model has been developed to prevent deadlock using the Stack Based Preemption Ceiling Protocol (SBPCP). © 2013 IEEE.Item Synthesis and studies on microhardness of alkali zinc borate glasses(American Institute of Physics Inc. subs@aip.org, 2014) Subhashini, u.; Bhattacharya, S.; Shashikala, H.D.; Udayashankar, N.K.The mixed alkali effect on zinc borate glasses have been reported. The glass systems of nominal composition 10Zn+xLi2O+yNa2O+80B2O3 (x = y = 0, 5, 10, 15 mol%) were prepared using standard melt quenching method. The structural, physical and mechanical properties of the samples have been studied using X-ray diffraction(XRD), density measurement and Vickers hardness measurement, respectively. A consistent increase in the density was observed, which explains the role of the modifiers (Li2O and Na2O) in the network modification of borate structure. The molar volume is decreasing linearly with the alkali concentration, which is attributed to the conversion of tetrahedral boron (BO4/2)- into (BO3/2)-. The microhardness studies reveals the anisotropy nature of the material. It further confirms that the samples belong to hard glass category. © 2014 AIP Publishing LLC.Item Enhanced back-off technique for IEEE 802.15.4 WSN standard(Springer Verlag service@springer.de, 2014) Vutukuri, A.; Bhattacharya, S.; Raj, T.; Sridhar; Geetha, V.IEEE 802.15.4 is the standard for Low-rate Wireless Personal Area Networks. The CSMA-CA algorithm used in the standard for channel contention causes performance bottlenecks in certain scenarios. We have conducted a performance evaluation of the back-off algorithm with the help of simulations on star networks and identified two parameters which affect the performance of the algorithm - macMinBE and macMaxBE. Further, we have also proposed an enhanced algorithm which involves these two parameters and improves the performance of the back-off algorithm. © 2014 Springer International Publishing Switzerland.Item A dynamic approach to frequent flyer program(Springer Verlag service@springer.de, 2014) Veeraraghavan, R.; Kashyap, R.; Chopde, A.; Bhattacharya, S.The frequent flyer algorithms adopted are static in nature, that is the points awarded to a frequent flyer is proportional only to the miles traveled. In static approach, there is neither an incentive for the frequent flyer to travel more (increase profitability) nor does it ensure customer satisfaction. In this paper, we propose a dynamic approach that considers time varying factors such as competition from rival airliners, number of travels made so far, load factor etc and prove that it can not only improve profitability but at the same time ensure customer satisfaction. © 2014 Springer International Publishing Switzerland.Item Discount heuristics and heterogeneous probabilities for optimal influence in social networks(Institute of Electrical and Electronics Engineers Inc., 2014) Sivasailam, K.; Sebastian, V.K.; Jacob, D.M.; Bhattacharya, S.Given a graph 'G', Influence Maximization is the problem of finding a subset of nodes of size 'k' that would maximize the spread of influence in G. This problem has applications in viral marketing studies and spread of information through 'word of mouth'. The problem, as defined by Domingos and Richardson, can be stated as follows: If we can give a product to a small subset of the population such that these people will convince the most number of people to adopt the product in the future, which subset would we choose? Discount heuristics provide great computational speed up in comparison to the traditional greedy algorithm, which runs for hours for networks with tens of thousands of nodes. In this work, we cite a perceived limitation in the degree discount heuristic for Influence maximization, and develop three new discount heuristics, namely Closeness discount, Betweenness discount and PageRank discount for comparison against the degree discount. We show that using degree discount heuristic still leads to the best seed set selection and hence show that the perceived limitation in the degree discount heuristic does not exist. In addition, we also show that PageRank discount beats Degree Discount in terms of Influence Spread when heterogeneous probabilities are used, thus showing that merely considering graph characteristics without taking into account other nodal properties is insufficient. © 2014 IEEE.Item Multi agent based railway scheduling and optimization(Institute of Electrical and Electronics Engineers Inc., 2015) Dalapati, P.; Singh, A.J.; Dutta, A.; Bhattacharya, S.This paper proposes a multi agent based timetable scheduling algorithm for railway system which handles the in-between time delay of the newly introduced train. The delay management indeed optimizes the total journey time, hence increases the total utility of the whole railway system as well. Here we show that schedule generated by our proposed algorithm is the most optimized schedule. It is done by using the notion of DCOP(Distributed Constraint Optimization Problem), where we define some metric to analyze the system to achieve our goals. We use JADE(Java Agent DEvelopment Framework) platforms to simulate our work and test it using a small network. We also take a small case study to compare our proposed work with the existing one and the results are therefore presented. © 2014 IEEE.Item An adaptive, fault protected improvisation of ACO based MANET routing(Springer Verlag service@springer.de, 2016) Bhat, T.; Saha, G.; Abhishek, V.; Bhattacharya, S.In this study we introduce a bit-stuffed Universal addressing scheme which provides compatibility between nodes in a Manet with different addressing schemes without having to make any structural changes to packet formats.We also introduce a breadth first search inspired mechanism to choose a particular path based on forwarding load of the constituent path nodes which in turn reduces the problem of Network Partitioning prevalent in MANETs. We have backed our proposals with suitable experimental justifications. © Springer Science+Business Media Singapore 2016.Item Video tamper detection techniques based on DCT-SVD and multi-level SVD(Institute of Electrical and Electronics Engineers Inc., 2016) Dabhade, A.V.; Bhople, Y.J.; Chandrasekaran, K.; Bhattacharya, S.The videos are widely used nowadays for different purposes. But due to easily available software tools, it has become very easy to modify the videos. The videos sent from one end to other can be tampered maliciously in between. The frames in the video can be edited or the sequence of the frames can be altered or even some frames can be deleted, any such malicious alteration is possible. Thus it is very necessary to verify integrity of video data to ensure trustworthiness of the information content. In many cases, such as surveillance, medical, forensic investigations it is necessary to consider authenticity of the video. If there is any tampering in the video, it must be detected. Therefore, there is need to do some work for developing such tamper detection system so that information in a video can be verified. In this paper we propose mechanisms for detecting any such tampering in a video. © 2015 IEEE.