Search | arXiv e-print repository

<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"/> <meta name="viewport" content="width=device-width, initial-scale=1"/>  <link rel="apple-touch-icon" sizes="180x180" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-16x16.png"> <link rel="manifest" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/site.webmanifest"> <link rel="mask-icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/safari-pinned-tab.svg" color="#b31b1b"> <link rel="shortcut icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon.ico"> <meta name="msapplication-TileColor" content="#b31b1b"> <meta name="msapplication-config" content="images/icons/browserconfig.xml"> <meta name="theme-color" content="#b31b1b">  <title>Search | arXiv e-print repository</title> <script defer src="https://static.arxiv.org/static/base/1.0.0a5/fontawesome-free-5.11.2-web/js/all.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/base/1.0.0a5/css/arxivstyle.css" /> <script type="text/x-mathjax-config"> MathJax.Hub.Config({ messageStyle: "none", extensions: ["tex2jax.js"], jax: ["input/TeX", "output/HTML-CSS"], tex2jax: { inlineMath: [ ['$','$'], ["\$","\$"] ], displayMath: [ ['$$','$$'], ["\\[","\\]"] ], processEscapes: true, ignoreClass: '.*', processClass: 'mathjax.*' }, TeX: { extensions: ["AMSmath.js", "AMSsymbols.js", "noErrors.js"], noErrors: { inlineDelimiters: ["$","$"], multiLine: false, style: { "font-size": "normal", "border": "" } } }, "HTML-CSS": { availableFonts: ["TeX"] } }); </script> <script src='//static.arxiv.org/MathJax-2.7.3/MathJax.js'></script> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/notification.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/bulma-tooltip.min.css" /> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/search.css" /> <script src="https://code.jquery.com/jquery-3.2.1.slim.min.js" integrity="sha256-k2WSCIexGzOj3Euiig+TlR8gA0EmPjuc79OEeY5L45g=" crossorigin="anonymous"></script> <script src="https://static.arxiv.org/static/search/0.5.6/js/fieldset.js"></script> <style> radio#cf-customfield_11400 { display: none; } </style> </head> <body> <header><a href="#main-container" class="is-sr-only">Skip to main content</a>  <div class="attribution level is-marginless" role="banner"> <div class="level-left"> <a class="level-item" href="https://cornell.edu/"><img src="https://static.arxiv.org/static/base/1.0.0a5/images/cornell-reduced-white-SMALL.svg" alt="Cornell University" width="200" aria-label="logo" /></a> </div> <div class="level-right is-marginless"><p class="sponsors level-item is-marginless"><span id="support-ack-url">We gratefully acknowledge support from<br /> the Simons Foundation, <a href="https://info.arxiv.org/about/ourmembers.html">member institutions</a>, and all contributors. <a href="https://info.arxiv.org/about/donate.html">Donate</a></span></p></div> </div>  <div class="identity level is-marginless"> <div class="level-left"> <div class="level-item"> <a class="arxiv" href="https://arxiv.org/" aria-label="arxiv-logo"> <img src="https://static.arxiv.org/static/base/1.0.0a5/images/arxiv-logo-one-color-white.svg" aria-label="logo" alt="arxiv logo" width="85" style="width:85px;"/> </a> </div> </div> <div class="search-block level-right"> <form class="level-item mini-search" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <div class="control"> <input class="input is-small" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <p class="help"><a href="https://info.arxiv.org/help">Help</a> | <a href="https://arxiv.org/search/advanced">Advanced Search</a></p> </div> <div class="control"> <div class="select is-small"> <select name="searchtype" aria-label="Field to search"> <option value="all" selected="selected">All fields</option> <option value="title">Title</option> <option value="author">Author</option> <option value="abstract">Abstract</option> <option value="comments">Comments</option> <option value="journal_ref">Journal reference</option> <option value="acm_class">ACM classification</option> <option value="msc_class">MSC classification</option> <option value="report_num">Report number</option> <option value="paper_id">arXiv identifier</option> <option value="doi">DOI</option> <option value="orcid">ORCID</option> <option value="author_id">arXiv author ID</option> <option value="help">Help pages</option> <option value="full_text">Full text</option> </select> </div> </div> <input type="hidden" name="source" value="header"> <button class="button is-small is-cul-darker">Search</button> </div> </form> </div> </div>  <div class="container"> <div class="user-tools is-size-7 has-text-right has-text-weight-bold" role="navigation" aria-label="User menu"> <a href="https://arxiv.org/login">Login</a> </div> </div> </header> <main class="container" id="main-container"> <div class="level is-marginless"> <div class="level-left"> <h1 class="title is-clearfix"> Showing 1–37 of 37 results for author: <span class="mathjax">Reddy, B</span> </h1> </div> <div class="level-right is-hidden-mobile">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> <div class="content"> <form method="GET" action="/search/cs" aria-role="search"> Searching in archive <strong>cs</strong>. <a href="/search/?searchtype=author&query=Reddy%2C+B">Search in all archives.</a> <div class="field has-addons-tablet"> <div class="control is-expanded"> <label for="query" class="hidden-label">Search term or terms</label> <input class="input is-medium" id="query" name="query" placeholder="Search term..." type="text" value="Reddy, B"> </div> <div class="select control is-medium"> <label class="is-hidden" for="searchtype">Field</label> <select class="is-medium" id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> </div> <div class="control"> <button class="button is-link is-medium">Search</button> </div> </div> <div class="field"> <div class="control is-size-7"> <label class="radio"> <input checked id="abstracts-0" name="abstracts" type="radio" value="show"> Show abstracts </label> <label class="radio"> <input id="abstracts-1" name="abstracts" type="radio" value="hide"> Hide abstracts </label> </div> </div> <div class="is-clearfix" style="height: 2.5em"> <div class="is-pulled-right"> <a href="/search/advanced?terms-0-term=Reddy%2C+B&terms-0-field=author&size=50&order=-announced_date_first">Advanced Search</a> </div> </div> <input type="hidden" name="order" value="-announced_date_first"> <input type="hidden" name="size" value="50"> </form> <div class="level breathe-horizontal"> <div class="level-left"> <form method="GET" action="/search/"> <div style="display: none;"> <select id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> <input id="query" name="query" type="text" value="Reddy, B"> <ul id="abstracts"><li><input checked id="abstracts-0" name="abstracts" type="radio" value="show"> <label for="abstracts-0">Show abstracts</label></li><li><input id="abstracts-1" name="abstracts" type="radio" value="hide"> <label for="abstracts-1">Hide abstracts</label></li></ul> </div> <div class="box field is-grouped is-grouped-multiline level-item"> <div class="control"> <span class="select is-small"> <select id="size" name="size"><option value="25">25</option><option selected value="50">50</option><option value="100">100</option><option value="200">200</option></select> </span> <label for="size">results per page</label>. </div> <div class="control"> <label for="order">Sort results by</label> <span class="select is-small"> <select id="order" name="order"><option selected value="-announced_date_first">Announcement date (newest first)</option><option value="announced_date_first">Announcement date (oldest first)</option><option value="-submitted_date">Submission date (newest first)</option><option value="submitted_date">Submission date (oldest first)</option><option value="">Relevance</option></select> </span> </div> <div class="control"> <button class="button is-small is-link">Go</button> </div> </div> </form> </div> </div> <ol class="breathe-horizontal" start="1"> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2501.05839">arXiv:2501.05839</a> <span> [<a href="https://arxiv.org/pdf/2501.05839">pdf</a>, <a href="https://arxiv.org/format/2501.05839">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> Poetry in Pixels: Prompt Tuning for Poem Image Generation via Diffusion Models </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Jamil%2C+S">Sofia Jamil</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+B+A">Bollampalli Areen Reddy</a>, <a href="/search/cs?searchtype=author&query=Kumar%2C+R">Raghvendra Kumar</a>, <a href="/search/cs?searchtype=author&query=Saha%2C+S">Sriparna Saha</a>, <a href="/search/cs?searchtype=author&query=Joseph%2C+K+J">K J Joseph</a>, <a href="/search/cs?searchtype=author&query=Goswami%2C+K">Koustava Goswami</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2501.05839v1-abstract-short" style="display: inline;"> The task of text-to-image generation has encountered significant challenges when applied to literary works, especially poetry. Poems are a distinct form of literature, with meanings that frequently transcend beyond the literal words. To address this shortcoming, we propose a PoemToPixel framework designed to generate images that visually represent the inherent meanings of poems. Our approach incor… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.05839v1-abstract-full').style.display = 'inline'; document.getElementById('2501.05839v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2501.05839v1-abstract-full" style="display: none;"> The task of text-to-image generation has encountered significant challenges when applied to literary works, especially poetry. Poems are a distinct form of literature, with meanings that frequently transcend beyond the literal words. To address this shortcoming, we propose a PoemToPixel framework designed to generate images that visually represent the inherent meanings of poems. Our approach incorporates the concept of prompt tuning in our image generation framework to ensure that the resulting images closely align with the poetic content. In addition, we propose the PoeKey algorithm, which extracts three key elements in the form of emotions, visual elements, and themes from poems to form instructions which are subsequently provided to a diffusion model for generating corresponding images. Furthermore, to expand the diversity of the poetry dataset across different genres and ages, we introduce MiniPo, a novel multimodal dataset comprising 1001 children's poems and images. Leveraging this dataset alongside PoemSum, we conducted both quantitative and qualitative evaluations of image generation using our PoemToPixel framework. This paper demonstrates the effectiveness of our approach and offers a fresh perspective on generating images from literary sources. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2501.05839v1-abstract-full').style.display = 'none'; document.getElementById('2501.05839v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 10 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2025. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.16995">arXiv:2411.16995</a> <span> [<a href="https://arxiv.org/pdf/2411.16995">pdf</a>, <a href="https://arxiv.org/format/2411.16995">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> Curvature Informed Furthest Point Sampling </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Bhardwaj%2C+S">Shubham Bhardwaj</a>, <a href="/search/cs?searchtype=author&query=Vinod%2C+A">Ashwin Vinod</a>, <a href="/search/cs?searchtype=author&query=Bhattacharya%2C+S">Soumojit Bhattacharya</a>, <a href="/search/cs?searchtype=author&query=Koganti%2C+A">Aryan Koganti</a>, <a href="/search/cs?searchtype=author&query=Ellendula%2C+A+S">Aditya Sai Ellendula</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+B">Balakrishna Reddy</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.16995v1-abstract-short" style="display: inline;"> Point cloud representation has gained traction due to its efficient memory usage and simplicity in acquisition, manipulation, and storage. However, as point cloud sizes increase, effective down-sampling becomes essential to address the computational requirements of downstream tasks. Classical approaches, such as furthest point sampling (FPS), perform well on benchmarks but rely on heuristics and o… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.16995v1-abstract-full').style.display = 'inline'; document.getElementById('2411.16995v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.16995v1-abstract-full" style="display: none;"> Point cloud representation has gained traction due to its efficient memory usage and simplicity in acquisition, manipulation, and storage. However, as point cloud sizes increase, effective down-sampling becomes essential to address the computational requirements of downstream tasks. Classical approaches, such as furthest point sampling (FPS), perform well on benchmarks but rely on heuristics and overlook geometric features, like curvature, during down-sampling. In this paper, We introduce a reinforcement learning-based sampling algorithm that enhances FPS by integrating curvature information. Our approach ranks points by combining FPS-derived soft ranks with curvature scores computed by a deep neural network, allowing us to replace a proportion of low-curvature points in the FPS set with high-curvature points from the unselected set. Existing differentiable sampling techniques often suffer from training instability, hindering their integration into end-to-end learning frameworks. By contrast, our method achieves stable end-to-end learning, consistently outperforming baseline models across multiple downstream geometry processing tasks. We provide comprehensive ablation studies, with both qualitative and quantitative insights into the effect of each feature on performance. Our algorithm establishes state-of-the-art results for classification, segmentation and shape completion, showcasing its robustness and adaptability. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.16995v1-abstract-full').style.display = 'none'; document.getElementById('2411.16995v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 25 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">19 pages, 5 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.10132">arXiv:2411.10132</a> <span> [<a href="https://arxiv.org/pdf/2411.10132">pdf</a>, <a href="https://arxiv.org/format/2411.10132">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Distributed, Parallel, and Cluster Computing">cs.DC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Omnichain Web: The Universal Framework for Streamlined Chain Abstraction and Cross-Layer Interaction </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Gajera%2C+H">Hardik Gajera</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+A">Akhil Reddy</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+B">Bhagath Reddy</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.10132v2-abstract-short" style="display: inline;"> The Web3 ecosystem is highly fragmented, making seamless integration difficult for over a billion Web2 businesses, enterprises, and AI protocols. As blockchains, rollups, and app-specific chains expand, cross-chain interactions remain inefficient, and liquidity is deeply fragmented. AI systems lack standardized blockchain access, limiting autonomous functionality. Intent-based interactions, crucia… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.10132v2-abstract-full').style.display = 'inline'; document.getElementById('2411.10132v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.10132v2-abstract-full" style="display: none;"> The Web3 ecosystem is highly fragmented, making seamless integration difficult for over a billion Web2 businesses, enterprises, and AI protocols. As blockchains, rollups, and app-specific chains expand, cross-chain interactions remain inefficient, and liquidity is deeply fragmented. AI systems lack standardized blockchain access, limiting autonomous functionality. Intent-based interactions, crucial for AI-driven automation, face scalability issues due to the absence of robust execution platforms. Meanwhile, the current solver ecosystem is centralized, as liquidity rebalancing remains a challenge due to a lack of developer-friendly tools. Dojima's Omnichain Web introduces a universal framework that abstracts blockchain complexity, bridging Web2, Web3, and AI. At its core, OmniRollups facilitate scalable execution across chains, while the Omni Sequencer ensures atomic, secure intent processing. Linera microchains enable AI-driven transaction automation, seamlessly integrating with Web3 data streams. Ragno Network decentralizes L1 infrastructure, optimizing cross-chain liquidity flows, while the Proof Network enhances cryptographic security for omnichain transactions. Finally, the Builder Marketplace introduces a solver-driven execution layer, allowing developers to build and monetize intent-based applications without liquidity constraints. By fostering a composable marketplace at the intersection of Web2 and Web3, Omnichain Web enables the seamless flow of data, value, and computation. This framework mirrors the internet, bridging Web3 decentralization with Web2 scale to drive the next wave of adoption. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.10132v2-abstract-full').style.display = 'none'; document.getElementById('2411.10132v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 19 March, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 15 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2408.00797">arXiv:2408.00797</a> <span> [<a href="https://arxiv.org/pdf/2408.00797">pdf</a>, <a href="https://arxiv.org/ps/2408.00797">ps</a>, <a href="https://arxiv.org/format/2408.00797">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Data Structures and Algorithms">cs.DS</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computational Complexity">cs.CC</span> </div> </div> <p class="title is-5 mathjax"> Algorithms for Minimum Membership Dominating Set Problem </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+S+B">Sangam Balchandar Reddy</a>, <a href="/search/cs?searchtype=author&query=Kare%2C+A+S">Anjeneya Swami Kare</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2408.00797v1-abstract-short" style="display: inline;"> Given a graph $G = (V, E)$ and an integer $k$, the Minimum Membership Dominating Set problem asks to compute a set $S \subseteq V$ such that for each $v \in V$, $1 \leq |N[v] \cap S| \leq k$. The problem is known to be NP-complete even on split graphs and planar bipartite graphs. In this paper, we approach the problem from the algorithmic standpoint and obtain several interesting results. We give… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2408.00797v1-abstract-full').style.display = 'inline'; document.getElementById('2408.00797v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2408.00797v1-abstract-full" style="display: none;"> Given a graph $G = (V, E)$ and an integer $k$, the Minimum Membership Dominating Set problem asks to compute a set $S \subseteq V$ such that for each $v \in V$, $1 \leq |N[v] \cap S| \leq k$. The problem is known to be NP-complete even on split graphs and planar bipartite graphs. In this paper, we approach the problem from the algorithmic standpoint and obtain several interesting results. We give an $\mathcal{O}^*(1.747^n)$ time algorithm for the problem on split graphs. Following a reduction from a special case of 1-in-3 SAT problem, we show that there is no sub-exponential time algorithm running in time $\mathcal{O}^*(2^{o(n)})$ for bipartite graphs, for any $k \geq 2$. We also prove that the problem is NP-complete when $螖= k+2$, for any $k\geq 5$, even for bipartite graphs. We investigate the parameterized complexity of the problem for the parameter twin cover and the combined parameter distance to cluster, membership($k$) and prove that the problem is fixed-parameter tractable. Using a dynamic programming based approach, we obtain a linear-time algorithm for trees. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2408.00797v1-abstract-full').style.display = 'none'; document.getElementById('2408.00797v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 19 July, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">23 pages, 6 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">MSC Class:</span> 05C85; 68Q17; 68Q27 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2404.06768">arXiv:2404.06768</a> <span> [<a href="https://arxiv.org/pdf/2404.06768">pdf</a>, <a href="https://arxiv.org/ps/2404.06768">ps</a>, <a href="https://arxiv.org/format/2404.06768">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Rings and Algebras">math.RA</span> </div> </div> <p class="title is-5 mathjax"> A new approach to construct minimal linear codes over $\mathbb{F}_{3}$ </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Shaikh%2C+W+M">Wajid M. Shaikh</a>, <a href="/search/cs?searchtype=author&query=Jain%2C+R+S">Rupali S. Jain</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+B+S">B. Surendranath Reddy</a>, <a href="/search/cs?searchtype=author&query=Patil%2C+B+S">Bhagyashri S. Patil</a>, <a href="/search/cs?searchtype=author&query=Maqbol%2C+S+M+A">Sahar M. A. Maqbol</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2404.06768v1-abstract-short" style="display: inline;"> In this article, we present two new approaches to construct minimal linear codes of dimension $n+1$ over $\mathbb{F}_{3}$ using characteristic and ternary functions. We also obtain the weight distributions of these constructed minimal linear codes. We further show that a specific class of these codes violates Ashikhmin-Barg condition. </span> <span class="abstract-full has-text-grey-dark mathjax" id="2404.06768v1-abstract-full" style="display: none;"> In this article, we present two new approaches to construct minimal linear codes of dimension $n+1$ over $\mathbb{F}_{3}$ using characteristic and ternary functions. We also obtain the weight distributions of these constructed minimal linear codes. We further show that a specific class of these codes violates Ashikhmin-Barg condition. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2404.06768v1-abstract-full').style.display = 'none'; document.getElementById('2404.06768v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 10 April, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> MJMS-2024-0154 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2403.13350">arXiv:2403.13350</a> <span> [<a href="https://arxiv.org/pdf/2403.13350">pdf</a>, <a href="https://arxiv.org/ps/2403.13350">ps</a>, <a href="https://arxiv.org/format/2403.13350">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Rings and Algebras">math.RA</span> </div> </div> <p class="title is-5 mathjax"> Construction of Minimal Binary Linear Codes of dimension $n+3$ </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Shaikh%2C+W+M">Wajid M. Shaikh</a>, <a href="/search/cs?searchtype=author&query=Jain%2C+R+S">Rupali S. Jain</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+B+S">B. Surendranath Reddy</a>, <a href="/search/cs?searchtype=author&query=Patil%2C+B+S">Bhagyashri S. Patil</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2403.13350v1-abstract-short" style="display: inline;"> In this paper, we will give the generic construction of a binary linear code of dimension $n+3$ and derive the necessary and sufficient conditions for the constructed code to be minimal. Using generic construction, a new family of minimal binary linear code will be constructed from a special class of Boolean functions violating the Ashikhmin-Barg condition. We also obtain the weight distribution o… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2403.13350v1-abstract-full').style.display = 'inline'; document.getElementById('2403.13350v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2403.13350v1-abstract-full" style="display: none;"> In this paper, we will give the generic construction of a binary linear code of dimension $n+3$ and derive the necessary and sufficient conditions for the constructed code to be minimal. Using generic construction, a new family of minimal binary linear code will be constructed from a special class of Boolean functions violating the Ashikhmin-Barg condition. We also obtain the weight distribution of the constructed minimal binary linear code. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2403.13350v1-abstract-full').style.display = 'none'; document.getElementById('2403.13350v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 March, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">MSC Class:</span> 94B05; 94C10; 94A60 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2401.02965">arXiv:2401.02965</a> <span> [<a href="https://arxiv.org/pdf/2401.02965">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Digital Libraries">cs.DL</span> </div> </div> <p class="title is-5 mathjax"> Perceptual and technical barriers in sharing and formatting metadata accompanying omics studies </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Huang%2C+Y">Yu-Ning Huang</a>, <a href="/search/cs?searchtype=author&query=Love%2C+M+I">Michael I. Love</a>, <a href="/search/cs?searchtype=author&query=Ronkowski%2C+C+F">Cynthia Flaire Ronkowski</a>, <a href="/search/cs?searchtype=author&query=Deshpande%2C+D">Dhrithi Deshpande</a>, <a href="/search/cs?searchtype=author&query=Schriml%2C+L+M">Lynn M. Schriml</a>, <a href="/search/cs?searchtype=author&query=Wong-Beringer%2C+A">Annie Wong-Beringer</a>, <a href="/search/cs?searchtype=author&query=Mons%2C+B">Barend Mons</a>, <a href="/search/cs?searchtype=author&query=Corbett-Detig%2C+R">Russell Corbett-Detig</a>, <a href="/search/cs?searchtype=author&query=Hunter%2C+C+I">Christopher I Hunter</a>, <a href="/search/cs?searchtype=author&query=Moore%2C+J+H">Jason H. Moore</a>, <a href="/search/cs?searchtype=author&query=Garmire%2C+L+X">Lana X. Garmire</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+T+B+K">T. B. K. Reddy</a>, <a href="/search/cs?searchtype=author&query=Hide%2C+W+A">Winston A. Hide</a>, <a href="/search/cs?searchtype=author&query=Butte%2C+A+J">Atul J. Butte</a>, <a href="/search/cs?searchtype=author&query=Robinson%2C+M+D">Mark D. Robinson</a>, <a href="/search/cs?searchtype=author&query=Mangul%2C+S">Serghei Mangul</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2401.02965v1-abstract-short" style="display: inline;"> Metadata, often termed "data about data," is crucial for organizing, understanding, and managing vast omics datasets. It aids in efficient data discovery, integration, and interpretation, enabling users to access, comprehend, and utilize data effectively. Its significance spans the domains of scientific research, facilitating data reproducibility, reusability, and secondary analysis. However, nume… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.02965v1-abstract-full').style.display = 'inline'; document.getElementById('2401.02965v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2401.02965v1-abstract-full" style="display: none;"> Metadata, often termed "data about data," is crucial for organizing, understanding, and managing vast omics datasets. It aids in efficient data discovery, integration, and interpretation, enabling users to access, comprehend, and utilize data effectively. Its significance spans the domains of scientific research, facilitating data reproducibility, reusability, and secondary analysis. However, numerous perceptual and technical barriers hinder the sharing of metadata among researchers. These barriers compromise the reliability of research results and hinder integrative meta-analyses of omics studies . This study highlights the key barriers to metadata sharing, including the lack of uniform standards, privacy and legal concerns, limitations in study design, limited incentives, inadequate infrastructure, and the dearth of well-trained personnel for metadata management and reuse. Proposed solutions include emphasizing the promotion of standardization, educational efforts, the role of journals and funding agencies, incentives and rewards, and the improvement of infrastructure. More accurate, reliable, and impactful research outcomes are achievable if the scientific community addresses these barriers, facilitating more accurate, reliable, and impactful research outcomes. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.02965v1-abstract-full').style.display = 'none'; document.getElementById('2401.02965v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 22 November, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2311.12663">arXiv:2311.12663</a> <span> [<a href="https://arxiv.org/pdf/2311.12663">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> Similar Document Template Matching Algorithm </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Yenigalla%2C+H">Harshitha Yenigalla</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+B+R+S">Bommareddy Revanth Srinivasa Reddy</a>, <a href="/search/cs?searchtype=author&query=Rahul%2C+B+V">Batta Venkata Rahul</a>, <a href="/search/cs?searchtype=author&query=Raju%2C+N+H">Nannapuraju Hemanth Raju</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2311.12663v1-abstract-short" style="display: inline;"> This study outlines a comprehensive methodology for verifying medical documents, integrating advanced techniques in template extraction, comparison, and fraud detection. It begins with template extraction using sophisticated region-of-interest (ROI) methods, incorporating contour analysis and edge identification. Pre-processing steps ensure template clarity through morphological operations and ada… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2311.12663v1-abstract-full').style.display = 'inline'; document.getElementById('2311.12663v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2311.12663v1-abstract-full" style="display: none;"> This study outlines a comprehensive methodology for verifying medical documents, integrating advanced techniques in template extraction, comparison, and fraud detection. It begins with template extraction using sophisticated region-of-interest (ROI) methods, incorporating contour analysis and edge identification. Pre-processing steps ensure template clarity through morphological operations and adaptive thresholding. The template comparison algorithm utilizes advanced feature matching with key points and descriptors, enhancing robustness through histogram-based analysis for accounting variations. Fraud detection involves the SSIM computation and OCR for textual information extraction. The SSIM quantifies structural similarity, aiding in potential match identification. OCR focuses on critical areas like patient details, provider information, and billing amounts. Extracted information is compared with a reference dataset, and confidence thresholding ensures reliable fraud detection. Adaptive parameters enhance system flexibility for dynamic adjustments to varying document layouts. This methodology provides a robust approach to medical document verification, addressing complexities in template extraction, comparison, fraud detection, and adaptability to diverse document structures. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2311.12663v1-abstract-full').style.display = 'none'; document.getElementById('2311.12663v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 November, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">8 pages,8 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2310.02931">arXiv:2310.02931</a> <span> [<a href="https://arxiv.org/pdf/2310.02931">pdf</a>, <a href="https://arxiv.org/format/2310.02931">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> </div> <p class="title is-5 mathjax"> Graph data modelling for outcome prediction in oropharyngeal cancer patients </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Bhasker%2C+N">Nithya Bhasker</a>, <a href="/search/cs?searchtype=author&query=Leger%2C+S">Stefan Leger</a>, <a href="/search/cs?searchtype=author&query=Zwanenburg%2C+A">Alexander Zwanenburg</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+C+B">Chethan Babu Reddy</a>, <a href="/search/cs?searchtype=author&query=Bodenstedt%2C+S">Sebastian Bodenstedt</a>, <a href="/search/cs?searchtype=author&query=L%C3%B6ck%2C+S">Steffen L枚ck</a>, <a href="/search/cs?searchtype=author&query=Speidel%2C+S">Stefanie Speidel</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2310.02931v1-abstract-short" style="display: inline;"> Graph neural networks (GNNs) are becoming increasingly popular in the medical domain for the tasks of disease classification and outcome prediction. Since patient data is not readily available as a graph, most existing methods either manually define a patient graph, or learn a latent graph based on pairwise similarities between the patients. There are also hypergraph neural network (HGNN)-based me… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2310.02931v1-abstract-full').style.display = 'inline'; document.getElementById('2310.02931v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2310.02931v1-abstract-full" style="display: none;"> Graph neural networks (GNNs) are becoming increasingly popular in the medical domain for the tasks of disease classification and outcome prediction. Since patient data is not readily available as a graph, most existing methods either manually define a patient graph, or learn a latent graph based on pairwise similarities between the patients. There are also hypergraph neural network (HGNN)-based methods that were introduced recently to exploit potential higher order associations between the patients by representing them as a hypergraph. In this work, we propose a patient hypergraph network (PHGN), which has been investigated in an inductive learning setup for binary outcome prediction in oropharyngeal cancer (OPC) patients using computed tomography (CT)-based radiomic features for the first time. Additionally, the proposed model was extended to perform time-to-event analyses, and compared with GNN and baseline linear models. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2310.02931v1-abstract-full').style.display = 'none'; document.getElementById('2310.02931v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 4 October, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2023. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2308.11008">arXiv:2308.11008</a> <span> [<a href="https://arxiv.org/pdf/2308.11008">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Databases">cs.DB</span> </div> </div> <p class="title is-5 mathjax"> Approximating Clustering for Memory Management and request processing </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Suribabu%2C+D+D+D">D. D. D. Suribabu</a>, <a href="/search/cs?searchtype=author&query=Sarma%2C+T+H">T. Hitendra Sarma</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+B+E">B. Eswar Reddy</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2308.11008v1-abstract-short" style="display: inline;"> Clustering is a crucial tool for analyzing data in virtually every scientific and engineering discipline. There are more scalable solutions framed to enable time and space clustering for the future large-scale data analyses. As a result, hardware and software innovations that can significantly improve data efficiency and performance of the data clustering techniques are necessary to make the futur… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2308.11008v1-abstract-full').style.display = 'inline'; document.getElementById('2308.11008v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2308.11008v1-abstract-full" style="display: none;"> Clustering is a crucial tool for analyzing data in virtually every scientific and engineering discipline. There are more scalable solutions framed to enable time and space clustering for the future large-scale data analyses. As a result, hardware and software innovations that can significantly improve data efficiency and performance of the data clustering techniques are necessary to make the future large-scale data analysis practical. This paper proposes a novel mechanism for computing bit-serial medians. We propose a novel method, two-parameter terms that enables in computation within the data arrays <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2308.11008v1-abstract-full').style.display = 'none'; document.getElementById('2308.11008v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 17 August, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2023. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2308.01203">arXiv:2308.01203</a> <span> [<a href="https://arxiv.org/pdf/2308.01203">pdf</a>, <a href="https://arxiv.org/format/2308.01203">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Retrieval">cs.IR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computation and Language">cs.CL</span> </div> </div> <p class="title is-5 mathjax"> Analysing the Resourcefulness of the Paragraph for Precedence Retrieval </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Sisodiya%2C+B+S">Bhoomeendra Singh Sisodiya</a>, <a href="/search/cs?searchtype=author&query=Unnam%2C+N+B">Narendra Babu Unnam</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+P+K">P. Krishna Reddy</a>, <a href="/search/cs?searchtype=author&query=Das%2C+A">Apala Das</a>, <a href="/search/cs?searchtype=author&query=Santhy%2C+K+V+K">K. V. K. Santhy</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+V+B">V. Balakista Reddy</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2308.01203v1-abstract-short" style="display: inline;"> Developing methods for extracting relevant legal information to aid legal practitioners is an active research area. In this regard, research efforts are being made by leveraging different kinds of information, such as meta-data, citations, keywords, sentences, paragraphs, etc. Similar to any text document, legal documents are composed of paragraphs. In this paper, we have analyzed the resourcefuln… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2308.01203v1-abstract-full').style.display = 'inline'; document.getElementById('2308.01203v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2308.01203v1-abstract-full" style="display: none;"> Developing methods for extracting relevant legal information to aid legal practitioners is an active research area. In this regard, research efforts are being made by leveraging different kinds of information, such as meta-data, citations, keywords, sentences, paragraphs, etc. Similar to any text document, legal documents are composed of paragraphs. In this paper, we have analyzed the resourcefulness of paragraph-level information in capturing similarity among judgments for improving the performance of precedence retrieval. We found that the paragraph-level methods could capture the similarity among the judgments with only a few paragraph interactions and exhibit more discriminating power over the baseline document-level method. Moreover, the comparison results on two benchmark datasets for the precedence retrieval on the Indian supreme court judgments task show that the paragraph-level methods exhibit comparable performance with the state-of-the-art methods <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2308.01203v1-abstract-full').style.display = 'none'; document.getElementById('2308.01203v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 29 July, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">5 pages , 3 figures, ICAIL 2023</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2307.14859">arXiv:2307.14859</a> <span> [<a href="https://arxiv.org/pdf/2307.14859">pdf</a>, <a href="https://arxiv.org/format/2307.14859">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> Comparative Evaluation of Digital and Analog Chest Radiographs to Identify Tuberculosis using Deep Learning Model </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Chattoraj%2C+S">Subhankar Chattoraj</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+B">Bhargava Reddy</a>, <a href="/search/cs?searchtype=author&query=Tadepalli%2C+M">Manoj Tadepalli</a>, <a href="/search/cs?searchtype=author&query=Putha%2C+P">Preetham Putha</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2307.14859v1-abstract-short" style="display: inline;"> Purpose:Chest X-ray (CXR) is an essential tool and one of the most prescribed imaging to detect pulmonary abnormalities, with a yearly estimate of over 2 billion imaging performed worldwide. However, the accurate and timely diagnosis of TB remains an unmet goal. The prevalence of TB is highest in low-middle-income countries, and the requirement of a portable, automated, and reliable solution is re… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2307.14859v1-abstract-full').style.display = 'inline'; document.getElementById('2307.14859v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2307.14859v1-abstract-full" style="display: none;"> Purpose:Chest X-ray (CXR) is an essential tool and one of the most prescribed imaging to detect pulmonary abnormalities, with a yearly estimate of over 2 billion imaging performed worldwide. However, the accurate and timely diagnosis of TB remains an unmet goal. The prevalence of TB is highest in low-middle-income countries, and the requirement of a portable, automated, and reliable solution is required. In this study, we compared the performance of DL-based devices on digital and analog CXR. The evaluated DL-based device can be used in resource-constraint settings. Methods: A total of 10,000 CXR DICOMs(.dcm) and printed photos of the films acquired with three different cellular phones - Samsung S8, iPhone 8, and iPhone XS along with their radiological report were retrospectively collected from various sites across India from April 2020 to March 2021. Results: 10,000 chest X-rays were utilized to evaluate the DL-based device in identifying radiological signs of TB. The AUC of qXR for detecting signs of tuberculosis on the original DICOMs dataset was 0.928 with a sensitivity of 0.841 at a specificity of 0.806. At an optimal threshold, the difference in the AUC of three cellular smartphones with the original DICOMs is 0.024 (2.55%), 0.048 (5.10%), and 0.038 (1.91%). The minimum difference demonstrates the robustness of the DL-based device in identifying radiological signs of TB in both digital and analog CXR. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2307.14859v1-abstract-full').style.display = 'none'; document.getElementById('2307.14859v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 27 July, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2023. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2307.09760">arXiv:2307.09760</a> <span> [<a href="https://arxiv.org/pdf/2307.09760">pdf</a>, <a href="https://arxiv.org/ps/2307.09760">ps</a>, <a href="https://arxiv.org/format/2307.09760">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Data Structures and Algorithms">cs.DS</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computational Complexity">cs.CC</span> </div> </div> <p class="title is-5 mathjax"> On the Tractability of Defensive Alliance Problem </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+S+B">Sangam Balchandar Reddy</a>, <a href="/search/cs?searchtype=author&query=Kare%2C+A+S">Anjeneya Swami Kare</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2307.09760v1-abstract-short" style="display: inline;"> Given a graph $G = (V, E)$, a non-empty set $S \subseteq V$ is a defensive alliance, if for every vertex $v \in S$, the majority of its closed neighbours are in $S$, that is, $|N_G[v] \cap S| \geq |N_G[v] \setminus S|$. The decision version of the problem is known to be NP-Complete even when restricted to split and bipartite graphs. The problem is \textit{fixed-parameter tractable} for the paramet… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2307.09760v1-abstract-full').style.display = 'inline'; document.getElementById('2307.09760v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2307.09760v1-abstract-full" style="display: none;"> Given a graph $G = (V, E)$, a non-empty set $S \subseteq V$ is a defensive alliance, if for every vertex $v \in S$, the majority of its closed neighbours are in $S$, that is, $|N_G[v] \cap S| \geq |N_G[v] \setminus S|$. The decision version of the problem is known to be NP-Complete even when restricted to split and bipartite graphs. The problem is \textit{fixed-parameter tractable} for the parameters solution size, vertex cover number and neighbourhood diversity. For the parameters treewidth and feedback vertex set number, the problem is W[1]-hard. \\ \hspace*{2em} In this paper, we study the defensive alliance problem for graphs with bounded degree. We show that the problem is \textit{polynomial-time solvable} on graphs with maximum degree at most 5 and NP-Complete on graphs with maximum degree 6. This rules out the fixed-parameter tractability of the problem for the parameter maximum degree of the graph. We also consider the problem from the standpoint of parameterized complexity. We provide an FPT algorithm using the Integer Linear Programming approach for the parameter distance to clique. We also answer an open question posed in \cite{AG2} by providing an FPT algorithm for the parameter twin cover. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2307.09760v1-abstract-full').style.display = 'none'; document.getElementById('2307.09760v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 19 July, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">20 pages</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2305.00329">arXiv:2305.00329</a> <span> [<a href="https://arxiv.org/pdf/2305.00329">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Genomics">q-bio.GN</span> </div> </div> <p class="title is-5 mathjax"> Maximum Match Subsequence Alignment Algorithm Finely Grained (MMSAA FG) </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+B">Bharath Reddy</a>, <a href="/search/cs?searchtype=author&query=Fields%2C+R">Richard Fields</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2305.00329v1-abstract-short" style="display: inline;"> Sequence alignment is common nowadays as it is used in many fields to determine how closely two sequences are related and at times to see how little they differ. In computational biology / Bioinformatics, there are many algorithms developed over the course of time to not only align two sequences quickly but also get good laboratory results from these alignments. The first algorithms developed were… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2305.00329v1-abstract-full').style.display = 'inline'; document.getElementById('2305.00329v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2305.00329v1-abstract-full" style="display: none;"> Sequence alignment is common nowadays as it is used in many fields to determine how closely two sequences are related and at times to see how little they differ. In computational biology / Bioinformatics, there are many algorithms developed over the course of time to not only align two sequences quickly but also get good laboratory results from these alignments. The first algorithms developed were based of a technique called Dynamic Programming, which were very slow but were optimal when it comes to sensitivity. To improve speed, more algorithms today are based of heuristic approach, by sacrificing sensitivity. In this paper, we are going to improve on a heuristic algorithm called MASAA (Multiple Anchor Staged Local Sequence Alignment Algorithm) and MASAA Sensitive which we published previously. This new algorithm appropriately called Maximum Match Subsequence Alignment Algorithm Finely Grained. The algorithm is based on suffix tree data structure like our previous algorithms, but to improve sensitivity, we employ adaptive seeds, and finely grained perfect match seeds in between the already identified anchors. We tested this algorithm on a randomly generated sequences, and Rosetta dataset where the sequence length ranged up to 500 thousand. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2305.00329v1-abstract-full').style.display = 'none'; document.getElementById('2305.00329v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 29 April, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Pg 6, 6 figures, CSCE 2020 accepted paper</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2211.06735">arXiv:2211.06735</a> <span> [<a href="https://arxiv.org/pdf/2211.06735">pdf</a>, <a href="https://arxiv.org/format/2211.06735">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</span> </div> </div> <p class="title is-5 mathjax"> CompactChain:An Efficient Stateless Chain for UTXO-model Blockchain </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+B+S">B Swaroopa Reddy</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+T+U+K">T Uday Kiran Reddy</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2211.06735v2-abstract-short" style="display: inline;"> In this work, we propose a stateless blockchain called CompactChain, which compacts the entire state of the UTXO (Unspent Transaction Output) based blockchain systems into two RSA accumulators. The first accumulator is called Transaction Output (TXO) commitment which represents the TXO set. The second one is called Spent Transaction Output (STXO) commitment which represents the STXO set. In this w… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2211.06735v2-abstract-full').style.display = 'inline'; document.getElementById('2211.06735v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2211.06735v2-abstract-full" style="display: none;"> In this work, we propose a stateless blockchain called CompactChain, which compacts the entire state of the UTXO (Unspent Transaction Output) based blockchain systems into two RSA accumulators. The first accumulator is called Transaction Output (TXO) commitment which represents the TXO set. The second one is called Spent Transaction Output (STXO) commitment which represents the STXO set. In this work, we discuss three algorithms - (i) To update the TXO and STXO commitments by the miner. The miner also provides the proofs for the correctness of the updated commitments; (ii) To prove the transaction's validity by providing a membership witness in TXO commitment and non-membership witness against STXO commitment for a coin being spent by a user; (iii) To update the witness for the coin that is not yet spent; The experimental results evaluate the performance of the CompactChain in terms of time taken by a miner to update the commitments and time taken by a validator to verify the commitments and validate the transactions. We compare the performance of CompactChain with the existing state-of-art works on stateless blockchains. CompactChain shows a reduction in commitments update complexity and transaction witness size which inturn reduces the mempool size and propagation latency without compromising the system throughput (Transactions per second (TPS)). <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2211.06735v2-abstract-full').style.display = 'none'; document.getElementById('2211.06735v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 3 February, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 12 November, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2022. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2208.10490">arXiv:2208.10490</a> <span> [<a href="https://arxiv.org/pdf/2208.10490">pdf</a>, <a href="https://arxiv.org/format/2208.10490">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Emerging Technologies">cs.ET</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> Memristive Computing for Efficient Inference on Resource Constrained Devices </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Rammamoorthy%2C+V">Venkatesh Rammamoorthy</a>, <a href="/search/cs?searchtype=author&query=Zhao%2C+G">Geng Zhao</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+B">Bharathi Reddy</a>, <a href="/search/cs?searchtype=author&query=Lin%2C+M">Ming-Yang Lin</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2208.10490v1-abstract-short" style="display: inline;"> The advent of deep learning has resulted in a number of applications which have transformed the landscape of the research area in which it has been applied. However, with an increase in popularity, the complexity of classical deep neural networks has increased over the years. As a result, this has leads to considerable problems during deployment on devices with space and time constraints. In this… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2208.10490v1-abstract-full').style.display = 'inline'; document.getElementById('2208.10490v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2208.10490v1-abstract-full" style="display: none;"> The advent of deep learning has resulted in a number of applications which have transformed the landscape of the research area in which it has been applied. However, with an increase in popularity, the complexity of classical deep neural networks has increased over the years. As a result, this has leads to considerable problems during deployment on devices with space and time constraints. In this work, we perform a review of the present advancements in non-volatile memory and how the use of resistive RAM memory, particularly memristors, can help to progress the state of research in deep learning. In other words, we wish to present an ideology that advances in the field of memristive technology can greatly influence and impact deep learning inference on edge devices. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2208.10490v1-abstract-full').style.display = 'none'; document.getElementById('2208.10490v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 August, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2022. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2208.01263">arXiv:2208.01263</a> <span> [<a href="https://arxiv.org/pdf/2208.01263">pdf</a>, <a href="https://arxiv.org/ps/2208.01263">ps</a>, <a href="https://arxiv.org/format/2208.01263">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</span> </div> </div> <p class="title is-5 mathjax"> A ZK-SNARK based Proof of Assets Protocol for Bitcoin Exchanges </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+B+S">B Swaroopa Reddy</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2208.01263v2-abstract-short" style="display: inline;"> This paper proposes a protocol for Proof of Assets of a bitcoin exchange using the Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (ZK-SNARK) without revealing either the bitcoin addresses of the exchange or balances associated with those addresses. The proof of assets is a mechanism to prove the total value of bitcoins the exchange has authority to spend using its private keys. We c… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2208.01263v2-abstract-full').style.display = 'inline'; document.getElementById('2208.01263v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2208.01263v2-abstract-full" style="display: none;"> This paper proposes a protocol for Proof of Assets of a bitcoin exchange using the Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (ZK-SNARK) without revealing either the bitcoin addresses of the exchange or balances associated with those addresses. The proof of assets is a mechanism to prove the total value of bitcoins the exchange has authority to spend using its private keys. We construct a privacy-preserving ZK-SNARK proof system to prove the knowledge of the private keys corresponding to the bitcoin assets of an exchange. The ZK-SNARK tool-chain helps to convert an NP-Statement for proving the knowledge of the private keys (known to the exchange) into a circuit satisfiability problem. In this protocol, the exchange creates a Pedersen commitment to the value of bitcoins associated with each address without revealing the balance. The simulation results show that the proof generation time, size, and verification time are efficient in practice. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2208.01263v2-abstract-full').style.display = 'none'; document.getElementById('2208.01263v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 November, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 2 August, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">9 pages, 2 figures, 6 tables</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2207.09070">arXiv:2207.09070</a> <span> [<a href="https://arxiv.org/pdf/2207.09070">pdf</a>, <a href="https://arxiv.org/format/2207.09070">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> Context Unaware Knowledge Distillation for Image Retrieval </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+B+Y">Bytasandram Yaswanth Reddy</a>, <a href="/search/cs?searchtype=author&query=Dubey%2C+S+R">Shiv Ram Dubey</a>, <a href="/search/cs?searchtype=author&query=Sanodiya%2C+R+K">Rakesh Kumar Sanodiya</a>, <a href="/search/cs?searchtype=author&query=Karn%2C+R+R+P">Ravi Ranjan Prasad Karn</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2207.09070v1-abstract-short" style="display: inline;"> Existing data-dependent hashing methods use large backbone networks with millions of parameters and are computationally complex. Existing knowledge distillation methods use logits and other features of the deep (teacher) model and as knowledge for the compact (student) model, which requires the teacher's network to be fine-tuned on the context in parallel with the student model on the context. Tra… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2207.09070v1-abstract-full').style.display = 'inline'; document.getElementById('2207.09070v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2207.09070v1-abstract-full" style="display: none;"> Existing data-dependent hashing methods use large backbone networks with millions of parameters and are computationally complex. Existing knowledge distillation methods use logits and other features of the deep (teacher) model and as knowledge for the compact (student) model, which requires the teacher's network to be fine-tuned on the context in parallel with the student model on the context. Training teacher on the target context requires more time and computational resources. In this paper, we propose context unaware knowledge distillation that uses the knowledge of the teacher model without fine-tuning it on the target context. We also propose a new efficient student model architecture for knowledge distillation. The proposed approach follows a two-step process. The first step involves pre-training the student model with the help of context unaware knowledge distillation from the teacher model. The second step involves fine-tuning the student model on the context of image retrieval. In order to show the efficacy of the proposed approach, we compare the retrieval results, no. of parameters and no. of operations of the student models with the teacher models under different retrieval frameworks, including deep cauchy hashing (DCH) and central similarity quantization (CSQ). The experimental results confirm that the proposed approach provides a promising trade-off between the retrieval results and efficiency. The code used in this paper is released publicly at \url{https://github.com/satoru2001/CUKDFIR}. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2207.09070v1-abstract-full').style.display = 'none'; document.getElementById('2207.09070v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 19 July, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted in International Conference on Computer Vision and Machine Intelligence (CVMI), 2022</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2201.01538">arXiv:2201.01538</a> <span> [<a href="https://arxiv.org/pdf/2201.01538">pdf</a>, <a href="https://arxiv.org/ps/2201.01538">ps</a>, <a href="https://arxiv.org/format/2201.01538">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computational Engineering, Finance, and Science">cs.CE</span> </div> </div> <p class="title is-5 mathjax"> Compliant Constant Output/ Input Force Mechanisms- Topology Optimization with Contact </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+B+V+S+N">B V S Nagendra Reddy</a>, <a href="/search/cs?searchtype=author&query=Khatik%2C+V+M">Vitthal Manohar Khatik</a>, <a href="/search/cs?searchtype=author&query=Corves%2C+B">Burkhard Corves</a>, <a href="/search/cs?searchtype=author&query=Saxena%2C+A">Anupam Saxena</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2201.01538v3-abstract-short" style="display: inline;"> We synthesize monolithic topologies of constant output (CoFM) and input (CiFM) force mechanisms. During synthesis, we capture all possible aspects of member deformation including finite displacements, buckling, interaction between members, their interaction with external surfaces, and importantly, interaction of the mechanism with flexible workpieces to capture force transfer in true sense. Featur… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2201.01538v3-abstract-full').style.display = 'inline'; document.getElementById('2201.01538v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2201.01538v3-abstract-full" style="display: none;"> We synthesize monolithic topologies of constant output (CoFM) and input (CiFM) force mechanisms. During synthesis, we capture all possible aspects of member deformation including finite displacements, buckling, interaction between members, their interaction with external surfaces, and importantly, interaction of the mechanism with flexible workpieces to capture force transfer in true sense. Features of constant force characteristics, e.g., magnitude(s) of the desired force(s), range of input displacement over which slope of the force displacement curve is near zero, and distance between workpiece and the mechanism are controlled individually via novel objectives proposed herein. Two of the constant output and constant input force mechanisms each, are synthesized using stochastic optimization ensuring ready manufacturability. We observe that presence of external surfaces may not be required for singlepiece mechanisms to attain constant force characteristics. However, interesting solutions are possible if mutual contact is permitted. We also note that desired force characteristics may not remain the same with alteration in the workpieces shape and (or) material properties. We finally fabricate and test the synthesized mechanisms and find that the desired constant force characteristics are by and large retained. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2201.01538v3-abstract-full').style.display = 'none'; document.getElementById('2201.01538v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 January, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 5 January, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">25 pages</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2106.15917">arXiv:2106.15917</a> <span> [<a href="https://arxiv.org/pdf/2106.15917">pdf</a>, <a href="https://arxiv.org/format/2106.15917">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="General Economics">econ.GN</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computers and Society">cs.CY</span> </div> </div> <p class="title is-5 mathjax"> Explaining Caste-based Digital Divide in India </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Vaidehi%2C+R">R Vaidehi</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+A+B">A Bheemeshwar Reddy</a>, <a href="/search/cs?searchtype=author&query=Banerjee%2C+S">Sudatta Banerjee</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2106.15917v1-abstract-short" style="display: inline;"> With the increasing importance of information and communication technologies in access to basic services like education and health, the question of the digital divide based on caste assumes importance in India where large socioeconomic disparities persist between different caste groups. Studies on caste-based digital inequality are still scanty in India. Using nationally representative survey data… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2106.15917v1-abstract-full').style.display = 'inline'; document.getElementById('2106.15917v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2106.15917v1-abstract-full" style="display: none;"> With the increasing importance of information and communication technologies in access to basic services like education and health, the question of the digital divide based on caste assumes importance in India where large socioeconomic disparities persist between different caste groups. Studies on caste-based digital inequality are still scanty in India. Using nationally representative survey data, this paper analyzes the first-level digital divide (ownership of computer and access to the internet) and the second-level digital divide (individual's skill to use computer and the internet) between the disadvantaged caste group and the others. Further, this paper identifies the caste group-based differences in socioeconomic factors that contribute to the digital divide between these groups using a non-linear decomposition method. The results show that there exists a large first-level and second-level digital divide between the disadvantaged caste groups and others in India. The non-linear decomposition results indicate that the caste-based digital divide in India is rooted in historical socioeconomic deprivation of disadvantaged caste groups. More than half of the caste-based digital gap is attributable to differences in educational attainment and income between the disadvantaged caste groups and others. The findings of this study highlight the urgent need for addressing educational and income inequality between the different caste groups in India in order to bridge the digital divide. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2106.15917v1-abstract-full').style.display = 'none'; document.getElementById('2106.15917v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 30 June, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2021. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2010.06969">arXiv:2010.06969</a> <span> [<a href="https://arxiv.org/pdf/2010.06969">pdf</a>, <a href="https://arxiv.org/format/2010.06969">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Social and Information Networks">cs.SI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Digital Libraries">cs.DL</span> </div> </div> <p class="title is-5 mathjax"> NwQM: A neural quality assessment framework for Wikipedia </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+B+P">Bhanu Prakash Reddy</a>, <a href="/search/cs?searchtype=author&query=Bhusan%2C+S">Sasi Bhusan</a>, <a href="/search/cs?searchtype=author&query=Sarkar%2C+S">Soumya Sarkar</a>, <a href="/search/cs?searchtype=author&query=Mukherjee%2C+A">Animesh Mukherjee</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2010.06969v1-abstract-short" style="display: inline;"> Millions of people irrespective of socioeconomic and demographic backgrounds, depend on Wikipedia articles everyday for keeping themselves informed regarding popular as well as obscure topics. Articles have been categorized by editors into several quality classes, which indicate their reliability as encyclopedic content. This manual designation is an onerous task because it necessitates profound k… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2010.06969v1-abstract-full').style.display = 'inline'; document.getElementById('2010.06969v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2010.06969v1-abstract-full" style="display: none;"> Millions of people irrespective of socioeconomic and demographic backgrounds, depend on Wikipedia articles everyday for keeping themselves informed regarding popular as well as obscure topics. Articles have been categorized by editors into several quality classes, which indicate their reliability as encyclopedic content. This manual designation is an onerous task because it necessitates profound knowledge about encyclopedic language, as well navigating circuitous set of wiki guidelines. In this paper we propose Neural wikipedia QualityMonitor (NwQM), a novel deep learning model which accumulates signals from several key information sources such as article text, meta data and images to obtain improved Wikipedia article representation. We present comparison of our approach against a plethora of available solutions and show 8% improvement over state-of-the-art approaches with detailed ablation studies. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2010.06969v1-abstract-full').style.display = 'none'; document.getElementById('2010.06969v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 14 October, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2020. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">EMNLP 2020: Long paper</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2010.05447">arXiv:2010.05447</a> <span> [<a href="https://arxiv.org/pdf/2010.05447">pdf</a>, <a href="https://arxiv.org/ps/2010.05447">ps</a>, <a href="https://arxiv.org/format/2010.05447">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Distributed, Parallel, and Cluster Computing">cs.DC</span> </div> </div> <p class="title is-5 mathjax"> Scalable Consensus Protocols for PoW based Blockchain and blockDAG </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+B+S">B Swaroopa Reddy</a>, <a href="/search/cs?searchtype=author&query=Sharma%2C+G+V+V">G V V Sharma</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2010.05447v2-abstract-short" style="display: inline;"> In this paper, we propose two models for scaling the transaction throughput in Proof-of-Work (PoW) based blockchain networks. In the first approach, a mathematical model has derived for optimal transaction throughput for PoW based longest chain rule blockchain. In this approach, the blockchain Peer-to-Peer (P2P) network is considered as Erd枚s-R茅nyi random network topology. This approach is however… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2010.05447v2-abstract-full').style.display = 'inline'; document.getElementById('2010.05447v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2010.05447v2-abstract-full" style="display: none;"> In this paper, we propose two models for scaling the transaction throughput in Proof-of-Work (PoW) based blockchain networks. In the first approach, a mathematical model has derived for optimal transaction throughput for PoW based longest chain rule blockchain. In this approach, the blockchain Peer-to-Peer (P2P) network is considered as Erd枚s-R茅nyi random network topology. This approach is however limited by the block creation rate, the results suggest that the rate beyond an optimal point can result in unfairness in the system. The second approach is a new consensus protocol proposed by considering the ledger as a Directed Acyclic Graph (DAG) called blockDAG instead of a chain of blocks. In this framework, we follow a two-step strategy that makes the system robust enough to handle the double-spend attacks. The first step involves the development of an unsupervised learning graph clustering algorithm for separating the blocks created by an attacker. In the second step, the attackers blocks are eliminated and the remaining blocks are arranged in topological order by honest clients which makes the blockDAG system suitable for smart contract applications found in Internet of Things (IoT) services. The Simulation results demonstrate a significant improvement in the transaction throughput compared to bitcoin. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2010.05447v2-abstract-full').style.display = 'none'; document.getElementById('2010.05447v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 July, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 12 October, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2020. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">12 pages</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2006.10385">arXiv:2006.10385</a> <span> [<a href="https://arxiv.org/pdf/2006.10385">pdf</a>, <a href="https://arxiv.org/ps/2006.10385">ps</a>, <a href="https://arxiv.org/format/2006.10385">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computational Engineering, Finance, and Science">cs.CE</span> </div> </div> <p class="title is-5 mathjax"> Topology synthesis of a 3-kink contact-aided compliant switch </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+B+V+S+N">B V S Nagendra Reddy</a>, <a href="/search/cs?searchtype=author&query=Saxena%2C+A">Anupam Saxena</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2006.10385v1-abstract-short" style="display: inline;"> A topology synthesis approach to design 2D Contact-aided Compliant Mechanisms (CCMs) to trace output paths with three or more kinks is presented. Synthesis process uses three different types of external, rigid contact surfaces: circular, elliptical and rectangular: which in combination, offer intricate local curvatures that CCMs can benefit from, to deliver desired, complex output characteristics.… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2006.10385v1-abstract-full').style.display = 'inline'; document.getElementById('2006.10385v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2006.10385v1-abstract-full" style="display: none;"> A topology synthesis approach to design 2D Contact-aided Compliant Mechanisms (CCMs) to trace output paths with three or more kinks is presented. Synthesis process uses three different types of external, rigid contact surfaces: circular, elliptical and rectangular: which in combination, offer intricate local curvatures that CCMs can benefit from, to deliver desired, complex output characteristics. A network of line elements is employed to generate topologies. A set of circular subregions is laid over this network, and external contact surfaces are generated within each subregion. Both, discrete and continuous design variables are employed: the former set controls the CCM topology, appearance and type of external contact surfaces, whereas the latter set governs shapes and sizes of the CCM constituents, and sizes of contact surfaces. All contact types are permitted with contact modeling made significantly easier through identification of outer and inner loops. Line topologies are fleshed out via a user-defined number of quadrilateral elements along lateral and longitudinal directions. Candidate CCM designs are carefully preprocessed before analysis via a commercial software and evolution using a stochastic search. The process is exemplified via a contact-aided, 3-kink mechanical switch which is thoroughly analysed in presence of friction and wear. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2006.10385v1-abstract-full').style.display = 'none'; document.getElementById('2006.10385v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 18 June, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2020. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">32 pages</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1906.08973">arXiv:1906.08973</a> <span> [<a href="https://arxiv.org/pdf/1906.08973">pdf</a>, <a href="https://arxiv.org/format/1906.08973">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Human-Computer Interaction">cs.HC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Retrieval">cs.IR</span> </div> </div> <p class="title is-5 mathjax"> Stuck? No worries!: Task-aware Command Recommendation and Proactive Help for Analysts </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Nambhi%2C+A+M">Aadhavan M. Nambhi</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+B+P">Bhanu Prakash Reddy</a>, <a href="/search/cs?searchtype=author&query=Agarwal%2C+A+P">Aarsh Prakash Agarwal</a>, <a href="/search/cs?searchtype=author&query=Verma%2C+G">Gaurav Verma</a>, <a href="/search/cs?searchtype=author&query=Singh%2C+H">Harvineet Singh</a>, <a href="/search/cs?searchtype=author&query=Burhanuddin%2C+I+A">Iftikhar Ahamath Burhanuddin</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1906.08973v1-abstract-short" style="display: inline;"> Data analytics software applications have become an integral part of the decision-making process of analysts. Users of such a software face challenges due to insufficient product and domain knowledge, and find themselves in need of help. To alleviate this, we propose a task-aware command recommendation system, to guide the user on what commands could be executed next. We rely on topic modeling tec… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1906.08973v1-abstract-full').style.display = 'inline'; document.getElementById('1906.08973v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1906.08973v1-abstract-full" style="display: none;"> Data analytics software applications have become an integral part of the decision-making process of analysts. Users of such a software face challenges due to insufficient product and domain knowledge, and find themselves in need of help. To alleviate this, we propose a task-aware command recommendation system, to guide the user on what commands could be executed next. We rely on topic modeling techniques to incorporate information about user's task into our models. We also present a help prediction model to detect if a user is in need of help, in which case the system proactively provides the aforementioned command recommendations. We leverage the log data of a web-based analytics software to quantify the superior performance of our neural models, in comparison to competitive baselines. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1906.08973v1-abstract-full').style.display = 'none'; document.getElementById('1906.08973v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 June, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2019. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">27th Conference on User Modeling, Adaptation and Personalization (UMAP'19)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1906.04678">arXiv:1906.04678</a> <span> [<a href="https://arxiv.org/pdf/1906.04678">pdf</a>, <a href="https://arxiv.org/format/1906.04678">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Social and Information Networks">cs.SI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Neural and Evolutionary Computing">cs.NE</span> </div> </div> <p class="title is-5 mathjax"> StRE: Self Attentive Edit Quality Prediction in Wikipedia </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Sarkar%2C+S">Soumya Sarkar</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+B+P">Bhanu Prakash Reddy</a>, <a href="/search/cs?searchtype=author&query=Sikdar%2C+S">Sandipan Sikdar</a>, <a href="/search/cs?searchtype=author&query=Mukherjee%2C+A">Animesh Mukherjee</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1906.04678v1-abstract-short" style="display: inline;"> Wikipedia can easily be justified as a behemoth, considering the sheer volume of content that is added or removed every minute to its several projects. This creates an immense scope, in the field of natural language processing towards developing automated tools for content moderation and review. In this paper we propose Self Attentive Revision Encoder (StRE) which leverages orthographic similarity… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1906.04678v1-abstract-full').style.display = 'inline'; document.getElementById('1906.04678v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1906.04678v1-abstract-full" style="display: none;"> Wikipedia can easily be justified as a behemoth, considering the sheer volume of content that is added or removed every minute to its several projects. This creates an immense scope, in the field of natural language processing towards developing automated tools for content moderation and review. In this paper we propose Self Attentive Revision Encoder (StRE) which leverages orthographic similarity of lexical units toward predicting the quality of new edits. In contrast to existing propositions which primarily employ features like page reputation, editor activity or rule based heuristics, we utilize the textual content of the edits which, we believe contains superior signatures of their quality. More specifically, we deploy deep encoders to generate representations of the edits from its text content, which we then leverage to infer quality. We further contribute a novel dataset containing 21M revisions across 32K Wikipedia pages and demonstrate that StRE outperforms existing methods by a significant margin at least 17% and at most 103%. Our pretrained model achieves such result after retraining on a set as small as 20% of the edits in a wikipage. This, to the best of our knowledge, is also the first attempt towards employing deep language models to the enormous domain of automated content moderation and review in Wikipedia. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1906.04678v1-abstract-full').style.display = 'none'; document.getElementById('1906.04678v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 June, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2019. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted in ACL 2019 , 9 pages</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1807.07455">arXiv:1807.07455</a> <span> [<a href="https://arxiv.org/pdf/1807.07455">pdf</a>, <a href="https://arxiv.org/format/1807.07455">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> Can Artificial Intelligence Reliably Report Chest X-Rays?: Radiologist Validation of an Algorithm trained on 2.3 Million X-Rays </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Putha%2C+P">Preetham Putha</a>, <a href="/search/cs?searchtype=author&query=Tadepalli%2C+M">Manoj Tadepalli</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+B">Bhargava Reddy</a>, <a href="/search/cs?searchtype=author&query=Raj%2C+T">Tarun Raj</a>, <a href="/search/cs?searchtype=author&query=Chiramal%2C+J+A">Justy Antony Chiramal</a>, <a href="/search/cs?searchtype=author&query=Govil%2C+S">Shalini Govil</a>, <a href="/search/cs?searchtype=author&query=Sinha%2C+N">Namita Sinha</a>, <a href="/search/cs?searchtype=author&query=KS%2C+M">Manjunath KS</a>, <a href="/search/cs?searchtype=author&query=Reddivari%2C+S">Sundeep Reddivari</a>, <a href="/search/cs?searchtype=author&query=Jagirdar%2C+A">Ammar Jagirdar</a>, <a href="/search/cs?searchtype=author&query=Rao%2C+P">Pooja Rao</a>, <a href="/search/cs?searchtype=author&query=Warier%2C+P">Prashant Warier</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1807.07455v2-abstract-short" style="display: inline;"> Background: Chest X-rays are the most commonly performed, cost-effective diagnostic imaging tests ordered by physicians. A clinically validated AI system that can reliably separate normals from abnormals can be invaluble particularly in low-resource settings. The aim of this study was to develop and validate a deep learning system to detect various abnormalities seen on a chest X-ray. Methods: A d… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1807.07455v2-abstract-full').style.display = 'inline'; document.getElementById('1807.07455v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1807.07455v2-abstract-full" style="display: none;"> Background: Chest X-rays are the most commonly performed, cost-effective diagnostic imaging tests ordered by physicians. A clinically validated AI system that can reliably separate normals from abnormals can be invaluble particularly in low-resource settings. The aim of this study was to develop and validate a deep learning system to detect various abnormalities seen on a chest X-ray. Methods: A deep learning system was trained on 2.3 million chest X-rays and their corresponding radiology reports to identify various abnormalities seen on a Chest X-ray. The system was tested against - 1. A three-radiologist majority on an independent, retrospectively collected set of 2000 X-rays(CQ2000) 2. Radiologist reports on a separate validation set of 100,000 scans(CQ100k). The primary accuracy measure was area under the ROC curve (AUC), estimated separately for each abnormality and for normal versus abnormal scans. Results: On the CQ2000 dataset, the deep learning system demonstrated an AUC of 0.92(CI 0.91-0.94) for detection of abnormal scans, and AUC(CI) of 0.96(0.94-0.98), 0.96(0.94-0.98), 0.95(0.87-1), 0.95(0.92-0.98), 0.93(0.90-0.96), 0.89(0.83-0.94), 0.91(0.87-0.96), 0.94(0.93-0.96), 0.98(0.97-1) for the detection of blunted costophrenic angle, cardiomegaly, cavity, consolidation, fibrosis, hilar enlargement, nodule, opacity and pleural effusion. The AUCs were similar on the larger CQ100k dataset except for detecting normals where the AUC was 0.86(0.85-0.86). Interpretation: Our study demonstrates that a deep learning algorithm trained on a large, well-labelled dataset can accurately detect multiple abnormalities on chest X-rays. As these systems improve in accuracy, applying deep learning to widen the reach of chest X-ray interpretation and improve reporting efficiency will add tremendous value in radiology workflows and public health screenings globally. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1807.07455v2-abstract-full').style.display = 'none'; document.getElementById('1807.07455v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 4 June, 2019; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 19 July, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2018. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">v2</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1606.00410">arXiv:1606.00410</a> <span> [<a href="https://arxiv.org/pdf/1606.00410">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</span> </div> </div> <p class="title is-5 mathjax"> The binary primes sequence for computational hardening of pseudorandom sequences </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+B+P">B. Prashanth Reddy</a>, <a href="/search/cs?searchtype=author&query=Kak%2C+S">Subhash Kak</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1606.00410v1-abstract-short" style="display: inline;"> This paper proposes the use of the binary primes sequence to strengthen pseudorandom (PN) decimal sequences for cryptography applications. The binary primes sequence is added to the PN decimal sequence (where one can choose from many arbitrary shift values) and it is shown that the sum sequence has improved autocorrelation properties besides being computationally hard. Also, an analysis on the com… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1606.00410v1-abstract-full').style.display = 'inline'; document.getElementById('1606.00410v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1606.00410v1-abstract-full" style="display: none;"> This paper proposes the use of the binary primes sequence to strengthen pseudorandom (PN) decimal sequences for cryptography applications. The binary primes sequence is added to the PN decimal sequence (where one can choose from many arbitrary shift values) and it is shown that the sum sequence has improved autocorrelation properties besides being computationally hard. Also, an analysis on the computational complexity is performed and it is shown that the complexity for the eavesdropper is of exponential complexity and therefore, the proposed method is an attractive procedure for cryptographic applications. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1606.00410v1-abstract-full').style.display = 'none'; document.getElementById('1606.00410v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 1 June, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">8 pages</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1507.00712">arXiv:1507.00712</a> <span> [<a href="https://arxiv.org/pdf/1507.00712">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</span> </div> </div> <p class="title is-5 mathjax"> New Class of Pseudorandom D-sequences to Generate Cryptographic Keys </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+B+P">B. Prashanth Reddy</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1507.00712v1-abstract-short" style="display: inline;"> This article proposes the use of pseudorandom decimal sequences that have gone through an additional random mapping for the design of cryptographic keys. These sequences are generated by starting with inverse prime expansions in base 3 and then replacing 2 in the expansion with either the string 01 or 10 based on the preceding bit, which represents a general mapping. We show that the resulting pse… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1507.00712v1-abstract-full').style.display = 'inline'; document.getElementById('1507.00712v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1507.00712v1-abstract-full" style="display: none;"> This article proposes the use of pseudorandom decimal sequences that have gone through an additional random mapping for the design of cryptographic keys. These sequences are generated by starting with inverse prime expansions in base 3 and then replacing 2 in the expansion with either the string 01 or 10 based on the preceding bit, which represents a general mapping. We show that the resulting pseudorandom sequences have excellent autocorrelation properties. Such a method can be extended to inverse prime expansions to any base. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1507.00712v1-abstract-full').style.display = 'none'; document.getElementById('1507.00712v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 2 July, 2015; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2015. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">8 pages, 6 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1506.04650">arXiv:1506.04650</a> <span> [<a href="https://arxiv.org/pdf/1506.04650">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</span> </div> </div> <p class="title is-5 mathjax"> Coding Side-Information for Implementing Cubic Transformation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+B+P">B. Prashanth Reddy</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1506.04650v1-abstract-short" style="display: inline;"> This paper considers the implementation of the cubic public-key transformation, a public-key cryptographic scheme that requires sending of additional side-information. A coding scheme for the side-information, based on the residue number system, is presented. In the conventional one-to-one encryption mapping also, such coding can be used to send additional like that of watermarking, which could be… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1506.04650v1-abstract-full').style.display = 'inline'; document.getElementById('1506.04650v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1506.04650v1-abstract-full" style="display: none;"> This paper considers the implementation of the cubic public-key transformation, a public-key cryptographic scheme that requires sending of additional side-information. A coding scheme for the side-information, based on the residue number system, is presented. In the conventional one-to-one encryption mapping also, such coding can be used to send additional like that of watermarking, which could be used to detect man-in-the-middle attacks or used for authentication. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1506.04650v1-abstract-full').style.display = 'none'; document.getElementById('1506.04650v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 15 June, 2015; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2015. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">12 pages, 9 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1212.2531">arXiv:1212.2531</a> <span> [<a href="https://arxiv.org/pdf/1212.2531">pdf</a>, <a href="https://arxiv.org/format/1212.2531">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Other Computer Science">cs.OH</span> </div> </div> <p class="title is-5 mathjax"> Enhanced Image Analysis Using Cached Mobile Robots </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Mohammed%2C+K">Kabeer Mohammed</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+D+B">Dr. Bhaskara Reddy</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1212.2531v1-abstract-short" style="display: inline;"> In the field of Artificial intelligence Image processing plays a vital role in Decision making. Nowadays Mobile robots work as a Network sharing Centralized Database. All Image inputs are compared against this database and decision is made. In some cases the Centralized database is in other side of the globe and Mobile robots compare Input image through satellite link this sometime results in dela… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1212.2531v1-abstract-full').style.display = 'inline'; document.getElementById('1212.2531v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1212.2531v1-abstract-full" style="display: none;"> In the field of Artificial intelligence Image processing plays a vital role in Decision making. Nowadays Mobile robots work as a Network sharing Centralized Database. All Image inputs are compared against this database and decision is made. In some cases the Centralized database is in other side of the globe and Mobile robots compare Input image through satellite link this sometime results in delays in decision making which may result in castrophe. This Research paper is about how to make image processing in mobile robots less time consuming and fast decision making. This research paper compares search techniques employed currently and optimum search method which we are going to state. Nowadays Mobile robots are extensively used in environments which are dangerous to human beings. In this dangerous situations quick Decision making makes the difference between Hit and Miss this can also results in Day to day tasks performed by Mobile robots Successful or Failure. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1212.2531v1-abstract-full').style.display = 'none'; document.getElementById('1212.2531v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 December, 2012; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2012. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">6 Pages one flowchart</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1212.0317">arXiv:1212.0317</a> <span> [<a href="https://arxiv.org/pdf/1212.0317">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Databases">cs.DB</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.5120/9255-3424">10.5120/9255-3424 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> An Improved UP-Growth High Utility Itemset Mining </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+B+A">B. Adinarayana Reddy</a>, <a href="/search/cs?searchtype=author&query=Rao%2C+O+S">O. Srinivasa Rao</a>, <a href="/search/cs?searchtype=author&query=Prasad%2C+M+H+M+K">M. H. M. Krishna Prasad</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1212.0317v1-abstract-short" style="display: inline;"> Efficient discovery of frequent itemsets in large datasets is a crucial task of data mining. In recent years, several approaches have been proposed for generating high utility patterns, they arise the problems of producing a large number of candidate itemsets for high utility itemsets and probably degrades mining performance in terms of speed and space. Recently proposed compact tree structure, vi… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1212.0317v1-abstract-full').style.display = 'inline'; document.getElementById('1212.0317v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1212.0317v1-abstract-full" style="display: none;"> Efficient discovery of frequent itemsets in large datasets is a crucial task of data mining. In recent years, several approaches have been proposed for generating high utility patterns, they arise the problems of producing a large number of candidate itemsets for high utility itemsets and probably degrades mining performance in terms of speed and space. Recently proposed compact tree structure, viz., UP Tree, maintains the information of transactions and itemsets, facilitate the mining performance and avoid scanning original database repeatedly. In this paper, UP Tree (Utility Pattern Tree) is adopted, which scans database only twice to obtain candidate items and manage them in an efficient data structured way. Applying UP Tree to the UP Growth takes more execution time for Phase II. Hence this paper presents modified algorithm aiming to reduce the execution time by effectively identifying high utility itemsets. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1212.0317v1-abstract-full').style.display = 'none'; document.getElementById('1212.0317v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 3 December, 2012; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2012. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">(0975 8887)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> International Journal of Computer Applications Volume 58, No.2, 2012, 25-28 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1209.4015">arXiv:1209.4015</a> <span> [<a href="https://arxiv.org/pdf/1209.4015">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Other Computer Science">cs.OH</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.5121/sipij.2012.3416">10.5121/sipij.2012.3416 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Performance Analysis of MIMO Radar Waveform using Accelerated Particle Swarm Optimization Algorithm </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+B+R">B. Roja Reddy</a>, <a href="/search/cs?searchtype=author&query=M%2C+U+K+.">Uttara Kumari . M</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1209.4015v1-abstract-short" style="display: inline;"> The Accelerated Particle Swarm Optimization Algorithm is promoted to numerically design orthogonal Discrete Frequency Waveforms and Modified Discrete Frequency Waveforms (DFCWs) with good correlation properties for MIMO radar. We employ Accelerated Particle Swarm Optimization algorithm (ACC_PSO), Particles of a swarm communicate good positions, velocity and accelerations to each other as well as d… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1209.4015v1-abstract-full').style.display = 'inline'; document.getElementById('1209.4015v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1209.4015v1-abstract-full" style="display: none;"> The Accelerated Particle Swarm Optimization Algorithm is promoted to numerically design orthogonal Discrete Frequency Waveforms and Modified Discrete Frequency Waveforms (DFCWs) with good correlation properties for MIMO radar. We employ Accelerated Particle Swarm Optimization algorithm (ACC_PSO), Particles of a swarm communicate good positions, velocity and accelerations to each other as well as dynamically adjust their own position, velocity and acceleration derived from the best of all particles. The simulation results show that the proposed algorithm is effective for the design of DFCWs signal used in MIMO radar. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1209.4015v1-abstract-full').style.display = 'none'; document.getElementById('1209.4015v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 15 September, 2012; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2012. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">10 pages, 10 figures, Signal & Image Processing : An International Journal (SIPIJ), August 2012</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1208.4809">arXiv:1208.4809</a> <span> [<a href="https://arxiv.org/pdf/1208.4809">pdf</a>, <a href="https://arxiv.org/format/1208.4809">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Databases">cs.DB</span> </div> </div> <p class="title is-5 mathjax"> Comparing N-Node Set Importance Representative results with Node Importance Representative results for Categorical Clustering: An exploratory study </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+H+V">H. Venkateswara Reddy</a>, <a href="/search/cs?searchtype=author&query=Raju%2C+D+S+V">Dr. S. Viswanadha Raju</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+B+R">B. Ramasubba Reddy</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1208.4809v1-abstract-short" style="display: inline;"> The proportionate increase in the size of the data with increase in space implies that clustering a very large data set becomes difficult and is a time consuming process.Sampling is one important technique to scale down the size of dataset and to improve the efficiency of clustering. After sampling allocating unlabeled objects into proper clusters is impossible in the categorical domain.To address… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1208.4809v1-abstract-full').style.display = 'inline'; document.getElementById('1208.4809v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1208.4809v1-abstract-full" style="display: none;"> The proportionate increase in the size of the data with increase in space implies that clustering a very large data set becomes difficult and is a time consuming process.Sampling is one important technique to scale down the size of dataset and to improve the efficiency of clustering. After sampling allocating unlabeled objects into proper clusters is impossible in the categorical domain.To address the problem, Chen employed a method called MAximal Representative Data Labeling to allocate each unlabeled data point to the appropriate cluster based on Node Importance Representative and N-Node Importance Representative algorithms. This paper took off from Chen s investigation and analyzed and compared the results of NIR and NNIR leading to the conclusion that the two processes contradict each other when it comes to finding the resemblance between an unlabeled data point and a cluster.A new and better way of solving the problem was arrived at that finds resemblance between unlabeled data point within all clusters, while also providing maximal resemblance for allocation of data in the required cluster. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1208.4809v1-abstract-full').style.display = 'none'; document.getElementById('1208.4809v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 August, 2012; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2012. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">16 pages, 4 figures, 3 equations</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1101.2242">arXiv:1101.2242</a> <span> [<a href="https://arxiv.org/pdf/1101.2242">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Modelling to study its non-linear effects on Communication System's performance with BER as performance measure </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Kumar%2C+A+M">Aripirala Manoj Kumar</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+G+B">G. Bharath Reddy</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+G+K+C">G. Krishna Chaitanya Reddy</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1101.2242v1-abstract-short" style="display: inline;"> This paper is a study of non-linear effects of RF Amplifiers on Communication Systems Performance. High speed data communication is made possible by Multilevel Modulation schemes. This paper presents a study of these non linear effects on multilevel Modulation schemes like MPSK and MQAM. We make use of Bit Error Ratio (BER) as performance measure. BER vs SNR (Signal-to-Noise Ratio) curves provide… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1101.2242v1-abstract-full').style.display = 'inline'; document.getElementById('1101.2242v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1101.2242v1-abstract-full" style="display: none;"> This paper is a study of non-linear effects of RF Amplifiers on Communication Systems Performance. High speed data communication is made possible by Multilevel Modulation schemes. This paper presents a study of these non linear effects on multilevel Modulation schemes like MPSK and MQAM. We make use of Bit Error Ratio (BER) as performance measure. BER vs SNR (Signal-to-Noise Ratio) curves provide comparison between the non linear effects caused by Gain Compression in particular. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1101.2242v1-abstract-full').style.display = 'none'; document.getElementById('1101.2242v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 31 December, 2010; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2011. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1003.5435">arXiv:1003.5435</a> <span> [<a href="https://arxiv.org/pdf/1003.5435">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Multimedia">cs.MM</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.5121/ijngn.2010.2104">10.5121/ijngn.2010.2104 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Image Compression and Watermarking scheme using Scalar Quantization </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Swamy%2C+K+V">Kilari Veera Swamy</a>, <a href="/search/cs?searchtype=author&query=Mohan%2C+B+C">B. Chandra Mohan</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+Y+V+B">Y. V. Bhaskar Reddy</a>, <a href="/search/cs?searchtype=author&query=Kumar%2C+S+S">S. Srinivas Kumar</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1003.5435v1-abstract-short" style="display: inline;"> This paper presents a new compression technique and image watermarking algorithm based on Contourlet Transform (CT). For image compression, an energy based quantization is used. Scalar quantization is explored for image watermarking. Double filter bank structure is used in CT. The Laplacian Pyramid (LP) is used to capture the point discontinuities, and then followed by a Directional Filter Bank (D… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1003.5435v1-abstract-full').style.display = 'inline'; document.getElementById('1003.5435v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1003.5435v1-abstract-full" style="display: none;"> This paper presents a new compression technique and image watermarking algorithm based on Contourlet Transform (CT). For image compression, an energy based quantization is used. Scalar quantization is explored for image watermarking. Double filter bank structure is used in CT. The Laplacian Pyramid (LP) is used to capture the point discontinuities, and then followed by a Directional Filter Bank (DFB) to link point discontinuities. The coefficients of down sampled low pass version of LP decomposed image are re-ordered in a pre-determined manner and prediction algorithm is used to reduce entropy (bits/pixel). In addition, the coefficients of CT are quantized based on the energy in the particular band. The superiority of proposed algorithm to JPEG is observed in terms of reduced blocking artifacts. The results are also compared with wavelet transform (WT). Superiority of CT to WT is observed when the image contains more contours. The watermark image is embedded in the low pass image of contourlet decomposition. The watermark can be extracted with minimum error. In terms of PSNR, the visual quality of the watermarked image is exceptional. The proposed algorithm is robust to many image attacks and suitable for copyright protection applications. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1003.5435v1-abstract-full').style.display = 'none'; document.getElementById('1003.5435v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 29 March, 2010; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2010. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">11 Pages, IJNGN Journal 2010</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> International Journal of Next-Generation Networks 2.1 (2010) 37-47 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1002.1156">arXiv:1002.1156</a> <span> [<a href="https://arxiv.org/pdf/1002.1156">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> </div> <p class="title is-5 mathjax"> Dimensionality Reduction: An Empirical Study on the Usability of IFE-CF (Independent Feature Elimination- by C-Correlation and F-Correlation) Measures </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Reddy%2C+M+B">M. Babu Reddy</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+L+S+S">L. S. S. Reddy</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1002.1156v1-abstract-short" style="display: inline;"> The recent increase in dimensionality of data has thrown a great challenge to the existing dimensionality reduction methods in terms of their effectiveness. Dimensionality reduction has emerged as one of the significant preprocessing steps in machine learning applications and has been effective in removing inappropriate data, increasing learning accuracy, and improving comprehensibility. Feature… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1002.1156v1-abstract-full').style.display = 'inline'; document.getElementById('1002.1156v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1002.1156v1-abstract-full" style="display: none;"> The recent increase in dimensionality of data has thrown a great challenge to the existing dimensionality reduction methods in terms of their effectiveness. Dimensionality reduction has emerged as one of the significant preprocessing steps in machine learning applications and has been effective in removing inappropriate data, increasing learning accuracy, and improving comprehensibility. Feature redundancy exercises great influence on the performance of classification process. Towards the better classification performance, this paper addresses the usefulness of truncating the highly correlated and redundant attributes. Here, an effort has been made to verify the utility of dimensionality reduction by applying LVQ (Learning Vector Quantization) method on two Benchmark datasets of 'Pima Indian Diabetic patients' and 'Lung cancer patients'. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1002.1156v1-abstract-full').style.display = 'none'; document.getElementById('1002.1156v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 5 February, 2010; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2010. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">International Journal of Computer Science Issues, IJCSI, Vol. 7, Issue 1, No. 1, January 2010, http://ijcsi.org</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> International Journal of Computer Science Issues, IJCSI, Vol. 7, Issue 1, No. 1, January 2010, http://ijcsi.org/articles/Dimensionality-Reduction-An-Empirical-Study-on-the-Usability-of-IFE-CF-(Independent-Feature-Elimination-by-C-Correlation-and-F-Correlation)-Measures.php </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/cs/0305004">arXiv:cs/0305004</a> <span> [<a href="https://arxiv.org/pdf/cs/0305004">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computation and Language">cs.CL</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Approximate Grammar for Information Extraction </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Sriram%2C+V">V. Sriram</a>, <a href="/search/cs?searchtype=author&query=Reddy%2C+B+R+S">B. Ravi Sekar Reddy</a>, <a href="/search/cs?searchtype=author&query=Sangal%2C+R">R. Sangal</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="cs/0305004v1-abstract-short" style="display: inline;"> In this paper, we present the concept of Approximate grammar and how it can be used to extract information from a documemt. As the structure of informational strings cannot be defined well in a document, we cannot use the conventional grammar rules to represent the information. Hence, the need arises to design an approximate grammar that can be used effectively to accomplish the task of Informat… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0305004v1-abstract-full').style.display = 'inline'; document.getElementById('cs/0305004v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="cs/0305004v1-abstract-full" style="display: none;"> In this paper, we present the concept of Approximate grammar and how it can be used to extract information from a documemt. As the structure of informational strings cannot be defined well in a document, we cannot use the conventional grammar rules to represent the information. Hence, the need arises to design an approximate grammar that can be used effectively to accomplish the task of Information extraction. Approximate grammars are a novel step in this direction. The rules of an approximate grammar can be given by a user or the machine can learn the rules from an annotated document. We have performed our experiments in both the above areas and the results have been impressive. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0305004v1-abstract-full').style.display = 'none'; document.getElementById('cs/0305004v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 May, 2003; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2003. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">10 pages, 3 figures, 2 tables, Presented at "International Conference on Universal Knowledge and Language, Goa'2002"</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">ACM Class:</span> I.2.7 </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Conference on Universal Knowledge and Language, Goa'2002 </p> </li> </ol> <div class="is-hidden-tablet">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> </main> <footer> <div class="columns is-desktop" role="navigation" aria-label="Secondary">  <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/about">About</a></li> <li><a href="https://info.arxiv.org/help">Help</a></li> </ul> </div> <div class="column"> <ul class="nav-spaced"> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>contact arXiv</title><desc>Click here to contact arXiv</desc><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg> <a href="https://info.arxiv.org/help/contact.html"> Contact</a> </li> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>subscribe to arXiv mailings</title><desc>Click here to subscribe</desc><path d="M476 3.2L12.5 270.6c-18.1 10.4-15.8 35.6 2.2 43.2L121 358.4l287.3-253.2c5.5-4.9 13.3 2.6 8.6 8.3L176 407v80.5c0 23.6 28.5 32.9 42.5 15.8L282 426l124.6 52.2c14.2 6 30.4-2.9 33-18.2l72-432C515 7.8 493.3-6.8 476 3.2z"/></svg> <a href="https://info.arxiv.org/help/subscribe"> Subscribe</a> </li> </ul> </div> </div> </div>   <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/license/index.html">Copyright</a></li> <li><a href="https://info.arxiv.org/help/policies/privacy_policy.html">Privacy Policy</a></li> </ul> </div> <div class="column sorry-app-links"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/web_accessibility.html">Web Accessibility Assistance</a></li> <li> <p class="help"> <a class="a11y-main-link" href="https://status.arxiv.org" target="_blank">arXiv Operational Status <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 256 512" class="icon filter-dark_grey" role="presentation"><path d="M224.3 273l-136 136c-9.4 9.4-24.6 9.4-33.9 0l-22.6-22.6c-9.4-9.4-9.4-24.6 0-33.9l96.4-96.4-96.4-96.4c-9.4-9.4-9.4-24.6 0-33.9L54.3 103c9.4-9.4 24.6-9.4 33.9 0l136 136c9.5 9.4 9.5 24.6.1 34z"/></svg></a><br> Get status notifications via <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/email/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg>email</a> or <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/slack/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-black" role="presentation"><path d="M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.84c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.98c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.96 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.98 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.88c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.84c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"/></svg>slack</a> </p> </li> </ul> </div> </div> </div>  </div> </footer> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/member_acknowledgement.js"></script> </body> </html>

CINXE.COM

Search | arXiv e-print repository