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

arXiv 2023年

作者： Mukherjee, Priyadarshi Psomas, Constantinos Krikidis, Ioannis Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India Department of Electrical and Computer Engineering University of Cyprus Nicosia1678 Cyprus

This paper proposes a chaotic waveform-based multi-antenna receiver design for simultaneous wireless information and power transfer (SWIPT). Particularly, we present a differential chaos shift keying (DCSK)-based SWIPT multiantenna receiver architecture, where each antenna switches between information transfer (IT) and energy harvesting (EH) modes depending on the receiver’s requirements. We take into account a generalized frequency-selective Nakagami-m fading model as well as the nonlinearities of the EH process to derive closed-form analytical expressions for the associated bit error rate (BER) and the harvested direct current (DC), respectively. We show that, both depend on the parameters of the transmitted waveform and the number of receiver antennas being utilized in the IT and EH mode. We investigate a trade-off in terms of the BER and energy transfer by introducing a novel achievable ‘success rate - harvested energy’ region. Moreover, we demonstrate that energy and information transfer are two conflicting tasks and hence, a single waveform cannot be simultaneously optimal for both IT and EH. Accordingly, we propose appropriate transmit waveform designs based on the application specific requirements of acceptable BER or harvested DC or both. Numerical results demonstrate the importance of chaotic waveform-based signal design and its impact on the proposed receiver architecture. © 2023, CC BY-NC-SA.

关键词： Energy harvesting

来源：评论

学校读者我要写书评

暂无评论

L(2, 1)-edge labeling of Infinite Triangular Grid 22

L(2, 1)-edge labeling of Infinite Triangular Grid

引用

22nd Italian Conference on Theoretical Computer Science, ICTCS 2021

作者： Bandopadhyay, Susobhan Ghosh, Sasthi C. Koley, Subhasis National Institute Of Science Education And Research Hbni Bhubaneswar India Advanced Computing And Microelectronics Unit Indian Statistical Institute Kolkata India

An L(h, k)-edge labeling of a graph G is the assignment of labels {0, 1, · · · , n} to the edges in such a way that two adjacent edges get labels with a difference at least h and the labels of distance two edges, i.e., two non-adjacent edges having a common edge connecting them get labels with a difference at least k, where h and k are two given non-negative integers. The span λ 0 h,k(G) is the minimum n such that G admits an L(h, k)-edge labeling. For three given integers n, h and k, an n-circular-L(h, k)-edge labeling f 0 of a graph G is an assignment from integers {0, 1, · · · , n1} in such a way that if two edges e and e 0 are adjacent then |f 0 (e) - f 0 (e 0 )|n ≥ h and if they are distance two edges then |f 0 (e) - f 0 (e 0 )|n ≥ k, where |x|n = min{x, n - x}. The circular span σ 0 h,k(G) is the minimum n such that G admits an n-circular L(h, k)-edge labeling. Here, we focus on finding λ 0 2,1(G) and σ 0 2,1(G) where G is infinite regular triangular grid T6. We work on the conjecture λ 0 2,1(T6) = 16 and the bound σ 0 2,1(T6) ≤ 18 given by Lin and Wu [J. Comb. Opt., 2013]. We prove the conjecture and give a labeling function for T6 such that σ 0 2,1(T6) ≤ 18 as no labeling function was given by Lin and Wu in this case. © 2021 CEUR-WS. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Horizontal Auto-Scaling for Multi-Access Edge computing Using Safe Reinforcement Learning

引用

ACM Transactions on Embedded computing Systems 2021年第6期20卷 1–33页

作者： Kaustabha Ray Ansuman Banerjee Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

Multi-Access Edge computing (MEC) has emerged as a promising new paradigm allowing low latency access to services deployed on edge servers to avert network latencies often encountered in accessing cloud services. A key component of the MEC environment is an auto-scaling policy which is used to decide the overall management and scaling of container instances corresponding to individual services deployed on MEC servers to cater to traffic fluctuations. In this work, we propose a Safe Reinforcement Learning (RL)-based auto-scaling policy agent that can efficiently adapt to traffic variations to ensure adherence to service specific latency requirements. We model the MEC environment using a Markov Decision Process (MDP). We demonstrate how latency requirements can be formally expressed in Linear Temporal Logic (LTL). The LTL specification acts as a guide to the policy agent to automatically learn auto-scaling decisions that maximize the probability of satisfying the LTL formula. We introduce a quantitative reward mechanism based on the LTL formula to tailor service specific latency requirements. We prove that our reward mechanism ensures convergence of standard Safe-RL approaches. We present experimental results in practical scenarios on a test-bed setup with real-world benchmark applications to show the effectiveness of our approach in comparison to other state-of-the-art methods in literature. Furthermore, we perform extensive simulated experiments to demonstrate the effectiveness of our approach in large scale scenarios.

关键词： Multi-access edge computing safe reinforcement learning auto-scaling

来源：评论

学校读者我要写书评

暂无评论

Constructing Rectilinear Steiner Minimum Tree with Conditional Generative Adversarial Network

Constructing Rectilinear Steiner Minimum Tree with Condition...

引用

International Conference on VLSI Design

作者： Kritanta Saha Pritha Banerjee Susmita Sur-Kolay Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Computer Science and Engineering Sister Nivedita University Kolkata India Department of Computer Science and Engineering University of Calcutta Kolkata India

ISBN: (数字)9798331522445

ISBN: (纸本)9798331522452

Given n points in the 2D plane which are the pins of a net, a Rectilinear Steiner Minimum Tree (RSMT) which consists only of vertical and horizontal line segments is the shortest network to interconnect the pins along with a few extra (Steiner) points. An RSMT for a net has a minimum total wirelength in Manhattan distance and acts as a backbone to many state-of-the-art global routers. However, finding an RSMT is NPcomplete. In this work, we propose a method for constructing an RSMT with an image-to-image translation using a conditional generative adversarial network (cGAN) based model. Images of RSMTs with optimal wirelength for randomly generated nets form our training dataset. Experimental results show that, after training, our model generates RSMTs with $\leq 0.348\%$ wirelength error on average compared with the optimal solution for nets with degrees up to 50. This is the first successful attempt to solve the RSMT construction problem as an image-to-image translation problem using a cGAN based model.

关键词： Training Steiner trees Translation Computational modeling Machine learning Very large scale integration Generative adversarial networks Generators Pins Testing

来源：评论

学校读者我要写书评

暂无评论

Analytical framework to compare handover mechanisms for fog-enabled IoT networks

Analytical framework to compare handover mechanisms for fog-...

引用

IEEE Future Networks World Forum (FNWF)

作者： Sanjay Sathish Shankar K. Ghosh Sasthi C. Ghosh Department of Computer Science and Engineering Shiv Nadar Institution Of Eminence Delhi NCR India Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

Frequent handover failures in fog enabled Internet of things (IoT) networks cause repetition of one or more phases of a job in the new fog node, resulting in high job completion time and lower service rate. In this work, an analytical framework has been proposed to measure the performances of different handover algorithms for fog networks in terms of job completion per unit time as well as service rate. Our analysis considers the effect of handover failure, request arrival rates and sizes of the jobs. Moreover, we have proposed a handover algorithm considering both the received signal strength as well as the available computing resources in neighbouring fog nodes. The goal of the proposed handover algorithm is to minimize handover failure and to improve service rate. Both analytic and simulation results show that the proposed handover algorithm outperforms the existing approaches in terms of job completion delay and service rate.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Analysis of the Delay in RIS Assisted SISO D2D Communication Using Chernoff’s Bounds 3rd

A Probabilistic Analysis of the Delay in RIS Assisted SIS...

引用

3rd International Conference on Computer and Communication Engineering, CCCE 2023

作者： Singh, Durgesh Ghosh, Sasthi C. School of Computer Science University of Petroleum and Energy Studies Dehradun248007 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata700108 India

ISBN: (纸本)9783031352980

Reflecting intelligent surface (RIS) assisted millimeter wave (mmWave) device to device (D2D) communication in single input single output (SISO) mode is considered. RIS can bypass the blocked D2D pairs since mmWaves are highly susceptible to blockages. However, the RIS is composed of passive elements which cannot accurately measure the state of the given channel and may suffer outages from moving obstacles (blockages) or due to moving devices (communication out of range) causing uncertainty in link quality. Each data packet will have some probability to be successfully transmitted towards the destination device via a RIS in each time unit. When a packet is lost it has to be re-transmitted which will induce extra delay. In this paper, the impact of link success probability on delay is studied. A lower bound on delay such that all packets are received successfully for the given link success probability has been derived. Later, we have derived a new term called apparent success probability which captures the trade-off between delay and link success probability. Simulations are performed which conforms with the derived theoretical results. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Analysing Blackout Probability for RIS Assisted Cellular Network

Analysing Blackout Probability for RIS Assisted Cellular Net...

引用

IEEE Future Networks World Forum (FNWF)

作者： Ekansh Panwar Shankar K. Ghosh Rajeev Kumar Singh Souvik Deb Department of Computer Science and Engineering Shiv Nadar Institution Of Eminence Delhi NCR India Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

In new radio (NR) system, a user equipment (UE) must wait for the A3 event to happen before switching to a neighbouring cell, even if the received data rate drops below the requested one. Blackout period is the interim period during which the UE is connected to the system but is not receiving the requested rate. Reconfigurable intelligent surface (RIS) is a promising technology for boosting NR systems' capacity. How-ever, limited work examining how well RIS minimises blackout has been carried out. The impact of RIS in minimising blackout period has been examined in this work using analytical models that take into account the impact of path loss, fading, desired data rate, and user mobility. Additionally, the analytical findings have been verified against simulation results. Results show that efficacy of RIS in mitigating blackout incidents is contingent upon the prevailing channel conditions and the target data rate requirements.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the Asymmetry of Stuck-at Fault Sensitivity in Memristive Neural Architectures

On the Asymmetry of Stuck-at Fault Sensitivity in Memristive...

引用

IEEE International Test Conference on India (ITC India)

作者： Manobendra Nath Mondal Animesh Basak Chowdhury Santlal Prajapati Susmita Sur-Kolay Bhargab B. Bhattacharya School of Computer Science UPES Dehradun India NYU Tandon School of Engineering New York University New York U.S.A. Advanced Computing and Microelectronics Unit Indian Statistical Institute India

ISBN: (数字)9798350352597

ISBN: (纸本)9798350352603

The use of memristive crossbar-based architectures has gained traction as a potential solution for performing computationally expensive tasks such as matrix-vector multiplication and vector outer product, which require significant amount of space, time, and energy. Despite being deemed inherently fault-tolerant, memristive crossbar-based neural architecture (MCNA) may often experience accuracy degradation due to hardware faults, resulting in significant variations. This study aims to comprehensively analyze the impact of stuck-at faults (SAFs) on the accuracy of a neural network during classification or regression. Contrary to the popular belief, it is observed that the impact of stuck-at-0 (SAO) and stuck-at-l (SAl) faults are highly asymmetric with respect to the loss of accuracy. Thus this study might help in planning test strategies for the enhancement of fault immunity in memristive neural architectures.

关键词： Fault tolerance Accuracy Sensitivity Fault tolerant systems Computer architecture Automatic test pattern generation Vectors

来源：评论

学校读者我要写书评

暂无评论

A Framework for Analyzing Resource Allocation Policies for Multi-Access Edge computing

A Framework for Analyzing Resource Allocation Policies for M...

引用

IEEE International Conference on Edge computing (EDGE)

作者： Kaustabha Ray Ansuman Banerjee Advanced Computing and Microelectronics Unit Indian Statistical Institute

ISBN: (纸本)9781665400633

Multi-Access Edge computing (MEC) is a promising new paradigm enabling low-latency access to services deployed on edge servers. This helps to avert network latencies often encountered in accessing cloud services. The cornerstone of a MEC environment is a resource allocation policy used to partition and allocate computational resources such as bandwidth, memory available on the edge server to user service invocations availing such services. In this work, we propose a generic data-driven framework to model and analyze such MEC resource allocation policies. We model a MEC system as a Turn-Based Stochastic Multi-Player Game and use Probabilistic Model Checking to derive quantitative guarantees on resource allocation policies against requirements expressed in Probabilistic Alternating-Time Temporal Logic with Rewards. We present results on state-of-the-art MEC resource allocation policies to demonstrate the effectiveness of our framework.

关键词： Analytical models Multi-access edge computing Computational modeling Stochastic processes Games Model checking Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Efficient Syndrome Decoder for Heavy Hexagonal QECC via Machine Learning

arXiv

引用

arXiv 2022年

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

Error syndromes for heavy hexagonal code and other topological codes such as surface code have typically been decoded by using Minimum Weight Perfect Matching (MWPM) based methods. Recent advances have shown that topological codes can be efficiently decoded by deploying machine learning (ML) techniques, in particular with neural networks. In this work, we first propose an ML based decoder for heavy hexagonal code and establish its efficiency in terms of the values of threshold and pseudo-threshold, for various noise models. We show that the proposed ML based decoding method achieves ∼ 5× higher values of threshold than that for MWPM. Next, exploiting the property of subsystem codes, we define gauge equivalence for heavy hexagonal code, by which two distinct errors can belong to the same error class. A linear search based method is proposed for determining the equivalent error classes. This provides a quadratic reduction in the number of error classes to be considered for both bit flip and phase flip errors, and thus a further improvement of ∼ 14% in the threshold over the basic ML decoder. Lastly, a novel technique based on rank to determine the equivalent error classes is presented, which is empirically faster than the one based on linear search. © 2022, CC BY.

关键词： Gages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：