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

作者： Chatterjee, Punyasha Ghosh, Sasthi C. Das, Nabanita School of Mobile Computing and Communication Jadavpur University Kolkata West Bengal700032 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata West Bengal700108 India

In this paper, to gather streams of data in static wireless sensor networks, a novel graded node deployment strategy is proposed that generates minimum traffic, just sufficient for coverage. Based on this node distribution, a distributed, nearly load-balanced data gathering algorithm is developed to deliver packets to the sink node via minimum-hop paths that also in turn helps to limit the network traffic. An average case probabilistic analysis is done based on perfect matching of random bipartite graphs to establish a theoretical lower bound on the number of nodes to be deployed. Analysis and simulation studies show that the proposed model results huge enhancement in network lifetime that significantly overrides the cost due to over deployment. Hence, this technique offers an excellent cost-effective and energy-efficient solution for node deployment and routing in large wireless sensor networks to operate with prolonged lifetime. © 2015 IEEE.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

Mutual Visibility by Fat Robots with Slim Omnidirectional Camera

arXiv

引用

arXiv 2022年

作者： Bose, Kaustav Chakraborty, Abhinav Mukhopadhyaya, Krishnendu Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

In the existing literature of the MUTUAL VISIBILITY problem for autonomous robot swarms, the adopted visibility models have some idealistic assumptions that are not consistent with practical sensing device implementations. This paper investigates the problem in the more realistic visibility model called opaque fat robots with slim omnidirectional camera. The robots are modeled as unit disks, each having an omnidirectional camera represented as a disk of smaller size. We assume that the robots have compasses that allow agreement in the direction and orientation of both axes of their local coordinate systems. The robots are equipped with visible lights which serve as a medium of communication and also as a form of memory. We present a distributed algorithm for the MUTUAL VISIBILITY problem which is provably correct in the semi-synchronous setting. Our algorithm also provides a solution for LEADER ELECTION which we use as a subroutine in our main algorithm. Although LEADER ELECTION is trivial with two axis agreement in the full visibility model, it is challenging in our case and is of independent interest. Copyright © 2022, The Authors. All rights reserved.

关键词： Visibility

来源：评论

学校读者我要写书评

暂无评论

Retinal blood vessel segmentation and bifurcation point detection 17th

Retinal blood vessel segmentation and bifurcation point dete...

引用

17th International Workshop on Combinatorial Image Analysis, IWCIA 2015

作者： Dutta, Tapash Dutta, Nilanjan Bandyopadhyay, Oishila Department of Information Technology Indian Institute of Engineering Science and Technology Howrah India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9783319261447

The analysis of retinal blood vessel structure plays an important role in diagnosis of different diseases. Automated extraction of vascular network and identification of bifurcation points can be an important part of computer assisted analysis of retinal vascular disorders. In this paper, we propose an efficient method of automatic blood vessel extraction and bifurcation point detection from retinal images. The proposed method introduces the novel concept of relaxed digital arc for the removal of optic disc region to improve the correctness of the results. Experimental results show the effectiveness of the proposed method. We re-validate the quality of the proposed blood vessel segmentation approach by comparing the segmentation accuracy with existing approaches. The efficiency of bifurcation point detection process is evaluated by comparing manual bifurcation point count with the findings of the proposed approach. © Springer International Publishing Switzerland 2015.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

On the suitability of single-walled carbon nanotube bundle interconnects for high-speed and power-efficient applications

On the suitability of single-walled carbon nanotube bundle i...

引用

作者： Sahoo, Manodipan Rahaman, Hafizur Bhattacharya, Bhargab B. Department of Information Technology Indian Institute of Engineering Science and Technology Shibpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

In this work, the applicability of single-walled carbon nanotube bundle (SWCNT) interconnects as high-speed and power-efficient interconnects for nanometer technology node is studied. Investigations are performed for global level sparse and dense SWCNT bundle interconnects for 20 nm and 14 nm technology nodes using the latest ITRS-2013 data. The classical ABCD parameter matrix based method is used for accurate delay modeling of the nano-interconnects. It is observed that both copper wire and SWCNT bundle interconnects are not impacted by the inductance for the input signals of rise and fall time of 1 ps. The delay estimation method based on the Elmore model predicts the actual delay with very good accuracy and reduced computational cost. It is also demonstrated that both sparse and dense SWCNT bundles outperform copper wire in terms of signal transmission delay. An Elmore based model also provides a very accurate estimation method for the optimized number of repeaters and repeater size. In 14 nm node, the sparse and dense bundles are shown to provide a savings of around 56% and 74% respectively in the number of repeaters compared to the use of copper wires. Using the analytical expressions for various power dissipation components, it is shown that SWCNT bundle interconnects are more power efficient than copper wires. For 5 mm long global level interconnects, copper wires consume ∼3.2× and ∼3.6× power as consumed by dense SWCNT bundles for 20 nm and 14 nm technology nodes respectively. Thus, dense SWCNT bundles outperform copper both in terms of speed and power consumption and hence they can offer a viable interconnect solution for the future IC nanometer technology nodes.

关键词： Yarn

来源：评论

学校读者我要写书评

暂无评论

Two-round discrete voronoi game along a line

Two-round discrete voronoi game along a line

引用

7th International Frontiers in Algorithmics Workshop and the 9th International Conference on Algorithmic Aspects in Information and Management, FAW-AAIM 2013

作者： Banik, Aritra Bhattacharya, Bhaswar B. Das, Sandip Das, Sreeja Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Statistics Stanford University United States Jadavpur University Kolkata India

ISBN: (纸本)9783642387555

The two-round discrete Voronoi game on a line consists of a finite user set U (with |U | = n), placed along a line , and two players Player 1 (P1) and Player 2 (P2). We assume that the sorted order of users in U along the line is known, and P1 and P2 each has two facilities. P1 places one facility followed by which P2 places another facility and this continues for two rounds. The payoff of P2 is defined as the cardinality of the set of points in U which are closer to a facility owned by P2 than to every facility owned by P1. The payoff of P1 is the number of users in U minus the payoff of P2. The objective of both the players is to maximize their respective payoffs. In this paper we show that, P2 always gets at least n/2 users, i.e., P2 always wins the game and the bound is tight. We also present efficient algorithms to find the optimal strategies of the players in both the rounds. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

A generalized theory for formal assertion coverage

A generalized theory for formal assertion coverage

引用

2012 IEEE 21st Asian Test Symposium, ATS 2012

作者： Das, Sourasis Banerjee, Ansuman Dasgupta, Pallab Dept. of Comp. Sc. and Engg. IIT Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute India

ISBN: (纸本)9780769548760

Coverage of formal property specifications has important ramifications in design verification. Mutation coverage, a well studied approach towards specification coverage, checks whether the specification fails in the presence of a fault. Existing mutation coverage methods are broadly divided into those which inject the fault into a given implementation and those which inject the fault directly into the specification. This paper presents a theory which unifies these contrasting approaches and extends the mutation coverage approach to partial implementations where some components are given, and for the others, we only have component specifications. © 2012 IEEE.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Trace-driven Modeling and Verification of a Mobility-Aware Service Allocation and Migration Policy for Mobile Edge computing

Trace-driven Modeling and Verification of a Mobility-Aware S...

引用

IEEE International Conference on Web Services (ICWS)

作者： Kaustabha Ray Ansuman Banerjee Advanced Computing and Microelectronics Unit Indian Statistical Institute

ISBN: (数字)9781728187860

ISBN: (纸本)9781728187877

In recent times, Mobile Edge computing (MEC) has emerged as a new paradigm allowing low-latency access to services deployed on edge nodes offering computation, storage and communication facilities. Vendors deploy their services on MEC servers to improve performance and mitigate network latencies often encountered in accessing cloud services. An allocation policy determines how to allocate service requests from mobile users to MEC servers. A number of proposals for binding user service requests to nearby edge servers enroute have been proposed in literature. However, none of these proposals, to the best of our knowledge, provide quantitative performance guarantees on the quality of service metrics. Indeed, the evolving environment, along with a large allocation configuration space makes proving performance guarantees for such allocation policies a challenging task. To address such issues, we propose a trace driven approach to derive a formal model of allocation policies and perform quantitative verification to produce probabilistic guarantees on performance metrics. We use benchmark real world MEC server and user datasets and a mobility aware allocation and migration policy from recent literature to validate our model. Experimental results show our model's effectiveness in quantitatively reasoning about service allocation performance metrics in MEC systems.

关键词： Measurement Web services Computational modeling Resource management Servers Proposals Edge computing

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Analysis of the Delay in RIS Assisted SISO D2D Communication Using Chernoff’s Bounds 3rd

A Probabilistic Analysis of the Delay in RIS Assisted SIS...

引用

3rd International Conference on Computer and Communication Engineering, CCCE 2023

作者： Singh, Durgesh Ghosh, Sasthi C. School of Computer Science University of Petroleum and Energy Studies Dehradun248007 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata700108 India

ISBN: (纸本)9783031352980

Reflecting intelligent surface (RIS) assisted millimeter wave (mmWave) device to device (D2D) communication in single input single output (SISO) mode is considered. RIS can bypass the blocked D2D pairs since mmWaves are highly susceptible to blockages. However, the RIS is composed of passive elements which cannot accurately measure the state of the given channel and may suffer outages from moving obstacles (blockages) or due to moving devices (communication out of range) causing uncertainty in link quality. Each data packet will have some probability to be successfully transmitted towards the destination device via a RIS in each time unit. When a packet is lost it has to be re-transmitted which will induce extra delay. In this paper, the impact of link success probability on delay is studied. A lower bound on delay such that all packets are received successfully for the given link success probability has been derived. Later, we have derived a new term called apparent success probability which captures the trade-off between delay and link success probability. Simulations are performed which conforms with the derived theoretical results. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Message Complexity of Multi-Valued Implicit Agreement with Shared Random Bits 22

Message Complexity of Multi-Valued Implicit Agreement with S...

引用

23rd International Conference on Distributed computing and Networking, ICDCN 2022

作者： Bose, Kaustav Molla, Anisur Rahaman Advanced Computing and Microelectronics Unit Indian Statistical Institute India R. C. Bose Centre for Cryptology and Security Indian Statistical Institute India

ISBN: (纸本)9781450395601

An agreement protocol enables a system of n nodes in a distributed network to agree on a common input value. In the implicit version of the problem, only a subset of the nodes are required to decide the common value. This paper focuses on the message complexity of randomized implicit agreement in synchronous distributed networks. It has been shown by Augustine et al. [PODC 2018] that if the nodes have access to a shared coin, then implicit agreement can be solved with high probability1 using messages2 in expectation. However, their algorithm works only for binary input values, i.e, the input values given to the nodes are from the set {0, 1}. In this paper, we extended the result to the multi-valued setting where the input values may come from a larger but constant sized domain. We present an algorithm that solves the multi-valued implicit agreement problem with matching performance guarantees as in binary agreement. © 2022 ACM.

关键词： Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Extraction of regions of interest from face images using cellular analysis 08

Extraction of regions of interest from face images using cel...

引用

1st ACM Bangalore Annual Conference, COMPUTE 2008

作者： Biswas, Arindam Khara, Suman Bhowmick, Partha Bhattacharya, Bhargab B. Computer Science and Technology Dept. Bengal Engineering and Science University Shibpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781595939500

A novel algorithm for extracting the regions of interest (ROI) from face images is presented in this paper. The novelty of the algorithm comes from its multi-resolution cellular analysis coupled with an adaptive thresholding technique incorporating a unique idea of exponential averaging. The complexity of the cellular ROIs reported by the algorithm from the frontal face view as input, is further controllable by the chosen cell size, which is its added advantage. Apart from the actual ROIs representing the eye pair, nostrils, and the mouth area, some regions of non-interest may also creep in while extracting the set of cellular regions from the face image, which are discarded by a simple geometric analysis using a containment tree. The containment tree, which is newly introduced in this paper, captures the underlying relationship of the cellular regions, which, when analyzed, returns the face ROIs in an elegant representation. Since the entire algorithm works purely in the integer domain with primitive operations (comparison, right shift, and addition) only, it runs very fast for both gray-scale and color images. Some experimental results on different facial images demonstrate its speed, robustness, and efficiency.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：