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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,147 篇 会议
12 篇 期刊文献
2 册 图书

馆藏范围

1,161 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

829 篇 工学
- 728 篇 计算机科学与技术...
- 381 篇 电气工程
- 245 篇 信息与通信工程
- 200 篇 测绘科学与技术
- 196 篇 软件工程
- 177 篇 机械工程
- 89 篇 控制科学与工程
- 33 篇 动力工程及工程热...
- 23 篇 电子科学与技术（可...
- 21 篇 仪器科学与技术
- 12 篇 安全科学与工程
- 11 篇 交通运输工程
- 8 篇 网络空间安全
- 7 篇 土木工程
- 5 篇 建筑学
- 4 篇 力学（可授工学、理...
- 3 篇 光学工程
117 篇 理学
- 90 篇 数学
- 22 篇 统计学（可授理学、...
- 15 篇 物理学
- 9 篇 系统科学
- 8 篇 化学
- 5 篇 生物学
- 3 篇 大气科学
77 篇 管理学
- 58 篇 管理科学与工程(可...
- 32 篇 工商管理
- 32 篇 图书情报与档案管...
11 篇 医学
- 10 篇 临床医学
3 篇 经济学
- 3 篇 应用经济学
3 篇 法学
- 3 篇 社会学
1 篇 文学
1 篇 农学
1 篇 军事学

主题

357 篇 wireless sensor ...
82 篇 distributed comp...
78 篇 sensors
61 篇 protocols
58 篇 distributed comp...
57 篇 sensor systems
56 篇 wireless communi...
43 篇 sensor networks
38 篇 energy consumpti...
37 篇 computer science
37 篇 routing
34 篇 monitoring
33 篇 mobile communica...
32 篇 delay
31 篇 wireless telecom...
30 篇 mobile computing
30 篇 computer network...
29 篇 internet of thin...
28 篇 sensor phenomena...
27 篇 wireless sensor ...

机构

7 篇 nanjing univ sta...
5 篇 suny stony brook...
4 篇 uppsala univ upp...
4 篇 college of compu...
4 篇 univ cyprus dept...
4 篇 school of electr...
4 篇 chalmers univ te...
3 篇 tech univ carolo...
3 篇 institute of ope...
3 篇 dalian univ tech...
3 篇 school of big da...
3 篇 univ fed minas g...
3 篇 univ missouri de...
3 篇 univ kiel kiel
3 篇 georgia state un...
3 篇 hamburg univ tec...
3 篇 department of co...
3 篇 washington univ ...
3 篇 eth dept comp sc...
3 篇 univ cyprus dept...

作者

10 篇 voigt thiemo
8 篇 bar-noy amotz
8 篇 vassiliou vasos
8 篇 kulau ulf
8 篇 nikoletseas soti...
7 篇 landsiedel olaf
7 篇 wolf lars
6 篇 xing guoliang
6 篇 thiemo voigt
6 篇 beferull-lozano ...
6 篇 rolim jose
6 篇 angelopoulos con...
6 篇 agrawal dharma p...
6 篇 duquennoy simon
5 篇 baltasar beferul...
5 篇 dai haipeng
5 篇 lars wolf
5 篇 cao jiannong
5 篇 sotiris nikolets...
5 篇 das sajal k.

语言

1,150 篇 英文
9 篇 其他
2 篇 中文

检索条件"任意字段=First IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2005"

共 1161 条记录，以下是991-1000 订阅

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

详细简洁

排序：

Adapting paintable architecture concepts to wireless sensor networks

Adapting paintable architecture concepts to wireless sensor ...

引用

27th international conference on Information Technology Interfaces, ITI 2005

作者： Orlić, Marin Čavrak, Igor Žagar, Mario Faculty of Electrical Engineering and Computing University of Zagreb Croatia

ISBN: (纸本)953713802X

Amorphous computing promises a novel approach with massively distributed systems. Research in the field hasn't yet produced any formal methodology for design of such system. Paintable computing architecture provides an interesting testbed for process self-assembly and together with wireless sensor networks, presents a platform whose goal is to tightly integrate with its environment. Such a platform could combine the best of both technologies while running applications composed of fragments resembling classical software agents capable of mobility. This article presents an introduction to changes that are necessary to have all these similar computing approaches unite.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

A semantics-based routing scheme for grid resource discovery

A semantics-based routing scheme for grid resource discovery

引用

1st international conference on e-Science and Grid computing, e-Science 2005

作者： Li, Juan Vuong, Son Computer Science Department University of British Columbia

ISBN: (纸本)0780394631

Grid technologies enable the sharing of a wide variety of distributed resources. To fully utilize these resources, effective resource discovery mechanisms are necessities. However, the complicated and dynamic characteristics of grid resources make sharing and discovering them a challenging issue. In this paper, we propose a peer-to-peer (P2P) based overlay network to assist the efficient resource discovery and query. The framework is based on the RDF metadata infrastructure, allowing a rich and extensible description of resources. To avoid flooding the network with a query, we propose a comprehensive semantics-based query forwarding strategy, which only forwards queries to semantically related nodes. After the related nodes have been located, the original RDF query is used to do the final query and retrieval. Results from simulation experiments demonstrate that this architecture is scalable and efficient. © 2005 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Time series prediction using adaptive association rules

Time series prediction using adaptive association rules

引用

first international conference on distributed Frameworks for Multimedia Applications 2005, DFMA '05

作者： Yaik, Ooi Boon Yong, Chan Huah Haron, Fazilah School of Computer Science Universiti Sains Malaysia 11800 Penang

ISBN: (纸本)0769522734

Grid computing is formed by a large collection of interconnected heterogeneous and distributed system. One of the grid computing purposes is to share computational resources. The efficiency and effectiveness of resource utilization of a grid greatly depend on the scheduler algorithm. The scheduler will be able to manage the grid resources more effectively if we able to predict and provide it with the future state of grid resources. Therefore, this paper proposes a model to perform time series prediction using adaptive association rules. This model uses the idea that if a segment of a repeatable time series pattern has occurred, it has the possibility that the following segments of the repeatable pattern will appear. Data mining and pattern matching techniques are being applied to mine for repeatable time series patterns. This model has the ability to provide confident level for each prediction it made and perform continuous adaptation. A prototype of this model is being developed and tested with four test cases. These test cases are relatively simple because our work on this time series prediction using adaptive association rules is very much in its early stages. The result from the experiment shows that our model is able to capture repetitive time series patterns and perform prediction using those patterns. However, this model has some drawbacks such as it required high computational power and required large storage.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed localization refinements for mobile sensor networks

Distributed localization refinements for mobile sensor netwo...

引用

Third international conference on Computer Network and Mobile computing, ICCNMC 2005

作者： Zhu, Yanmin Gao, Min Ni, Lionel M. Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong

Location information is crucial for many applications of sensor networks to fulfill their functions. A mobile sensor network is comprised of both mobile and stationary sensors. So far little work has been done to tackle the mobility of sensors in localization for sensor networks. In this paper, we propose the QoL-guided distributed refinements for anchor-free localization in wireless mobile sensor networks. Accuracy is the core concern for localization. We introduce the important concept of Quality of Localization (QoL) to indicate the accuracy of a computed location for a specific sensor node. Our approach is divided into two phases. In Phase one, we propose the algorithm QoL-guided spreading localization with refinements to compute locations for sensor nodes right after the deployment of the sensor network when the mobile sensors are required to stay static temporarily. In Phase two, the non-movement restriction is released and we propose the mobile location self-updating algorithm to update locations of mobile sensors regularly or on demand. Extensive simulations are conducted, which demonstrate that our approach is a promising technique for localization in wireless mobile sensor networks. © Springer-Verlag Berlin Heidelberg 2005.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Invited paper: Cooperative communication and routing over fading channels in wireless sensor networks

Invited paper: Cooperative communication and routing over fa...

引用

2005 international conference on Wireless Networks, Communications and Mobile computing

作者： Chen, Shiou-Hung Mitra, Urbashi Krishnamachari, Bhaskar Department of Electrical Engineering University of Southern California Los Angeles CA 90089

ISBN: (纸本)0780393058

The dense deployments of wireless sensor networks offer the opportunity to develop novel communication techniques based on multi-node cooperation that can perform efficiently even over harsh fading channels. Several key contributions in the development and analysis of such techniques are provided. first, prior studies on cooperative communication and routing are extended by explicitly considering fading channels and relaxing synchronization requirements. It is demonstrated that significant asymptotic spatial diversity gains are achievable with K-cooperation even if error propagation is considered. Second, we provide a low complexity near-optimal power distribution algorithm over cooperating nodes, which selects the number of cooperating transmitters based on observed channel conditions, and several power distribution strategies over links are compared. Finally, it is shown that multi-hop cooperative routing can be highly energy efficient in realistic settings.1 ©2005 ieee.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Motion-constrained mobile sensor networks

Motion-constrained mobile sensor networks

引用

12th international conference on Advanced Robotics, 2005. ICAR '05

作者： Butler, Zack Department of Computer Science Rochester Institute of Technology

ISBN: (纸本)0780391772

The addition of mobility to sensor networks gives users the ability to efficiently monitor environments about which little is known ahead of time. For example, if there is a suspected path through the forest that should be monitored, but its exact location is not known, sensors can be scattered through the area and converge on the path as people or animals are detected on it. In this work, we present several distributed algorithms for sensors to produce this convergence. The first is a robust positioning technique for open rectangular spaces. We also build on this to produce an algorithm for arbitrary connected spaces. In addition, we consider sensors that are inherently constrained in their motion, such as tethered sensors fixed to a single line of motion. We present both analytical and empirical results for a variety of cases and discuss extensions that will provide greater effectiveness. © 2005 ieee.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

A round-2 randomized leader election algorithm and latency for MDVM system

A round-2 randomized leader election algorithm and latency f...

引用

international conference on Next Generation Web Services Practices

作者： Bagchi, S Das, P BESU PDSIT Sibpur India

ISBN: (纸本)0769524524

The future trend in the computing paradigm is marked by mobile computing based on mobile-client/server architecture connected by wireless communication network. However, the mobile computing systems have limitations because of the resource-thin mobile clients operating on battery power. The MDVM system allows the mobile clients to utilize memory and CPU resources of server-groups to overcome the resource limitations Of clients. This paper proposes a round-2 randomized algorithm to elect a leader and co-leader of the server-group without assuming any particular network topology. The algorithm is implemented and the network-paging latency values of wireless network are measured experimentally. Results indicate that in most cases the algorithm successfully terminates in first round. The network-paging latency values indicate that MDVM system is realizable using 3G/4G wireless communication systems. In addition, the overall message complexity of the algorithm is O(vertical bar N-a vertical bar) where N-a is the size of the server-group.

关键词： client-server systems communication complexity mobile computing virtual storage 3G wireless communication system 4G wireless communication system message complexity mobile client-server architecture mobile distributed virtual memory netw communication complexity Mobile computing virtual memory client-server systems Wireless networks Latency Computational modeling algorithms

来源：评论

学校读者我要写书评

暂无评论

Approaching the upper limit of lifetime for data gathering sensor networks

Approaching the upper limit of lifetime for data gathering s...

引用

international conference on Intelligent computing, ICIC 2005

作者： Yu, Haibin Zeng, Peng Liang, Wei Shenyang Institute of Automation Chinese Academy of Sciences Shenyang Liaoning China

Data gathering is a broad research area in wireless sensor network. In this paper, we consider the problem of routing between the base station and remote data sources via intermediate sensor nodes in a homogeneous sensor network. sensor nodes have limited and unreplenishable power resources, both path energy cost and path length are important metrics affecting sensor lifetime. In this paper, we first explore the fundamental limits of sensor network lifetime that all algorithms can possibly achieve. Different from previous work, we explicitly consider the constraints of the limited energy and the limited end-to-end latency. We then model the formation of length and energy constrained paths and define the new composite metrics for energy-latency-optimal routing. We also design a distributed data gathering protocol called ELAG (Energy and Latency Aware data Gathering). This protocol balances energy consumption across the network by periodically determining a new optimal path consistent with associated energy distributions. Simulation results testify to the effectiveness of the protocol in producing a longer network lifetime. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

An embedded real-time network MicroKernel dedicated to wireless sensor network: ERNμK

An embedded real-time network MicroKernel dedicated to wirel...

引用

2005 international conference on Wireless Communications, Networking and Mobile computing, WCNM 2005

作者： Zhou, Haiying Hou, Kun Mean De Vaulx, Christophe Gineste, Laurent School of Electronic Information Wuhan University China Laboratoire LIMOS UMR 6158 CNRS ISIMA University of Blaise Pascal Clermont-Ferrand II France

ISBN: (纸本)078039335X

Wireless sensor network (WSN) nodes have strict constrained resource and wireless communication function. Traditional embedded operation systems are either resource consumptive or nonsupport for real-time multi-task operations. This paper presents an embedded real-time network microkernel dedicated to WSN: ERNμK. The kernel consists of two components: a Super-small distributed REAl-time Micro kernel: SDREAM and a Minimal Real-time and Embedded TCP/IP stack: μRET. SDREAM is a tuple-based message-driven microkernel. It adopts a meta language: Kernel Modeling Language to define and describe the abstract manners of system primitives. The IPC and synchronization is based on the LINDA concept: the "tuple" model implemented by two light primitives (SND: OUT & RCV: IN). In order to simplify the TCP/IP implementation, μRET adopts some simplification mechanisms: protocol simplification hypothesis, a specific buffering subsystem and a simplifying message subsystem in view of system resources, applications and network environment. ERNμK has been ported and evaluated on two platforms: microcontroller (MSP430F149) and DSP (TMS320C5410). The performance results show that ERNμK has tiny resource requirements and is suitable for hard real-time multi-task WSN applications. © 2005 ieee.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

Energy efficient processing of K nearest neighbor queries in location-aware sensor networks

Energy efficient processing of K nearest neighbor queries in...

引用

MobiQuitous 2005: Second Annual international conference on Mobile and Ubiquitous systems -Networking and Services

作者： Winter, Julian Xu, Yingqi Lee, Wang-Chien Department of Computer Science and Engineering Pennsylvania State University University Park PA 16802

ISBN: (纸本)0769523757

The k nearest neighbor (KNN) query, an essential query for information processing in sensor networks, has not received sufficient attention in the research community of sensor networks. In this paper, we examine in-network processing of KNN queries by proposing two alternative algorithms, namely the GeoRouting Tree (GRT) and the KNN Boundary Tree (KBT). The former is based on a distributed spatial index structure and prunes off the irrelevant nodes during query propagation. The latter is based upon ad-hoc geographic routing and first obtains a region within which at least k nearest sensor nodes are enclosed and then decides the k nearest nodes to the query point. We provide an extensive performance evaluation to study the impact of various system factors and protocol parameters. Our results show that GRT yields a good tradeoff between energy consumption and query accuracy in static scenarios. On the other hand, KBT achieves better energy efficiency while being more tolerant to network dynamics. © 2005 ieee.

关键词： Data processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共117页 << < 96 97 98 99 100 101 102 103 104 105 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：