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

International Conference on computing: Theory and Applications, ICCTA

作者： Partha Bhowmick Arindam Biswas Bhargab B. Bhattacharya Computer Science & Technology Dept Bengal Engineering and Science University Shibpur India Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

A novel algorithm to derive the isothetic convex envelope (ICE) of an object using a digital geometric technique is proposed in this paper. ICE is defined as the isothetic convex polygon that contains the digital object, with an aim of capturing its underlying shape information. Slackening the tightness of an ICE corresponding to a digital object is achievable by increasing the grid size, and for a slackened ICE with lesser output complexity (i.e., with lesser number of vertices), the runtime of the algorithm falls significantly. The proposed algorithm is marked by its dependence on object boundary instead of object size, and usage of primitive integer operations in the digital domain, which, in entirety, ensures its speedy execution and acceptability in a real-world application. Experimental results including CPU time demonstrate the elegance of ICE and the efficiency of the proposed algorithm

关键词： Ice Shape Application software microelectronics Computer science Runtime Computer vision Pattern recognition Algorithm design and analysis Object detection

来源：评论

学校读者我要写书评

暂无评论

Locating objects in a sensor grid

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3326卷 526-531页

作者： Sau, Buddhadeb Mukhopadhyaya, Krishnendu Department of Mathematics Jadavpur University Kolkata - 700032 India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata - 700108 India

Finding the location of an object, other than the sensor in a sensor network is an important problem. There is no good technique available in the literature to find the location of objects. We propose a technique to find the location of objects in a sensor grid. The locations of the sensors are assumed to be known. A sensor can only sense the number of objects present in its neighborhood. This small information injects low traffic in the network. The computations are carried out completely in the base station. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Voting in Watts-Strogatz Small-World Network

Voting in Watts-Strogatz Small-World Network

引用

International Conference on Frontiers in computing and Systems, COMSYS 2020

作者： Ray, Soujanya Chatterjee, Kingshuk Majumdar, Ritaji Ganguly, Debayan Department of Computer Science and Engineering Netaji Subhash Engineering College Kolkata India Department of Computer Science Government College of Engineering and Ceramic Technology Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Computer Science Government College of Engineering and Leather Technology Kolkata India

ISBN: (纸本)9789811578335

Social network science and social interaction science is an interesting and steadily growing field of research in current time. Social network influences the lives of millions, and therefore the propagation of influence in such a network deserves study. In this paper, we have studied voting in a Watts-Strogatz small-world network for two parties. In our model, each node has an initial bias towards one of the parties (or can be neutral) and are influenced by their neighbours to vote for a particular party. We show via simulation that (i) for linear of logarithmic voting function, the small-scale variation is minimum, but the majority of the nodes tend to align towards one of the parties in the long term, (ii) for periodic voting function, the small-scale variations are sharp and oscillating, but in the long term the number of voters in each party roughly remains the same, (iii) the degree of the graph does not seem to have a strong influence on the result, and (iv) networks with higher small-world probability tend to resist the alignment of voters towards a particular party for a longer time as compared to networks with lower small-world probability. This majority voting model seems to efficiently capture the potential behaviour of voters on small-world network over a campaigning period. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Small-world networks

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Synthesis Techniques for Ternary Quantum Logic

Synthesis Techniques for Ternary Quantum Logic

引用

International Symposium on Multiple-Valued Logic

作者： Sudhindu Bikash Mandal Amlan Chakrabarti Susmita Sur-Kolay A. K. Choudhury School of Information Technology University of Calcutta Kolkata India Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

Synthesis of ternary quantum circuits involves basic ternary gates and logic operations in the ternary quantum domain. Works that define ternary algebra and their applications for ternary quantum logic realization, are very few. In this paper, we express a ternary logic function in terms of projection operations including a new one. We demonstrate how to realize a few new multi-qutrit ternary gates in terms of generalized ternary gates and projection operations. We then employ our synthesis method to design ternary adder circuits which have better cost than that obtained by earlier method.

关键词： Logic gates Quantum computing Adders Multivalued logic Quantum mechanics Algebra Cryptography

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Gathering over Meeting Nodes in Infinite Grid

arXiv

引用

arXiv 2021年

作者： Bhagat, Subhash Chakraborty, Abhinav Das, Bibhuti Mukhopadhyaya, Krishnendu Département d’Informatique Université du Québec en Outaouais Canada Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

The gathering over meeting nodes problem asks the robots to gather at one of the predefined meeting nodes. The robots are deployed on the nodes of an anonymous two-dimensional infinite grid, which has a subset of nodes marked as meeting nodes. Robots are identical, autonomous, anonymous and oblivious. They operate under an asynchronous scheduler. They do not have any agreement on a global coordinate system. All the initial configurations for which the problem is deterministically unsolvable have been characterized. A deterministic distributed algorithm has been proposed to solve the problem for the remaining configurations. The efficiency of the proposed algorithm is studied in terms of the number of moves required for gathering. A lower bound concerning the total number of moves required to solve the gathering problem has been derived. Copyright © 2021, The Authors. All rights reserved.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

A Verification Guided Approach for Selective Program Transformations for Approximate computing 25

A Verification Guided Approach for Selective Program Transfo...

引用

25th IEEE Asian Test Symposium, ATS 2016

作者： Mitra, Sayandeep Das, Moumita Banerjee, Ansuman Datta, Kausik Ho, Tsung-Yi Indian Statistical Institute Kolkata India Meghnad Saha Institute of Technology Kolkata India Mentor Graphics India Pvt. Ltd. India National Tsing Hua University Taiwan Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B.T. Road Kolkata West Bengal700108 India

ISBN: (纸本)9781509038084

In recent times, approximate computing is being looked at as a viable alternative for reducing the energy consumption of programs, while marginally compromising on the correctness of their computation. The idea behind approximate computing is to introduce approximations at various levels of the execution stack, with an attempt to realize the resource hungry computations on low resource consuming approximate hardware blocks. However approximate computing for program transformation faces a serious challenge of automatically identifying core program areas/statements where approximations can be introduced, with a quantifiable measure of the resulting program correctness compromise. Introducing approximations randomly can cause performance deterioration without much energy advantage, which is undesirable. In this paper, we introduce a verification-guided method to automatically identify program blocks which lend themselves to easy approximations, while not compromising significantly on program correctness. Our method is based on identifying regions of code which are less influential for the computation of the program outputs and therefore, can be compromised with, however still having a potential of significant resource reduction. We take the help of assertions to quantify the effect of the resulting transformations on program outputs. We show experimental results to support our proposal. © 2016 IEEE.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Asymptotically Improved Circuit for d-ary Grover's Algorithm with advanced Decomposition of n-qudit Toffoli Gate

arXiv

引用

arXiv 2020年

作者： Saha, Amit Majumdar, Ritajit Saha, Debasri Chakrabarti, Amlan Sur-Kolay, Susmita A. K. Choudhury School of Information Technology University of Calcutta India Atos Pune India Advanced Computing & Microelectronics Unit Indian Statistical Institute India

The progress in building quantum computers to execute quantum algorithms has recently been remarkable. Grover's search algorithm in a binary quantum system provides considerable speed-up over classical paradigm. Further, Grover's algorithm can be extended to a d-ary (qudit) quantum system for utilizing the advantage of larger state space, which helps to reduce the run-time of the algorithm as compared to the traditional binary quantum systems. In a qudit quantum system, an n-qudit Toffoli gate plays a significant role in the accurate implementation of Grover's algorithm. In this article, a generalized n-qudit Toffoli gate has been realized using higher dimensional qudits to attain a logarithmic depth decomposition without ancilla qudit. The circuit for Grover's algorithm has then been designed for any d-ary quantum system, where d ≥ 2, with the proposed n-qudit Toffoli gate to obtain optimized depth compared to earlier approaches. The technique for decomposing an n-qudit Toffoli gate requires access to two immediately higher energy levels, making the design susceptible to errors. Nevertheless, we show that the percentage decrease in the probability of error is significant as we have reduced both gate count and circuit depth as compared to that in state-of-the-art works. © 2020, CC BY.

关键词： Quantum optics

来源：评论

学校读者我要写书评

暂无评论

On Fault Tolerance of Circuits with Intermediate Qutrit-assisted Gate Decomposition

arXiv

引用

arXiv 2022年

作者： Majumdar, Ritajit A., Saha A., Chakrabarti S., Sur-Kolay Advanced Computing & Microelectronics Unit Indian Statistical Institute India Atos Pune India A. K. Choudhury School of Information Technology University of Calcutta India

The use of a few intermediate qutrits for efficient decomposition of 3-qubit unitary gates has been proposed, to obtain an exponential reduction in the depth of the decomposed circuit. An intermediate qutrit implies that a qubit is operated as a qutrit in a particular execution cycle. This method, primarily for the NISQ era, treats a qubit as a qutrit only for the duration when it requires access to the state |2〉 during the computation. In this article, we study the challenges of including fault-tolerance in such a decomposition. We first show that any qubit that requires access to the state |2〉 at any point in the circuit, must be encoded using a qutrit quantum error correcting code (QECC), thus resulting in a circuit with both qubits and qutrits at the outset. Since qutrits are noisier than qubits, the former is expected to require higher levels of concatenation to achieve a particular accuracy than that for qubit-only decomposition. Next, we derive analytically (i) the number of levels of concatenation required for qubit-qutrit and qubit-only decompositions as a function of the probability of error, and (ii) the criterion for which qubit-qutrit decomposition leads to a lower gate count than qubit-only decomposition. We present numerical results for these two types of decomposition and obtain the situation where qubit-qutrit decomposition excels for the example circuit of the quantum adder by considering different values for quantum hardware-noise and non-transversal implementation of the 2-controlled ternary CNOT gate. © 2022, CC BY.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：