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

15th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2012

作者： Tewari, Babul P. Ghosh, Sasthi C. Department of Computer Science and Engineering NSHM Knowledge Campus Durgapur Group of Institutions Durgapur 713 212 West Bengal India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata-700 108 West Bengal India

ISBN: (纸本)9781450316286

Frequency channels are allocated to the access-points (APs) subject to an acceptable co-channel interference level in an IEEE 802.11 WLAN. Due to limited number of the non- overlapping frequency channels, all APs in a given area may not be activated simultaneously. Therefore which subset of the APs to select for activation is a major concern. Given a set of selected APs, often a station (STA) can potentially associate with more than one AP. The association of an STA to an inappropriate AP will not only lead to degraded service for the concern STA but also may pull down the throughput of the other STAs associated with that AP. Thus finding the optimal association between STAs and APs is another im- portant concern. We argue that treating these two issues in succession may lead to suboptimal solutions, whereas, ignor- ing the co-channel interference may result over estimation of the throughput. In this paper, an integrated model based on integer programming and an efficient greedy algorithm are proposed that address both aspects simultaneously and maximizes the overall throughput while taking care of load balancing across different APs. Computational results show that indeed the integrated approach is superior to both two- step approach and methods that ignore the interference.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

A study on detailed placement for FPGAs

A study on detailed placement for FPGAs

引用

International Conference on VLSI Systems, Architecture, Technology and Applications (VLSI-SATA)

作者： Sudipta Paul Rana Das Pritha Banerjee Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Dept. of Computer Science and Engineering University of Calcutta Kolkata

Recent Field Programmable Gate Arrays (FPGA) have high logic capacity and it requires fast yet high quality placement method for mapping a technology mapped netlist of a given complex digital design onto the FPGA chip. Analytical placement for FPGAs show significant scalability for large design compared to traditional simulated annealing based placement methods. However, the high quality placement achieved during global placement with overlap of logic blocks need to be legalized and fine-tuned during detailed placement efficiently in order to take advantage of the scalability of the analytical placer without compromising the quality. In this work, we study the effect of two different detailed placement methods, i) wirelength-driven, and ii) timing-driven on a legalized placement by proposing a suitable strategy specifically for FPGAs. The experimental results show significant improvements of the legalized placement in terms of half-perimeter wirelength and critical path delay, emphasizing the need for better detailed placement methodologies.

关键词： Field programmable gate arrays Scalability Delays Computational modeling Analytical models Simulated annealing Area measurement

来源：评论

学校读者我要写书评

暂无评论

Optimal Gathering over Weber Meeting Nodes in Infinite Grid

arXiv

引用

arXiv 2022年

作者： Bhagat, Subhash Chakraborty, Abhinav Das, Bibhuti Mukhopadhyaya, Krishnendu National Institute of Science Education and Research HBNI Bhubaneswar India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

The gathering over meeting nodes problem requires the robots to gather at one of the predefined meeting nodes. This paper investigates the problem with respect to the objective function that minimizes the total number of moves made by all the robots. In other words, the sum of the distances traveled by all the robots is minimized while accomplishing the gathering task. The robots are deployed on the nodes of an anonymous two-dimensional infinite grid which has a subset of nodes marked as meeting nodes. The robots do not agree on a global coordinate system and operate under an asynchronous scheduler. A deterministic distributed algorithm has been proposed to solve the problem for all those solvable configurations, and the initial configurations for which the problem is unsolvable have been characterized. The proposed gathering algorithm is optimal with respect to the total number of moves performed by all the robots in order to finalize the gathering. Copyright © 2022, The Authors. All rights reserved.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks

Approximation algorithms for deployment of sensors for line ...

引用

International Communication Systems and Networks and Workshops, COMSNETS

作者： Dinesh Dash Arijit Bishnu Arobinda Gupta Subhas C. Nandy Department of Computer Science & Engineering Indian Institute of Technology Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute India

The coverage problem in wireless sensor network deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments with minimum number of sensors. A line segment ℓ is said to be 1-covered if it intersects the sensing region of at least one among the sensors distributed in a bounded rectangular region R. We assume that the sensing radius of each sensor is uniform. The problem of finding the minimum number of sensors needed to 1-cover each member in a given set of line segments in R is NP-hard. We propose two constant factor approximation algorithms and a PTAS (Polynomial Time Approximation Scheme) for the problem for 1-covering a set of axis-parallel line segments. We also show that a PTAS exists for 1-covering a set of arbitrarily oriented line segments in R where the length of the line segments are bounded within a constant factor of the sensing radius of each sensor.

关键词： Sensors Approximation methods Strips Approximation algorithms Wireless sensor networks Roads Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Current Comparator-Based Reconfigurable Adder and Multiplier on Hybrid Memristive Crossbar

Current Comparator-Based Reconfigurable Adder and Multiplier...

引用

IEEE Computer Society Annual Symposium on VLSI

作者： Manobendra Nath Mondal Susmita Sur-Kolay Bhargab B. Bhattacharya Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Dept. of CSE Indian Institute of Technology Kharagpur India

ISBN: (数字)9781728157757

ISBN: (纸本)9781728157764

Memristors have shown significant promise both in logic synthesis and memory-subsystem design. A 2D-crossbar of memristors can be used to store multi-valued memory states by utilizing the analog variation of current-induced resistance through memristor cells. The integration of CMOS components with memristor cells can further widen their design space for handling various complex systems. A crossbar built with CMOS-memristor hybridization supports a potential platform that enables computation-in-memory (CIM). In this work we propose a logic system based on differential currents for implementing an ADDER and a MULTIPLIER on a hybrid-memristor crossbar network. Simulation studies demonstrate that the proposed design reduces both memristor cost and computation-cycle time compared to previous approaches.

关键词： Memristors Adders Computer architecture Wires Common Information Model (computing) Logic gates Voltage control

来源：评论

学校读者我要写书评

暂无评论

Synergy of machine learning with quantum computing and communication

arXiv

引用

arXiv 2023年

作者： Bhoumik, Debasmita Sur-Kolay, Susmita Latesh Kumar, K.J. Iyengar, Sundaraja Sitharama Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India KFSCIS Florida International University MiamiFL United States

Machine learning in quantum computing and communication provides intensive opportunities for revolutionizing the field of Physics, Mathematics, and Computer Science. There exists an aperture of understanding behind this interdisciplinary domain and a lack of core understanding renders an opportunity to explore the machine learning techniques for this domain. This paper gives a comprehensive review of state-of-the-art approaches in quantum computing and quantum communication in the context of Artificial Intelligence and machine learning models. The paper reviews the classical ML models that have been employed in various ways for quantum computation such as quantum error correction, quantum communication, quantum cryptography, and mapping quantum algorithms to the existing hardware. The paper also illustrates how the relevant current challenges can be transformed into future research avenues. © 2023, CC BY.

关键词： Quantum communication

来源：评论

学校读者我要写书评

暂无评论

Distributed relay selection in presence of dynamic obstacles in millimeter wave D2D communication

arXiv

引用

arXiv 2019年

作者： Singh, Durgesh Chattopadhyay, Arpan Ghosh, Sasthi C. Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata700108 India Department of Electrical Engineering Indian Institute of Technology Delhi

Millimeter wave (mmWave) device to device (D2D) communication is highly susceptible to obstacles due to severe penetration losses and requires almost a line of sight (LOS) communication path. D2D channel condition is local to devices/user equipments (UEs) and hence is not directly visible to the base station (BS). Thus quality of the D2D channel needs to be propagated to BS by UEs which may incur some delay. Hence the solution provided by BS to UEs using this gathered channel information might become less useful to establish communication due to moving obstacles. These types of obstacles might not be known in advance and hence may cause unpredictable fluctuations to the D2D channel quality. Hence we seek to learn the D2D channels using the finite horizon partially observable Markov decision process (POMDP) framework to model the uncertainty in such kind of network environments with dynamic obstacles. The objective is to minimize delay when channel quality deteriorates, by making UEs choose locally the best possible decision between i) to continue on the current relay link on which communication is taking place or ii) to switch to another good relay by exploring other possible UEs in its locality. We derive an optimal threshold policy which tells the UE to take appropriate decision locally. Later, we give a simplified and easy to implement stationary threshold policy which counts the number of successive acknowledgement failures, based on which UE make appropriate decision locally. Through extensive simulation, we demonstrate that our approach outperforms recent algorithms. Copyright © 2019, The Authors. All rights reserved.

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

Backward Reasoning with Formal Properties: A Methodology for Bug Isolation on Simulation Traces

Backward Reasoning with Formal Properties: A Methodology for...

引用

Asian Test Symposium (ATS)

作者： Anvesh Komuravelli Srobona Mitra Ansuman Banerjee Pallab Dasgupta Department of Computer Science & Engineering Indian Institute of Technology Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute India

Automated methods for bug localization for hardware designs typically work on the design implementation to root-cause a given bug. This paper presents a novel debugging approach where instead of using the design implementation in the debugging process, we use causal deduction using formal properties scattered across the design to locate the bug. This has two advantages, namely, (a) the reasoning takes place in the property space instead of the state space of the implementation, which enhances scalability, and (b) new properties can be added in hindsight to perform what-if analysis, which is less expensive than modifying the implementation for each alternative. Experimental results demonstrate the scalability of the approach in debugging designs with large property suites.

关键词： Debugging Cognition Cost accounting Scalability Algorithm design and analysis Computer bugs Protocols

来源：评论

学校读者我要写书评

暂无评论

Mobility tolerant broadcast in mobile ad hoc networks

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卷 435-446页

作者： Srimani, Pradip K. Sinha, Bhabani P. Department of Computer Science Clemson University Clemson SC 29634-0974 United States Advanced Computing and Microelectronics Unit Indian Statistical Institute Calcutta 700108 India

A new deterministic broadcast protocol for an ad hoc network is proposed in this paper which avoids re-computation of the transmission schedule, even when the topology of the network changes due to the mobility of the nodes. The basic idea is to use a successive partitioning scheme by representing the identifier of each node (an integer) in an arbitrarily chosen radix system;the protocol then computes the specific time slots in which a particular node should transmit its message. The proposed protocol is simple, easy to implement and needs lesser broadcast time than that in [BBC99]. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Efficient Bonded Channel Assignment in IEEE 802.11 WLAN with Heterogeneous Clients 2015

Efficient Bonded Channel Assignment in IEEE 802.11 WLAN with...

引用

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

作者： Tewari, Babul P. Ghosh, Sasthi C. Department of Computer Science and Engineering Dr. B. C. Roy Engineering College Durgapur 713 206 West-Bengal India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata700 108 India

ISBN: (纸本)9781450334938

Channel bonding allows IEEE 802.11n clients to operate at a maximum rate of 300 Mbps which can significantly improve the network throughput. But at the same time it increases the co-channel interference to the nearby APs leading to a degradation of network throughput. The issue becomes more serious when the network consists of heterogeneous clients. An inappropriate assignment of bonded channels to the APs may penalize the legacy clients served by other APs. Furthermore, activating the APs with non-bonded channels only may also penalize the n clients. In both cases the network throughput may be compromised. In this paper we propose an efficient bonded channel assignment algorithm addressing how efficiently a bonded channel can be used together with non-bonded channels to maximize the network throughput. Through extensive simulation we have shown that the proposed approach is efficient enough in terms of both network throughput and client fairness. © 2015 ACM.

关键词： IEEE Standards

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：