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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,265 篇 会议
65 篇 期刊文献
4 册 图书

馆藏范围

3,334 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,881 篇 工学
- 2,107 篇 计算机科学与技术...
- 1,162 篇 电气工程
- 913 篇 软件工程
- 894 篇 信息与通信工程
- 351 篇 控制科学与工程
- 201 篇 动力工程及工程热...
- 194 篇 仪器科学与技术
- 189 篇 机械工程
- 158 篇 石油与天然气工程
- 136 篇 电子科学与技术（可...
- 108 篇 材料科学与工程（可...
- 92 篇 测绘科学与技术
- 75 篇 生物医学工程（可授...
- 74 篇 生物工程
- 41 篇 安全科学与工程
- 39 篇 土木工程
- 38 篇 化学工程与技术
- 35 篇 交通运输工程
532 篇 理学
- 274 篇 数学
- 125 篇 物理学
- 86 篇 生物学
- 71 篇 系统科学
- 60 篇 统计学（可授理学、...
- 46 篇 化学
351 篇 管理学
- 261 篇 管理科学与工程(可...
- 123 篇 图书情报与档案管...
- 122 篇 工商管理
116 篇 医学
- 97 篇 临床医学
- 53 篇 基础医学(可授医学...
47 篇 经济学
- 47 篇 应用经济学
36 篇 法学
31 篇 农学
11 篇 军事学
6 篇 文学
5 篇 教育学
1 篇 艺术学

主题

364 篇 wireless sensor ...
94 篇 sensor networks
88 篇 distributed comp...
84 篇 sensor nodes
82 篇 sensors
79 篇 distributed comp...
69 篇 wireless sensor ...
67 篇 sensor systems
62 篇 distributed gene...
57 篇 internet of thin...
57 篇 distributed powe...
48 篇 energy efficienc...
46 篇 monitoring
45 篇 cloud computing
43 篇 robot sensing sy...
42 篇 wireless communi...
38 篇 routing
37 篇 protocols
34 篇 security
33 篇 routing protocol...

机构

7 篇 louisiana state ...
6 篇 washington univ ...
6 篇 northeastern uni...
5 篇 georgia state un...
5 篇 nanjing univ sta...
5 篇 carleton univ de...
5 篇 univ stuttgart i...
4 篇 univ lancaster s...
4 篇 hong kong polyte...
4 篇 dalian univ tech...
4 篇 fed inst sao pau...
4 篇 department of co...
4 篇 univ glasgow ben...
4 篇 school of electr...
4 篇 jiangsu high tec...
4 篇 western michigan...
4 篇 univ sao paulo s...
4 篇 nanjing univ pos...
4 篇 shanghai jiao to...
4 篇 city univ hong k...

作者

9 篇 lu chenyang
8 篇 wang wei
8 篇 barolli leonard
7 篇 de grande robson...
6 篇 wang lei
6 篇 dahiya ravinder
6 篇 stankovic john a...
6 篇 dustdar schahram
5 篇 bar-noy amotz
5 篇 aghajan hamid
5 篇 bhattacharjee mi...
5 篇 xhafa fatos
5 篇 dai haipeng
5 篇 kermarrec anne-m...
5 篇 song wen-zhan
5 篇 takizawa makoto
5 篇 chamberlain roge...
5 篇 das sajal k.
5 篇 rothermel kurt
5 篇 durresi arjan

语言

3,123 篇 英文
149 篇 其他
62 篇 中文

检索条件"任意字段=1st IEEE International Conference on Distributed Computing in Sensor Systems"

共 3334 条记录，以下是2801-2810 订阅

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

详细简洁

排序：

Electrostatically actuated nano tweezers fabricated on micro processed electrodes

Electrostatically actuated nano tweezers fabricated on micro...

引用

ieee international conference of Nano/Micro Engineered and Molecular systems

作者： Chang, Jiyoung Kim, Jongbaeg Min, Byung-Kwon Lee, Sang-Jo Lin, Liwei Yonsei Univ Sch Mech Engn Seoul 120749 South Korea Univ Calif Berkeley Berkeley Sensor & Actuator Ctr Berkeley CA USA

ISBN: (纸本)9781424401390

Nanoscale tweezers are integrated to Deep Reactive Ion Etching (DRIE)-processed microelectrodes by localized chemical vapor deposition using focused ion beam (FIB-CVD). The MEMS electrodes for electrostatic actuation of nano tweezers are fabricated on a heavily doped SOI wafer, which works as the interconnecting platform to control nanoscale device from macro-world Unlike the Carbon Nano Tube (CNT)-based nano tweezers, the dimension and gap between the pillars are well-controlled such that the designed range of motion and the operation voltage are easily achieved Compared to repulsive nano tweezers, the actuation voltage is at least an order lower for the similar range of motion. Repeated electrostatic tweezing action for two sets of tweezers shapes has been successfully demonstrated For bent type tweezers, short pillar is deposited on the edge of electrode to adjust the initial gap of tweezers which measures 17 mu m in length and 300nm in diameter. The threshold voltages that causes snap-down are dependent on the initial gap size of the unactuated pillars, and the measured value are 93 V for 3.5 mu m and 30 V for 2.2 mu m gaps. The Dimension of straight type tweezers is 19.6 mu m in length and 300nm in diameter with 6.9 mu m initial gap distance. Tweezing range is 3.4 mu m and snap down voltage is 102V. Young's modulus of the FIB-CVD carbon tweezers is estimated to be 377GPa based on the experimental results. Tweezers with complicated 3-dimensional shapes are also presented.

关键词： component nanotweezer nano manipulation electrostatic force Young's modulus

来源：评论

学校读者我要写书评

暂无评论

Minimum multicast time problem in wireless sensor networks

Minimum multicast time problem in wireless sensor networks

引用

1st international conference on Wireless Algorithms, systems and Applications

作者： Zhu, Jianming Chen, Xujin Hu, Xiaodong Chinese Acad Sci Inst Appl Math Beijing 100080 Peoples R China

ISBN: (纸本)3540371893

Given an undirected graph representing a network of processors, and a source node needs to broadcast a message to all other nodes in the graph, the minimum broadcast time problem is to find a scheme that accomplishes the broadcast in a minimum number of time steps under the constraint that at each time round, any node can send the message to at most one of its neighbors in the network. This NP-complete problem has been extensively studied in literature. In this paper, we consider a generation of the minimum broadcast problem, the minimum multicast time problem, in unit disk graphs which model wireless sensor networks. The goal is to multicast a message from the source node to a set of specified sensor nodes of the network in a minimum number of time rounds. We prove that this problem is NP-complete, and give an O(1)-approximation algorithm for it. Our simulation results show that the practical performance of the proposed algorithm is much better than the theoretically proved approximation ratio.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

A distributed code assignment algorithm with high code reusability for CDMA-based ad hoc networks

A distributed code assignment algorithm with high code reusa...

引用

1st international conference on Wireless Algorithms, systems and Applications

作者： Yu, Chang Wu Wu, Tung-Kuang Cheng, Rei-Heng Wu, Chia Hu Chung Hua Univ Dept Comp Sci & Informat Engn Hsinchu Taiwan Chung Hua Univ Dept Informat Management Hsinchu Taiwan Hsuan Chang Univ Dept Informat Management Hsinchu Taiwan

ISBN: (纸本)3540371893

We propose a dynamic and distributed CDMA code assignment protocol for ad hoc networks. By combining the RTS/CTS dialogue, modified busy tone signaling and power control mechanisms withour specially designed CDMA code selection rules, our protocol can not only save precious battery energy of mobile nodes, but also increase CDAM code reusability., Our simulation indicates that the proposed protocol performs better than the static code assignment method and the on-demand code assignment method (with/without using power control). in terms of successful transmission rate, code reusability and number of successful code assignment.

关键词： CDMA TCode assignment MAC ad hoc NetworkT

来源：评论

学校读者我要写书评

暂无评论

PWO: PEER-TO-PEER WORM EVOLUTION OBSERVER

PWO: PEER-TO-PEER WORM EVOLUTION OBSERVER

引用

1st international conference on Communications and Networking in China

作者： Li, Qiang Feng, Qinyuan Zhang, Meng Hu, Liang JiLin Univ Dept Comp Sci Changchun Peoples R China

ISBN: (纸本)1424404630

Peer-to-Peer based applications are coming, such as instant messaging, file sharing and video streaming. With the maturation of P2P technology there is larger and larger number of users. But P2P network's characteristics make itself to be a potential vehicle for the active worms to achieve fast worm propagation. So it is important to study worm's spreading model and relative countermeasure under P2P systems. P2P worm's new characteristics are analyzed and a simple model is proposed in this paper. A novel method P2P worm evolution observer (PWO) is also described, this method introduces some observers in the P2P network to monitor some nodes' infected time during the worm's spreading period, and traces the worm's infected origin and attacking paths under the global P2P network topology. Theory and simulation results show that this method can gain nearly 100% probability to trace the worm evolution, even only less than 1% nodes are deployed with observers.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A density control algorithm for surveillance sensor networks

A density control algorithm for surveillance sensor networks

引用

1st international conference on Wireless Algorithms, systems and Applications

作者： Shen, Yang Yin, Xianglan Chen, Hua Qi, Wangdong Dai, Hao PLA Univ Sci & Tech Inst Command Automat Nanjing 210007 Peoples R China Chinese Elect Equipment & Syst Engn Corp Beijing 100039 Peoples R China

ISBN: (纸本)3540371893

Density control is a key technique in dense sensor networks for prolonging network's lifetime while providing sufficient sensing coverage. In this paper we present a new density control algorithm called ESSC(Enhanced Sponsored Sector Coverage) based on the SSC(Sponsored Sector Coverage) proposed by Tian Di. ESSC algorithm takes note of the deficiency of the SSC algorithm and modifies the model of SSC to minimize the active node number. Analysis and experimental results show that ESSC can use up to 15%similar to 25% fewer active nodes than SSC while promising the performance of the network surveillance.

关键词： SSC ESSC Sponsored Sector Coverage

来源：评论

学校读者我要写书评

暂无评论

Oriented Edge Colorings and Link Scheduling in sensor Networks

Oriented Edge Colorings and Link Scheduling in Sensor Networ...

引用

international conference on Communication systems Software and Middleware (COMSWARE)

作者： T. Herman S. Pemmaraju I. Pirwani Department of Computer Science University of Iowa Iowa IA USA

This paper shows that TDMA slot assignment for unicast communication in a wireless network can be distributively computed for an n-node acyclic network in O(polylog(n)) time, with high probability. The best previous distributed algorithm for this problem requires O(n) time and obtains a TDMA schedule using 2Delta time slots. The new algorithm uses (1+epsiv)middot2Delta time slots where epsiv is a tunable fraction

关键词： Intelligent networks Unicast Processor scheduling Time division multiple access Computer networks Radio broadcasting Access protocols distributed computing Wireless sensor networks distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Particle-based methodology for representing mobile ad-hoc networks 06

Particle-based methodology for representing mobile ad-hoc ne...

引用

1st international conference on Integrated Internet Ad hoc and sensor Networks

作者： Martinez, Carlos J. López, Marisa Estebanez, Luis C. IEEE Hispatel Ing. SRL c/ La Glorieta 52 Churra 30110 Murcia Spain Dpto. Ingeniería Electrónica ETSI Telecomunicación Ciudad Universitaria S/n 28040 Madrid Spain

ISBN: (纸本)1595934278

We present a methodology based on physics laws and particles in order to represent, simulate, and architect advanced networking models. We introduce a mathematical formalism with its basic postulates seeing the messages signals and nodes as interacting/colliding particles and space-temporal zones, respectively. In particular we focus on using this "Particle" view for Ad-Hoc networks, where we can represent network nodes as the moving particles in physics. This idea can be used in several types of networks like sensor or mobile, and even to computational systems, this first presentation aims to continue with further work on robustness, tools, and examples on how this view can be used in specification of complex networks in conjunction with existing methodologies and tools. © 2006 ACM.

关键词： Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

A convex-hull based algorithm to connect the maximal independent set in unit-disk graphs

A convex-hull based algorithm to connect the maximal indepen...

引用

1st international conference on Wireless Algorithms, systems and Applications

作者： Chen, Dechang Mao, Xilong Fei, Xia Xing, Kai Liu, Fang Song, Min Uniformed Serv Univ Hlth Sci Bethesda MD 20814 USA Natl Univ Def Technol Sch Comp Changsha 410073 Hunan Peoples R China Inst Urban & Rural Construct Rizhao Geotech Invest & Surveying Shandong 276826 Peoples R China George Washington Univ Dept Comp Sci Washington DC 20052 USA Old Dominion Univ Dept Elect & Comp Engn Norfolk VA 23529 USA

ISBN: (纸本)3540371893

In this paper we propose and analyze a localized convex-hull based algorithm to connect a maximal independent set. The cardinality of the resultant connected dominating set is at most 76 (.) opt + 19, where opt is the size of a minimum connected dominating set. To our knowledge, this is a dramatic improvement compared to the best published results in the same context [1,6]. Our algorithm plays an important rule in efficiently constructing a virtual backbone for ad hoc and sensor networks.

关键词： ad hoc and sensor networks maximal independent set connected dominating set

来源：评论

学校读者我要写书评

暂无评论

Towards a framework for agent-enabled semantic integration in the design of distributed Digital Museum

Towards a framework for agent-enabled semantic integration i...

引用

1st international conference on Semantics, Knowledge and Grid, SKG 2005

作者： Yu, Jie-Hua Liu, Hong-Zhe Bao, Hong Xu, De Institute of Information Technology Beijing Union University 100010 Beijing China Institute of Computer Sciences Beijing JiaoTong University 100044 Beijing China

ISBN: (纸本)0769525342

This paper presents a framework for agent-enabled semantic integration in the design of distributed digital museum. In this framework, Web Services provides remote information process services which can be discovered and invoked by middle-layer agent to satisfy multiple needs. Domain Ontology is used to characterize and model the semantics that are embedded in the digital museum. Concept-mapping Agent is deployed to set up the semantic relationships between Domain Ontology and relational databases and feedback to middle-layer agent, in doing so, we can get directly benefit from middle-layer agent. During the user request answer process, middle-layer agent can dynamically and quickly discovered the services, executed the remote calling of services, combined the results and finally feedback to user. Furthermore, the paper gave out a Digital Museum Information Retrieval System (DMIRS), which is designed, based on this framework and demonstrated to be stable and efficient. © 2006 ieee.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A distributed multi-point network interface for low-latency, deadlock-free on-chip interconnects

A distributed multi-point network interface for low-latency,...

引用

1st international conference on Nano-Networks and Workshops

作者： Park, Dongkook Nicopoulos, Chrysostomos Kim, Jongman Vijaykrishnan, N. Das, Chita R. Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA

ISBN: (纸本)9781424403905

The notion of a Network-on-Chip (NoC) is rapidly gaining a foothold as the communication fabric in complex System-on-Chip (SoC) architectures. Scalability is the NoC's most valuable asset, which makes it ideal for larger designs. However, increasingly diminishing feature sizes have rendered the interconnect as the primary bottleneck in terms of both latency and power consumption in on-chip systems. It is, therefore, imperative to optimize the network infrastructure to maximize performance. Research has primarily focused on architectural improvements within the router and the development of deadlock avoidance/recovery schemes. The latter tend to rely on fairly complex algorithms, which are sometimes infeasible to implement in NoCs due to their resource-constrained nature. In this paper, we propose a new NoC topology and architecture which injects data into the network using four sub-NICs (Network Interface Controllers), rather than one NIC, per node. It is shown that this scheme achieves significant improvements in network latency and energy consumption with only negligible area overhead and complexity over existing architectures. In fact, in the case of MESH network topologies, the proposed scheme provides substantial savings in area as well, because it requires fewer routers. Cycle-accurate simulation validates our assertions. Most importantly, it is also shown that this implementation is inherently deadlock-free, thus eliminating the need to rely on specialized, resource-hungry algorithms for deadlock avoidance.

关键词： network-on-chip router design deadlock topology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共334页 << < 277 278 279 280 281 282 283 284 285 286 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：