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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

5,067 篇 会议
41 篇 期刊文献
5 册 图书

馆藏范围

5,113 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,129 篇 工学
- 3,182 篇 计算机科学与技术...
- 1,609 篇 电气工程
- 1,553 篇 信息与通信工程
- 1,282 篇 软件工程
- 555 篇 控制科学与工程
- 344 篇 动力工程及工程热...
- 264 篇 仪器科学与技术
- 249 篇 电子科学与技术（可...
- 201 篇 机械工程
- 112 篇 测绘科学与技术
- 111 篇 安全科学与工程
- 106 篇 网络空间安全
- 103 篇 石油与天然气工程
- 93 篇 交通运输工程
- 77 篇 生物工程
- 76 篇 环境科学与工程（可...
- 76 篇 生物医学工程（可授...
- 71 篇 材料科学与工程（可...
- 65 篇 化学工程与技术
829 篇 理学
- 443 篇 数学
- 204 篇 物理学
- 124 篇 化学
- 123 篇 统计学（可授理学、...
- 102 篇 系统科学
- 98 篇 生物学
572 篇 管理学
- 440 篇 管理科学与工程(可...
- 199 篇 图书情报与档案管...
- 172 篇 工商管理
101 篇 医学
- 82 篇 临床医学
- 65 篇 基础医学(可授医学...
64 篇 经济学
52 篇 法学
40 篇 农学
25 篇 军事学
14 篇 教育学
6 篇 文学
3 篇 艺术学

主题

620 篇 wireless sensor ...
168 篇 sensor nodes
140 篇 sensor systems
137 篇 distributed comp...
122 篇 wireless sensor ...
95 篇 sensor networks
93 篇 distributed powe...
92 篇 internet of thin...
87 篇 energy efficienc...
85 篇 monitoring
81 篇 cloud computing
81 篇 distributed comp...
72 篇 computer network...
71 篇 sensors
68 篇 protocols
65 篇 routing
63 篇 security
59 篇 wireless communi...
59 篇 real-time system...
58 篇 computer archite...

机构

12 篇 maharishi school...
12 篇 jiangsu high tec...
12 篇 ieee
10 篇 college of elect...
9 篇 chitkara univers...
9 篇 chitkara univers...
8 篇 karnataka bangal...
8 篇 henan univ inst ...
8 篇 payame noor univ...
8 篇 wuhan univ sch c...
7 篇 beijing univ pos...
7 篇 tu wien distribu...
6 篇 dalian univ tech...
6 篇 college of techn...
6 篇 shanghai jiao to...
6 篇 centre for inter...
6 篇 univ pittsburgh ...
6 篇 indian sch mines...
6 篇 centre for cyber...
6 篇 chinese acad sci...

作者

14 篇 han zhijie
10 篇 dustdar schahram
10 篇 china
10 篇 zhang wei
9 篇 barolli leonard
8 篇 wang lei
8 篇 liu xue
7 篇 liu yang
6 篇 stankovic john a...
6 篇 xhafa fatos
6 篇 zakaria a.
6 篇 lin chi
6 篇 li wei
6 篇 abdelzaher tarek
6 篇 mukherjee nandin...
6 篇 li hui
5 篇 sarigiannidis pa...
5 篇 yang yang
5 篇 shakaff a.y.m.
5 篇 prasad ramjee

语言

4,747 篇 英文
359 篇 其他
9 篇 中文

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

共 5113 条记录，以下是4381-4390 订阅

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

详细简洁

排序：

Autonomic query parallelization using non-dedicated computers: An evaluation of adaptivity options

Autonomic query parallelization using non-dedicated computer...

引用

3rd international conference on Autonomic computing, ICAC 2006

作者： Paton, Norman W. Raman, Vijayshankar Swart, Garret Narang, Inderpal School of Computer Science University of Manchester Oxford Rd. Manchester M13 9PL United Kingdom IBM Almaden Research Centre 650 Harry Road San Jose CA 95120 United States

ISBN: (纸本)1424401755

Writing parallel programs that can take advantage of non-dedicated processors is much more difficult than writing such programs for networks of dedicated processors. In a non-dedicated environment such programs must use autonomic techniques to respond to the unpredictable load fluctuations that characterize the computational model. In the area of adaptive query processing (AQP), several techniques have been proposed for dynamically redistributing processor assignments throughout a computation to take account of varying resource capabilities, but we know of no previous study that compares their performance. This paper presents an simulation based evaluation of these autonomic parallelization techniques in a uniform environment and compares on how well they improve the scaleability of the computation. The existing strategies are compared with a new approach inspired by work on distributed hash tables. The evaluation identifies situations in which each strategy may be used effectively and it should be avoided. © 2006 ieee.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

The performance of periodic link-state update in wavelength-routed networks

The performance of periodic link-state update in wavelength-...

引用

3rd international conference on Broadband Communications Networks and systems

作者： Shen, Shu Xiao, Gaoxi Cheng, Tee Hiang 42Networks AB Shanghai R&D Ctr 11051 Baoqin Rd Shanghai 200031 Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore

ISBN: (纸本)9781424404247

distributed lightpath establishment in wavelength-routed networks requires up-to-date link-state information to achieve blocking performance target. Invalid routing and wavelength assignment decisions caused by inaccurate link-state information may degrade network performance significantly as the lightpaths become more and more dynamic. In this paper, we evaluate the performance of periodic link-state update, where link-state information is exchanged between network nodes at regular intervals. By proposing an accurate analytical model as well as by carrying out extensive simulations, we show how different components of network blocking probability are affected by inaccurate information under different traffic loads, and provide insights into the high sensitivity of blocking performance to link-state update interval under light traffic loads. We demonstrate how the sensitivity could be affected by network connectivity as well.

关键词： Blocking probability

来源：评论

学校读者我要写书评

暂无评论

ACO based QoS routing algorithm for wireless sensor networks

引用

3rd international conference on Ubiquitous Intelligence and computing

作者： Cai, Wenyu Jin, Xinyu Zhang, Yu Chen, Kangsheng Wang, Rui Zhejiang Univ Dept Informat Sci & Elect Engn Coll Informat Sci & Engn Hangzhou 310027 Peoples R China

ISBN: (纸本)3540380914

In this paper, we proposed an approach for Quality of Service (QoS) routing algorithm of Wireless sensor Networks (WSNs) based on Ant Colony Optimization (ACO). The special characteristics of WSNs need to reduce the computational complexity and energy consumption of the QoS routing algorithm especially. We note that ACO algorithm using collective intelligence of artificial ants as intelligent agents is very appropriate to solve the combinatorial optimization problems in a fully distributed way, so in this paper we use modified ACO approach to solve Delay Constraint Maximum Energy Residual Ratio (DCMERR) QoS routing problem of WSNs. The QoS routing solution proposed in this manuscript, which is named as ACO based QoS routing algorithm (ACO-QoSR), searches for the best paths, which are satisfied with the QoS requirements with intelligent artificial ants. To overcome the problem of limited energy in WSNs, there are some modifications to enhance ACO's convergence rate. ACO-QoSR algorithm is the tradeoff between a certain guaranteed QoS requirements and acceptable computational complexity. The simulation results verify that ACO-QoSR algorithm can reduce the selected paths' delay and improve the selected paths' normalized energy residual ratio at the similar levels of routing overhead.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Throughput and delay analysis considering packet arrival in ieee 802.11 1

引用

3rd international conference on distributed computing and Internet Technology

作者： Woo, Sinam Park, Woojin Jung, Younghwan An, Sunshin Kim, Dongho Korea Univ Dept Elect & Comp Engn Seoul 136701 South Korea Halla Univ Dept Comp Engn Wonju South Korea

ISBN: (数字)9783540683803

ISBN: (纸本)9783540683797

In recent years, Wireless Local Area Networks (WLANs) have become extremely popular. ieee 802.11 protocol is the dominating standards for WLANs employing the distributed Coordination Function (DCF) as its Medium Access Control (MAC) mechanism. In the literature, several papers have stuided performance of ieee 802.11 protocol and assume that a station always have a packet available for transmission. This paper(1) presents a Markov chain model to compute ieee 802.11 DCF performance taking into account the packet arrival rates. Throughput and packet delay analysis are carried out in order to study the performance of ieee 802.11 DCF under various traffic conditions. We present the analytical results of throughput and packet delay through network size and arrival rates. Results indicate that throughput and packet delay depends on the number of stations and packet arrival rates.

关键词： throughput delay wireless WLAN

来源：评论

学校读者我要写书评

暂无评论

Stochastically consistent caching and dynamic duty cycling for erratic sensor sources

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Zhu, Shanzhong Wang, Wei Ravishankar, Chinya V. Univ Calif Riverside Dept Comp Sci & Engn Riverside CA 92521 USA

ISBN: (纸本)3540352279

We present, a novel dynamic duty cycling scheme to maintain stochastic consistency for caches in sensor networks. To reduce transmissions, base stations often maintain caches for erratically changing sensor sources. Stochastic consistency guarantees the cache-source deviation is within a pre-specified bound with a certain confidence level. We model the erratic sources as Brownian motions, and adaptively predict the next cache update time based on the model. By piggybacking the next update time in each regular data packet, we can dynamically adjust the relaying nodes' duty cycles so that they are awake before the next update message arrives, and are sleeping otherwise. Through simulations, we show that our approach can achieve very high source-cache fidelity with low power consumption on many real-life sensor data. On average, our approach consumes 4-5 times less power than GAF [1], and achieves 50% longer network lifetime. © Springer-Vurlag Berlin Heidelberg 2006.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

Localized coverage boundary detection for wireless sensor networks 06

Localized coverage boundary detection for wireless sensor ne...

引用

3rd international conference on Quality of Service in Heterogeneous Wired/Wireless Networks

作者： Zhang, Chi Zhang, Yanchao Fang, Yuguang Department of Electrical and Computer Engineering University of Florida Gainesville FL 32611

ISBN: (纸本)1595935371

Connected coverage, which reflects how well a target field is monitored under the base station, is the most important performance metrics used to measure the quality of surveillance that wireless sensor networks (WSNs) can provide. To facilitate the measurement of this metrics, we propose two novel algorithms for individual sensor nodes to identify whether they are on the coverage boundary, i.e., the boundary of a coverage hole or network partition. Our algorithms are based on two novel computational geometric techniques called localized Voronoi and neighbor embracing polygons. As compared to previous work, our algorithms can be applied to WSNs of arbitrary topologies. They are also truly distributed and localized by merely needing the minimal position information of one-hop neighbors and a limited number of simple local computations, and thus are of high scalability and energy efficiency. We show the correctness and efficiency of our algorithms by theoretical proofs and extensive simulations. © 2006 ACM.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Proposal of visualization of reasoning processes in sensor network environment

引用

3rd international conference on Ubiquitous Intelligence and computing

作者： Matsushita, Naoki Yoshino, Takashi Hattori, Takashi Hiramatsu, Kaoru Okadome, Takeshi Wakayama Univ Grad Sch Syst Engn Wakayama Japan Wakayama Univ Fac Syst Engn Wakayama Japan Nippon Teleg & Telephone Corp NTT Commun Sci Labs Ibaraki Japan

ISBN: (纸本)3540380914

The sensor network environment will become the standard daily environment in the next generation. The technology of the sensor network can combine with computing and daily space. Combinations of computing and sensor networks happen only inside a computer. In other words, a user cannot understand what happens inside the computer. In particular, our system carries out reasoning. There is no research on the visualization of reasoning processes. The visualization of reasoning processes is a complex process. Therefore, we need to develop visualization of reasoning processes. The main technologies to visualize reasoning are to resolve motion and to use 3D space expression. This paper proposes a method of visualization of reasoning processes in a sensor network environment.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

DTuples: A distributed hash table based tuple space service for distributed coordination

DTuples: A distributed hash table based tuple space service ...

引用

5th international conference on Grid and Cooperative computing (GCC 2006)

作者： Jiang, Yi Xue, Guangtao Jia, Zhaoqing You, Jinyuan Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China

ISBN: (纸本)9780769526942

In this paper, we introduce a Linda [3] like peer-to-peer tuple space middleware build on top of distributed hash table - DTuples. With the help of DTuples, the development of the distributed cooperation and coordination task would be simplified. The decoupled style of tuple space [2] model is useful in peer-to-peer environment. In the application level, the Maples was used instead of the publish/subscribe model and message-passing model. In low level, the Maples service can be used as cooperation middleware and context-aware middleware. The tuples in the Maples are stored in distributed hash table based peer-to-peer tuple storage. In our current work, the in(), rd(), out() and copy-collect() primitives are supported. The eval() primitive will be added to D-Tuples in the future. In this paper, we present the key design concepts of DTuples.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A distributed linear least squares method for precise localization with low complexity in wireless sensor networks

引用

2nd ieee international conference on distributed computing in sensor systems

作者： Reichenbach, Frank Born, Alexander Timmermann, Dirk Bill, Ralf Univ Rostock Inst Appl Microelect & Comp Engn D-2500 Rostock 1 Germany Univ Rostock Inst Geodesy & Geoinformat D-2500 Rostock Germany

ISBN: (纸本)3540352279

Localizing sensor nodes is essential due to their random distribution after deployment. To reach a long network lifetime, which strongly depends on the limited energy resources of every node, applied algorithms must be developed with an awareness of computation and communication cost. In this paper we present a new localization method, which places a minimum computational requirement on the nodes but achieves very low localization errors of less than 1%. To achieve this, we split the complex least squares method into a less central precalculation and a simple, distributed subcalculation. This allows precalculating the complex part on high-performance nodes, e.g. base stations. Next, sensor nodes estimate their own positions by simple subcalculation, which does not exhaust the limited resources. We analyzed our method with three commonly used numerical techniques - normal equations, qr-factorization, and singular-value decomposition. Simulation results showed that we reduced the complexity on every node by more than 47% for normal equations. In addition, the proposed algorithm is robust with respect to high input errors and has low communication and memory requirements. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

An energy efficient and accurate slot synchronization scheme for wireless sensor networks

An energy efficient and accurate slot synchronization scheme...

引用

3rd international conference on Broadband Communications Networks and systems

作者： Dai, Lillian Basu, Prithwish Redi, Jason BBN Technol 10 Moulton St Cambridge MA 02138 USA

ISBN: (纸本)9781424404247

Existing slotted channel access schemes in wireless networks assume that slot boundaries at all nodes are synchronized. In practice, relative clock drifts among nodes cause slot misalignment over time and can result in catastrophic data loss in such systems. We propose a simple network-wide slot synchronization scheme (Slot-Sync and Slot-Resync) suitable for duty-cycling wireless sensor networks. The proposed scheme attains high accuracy by circumventing dominant sources of error inherent in traditional time synchronization protocols. At moderate duty-cycle frequencies, the proposed scheme also has the unique advantage of eliminating re-synchronization (re-sync) overhead completely, thereby achieving slot re-sync essentially for free. We provide an energy efficient slot guard time and resync interval design for the proposed scheme and analyze several spanning tree structures for slot-alignment message propagation. In addition, we derive upper bounds on the synchronization (sync) error for a family of trees. Through simulations, we compare the spanning trees we propose to those used for time sync in literature and show up to 80% reduction in sync error and up to 70% reduction in energy needed for slot-alignment message propagation by choosing appropriate tree structures.

关键词： Clock drift Guard time Slot synchronization Spanning tree Synchronization error Wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 435 436 437 438 439 440 441 442 443 444 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：