<?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://localhost:8081/jspui/handle/123456789/15074" />
  <subtitle />
  <id>http://localhost:8081/jspui/handle/123456789/15074</id>
  <updated>2025-07-03T20:33:31Z</updated>
  <dc:date>2025-07-03T20:33:31Z</dc:date>
  <entry>
    <title>LEARNING DYNAMIC PROPERTIES OF AN ENVIRONMENT USING MULTIPLE AGENTS</title>
    <link rel="alternate" href="http://localhost:8081/jspui/handle/123456789/15324" />
    <author>
      <name>Thukral, Kapil</name>
    </author>
    <id>http://localhost:8081/jspui/handle/123456789/15324</id>
    <updated>2022-02-07T10:17:36Z</updated>
    <published>2019-09-01T00:00:00Z</published>
    <summary type="text">Title: LEARNING DYNAMIC PROPERTIES OF AN ENVIRONMENT USING MULTIPLE AGENTS
Authors: Thukral, Kapil
Abstract: If we place an agent in an environment and leave it to the agents to learn the map of the envi-&#xD;
ronment, then there are many ways to learn the static topological/metric map of the environment,&#xD;
the problem considered in this thesis is to incorporate the discovering of timely patterns of changes&#xD;
getting introduced in the map of the environment.&#xD;
But the environment keeps changing in the real world, for example, in an organization the gates&#xD;
closes and opens at particular timings , resulting in path obstruction and path opening and if we&#xD;
can learn those patterns of path getting obstructed and opening , then we can incorporate those&#xD;
learning which can help the agent to decide (at the starting only) upon the most pro table path to&#xD;
follow instead of discovering blocked paths later.&#xD;
The challenging aspect here involves two stages,  rst is to detect the states of the paths as either&#xD;
open/closed and second is to learn these time patterns of when do a path gets blocked/reopened.&#xD;
The given task is very di cult and time-taking for a single-agent system but if multiple-agents&#xD;
disseminate in the environment and try to learn the time-patterns of path obstruction in di erent&#xD;
parts of the environment, then they can at later stage combine this information collected by every&#xD;
agent. This way the learning process can be increased exponentially&#xD;
Along with solving above given problem, we also try to look at many other sub-problems of collision&#xD;
avoidance during path propagation and noise removal from sensor readings which are ultimately&#xD;
going to be a part of the solution.</summary>
    <dc:date>2019-09-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>APPLYING DATA MINING FOR FINDING PATTERNS FROM SPATIO TEMPORAL TEXT QUERY DATA</title>
    <link rel="alternate" href="http://localhost:8081/jspui/handle/123456789/15323" />
    <author>
      <name>Javiya, Ravi</name>
    </author>
    <id>http://localhost:8081/jspui/handle/123456789/15323</id>
    <updated>2022-02-07T10:14:35Z</updated>
    <published>2019-05-01T00:00:00Z</published>
    <summary type="text">Title: APPLYING DATA MINING FOR FINDING PATTERNS FROM SPATIO TEMPORAL TEXT QUERY DATA
Authors: Javiya, Ravi
Abstract: As the use of sensor network, GPS, and telecommunication technology increased,&#xD;
the availability of spatio-temporal data is also increasing exponentially. The use of&#xD;
these technologies also increased in the  eld of agriculture, which motivates to do&#xD;
data mining analysis of this data. For this work, we have selected farmers query&#xD;
data. In this work, we have experimented various data mining techniques to generate&#xD;
valuable insights from the data which can help in making policies. First, we have&#xD;
clustered the states of India. In the subsequent experiments we have successfully&#xD;
clustered the blocks and districts of India based on feature vector generated by&#xD;
combination of Crop and Query type. In the starting we have clustered based on&#xD;
month-wise data. But as in Agriculture similarity we measure tine in season, so&#xD;
in the next experiment we have used the season wise data for two season of India&#xD;
i.e. Kharif &amp; Rabi. And in the end we found the co-occurring problems for various&#xD;
states in various months</summary>
    <dc:date>2019-05-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>MULTI-FACTOR AUTHENTICATION SCHEME FOR ANTI-PHISHING USING MOBILE APP AND WEBCAM</title>
    <link rel="alternate" href="http://localhost:8081/jspui/handle/123456789/15322" />
    <author>
      <name>Jindal, Sajal</name>
    </author>
    <id>http://localhost:8081/jspui/handle/123456789/15322</id>
    <updated>2022-02-07T10:11:38Z</updated>
    <published>2019-05-01T00:00:00Z</published>
    <summary type="text">Title: MULTI-FACTOR AUTHENTICATION SCHEME FOR ANTI-PHISHING USING MOBILE APP AND WEBCAM
Authors: Jindal, Sajal
Abstract: Phishing attacks are one of the most serious threats faced by the users on the internet the attackers try to steal sensitive information such as login details, credit card details, etc. by deceiving the users to enter sensitive information on the phishing websites and thus leading to huge financial losses. These attacks involve using social engineering techniques to deceive the users. Many schemes have been proposed to detect phishing attacks but the amount of such attacks has not declined. New attacks like Active Man-In-The-Middle (MITM) phishing attacks have emerged which include Real Time Man-In-The-Middle (RT MITM) and Controlled Relay Man-In-The-Middle (CR MITM) phishing attacks. These attacks allow the attackers to obtain the users’ account details and relay them in real-time. Similarly, the attacker can lure the user to enter details on a spoofed app and thus gain access to the user’s account. The existing popular authentication schemes fail to address these attacks. Therefore, there is a need to prevent phishing attacks such as active MITM phishing attacks, app spoofing and malicious browser extension based attacks by creating an anti-phishing user authentication scheme. In this thesis, we propose a novel user authentication scheme which enables the user to log into his/her account without memorizing any password or any other authentication token. The proposed authentication scheme requires the user has to scan a dynamically generated QR-code using the smartphone app and then verify the image captured by the webcam and sent on the smartphone via push notification. Thus, the complete authentication procedure requires minimal user involvement and implements automatically. We have implemented and evaluated the proposed scheme in terms of usability, deployability and security parameters and the results depict that the proposed authentication scheme performs well and can be used as a secure user authentication scheme</summary>
    <dc:date>2019-05-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>DESING AUTOMATION FOR MICRO ELECTRODE DOT ARRAY BASED DIGITAL MICROFLUIDIC BIOCHIPS</title>
    <link rel="alternate" href="http://localhost:8081/jspui/handle/123456789/15321" />
    <author>
      <name>Pal, Surbhi</name>
    </author>
    <id>http://localhost:8081/jspui/handle/123456789/15321</id>
    <updated>2022-02-07T10:09:48Z</updated>
    <published>2019-05-01T00:00:00Z</published>
    <summary type="text">Title: DESING AUTOMATION FOR MICRO ELECTRODE DOT ARRAY BASED DIGITAL MICROFLUIDIC BIOCHIPS
Authors: Pal, Surbhi
Abstract: Microfluidics is the branch of science which deals with the manipulation of fluids in the&#xD;
sub-millimeter scale. With the evolution of technology, digital microfluidic (DMF) biochips&#xD;
have become a vital part of biochemical research. It is a very small chip that performs thousands&#xD;
of operations at the same time. It has a great impact on biomedical and biochemical&#xD;
science. With the evolution in the fabrication technology, efficient microfluidic biochip&#xD;
technologies have been proposed. The chip deals with performing operations on very small&#xD;
volume fluids (like microlitre, nanolitre, picolitre, femtolitre). It performs droplet based&#xD;
operations like sample preparation, mixing, routing, etc. Micro-electrode-dot-array digital&#xD;
microfluidic (MEDA-DMF) biochips have advance features over traditional DMF biochips.&#xD;
In this dissertation, we talk about one-pass synthesis approach for MEDA-DMF biochip.&#xD;
We propose a routing algorithm for MEDA-DMF biochip which is based on the concepts of&#xD;
computational geometry. We also propose well-defined library, architecture and bioassay&#xD;
files which can be used as input for synthesis of biochip. We also decided to develop a tool&#xD;
for MEDA-DMF biochip</summary>
    <dc:date>2019-05-01T00:00:00Z</dc:date>
  </entry>
</feed>

