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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A fast algorithm for point labeling problem 17

A fast algorithm for point labeling problem

引用

17th Canadian Conference on Computational Geometry, CCCG 2005

作者： Roy, Sasanka Bhattacharjee, Subhasis Das, Sandip Nandy, Subhas C. Advanced Computing and Microelectronics Unit Indian Sta-tistical Institute Kolkata700 108 India

In the map labeling problem, we are given a set P = fp1;p2;: : :;png of point sites distributed on a 2D map. The label of a point pi is an axis-parallel rectangle of specified size. The objective is to label maximum number of points on the map so that the placed labels are mutually non-overlapping. Here, we investigate a special class of map labeling problem where (i) the height of the label of each point is the same but its length may be diffierent from the others, (ii) the label of a point pi touches the point at one of its four corners and (iii) it does not obscure any other point in P. We describe an efficient heuristic algorithm for this problem which runs in O(npn) time in the worst case. We run our algorithm as well as the algorithm proposed in [14] on the available benchmarks [13]. The results produced by our algorithm is same as that of [14] in most of the cases, and is one less in few cases. But the time taken by our algorithm is much less than [14]. © 2005 Canadian Conference on Computational Geometry. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Analysis of the Delay in RIS Assisted SISO D2D Communication Using Chernoff’s Bounds 3rd

A Probabilistic Analysis of the Delay in RIS Assisted SIS...

引用

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

作者： Singh, Durgesh Ghosh, Sasthi C. School of Computer Science University of Petroleum and Energy Studies Dehradun248007 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata700108 India

ISBN: (纸本)9783031352980

Reflecting intelligent surface (RIS) assisted millimeter wave (mmWave) device to device (D2D) communication in single input single output (SISO) mode is considered. RIS can bypass the blocked D2D pairs since mmWaves are highly susceptible to blockages. However, the RIS is composed of passive elements which cannot accurately measure the state of the given channel and may suffer outages from moving obstacles (blockages) or due to moving devices (communication out of range) causing uncertainty in link quality. Each data packet will have some probability to be successfully transmitted towards the destination device via a RIS in each time unit. When a packet is lost it has to be re-transmitted which will induce extra delay. In this paper, the impact of link success probability on delay is studied. A lower bound on delay such that all packets are received successfully for the given link success probability has been derived. Later, we have derived a new term called apparent success probability which captures the trade-off between delay and link success probability. Simulations are performed which conforms with the derived theoretical results. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Reliability-aware test methodology for detecting short-channel faults in on-chip networks

Reliability-aware test methodology for detecting short-chann...

引用

作者： Bhowmik, Biswajit Biswas, Santosh Deka, Jatindra Kumar Bhattacharya, Bhargab B. Department of Computer Science and Engineering IIT Guwahati Guwahati781039 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata Kolkata700108 India

With the advent of rapidly evolving nanoelectronic systems, compact implementation of versatile and dense network-on-chips (NoCs) on a die has emerged as technology-of-choice for multicore computing. However, because of the increased density, NoCs often suffer from various types of manufacturing faults, which degrade the yield and jeopardize the reliability of the overall system. For example, short-channel faults in an NoC often cause system-level failures that may have significant impact on its performance. This paper proposes a cluster-based distributed scheme for online testing of short faults in NoC channels. The proposed algorithm detects both intra and interchannel short faults and identifies the underlying faulty channel-wires connected to a node. The nodes in a cluster-set are appropriately scheduled to reduce test time. The approach scales to larger NoCs irrespective of size of the network and channel width. The proposed scheme also extends its application from regular to irregular NoCs, and to other channel faults like open. Fault simulation shows that the proposed cluster-driven scheme is capable of detecting all modeled short-channel faults. Online evaluation of the scheme also reveals the extent of impact that the short faults impart on various performance metrics for large traffic. Compared to prior work, it reduces hardware area overhead up to 27% and test time by more than 21 × on several test cases. In addition, packet latency and energy consumption are reduced by 19.47%-40.16% and 17.57%-34.20%, respectively. © 1993-2012 IEEE.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Load Balanced Coverage with Graded Node Deployment in Wireless Sensor Networks

Load Balanced Coverage with Graded Node Deployment in Wirele...

引用

作者： Chatterjee, Punyasha Ghosh, Sasthi C. Das, Nabanita School of Mobile Computing and Communication Jadavpur University Kolkata West Bengal700032 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata West Bengal700108 India

In this paper, to gather streams of data in static wireless sensor networks, a novel graded node deployment strategy is proposed that generates minimum traffic, just sufficient for coverage. Based on this node distribution, a distributed, nearly load-balanced data gathering algorithm is developed to deliver packets to the sink node via minimum-hop paths that also in turn helps to limit the network traffic. An average case probabilistic analysis is done based on perfect matching of random bipartite graphs to establish a theoretical lower bound on the number of nodes to be deployed. Analysis and simulation studies show that the proposed model results huge enhancement in network lifetime that significantly overrides the cost due to over deployment. Hence, this technique offers an excellent cost-effective and energy-efficient solution for node deployment and routing in large wireless sensor networks to operate with prolonged lifetime. © 2015 IEEE.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

Extraction of regions of interest from face images using cellular analysis 08

Extraction of regions of interest from face images using cel...

引用

1st ACM Bangalore Annual Conference, COMPUTE 2008

作者： Biswas, Arindam Khara, Suman Bhowmick, Partha Bhattacharya, Bhargab B. Computer Science and Technology Dept. Bengal Engineering and Science University Shibpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781595939500

A novel algorithm for extracting the regions of interest (ROI) from face images is presented in this paper. The novelty of the algorithm comes from its multi-resolution cellular analysis coupled with an adaptive thresholding technique incorporating a unique idea of exponential averaging. The complexity of the cellular ROIs reported by the algorithm from the frontal face view as input, is further controllable by the chosen cell size, which is its added advantage. Apart from the actual ROIs representing the eye pair, nostrils, and the mouth area, some regions of non-interest may also creep in while extracting the set of cellular regions from the face image, which are discarded by a simple geometric analysis using a containment tree. The containment tree, which is newly introduced in this paper, captures the underlying relationship of the cellular regions, which, when analyzed, returns the face ROIs in an elegant representation. Since the entire algorithm works purely in the integer domain with primitive operations (comparison, right shift, and addition) only, it runs very fast for both gray-scale and color images. Some experimental results on different facial images demonstrate its speed, robustness, and efficiency.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Isothetic polygonal approximations of a 2D object on generalized grid

引用

1st International Conference on Pattern Recognition and Machine Intelligence, PReMI 2005

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

ISBN: (纸本)3540305068

Determination of an isothetic polygonal approximation of the outer or inner contour of an object is a challenging problem with numerous applications to pattern recognition and image processing. In this paper, a novel algorithm is presented for constructing the outer (or inner) tight isothetic polygon(s) containing (or filling) an arbitrarily shaped 2D object on a background grid, using a classical labeling technique, The background grid may consist of uniformly or non-uniformly spaced horizontal and vertical lines. Experimental results for both uniform and non-uniform grids of varying sizes have been reported to demonstrate the applicability and efficiency of the proposed algorithm. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

A Framework for Analyzing Resource Allocation Policies for Multi-Access Edge computing

A Framework for Analyzing Resource Allocation Policies for M...

引用

IEEE International Conference on Edge computing (EDGE)

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

ISBN: (纸本)9781665400633

Multi-Access Edge computing (MEC) is a promising new paradigm enabling low-latency access to services deployed on edge servers. This helps to avert network latencies often encountered in accessing cloud services. The cornerstone of a MEC environment is a resource allocation policy used to partition and allocate computational resources such as bandwidth, memory available on the edge server to user service invocations availing such services. In this work, we propose a generic data-driven framework to model and analyze such MEC resource allocation policies. We model a MEC system as a Turn-Based Stochastic Multi-Player Game and use Probabilistic Model Checking to derive quantitative guarantees on resource allocation policies against requirements expressed in Probabilistic Alternating-Time Temporal Logic with Rewards. We present results on state-of-the-art MEC resource allocation policies to demonstrate the effectiveness of our framework.

关键词： Analytical models Multi-access edge computing Computational modeling Stochastic processes Games Model checking Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Fault diagnosis for leakage and blockage defects in flow-based microfluidic biochips

Fault diagnosis for leakage and blockage defects in flow-bas...

引用

作者： Hu, Kai Bhattacharya, Bhargab B. Chakrabarty, Krishnendu Department of Electrical and Computer Engineering Duke University DurhamNC27708 United States Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata700108 India

Advances in flow-based microfluidics now allow an efficient implementation of biochemistry on-a-chip for DNA sequencing, drug discovery, and point-of-care disease diagnosis. However, the adoption of flow-based biochips is hampered by defects that frequently occur in chips fabricated using soft lithography techniques. Recently published work has shown how we can automate the testing of flow-based biochips;diagnosis methods are now needed to identify the flaws in the fabrication process and to facilitate the use of partially defective chips. Since disposable biochips are being targeted for a highly competitive and low-cost market segment, such diagnosis methods need to be inexpensive, quick, and effective. In this paper, we present the first approach for the automated diagnosis of leakage and blockage defects in flow-based microfluidic biochips. The proposed method targets the identification of fault types and their locations based on test outcomes. It reduces the number of possible fault sites significantly while identifying their exact locations. We use a graph representation of flow paths and a formulation based on hitting sets for the analysis of observed error syndromes. The diagnosis technique is evaluated on three fabricated biochips, and the localization of faults and their classification are achieved correctly in all cases. © 2015 IEEE.

关键词： Biochips

来源：评论

学校读者我要写书评

暂无评论

Special Session: Quantum Error Correction in Near Term Systems

Special Session: Quantum Error Correction in Near Term Syste...

引用

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： Ritajit Majumdar Susmita Sur-Kolay Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata

ISBN: (数字)9781728197104

ISBN: (纸本)9781728197111

Large-scale quantum computers mandate error correction and fault tolerance. Due to constraints on the number of qubits, fault tolerance is difficult to achieve in near-term quantum systems. Therefore, error correction should require minimal resources. Gates in the near-term devices are also noisy. Quantum error correction code blocks built with these noisy gates can inject further error in the circuit. The goals for error correction in near-term systems are as follows: (i) using a small number of qubits for encoding, and (ii) keeping cost of circuits for encoding and decoding low. In this paper, we propose two techniques to achieve these mutually orthogonal goals. For a binary quantum system we propose an error estimation method that can aid in reducing the number of error correcting blocks via sparse scheduling. For ternary quantum systems, we propose an approximate code that can correct errors with high probability while significantly reducing the circuit cost. These techniques are expected to be helpful for error mitigation in near-term systems in the absence of fault tolerance.

关键词： Fault tolerance Fault tolerant systems Qubit Logic gates Error correction Error correction codes Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Requirement Evolution Management: A Systematic Approach

Requirement Evolution Management: A Systematic Approach

引用

IEEE Computer Society Annual Symposium on VLSI

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

Evolution of requirements is a natural phenomenon in the development life cycle of both software and hardware systems. As requirements evolve, new features are added and existing features are modified or deleted. To conform to the requirement evolution, the current working version of the implementation also has to change in most cases, to support the changed needs. In this paper, we propose an automated approach for analyzing and debugging requirement evolutions. Given two requirements (a reference one and a new, modified one) and a design implementation that conforms to the earlier requirement, our approach uses symbolic specification comparison and unfolding to extract the unsupported requirement core. In addition, to aid the programmer, our method also synthesizes a set of scenarios that may aid the developer address the changed requirements.

关键词： Cost accounting Debugging Systematics Data structures Computer bugs Protocols Synthesizers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共27页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：