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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A new look ahead technique for customized testing in digital microfluidic biochips

A new look ahead technique for customized testing in digital...

引用

2012 IEEE 21st Asian Test Symposium, ATS 2012

作者： Roy, Pranab Rahaman, Hafizur Dasgupta, Parthasarthi Bhattacharya, Bhargab B.B. School of VLSI Technology Bengal Engineering and Science University Shibpur India Indian Institute of Management Calcutta India Advanced Computing and Microelectronics Unit Indian Statistical Institute Calcutta India

ISBN: (纸本)9780769548760

Digital Micro fluidic biochips have been developed as a promising platform for Lab-on-chip systems that manipulate individual droplet of chemicals on a 2D planar array of electrodes. Due to the significance of the correctness of the results - fault tolerance and dependability becomes a major issue for operation of these devices. Therefore, such devices are required to be tested frequently both off-line (e.g., post manufacturing) and concurrently ahead of each assay execution. Under both scenarios, testing is accomplished by routing one or more test droplets across the chip simultaneously and recording their arrival at the destination. In this paper we attempted to solve the problem of customized testing for a given Bioassay layout. We have applied a look ahead strategy for parallel testing using multiple droplets for any given test bench with an objective of minimization of test completion time and optimized utilization of test resources. The test simulations are carried out on test benches of Benchmark suite III and results obtained are found to be encouraging. © 2012 IEEE.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A generalized theory for formal assertion coverage

A generalized theory for formal assertion coverage

引用

2012 IEEE 21st Asian Test Symposium, ATS 2012

作者： Das, Sourasis Banerjee, Ansuman Dasgupta, Pallab Dept. of Comp. Sc. and Engg. IIT Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute India

ISBN: (纸本)9780769548760

Coverage of formal property specifications has important ramifications in design verification. Mutation coverage, a well studied approach towards specification coverage, checks whether the specification fails in the presence of a fault. Existing mutation coverage methods are broadly divided into those which inject the fault into a given implementation and those which inject the fault directly into the specification. This paper presents a theory which unifies these contrasting approaches and extends the mutation coverage approach to partial implementations where some components are given, and for the others, we only have component specifications. © 2012 IEEE.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Validation of a DiffServ based QoS model implementation for real-time traffic in a test bed

Validation of a DiffServ based QoS model implementation for ...

引用

18th National Conference on Communications, NCC 2012

作者： Gan Chaudhuri, Sruti Kumar, C.S. Rajakumar, Ratnam V. Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata - 700108 India Department of Mechanical Engineering Indian Institute of Technology Kharagpur - 721302 India Department of Electronics and Electrical Communication Engineering Indian Institute of Technology Kharagpur - 721302 India

ISBN: (纸本)9781467308168

This paper presents a DiffServ based adaptive QoS model for real-time interactive traffic in constrained bandwidth IP network without over provisioning the users. A WRR based QoS scheduling algorithm has been implemented to allocate the network resources to the users. A tuning parameter for VBR real-time traffic is also introduced in order to provide fair performance to the non real-time traffic as well. The QoS model is implemented at the transmitter edge of the network. Edge switches and routers are configured with the proposed algorithm. The simulation (using NS2) and experimental results (using a test bed with real time network scenario) are presented for validation of the proposed model. © 2012 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Circle formation by asynchronous fat robots with limited visibility

Circle formation by asynchronous fat robots with limited vis...

引用

8th International Conference on Distributed computing and Internet Technologies, ICDCIT 2012

作者： Dutta, Ayan Gan Chaudhuri, Sruti Datta, Suparno Mukhopadhyaya, Krishnendu Computer Science and Engineering Department Heritage Institute of Technology Kolkata 700107 India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B.T. Road Kolkata 700108 India

ISBN: (纸本)9783642280726

This paper proposes a distributed algorithm for circle formation by multiple autonomous mobile robots. The vision of each robot is limited to a maximum distance. The robots do not store past actions or records of past data. They are anonymous and cannot be distinguished by their appearances. All robots agree on a common origin and axes. Earlier works report algorithms for gathering of multiple autonomous mobile robots in limited visibility considering the robots to be dimensionless or points. This paper models a robot as a unit disc (fat robot). The algorithm presented in this paper also assures that there is no collision among the robots. The robots do not share a common clock. They execute the algorithm asynchronously. © 2012 Springer-Verlag.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

On finding shortest isothetic path inside a digital object

On finding shortest isothetic path inside a digital object

引用

15th International Workshop on Combinatorial Image Analysis, IWCIA 2012

作者： Dutt, Mousumi Biswas, Arindam Bhowmick, Partha Bhattacharya, Bhargab B. Department of Information Technology Bengal Engineering and Science University Shibpur Howrah India Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9783642347313

Shortest path algorithms are finding interesting applications in recent times in various emerging areas of image analysis and computer vision. Such algorithms are designed to solve shortest path problems with variegated need-based constraints. We present here an efficient combinatorial algorithm to find a/the shortest isothetic path (SIP) between two grid points in a digital object such that the SIP lies entirely inside the object. The algorithm first obtains the inner isothetic cover (simple and without holes) of the object and then applies certain combinatorial rules to construct the SIP and its constituent monotone sub-paths. For a given grid size, the entire algorithm runs in O(n logn) time, n being the number of grid points on the border of the cover. Experimental results show the effectiveness of the algorithm and its further prospects in shape analysis. © 2012 Springer-Verlag.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Formal Methods for Ranking Counterexamples Through Assumption Mining 12

Formal Methods for Ranking Counterexamples Through Assumptio...

引用

Design, Automation & Test in Europe Conference & Exhibition

作者： Srobona Mitra Ansuman Banerjee Pallab Dasgupta Indian Institute of Technology Kharagpur Kharagpur India Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9783981080186

Bug-fixing in deeply embedded portions of the logic is typically accompanied by the post-facto addition to new assertions which cover the bug scenario. Formally verifying properties defined over such deeply embedded portions of the logic is challenging because formal methods do not scale to the size of the entire logic, and verifying the property on the embedded logic in isolation typically throws up a large number of counterexamples, many of which are spurious because the scenarios they depict are not possible in the entire logic. In this paper we introduce the notion of ranking the counterexamples so that only the most likely counterexamples are presented to the designer. Our ranking is based on assume properties mined from simulation traces of the entire logic. We define a metric to compute a belief for each assume property that is mined, and rank counterexamples based on their conflicts with the mined assume properties. Experimental results demonstrate an amazing correlation between the real counterexamples (if they exist) and the proposed ranking metric, thereby establishing the proposed method as a very promising verification approach.

关键词： Formal logic Designers Conflict (Psychology) embedding Beliefs Entire mining Metric Metronidazole

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks

Approximation algorithms for deployment of sensors for line ...

引用

International Communication Systems and Networks and Workshops, COMSNETS

作者： Dinesh Dash Arijit Bishnu Arobinda Gupta Subhas C. Nandy Department of Computer Science & Engineering Indian Institute of Technology Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute India

The coverage problem in wireless sensor network deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments with minimum number of sensors. A line segment ℓ is said to be 1-covered if it intersects the sensing region of at least one among the sensors distributed in a bounded rectangular region R. We assume that the sensing radius of each sensor is uniform. The problem of finding the minimum number of sensors needed to 1-cover each member in a given set of line segments in R is NP-hard. We propose two constant factor approximation algorithms and a PTAS (Polynomial Time Approximation Scheme) for the problem for 1-covering a set of axis-parallel line segments. We also show that a PTAS exists for 1-covering a set of arbitrarily oriented line segments in R where the length of the line segments are bounded within a constant factor of the sensing radius of each sensor.

关键词： Sensors Approximation methods Strips Approximation algorithms Wireless sensor networks Roads Complexity theory

来源：评论

学校读者我要写书评

暂无评论

A Generalized Theory for Formal Assertion Coverage

A Generalized Theory for Formal Assertion Coverage

引用

Asian Test Symposium (ATS)

作者： Sourasis Das Ansuman Banerjee Pallab Dasgupta Department of Computer Science and Engineering IIT Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute India

关键词： Topology Cost accounting Standards Protocols Performance evaluation microelectronics Computer bugs

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共27页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：