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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

169 篇 会议
83 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

145 篇 工学
- 99 篇 计算机科学与技术...
- 54 篇 软件工程
- 38 篇 电子科学与技术（可...
- 36 篇 信息与通信工程
- 18 篇 光学工程
- 16 篇 控制科学与工程
- 13 篇 电气工程
- 10 篇 生物工程
- 9 篇 动力工程及工程热...
- 9 篇 化学工程与技术
- 8 篇 生物医学工程（可授...
- 7 篇 机械工程
- 7 篇 交通运输工程
- 5 篇 力学（可授工学、理...
- 5 篇 材料科学与工程（可...
- 5 篇 安全科学与工程
- 4 篇 仪器科学与技术
- 3 篇 农业工程
91 篇 理学
- 62 篇 数学
- 28 篇 物理学
- 11 篇 生物学
- 10 篇 统计学（可授理学、...
- 9 篇 化学
- 4 篇 系统科学
18 篇 管理学
- 17 篇 管理科学与工程(可...
- 5 篇 工商管理
5 篇 法学
- 5 篇 社会学
3 篇 农学
- 3 篇 作物学
3 篇 医学
- 3 篇 基础医学(可授医学...
2 篇 经济学

主题

14 篇 routing
10 篇 microelectronics
10 篇 throughput
10 篇 wireless sensor ...
8 篇 interference
8 篇 computational mo...
7 篇 computer science
7 篇 base stations
7 篇 error correction
6 篇 delays
6 篇 logic gates
6 篇 field programmab...
6 篇 measurement
6 篇 computer network...
5 篇 network topology
5 篇 resource managem...
5 篇 very large scale...
5 篇 switches
5 篇 algorithm design...
5 篇 topology

机构

98 篇 advanced computi...
42 篇 advanced computi...
23 篇 advanced computi...
17 篇 advanced computi...
9 篇 advanced computi...
8 篇 a. k. choudhury ...
6 篇 advanced computi...
5 篇 ibm quantum ibm ...
5 篇 indian statistic...
4 篇 indian statistic...
4 篇 the advanced com...
4 篇 department of co...
4 篇 advanced computi...
4 篇 advanced computi...
4 篇 atos pune
4 篇 department of ma...
3 篇 department of el...
3 篇 department of co...
2 篇 department of co...
2 篇 department of co...

作者

34 篇 ghosh sasthi c.
26 篇 majumdar ritajit
25 篇 sasthi c. ghosh
24 篇 sur-kolay susmit...
18 篇 susmita sur-kola...
17 篇 das sandip
15 篇 bhattacharya bha...
15 篇 bhargab b. bhatt...
14 篇 nabanita das
13 篇 ansuman banerjee
11 篇 bhoumik debasmit...
11 篇 mukhopadhyaya kr...
7 篇 ritajit majumdar
7 篇 das nabanita
7 篇 nandy subhas c.
7 篇 chakrabarti amla...
6 篇 mukherjee priyad...
6 篇 bose kaustav
6 篇 koley subhasis
6 篇 banik aritra

语言

235 篇 英文
17 篇 其他
4 篇 中文

检索条件"机构=Advanced Computing and Microelectronics unit"

共 252 条记录，以下是211-220 订阅

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

详细简洁

排序：

Synthesis Techniques for Ternary Quantum Logic

Synthesis Techniques for Ternary Quantum Logic

引用

International Symposium on Multiple-Valued Logic

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

Synthesis of ternary quantum circuits involves basic ternary gates and logic operations in the ternary quantum domain. Works that define ternary algebra and their applications for ternary quantum logic realization, are very few. In this paper, we express a ternary logic function in terms of projection operations including a new one. We demonstrate how to realize a few new multi-qutrit ternary gates in terms of generalized ternary gates and projection operations. We then employ our synthesis method to design ternary adder circuits which have better cost than that obtained by earlier method.

关键词： Logic gates Quantum computing Adders Multivalued logic Quantum mechanics Algebra Cryptography

来源：评论

学校读者我要写书评

暂无评论

A Unified Approach for IP Protection across Design Phases in a Packaged Chip

A Unified Approach for IP Protection across Design Phases in...

引用

International Conference on VLSI Design

作者： Debasri Saha Susmita Sur-Kolay Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781424455416

IP values contributed by the distinct design tools in specific design phases, are recognized by observing the signature of the owner of each tool as functional or scan mode output of the fabricated chip, for certain input vector secret to the owner. An existing approach inserts watermark through reordering of single scan chain, and solely identifies the owner of the logic design tool. Here we propose a novel scheme to watermark the recent reconfigurable scan architectures, operating in both scan tree and single scan mode. The signature of the owner of physical design tool along with that of logic design tool can separately be embedded while designing the scan tree and also verified from the packaged chip without conflict using two distinct modes. A bi-objective minimization of overhead in routing and power is supported through our scheme. Experimental results on design overhead and robustness for ISCAS'89 benchmarks are encouraging.

关键词： Protection Packaging Watermarking Logic design Very large scale integration Intellectual property Observability Circuits Hardware Design optimization

来源：评论

学校读者我要写书评

暂无评论

A distributed multiple-slot assignment algorithm for wireless sensor networks

A distributed multiple-slot assignment algorithm for wireles...

引用

International Conference on Computers and Devices for Communication (CODEC)

作者： Arnab Sinha Nabanita Das Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

In this paper, a distributed scheduling algorithm is proposed for multiple slot assignment in wireless sensor networks for TDMA scheduling that attempts to minimize the frame length, ensuring at least one conflict-free slot for each node. Simulation studies have been done to compare the performance of the proposed algorithm with earlier ones that shows improvement in terms of frame length and message overhead indicating that the proposed algorithm will perform better for dense network.

关键词： Wireless sensor networks Time division multiple access Scheduling algorithm Access protocols Processor scheduling Broadcasting microelectronics Distributed algorithms Network topology Computer networks

来源：评论

学校读者我要写书评

暂无评论

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

Length-based anchor-free localization in a fully covered sen...

引用

International Communication Systems and Networks and Workshops, COMSNETS

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

Localization is an important issue for Wireless Sensor Networks (WSN). We consider a WSN consisting of identical sensors. All known distances between the sensors are assumed to be less than the communication range of the sensors and all unknown distances greater. We also assume that the communication range is at least twice as much as the sensing range. Every point in the field of interest is assumed to be within the sensing zone of some sensor. Under this model, we propose an anchor-free length-based localization algorithm. The worst case time complexity of the algorithm is O(|E|) (where E is the set of edges of the network graph). We carry out simulation studies to observe that under uniform distribution, the number of edges is actually much lower than n 2 , if just about enough sensors are deployed to cover the total field. We prove that, under this model, the solution to the localization problem is unique. We also provide a simple technique for verifying the assumption that all points in the field are covered.

关键词： Wireless sensor networks Hardware Global Positioning System Computer networks microelectronics Mathematics User-generated content Government Routing Information security

来源：评论

学校读者我要写书评

暂无评论

Algorithms for biological cell sorting with a Lab-on-a-chip

Algorithms for biological cell sorting with a Lab-on-a-chip

引用

World Congress on Nature & Biologically Inspired computing (NaBIC)

作者： Arijit Ghosh Rushin Shah Arijit Bishnu Bhargab B. Bhattacharya Computer Science and Engineering Department Indian Institute of Technology Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

Automatic cell sorting and isolation for recovery of such live cells, mostly microorganisms, is a challenging task. Lab-on-a-chip devices implemented as cell arrays are used for this purpose. For an abstract model of the problem, we can assume the cell array to be represented by a matrix where each cell can be any of the three types: empty, good (or desired) and bad (or undesired). The problem is to separate the good and the bad cells by pushing them under electric field to their respective receptors at the corners of the cell array. We address some combinatorial optimization problems related to this biological phenomenon.

关键词： Biological cells Sorting Lab-on-a-chip Microorganisms Stem cells Cells (biology) Voltage Niobium Computer science Isolation technology

来源：评论

学校读者我要写书评

暂无评论

A cross-layer distributed TDMA scheduling for data gathering with minimum latency in wireless sensor networks

A cross-layer distributed TDMA scheduling for data gathering...

引用

International Conference on Wireless Communication, Vehicular Technology, Information Theory and Aerospace and Electronic Systems Technology (Wireless VITAE)

作者： Punyasha Chatterjee Nabanita Das Information Technology Department Government College of Engineering and Textile Technology Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

In a wireless sensor network, given a routing tree for data gathering from individual nodes to the sink node, this paper presents a simple, distributed algorithm for assigning time slot to each node for conflict-free communication, such that the maximum latency in data gathering at the sink is minimized. It requires just a one-time computation during the initialisation of the network provided the nodes remain static. Simulation studies have been done to evaluate the performance in terms of latency, and the average duty cycle.

关键词： Time division multiple access Delay Wireless sensor networks Access protocols Processor scheduling Computer networks Routing Interference Data communication Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Analytical Approach to Direct IP Protection of VLSI Floorplans

An Analytical Approach to Direct IP Protection of VLSI Floor...

引用

International Conference on Industrial and Information Systems, ICIIS

作者： Debasri Saha Susmita Sur-Kolay Advanced Computing & Microelectronics Unit Indian Statistical Institute Calcutta India

In the DSM VLSI technology, wide-spread design reuse to meet customer's requirements in time enhances the probability of infringement of intellectual property (IP) of VLSI physical design. In design storage or during design transmission between two parties, encryption of a design file is a well-known technique to protect a design against hacking, although it takes significantly long time to encrypt large design files. While encryption basically substitutes and shuffles the bits/ASCII values of a file to conceal the contents of the file, the IP value of a design obtained from optimized partitioning, floorplanning and placement can be protected by redistribution of design elements in the modules and exchanging the locations and orientations of the design modules. As security of design through perturbation exploits the basic properties of physical design, this technique is applicable to protect any intermediate phase, not restricted to binary/ASCII GDSII/OASIS file format only. In this paper, encoding moves for various floorplan representations are analyzed in terms of their time and space requirements. Experimental results on MCNC benchmarks are encouraging.

关键词： Protection Very large scale integration Cryptography Intellectual property Design optimization Encoding Space technology Degradation Field programmable gate arrays Region 10

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

International Conference on Wireless Communication and Sensor Networks

作者： B. Sau K. Mukhopadhyaya Kolkata under Faculty Improvement Programme (FIP) University Grant Commission Government of India Jadavpur University India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781424433278

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.

关键词： Monitoring Wireless sensor networks Network topology Telecommunication traffic Hardware Computer networks Distributed computing microelectronics Mathematics User-generated content

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：