<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Year-2024</title>
<link>http://repository.iiitd.edu.in/xmlui/handle/123456789/1723</link>
<description>Year-2024</description>
<pubDate>Sun, 20 Sep 2026 14:05:05 GMT</pubDate>
<dc:date>2026-09-20T14:05:05Z</dc:date>
<item>
<title>IFHP- tindering dataset</title>
<link>http://repository.iiitd.edu.in/xmlui/handle/123456789/2166</link>
<description>IFHP- tindering dataset
Singh, Amanpreet; Daipuria, Aditya; Sethi, Tavpritesh (Advisor)
This project focuses on the SNOMED-CT mapping of over 9000 cancer-related datasets from Figshare and more than 2 million datasets from Zenodo FAIR Stations. The data was extracted from online sources using custom scripting, followed by the implementation of a multi-stage an alytical pipeline. This pipeline encompassed data cleaning, preprocessing, K-means clustering, word cloud generation, calculation of Jaccard and Kullback-Leibler divergence, and Bayesian Network modeling. Additionally, the BERT Sentence Model was utilized for calculating cosine scores to enhance the analysis. This comprehensive approach aimed to improve the accuracy and efficiency of SNOMED-CT mapping in cancer research, facilitating better data integration and interoperability within the medical and research communities. Our results demonstrate the effectiveness of these methods in handling large-scale datasets and providing valuable insights into cancer-related data.
</description>
<pubDate>Thu, 25 Jul 2024 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://repository.iiitd.edu.in/xmlui/handle/123456789/2166</guid>
<dc:date>2024-07-25T00:00:00Z</dc:date>
</item>
<item>
<title>Radar signal processing on RFSoC for NavIC remote sensing</title>
<link>http://repository.iiitd.edu.in/xmlui/handle/123456789/2138</link>
<description>Radar signal processing on RFSoC for NavIC remote sensing
Sachdeva, Riya; Darak, Sumit Jagdish (Advisor); Ram, Shobha Sundar (Advisor)
This study explores the utilization of the NavIC-L5 SPS signal in a bi-static radar configuration, wherein the satellite serves as the signal transmitter, and a receiver, po sitioned at an elevated location on the ground, captures the transmitted signals. The receiver records both the direct Line-of-Sight (LoS) signals from the satellite and the signals reflected from the target surface. These received signals are then processed to accurately determine the location of the target. The signal acquisition algorithm is benchmarked using the function gnssSignalAc quirer of the MATLAB Satellite Communications toolbox and applied to process both a modeled signal and a signal generated by the SIMAC2 simulator. The next part of this project will be to build the siganl acquisition system on RF SoC4x2 for low latency processing of real time satellite signals.
</description>
<pubDate>Thu, 12 Dec 2024 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://repository.iiitd.edu.in/xmlui/handle/123456789/2138</guid>
<dc:date>2024-12-12T00:00:00Z</dc:date>
</item>
<item>
<title>Entrepreneurship cafe idea</title>
<link>http://repository.iiitd.edu.in/xmlui/handle/123456789/2137</link>
<description>Entrepreneurship cafe idea
Dushyant; Grover, Anuj (Advisor)
</description>
<pubDate>Wed, 27 Nov 2024 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://repository.iiitd.edu.in/xmlui/handle/123456789/2137</guid>
<dc:date>2024-11-27T00:00:00Z</dc:date>
</item>
<item>
<title>Algorithms for fair allocation and fair division in graphs</title>
<link>http://repository.iiitd.edu.in/xmlui/handle/123456789/2135</link>
<description>Algorithms for fair allocation and fair division in graphs
Nawani, Vivaswan; Mann, Dev; Majumdar, Diptapriyo (Advisor)
This project extends the study of fair allocation and division in graph structures by&#13;
building upon the concept of (1,β)-compact allocations for paths, as introduced in the&#13;
seminal work on compact graph allocations. Specifically, we extend the results for (1,β)&#13;
compact allocation from paths to two-dimensional grid-like graphs and further generalize&#13;
it to graphs of maximum degree d employing a Depth First Search based approach under&#13;
the fairness notion of proportionality. The results demonstrate the scalability of the&#13;
proposed approach across multiple dimensions, contributing to our broader understanding&#13;
of fair division in complex graph topologies.
</description>
<pubDate>Wed, 27 Nov 2024 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://repository.iiitd.edu.in/xmlui/handle/123456789/2135</guid>
<dc:date>2024-11-27T00:00:00Z</dc:date>
</item>
</channel>
</rss>
