<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Collection:</title>
  <link rel="alternate" href="http://repository.iiitd.edu.in/xmlui/handle/123456789/123" />
  <subtitle />
  <id>http://repository.iiitd.edu.in/xmlui/handle/123456789/123</id>
  <updated>2026-06-20T13:04:47Z</updated>
  <dc:date>2026-06-20T13:04:47Z</dc:date>
  <entry>
    <title>Perception of data privacy in digital forensic investigation</title>
    <link rel="alternate" href="http://repository.iiitd.edu.in/xmlui/handle/123456789/210" />
    <author>
      <name>Verma, Robin</name>
    </author>
    <author>
      <name>Gupta, Gaurav</name>
    </author>
    <id>http://repository.iiitd.edu.in/xmlui/handle/123456789/210</id>
    <updated>2017-07-24T17:15:35Z</updated>
    <published>2014-12-25T07:23:25Z</published>
    <summary type="text">Title: Perception of data privacy in digital forensic investigation
Authors: Verma, Robin; Gupta, Gaurav
Abstract: The use of digital technology in conventional as well as new age crimes is increasing throughout the world, and researchers are&#xD;
working to develop digital forensics techniques to investigate such crimes. Digital forensic investigation process requires the digital&#xD;
forensic investigator to manually examine the forensic image of the seized storage media. The investigator gets full access of all the&#xD;
data contained in the forensic image including the accused or the victim’s private or sensitive data that may be entirely unrelated&#xD;
to the given case. The unrestricted access on the seized media or its forensic image becomes a significant threat to the accused&#xD;
or the victim’s data privacy as the investigator can view or copy the data at will. There is no legal or technical infrastructure in&#xD;
place to stop such abuse. The paper presents a study containing three different surveys for the three stakeholders in the digital&#xD;
forensic investigation and aim to capture their perception of the accused or the victim’s data privacy. The surveys were circulated in&#xD;
India among the digital forensic investigators, cyber lawyers and the general public respectively. These surveys included questions&#xD;
related to the privacy of digital data present on the storage media during the course of digital forensic investigation and subsequent&#xD;
trial in court of law. The surveys collected 15, 10 and 1889 responses from participants of respective target audience classes. The&#xD;
responses show lack of professional ethics among investigators, lack of legal support for lawyers to protect data privacy during&#xD;
digital forensic investigation and confusion among the general public regarding their data privacy rights. The findings would help&#xD;
in justifying the need for privacy preserving digital forensic investigation framework that protect privacy during the digital forensic&#xD;
investigation process without compromising on efficiency and performance.</summary>
    <dc:date>2014-12-25T07:23:25Z</dc:date>
  </entry>
  <entry>
    <title>An smartphone-based algorithm to measure and model quantity of sleep</title>
    <link rel="alternate" href="http://repository.iiitd.edu.in/xmlui/handle/123456789/197" />
    <author>
      <name>Gautam, Alvika</name>
    </author>
    <author>
      <name>Naik, Vinayak</name>
    </author>
    <author>
      <name>Gupta, Archie</name>
    </author>
    <author>
      <name>Sharma, SK</name>
    </author>
    <id>http://repository.iiitd.edu.in/xmlui/handle/123456789/197</id>
    <updated>2017-07-24T17:15:09Z</updated>
    <published>2014-09-17T08:14:38Z</published>
    <summary type="text">Title: An smartphone-based algorithm to measure and model quantity of sleep
Authors: Gautam, Alvika; Naik, Vinayak; Gupta, Archie; Sharma, SK
Abstract: Sleep quantity affects an individual’s personal health.&#xD;
The gold standard of measuring sleep and diagnosing sleep&#xD;
disorders is Polysomnography (PSG). Although PSG is accurate,&#xD;
it is expensive and it lacks portability. A number of wearable&#xD;
devices with embedded sensors have emerged in the recent past&#xD;
as an alternative to PSG for regular sleep monitoring directly&#xD;
by the user. These devices are intrusive and cause discomfort&#xD;
besides being expensive. In this work, we present an algorithm&#xD;
to detect sleep using a smartphone with the help of its inbuilt&#xD;
accelerometer sensor. We present three different approaches to&#xD;
classify raw acceleration data into two states - Sleep and Wake. In&#xD;
the first approach, we take an equation from Kushida’s algorithm&#xD;
to process accelerometer data. Henceforth, we call it Kushida’s&#xD;
equation. While the second is based on statistical functions,&#xD;
the third is based on Hidden Markov Model (HMM) training.&#xD;
Although all the three approaches are suitable for a phone’s&#xD;
resources, each approach demands different amount of resources.&#xD;
While Kushida’s equation-based approach demands the least, the&#xD;
HMM training-based approach demands the maximum.&#xD;
We collected data from mobile phone’s accelerometer for four&#xD;
subjects for twelve days each. We compare accuracy of sleep&#xD;
detection using each of the three approaches with that of Zeo&#xD;
sensor, which is based on Electroencephalogram (EEG) sensor to&#xD;
detect sleep. EEG is an important modality in PSG. We find that&#xD;
HMM training-based approach is as much as 84% accurate. It is&#xD;
15% more accurate as compared to Kushida’s equation-based&#xD;
approach and 10% more accurate as compared to statistical&#xD;
method-based approach. In order to concisely represent the sleep&#xD;
quality of people, we model their sleep data using HMM. We&#xD;
present an analysis to find out a tradeoff between the amount&#xD;
of training data and the accuracy provided in the modeling&#xD;
of sleep. We find that six days of sleep data is sufficient for&#xD;
accurate modeling. We compare accuracy of our HMM trainingbased&#xD;
algorithm with a representative third party app SleepTime&#xD;
available from Google Play Store for Android. We find that the&#xD;
detection done using HMM approach is closer to that done by&#xD;
Zeo by 13% as compared to the third party Android application&#xD;
SleepTime. We show that our HMM training-based approach is&#xD;
efficient as it takes less than ten seconds to get executed on Moto&#xD;
G Android phone.</summary>
    <dc:date>2014-09-17T08:14:38Z</dc:date>
  </entry>
  <entry>
    <title>ACCORD : an analytical cache contention model using reuse distances for modern multiprocessors</title>
    <link rel="alternate" href="http://repository.iiitd.edu.in/xmlui/handle/123456789/196" />
    <author>
      <name>Hemani, Rakhi</name>
    </author>
    <author>
      <name>Banerjee, Subhasis</name>
    </author>
    <author>
      <name>Guha, Apala</name>
    </author>
    <id>http://repository.iiitd.edu.in/xmlui/handle/123456789/196</id>
    <updated>2017-07-24T17:15:45Z</updated>
    <published>2014-09-15T10:56:05Z</published>
    <summary type="text">Title: ACCORD : an analytical cache contention model using reuse distances for modern multiprocessors
Authors: Hemani, Rakhi; Banerjee, Subhasis; Guha, Apala
Abstract: Simultaneous execution of multiple threads on multicores&#xD;
is necessary for good resource utilization. However, such&#xD;
utilization calls for accurate models to predict the impact on&#xD;
performance due to contention of shared resources, primarily&#xD;
the last level cache and memory. The major challenges in&#xD;
developing such a model for commercial multicore machines&#xD;
are the unavailability of cache implementation details and the&#xD;
scalability of the performance prediction model for multiple&#xD;
threads. In this paper we propose a cache contention model&#xD;
addressing both these challenges. We leverage observed cache&#xD;
behaviour and reuse distance profile of applications for this&#xD;
purpose. We implement our model on a Xeon Sandy Bridge&#xD;
multicore and observe an RMS error of less than 0.06, for single&#xD;
threaded and multi-threaded workloads. Further we compare the&#xD;
effectiveness of using ACCORD model against the popular LRU&#xD;
Model and find that ACCORD is upto 2.7 times more accurate.</summary>
    <dc:date>2014-09-15T10:56:05Z</dc:date>
  </entry>
  <entry>
    <title>Consumer privacy and targeted pricing with stochastic valuations</title>
    <link rel="alternate" href="http://repository.iiitd.edu.in/xmlui/handle/123456789/160" />
    <author>
      <name>Mishra, Shreemoy</name>
    </author>
    <id>http://repository.iiitd.edu.in/xmlui/handle/123456789/160</id>
    <updated>2017-07-24T17:15:08Z</updated>
    <published>2014-07-16T11:30:00Z</published>
    <summary type="text">Title: Consumer privacy and targeted pricing with stochastic valuations
Authors: Mishra, Shreemoy
Abstract: I study the market for consumer information. Firms cannot commit to privacy, so buyers anticipate&#xD;
disclosure of purchase history for targeted pricing. In the literature, strategic rejections&#xD;
of informative o ers make purchase data worthless, which is paradoxical given the large investments&#xD;
in data analytics. I show that buyers' uncertainty regarding future preferences allows full&#xD;
separation of types, leading to valuable purchase data. Buyers of any given type are assumed&#xD;
to share similar expectations about the evolution of future valuations. Preference uncertainty&#xD;
generates consumer-to-consumer externalities, which is why strategic consumers are sometimes&#xD;
better o  when they remain unaware of targeted pricing. When preferences are transitory,  rms&#xD;
have an incentive to raise consumer awareness about targeted pricing.</summary>
    <dc:date>2014-07-16T11:30:00Z</dc:date>
  </entry>
</feed>

