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

arXiv 2022年

作者： Koley, Subhasis Ghosh, Sasthi C. Advanced Computing and Microelectronics unit Indian Statistical Institute 203 B. T. Road Kolkata700108 India

For two given non-negative integers h and k, an L(h, k)-edge labeling of a graph G = (V(G),E(G)) is a function f0 : E(G) −→ {0,1,···,n} such that ∀e1,e2 ∈ E(G), |f0(e1) − f0(e2)| ≥ h when d0(e1,e2) = 1 and |f0(e1) − f0(e2)| ≥ k when d0(e1,e2) = 2 where d0(e1,e2) denotes the distance between e1 and e2 in G. Here d0(e1,e2) = k0 if there are at least (k0 − 1) number of edges in E(G) to connect e1 and e2 in G. The objective is to find span which is the minimum n over all such L(h,k)-edge labeling and is denoted as λ0h,k(G). Motivated by the channel assignment problem in wireless cellular network, L(h,k)-edge labeling problem has been studied in various infinite regular grids. For infinite regular octagonal grid T8, it was proved that 25 ≤ λ01,2(T8) ≤ 28 [Tiziana Calamoneri, International Journal of Foundations of Computer Science, Vol. 26, No. 04, 2015] with a gap between lower and upper bounds. In this paper we fill the gap and prove that λ01,2(T8) = 28. © 2022, CC BY.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Time Series Snapshot of Event Boundary Detection and Area Estimation in Wireless Sensor Networks

Time Series Snapshot of Event Boundary Detection and Area Es...

引用

International Communication Systems and Networks and Workshops, COMSNETS

作者： Srabani Kundu Nabanita Das Avirup Das Guru Nanak Inst. of Technology Kolkata India Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (数字)9781728131870

ISBN: (纸本)9781728131887

To monitor the events like forest fire, flood, earth tremor etc., event boundary detection and area estimation are two challenging tasks for Wireless Sensor Networks (WSN). Researchers, so far, have proposed various innovative solutions assuming the event boundary to be static. To monitor spatiotemporal events by WSN, in this paper, we study some existing techniques to report snapshots of event boundary in successive intervals, and compare their performance in respect of accuracy, latency and message communication overhead. Testbed experiments have been done to evaluate the performance and the results show that the computation intensive techniques perform better, provided they satisfy the application specific real time constraint.

关键词： Wireless sensor networks Estimation Monitoring Forestry Real-time systems Time series analysis

来源：评论

学校读者我要写书评

暂无评论

An automata theoretic framework for detecting schedulability attacks on cyber-physical systems

An automata theoretic framework for detecting schedulability...

引用

International Conference on Emerging Applications of Information Technology (EAIT)

作者： Debleena Das Ansuman Banerjee Sandeep K. Shukla Department of Computer Science and Engineering Indian Institute of Technology Kanpur Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata

This paper proposes an automated framework for detecting schedulability attacks on CyberPhysical systems (CPS) that lead to loss of control performance. Given a set of control components that constitute a CPS, a control objective to be satisfied by the control ensemble, the question of schedulability and synthesis of a scheduler that can ensure the desired control performance has been recently studied in literature. In this paper, we extend this idea further to build an automata theoretic framework for assessment of attacks on schedulability. We have built an end-to-end framework that takes in a set of control components, their variants (after replacement), a control objective to be guaranteed, and performs an automated schedulability assessment. We report some preliminary experiments of our framework on simple benchmarks.

关键词： Automata Schedules Scheduling Cyber-physical systems Cyberattack Task analysis

来源：评论

学校读者我要写书评

暂无评论

A Framework for Tile Processing on Edge Servers for Roadside Traffic Surveillance 23

A Framework for Tile Processing on Edge Servers for Roadside...

引用

Proceedings of the 7th International Conference on Algorithms, computing and Systems

作者： Saumya Jaipuria Arani Bhattacharya Ansuman Banerjee Advanced Computing and Microelectronics Unit Indian Statistical Institute India Department of Computer Science Indraprastha Institute of Information Technology India

ISBN: (纸本)9798400709098

Roadside traffic monitoring is increasingly performed by deploying roadside high-resolution video cameras and then running Computer Vision (CV) models on the video data. Since computer vision models are compute-intensive as they utilize Deep Neural Networks (DNNs), the data is usually sent to one or more edge servers located adjacent to mobile base stations. Recent techniques propose running CV models on tiles of videos separately to detect and track small objects. Several CV models exist, each with different requirements of compute and memory. Since more compute and memory-intensive CV models provide higher accuracy, a key challenge of such techniques is to determine which vision model should be used on which tile. This becomes even more challenging if multiple videos are processed by the same edge server. In this paper, we first formulate this problem of model selection on edge devices as an Integer Linear Programming (ILP) problem, and then propose a heuristic to solve it. Our experiments show that it is quite effective in practice.

关键词： Computer Vision Edge computing Integer Linear Programming

来源：评论

学校读者我要写书评

暂无评论

Algorithms for On-Chip Solution Preparation Using Digital Microfluidic Biochips

Algorithms for On-Chip Solution Preparation Using Digital Mi...

引用

IEEE Computer Society Annual Symposium on VLSI

作者： Sudip Roy Partha P. Chakrabarti Bhargab B. Bhattacharya Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India Advanced Computing and Microelectronics Unit ISI Kolkata India

Digital micro fluidic (DMF) biochips have recently emerged as a very new technology for health-care and biochemical laboratory applications, as they are inexpensive, sensitive, fully-automated, integrated systems. In a DMF biochip, on-chip and automatic solution preparation requires solving of some algorithmic problems. In this paper, we present some results of our proposed algorithms for on-ship solution preparation using DMF biochips.

关键词： Design automation Optimization System-on-a-chip Laboratories Electrodes Reservoirs Mixers

来源：评论

学校读者我要写书评

暂无评论

Updation of Activation Sequence of a Chip after its Deployment for Access Control

引用

Procedia Technology 2013年 10卷 373-380页

作者： Debasri Saha Susmita Sur-Kolay A. K. Choudhury School of Information Technology University of Calcutta Kolkata-700009 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata-700108 India

For protection of Intellectual Property (IP) in VLSI industry, a design level obfuscation is applied for simultaneous authentication and locking of IPs. When a chip with multiple IPs or System-on-Chip (SoC) is deployed, application of the same input sequence each time for its activation encourages interception/tapping of the sequence and subsequent breach of security. A legal user may sell the hardware and share its secret information for activation. Therefore, periodic update of activation sequence of a chip/SoC is a practical requirement. However, update of activation sequence is not supported in an IC. We propose a low overhead, low complexity design modification to facilitate periodic as well as on-demand update of activation sequence of a chip/SoC after its deployment. For the proposed technique, the probability of predicting an updated sequence from its correlation with the previous ones is negligible for an attacker. The simulation results on ISCAS’89 benchmark circuits are encouraging. The overheads of design modification on area, delay and power are very low.

关键词： Intellectual property protection finite state machine obfuscation key-based locking interception access control

来源：评论

学校读者我要写书评

暂无评论

Event boundary detection and gathering in wireless sensor networks

Event boundary detection and gathering in wireless sensor ne...

引用

Applications and Innovations in Mobile computing (AIMoC)

作者： Srabani Kundu Nabanita Das Computer Science and Engineering Department Guru Nanak Institute of Technology Kolkata Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata

Given a large number of sensor nodes distributed randomly over a 2D region, we address the problem of estimating the boundary of an area affected by an event. The boundaries are often irregular shaped and accurate estimation of such boundaries requires complex computation and data structures which the tiny inexpensive sensor nodes, in general, can not support. In this paper, given a random distribution of homogeneous sensor nodes, in case of an event, the affected nodes execute a simple O(d) distributed algorithm based on local information only, that can identify a small set of boundary nodes, where d is the maximum node degree in the network. Next, a nearly load balanced shortest path routing algorithm based on farthest-first technique is proposed for gathering the information of the boundary nodes to the sink node with low latency. Simulation results show that compared to the earlier algorithms, the proposed algorithm with less neighborhood information and simpler computing results better estimation of the covered area and gather the information at the sink node with nearly minimum latency.

关键词： Wireless sensor networks Estimation Routing Distributed algorithms Topology Detection algorithms Diffusion processes

来源：评论

学校读者我要写书评

暂无评论

Distributed Relay Selection in Presence of Dynamic Obstacles in Millimeter Wave D2D Communication

Distributed Relay Selection in Presence of Dynamic Obstacles...

引用

IEEE International Conference on Communications (ICC)

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

ISBN: (数字)9781728150895

ISBN: (纸本)9781728150901

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.

关键词： Relays Device-to-device communication Packet loss Delays Uncertainty Switches

来源：评论

学校读者我要写书评

暂无评论

Stitch-avoiding Global Routing for Multiple E-Beam Lithography

Stitch-avoiding Global Routing for Multiple E-Beam Lithograp...

引用

International Conference on VLSI Design

作者： Kritanta Saha Sudipta Paul Pritha Banerjee Susmita Sur-Kolay Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Computer Science and Engineering University of Calcutta Kolkata India

ISBN: (数字)9781665485050

ISBN: (纸本)9781665496612

In Multiple E-Beam Lithography (MEBL), a layout of an IC is partitioned into vertical stripes whose boundaries are called stitch-lines. Routing patterns in each stripe are written by different beams and/or in different writing passes. However, patterns cut by stitch-lines suffer from overlay errors resulting in severe pattern distortions. These distortions are mainly due to Via violation, Vertical Routing violation, or Short Polygon. In this paper, we have proposed a Stitch-avoiding Global Router. The proposed method selects the best possible global routing path for each net so that even a traditional detailed router can generate a Detailed Routing solution with fewer violations. Experimental results show that our proposed global router followed by a conventional detailed router generates solutions with 17.3%, 6.21% and 1.89% reduction in Via violations, Short polygon violations and routed wirelength respectively with no vertical routing violations, compared to those by traditional global routing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

IEEE India Council International Conference

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

ISBN: (纸本)9781538643198

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% routahility can be achieved with reduced wire-length for all five test-cases that we have studied.

关键词： TSV Micro-bump RDL routing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：