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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

6,166 篇 会议
97 篇 期刊文献
18 册 图书

馆藏范围

6,281 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,620 篇 工学
- 3,859 篇 计算机科学与技术...
- 1,634 篇 信息与通信工程
- 1,601 篇 电气工程
- 1,591 篇 软件工程
- 615 篇 控制科学与工程
- 325 篇 机械工程
- 316 篇 动力工程及工程热...
- 260 篇 测绘科学与技术
- 202 篇 电子科学与技术（可...
- 192 篇 仪器科学与技术
- 140 篇 交通运输工程
- 132 篇 网络空间安全
- 130 篇 安全科学与工程
- 97 篇 生物工程
- 93 篇 石油与天然气工程
- 74 篇 材料科学与工程（可...
- 62 篇 化学工程与技术
- 59 篇 生物医学工程（可授...
- 56 篇 建筑学
842 篇 理学
- 437 篇 数学
- 154 篇 物理学
- 138 篇 生物学
- 130 篇 系统科学
- 109 篇 化学
- 104 篇 统计学（可授理学、...
631 篇 管理学
- 463 篇 管理科学与工程(可...
- 271 篇 图书情报与档案管...
- 157 篇 工商管理
131 篇 医学
- 113 篇 临床医学
64 篇 法学
56 篇 经济学
- 56 篇 应用经济学
31 篇 教育学
22 篇 农学
12 篇 军事学
11 篇 文学

主题

1,107 篇 wireless sensor ...
199 篇 sensor systems
184 篇 monitoring
178 篇 distributed comp...
175 篇 wireless communi...
164 篇 sensor nodes
159 篇 sensors
150 篇 protocols
144 篇 cloud computing
140 篇 internet of thin...
136 篇 wireless sensor ...
135 篇 distributed comp...
131 篇 routing
105 篇 sensor networks
102 篇 energy consumpti...
101 篇 security
100 篇 real-time system...
96 篇 computational mo...
91 篇 sensor phenomena...
90 篇 robot sensing sy...

机构

11 篇 nanjing univ sta...
10 篇 suny stony brook...
9 篇 department of co...
9 篇 department of co...
8 篇 univ ottawa sch ...
7 篇 college of compu...
7 篇 college of compu...
7 篇 chitkara univers...
7 篇 state key labora...
7 篇 queens univ sch ...
7 篇 city univ hong k...
7 篇 institute of com...
7 篇 distributed syst...
6 篇 school of comput...
6 篇 shanghai jiao to...
6 篇 cent south univ ...
6 篇 department of co...
6 篇 missouri univ sc...
6 篇 cent s univ sch ...
6 篇 carleton univ de...

作者

18 篇 dustdar schahram
13 篇 wu jie
12 篇 yang yang
11 篇 stankovic john a...
11 篇 wehrle klaus
11 篇 wang wei
11 篇 schahram dustdar
11 篇 cao jiannong
11 篇 agrawal dharma p...
10 篇 voigt thiemo
10 篇 rothermel kurt
10 篇 liu yunhao
9 篇 wang guojun
9 篇 nikoletseas soti...
9 篇 wang xin
9 篇 abdelzaher tarek
8 篇 bar-noy amotz
8 篇 duerr frank
8 篇 vassiliou vasos
8 篇 kulau ulf

语言

6,168 篇 英文
95 篇 其他
19 篇 中文
1 篇 土耳其文

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

共 6281 条记录，以下是4791-4800 订阅

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

详细简洁

排序：

Flexible failure handling for cooperative processes in distributed systems

Flexible failure handling for cooperative processes in distr...

引用

2009 5th international conference on Collaborative computing: Networking, Applications and Worksharing, CollaborateCom 2009

作者： Avanes, Artin Freytag, Johann-Christoph Database and Information System Group Humboldt-Universität zu Berlin Unter den Linden 6 10099 Berlin Germany

ISBN: (纸本)9789639799769

distributed systems will be increasingly built on top of wireless networks, such as sensor networks or handheld devices with advanced sensing and computational abilities. Supporting cooperative processes executed by such unreliable and dynamic system components poses a various number of new technical challenges. In terms of recovery, limited resource capabilities have be considered during re-scheduling of failed process activities. In terms of concurrency, a non-blocking protocol is required to allow a high degree of parallelism. In this paper, we introduce a flexible and resource-oriented failure handling mechanism for cooperative processes in hierarchical and distributed systems. the objective is to ensure both - transactional semantics as well as the selection of suitable nodes with respect to available resource capabilities. Based on a nested execution model, we develop a multi-stage algorithm that uses constraint solving techniques in a parallel fashion thus achieving a more efficient recovery. We evaluate our proposed techniques in a prototype implementation, and demonstrate significant performance gains by using a parallel re-scheduling.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

QUALITY CONTROL INFORMATION SYSTEM FOR IMMUNOLOGY/SEROLOGY TESTS IN MEDICAL LABORATORIES

QUALITY CONTROL INFORMATION SYSTEM FOR IMMUNOLOGY/SEROLOGY T...

引用

6th international Multi-conference on systems, Signals and Devices

作者： Al-Taee, Majid A. Souan, Lina Al-Haj, Ali Mohsen, Ahmed Muhsin, Zahra J. Univ Jordan Dept Comp Engn Amman 11942 Jordan King Hussein Cancer Ctr Immunol Lab Amman Jordan Royal Technol Co Amman Jordan

ISBN: (纸本)9781424443451

this paper presents the design and development of a new Quality Control (QC) system for immunology/serology tests at medical laboratories. the developed QC system which is based on client-server a architecture provides a scalable architecture for future integration of other categories of medical laboratory tests. the architecture and functional features of the proposed QC system are presented along with the workflow process and UML design models of the key QC and management processes. More than 15 Graphical User Interface (GUI) forms are designed and implemented to enter/display various types of information. Functionality of each form and its interactivity with the system database and operator is tested along with its interaction with other forms. Test results showed that the developed QC fulfills all the functional requirements and provides accurate QC reports. A wide spectrum of immunology/serology tests is performed and the obtained results are found in correlation with the QC statuses assessed manually by specialists. this not only confirms validity of the implemented QC process, but delivers higher confidence in lab-testing procedures, and allows for more reliable results.

关键词： Quality control medical laboratory tests immunology/serology distributed systems

来源：评论

学校读者我要写书评

暂无评论

Conflicting-Set-Based Wormhole Attack Resistant Localization in Wireless sensor Networks

Conflicting-Set-Based Wormhole Attack Resistant Localization...

引用

6th international conference on Ubiquitous Intelligence and computing

作者： Chen, Honglong Lou, Wei Wang, Zhi Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China Zhejiang Univ State Key Lab Ind Control Technol Hangzhou 310003 Zhejiang Peoples R China

ISBN: (纸本)9783642028298

the wormhole attack sniffs packets in one point in the network, tunnels them through a wired or wireless link to another point to cause severe influence on the localization process or routing process in the network. In this paper, we analyze the impact of the wormhole attack on the localization in wireless sensor networks and we propose a wormhole attack resistant secure localization scheme. the main idea of our proposed scheme is to build a so-called conflicting set for each locator based on the abnormalities of message exchanges among neighboring locators, and then to identify all dubious locators which are filtered out during localization. Our proposed scheme can identify the dubious locators with a very high probability to achieve secure localization. the simulation results show that it outperforms the existed schemes under different network parameters.

关键词： Conflicting Set Secure Localization Wireless sensor Networks Wormhole Attack

来源：评论

学校读者我要写书评

暂无评论

Target Coverage Problem in Wireless sensor Networks: A Column Generation Based Approach

Target Coverage Problem in Wireless Sensor Networks: A Colum...

引用

6th international conference on Mobile Adhoc and sensor systems

作者： Gu, Yu Li, Jie Zhao, Baohua Ji, Yusheng Univ Sci & Technol China Dept Comp Sci & Technol Hefei 230027 Anhui Peoples R China State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Univ Tsukuba Dept Comp Sci Tsukuba Ibaraki 305 Japan Natl Inst Informat Informat Syst Architecture Sci Res Div Tokyo Japan

ISBN: (纸本)9781424451142

Target coverage problem in wireless sensor networks remains a challenge. Due to nonlinear nature, previous work has mainly focused on heuristic algorithms, which remain difficult to characterize and have no performance guarantee. To solve the problem, this paper offers two important contributions. the first contribution is to have two lifetime upper bounds, which could be used to justify performance of previously proposed heuristic algorithms. One upper bound is based on the relaxation and reformulation technique while the other is derived by relaxing coverage constraints. We study the interesting connection between those two bounds and thus endow them with physical meanings. the second contribution is proposing a column generation based (CG) approach. the objective is to find an optimal schedule, defined as a time table specifying from what time up to what time which sensor watches which targets while the maximum lifetime has been obtained. We also offer an in-depth theoretic analysis as well as several novel techniques to further optimize the approach. Numerical results not only demonstrate that the lifetime upper bounds are very tight, but also verify that the proposed CG based approach constantly yields the optimal or near optimal solution.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

sensor fusion-based event detection in wireless sensor networks

Sensor fusion-based event detection in wireless sensor netwo...

引用

2009 6th Annual international conference on Mobile and Ubiquitous systems: Networking and Services, MobiQuitous 2009

作者： Bahrepour, Majid Meratnia, Nirvana Havinga, Paul J.M. Pervasive Systems Group Twente University Netherlands

ISBN: (纸本)9789639799592

Recently, Wireless sensor Networks (WSN) community has witnessed an application focus shift. Although, monitoring was the initial application of wireless sensor networks, in-network data processing and (near) real-time actuation capability have made wireless sensor networks suitable candidate for event detection and alarming applications as well. Unreliability and dynamic (e.g. in terms of deployment area, network resources, and topology) are normal practices in the field of WSN. therefore, effective and trustworthy event detection techniques for the WSN require robust and intelligent methods of mining hidden patterns in the sensor data, while supporting various kinds of dynamicity. Due to the fact that events are often functions of more than one attribute, data fusion and use of more features can help increasing event detection rate and reducing false alarm rate. In addition, sensor fusion can lead to more accurate and robust event detection by eliminating outliers and erroneous readings of individual sensor nodes and combining individual event detection decisions. In this paper, we propose a two-level sensor fusion-based event detection technique for the WSN. the first level of event detection in our proposed approach is conducted locally inside the sensor nodes, while the second level is carried out in a level higher (e.g., in a cluster head or gateway) and incorporates a fusion algorithm to reach a consensus among individual detection decisions made by sensor nodes. By considering fire as an event, we evaluate our approach through several experiments and illustrate impact of sensor fusion on achieving better results.

关键词： sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Advantages of Virtual Addressing for Efficient and Failure Tolerant Routing in sensor Networks

Advantages of Virtual Addressing for Efficient and Failure T...

引用

6th international conference on Wireless On-Demand Network systems and Services

作者： Awad, Abdalkarim Shi, Lei 'Ray' German, Reinhard Dressler, Falko Univ Erlangen Nurnberg Dept Comp Sci Comp Networks & Commun Syst D-8520 Erlangen Germany

ISBN: (纸本)9781424433742

We study the capabilities of virtual addressing schemes for efficient and failure tolerant routing in sensor networks. In particular, we present the Virtual Cord Protocol (VCP) that uses techniques known from peer-to-peer networks, i.e. distributed Hash Tables (DHTs) are used to associate data items in sensor networks with particular node addresses. the addresses of nodes are dynamically maintained by the protocol to form a virtual cord. VCP uses two mechanisms for finding paths to nodes and associated data items: First it relies on the virtual cord that always points towards the destination. Furthermore, locally available neighborhood information is exploited for greedy routing. Our simulation results show that VCP is able to find paths close to the possible shortest path with very low overhead. the routing performance of VCP, which clearly outperforms other ad hoc routing protocols such as Dynamic MANET On Demand (DYMO), is similar to other virtual addressing schemes, e.g. Virtual Ring Routing (VRR). However, we improved VCP to handle frequent node failures in an optimized way. the results presented in this paper outline the capabilities of VCP to handle such cases.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Large-Scale Networked systems: From Anarchy to Geometric Self-structuring

引用

10th international conference on distributed computing and Networking

作者： Kermarrec, Anne-Marie Mostefaoui, Achour Raynal, Michel Tredan, Gilles Viana, Aline C. IRISA INRIA Rennes Rennes France IRISA Univ Rennes 1 Rennes France INRIA Saclay Palaiseau France

ISBN: (纸本)9783540922940

We define geometric self-structuring in a large-scale networked system as the ability of the participating nodes to collaboratively impose a geometric structure to the network. Self-structuring is hard to achieve when no global positioning information about the network is available. Yet this is an useful capability in networked autonomous systems such as sensor networks. In this paper, we present the design and the evaluation of a fully decentralized geometric self-structuring approach. this approach heavily relies on the ability of each node to estimate its position in the network. the contribution of the paper is twofold: (i) a simple and fully decentralized virtual coordinated system (VINCOS) is proposed, relying only on local connectivity information and per-neighbor communication;(ii) a network geometric self-structuring approach (NetGeoS) is presented that enables a large set of nodes to configure themselves in arbitrary geometric structures. the evaluation shows that the approach is both efficient and accurate while achieving the geometric structuring.

关键词： sensor networks

来源：评论

学校读者我要写书评

暂无评论

A multi-scale strategy in wireless sensor networks for structural health monitoring

A multi-scale strategy in wireless sensor networks for struc...

引用

2009 5th international conference on Intelligent sensors, sensor Networks and Information Processing, ISSNIP 2009

作者： Liu, Xuefeng Cao, Jiannong Xu, Youlin Wu, Hejun Liu, Yang Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong Department of Civil and Structural Engineering Hong Kong Polytechnic University Hong Kong Hong Kong

ISBN: (纸本)9781424435180

Wireless sensor network (WSN) has been considered to be the next generation paradigm of structural health monitoring (SHM) systems due to its low cost, high scalability and flexibility. However, some inherent limitations of WSN such as low-bandwidth wireless communication, limited resources on wireless sensor nodes, must be addressed to meet the generally high requirements of SHM. distributed in-network processing has been widely accepted as a solution to this problem. However, the drawbacks of existing distributed algorithms, such as the low sensitivity, the dependency on accurate structural model, the incapability of handling various environmental conditions, et al., greatly constrained their practical applications. In this paper, we propose a multi-scale strategy in WSNs for SHM applications. the approach, called the ACF-CCF, utilizes the autocorrelation function of individual sensor node to detect the existence of damage and the cross-correlation function of designated node pairs to obtain damage location. through simulation and laboratory test, the effectiveness of the proposed approach is demonstrated. Compared with existing distributed SHM algorithms, the method is energy efficient, model free and is robust to various environmental conditions. © 2009 ieee.

关键词： Structural health monitoring

来源：评论

学校读者我要写书评

暂无评论

Multi-channel scheduling algorithms for fast aggregated convergecast in sensor networks

Multi-channel scheduling algorithms for fast aggregated conv...

引用

2009 ieee 6th international conference on Mobile Adhoc and sensor systems, MASS '09

作者： Ghosh, Amitabha Incel, Özlem Durmaz Kumar, V.S. Anil Krishnamachari, Bhaskar Ming Hsieh Department of Electrical Engineering University of Southern California Los Angeles CA 90089 United States NETLAB Department of Computer Engineering Bogazici University 34342 Bebek Istanbul Turkey Department of Computer Science Virginia Bio-Informatics Institute Virginia Tech. Blacksburg VA 24061 United States

ISBN: (纸本)9781424451135

Fast and periodic collection of aggregated data is of considerable interest for mission-critical and continuous monitoring applications in sensor networks. In the many-to-one communication paradigm known as convergecast, we consider scenarios where data packets are aggregated at each hop en route to a sink node along a tree-based routing topology and focus on maximizing the data collection rate at the sink by employing TDMA scheduling and multiple frequency channels. Our key result in the paper lies in proving that minimizing the schedule length for an arbitrary network in the presence of multiple frequencies is NP-hard, and in designing approximation algorithms with worst-case provable performance guarantees for geometric networks. In particular, we design a constant factor approximation for networks modeled as unit disk graphs (UDG) where every node has a uniform transmission range, and a O(Δ(T) log n) approximation for general disk graphs where nodes have different transmission ranges;n is the number of nodes in the network and Δ(T) is the maximum node degree on a given routing tree T. We also prove that a constant factor approximation is achievable on UDG even for unknown routing topologies so long as the maximum node degree in the tree is bounded by a constant. We also show that finding the minimum number of frequencies required to remove all the interfering links in an arbitrary network in NP-hard. We give an upper bound on the maximum number of such frequencies required and propose a polynomial time algorithm that minimizes the schedule length under this scenario. Finally, we evaluate our algorithms through simulations and show various trends in performance for different network parameters. ©2009 ieee.

关键词： sensor networks

来源：评论

学校读者我要写书评

暂无评论

Demultiplexing in Network Calculus - A Stochastic Scaling Approach

Demultiplexing in Network Calculus - A Stochastic Scaling Ap...

引用

6th international conference on the Quantitative Evaluation of systems

作者： Schmitt, Jens B. Martinovic, Ivan Univ Kaiserslautern Distributed Comp Syst Lab DISCO D-67663 Kaiserslautern Germany

ISBN: (纸本)9780769538082

During the last two decades, starting with the seminal work by Cruz, network calculus has evolved as a new theory for the performance analysis of networked systems. In contrast to classical queueing theory, it deals with performance bounds instead of average values and thus has been the theoretical basis of quality of service proposals such as the IETF's Integrated and Differentiated Services architectures. Besides these it has, however, recently seen many other applications scenarios as, for example, wireless sensor networks, switched Ethernets, avionic networks, systems-on-Chip, or even to speed-up simulations, to name a few. In this paper, we extend network calculus by a new versatile modelling element: a demultiplexer. Conventionally, demultiplexing has either been neglected or assumed to be static, i.e., be fixed at the setup time of a network. this is restrictive for many potential applications of network calculus. For example a load balancing based on current link loads in a network could not be modelled with conventional network calculus means. Our demultiplexing element is based on stochastic scaling. Fundamental results on a network calculus with stochastic scaling are therefore derived in this work. We illustrate the benefits of the demultiplexer in the sample application of load balancing.

关键词： Performance bounds network calculus demultiplexing stochastic scaling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 476 477 478 479 480 481 482 483 484 485 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：