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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是261-270 订阅

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

详细简洁

排序：

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimal channel assignment in cellular networks with non-homogeneous demands

Optimal channel assignment in cellular networks with non-hom...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： S.C. Ghosh B.P. Sinha N. Das Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

This paper deals with the channel assignment problem (CAP) in a hexagonal cellular network with 2-band buffering, where the interference does not extend beyond two cells. Here, we first present new lower bounds on the required bandwidth for a cellular network with homogeneous demand /spl omega/, for various relative values of s/sub 0/, s/sub 1/, and s/sub 2/, the minimum frequency separations required to avoid interference for calls in the same cell, or in cells at distances one and two respectively, where s/sub 0//spl ges/s/sub 1//spl ges/s/sub 2/. Next we present some novel strategies for assigning channels to the cells of the entire cellular network with a homogeneous demand w using a genetic algorithm. We then show how these strategies for homogeneous demand can be extended to the cases with nonhomogeneous demand vector W=(w/sub i/), where w/sub i/ represents the channel requirement for cell i. Most interestingly, it shows that in some cases depending on s/sub 0/, s/sub 1/ and s/sub 2/ the required bandwidth is mainly determined by the maximum demand w/sub max/ in W. It shows that in terms of bandwidth requirement the case is almost equivalent with cellular networks having homogeneous demand w/sub max/. The technique also results optimal bandwidth solutions for all the eight well-known benchmark instances including the most difficult two.

关键词： Intelligent networks Land mobile radio cellular systems Bandwidth Interference Genetic algorithms Frequency Neural networks Simulated annealing Computer networks microelectronics

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of dynamic location updation strategies for mobile users

Performance analysis of dynamic location updation strategies...

引用

International Conference on Distributed computing Systems

作者： A. Bera N. Das Advanced Computing and Microelectronics Unit Indian Statistical Institute Calcutta India

This paper focuses on the important issue of strategies for tracking users in a mobile communication network. Since the users are mobile, the network must keep track of where the users are, a prerequisite for routing calls to the users. We assume that the mobile users periodically inform the network of their present location. Now, it is very important to decide an efficient location updation strategy that will optimize the overhead in terms of usage of radio spectrum and power, as well as the search cost for a mobile when a call is to be set up. Static location updation strategies often result in poor performance. Three dynamic location updation strategies have been considered, namely, the time-based strategy, the movement-based strategy and the distance-based strategy. A memoryless movement pattern on a two-dimensional mesh topology of cells has been studied. Analytical models have been developed to compare the performance of the strategies. Simulation studies also have been made for performance evaluation.

关键词： Performance analysis Personal communication networks Cellular networks Databases Mobile computing Computer networks microelectronics Mobile communication Routing Cost function

来源：评论

学校读者我要写书评

暂无评论

A combinatorial approach to performance analysis of a shared-memory multiprocessor 5th

引用

5th Annual International Conference on computing and Combinatorics, COCOON 1999

作者： Das, Sajal K. Sinha, Bhabani P. Chaudhuri, Rajarshi Department of Computer Science University of North Texas TX76203 United States Advanced Computing Unit Indian Statistical Institute Calcutta700 035 India

ISBN: (纸本)3540662006

A unified approach is proposed for performance analysis of an N × M shared-memory multiprocessor system, consisting of N processors and M memory modules, each of which may be ‘hot’ and/or ‘favorite’. Processors are allowed to have non-uniform memory access patterns and unsatisfied requests are queued up in the buffers of the corresponding modules. The system performance is measured in terms of the effective bandwidth, which is the average number of busy memory modules in one cycle. Our analytical approach, based on the combinatorial arguments as well as queuing models, estimates the bandwidth with good accuracy for arbitrary values of N and M. These estimations tally very well with the simulation results. Since the presence of a hot module almost always leads to an accumulation of memory requests in its direction and thus deteriorates the system performance, one may expect that the hotness should be spread over as many (say, K) modules as possible. However, simulation results showed an upper bound on K beyond which the bandwidth either drops or saturates. From the approximate queuing model, we derive those saturation values in terms of N, M and ph (the probability of accessing a hot module by a processor). © Springer-Verlag Berlin Heidelberg 1999.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

High performance MCM routing: a new approach

High performance MCM routing: a new approach

引用

International Conference on VLSI Design

作者： S. Das S.C. Nandy B.B. Bhattacharya Department of Computer Science & Appl. North Bengal University Darjeeling India Advanced Computing & Microelectronics Unit Indian Statistical Institute Calcutta India

In this paper, we present a new approach to MCM routing to minimize the number of vias and wire length. A 3D routing substrate is partitioned into a number of layers. Chip blocks are placed on the top layer, and routing layers are used pair-wise for interconnections. The set of projected pins of the blocks on a routing layer plays the role of obstacles; the space (river) between two consecutive rows/columns of blocks is used for routing. The proposed algorithm consists of a preprocessing stage that determines a routing order among the nets. For each net, a rectilinear Steiner tree with a minimum number of bends is constructed, and the nets are ordered on the basis of a metric called average path length. Next, routing is done in the nonoverlap model, using a heuristic guided by the above ordering. Finally, via minimization is achieved by slightly re-routing the nets in the overlap model. Experimental evidence on standard benchmarks reveals that our solution produces significantly fewer number of vias, and compares favourably with respect to wire length against the best known existing results.

关键词： Routing Wire Integrated circuit interconnections Costs Delay Pins Rivers Minimization Packaging Fabrication

来源：评论

学校读者我要写书评

暂无评论

Design of an optimal test pattern generator for built-in self testing of path delay faults

Design of an optimal test pattern generator for built-in sel...

引用

International Conference on VLSI Design

作者： D.K. Das I. Chaudhuri B.B. Bhattacharya Department of Computer Science & Engineering. Jadavpur University Calcutta India Mentor Graphics Corporation Hyderabad India Advanced Computing & Microelectronics Unit Indian Statistical Institute Calcutta India

A novel design of a test pattern generator (TPG) for built-in self-testing (BIST) of path delay faults, is proposed. For an n-input CUT, the TPG generates a sequence of length (n.2/sup n/+1), that includes all n.2/sup n/ single-input-change (SIC) test pairs, and hence optimal. The generation of such a sequence of minimum length (i.e., n.2/sup n/+1) was an open problem. A simple iterative circuit of the TPG is then constructed. This provides minimum test application time for testing path delay faults, and compares favorably with the earlier BIST designs.

关键词： Test pattern generators Automatic testing Delay Circuit testing Silicon carbide Circuit faults Built-in self-test Electrical fault detection Fault detection Robustness

来源：评论

学校读者我要写书评

暂无评论

Routing of L-shaped channels, switchboxes and staircases in Manhattan-diagonal model

Routing of L-shaped channels, switchboxes and staircases in ...

引用

International Conference on VLSI Design

作者： S. Das S. Sur-Kolay B.B. Bhattacharya Department of Computer Science North Bengal University West Bengal India Department of Computer Science & Engineering Jadavpur University Calcutta India Adavanced Computing & Microelectronics Unit Indian Statistical Institute Calcutta India

New techniques are presented for routing L-shaped channels, switchboxes and staircases in 2-layer Manhattan-diagonal (MD) model with tracks in horizontal, vertical and /spl plusmn/45/spl deg/ directions. First, a simple O(l.d) time algorithm is proposed which routes any L-shaped channel with length l, density d and no cyclic vertical constraints, in w (d/spl les/w/spl les/d+1) tracks. Next, an O(l.w) time greedy method for routing an L-shaped channel with cyclic vertical constraints, is described. Then, the switchbox routing problem in the MD model is solved elegantly. These techniques, easily extendible to the routing of staircase channels, yield efficient solutions to detailed routing in general floorplans. Experimental results show significantly low via-count and reduced wire length, thus establishing the superiority of MD-routing over classical strategies.

关键词： Routing Wire Topology Geometry Solid modeling Semiconductor device modeling Computer science microelectronics Crosstalk Binary trees

来源：评论

学校读者我要写书评

暂无评论

Perception and Machine Intelligence 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Malay K. Kundu Sushmita Mitra Debasis Mazumdar Sankar K. Pal

ISBN: (数字)9783642273872

ISBN: (纸本)9783642273865

This book constitutes the proceedings of the First Indo-Japanese conference on Perception and Machine Intelligence, PerMIn 2012, held in Kolkata, India, in January 2012. The 41 papers, presented together with 1 keynote paper and 3 plenary papers, were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections named perception; human-computer interaction; e-nose and e-tongue; machine intelligence and application; image and video processing; and speech and signal processing.

关键词： Computer Science, general

来源：评论

学校读者我要写书评

暂无评论

Fundamentals of IP and SoC Security 1