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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,663 篇 会议
35 篇 期刊文献
7 册 图书

馆藏范围

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

日期分布

学科分类号

4,351 篇 工学
- 3,354 篇 计算机科学与技术...
- 1,741 篇 电气工程
- 1,630 篇 信息与通信工程
- 1,221 篇 软件工程
- 650 篇 控制科学与工程
- 353 篇 测绘科学与技术
- 345 篇 动力工程及工程热...
- 270 篇 机械工程
- 219 篇 电子科学与技术（可...
- 200 篇 仪器科学与技术
- 117 篇 石油与天然气工程
- 107 篇 化学工程与技术
- 105 篇 安全科学与工程
- 92 篇 生物工程
- 82 篇 网络空间安全
- 75 篇 材料科学与工程（可...
- 74 篇 交通运输工程
- 69 篇 生物医学工程（可授...
- 57 篇 土木工程
- 56 篇 建筑学
797 篇 理学
- 403 篇 数学
- 165 篇 物理学
- 135 篇 化学
- 109 篇 生物学
- 94 篇 系统科学
- 94 篇 统计学（可授理学、...
561 篇 管理学
- 403 篇 管理科学与工程(可...
- 223 篇 图书情报与档案管...
- 154 篇 工商管理
94 篇 医学
- 84 篇 临床医学
62 篇 法学
58 篇 经济学
38 篇 农学
17 篇 教育学
17 篇 军事学
7 篇 文学
3 篇 艺术学

主题

1,054 篇 wireless sensor ...
177 篇 sensor systems
164 篇 sensor nodes
157 篇 wireless sensor ...
157 篇 distributed comp...
151 篇 wireless communi...
150 篇 sensors
143 篇 monitoring
143 篇 sensor networks
126 篇 cloud computing
117 篇 protocols
116 篇 internet of thin...
113 篇 routing
108 篇 distributed comp...
105 篇 energy efficienc...
87 篇 energy consumpti...
75 篇 optimization
75 篇 sensor phenomena...
75 篇 distributed data...
74 篇 security

机构

14 篇 shanghai jiao to...
10 篇 nanjing univ sta...
10 篇 tu wien distribu...
9 篇 suny stony brook...
9 篇 institute of com...
7 篇 department of co...
7 篇 missouri univ sc...
7 篇 state key labora...
7 篇 univ virginia de...
6 篇 nanjing universi...
6 篇 department of co...
6 篇 automation and c...
6 篇 ieee
6 篇 shihezi universi...
6 篇 carnegie mellon ...
6 篇 imperial coll lo...
6 篇 chinese academy ...
5 篇 nanjing univ pos...
5 篇 univ sci & techn...
5 篇 hong kong polyte...

作者

14 篇 wang wei
13 篇 dustdar schahram
11 篇 wu jie
11 篇 cao jiannong
10 篇 stankovic john a...
10 篇 beigl michael
10 篇 agrawal dharma p...
9 篇 bar-noy amotz
9 篇 voigt thiemo
9 篇 wang cong
9 篇 rothermel kurt
8 篇 vassiliou vasos
8 篇 rinner bernhard
8 篇 kulau ulf
8 篇 wolf lars
8 篇 nikoletseas soti...
8 篇 abdelzaher tarek
8 篇 chen guihai
8 篇 liu yunhao
7 篇 roedig utz

语言

5,604 篇 英文
89 篇 其他
13 篇 中文
1 篇 俄文

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

共 5705 条记录，以下是4951-4960 订阅

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

详细简洁

排序：

Anomaly-based fault detection system in distributed system

Anomaly-based fault detection system in distributed system

引用

5th ACIS international conference on Software Engineering Reseach, Management and Applications held in Conjuction with 1st international Workshop on Advanced Internet Technology and Applications

作者： Kim, Byoung uk Hariri, Salim Univ Arizona Dept Elect & Comp Engn High Performance Distributed Comp Lab Tucson AZ 85721 USA

ISBN: (纸本)9780769528670

One of the important design criteria for distributed systems and their applications is their reliability and robustness to hardware and software failures. the increase in complexity, interconnectedness, dependency and the asynchronous interactions between the components that include hardware resources (computers, servers, network devices), and software (application services, middleware, web services, etc.) makes the fault detection and tolerance a challenging research problem. In this paper, we present an innovative approach based on statistical and data mining techniques to detect faults (hardware or software) and also identify the source of the fault. In our approach, we monitor and analyze in realtime all the interactions between all the components of a distributed system. We used data mining and supervised learning techniques to obtain the rules that can accurately model the normal interactions among these components. Our anomaly analysis engine will immediately produce an alert whenever one or more of the interaction rules that capture normal operations is violated due to a software or hardware failure. We evaluate the effectiveness of our approach and its performance to detect software faults that we inject asynchronously, and compare the results for different noise level.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Compromising location privacy in wireless networks using sensors with limited information

Compromising location privacy in wireless networks using sen...

引用

27th international conference on distributed computing systems, ICDCS'07

作者： Zhu, Ye Bettati, Riccardo Electrical and Computer Engineering Department Cleveland State University Cleveland OH 44115 United States Department of Computer Science Texas A and M University College Station TX 77843-3112 United States

ISBN: (纸本)0769528376

We propose a methodology to identify nodes in fully anonymized wireless networks using collections of very simple sensors. Based on time series of counts of anonymous packets provided by the sensors, we estimate the number of nodes using Principal Component Analysis. We then proceed to separate the collected packet data into traffic flows that, with help of the spatial diversity in the available sensors, can be used to estimate the location of the wireless nodes. Our simulation experiments indicate that the estimators show high accuracy and high confidence for anonymized TCP traffic. Additional experiments indicate that the estimators perform very well in anonymous wireless networks that use traffic padding. © 2007 ieee.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

sensor scheduling for optimal observability using estimation entropy

Sensor scheduling for optimal observability using estimation...

引用

5th ieee international conference on Pervasive computing and Communications

作者： Rezaeian, Mohammad Univ Melbourne Dept Elect Engn & Elect Melbourne Vic 3010 Australia

ISBN: (纸本)9780769527888

We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). this model fits to the cases where a Markov process is observed by a single sensor which needs to be dynamically adjusted or by a set of sensors which are selected one at a time in a way that maximizes the information acquisition from the process. Similar to conventional POMDP problems, in this model the control action is based on all past measurements;however here this action is not for the control of state process, which is autonomous, but it is for influencing the measurement of that process. this POMDP is a controlled version of the hidden Markov process, and we show that its optimal observability problem can be formulated as an average cost Markov decision process (MDP) scheduling problem. In this problem, a policy is a rule for selecting sensors or adjusting the measuring device based on the measurement history. Given a policy, we can evaluate the estimation entropy for the joint statemeasurement processes which inversely measures the observability of state process for that policy. Considering estimation entropy as the cost of a policy, we show that the problem offinding optimal policy is equivalent to an average cost MDP scheduling problem where the cost function is the entropy function over the belief space. this allows the application of the policy iteration algorithm forfinding the policy achieving minimum estimation entropy, thus optimum observability.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Remote monitoring of vehicle diagnostics and location using a smart box with global positioning system and general packet radio service

Remote monitoring of vehicle diagnostics and location using ...

引用

5th ieee/ACS international conference on Computer systems and Applications (AICCSA-07)

作者： Al-Taee, Majid A. Khader, Omar B. Al-Saber, Nabeel A. Univ Jordan Dept Comp Engn Irbid Jordan

ISBN: (纸本)9781424410309

this paper presents a distributed system for remote monitoring of vehicle diagnostics and geographical position. this is achieved by using on-board microcomputer system, called On-Board Smart Box (OBSB), General Packet Radio Service (GPRS) and a remote server. the OBSB which is equipped with an integrated Global Positioning System (GPS) receiver is empowered by a software application that manages the processes of local data acquisition and transmission of the acquired data to the remote server via GPRS. When programmed with speed limits in a certain geographical region, the OBSB allows the traffic control authority to supervise violations of speed limits from inside vehicles rather than outside supervision via certain checkpoints. Appropriate vocal and text warning messages are issued when a vehicle exceeds the permitted speed limit at a certain location. A prototype system is designed and implemented with a small number of sensors. On-road experiments have demonstrated the robustness, efficiency and applicability of the proposed system.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Statistical trast establishment in wireless sensor networks

Statistical trast establishment in wireless sensor networks

引用

13th international conference on Parallel and distributed systems, ICPADS

作者： Probst, Matthew J. Kasera, Sneha Kumar School of Computing University of Utah

ISBN: (纸本)9781424418909

We present a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify malfunctioning and malicious sensor nodes and minimize their impact on applications. Our method adapts well to the special characteristics of wireless sensor networks, the most important being their resource limitations. Our methodology computes statistical trust and a confidence interval around the trust based on direct and indirect experiences of sensor node behavior. By considering the trust confidence interval, we are able to study the tradeoff between the tightness of the trust confidence interval with the resources used in collecting experiences. Furthermore, our approach allows dynamic scaling of redundancy levels based on the trust relationship between the nodes of a wireless sensor network. Using extensive simulations we demonstrate the benefits of our approach over an approach that uses static redundancy levels in terms of reduced energy consumption and longer life of the network. We also find that high confidence trust can be computed on each node with a relatively small memory overhead and used to determine the level of redundancy operations among nodes in the system. © 2007 ieee.

关键词： sensor nodes

来源：评论

学校读者我要写书评

暂无评论

RC-MAC: Reduced collision MAC for bandwidth optimization in wireless local area networks

RC-MAC: Reduced collision MAC for bandwidth optimization in ...

引用

5th ieee/ACS international conference on Computer systems and Applications (AICCSA-07)

作者： Taifour, Mahmoud Nait-Abdesselam, Farid Simplot-Ryl, David Univ Sci & Technol Lille CNRS UMR 8022 INRIAPOPSIRCICALIFL Lille France

ISBN: (纸本)9781424410309

the ieee 802.11 standard for Wireless Local Area Networks (WLANs) employs a mechanism for Medium Access Control (MAC), named distributed Coordination Function (DCF), which is based, on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). the collision avoidance mechanism uses the random backoff prior to each frame transmission attempt. the random nature of the backoff reduces the collision probability, but cannot eliminate completely these collisions. It is well known that as the number of con tending stations increases, the number of collisions is also likely to increase and the performance of the 802.11 WLAN is significantly compromised. In this paper, we propose a novel distributed MAC protocol, named Reduced Collision MAC (RC-MAC). In our algorithm, a station will access the channel by following a cyclic method. After a certain period of contention resolution, the stations will be simply organized in a cycle and each of them will access the channel while its turn comes. In this case, there is no more collision in the future and the bandwidth is used efficiently. through extensive simulations, we show that RCMAC achieves a significant increase in the overall performance compared to the standard 802.11 DCF.

关键词： WLAN ieee 802.11 DCF RC-MAC guarantee the access to the channel without collision

来源：评论

学校读者我要写书评

暂无评论

Proceedings - Fifth Annual ieee international conference on Pervasive computing and Communications Workshops PerCom Workshops 2007

Proceedings - Fifth Annual IEEE International Conference on ...

引用

5th Annual ieee international conference on Pervasive computing and Communications Workshops, PerCom Workshops 2007

ISBN: (纸本)0769527884

the proceedings contain 112 papers. the topics discussed include: a performance evaluation of ontology-based context reasoning;promoting efficiency and separation of concerns through a hybrid model based on ontologies for context-aware computing;hoarding context information with context clusters;localization for intermittently connected ad hoc networks;operator-driven peer-to-peer service platform for mobile environments;securing broadcast based ad hoc routing protocols;a ubiquitous m-learning framework for network centric operations;context-aware model in a ubiquitous learning environment;data quality and query cost in wireless sensor networks;localization and coverage for high density sensor networks;sensor scheduling for optimal observability using estimation entropy;static path planning for mobile beacons to localize sensor networks;and challenges in the tracking and prediction of scheduled-vehicle journeys.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Challenges towards a distributed persistence layer for next generation CSCW applications

Challenges towards a distributed persistence layer for next ...

引用

5th ieee international conference on Pervasive computing and Communications

作者： Essmann, Bernd Hampel, thorsten Keil, Reinhard Univ Gesamthsch Paderborn Heinz Nixdorf Inst Warburger Str 100 D-4790 Paderborn Germany

ISBN: (纸本)9780769527888

Mobility is a great chance for embedding Computer Supported Cooperative Learning/Work (CSCL/W) in users' everyday life. One of the most important values, added through the use of technology, is the ability to bridge different learning situations across time and space. this can be accomplished through virtual knowledge spaces which provide means to work over a period of time with different people located at different places. However, most current mobility s-supporting CSCL/W platforms lack facilities for distributing cooperation objects in a way that make them available when needed. Our approachfor solving this problem is to provide a network-transparent persistence layer for storing and accessing objects in the network of participating nodes. Our solution takes the needs of CSCW applications into account and uses state of the art mechanisms for object distribution and load balancing.

关键词： Computer supported cooperative work

来源：评论

学校读者我要写书评

暂无评论

USense: A unified asymmetric sensing coverage architecture for wireless sensor networks

USense: A unified asymmetric sensing coverage architecture f...

引用

27th international conference on distributed computing systems, ICDCS'07

作者： Gu, Yu Hwang, Joengmin He, Tian Du, David Hung-Chang Department of Computer Science and Engineering University of Minnesota

ISBN: (纸本)0769528376

As a key approach to achieve energy efficiency in sensor networks, sensing coverage has been studied extensively. Researchers have designed many coverage protocols to provide various kinds of service guarantees on the network lifetime, coverage ratio and detection delay. While these protocols are effective, they are not flexible enough to meet multiple design goals simultaneously. In this paper, we propose a Unified Sensing Coverage Architecture, called uSense, which features three novel ideas: Asymmetric Architecture, Generic Switching and Global Scheduling. We propose asymmetric architecture based on the conceptual separation of switching from scheduling. Switching is efficiently supported in sensor nodes, while scheduling is done in a separated computational entity, where multiple scheduling algorithms are supported. As an instance, we propose a two-level global coverage algorithm, called uScan. At the first level, coverage is scheduled to activate different portions of an area. We propose an optimal scheduling algorithm to minimize area breach. At the second level, sets of nodes are selected to cover active portions. Importantly, we show the feasibility to obtain optimal set-cover results in linear time if the layout of areas satisfies certain conditions. We evaluate our architecture with a network of 30 MicaZ motes, an extensive simulation with 10,000 nodes, as well as theoretical analysis. the results indicate that uSense is a promising architecture to support flexible and efficient coverage in sensor networks. © 2007 ieee.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Catching "moles" in sensor networks

Catching "moles" in sensor networks

引用

27th international conference on distributed computing systems, ICDCS'07

作者： Ye, Fan Yang, Hao Liu, Zhen IBM T.J. Watson Research Center 19 Skyline Drive Hawthorne NY 10532

ISBN: (纸本)0769528376

False data injection is a severe attack that compromised sensor nodes ("moles"1) can launch. these moles inject large amount of bogus traffic that can lead to application failures and exhausted network resources. Existing sensor network security proposals only passively mitigate the damage by filtering injected packets;they do not provide active means for fight back. this paper studies how to locate such moles within the framework of packet marking, when forwarding moles collude with source moles to manipulate the marks. Existing Internet traceback mechanisms do not assume compromised forwarding nodes and are easily defeated by manipulated marks. We propase a Probabilistic Nested Marking (PNM) scheme that is secure against such colluding attacks. No matter how colluding moles manipulate the marks, PNM can always locate them one by one. We prove that nested marking is both sufficient and necessary to resist colluding attacks. PNM also has fast-traceback: within about 50 packets, it can track down a mole up to 20 hops away from the sink. this virtually prevents any effective data injection attack: moles will be caught before they have injected any meaningful amount of bogus traffic. ©2007 ieee.

关键词： Network management

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：