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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A synthesis method for quaternary quantum logic circuits 1

引用

16th International Symposium on VLSI Design and Test, VDAT 2012

作者： Mandal, Sudhindu Bikash Chakrabarti, Amlan Sur-Kolay, Susmita A.K. Choudhury School of Information Technology University of Calcutta India Advanced Computing and Microelectronics Unit Indian Statistical Institute India

ISBN: (数字)9783642314940

ISBN: (纸本)9783642314933

Synthesis of quaternary quantum circuits involves basic quaternary gates and logic operations in the quaternary quantum domain. In this paper, we propose new projection operations and quaternary logic gates for synthesizing quaternary logic functions. We also demonstrate the realization of the proposed gates using basic quantum quaternary operations. We then employ our synthesis method to design of quaternary adder and some benchmark circuits. Our results in terms of circuit cost, are better than the existing works. © 2012 Springer-Verlag.

关键词： Adders

来源：评论

学校读者我要写书评

暂无评论

Horizontal Auto-Scaling for Multi-Access Edge computing Using Safe Reinforcement Learning

引用

ACM Transactions on Embedded computing Systems 2021年第6期20卷 1–33页

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

Multi-Access Edge computing (MEC) has emerged as a promising new paradigm allowing low latency access to services deployed on edge servers to avert network latencies often encountered in accessing cloud services. A key component of the MEC environment is an auto-scaling policy which is used to decide the overall management and scaling of container instances corresponding to individual services deployed on MEC servers to cater to traffic fluctuations. In this work, we propose a Safe Reinforcement Learning (RL)-based auto-scaling policy agent that can efficiently adapt to traffic variations to ensure adherence to service specific latency requirements. We model the MEC environment using a Markov Decision Process (MDP). We demonstrate how latency requirements can be formally expressed in Linear Temporal Logic (LTL). The LTL specification acts as a guide to the policy agent to automatically learn auto-scaling decisions that maximize the probability of satisfying the LTL formula. We introduce a quantitative reward mechanism based on the LTL formula to tailor service specific latency requirements. We prove that our reward mechanism ensures convergence of standard Safe-RL approaches. We present experimental results in practical scenarios on a test-bed setup with real-world benchmark applications to show the effectiveness of our approach in comparison to other state-of-the-art methods in literature. Furthermore, we perform extensive simulated experiments to demonstrate the effectiveness of our approach in large scale scenarios.

关键词： Multi-access edge computing safe reinforcement learning auto-scaling

来源：评论

学校读者我要写书评

暂无评论

Almost Empty Monochromatic Triangles in Planar Point Sets

引用

Electronic Notes in Discrete Mathematics 2013年第0期44卷 53-59页

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

For positive integers c, s≥1, let M3(c, s) be the smallest integer such that any set of at least M3(c, s) points in the plane, no three on a line, and colored with c colors, contains a monochromatic triangle with at ... 详细信息

For positive integers c, s≥1, let M₃(c, s) be the smallest integer such that any set of at least M₃(c, s) points in the plane, no three on a line, and colored with c colors, contains a monochromatic triangle with at most s interior points. The case s=0, which corresponds to empty monochromatic triangles, has been studied extensively over the last few years. In particular, it is known that M₃(1, 0)=3, M₃(2, 0)=9 and M₃(c, 0)=∞, for c≥3. In this paper, we prove that the smallest integer λ₃(c) such that M₃(c, λ₃(c))<∞ is bounded above by c-2. We show this by proving M₃(c, c-2)≤(c+1)², for c≥2. We also determine the exact values of M₃(c, s) for small values of c and s. © 2013 Elsevier B.V.

关键词： Combinatorial convexity Discrete geometry Empty polygons Erdos-Szekeres theorem

来源：评论

学校读者我要写书评

暂无评论

Length-based anchor-free distributed localization in a covered sensor network

Length-based anchor-free distributed localization in a cover...

引用

4th International Conference on Wireless Communication and Sensor Networks, WCSN 2008

作者： Sau, B. Mukhopadhyaya, K. Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Mathematics Jadavpur University Kolkata India Government of India India

ISBN: (纸本)9781424433261

Centralized localization dissipates a lot of energy in pooling the proximity information of the individual nodes. In contrast a distributed algorithm usually uses only local information at each node. Most localization algorithms available in the literature are are anchor based or they estimate the position of the sensors at the cost of losing accuracy. In this paper, we propose an anchor-free length-based distributed localization technique under a restricted model which solves a specialized case of this problem. The model assumes that all known distances between the sensors are less than the communication range of the sensors and all unknown distances are greater. We also assume that communication range is at least twice as much as the sensing range. Every point in the field of interest is assumed to be covered by some sensor. Each sensor localizes some of its neighbours with information from its neighbours. Each node communicates information for localization to its neighbours only;thus reducing traffic over the network. We also show that, the time required to localize all sensors uniquely under this model is linear in the number of sensors. © 2008 IEEE.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

Throughput optimization for multirate multicasting through association control in ieee 802.11 wlan 1

引用

14th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, Qshine 2018

作者： Bhaumick, Dhrubajyoti Ghosh, Sasthi C. Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road KolkataWest Bengal700108 India

ISBN: (数字)9783030144135

ISBN: (纸本)9783030144128

Multicasting in wireless local area network is an efficient way to deliver message from a source user to a specified group of destination users simultaneously. In unirate multicasting, all users belonging to a particular group receive their services at the same basic rate. This may underutilize network resources as users requirements are generally heterogeneous in nature. To resolve this limitation, multirate multicasting is introduced, where different users belonging to a particular group may receive their services at different rates. Often dense deployment of access points (APs) is required for coverage and capacity improvement. Thus an station (STA) may come under the coverage range of several APs and hence there may exists many possible associations between the STAs and the APs. Hence finding an efficient association is very important as individual throughput of the STAs as well as the overall system throughput depend on it. We have developed an efficient algorithm to find an appropriate association for multirate multicasting. The objective is to maximize overall system throughput while respecting the user fairness. Through simulations, we have evaluated and compared the performance of our proposed algorithm with other well-known metrics such as received signal strength indicator, minimum hop-distance, in-range STA number and normalized cost. Results show that the proposed algorithm significantly improves the overall system throughput in comparison to these metrics. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2019.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

MAB based Network Selection mechanism for URLLC users in RIS assisted network 21

MAB based Network Selection mechanism for URLLC users in RIS...

引用

21st IEEE International Symposium on Network computing and Applications, NCA 2022

作者： Deb, Souvik Ghosh, Shankar Kumar Ghosh, Sasthi C. Indian Statistical Institute Advanced Computing & Microelectronics Unit Kolkata India Shiv Nadar Institution of Eminence Department of CSE NCR Delhi India

ISBN: (纸本)9798350397307

In this work, a network selection mechanism for re-configurable intelligent surface (RIS) assisted network has been proposed. The goal of the proposed mechanism is to select appropriate base station (BS) or BS-RIS pair to maximize user throughput while satisfying the delay and reliability constraints of uRLLC users. First, the network selection mechanism for RIS assisted network has been formulated as multi arm bandit (MAB) problem;Then, based on the formulation, a network selection strategy has been proposed. Finally, through extensive system level simulations, it has been shown that the proposed scheme outperforms the existing A3 handover scheme in terms of reliability and user throughput. © 2022 IEEE.

关键词： Interlocking signals

来源：评论

学校读者我要写书评

暂无评论

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 2

A fast digital-geometric approach for granulometric image an...

引用

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: (纸本)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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：