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

25th International Conference on Principles of Distributed Systems, OPODIS 2021

作者： Bose, Kaustav Das, Archak Sau, Buddhadeb Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Mathematics Jadavpur University Kolkata India

ISBN: (纸本)9783959772198

Arbitrary Pattern Formation is a fundamental problem in autonomous mobile robot systems. The problem asks to design a distributed algorithm that moves a team of autonomous, anonymous and identical mobile robots to form any arbitrary pattern F given as input. In this paper, we study the problem for robots whose movements can be inaccurate. Our movement model assumes errors in both direction and extent of the intended movement. Forming the given pattern exactly is not possible in this setting. So we require that the robots must form a configuration which is close to the given pattern F. We call this the Approximate Arbitrary Pattern Formation problem. With no agreement in coordinate system, the problem is unsolvable, even by fully synchronous robots, if the initial configuration 1) has rotational symmetry and there is no robot at the center of rotation or 2) has reflectional symmetry and there is no robot on the reflection axis. From all other initial configurations, we solve the problem by 1) oblivious, silent and semi-synchronous robots and 2) oblivious, asynchronous robots that can communicate using externally visible lights. © Kaustav Bose, Archak Das, and Buddhadeb Sau.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

Pack your sack for the cloud 12

Pack your sack for the cloud

引用

5th India Software Engineering Conference, ISEC 2012

作者： Banerjee, Ansuman Ghosh, Sasthi C. Banerjee, Nilanjan Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India IBM Research - India New Delhi India

ISBN: (纸本)9781450311427

With the emergence of cloud computing, driven by significant advances in virtualization and network technologies, enterprise computing is witnessing a major paradigm shift in terms of resource consolidation. This paper introduces the concept of a comprehensive management framework for resource consolidation in cloud based systems. As it turns out, there are several interesting optimization problems with respect to resource and service utilization. This paper is a modest attempt to identify a generic pattern in the family of optimization problems and propose a unified formalism to address the associated issues. In this work we demystify a number of optimization problems in the cloud management framework and map them to the Knapsack Problem, a well-researched problem in the academic community. We believe that this classification will have significant value proposition to the cloud designer community. The repertoire of methodologies available in Knapsack research can easily provide a ready toolset to the cloud community for solving a number of key design issues. © 2012 ACM.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for channel assignment in a cellular network 4th

Efficient algorithms for channel assignment in a cellular ne...

引用

4th International Workshop on Distributed computing, IWDC 2002

作者： Sinha, Bhabani P. Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata India

ISBN: (纸本)354000355X

During recent years, the world is experiencing almost an exponential growth in the demand for various mobile communication services. On the other hand, the available bandwidth for such communication is very much limited. As a result, efficient utilization of bandwidth for mobile communication has become more and more critical. When a mobile cellular network is designed, each cell of the network is assigned a set of channels to provide services to the individual calls of the cell. The task of assigning frequency channels to the cells satisfying some frequency separation constraints with a view to avoiding channel interference and using as small bandwidth as possible is known as the channel assignment problem. Three types of interference are generally taken into consideration in the form of constraints: i) co-channel constraint, due to which the same channel is not allowed to be assigned to certain pairs of cells simultaneously, ii) adjacent channel constraint, for which adjacent channels are not allowed to be assigned to certain pairs of cells simultaneously, and iii) co-site constraint, which implies that any pair of channels assigned to the same cell must be separated by a certain number. In its most general form, the channel assignment problem (CAP) is equivalent to the generalized graph-coloring problem which is a well-known NPcomplete problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Gracefulness of vertex duplicated complete bipartite graph for static and incremental frequency allocation

引用

Electronic Notes in Discrete Mathematics 2015年 48卷 89-93页

作者： Sandhupatla, Amruth Ghosh, Sasthi C. Department of Electronics and Communication Engineering National Institute of Technology Warangal India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

We consider the vertex duplicated complete bipartite graph G'(VA, VB) which is formed by duplicating all the vertices of a complete bipartite graph G(A, B). We then deal with the gracefulness of G'(VA, VB) by ... 详细信息

We consider the vertex duplicated complete bipartite graph G^'(V_A, V_B) which is formed by duplicating all the vertices of a complete bipartite graph G(A, B). We then deal with the gracefulness of G^'(V_A, V_B) by considering both static and incremental frequency allocation to it. We have proved that the graceful labeling of G^'(V_A, V_B) is possible only for the case of static frequency allocation but not for the incremental frequency allocation. Finally we have shown that graceful labeling of G(A, B) satisfying certain additional properties can be extended to a σ-labeling of G^'(V_A, V_B) for the incremental frequency allocation. © 2015 Elsevier B.V.

关键词： Complete bipartite graph Frequency allocation Graceful labeling

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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 finding an empty staircase polygon of largest area (width) in a planar point-set

引用

Computational Geometry: Theory and Applications 2003年第2期26卷 143-171页

作者： Nandy, Subhas C. Bhattacharya, Bhargab B. Advanced Computing and Micro-electronics Unit Indian Statistical Institute 203 B.T. Road Calcutta 700 108 India

This paper presents an algorithm for identifying a maximal empty-staircase-polygon (MESP) of largest area, among a set of n points on a rectangular floor. A staircase polygon is an isothetic polygon bounded by two monotonically rising (falling) staircases. A monotonically rising staircase is a sequence of alternatingly horizontal and vertical line segments from the bottom-left corner of the floor to its top-right corner such that for every pair of points α=(xα,yα) and β=(x β,yβ) on the staircase, x αxβ implies yαy β. A monotonically falling staircase can similarly be defined from the bottom-right corner of the floor to its top-left corner. An empty staircase polygon is a MESP if it is not contained in another larger empty staircase polygon. The problem of recognizing the largest MESP is formulated using permutation graph, and a simple O(n3) time algorithm is proposed. Next, based on certain novel geometric properties of the problem, an improved algorithm is developed that identifies the largest MESP in O(n 2) time and space. The algorithm can be easily tailored for identifying the widest MESP in a similar environment. The general problem of locating the largest area/width MESP among a set of isothetic polygonal obstacles, can be solved easily. These geometric optimization problems have several applications to VLSI layout design, robot motion planning, to name a few. © 2003 Elsevier B.V. All rights reserved.

关键词： Geometric graph theory Permutation graphs Algorithms Complexity

来源：评论

学校读者我要写书评

暂无评论

L(2, 1)-edge labeling of Infinite Triangular Grid 22

L(2, 1)-edge labeling of Infinite Triangular Grid

引用

22nd Italian Conference on Theoretical Computer Science, ICTCS 2021

作者： Bandopadhyay, Susobhan Ghosh, Sasthi C. Koley, Subhasis National Institute Of Science Education And Research Hbni Bhubaneswar India Advanced Computing And Microelectronics Unit Indian Statistical Institute Kolkata India

An L(h, k)-edge labeling of a graph G is the assignment of labels {0, 1, · · · , n} to the edges in such a way that two adjacent edges get labels with a difference at least h and the labels of distance two edges, i.e., two non-adjacent edges having a common edge connecting them get labels with a difference at least k, where h and k are two given non-negative integers. The span λ 0 h,k(G) is the minimum n such that G admits an L(h, k)-edge labeling. For three given integers n, h and k, an n-circular-L(h, k)-edge labeling f 0 of a graph G is an assignment from integers {0, 1, · · · , n1} in such a way that if two edges e and e 0 are adjacent then |f 0 (e) - f 0 (e 0 )|n ≥ h and if they are distance two edges then |f 0 (e) - f 0 (e 0 )|n ≥ k, where |x|n = min{x, n - x}. The circular span σ 0 h,k(G) is the minimum n such that G admits an n-circular L(h, k)-edge labeling. Here, we focus on finding λ 0 2,1(G) and σ 0 2,1(G) where G is infinite regular triangular grid T6. We work on the conjecture λ 0 2,1(T6) = 16 and the bound σ 0 2,1(T6) ≤ 18 given by Lin and Wu [J. Comb. Opt., 2013]. We prove the conjecture and give a labeling function for T6 such that σ 0 2,1(T6) ≤ 18 as no labeling function was given by Lin and Wu in this case. © 2021 CEUR-WS. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Anomaly Detection in Evolutionary Social Networks leveraging Community Structure 15

Anomaly Detection in Evolutionary Social Networks leveraging...

引用

15th IEEE International Conference on Service Operations and Logistics, and Informatics, SOLI 2021

作者： Ghoshal, Arnab Kumar Das, Nabanita Asutosh College Department of Computer Science Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781665467223

Social networks are temporally evolving by nature and in general, the evolution takes place gradually with time. But occasionally, the nodes may exhibit anomalous behavior that is to be detected and reported in real time. Usually, the social networks are represented as a temporal stream of weighted graphs, where edge weights stand for frequency or power of actions. Here, for identification of anomalies in evolutionary social networks, we follow an action based approach leveraging the community structure of the network, where it is shown that only the Community Boundary Nodes are enough to detect anomaly in a temporally evolving social network. We introduce a new definition of anomaly score for nodes based on its action history. To the best of our knowledge, this is the first work to exploit the community boundary nodes of an evolutionary social network to identify the graph snapshots containing anomalous events. Experimental studies on real-world as well as synthetic evolutionary networks show that the proposed technique achieves almost 13% improvement in F-Score compared to the state-of-the-art algorithms. Moreover, parallel implementation of the proposed technique results nearly 6 x speedup making it suitable for real time computation of anomaly in evolutionary social networks. © 2021 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Improved Lower Bound for L(1, 2)-Edge-Labeling of Infinite 8-Regular Grid 9th

Improved Lower Bound for L(1, 2)-Edge-Labeling of Infinite ...

引用

The 9th International Conference on Mathematics and computing (ICMC 2023)

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

ISBN: (纸本)9789819930791

Let us take two given integers h and k where h, k≥ 0 and a graph G= (V(G), E(G) ). An L(h, k)-edge-labeling for G is defined as a function f′: E(G) → { 0, 1, ⋯, n} such that ∀ e1, e2∈ E(G), | f′(e1) - f′(e2) | ≥ h when d′(e1, e2) = 1 and | f′(e1) - f′(e2) | ≥ k when d′(e1, e2) = 2 where d′(e1, e2) denotes the distance between e1 and e2 in G. If there is no other way to connect e1 and e2 with less than k′- 1 number of edges in G, then d′(e1, e2) = k′. The objective is to find the span which is the least value of n obtained over all such L(h, k)-edge-labeling for G, and it is denoted as λh,k′(G). Motivated from the channel assignment problem in wireless network, L(h, k)-edge-labeling has been studied for various infinite regular grid graphs. For infinite 8-regular grid T8, it is known in the existing literature that 25≤λ1,2′(T8)≤28. But the lower and upper bounds obtained there are not identical. Here, we improve the lower bound and prove that λ1,2′(T8)≥28 and eventually it is proved that λ1,2′(T8)=28. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2023.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：