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

Parking Problem by Oblivious Mobile Robots in Infinite Grids

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Chakraborty, Abhinav Mukhopadhyaya, Krishnendu Department of Computer Science and Engineering Institute of Technical Education and Research Siksha O Anusandhan University Odisha Bhubaneswar India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road West Bengal Kolkata700108 India

In this paper, the parking problem of a swarm of mobile robots has been studied. The robots are deployed at the nodes of an infinite grid, which has a subset of prefixed nodes marked as parking nodes. Each parking node pi has a capacity of ki which is given as input and equals the maximum number of robots a parking node can accommodate. As a solution to the parking problem, robots need to partition themselves into groups so that each parking node contains a number of robots that are equal to the capacity of the node in the final configuration. It is assumed that the number of robots in the initial configuration represents the sum of the capacities of the parking nodes. The robots are assumed to be autonomous, anonymous, homogeneous, identical and oblivious. They operate under an asynchronous scheduler. They neither have any agreement on the coordinate axes nor do they agree on a common chirality. All the initial configurations for which the problem is unsolvable have been identified. A deterministic distributed algorithm has been proposed for the remaining configurations, ensuring the solvability of the problem. Copyright © 2023, The Authors. All rights reserved.

关键词： Mobile robots

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

MINIMUM CONSISTENT SUBSET IN TREES AND INTERVAL GRAPHS

学校读者我要写书评

暂无评论

arXiv 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 Odisha Bhubaneswar752050 India Theoretical Computer Science The Institute of Mathematical Sciences India School of Computer Science Carleton University Canada Department of Mathematics Indian Institute of Technology Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

In the Minimum Consistent Subset (MCS) problem, we are presented with a connected simple undirected graph G = (V, E), consisting of a vertex set V of size n and an edge set E. Each vertex in V is assigned a color from the set {1, 2, . . ., c}. The objective is to determine a subset V ′ ⊆ V with minimum possible cardinality, such that for every vertex v ∈ V , 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 for trees, when the number of colors c is considered an input parameter, is NP-complete10. We propose a fixed-parameter tractable (FPT) algorithm for MCS on trees 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. Copyright © 2024, The Authors. All rights reserved.

关键词： Color

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

Tuning 2D magnetism in Fe3+XGeTe2 films by element doping

学校读者我要写书评

暂无评论

National Science Review 2022年第6期9卷 163-170页

作者： Shanshan Liu Zihan Li Ke Yang Enze Zhang Awadhesh Narayan Xiaoqian Zhang Jiayi Zhu Wenqing Liu Zhiming Liao Masaki Kudo Takaaki Toriyama Yunkun Yang Qiang Li Linfeng Ai Ce Huang Jiabao Sun Xiaojiao Guo Wenzhong Bao Qingsong Deng Yanhui Chen Lifeng Yin Jian Shen Xiaodong Han Syo Matsumura Jin Zou Yongbing Xu Xiaodong Xu Hua Wu Faxian Xiu State Key Laboratory of Surface Physics and Department of Physics Fudan University Institute for Nanoelectronic Devices and Quantum Computing Fudan University College of Science University of Shanghai for Science and Technology Laboratory for Computational Physical Sciences(MOE) Fudan University Solid State and Structural Chemistry Unit Indian Institute of Science School of Electronic Science and Engineering Nanjing University Department of Physics University of Washington Department of Electronic Engineering Royal Holloway University of London Materials Engineering The University of Queensland Beijing Key Laboratory of Microstructure and Property of Advanced Materials Institute of Microstructure and Property of Advanced Materials Beijing University of Technology The Ultramicroscopy Research Center Kyushu University State Key Laboratory of ASIC and System School of Microelectronics Fudan University Collaborative Innovation Center of Advanced Microstructures Department of Applied Quantum Physics and Nuclear Engineering Kyushu University Centre for Microscopy and Microanalysis The University of Queensland Shanghai Research Center for Quantum Sciences

Two-dimensional（2D） ferromagnetic materials have been discovered with tunable magnetism and orbital-driven nodal-line features. Controlling the 2D magnetism in exfoliated nanoflakes via electric/magnetic fields enables a boosted Curie temperature（TC） or phase transitions. One of the challenges, however, is the realization of high TC2D magnets that are tunable, robust and suitable for large scale fabrication. Here, we report molecular-beam epitaxy growth of wafer-scale Fe3+XGeTe2films with TCabove room temperature. By controlling the Fe composition in Fe3+XGeTe2, a continuously modulated TCin a broad range of 185–320 K has been achieved. This widely tunable TCis attributed to the doped interlayer Fe that provides a 40% enhancement around the optimal composition X = 2. We further fabricated magnetic tunneling junction device arrays that exhibit clear tunneling signals. Our results show an effective and reliable approach, i.e. element doping, to producing robust and tunable ferromagnetism beyond room temperature in a large-scale 2D Fe3+XGeTe2fashion.

关键词： 2D ferromagnetic material Fe3+XGeTe2 film element doping above room temperature TC tunability

Evaluating Conditional Handover for 5g Networks with Dynamic Obstacles

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Deb, Souvik Rathod, Megh Balamurugan, Rishi Singh, Rajeev Kumar Sanyal, Samriddha Ghosh, Shankar K. Advanced Computing & Microelectronics Unit Indian Statistical Institute West Bengal Kolkata700108 India Department of Computer Science and Engineering Shiv Nadar Institution of Eminence Delhi201314 India School of Computing and Data Science FLAME University Maharashtra Pune412115 India Shiv Nadar University India

To enhance seamless connectivity in millimetre wave New radio networks, Conditional handover has evolved as a promising solution. Unlike A3 handover where handover execution is certain after receiving handover command from the serving access network, in conditional handover, handover execution is conditional on the Reference signal received power measurements from both current and target access networks, as well as on mobility parameters such as preparation and execution offsets. Presence of dynamic obstacles may block the signal from serving and (or) target access networks, which results in violation of the conditions for the handover preparation/execution. Moreover, signal blockage by dynamic obstacles may cause radio link failure, which may cause handover failure as well. Analytic evaluations of conditional handover performance in the presence of dynamic obstacles are quite limited in the preceding literature. In this work, handover performance of conditional handover has been carried out in terms of handover latency, handover packet loss and handover failure probability. A Markov model accounting the effect of dynamic obstacles, different mobility parameters (e.g., execution offset, preparation offset, time-to-preparation and time-to-execution), user 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 the mobility parameters is actually conditional on the presence of dynamic obstacles, user velocity and fading characteristics. This study will be helpful for the mobile operators to configure the mobility parameters for New radio systems where dynamic obstacles are present. © 2024, The Authors. All rights reserved.

关键词： 5G mobile communication systems

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

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