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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

178 篇 会议
89 篇 期刊文献
3 册 图书

馆藏范围

270 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

153 篇 工学
- 104 篇 计算机科学与技术...
- 56 篇 软件工程
- 39 篇 电子科学与技术（可...
- 39 篇 信息与通信工程
- 20 篇 光学工程
- 17 篇 控制科学与工程
- 14 篇 电气工程
- 12 篇 生物工程
- 10 篇 生物医学工程（可授...
- 9 篇 动力工程及工程热...
- 9 篇 化学工程与技术
- 7 篇 机械工程
- 7 篇 交通运输工程
- 5 篇 力学（可授工学、理...
- 5 篇 材料科学与工程（可...
- 5 篇 安全科学与工程
- 4 篇 仪器科学与技术
- 3 篇 农业工程
96 篇 理学
- 66 篇 数学
- 29 篇 物理学
- 13 篇 生物学
- 13 篇 统计学（可授理学、...
- 9 篇 化学
- 4 篇 系统科学
18 篇 管理学
- 17 篇 管理科学与工程(可...
- 5 篇 工商管理
5 篇 法学
- 5 篇 社会学
5 篇 医学
- 5 篇 临床医学
- 4 篇 基础医学(可授医学...
3 篇 农学
2 篇 经济学

主题

16 篇 routing
12 篇 microelectronics
10 篇 throughput
10 篇 wireless sensor ...
8 篇 computer science
8 篇 interference
8 篇 computational mo...
7 篇 base stations
7 篇 error correction
7 篇 logic gates
6 篇 delays
6 篇 bandwidth
6 篇 algorithm design...
6 篇 topology
6 篇 protocols
6 篇 field programmab...
6 篇 measurement
6 篇 computer network...
5 篇 network topology
5 篇 resource managem...

机构

97 篇 advanced computi...
41 篇 advanced computi...
23 篇 advanced computi...
16 篇 advanced computi...
9 篇 advanced computi...
8 篇 a. k. choudhury ...
6 篇 advanced computi...
6 篇 indian statistic...
4 篇 indian statistic...
4 篇 the advanced com...
4 篇 department of co...
4 篇 advanced computi...
4 篇 advanced computi...
4 篇 ibm quantum ibm ...
4 篇 atos pune
4 篇 department of ma...
3 篇 advanced computi...
3 篇 department of el...
3 篇 advance computin...
3 篇 department of co...

作者

35 篇 ghosh sasthi c.
26 篇 majumdar ritajit
25 篇 sasthi c. ghosh
24 篇 sur-kolay susmit...
21 篇 susmita sur-kola...
18 篇 das sandip
17 篇 bhargab b. bhatt...
16 篇 bhattacharya bha...
14 篇 ansuman banerjee
14 篇 nabanita das
11 篇 bhoumik debasmit...
11 篇 mukhopadhyaya kr...
8 篇 nandy subhas c.
7 篇 ritajit majumdar
7 篇 das nabanita
7 篇 chakrabarti amla...
7 篇 sinha bhabani p.
6 篇 mukherjee priyad...
6 篇 bose kaustav
6 篇 koley subhasis

语言

265 篇 英文
5 篇 其他

检索条件"机构=Advanced Computing And Microelectronics Unit Indian Statistical Institute"

共 270 条记录，以下是11-20 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Modeling and Verification of Service Allocation Policies for Multi-Access Edge computing Using Probabilistic Model Checking

Modeling and Verification of Service Allocation Policies for...

引用

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

In recent times, Multi-Access 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 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 guarantees on performance metrics. Indeed, the evolving environment, along with a large allocation configuration space makes proving performance guarantees for such allocation policies a challenging task. Further, the implications of MEC server failures on allocation policies have been relatively unexplored. 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 the San Francisco taxi dataset, the LDNS availability dataset and allocation policies from recent literature to validate our approach. Experimental results demonstrate how our model can be utilized to quantitatively compare performance metrics of service allocation policies in MEC systems. © 2004-2012 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Fast Estimation of Coverage Area in a Pervasive computing Environment

Fast Estimation of Coverage Area in a Pervasive Computing En...

引用

2nd International Conference on advanced computing, Networking and Informatics, ICACN 2014

作者： Saha, Dibakar Das, Nabanita Bhattacharya, Bhargab B. Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9783319073491

In many applications of pervasive computing and communication, it is often mandatory that a certain service area be fully covered by a given deployment of nodes or access points. Hence, a fast and accurate method of estimating the coverage area is needed. However, in a scenario with a limited computation and communication capability as in self-organized mobile networks, where the nodes are not static, computation-intensive algorithms are not suitable. In this paper, we have presented a simple algorithm for estimating the area covered by a set of nodes randomly deployed over a 2-D region. We assume that the nodes are identical and each of them covers a circular area. For fast estimation of the collective coverage of n such circles, we approximate each real circle by the tightest square that encloses it as well as by the largest square that is inscribed within it, and present an O(n logn) time algorithm for computation. We study the variation of the estimated area between these two bounds, for random deployment of nodes. In comparison with an accurate digital circle based method, the proposed algorithms estimate the area coverage with only 10% deviation, while reducing the complexity of area computation significantly. Moreover, for an over-deployed network, the estimation provides an almost exact measure of the covered area. © Springer International Publishing Switzerland 2014.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

LazyUAV: A Minimal Displacement Coverage Strategy for Multi-UAV mmWave Networks 3

LazyUAV: A Minimal Displacement Coverage Strategy for Multi-...

引用

3rd IEEE International Mediterranean Conference on Communications and Networking, MeditCom 2023

作者： Sarkar, Subhojit Dutta, Rathindra Nath Ghosh, Sasthi C. Indian Statistical Institute Advanced Computing and Microelectronics Unit Kolkata India

ISBN: (纸本)9798350333732

Unmanned Aerial Vehicles (UAVs) are a potential platform for deploying millimeter wave (mmWave) base stations. Their high spatial flexibility makes them an attractive choice for the deployment in disaster management scenarios, and for offloading in crowded areas. Apart from the stringent propagation requirements of mmWaves, one challenge that has to be addressed is the limited power onboard a UAV, which is used to hover and move the device, and of course, to transmit data. In this paper, we deal with the deployment of UAVs with an aim to minimising their displacement in subsequent time. We take into consideration user mobility, and propose LazyUAV, a Set-Cover based geometric approach to minimise UAV displacement, while maintaining maximal coverage. Via extensive simulations, we demonstrate the effectiveness of our approach. © 2023 IEEE.

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

Mutual visibility by robots with persistent memory 1

引用

13th International Workshop on Frontiers in Algorithmics, FAW 2019

作者： Bhagat, Subhash Mukhopadhyaya, Krishnendu Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (数字)9783030181260

ISBN: (纸本)9783030181253

This paper addresses one of the fundamental geometric formation problems, namely the mutual visibility problem, for a set of semi-synchronous, opaque robots occupying distinct positions in the Euclidean plane. Since robots are opaque, if three robots lie on a line, the middle robot obstructs the visions of the two other robots. The mutual visibility problem requires the robots to coordinate their movements to form a configuration, within finite time and without collision, in which no three robots are collinear. We assume that robots are endowed with constant bits of persistent memory. We consider the computational model [4] in which the persistent memory is used by the robots only to remember their previous internal states. This piece of information is not communicated or visible to the other robots. Except from this persistent memory, robots are oblivious i.e., they do not carry forward any other information from their previous computational cycles. The paper presents a distributed algorithm to solve the mutual visibility problem for a set of semi-synchronous robots using only 1 bit of persistent memory. The proposed algorithm also provides a self-stabilizing solution to the problem. The algorithm does not impose any other restriction on the capability of the robots and guarantees collision-free movements for the robots. © Springer Nature Switzerland AG 2019.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

Pre-emptive Spectrum Access in Cognitive Radio for Better QoS 4th

Pre-emptive Spectrum Access in Cognitive Radio for Better Q...

引用

4th International Conference on advanced computing and Intelligent Engineering, ICACIE 2019

作者： Das, Avirup Karar, Sandip Das, Nabanita Ghosh, Sasthi C. Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9789811565830

Cognitive radio techniques are becoming very popular to overcome the spectrum scarcity. For dynamic channel access, spectrum latency is a major bottleneck to achieve good QoS. In this paper, we have proposed distributed proactive channel scanning for different channel assignment policies of primary users (PUs). From periodic channel scanning, secondary users (SUs) store recent history of channel occupancy, and based on that decide the order of channel selection when demand comes, and switch channels proactively, if any better channel appears. For various channel allocation strategies of primary users, different channel selection algorithms are presented for secondary users to improve the spectrum latency as well as the channel switching overhead per call. Through simulation, the performance of the proposed strategies is compared with that of conventional cognitive radio. Results show that by the proposed scheme, the call drop/block rate decreases by more than 30 % with significant reduction in interference, and hence improving the QoS of the system. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

Largest triangle inside a terrain 31

Largest triangle inside a terrain

引用

31st Canadian Conference on Computational Geometry, CCCG 2019

作者： Das, Arun Kumar Das, Sandip Mukherjee, Joydeep Advanced Computing and Microelectronics Unit Indian Statistical Institute Calcutta India

In this paper, we present an O(n2) time algorithm to find a largest area triangle contained inside a terrain with n vertices. We also present an O(n log n) time 1/2-factor approximation for the same. © CCCG 2019....

关键词：

来源：评论

学校读者我要写书评

暂无评论

Uniform k-Circle Formation by Fat Robots 25th

Uniform k-Circle Formation by Fat Robots

引用

25th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2023

作者： Das, Bibhuti Mukhopadhyaya, Krishnendu Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9783031442735

In this paper, we study the uniform k-circle formation by a swarm of mobile robots with dimensional extent. For some k> 0, the k-circle formation problem asks the robots to form disjoint circles. Each circle must be centered at one of the pre-fixed points given in the plane. Each circle should contain exactly k distinct robot positions. The k-circle formation problem has already been studied for punctiform robots in the plane. In this paper, the robots are represented by transparent unit disks in the plane. They are autonomous, anonymous, homogeneous, and silent. The robots are oblivious and execute Look-Compute-Move (LCM) cycle under a fair asynchronous scheduler. The direction and orientation of one of the axes are agreed upon by the robots. In this setting, we have characterized all the initial configurations and values of k for which the uniform k-circle formation problem is deterministically unsolvable. For the remaining configurations and values of k, a deterministic distributed algorithm has been proposed that solves the uniform k-circle formation problem within finite time. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Obstacle Aware Link Selection for Stable Multicast D2D Communications 3rd

Obstacle Aware Link Selection for Stable Multicast D2D Comm...

引用

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

作者： Dutta, Rathindra Nath Ghosh, Sasthi C. Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9783031352980

The rapid growth of multimedia applications requiring high bandwidth has paved the way for millimeter-wave (mmWave) device-to-device (D2D) communications. In many modern applications, such as video streaming, same data packets need to be delivered to a group of users. Multicasting these packets has a clear advantage over repeated unicast. Establishing a stable multicast route for mmWave D2D communications is a challenging task as presence of obstacles can easily break a link. In this work we devise a mechanism for constructing a stable route for D2D multicast communications in presence of static as well as dynamic obstacles. This requires some knowledge about the blockage probabilities due to the obstacles. We then present a way of learning these blockage probabilities using the Dempster-Shafer evidential theory framework. We show the effectiveness of our proposed scheme over an existing approach through extensive simulations. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

Query complexity of global minimum cut 24

Query complexity of global minimum cut

引用

24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021 and 25th International Conference on Randomization and Computation, RANDOM 2021

作者： Bishnu, Arijit Ghosh, Arijit Mishra, Gopinath Paraashar, Manaswi Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9783959772075

In this work, we resolve the query complexity of global minimum cut problem for a graph by designing a randomized algorithm for approximating the size of minimum cut in a graph, where the graph can be accessed through local queries like Degree, Neighbor, and Adjacency queries. Given ϵ ∈ (0, 1), the algorithm with high probability outputs an estimate t satisfying the following (1 − ϵ)t ≤ t ≤ (1 + ϵ)t, where t is the size of minimum cut in the graph. The expected number of local queries used by our algorithm is min {m + n, mt poly (log n, 1ϵ) where n and m are the number of vertices and edges in the graph, respectively. Eden and Rosenbaum showed that Ω(m/t) local queries are required for approximating the size of minimum cut in graphs, but no local query based algorithm was known. Our algorithmic result coupled with the lower bound of Eden and Rosenbaum [APPROX 2018] resolve the query complexity of the problem of estimating the size of minimum cut in graphs using local queries. Building on the lower bound of Eden and Rosenbaum, we show that, for all t ∈ N, Ω(m) local queries are required to decide if the size of the minimum cut in the graph is t or t − 2. Also, we show that, for any t ∈ N, Ω(m) local queries are required to find all the minimum cut edges even if it is promised that the input graph has a minimum cut of size t. Both of our lower bound results are randomized, and hold even if we can make Random Edge queries in addition to local queries. © Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar;licensed under Creative Commons License CC-BY 4.0

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Joint Base Station and Reflector Placement in an urban mmWave Network 3

Joint Base Station and Reflector Placement in an urban mmWav...

引用

3rd IEEE International Mediterranean Conference on Communications and Networking, MeditCom 2023

作者： Dutta, Rathindra Nath Sarkar, Subhojit Ghosh, Sasthi C. Indian Statistical Institute Advanced Computing and Microelectronics Unit Kolkata India

ISBN: (纸本)9798350333732

Millimeter-wave (mmWave) technology is expected to be the backbone of future communication networks. However, for all its benefits, mmWave communication comes with its fair share of challenges. In this context, the obstacle free strict line-of-sight (LOS) requirement is one of the primary hurdles that has to be crossed. One way to deal with this problem is to densely deploy small range base stations, called gNBs, to overcome outage due to obstacles. Reflectors have been proposed to augment the transmission environment, and reflect mmWaves bypassing the obstacles. Evidently, they can be used to increase the coverage area that do not have LOS with the available gNBs. We argue that considering the placement of gNBs and reflectors independently may lead to suboptimal solution. In this paper, we consider an urban deployment scenario, and attempt to maximally cover it by jointly placing the gNBs and reflectors. Given the hardness of the joint problem, we first develop a set cover based greedy solution and also provide a linear programming (LP) relaxation based solution. With extensive simulations, we show that with fixed number of available gNBs and reflectors to be placed, both our joint placement solutions can achieve a larger coverage compared to an existing approach. © 2023 IEEE.

关键词： Base stations

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共27页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：