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

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

Given a set S of n static points and a mobile point p in R2, we study the variations of the smallest circle that encloses S{p} when p moves along a straight line . In this work, a complete characterization of the locus of the center of the minimum enclosing circle (MEC) of S{p}, for p, is presented. The locus is a continuous and piecewise differentiable linear function, and each of its differentiable pieces lies either on the edges of the farthest-point Voronoi diagram of S, or on a line segment parallel to the line . Moreover, the locus has O(n) differentiable pieces, which can be computed in linear time, given the farthest-point Voronoi diagram of S. © 2014 Elsevier B.V.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Trusted sharing of intellectual property in electronic hardware design 9

Trusted sharing of intellectual property in electronic hardw...

引用

9th Workshop on Embedded Systems Security, WESS 2014

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

来源：评论

学校读者我要写书评

暂无评论

Optimizing squares covering a set of points

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) 2014年 8881卷 37-52页

作者： Bhattacharya, Binay Das, Sandip Kameda, Tsunehiko Mahapatra, Priya Ranjan Sinha Song, Zhao School of Computing Science Simon Fraser University Burnaby Canada Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Computer Science and Engineering University of Kalyani Kalyani India Department of Computer Science University of Texas at Austin Austin United States

(1) Given a set of n points, find a given number of squares that enclose all the points, minimizing the size of the largest square *** investigate two kinds of optimization problems regarding points in the 2-dimensional plane that need to be enclosed by squares.(2) Given a set of n points, enclose the maximum number of points, using a specified number of squares of a fixed size. We provide different techniques to solve the above problems in cases where squares are axis-parallel or of arbitrary orientation, disjoint or overlapping. All the algorithms we use run in time that is a low-order polynomial in n. © Springer International Publishing Switzerland 2014.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Efficient channel assignment for cellular networks modeled as honeycomb grid 15

Efficient channel assignment for cellular networks modeled a...

引用

15th Italian Conference on Theoretical Computer Science, ICTCS 2014

作者： Nandi, Soumen Panigrahy, Nitish Agrawal, Mohit Ghosh, Sasthi C. Das, Sandip Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Computer Science and Engineering National Institute of Technology Rourkela India

The channel assignment problem with separation is formulated as a vertex coloring problem of a graph G = (V, E) where each vertex represents a base station and two vertices are connected by an edge if their corresponding base stations are interfering to each other. The L(δ1, δ2,,δt) coloring of G is a mapping f: V → {0,1, , λ} such that |f(u) - f(v)| ≥ δi if d(u,v) = i, where d(u,v) denotes the distance between vertices u and v in G and 1 ≤ i ≤ t. Here λ, the largest color assigned to a vertex of G, is known as the span. The same color can be reused in two vertices u and v if d(u,v) ≥ t+1, where t+1 is the reuse distance. The objective is to minimize λ over all such coloring function f. Here (δ1,δ2,,δt) is called the separation vector where δ1,δ2,,δt are positive integers with δ1 ≥ δ2 ≥ ≥ δt. Let λ∗ be the minimum span such that there exists an L(1, 1, , 1) coloring of G. We denote the separation vector (1,1,, 1) as (1t). We deal with the problem of finding the maximum value of δ1 such that there exists an L(δ1,1t-1) coloring with span equal to λ∗. So far bounds on δ1 have been obtained for L(δ1, 1t-1) coloring with span λ∗ for the square and triangular grids. Shashanka et al. [18] posed the problem as open for the honeycomb grid. We give lower and upper bounds of δ1 for L(δ1, 1t-1) coloring with span λ∗ of the honeycomb grid. The bounds are asymptotically tight. We also present color assignment algorithms to achieve the lower bound.

关键词： Coloring

来源：评论

学校读者我要写书评

暂无评论

A fast digital-geometric approach for granulometric image analysis 1

引用

2nd International Conference on Recent Advances on Information Technology, RAIT 2014

作者： Bera, Sahadev Biswas, Arindam Bhattacharya, Bhargab B. Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Information Technology Bengal Engineering and Science University Howrah India

ISBN: (数字)9788132218562

ISBN: (纸本)9788132218555

A simple algorithm for automated analysis of granulometric images consisting of touching or overlapping convex objects such as coffee bean, food grain, is presented. The algorithm is based on certain underlying digital-geometric features embedded in their snapshots. Using the concept of an outer isothetic cover and geometric convexity, the separator of two overlapping objects is identified. The objects can then be isolated by removing the isothetic covers and the separator. The technique needs only integer computation and its termination time can be controlled by choosing a resolution parameter. Experimental results on coffee beans and other images demonstrate the efficiency and robustness of the proposed method compared to earlier watershed-based algorithms. © Springer India 2014.

关键词： Image analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Greedy Algorithm with Forced Assignment and Compression for Fast Frequency Assignment in Cellular Network

A Probabilistic Greedy Algorithm with Forced Assignment and ...

引用

IEEE International Symposium on Network computing and Applications

作者： Subhankar Ghosal Sasthi C. Ghosh Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

This paper presents a probabilistic greedy algorithm for solving the channel assignment problem (CAP) in cellular networks. We took each call as a vertex of a complete edge weighed graph, termed as CAP graph, where an edge weight represents the minimum frequency separation needed between the calls represented by the terminal vertices of that edge. Our objective is to assign non-negative integers representing colors or frequencies to the vertices of the CAP graph such that the required span (maximum frequency - minimum frequency) is minimized while satisfying the frequency separation constraints represented by the edge weights. We begin with a probabilistic ordering of the vertices and apply frequency exhaustive strategy to color them. During the coloring, when color of a vertex exceeds the maximum color of previously allocated vertices, we apply a forced assignment phase to reduce the so far obtained span. Finally we propose an iterative compression phase to further reduce the span obtained from applying the frequency exhaustive strategy with forced assignment phase. The proposed polynomial time algorithm is then applied over the well-known benchmark instances and the obtained spans are measured. The obtained results show that the proposed algorithm performs better that the existing assignment strategies with respect to deviation from optimality and computation time. The time taken by our algorithm is less than 1.77 seconds (HP Z400 Workstation) even for the most difficult benchmark instances and thus is very much suitable where fast channel assignment is of primary importance while a marginal deviation from optimality may be tolerated.

关键词： Color Benchmark testing Vectors Probabilistic logic Base stations Interference Greedy algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient multicast association to improve the throughput in IEEE 802.11 WLAN

Efficient multicast association to improve the throughput in...

引用

International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE)

作者： Dhrubajyoti Bhaumick Sasthi C. Ghosh Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781479940363

This paper deals with the problem of optimal association of stations (STAs) to access points (APs) for mulicast services in IEEE 802.11 WLAN. In a multicast session, all the subscribed STAs receive the multicast data packet at the same data rate (R min ) from their respective serving APs. A higher value of R min improves the multicast throughput by completing the ongoing multicast session in lesser time. This also improves the unicast throughput as the cycle duration is shared by the unicast and multicast sessions. To provide multicast services to the STAs, we need to select a minimum cardinality subset of APs as the system message overhead depends on this cardinality. However, such a minimum cardinality subset of APs may not be possible to activate simultaneously due to the limited number of available orthogonal frequency channels. In this paper, we develop a combined greedy algorithm that selects a subset of APs with minimum cardinality for which a conflict-free frequency assignment exists and finds an association between the STAs and the selected APs that maximizes the R min value. Through simulation we have shown that the proposed algorithm selects significantly less number of APs for different R min values in comparison to the well-known metrics for multicast association like RSSI, minimum hop-distance, normalized-cost and in-range STA number.

关键词： Unicast Radio spectrum management Measurement Multicast communication Local area networks Interchannel interference

来源：评论

学校读者我要写书评

暂无评论

Coverage constrained non-uniform node deployment in wireless sensor networks for load balancing

Coverage constrained non-uniform node deployment in wireless...

引用

Applications and Innovations in Mobile computing (AIMoC)

作者： Punyasha Chatterjee Nabanita Das School of Mobile Computing and Communication Jadavpur University Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

Multi-hop wireless sensor networks with uniform node deployment, in general, suffers from uneven load distribution that finally creates an energy hole around the sink causing early failure of the network. However, it has been shown earlier that nearly balanced energy consumption can be achieved by utilizing non-uniform deterministic node distribution with increasing node density towards the sink. In this paper, a novel model is proposed for non-uniform deterministic node distribution that reduces the total number of nodes to be deployed over the area and the network traffic satisfying both coverage and load balancing criteria. Also, with random node distribution, a simple distributed algorithm is developed for nearly load-balanced data gathering. Performance comparison with earlier works by simulation shows that the proposed model performs better in terms of network lifetime, network traffic and packet drops.

关键词： Corona Routing Load management Wireless sensor networks Distributed databases Load modeling Topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：