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

Efficient Algorithms for Some Common Applications on GHCC

Journal of Interconnection Networks 2005年第4期6卷 417-433页

作者： Srabani Mukhopadhyaya Bhabani P. Sinha Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata 700 108 India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkaata 700 108 India

Generalized Hypercube-Connected-Cycles (GHCC), is a challenging interconnection network, proposed earlier in the literature. In this paper, we discuss how some important, useful algorithms, like, matrix transpose, matrix multiplication and sorting can efficiently be implemented on GHCC. Matrix transpose and matrix-by-matrix multiplication of matrices of order n × n, , takes O(l) and time, respectively, on GHCC(l,m), with lm l processors. Using the same number of processors, a list of m l numbers can be sorted in O(l 2 log 3 m) time.

关键词： Interconnection networks network topology degree diameter sorting matrix operations

来源：评论

学校读者我要写书评

暂无评论

Quantum error-correcting code for ternary logic

引用

Physical Review A 2018年第5期97卷 052302-052302页

作者： Ritajit Majumdar Saikat Basu Shibashis Ghosh Susmita Sur-Kolay Advanced Computing & Microelectronics Unit Indian Statistical Institute India A.K. Choudhury School of Information Technology University of Calcutta India

Ternary quantum systems are being studied because they provide more computational state space per unit of information, known as qutrit. A qutrit has three basis states, thus a qubit may be considered as a special case of a qutrit where the coefficient of one of the basis states is zero. Hence both (2×2)-dimensional and (3×3)-dimensional Pauli errors can occur on qutrits. In this paper, we (i) explore the possible (2×2)-dimensional as well as (3×3)-dimensional Pauli errors in qutrits and show that any pairwise bit swap error can be expressed as a linear combination of shift errors and phase errors, (ii) propose a special type of error called a quantum superposition error and show its equivalence to arbitrary rotation, (iii) formulate a nine-qutrit code which can correct a single error in a qutrit, and (iv) provide its stabilizer and circuit realization.

关键词： Quantum error correction

来源：评论

学校读者我要写书评

暂无评论

Web Service Selection with Correlations: A Feature-Based Abstraction Refinement Approach

Web Service Selection with Correlations: A Feature-Based Abs...

引用

IEEE International Conference on Service-Oriented computing and Applications (SOCA)

作者： Kaustabha Ray Ansuman Banerjee Swarup K. Mohalik Advanced Computing and Microelectronics Unit Indian Statistical Institute Ericsson Research Bangalore India

In this paper, we address the web service selection problem for linear workflows. Given a linear workflow specifying a set of ordered tasks and a set of candidate services providing different features for each task, the selection problem deals with the objective of selecting the most eligible service for each task, given the ordering specified. A number of approaches to solving the selection problem have been proposed in literature. With web services growing at an incredible pace, service selection at the Internet scale has resurfaced as a problem of recent research interest. In this work, we present our approach to the selection problem using an abstraction refinement technique to address the scalability limitations of contemporary approaches. Experiments on web service benchmarks show that our approach can add substantial performance benefits in terms of space when compared to an approach without our optimization.

关键词： Task analysis Web services Correlation Scalability Proposals Silicon compounds

来源：评论

学校读者我要写书评

暂无评论

SOK: An Evaluation of Quantum Authentication through Systematic Literature Review

SSRN

引用

SSRN 2021年

作者： Majumdar, Ritajit Das, Sanchari Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India University of Denver

Quantum computers are considered a blessing to the dynamic technological world that promises to solve complex problems much faster than their known classical counterparts. Such computational power imposes critical threats on modern cryptography where it has been proven that asymmetric key cryptosystem will be rendered useless in a quantum world. However, we can utilize such a powerful mechanism for improving computer security by implementing such technology to solve complex data security problems such as authentication, secrets management, and others. Mainly, Quantum Authentication (QA) is an emerging concept in computer security that creates robust authentication for organizations, systems, and individuals. To delve deeper into the concept, for this research, we have further investigated QA through a detailed systematic literature review done on a corpus of N = 859 papers. We briefly discuss the major protocols used by various papers to achieve QA, and also note the distribution of papers using those protocols. We analyzed the technological limitations mentioned by previous researchers and highlighted the lack of human-centered solutions for such modern inventions. We emphasize the importance of research in the user aspect of QA to make the users aware of its potential advantages and disadvantages as we move to the quantum age. © 2021, The Authors. All rights reserved.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Proactive Microservice Placement and Migration for Mobile Edge computing

Proactive Microservice Placement and Migration for Mobile Ed...

引用

IEEE/ACM Symposium on Edge computing (SEC)

作者： Kaustabha Ray Ansuman Banerjee Nanjangud C. Narendra Advanced Computing and Microelectronics Unit Indian Statistical Institute Ericsson Research Bangalore India

ISBN: (数字)9781728159430

ISBN: (纸本)9781728159447

In recent times, Mobile Edge computing (MEC) has emerged as a new paradigm allowing low-latency access to services deployed on edge nodes offering computation, storage and communication facilities. Vendors deploy their services on MEC servers to improve performance and mitigate network latencies often encountered in accessing cloud services. A service placement policy determines which services are deployed on which MEC servers. A number of mechanisms exist in literature to determine the optimal placement of services considering different performance metrics. However, for applications designed as microservice workflow architectures, service placement schemes need to be re-examined through a different lens owing to the inherent interdependencies which exist between microservices. Indeed, the dynamic environment, with stochastic user movement and service invocations, along with a large placement configuration space makes microservice placement in MEC a challenging task. Additionally, owing to user mobility, a placement scheme may need to be recalibrated, triggering service migrations to maintain the advantages offered by MEC. Existing microservice placement and migration schemes consider on-demand strategies. In this work, we take a different route and propose a Reinforcement Learning based proactive mechanism for microservice placement and migration. We use the San Francisco Taxi dataset to validate our approach. Experimental results show the effectiveness of our approach in comparison to other state-of-the-art methods.

关键词： Measurement Reinforcement learning Servers Task analysis Public transportation Edge computing Lenses

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Improving User Coverage Through Resource Aware Handoff Management in Heterogeneous Networks 2015

Improving User Coverage Through Resource Aware Handoff Manag...

引用

13th International Conference on Advances in Mobile computing and Multimedia, MoMM 2015

作者： Singh, Rohit Mukherjee, Sulagna Ghosh, Sasthi C. Department of Computer Science and Engineering Institute of Engineering and Management Kolkata700091 India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata700 108 India

ISBN: (纸本)9781450334938

In heterogenous network, there are possibilities of horizontal handover between similar type of transmitters as well as vertical handover between different type of transmitters. Also, an user may be served by a single transmitter under the hard handover or may be served by multiple transmitters simultaneously under the soft handover. Considering all these, an user may have several available options to connect with. We have developed a greedy algorithm which allocates every user to their respective most beneficial link in terms of power requirement and traffic cost. We have compared our proposed algorithm with two existing handoff decision algorithms of which one is based on received signal strength indicator measurements and the other is based on selecting the least congested transmitter. Through simulation we have shown that the proposed algorithm outperforms both these algorithms in terms of user coverage and the average data rate provided to the users. © 2015 ACM.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

Micro-Bump Assignment for Efficient Routing on Re-Distribution Layer (RDL) in 3D-ICs 14

Micro-Bump Assignment for Efficient Routing on Re-Distributi...

引用

14th IEEE India Council International Conference, INDICON 2017

作者： Banerjee, Sabyasachee Majumder, Subhashis Basu, Saikat Bhattacharya, Bhargab B. Department of Computer Science and Engineering Heritage Institute of Technology Kolkata West Bengal700107 India Advanced Computing and Microelectronics Unit Nanotechnology Research Triangle Indian Statistical Institute Kolkata West Bengal700108 India

ISBN: (纸本)9781538643181

RDL (Re-Distribution Layers) routing from the IO pads to micro-bumps plays an important role for transmitting signal between two adjacent layers in 3D IC. The quality of RDL-routing strongly depends on the positions of micro-bumps between two adjacent dies. Initially, I/O pads are assigned to micro-bumps and then single-layer routing is performed over the two RDLs that are adjacent to two respective layers. We propose an improved method for RDL-routing in 3D IC. Experimental results show that 100% routability can be achieved with reduced wire-length for all five test-cases that we have studied. © 2017 IEEE.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Time varying channel estimation for RIS assisted network with outdated CSI: Looking beyond coherence time

arXiv

引用

arXiv 2024年

作者： Deb, Souvik Ghosh, Sasthi C. Advanced Computing & Microelectronics Unit Indian Statistical Institute West Bengal Kolkata700108 India

The channel estimation (CE) overhead for unstructured multipath-rich channels increases linearly with the number of reflective elements of reconfigurable intelligent surface (RIS). This results in a significant portion of the channel coherence time being spent on CE, reducing data communication time. Furthermore, due to the mobility of the user equipment (UE) and the time consumed during CE, the estimated channel state information (CSI) may become outdated during actual data communication. In recent studies, the timing for CE has been primarily determined based on the coherence time interval, which is dependent on the velocity of the UE. However, the effect of the current channel condition and pathloss of the UEs can also be utilized to control the duration between successive CE to reduce the overhead while still maintaining the quality of service. Furthermore, for muti-user systems, the appropriate coherence time intervals of different users may be different depending on their velocities. Therefore CE carried out ignoring the difference in coherence time of different UEs may result in the estimated CSI being detrimentally outdated for some users. In contrast, others may not have sufficient time for data communication. To this end, based on the throughput analysis on outdated CSI, an algorithm has been designed to dynamically predict the next time instant for CE after the current CSI acquisition. In the first step, optimal RIS phase shifts to maximise channel gain is computed. Based on this and the amount of degradation of SINR due to outdated CSI, transmit powers are allocated for the UEs and finally the next time instant for CE is predicted such that the aggregated throughput is maximized. Simulation results confirm that our proposed algorithm outperforms the coherence time-based strategies. © 2024, CC BY.

关键词： Channel estimation

来源：评论

学校读者我要写书评

暂无评论

A New Approach to Efficient Channel Assignment for Hexagonal Cellular Networks

引用

International Journal of Foundations of Computer Science 2003年第3期14卷 439-463页

作者： Sasthi C. Ghosh Bhabani P. Sinha Nabanita Das Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata-700 108 India

Given a hexagonal cellular network with specific demand Vector and frequency separation constraints, we introduce the concept of a critical block of the network, that leads us to an efficient channel assignment scheme for the whole network. A novel idea of partitioning the critical block into several smaller sub-networks with homogeneous demands has been introduced which provides an elegant way of assigning frequencies to the critical block. This idea of partitioning is then extended for assigning frequencies to the rest of the network. The proposed algorithm provides an optimal assignment for all well-known benchmark instances including the most difficult two. It is shown to be superior to the existing frequency assignment algorithms, reported so far, in terms of both bandwidth requirement and computation time.

关键词： Channel assignment problem lower bound bandwidth frequency separation constraints k-band buffering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：