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

How Successful is a Lockdown During a Pandemic?

学校读者我要写书评

暂无评论

How Successful is a Lockdown During a Pandemic?

IEEE India Conference (INDICON)

作者： Anwesh Kabiraj Debojyoti Pal Pushan Bhattacherjee Kingshuk Chatterjee Ritajit Majumdar Debayan Ganguly Information Technology Government college of Engineering and Leather Technology Kolkata India Electrical Engineering Heritage Institute of Technology Kolkata India Computer Science & Engineering Government College of Engineering and Ceramic Technology Kolkata India Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (数字)9781728169163

ISBN: (纸本)9781728169170

Social distancing, leading to lockdown, has been followed as a measure to restrict the spread of COVID-19 infection in almost every country. In this paper, we study the impact of the united States of America's lockdown measures during this pandemic in restricting the spread of infection. We have split the lockdown into two types - hard lockdown and soft lockdown. A hard lockdown is defined as the period when only essential services are provided. On the other hand, in the soft lockdown period, non-essential services are allowed, but with prevailing social distancing measures. Our findings suggest that a properly implemented Hard Lockdown followed by a soft Lockdown is indeed effective in reducing the reproduction number (R 0 ). Although R 0 increases during the soft lockdown, the rate of increase is restricted if the hard lockdown was implemented favorably. As exceptions to this general trend, we have observed that in Washington state Hard Lockdown has failed to reduce R 0 , and Vermont's soft lockdown implementation was successful in controlling the increase in R 0 post-Hard Lockdown.

关键词： COVID-19 Pandemics Conferences Human factors Market research Social factors Testing

Strong edge coloring of Cayley graphs and some product graphs

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Dara, Suresh Mishra, Suchismita Narayanan, Narayanan Tuza, Zsolt Department of Mathematics School of Advanced Sciences VIT Bhopal University Kothri Kalan Sehore466114 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata700108 India Department of Mathematics Indian Institute of Technology Madras Chennai600036 India Alfréd Rényi Institute of Mathematics Budapest Hungary University of Pannonia Veszprém Hungary

A strong edge coloring of a graph G is a proper edge coloring of G such that every color class is an induced matching. The minimum number of colors required is termed the strong chromatic index. In this paper we determine the exact value of the strong chromatic index of all unitary Cayley graphs. Our investigations reveal an underlying product structure from which the unitary Cayley graphs emerge. We then go on to give tight bounds for the strong chromatic index of the Cartesian product of two trees, including an exact formula for the product in the case of stars. Further, we give bounds for the strong chromatic index of the product of a tree with a cycle. For any tree, those bounds may differ from the actual value only by not more than a small additive constant (at most 2 for even cycles and at most 5 for odd cycles), moreover they yield the exact value when the length of the cycle is divisible by 4. Copyright © 2021, The Authors. All rights reserved.

关键词： Forestry

On reliability hardening in cyber-physical digital-microfluidic biochips

学校读者我要写书评

暂无评论

On reliability hardening in cyber-physical digital-microflui...

Asia and South Pacific Design Automation Conference

作者： Guan-Ruei Lu Guan-Ming Huang Ansuman Banerjee Bhargab B. Bhattacharya Tsung-Yi Ho Hung-Ming Chen Institute of Electronics National Chiao Tung University Hsinchu Taiwan Institute of Electrical and Computer Engineering National Chiao Tung University Hsinchu Taiwan Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India Department of Computer Science National Tsing Hua University Hsinchu Taiwan

ISBN: (纸本)9781509015597

In the area of biomedical engineering, digital-microfluidic biochips (DMFBs) have received considerable attention, because of their capability of providing an efficient and reliable platform for conducting point-of-care clinical diagnostics. System reliability, in turn, mandates error-recoverability while implementing biochemical assays on-chip for medical applications. Unfortunately, the technology of DMFBs is not yet fully equipped to handle error-recovery from various microfluidic operations involving droplet motion and reaction. Recently, a number of cyber-physical systems have been proposed to provide real-time checking and error-recovery in assays based on the feedback received from a few on-chip checkpoints. However, in order to synthesize robust feedback systems for different types of DMFBs, certain practical issues need to be considered such as co-optimization of checkpoint placement and layout of droplet-routing pathways. For application-specific DMFBs, we propose here an algorithm that minimizes the number of checkpoints and determines their locations to cover every path in a given droplet-routing solution. Next, for general-purpose DMFBs, where the checkpoints are pre-deployed in specific locations, we present a checkpoint-aware routing algorithm such that every droplet-routing path passes through at least one checkpoint to enable error-recovery and to ensure physical routability of all droplets. Our experiments on assay benchmarks show encouraging results in terms of latest-arrival-time and routability of droplets. The proposed methods thus provide convenient reliability-hardening mechanisms for a wide class of cyber-physical DMFBs.

关键词： Routing Sensors Reliability Electrodes System-on-chip Cyber-physical systems Monitoring

Performance-aware test scheduling for diagnosing coexistent channel faults in topology-agnostic networks-on-chip

学校读者我要写书评

暂无评论

Performance-aware test scheduling for diagnosing coexistent ...

作者： Bhowmik, Biswajit Kumar Deka, Jatindra Biswas, Santosh Bhattacharya, Bhargab B. Department of Computer Science and Engineering Indian Institute of Information Technology Kurnool Jagannathagattu Hill Kurnool Andhra Pradesh518007 India Department of Computer Science and Engineering Indian Institute of Technology Guwahati Amingaon Kamrup Guwahati Assam781039 India Department of Electrical Engineering and Computer Science Indian Institute of Technology Bhilai GEC Campus Sejbahar Raipur Chhattisgarh492015 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata 203 B. T. Road Kolkata West Bengal700108 India

High-performance multiprocessor SoCs used in practice require a complex network-on-chip (NoC) as communication architecture, and the channels therein often suffer from various manufacturing defects. Such physical defects cause a multitude of system-level failures and subsequent degradation of reliability, yield, and performance of the computing platform. Most of the existing test approaches consider mesh-based NoC channels only and do not perform well for other regular topologies such as octagons or spidergons, with regard to test time and overhead issues. This article proposes a topology-agnostic test mechanism that is capable of diagnosing on-line, coexistent channel-short, and stuck-at faults in these special NoCs as well as in traditional mesh architectures. We introduce a new test model called Damaru to decompose the network and present an efficient scheduling scheme to reduce test time without compromising resource utilization during testing. Additionally, the proposed scheduling scheme scales well with network size, channel width, and topological diversity. Simulation results show that the method achieves nearly 92% fault coverage and improves area overhead by almost 60% and test time by 98% compared to earlier approaches. As a sequel, packet latency and energy consumption are also improved by 67.05% and 54.69%, respectively, and they are further improved with increasing network size. © 2019 Association for computing Machinery.

关键词： Network-on-chip

Prediction of the final rank of Players in PUBG with the optimal number of features

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Sen, Diptakshi Roy, Rupam Kumar Majumdar, Ritajit Chatterjee, Kingshuk Ganguly, Debayan Department of Computer Science and Engineering University of Calcutta India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Computer Science and Engineering Government College of Engineering and Ceramic Technology India Department of Computer Science and Engineering Government College of Engineering and Leather Technology India

PUBG is an online video game that has become very popular among the youths in recent years. Final rank, which indicates the performance of a player, is one of the most important feature for this game. This paper focuses on predicting the final rank of the players based on their skills and abilities. In this paper we have used different machine learning algorithms to predict the final rank of the players on a dataset obtained from kaggle which has 29 features. Using the correlation heatmap,we have varied the number of features used for the model. Out of these models GBR and LGBM have given the best result with the accuracy of 91.63% and 91.26% respectively for 14 features and the accuracy of 90.54% and 90.01% for 8 features. Although the accuracy of the models with 14 features is slightly better than 8 features, the empirical time taken by 8 features is 1.4x lesser than 14 features for LGBM and 1.5x lesser for GBR. Furthermore, reducing the number of features any more significantly hampers the performance of all the ML models. Therefore, we conclude that 8 is the optimal number of features that can be used to predict the final rank of a player in PUBG with high accuracy and low run-time. © 2021, CC0.

关键词： Forecasting

General chairs’ message

学校读者我要写书评

暂无评论

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2005年 3326 LNCS卷 V-VI页

作者： Das, Nabanita Sinha, Bhabani P. Sen, Arunabha Das, Sajal K. Indian Statistical Institute Advanced Computing and Microelectronics Unit 203 B.T. Road Kolkata700 108 India Arizona State University Dept. of Computer Science and Engineering TempeAZ United States University of Texas at Arlington Dept. of Computer Science and Engineering ArlingtonTX76019-0015 United States

FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Basu, Saikat Das, Arnav Saha, Amit Chakrabarti, Amlan Sur-Kolay, Susmita A.K.Choudhury School of Information Technology U. of Calcutta Kolkata India LTIMindtree Ltd. Kolkata India Dept. of Computer Science St. Xavier's University Kolkata India Pune India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

Quantum computers must meet extremely stringent qualitative and quantitative requirements on their qubits in order to solve real-life problems. Quantum circuit fragmentation techniques divide a large quantum circuit into a number of sub-circuits that can be executed on the smaller noisy quantum hardware available. However, the process of quantum circuit fragmentation involves finding an ideal cut that has exponential time complexity, and also classical post-processing required to reconstruct the output. In this paper, we represent a quantum circuit using a weighted graph and propose a novel classical graph partitioning algorithm for selecting an efficient fragmentation that reduces the entanglement between the sub-circuits along with balancing the estimated error in each sub-circuit. We also demonstrate a comparative study over different classical and quantum approaches of graph partitioning for finding such a cut. We present FragQC, a software tool that cuts a quantum circuit into sub-circuits when its error probability exceeds a certain threshold. With this proposed approach, we achieve an increase of fidelity by 14.83% compared to direct execution without cutting the circuit, and 8.45% over the state-of-the-art ILP-based method, for the benchmark circuits. © 2023, CC BY.

关键词： Genetic algorithms

A Framework for Automated Correctness Checking of Biochemical Protocol Realizations on Digital Microfluidic Biochips

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Bhattacharjee, Sukanta Banerjee, Ansuman Chakrabarty, Krishnendu Bhattacharya, Bhargab B. Department of Computer Science and Engineering Indian Institute of Technology Assam Guwahati781039 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata700108 India Department of Electrical and Computer Engineering Duke University United States Department of Computer Science and Engineering National Institute of Technology Rourkela Odisha769008 India

Recent advances in digital microfluidic (DMF) technologies offer a promising platform for a wide variety of biochemical applications, such as DNA analysis, automated drug discovery, and toxicity monitoring. For on-chip implementation of complex bioassays, automated synthesis tools have been developed to meet the design challenges. Currently, the synthesis tools pass through a number of complex design steps to realize a given biochemical protocol on a target DMF architecture. Thus, design errors can arise during the synthesis steps. Before deploying a DMF biochip on a safety critical system, it is necessary to ensure that the desired biochemical protocol has been correctly implemented, i.e., the synthesized output (actuation sequences for the biochip) is free from any design or realization errors. We propose a symbolic constraint-based analysis framework for checking the correctness of a synthesized biochemical protocol with respect to the original design specification. The verification scheme based on this framework can detect several post-synthesis fluidic violations and realization errors in 2D-array based or pin-constrained biochips as well as in cyberphysical systems. It further generates diagnostic feedback for error localization. We present experimental results on the polymerase chain reaction (PCR) and in-vitro multiplexed bioassays to demonstrate the proposed verification approach. © 2022, CC BY.

关键词： Polymerase chain reaction

Noncontiguous Channel Allocation for Multimedia Communication in Cognitive Radio Networks

学校读者我要写书评

暂无评论

IEEE Transactions on Cognitive Communications and Networking 2015年第4期1卷 420-434页

作者： Ansuman Bhattacharya Rabindranath Ghosh Koushik Sinha Debasish Datta Bhabani P. Sinha Department of Computer Science and Engineering National Institute of Technology Shillong India Department of Electronics and Communication Engineering St. Thomas’ College of Engineering and Technolgy Kolkata India Department of Computer Science Southern Illinois University Carbondale Carbondale IL USA Department of Electronics and Electrical Communication Engineering Indian Institute of Technology Kharagpur Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

In conventional wireless systems, unless a contiguous frequency band with width at least equal to the required bandwidth is obtained, multimedia communication cannot be effected with the desired quality of service. We propose here a novel channel allocation technique to overcome this limitation in a cognitive radio network, which is based on utilizing several noncontiguous channels, each of width smaller than the required bandwidth, but whose sum equals at least the required bandwidth. We present algorithms for channel sensing, channel reservation, and channel deallocation along with transmission and reception protocols with two different implementations based on FDM-FDMA and OFDM-FDMA techniques. Simulation results for both these implementations show that the proposed technique outperforms the existing first-fit and best-fit allocation techniques in terms of the average number of attempts needed for acquiring the necessary number of channels for all traffic situations ranging from light to extremely heavy traffic. Furthermore, the proposed technique can allocate the required numbers of channels in less than 1 s with FDM-FDMA even (4.5 s with OFDM-FDMA) for 96% traffic load, while the first-fit and best-fit techniques fail to allocate any channel in such situations.

关键词： Multimedia communication Bandwidth Sensors Channel allocation Cognitive radio Streaming media Quality of service