检索结果-内蒙古大学图书馆

24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021 and 25th International Conference on Randomization and Computation, RANDOM 2021

作者： Bishnu, Arijit Ghosh, Arijit Mishra, Gopinath Paraashar, Manaswi Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9783959772075

In this work, we resolve the query complexity of global minimum cut problem for a graph by designing a randomized algorithm for approximating the size of minimum cut in a graph, where the graph can be accessed through local queries like Degree, Neighbor, and Adjacency queries. Given ϵ ∈ (0, 1), the algorithm with high probability outputs an estimate t satisfying the following (1 − ϵ)t ≤ t ≤ (1 + ϵ)t, where t is the size of minimum cut in the graph. The expected number of local queries used by our algorithm is min {m + n, mt poly (log n, 1ϵ) where n and m are the number of vertices and edges in the graph, respectively. Eden and Rosenbaum showed that Ω(m/t) local queries are required for approximating the size of minimum cut in graphs, but no local query based algorithm was known. Our algorithmic result coupled with the lower bound of Eden and Rosenbaum [APPROX 2018] resolve the query complexity of the problem of estimating the size of minimum cut in graphs using local queries. Building on the lower bound of Eden and Rosenbaum, we show that, for all t ∈ N, Ω(m) local queries are required to decide if the size of the minimum cut in the graph is t or t − 2. Also, we show that, for any t ∈ N, Ω(m) local queries are required to find all the minimum cut edges even if it is promised that the input graph has a minimum cut of size t. Both of our lower bound results are randomized, and hold even if we can make Random Edge queries in addition to local queries. © Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar;licensed under Creative Commons License CC-BY 4.0

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Pre-emptive Spectrum Access in Cognitive Radio for Better QoS 4th

Pre-emptive Spectrum Access in Cognitive Radio for Better Q...

引用

4th International Conference on advanced computing and Intelligent Engineering, ICACIE 2019

作者： Das, Avirup Karar, Sandip Das, Nabanita Ghosh, Sasthi C. Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9789811565830

Cognitive radio techniques are becoming very popular to overcome the spectrum scarcity. For dynamic channel access, spectrum latency is a major bottleneck to achieve good QoS. In this paper, we have proposed distributed proactive channel scanning for different channel assignment policies of primary users (PUs). From periodic channel scanning, secondary users (SUs) store recent history of channel occupancy, and based on that decide the order of channel selection when demand comes, and switch channels proactively, if any better channel appears. For various channel allocation strategies of primary users, different channel selection algorithms are presented for secondary users to improve the spectrum latency as well as the channel switching overhead per call. Through simulation, the performance of the proposed strategies is compared with that of conventional cognitive radio. Results show that by the proposed scheme, the call drop/block rate decreases by more than 30 % with significant reduction in interference, and hence improving the QoS of the system. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

Machine Learning based Decoding of Heavy Hexagonal QECC for Asymmetric Quantum Noise

Machine Learning based Decoding of Heavy Hexagonal QECC for ...

引用

IEEE Computer Society Annual Symposium on VLSI

作者： Debasmita Bhoumik Ritajit Majumdar Dhiraj Madan Susmita Sur-Kolay Advanced Computing and Microelectronics Unit Indian Statistical Institute India IBM Quantum IBM India Research Lab

ISBN: (数字)9798350354119

ISBN: (纸本)9798350354126

Decoding error syndromes for topological quantum error correcting codes, such as surface and heavy hexagonal codes, is computationally expensive. While minimum weight perfect matching (MWPM) algorithms have been commonly used for decoding, recent works have demonstrated the efficacy of machine learning (ML), particularly neural networks, in decoding syndromes for these codes. In this study, we introduce a ML-based decoder tailored to heavy hexagonal code to address asymmetric noise channels which reflect real-world scenario better than the depolarization model considered in previous works. Our proposed decoder shows $\sim 5\times$ and $\sim 22\times$ improvements in the threshold values for amplitude and amplitude-phase damping noise models respectively over MWPM methods. Our decoder is also robust to changes in asymmetry, with the threshold reducing by only ~ 3.6% for a $10\times$ change in asymmetry.

关键词： Damping Quantum computing Machine learning algorithms Noise Neural networks Machine learning Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

MAB based Network Selection mechanism for URLLC users in RIS assisted network 21

MAB based Network Selection mechanism for URLLC users in RIS...

引用

21st IEEE International Symposium on Network computing and Applications, NCA 2022

作者： Deb, Souvik Ghosh, Shankar Kumar Ghosh, Sasthi C. Indian Statistical Institute Advanced Computing & Microelectronics Unit Kolkata India Shiv Nadar Institution of Eminence Department of CSE NCR Delhi India

ISBN: (纸本)9798350397307

In this work, a network selection mechanism for re-configurable intelligent surface (RIS) assisted network has been proposed. The goal of the proposed mechanism is to select appropriate base station (BS) or BS-RIS pair to maximize user throughput while satisfying the delay and reliability constraints of uRLLC users. First, the network selection mechanism for RIS assisted network has been formulated as multi arm bandit (MAB) problem;Then, based on the formulation, a network selection strategy has been proposed. Finally, through extensive system level simulations, it has been shown that the proposed scheme outperforms the existing A3 handover scheme in terms of reliability and user throughput. © 2022 IEEE.

关键词： Interlocking signals

来源：评论

学校读者我要写书评

暂无评论

Fault Secured JPEG-Codec Hardware Accelerator with Piracy Detective Control using Secure Fingerprint Template 36

Fault Secured JPEG-Codec Hardware Accelerator with Piracy De...

引用

36th IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems, DFT 2023

作者： Chaurasia, Rahul Reddy Asireddy, Abhinav Sengupta, Anirban Indian Institute of Technology Computer Science and Engineering Indore India Indian Institute of Technology Department of Computer Science and Engineering Indore India Indian Statistical Institute Advanced Computing and Microelectronics Unit Kolkata India

ISBN: (纸本)9798350315004

This paper presents a novel methodology to design fault secured JPEG-compression-decompression (codec) hardware accelerator with piracy detective control using secure fingerprint template of intellectual property (IP) vendor. In the proposed approach, firstly, the fault secured schedule for JPEG-codec design is generated from its behavioral description. Subsequently, in order to enable detective control against piracy, secure digital template corresponding to fingerprint biometric of IP vendor is generated and implanted into the design. In order to do so, firstly, fingerprint features are transformed based on IP vendor specified key-set. Subsequently, the generated secure fingerprint template in the form of encoded hardware security constraints is implanted into the design during behavioral/ high-level synthesis phase of integrated circuit (IC) design. The implanted hardware security constraints thereby ensure the seamless detection and isolation of fake/pirated design versions during piracy detection process, before their conjunction into system on chip (SoC) of electronic systems. The proposed approach achieves the following: i) fault secured hardware accelerator for JPEG-codec with integrated piracy detective control at negligible design cost overhead ii) higher resiliency against tampering attack and iii) lower probability of coincidence (indicating definitive proof of ownership for genuine IP vendor). © 2023 IEEE.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Resource-aware scheduling of multiple quantum circuits on a hardware device

arXiv

引用

arXiv 2024年

作者： Bhoumik, Debasmita Majumdar, Ritajit Sur-Kolay, Susmita Advanced Computing & Microelectronics Unit Indian Statistical Institute India IBM Quantum IBM India Research Lab India

Recent quantum technologies and quantum error-correcting codes emphasize the requirement for arranging interacting qubits in a nearest-neighbor (NN) configuration while mapping a quantum circuit onto a given hardware device, in order to avoid undesirable noise. It is equally important to minimize the wastage of qubits in a quantum hardware device with m qubits while running circuits of n qubits in total, with n © 2024, CC BY.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Mutual Visibility by Fat Robots with Slim Omnidirectional Camera

arXiv

引用

arXiv 2022年

作者： Bose, Kaustav Chakraborty, Abhinav Mukhopadhyaya, Krishnendu Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

In the existing literature of the MUTUAL VISIBILITY problem for autonomous robot swarms, the adopted visibility models have some idealistic assumptions that are not consistent with practical sensing device implementations. This paper investigates the problem in the more realistic visibility model called opaque fat robots with slim omnidirectional camera. The robots are modeled as unit disks, each having an omnidirectional camera represented as a disk of smaller size. We assume that the robots have compasses that allow agreement in the direction and orientation of both axes of their local coordinate systems. The robots are equipped with visible lights which serve as a medium of communication and also as a form of memory. We present a distributed algorithm for the MUTUAL VISIBILITY problem which is provably correct in the semi-synchronous setting. Our algorithm also provides a solution for LEADER ELECTION which we use as a subroutine in our main algorithm. Although LEADER ELECTION is trivial with two axis agreement in the full visibility model, it is challenging in our case and is of independent interest. Copyright © 2022, The Authors. All rights reserved.

关键词： Visibility

来源：评论

学校读者我要写书评

暂无评论

Message Complexity of Multi-Valued Implicit Agreement with Shared Random Bits 22

Message Complexity of Multi-Valued Implicit Agreement with S...

引用

23rd International Conference on Distributed computing and Networking, ICDCN 2022

作者： Bose, Kaustav Molla, Anisur Rahaman Advanced Computing and Microelectronics Unit Indian Statistical Institute India R. C. Bose Centre for Cryptology and Security Indian Statistical Institute India

ISBN: (纸本)9781450395601

An agreement protocol enables a system of n nodes in a distributed network to agree on a common input value. In the implicit version of the problem, only a subset of the nodes are required to decide the common value. This paper focuses on the message complexity of randomized implicit agreement in synchronous distributed networks. It has been shown by Augustine et al. [PODC 2018] that if the nodes have access to a shared coin, then implicit agreement can be solved with high probability1 using messages2 in expectation. However, their algorithm works only for binary input values, i.e, the input values given to the nodes are from the set {0, 1}. In this paper, we extended the result to the multi-valued setting where the input values may come from a larger but constant sized domain. We present an algorithm that solves the multi-valued implicit agreement problem with matching performance guarantees as in binary agreement. © 2022 ACM.

关键词： Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A Framework for Tile Processing on Edge Servers for Roadside Traffic Surveillance 23

A Framework for Tile Processing on Edge Servers for Roadside...

引用

Proceedings of the 7th International Conference on Algorithms, computing and Systems

作者： Saumya Jaipuria Arani Bhattacharya Ansuman Banerjee Advanced Computing and Microelectronics Unit Indian Statistical Institute India Department of Computer Science Indraprastha Institute of Information Technology India

ISBN: (纸本)9798400709098

Roadside traffic monitoring is increasingly performed by deploying roadside high-resolution video cameras and then running Computer Vision (CV) models on the video data. Since computer vision models are compute-intensive as they utilize Deep Neural Networks (DNNs), the data is usually sent to one or more edge servers located adjacent to mobile base stations. Recent techniques propose running CV models on tiles of videos separately to detect and track small objects. Several CV models exist, each with different requirements of compute and memory. Since more compute and memory-intensive CV models provide higher accuracy, a key challenge of such techniques is to determine which vision model should be used on which tile. This becomes even more challenging if multiple videos are processed by the same edge server. In this paper, we first formulate this problem of model selection on edge devices as an Integer Linear Programming (ILP) problem, and then propose a heuristic to solve it. Our experiments show that it is quite effective in practice.

关键词： Computer Vision Edge computing Integer Linear Programming

来源：评论

学校读者我要写书评

暂无评论

A Fast Community-based Approach for Discovering Anomalies in Evolutionary Networks 14

A Fast Community-based Approach for Discovering Anomalies in...

引用

14th International Conference on COMmunication Systems and NETworkS, COMSNETS 2022

作者： Ghoshal, Arnab Kumar Das, Nabanita Das, Soham Asutosh College Department of Computer Science Kolkata India Indian Statistical Institute Advanced Computing and Microelectronics Unit Kolkata India Microsoft Corporation RedmondWA United States

ISBN: (纸本)9781665421041

Many real-life networks such as social networks, biological networks, citation networks etc., are temporally evolving by nature. In general, the evolution takes place gradually with time. But occasionally, the nodes may exhibit anomalous behavior that is to be detected and reported in real time. In this work, for anomaly detection in evolutionary networks, an action based approach is followed taking into account the network topology. The network is represented as a temporal stream of weighted graphs, where edge weights stand for frequency or power of actions. A new definition of anomaly score is introduced for nodes based on its action history. To reduce the search space, the community structure of the graph is exploited. It has been shown that only the nodes having multiple community membership are enough to detect anomaly in a temporally evolving network with overlapping community structure. To the best of our knowledge, this is the first work to exploit the overlapping community structure of an evolutionary network to identify the graph snapshots containing anomalous events. Experimental studies on both synthetic and real-world evolutionary networks show that the proposed technique achieves almost 16% improvement in F-Score compared to the state-of-the-art algorithms. Moreover, parallel implementation of the proposed technique results nearly 10× speedup making it suitable for real time computation of anomaly in evolutionary networks. © 2022 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：