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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,317 篇 会议
46 篇 期刊文献
30 册 图书

馆藏范围

2,393 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,393 篇 工学
- 1,180 篇 计算机科学与技术...
- 600 篇 软件工程
- 296 篇 信息与通信工程
- 175 篇 电气工程
- 101 篇 控制科学与工程
- 97 篇 电子科学与技术（可...
- 59 篇 动力工程及工程热...
- 55 篇 机械工程
- 41 篇 仪器科学与技术
- 31 篇 生物工程
- 26 篇 网络空间安全
- 25 篇 生物医学工程（可授...
- 21 篇 建筑学
- 16 篇 环境科学与工程（可...
- 16 篇 安全科学与工程
- 15 篇 光学工程
- 15 篇 土木工程
357 篇 管理学
- 290 篇 管理科学与工程(可...
- 99 篇 图书情报与档案管...
- 95 篇 工商管理
327 篇 理学
- 195 篇 数学
- 63 篇 物理学
- 63 篇 系统科学
- 44 篇 生物学
- 30 篇 统计学（可授理学、...
- 15 篇 化学
26 篇 经济学
- 26 篇 应用经济学
23 篇 法学
- 18 篇 社会学
15 篇 农学
- 14 篇 作物学
15 篇 医学
- 14 篇 临床医学
10 篇 文学
2 篇 艺术学
1 篇 军事学

主题

275 篇 peer to peer com...
237 篇 distributed comp...
203 篇 computer network...
176 篇 wireless sensor ...
132 篇 protocols
131 篇 grid computing
120 篇 cloud computing
107 篇 computational mo...
102 篇 routing
91 篇 delay
89 篇 computer archite...
88 篇 mobile computing
87 篇 servers
81 篇 algorithm design...
79 篇 ad hoc networks
78 篇 mobile communica...
77 篇 bandwidth
75 篇 concurrent compu...
75 篇 network topology
68 篇 computer science

机构

22 篇 institute of com...
16 篇 institute of com...
10 篇 national laborat...
8 篇 school of comput...
8 篇 school of comput...
8 篇 graduate univers...
8 篇 school of comput...
8 篇 school of comput...
7 篇 national laborat...
7 篇 seikei universit...
7 篇 key laboratory o...
6 篇 department of co...
6 篇 rissho universit...
6 篇 national laborat...
6 篇 chinese academy ...
5 篇 key laboratory o...
5 篇 graduate univers...
4 篇 inria
4 篇 department of ma...
4 篇 nokia research c...

作者

8 篇 kurt rothermel
7 篇 zhang desheng
7 篇 makoto takizawa
7 篇 valentin cristea
7 篇 rothermel kurt
6 篇 zomaya albert y.
6 篇 li jinbao
6 篇 ailixier aikebai...
6 篇 frank dürr
5 篇 wei liu
5 篇 tang tao
5 篇 lin yisong
5 篇 min geyong
5 篇 tomoya enokido
5 篇 jin hai
5 篇 guo longjiang
5 篇 kai xiang
5 篇 jiannong cao
4 篇 qishi wu
4 篇 zhang lei

语言

2,386 篇 英文
5 篇 中文
2 篇 其他

检索条件"任意字段=2010 International Conference on Parallel and Distributed Computing and Networks, PDCN 2010"

共 2393 条记录，以下是2231-2240 订阅

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

详细简洁

排序：

Improvement and Implementation of IDMEF Data Model

Improvement and Implementation of IDMEF Data Model

引用

international conference on Computer Modeling and Simulation, ICCMS

作者： Han Ming Dewu Xu Wei Chen Math Phys. & Inf. Eng. Coll. Zhejiang Normal Univ. Jinhua China

The rapidly increasing series of Internet-scale disrupted threat is a pressing problem for every organization that utilizes the network. Many research institutions focus on collaborative security, of which collaborative intrusion detection is an important component. Sharing data among widely distributed intrusion detection systems is essential. To this end, IDWG (intrusion detection working group) proposed a draft in IDMEF (intrusion detection message exchange format). This paper aims at improving the IDMEF data model to foster interoperability and to maximize extensibility the messages which represented in XML. This is expected to become a generally-useful type of data. Finally, it implements the new IDMEF data model in XML.

关键词： Data models Intrusion detection XML Computer networks Collaborative work Data security Information security Collaboration Physics computing Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A Unified Scheduling Framework Based on Virtual Timers for Selfish-Policy Shared Spectrum

A Unified Scheduling Framework Based on Virtual Timers for S...

引用

IEEE international conference on Communications (ICC)

作者： A. Attar N. Devroye H. Li V. C. M. Leung Department of Electrical and Computer engineering University of British Columbia Canada Department of Electrical and Computer engineering University of Illinois Chicago USA

The issue of efficiency and fairness in resource allocation will continue to be of significant importance in scheduler designs for future wireless systems. Of particular importance is the development of distributed techniques for achieving desired efficiency and fairness tradeoffs. We will focus on the the design of selfishly efficient and as well as different fair policies through the use of a virtual timer. This virtual timer unifies various previously considered fairness methods including Round-Robin, Max-Min and Proportional fairness, which are rigorously investigated. The performance of the presented techniques are compared using extensive simulations.

关键词： Resource management Processor scheduling Transmitters Communications Society Bandwidth Wireless communication Broadband communication Communication systems Peer to peer computing Intelligent networks

来源：评论

学校读者我要写书评

暂无评论

Achieving Fair Throughput for TCP Flows in Multi-Hop Wireless Backhaul networks

Achieving Fair Throughput for TCP Flows in Multi-Hop Wireles...

引用

IEEE international conference on Communications (ICC)

作者： C.-W. Hsu T.-C. Hou Department of Electrical Engineering & Department of Communications Engineering National Chung Cheng University Chiayi Taiwan

The use of multihop wireless networks based on the 802.11 technology has been growing. The primary advantages of this approach are mature technology and ease of deployment. However, the fairness property provided by the 802.11 DCF (distributed coordination function) in a single hop environment has been shown to be non-existent in a multihop environment. For example, in the multihop wireless backhaul network, nodes that are more hops away from the gateway are starved by nodes that are closer to the gateway. This paper focuses on the fairness study when TCP flows are carried over wireless backhaul networks. By not modifying lower layer protocols, this work identifies TCP parameters that impact throughput fairness and proposes adjusting those parameters to reduce frame collisions and improve throughput fairness. With the aid of simple mathematical formulations and ns2 simulations, this study finds that the frame transmissions from each node can be effectively controlled by properly controlling the delayed ACK timer and using a suitable advertised window. For chain topology with long hops, the fairness index of our proposed method outperforms basic 802.11 DCF by over 90 percent. The proposed methods are simple and easy to deploy.

关键词： Throughput Spread spectrum communication Peer to peer computing Wireless LAN Wireless networks Delay effects Degradation Media Access Protocol Communications Society Paper technology

来源：评论

学校读者我要写书评

暂无评论

Dynamic TinyOS: Modular and Transparent Incremental Code-Updates for Sensor networks

Dynamic TinyOS: Modular and Transparent Incremental Code-Upd...

引用

IEEE international conference on Communications

作者： Waqaas Munawar Muhammad Hamad Alizai Olaf Landsiedel Klaus Wehrle Computer Systems and Telematics Freie Universität Berlin Germany Distributed Systems Group RWTH Aachen University Germany

Long-term deployments of sensor networks in physically inaccessible environments make remote re-programmability of sensor nodes a necessity. Ranging from full image replacement to virtual machines, a variety of mechanisms exist today to deploy new software or to fix bugs in deployed systems. However, TinyOS - the current state of the art sensor node operating system - is still limited to full image replacement as nodes execute a statically-linked system-image generated at compilation time. In this paper we introduce Dynamic TinyOS to enable the dynamic exchange of software components and thus incrementally update the operating system and its applications. The core idea is to preserve the modularity of TinyOS, i.e. its componentization, which is lost during the normal compilation process, and enable runtime composition of TinyOS components on the sensor node. The proposed solution integrates seamlessly into the system architecture of TinyOS: It does not require any changes to the programming model of TinyOS and existing components can be reused transparently. Our evaluation shows that Dynamic TinyOS incurs a low performance overhead while keeping a smaller - up to one third - memory footprint than other comparable solutions.

关键词： Sensor systems Peer to peer computing Runtime Operating systems Virtual machining Wireless sensor networks Bandwidth Costs Joining processes Protocols

来源：评论

学校读者我要写书评

暂无评论

computing FUNCTIONS VIA SIMO MULTIPLE-ACCESS CHANNELS: HOW MUCH CHANNEL KNOWLEDGE IS NEEDED?

COMPUTING FUNCTIONS VIA SIMO MULTIPLE-ACCESS CHANNELS: HOW M...

引用

IEEE international conference on Acoustics, Speech, and Signal Processing

作者： Mario Goldenbaum Slawomir Stanczak Fraunhofer German-Sino Lab for Mobile Communications Einsteinufer 37 D-10587 Berlin Germany

ISBN: (纸本)9781424442959

We view a wireless sensor network as a collection of sensor nodes that observe sources of information, process the picked up data and send it to a sink node, with the goal of computing a desired function of the measurements. To this end, we consider a previously proposed coding scheme that exploits the underlying fading multiple-access channel (MAC) to efficiently estimate the function values. The main problem addressed in this paper is how much channel state information (CSI) is needed at the sensor nodes to obtain sufficiently good estimates? First we show that there is no performance loss, independent of fading distributions, if, instead of perfect CSI, each sensor node has only access to the modulus of its channel coefficient. In the case of multiple antenna elements at the sink node and specific independent distributed fading environments, it is shown that CSI at sensor nodes is not necessary and a very simple correction of fading effects can be performed at the sink based on some statistical channel knowledge. In many cases, fading improves the estimation accuracy due to the multiple-access nature of the channel.

关键词： Computation over MAC communicating functions in-network computation wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Wireless distributed Network System for Relief Activities after Disasters - A Field Experiment for Channel Setting and a System for Information Exchange among Shelters

Wireless Distributed Network System for Relief Activities af...

引用

international conference on Broadband, Wireless computing, Communication and Applications (BWCCA)

作者： Misako Urakami Satoshi Innami Makoto Kamegawa Tetsuya Shigeyasu Hiroshi Matsuno Information Science and Technology Department Oshima National College of Maritime Technology Japan Graduate School of Information Systems University of Electro-Communications Japan Digital Meister Company Limited Japan Faculty of Engineering Hiroshima International University Japan Graduate School of Science and Engineering Yamaguchi University Japan

Safety information of evacuees is the most important information for relief activities in disasters. We have discussed about required conditions for computer systems destined for supporting effective relief activities after disasters. In addition, on the basis of this discussion, we also have proposed a network construction algorithm and have performed preliminary evaluation about the installation locations among wireless stations and wireless link connectivity. In this paper, we report the results of preliminary evaluation of the performance of information sharing algorithm ADES. In addition, this paper introduces an improved system called ADES-Plus. ADES-Plus system employs information management function by an existing database. Furthermore, in accordance with the required speed of information sharing, we add a function that enables flexible processings. These new functions are confirmed to be work well through computational experiments.

关键词： Safety Wireless communication Wireless LAN Educational institutions Electronic mail Timing IP networks

来源：评论

学校读者我要写书评

暂无评论

Joint Routing, Scheduling and Variable-Width Channel allocation for Multi-hop WMNs

Joint Routing, Scheduling and Variable-Width Channel allocat...

引用

IEEE international conference on Communications

作者： Mohammad Faisal Uddin Hamed Alazemi Chadi Assi Concordia University Montreal QUE Canada Kuwait University Kuwait

Recent research results have shown that channel width is an important control knob that can be easily adapted through software and can be used for achieving higher system throughput and better energy efficiency. In this paper we address the problem of joint routing and transmission scheduling in a multichannel wireless mesh network with variable-width channel allocation. While narrower bands split the total available spectrum into more non-overlapping channels allowing more parallel concurrent transmissions, wider bands increase the capacity of the communication links. We present a cross-layer problem formulation which incorporates multi-path routing and link layer scheduling. We model this combinatorial complex problem as a mixed integer linear program and present a primal-dual decomposition method for solving it. Our method has always shown to strike a good balance between often conflicting objectives to achieve higher system performance. Numerical results revealed that up to 57% improvement in network performance is obtained when variable-width channel assignment is used against the best fixed-width channel assignment for larger networks;this is due to the capability of the former in achieving a good balance between higher concurrency and better control of interference.

关键词： Routing Channel allocation Throughput Interference Scheduling Control systems Energy efficiency Wireless mesh networks Concurrent computing IP networks

来源：评论

学校读者我要写书评

暂无评论

Two Types of Trustworthiness of Acquaintances in Peer-to-Peer (P2P) Overlay networks

Two Types of Trustworthiness of Acquaintances in Peer-to-Pee...

引用

international conference on Broadband, Wireless computing, Communication and Applications (BWCCA)

作者： Soichi Sawamura Admir Barolli Ailixier Aikebaier Valbona Barolli Makoto Takizawa Seikei University Japan

Peer-to-peer (P2P) systems are in nature fully distributed with no centralized coordinator. A peer p s has to collect correct object information from trustworthy acquaintances which are considered to hold correct information. We consider two types of trustworthiness. First, the subjective trustworthiness st st on an acquaintance p t shows how much the peer p s trusts the acquaintance p t . The objective trustworthiness ot st on an acquaintance p t indicates how much other peers trust the acquaintance p t . In this paper, we discuss three algorithms OT1, OT2, and OT3 for a peer p s to obtain the objective trustworthiness ot st on the acquaintance p t . A peer p s collects subjective trustworthiness on an acquaintance p t from peers and obtain the average value as the objective trustworthiness. In the algorithm OT1, a peer p s tries to find every acquaintance of a target acquaintance p t in a type of flooding algorithm. Here, it takes time and more number of messages are transmitted. On the other hand, the peer p s sends request messages only to the acquaintances to reduce the number of messages in the algorithms OT1 and OT2. In OT2, only acquaintances which the peer p s can trust are considered. We evaluate the algorithms in terms of how correct objective trustworthiness can be obtained.

关键词： Peer to peer computing Authorization distributed databases Quality of service Indexes Time factors Broadband communication

来源：评论

学校读者我要写书评

暂无评论

Web services on embedded systems - a performance study

Web services on embedded systems - a performance study

引用

IEEE Annual conference on Pervasive computing and Communications Workshops (PerCom)

作者： Christin Groba Siobhán Clarke Lero Graduate School of Software Engineering Distributed Systems Group School of Computer Science and Statistics Trinity College Dublin Dublin Ireland

A platform-independent communication mechanism is essential for the seamless integration of embedded devices into the Web of Things. Web services provide for such communication, though there remains an open question as to whether they are suitable for hardware-constrained devices. While there is a general perception that they are too resource-intensive, there are few scientific studies dedicated to answering this question. As a result, researchers or developers investigating applications for the Web of Things have little evidence to support a decision on the best technical solution. This paper presents the results of a study designed to assess the performance of Web services on embedded devices. For our investigation, we deployed Web services on Sun SPOTs, representing medium-sized wireless sensor platforms, and analysed disk space, message size, response time and energy consumption. Our study quantifies the overhead of Web services and provides empirical data on whether this Web technology is a suitable approach for embedded devices.

关键词： Web services Embedded system Wireless sensor networks Application software Space technology Energy consumption Sun Delay Hardware Systems engineering and theory

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for lifetime maximization in delay-tolerant wireless sensor network with mobile sink

Distributed algorithm for lifetime maximization in delay-tol...

引用

IEEE conference on Decision and Control

作者： YoungSang Yun Ye Xia Behnam Behdani J. Cole Smith Computer & Information Science & Engineering Department University of Florida Gainesville FL USA Department of Industrial and Systems Engineering University of Florida Gainesville FL USA

We propose an algorithm for maximizing the lifetime of a wireless sensor network when there is a mobile sink and the underlying application can tolerate some degree of delay in delivering the data to the sink. Our main contribution is that the algorithm is distributed, and in addition, mostly uses local information. Such an algorithm can be implemented by parallel and/or distributed execution and the overhead of message passing is low. It is also possible to embed the algorithm into a network protocol so that the senor nodes and the sink can run it directly as part of the network operation. Our second contribution is that we give a proof of the algorithm's optimality and the boundedness of the queue sizes, both in the long-run average sense. The proof is based on analyzing a Lyapunov drift.

关键词： Wireless sensor networks Algorithm design and analysis Mobile communication Delay distributed algorithms Heuristic algorithms Mobile computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 220 221 222 223 224 225 226 227 228 229 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：