Biometrics and Bioinformatics

B. Divya ¹, V. Divya ¹, K. Hari Priya ², P. Jeevitha ¹, J. Dhanasekar ³

Affiliations
1 Department of ECE, Sri Eshwar College of Engineering, Kinathukadavu, IN
2 Department of ECE, Sri Eshwar College of Engineering, Kinathukadavu, IN
3 Department of ECE, Sri Eshwar College of Engineering, IN

Abstract

This paper describes the development of a heart rate monitor system based on a microcontroller. It offers the advantage of portability over tape-based recording systems. The paper explains how a single- chip microcontroller can be used to analyze heart beat rate signals in real-time. In addition, it allows doctors to get the heart beat rate file of the patient by e-mail every twenty four hours. It can also be used to control patients or athletic person over a long period. The system reads, stores and analyses the heart beat rate signals repetitively in real-time. The hardware and software design are oriented towards a single-chip microcontroller-based system, hence minimizing the size. The important feature of this paper is the use of zero crossing algorithms to compute heart rate. It then processes on real-time the information to determine some heart diseases.

Keywords

Microsystems, Microcontroller, Real-Time, Heart Rate Monitoring, Zero Crossing Algorithm.

Full Text

     

S. Priya ¹, A. Priya ¹, V. Divya ¹

Affiliations
1 GKM College of Engineering and Technology, Chennai, IN

Abstract

Search engines play a crucial role in the navigation through the vastness of the web. Today‟s search engines do not just collect and index web pages, they also collect and mine information about their users. They store the queries, clicks, IP-addresses, and other information about the interactions with users in what is called a search log. In this paper, we analyze algorithms for publishing frequent keywords, queries, and clicks of a search log. We first show how methods that achieve variants of k-anonymity are vulnerable to active attacks. We then propose an algorithm ZEALOUS and show how to set its parameters to achieve probabilistic privacy. We also contrast our analysis of ZEALOUS with an analysis by Korolova et al. [17] that achieves in-distinguishability. Our paper concludes with a large experimental study using real applications where we compare ZEALOUS and previous work that achieves k-anonymity in search log publishing. Our results show that zealous yields comparable utility to k-anonymity while at the same time achieving much stronger privacy guarantees and also can be applied more generally to the problem of publishing frequent items or item sets. A topic of future work is the development of algorithms to release useful information about infrequent keywords, queries, and clicks in a search log while preserving user privacy.

Keywords

Security, Integrity, and Protection, General, Database Management, Information Technology and Systems, Web Search, General, Information Storage and Retrieval, Information Technology and Systems.

Full Text