MIMS: Mobile Interruption Management System

Mobile devices are increasing in an astronomical rate throughout the world. While it is bringing a lot of comfort to the users it is not coming without any hazards. Now a user is susceptible to mobile call interruptions wherever he is, whether he is in the middle of a very important discussion or in a very important task like performing a complicated emergency operation in a hospital. As a result researchers have been studying to find ways to minimize cost of mobile interruptions. In this thesis we have proposed a mobile interruption management system in which callers have been grouped and time intervals of a day have been classified to ascertain whether a call should be allowed to ring, go silent or vibrate. We have also included presence of Bluetooth devices and applications the mobile user is using to decide if the user needs to be interrupted. We have undertaken a survey of mobile users to compare various models and select appropriate default parameter values like caller groups, time intervals, and inclusion of special days/events. We have proposed a matrix containing default values of cost of mobile interruption, which will be adjusted according to contexts the user is in and then this cost is compared with the threshold value. If the cost of receiving the call is less than the threshold value, then device sound profile is set to ring or vibrate otherwise it is set to silent. We have also evaluated our model with existing models and found the system performing well

Walcom:algorithms and computation

This book constitutes the proceedings of the 10th International Workshop on Algorithms and Computation, WALCOM 2016, held in Kathmandu, Nepal, in March 2016. The 27 full papers presented together with 4 invited talks were carefully reviewed and selected from 68 submissions. The papers cover a wide range of topics such as approximation algorithms, computational complexity, computational geometry, data structures, graph algorithms, graph coloring, graph exploration, and online algorithms

Special issue Journal "Graph algorithms and apllication"

This special issue of Journal of Graph Algorithms and Applications (JGAA) contains the full journal versions of a small selection of papers carefully cho- sen within the research works presented at the 10th International Workshop on Algorithms and Computation (WALCOM 2016) held at Asian Institute of Technology & Management in Kathmandu, Nepal, from March 29th to March 31th, 2016. The proceedings of WALCOM 2016, Volume 5942 of Lecture Notes in Computer Science published by Springer in 2016, contain 27 contributions ac- cepted after a rigorous review process out of 68 submissions from 170 different authors of 21 different countries. Indeed WALCOM, a fully refereed confer- ence for theoretical computer science research in Asia, has proposed itself to be strengthening tieing between local and international scientific communities. Selected for their quality, only 7 papers have been chosen from the 27 pub- lished in the Proceedings and, following the tradition of the previous events of WALCOM, the papers in this special issue have been carefully rewritten and expanded compared to the conference papers. The journal versions of the pa- pers have been fully refereed following the high standards of the JGAA. We would like to thank all the colleagues who contributed to this special issue. In particular, we wish to thank the authors for contributing with their works and the reviewers for volunteering their time to review the papers. We sincerely hope that this issue will provide an interesting and thought-provoking reading for the readership of this journal

An Improved Degree Based Condition for Hamiltonian Cycles

A Hamiltonian cycle is a closed path through all the vertices of a graph. Since discovering whether a graph has a Hamiltonian path or a Hamiltonian cycle are both NP-complete problems, researchers concentrated on formulating sufficient conditions that ensure Hamiltonicity of a graph. A recent paper [Rahman M. Sohel and Kaykobad M., “On Hamiltonian Cycles and Hamiltonian Paths”, Information Processing Letters 94(2005), 37-51] presents distance based sufficient conditions for the existence of a Hamiltonian path. In this paper we establish that the same condition forces Hamiltonian cycle to be present excepting for the case where end points of a Hamiltonian path is at a distance greater than 2

Additional file 1 of Gene selection for cancer classification with the help of bees

Gene Selection for Cancer Classification With the Help of Bees. The supplementary file is available in the link: https://goo.gl/APTj0n . (PDF 417 kb

Technical section Drawing lines by uniform packing

In this paper, we introduce a new approach to line drawing that attempts to maintain a uniform packing density of horizontal segments to diagonal segments throughout the line. While the conventional line drawing algorithms perform linear time computations to find the location of the pixels, our algorithm takes logarithmic time. Also, experimental results show that the quality of line is acceptable and comparable to the well-known Bresenham’s line-drawing algorithm