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

International Communication Systems and Networks and Workshops, COMSNETS

作者： Babul P. Tewari Sasthi C. Ghosh Indian Institute of Information Technology Bhagalpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata India

ISBN: (数字)9781728191270

ISBN: (纸本)9781728191287

In IEEE 802. 11 wireless local area network (WLAN), dense deployment of access points (APs) often increases co-channel interference. This paper addresses an inter-hP communication protocol (IACP) based frequency assignment for dense WLAN. With the help of existing wired backbone the proposed approach considers a suitable IACP to design a new frequency assignment metric for the APs. The objective is to maximize the aggregate throughput of the network while avoiding the co-channel interference. The metric jointly considers the inter-AP communication delay and the obtained aggregate throughput while assigning a frequency to an AP. We first design a model describing the required parameters and protocol service primitives and then mathematically formulate the problem. As the problem is hard to solve, we have proposed a suitable greedy algorithm for the same. The proposed approach is simulated considering different network parameters and superiority of it over an existing approach is also established.

关键词： Measurement Wireless LAN Protocols Aggregates Throughput Delays Interchannel interference

来源：评论

学校读者我要写书评

暂无评论

Faster search of clustered marked states with lackadaisical quantum walks

arXiv

引用

arXiv 2021年

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

The nature of discrete-time quantum walk in the presence of multiple marked states has been studied by Nahimovs and Rivosh. They introduced an exceptional configuration of clustered marked states i.e., if the marked states are arranged in a √k × √k cluster within a √N × √N grid, where k = n2 and n an odd integer. They showed that finding a single marked state among the multiple ones using quantum walk with AKR (Ambainis, Kempe and Rivosh) coin requires Ω(√N − √k) time. Furthermore, Nahimov and Rivosh also showed that the Grover's coin can find the same configuration of marked state both faster and with higher probability compared to that with the AKR coin. In this article, we show that using lackadaisical quantum walk, a variant of a three-state discrete-time quantum walk on a line, the success probability of finding all the clustered marked states of this exceptional configuration is nearly 1 with smaller run-time. We also show that the weights of the self-loop suggested for multiple marked states in the state-of-the-art works are not optimal for this exceptional configuration of clustered mark states. We propose a range of weights of the self-loop from which only one can give the desired result for this configuration. © 2021, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A programmable built-in self-test for embedded memory cores

引用

IETE Technical Review (Institution of Electronics and Telecommunication Engineers, India) 2007年第4期24卷 287-311页

作者： Banerjee, Shibaji Chowdhury, Dipanwita Roy Bhattacharya, Bhargab B. Department of Computer Science and Engineering Indian Institute of Technology Kharagpur 721 302 India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 BT Road Kolkata 700 108 India

A memory test algorithm for detecting neighborhood pattern sensitive faults (NPSFs), including static NPSF (SNPSF), passive NPSF (PNPSF) and active NPSF (ANPSF), is proposed in this paper. The patterns can also detect all the traditional faults present in the memory array such as stuck-at faults (SAFs), transition faults (TFs), coupling faults (CFs) and address decoder faults. Next, a programmable BIST architecture is designed. The BIST circuit allows the users to select a vast variety of test algorithms based on their choice. The single BIST circuit is capable of testing different types of memory cores embedded in SOC. The proposed BIST circuit is shared among the different memory cores in an SOC. For this purpose, test wrappers for the shared BIST circuits and the memory cores are designed. Finally, a test scheduling algorithm is developed to reduce the overall test time. Copyright © 2007 by the IETE.

关键词： Built-in self test

来源：评论

学校读者我要写书评

暂无评论

Approximate fingerprint matching using kd-tree

Approximate fingerprint matching using kd-tree

引用

International Conference on Pattern Recognition

作者： P. Bhowmick B.B. Bhattacharya Computer Science & Technology Department Bengal Engineering College슠(Deemed University) Howrah India Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

Fast and robust fingerprint matching is a challenging task today in fingerprint-based biometric systems. A fingerprint matching algorithm compares two given fingerprints and returns either a degree of similarity or a binary decision. Minutiae-based fingerprint matching is the most well-known and widely used method. This paper reveals a new technique of fingerprint matching, using an efficient data structure, combining the minutiae representation with the individual usefulness of each minutia, to make the matching more powerful. Experimental results exhibit the strength of this method.

关键词： Fingerprint recognition Image matching Fingers Robustness Pattern matching Data mining Bifurcation Gray-scale Computer science Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Minimum Consistent Subset in Trees and Interval Graphs 44

Minimum Consistent Subset in Trees and Interval Graphs

引用

44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2024

作者： Banik, Aritra Das, Sayani Maheshwari, Anil Manna, Bubai Nandy, Subhas C. Krishna Priya, K.M. Roy, Bodhayan Roy, Sasanka Sahu, Abhishek National Institute of Science Education and Research An OCC of Homi Bhabha National Institute Bhubaneswar India Theoretical Computer Science The Institute of Mathematical Sciences Chennai India School of Computer Science Carleton University OttawaON Canada Department of Mathematics Indian Institute of Technology Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9783959773553

In the Minimum Consistent Subset (MCS) problem, we are presented with a connected simple undirected graph G, consisting of a vertex set V (G) of size n and an edge set E(G). Each vertex in V (G) is assigned a color from the set {1, 2, ⋯, c}. The objective is to determine a subset V′ ⊆ V (G) with minimum possible cardinality, such that for every vertex v ∈ V (G), at least one of its nearest neighbors in V′ (measured in terms of the hop distance) shares the same color as v. The decision problem, indicating whether there exists a subset V′ of cardinality at most l for some positive integer l, is known to be NP-complete even for planar graphs. In this paper, we establish that the MCS problem is NP-complete on trees. We also provide a fixed-parameter tractable (FPT) algorithm for MCS on trees parameterized by the number of colors (c) running in O(26cn6) time, significantly improving the currently best-known algorithm whose running time is O(24cn2c+3). In an effort to comprehensively understand the computational complexity of the MCS problem across different graph classes, we extend our investigation to interval graphs. We show that it remains NP-complete for interval graphs, thus enriching graph classes where MCS remains intractable. © 2024 Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, and Abhishek Sahu.

关键词： Undirected graphs

来源：评论

学校读者我要写书评

暂无评论

Misinformation Containment in OSNs leveraging Community Structure

Misinformation Containment in OSNs leveraging Community Stru...

引用

IEEE International Conference on Awareness Science and Technology

作者： Arnab Kumar Ghoshal Nabanita Das Soham Das Department of Computer Science Asutosh College Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Microsoft Corporation Redmond U.S.A

With the emergence of Online Social Networks (OSNs) as a major platform of communication, its abuse to spread misinformation has become a major threat to our society. In this paper, we study the misinformation containment problem in OSN. Given a snapshot of the OSN with a set of misinformed nodes, and a budget in terms of maximum number of seed nodes, the problem is to select the seed nodes, referred here as the beacon nodes, to plant the correct information, to minimize and eventually eradicate the misinformation at the earliest. We leverage the community structure of the OSN to select the beacon nodes, prioritizing the Community Boundary Nodes. To the best of our knowledge, this is the first work to exploit the topology of the OSN to combat misinformation spread. A modified form of Independent Cascade Model is followed to study the adversarial propagation of both misinformation and the correct information. Simulation on real data set shows that the proposed algorithm outperforms earlier algorithm significantly in terms of maximum (average) infected time and the point of decline.

关键词： Probabilistic logic Measurement Topology Sociology Statistics Twitter

来源：评论

学校读者我要写书评

暂无评论

Test pattern generation for power supply droop faults

Test pattern generation for power supply droop faults

引用

International Conference on VLSI Design

作者： D. Mitra S. Bhattacharjee S. Sur-Kolay B.B. Bhattacharya S.T. Zachariah S. Kunduc Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India Design/Test Technology India Intel Technology India Pvt. Ltd. Bangalore India

In deep sub-micron VLSI chips, when several transistors in physical proximity switch simultaneously, a substantial power supply drop, known as droop, may occur because of concurrent load on a via of the power grid. As a result of lower supply voltage, transistors may slow down. Such timing faults are termed as droop faults. Modeling of droop faults and understanding their effects on the functionality and timing behavior of the circuit are yet to be fully understood. In this paper, a new model for droop faults is proposed. A simple ATPG-based procedure for stuck-at faults has been adapted to test droop faults. For validation of the methodology in combinational circuits, a set of appropriate clusters of gates is selected to cover potential droop-prone regions in a circuit. Experimental results on ISCAS-85 benchmark circuits reveal that a very high droop fault coverage can be obtained by a short sequence of test vectors.

关键词： Test pattern generators Power supplies Circuit faults Circuit testing Switches Timing Very large scale integration Power grids Voltage Combinational circuits

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of conditional handover in 5G systems under fading scenario

arXiv

引用

arXiv 2024年

作者： Deb, Souvik Rathod, Megh Balamurugan, Rishi Ghosh, Shankar K. Singh, Rajeev K. Sanyal, Samriddha Department of Computer Science and Engineering Shiv Nadar Institution of Eminence Delhi NCR India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India School of Computing and Data Science FLAME University Pune India

To enhance the handover performance in fifth generation (5G) cellular systems, conditional handover (CHO) has been evolved as a promising solution. Unlike A3 based handover where handover execution is certain after receiving handover command from the serving access network, in CHO, handover execution is conditional on the RSRP measurements from both current and target access networks, as well as on mobility parameters such as preparation and execution offsets. Analytic evaluation of conditional handover performance is unprecedented in literature. In this work, handover performance of CHO has been carried out in terms of handover latency, handover packet loss and handover failure probability. A Markov model accounting the effect of different mobility parameters (e.g., execution offset, preparation offset, time-to-preparation and time-to-execution), UE velocity and channel fading characteristics;has been proposed to characterize handover failure. Results obtained from the analytic model has been validated against extensive simulation results. Our study reveal that optimal configuration of Oexec, Oprep, Texec and Tprep is actually conditional on underlying UE velocity and fading characteristics. This study will be helpful for the mobile operators to choose appropriate thresholds of the mobility parameters under different channel condition and UE velocities. Copyright © 2024, The Authors. All rights reserved.

关键词： Packet loss

来源：评论

学校读者我要写书评

暂无评论

computing a planar widest empty α-siphon in o(n3) time

Computing a planar widest empty α-siphon in o(n3) time

引用

19th Annual Canadian Conference on Computational Geometry, CCCG 2007

作者： Ben-Moshe, Boaz Bhattacharya, Binay K. Das, Sandip Gaur, Daya R. Shi, Qiaosheng Department of Computer Science College of Judea and Samaria 44837 Ariel Israel School of Computing Science Simon Fraser University Burnaby BC V5A 1S6 Canada Advanced Computing and Microelectronics Unit Indian Statistical Institute Calcutta 700 035 India Department of Computer Science University of Lethbridge 4401 University Drive Lethbridge AB T1K 3M4 Canada

Given a set of n points P in the Euclidean plane, we consider the problem of locating a 1-corner polygonal chain X such that minp∈P d(p, X) is maximized. The polygonal chain has the added property that its interior angle is α and it partitions P. In this note we present an algorithm that solves the problem in o(n3) time and space. The previous best running time for this problem was O(n3 log2 n) time [2].

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

Optimizing squares covering a set of points

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) 2014年 8881卷 37-52页

作者： Bhattacharya, Binay Das, Sandip Kameda, Tsunehiko Mahapatra, Priya Ranjan Sinha Song, Zhao School of Computing Science Simon Fraser University Burnaby Canada Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Computer Science and Engineering University of Kalyani Kalyani India Department of Computer Science University of Texas at Austin Austin United States

(1) Given a set of n points, find a given number of squares that enclose all the points, minimizing the size of the largest square *** investigate two kinds of optimization problems regarding points in the 2-dimensional plane that need to be enclosed by squares.(2) Given a set of n points, enclose the maximum number of points, using a specified number of squares of a fixed size. We provide different techniques to solve the above problems in cases where squares are axis-parallel or of arbitrary orientation, disjoint or overlapping. All the algorithms we use run in time that is a low-order polynomial in n. © Springer International Publishing Switzerland 2014.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：