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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1971-1980 订阅

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

详细简洁

排序：

A "Plug-and-Play' Framework to Enhance Heterogeneity and Versatility in Delay Tolerant networks

A "Plug-and-Play' Framework to Enhance Heterogeneity and Ver...

引用

Advanced international conference on Telecommunications (AICT)

作者： Feng Cheng Lee Yang Xia Chai Kiat Yeo Yong Tai Tan School of Computer Engineering Nanyang Technological University Singapore Defence Science and Technology Agency Singapore

ISBN: (纸本)9781424467488;9780769540214

In Delay Tolerant networks (DTN), the presence of additional multiple network access interfaces for nodes is beneficial when overcoming intermittent connectivity as well as interoperability issues in heterogeneous network access technologies. We propose a framework that is versatile enough to practically handle any type of network access for DTN node. Our framework allows the expansion of a DTN node's access capability via node cascading, and/or connection to multiple subnets of different access technologies, and establishing multiple parallel links between two DTN nodes using multiple network access interfaces. The versatility derived from our framework is crucial in operational scenarios, providing users various ways to reconnect to the network.

关键词： Disruption tolerant networking Access protocols Computer interfaces Computer networks TCPIP Telecommunication computing Testing Plugs

来源：评论

学校读者我要写书评

暂无评论

BitMON: A Tool for Automated Monitoring of the BitTorrent DHT

BitMON: A Tool for Automated Monitoring of the BitTorrent DH...

引用

international conference on Peer-to-Peer computing

作者： K. Junemann P. Andelfinger J. Dinger H. Hartenstein Institute of Telematics & Steinbuch Centre of Computing Karlsruhe Institute of Technology Germany

The distributed hash table (DHT) formed by BitTorrent has become very popular as a basis for various kinds of services. Services based on this DHT often assume certain characteristics of the DHT. For instance, for realizing a decentralized bootstrapping service a minimum number of peers running on a certain port are required. However, key characteristics change over time. Our measurements show that e.g. the number of concurrent users grew from 5 to over 7 millions of users during the last months. For making reliable assumptions it is thus essential to monitor the P2P network. This demo presents BitMON, a Java-based out-of-the-box platform for monitoring the BitTorrent DHT. This tool does not only crawl the network, but also automatically analyzes the collected data and visualizes the results. BitMON monitors the DHT's size in peers as well as the peers' IP addresses, port numbers, countries of origin and session length. Also, the long-term evolution of these indicators can be graphically displayed. Furthermore, BitMON is designed as a framework and can easily be extended or adapted to monitor other P2P networks.

关键词： Monitoring Peer to peer computing Graphical user interfaces IP networks Data visualization Measurement Estimation

来源：评论

学校读者我要写书评

暂无评论

Research of E-Learning System Based on SOA

Research of E-Learning System Based on SOA

引用

international conference on MultiMedia and Information Technology, MMIT

作者： Niu Honghui Ma Xiaojun Computer Center Anyang Normal University Anyang Henan South Korea

Service Oriented Architecture (SOA) is a distributed software architecture model which use software resource as service on network, realize real platform independence and language independence. This article present summary architecture and designing idea of E-learning system of SOA which created based face service architecture, for example, online testing service registration operation, introduce detail reality method of implement service contract WSDL. E-learning system based on SOA can strengthen real time mutual in teaching, integration varies resources of computer teaching, elevating usage rate of education resource.

关键词： Electronic learning Semiconductor optical amplifiers Service oriented architecture Computer architecture Contracts Computer networks distributed computing Software architecture Education Application software

来源：评论

学校读者我要写书评

暂无评论

Investigating of Probabilistic Load Balancing Algorithms in Grid computing

Investigating of Probabilistic Load Balancing Algorithms in ...

引用

2010 2nd international conference on Education Technology and Computer(第二届IEEE教育技术与计算机国际会议 ICETC 2010)

作者： Raheleh Safaeipour Mehdi Nikkhah Mohsen Moradi Computer Science Islamic Azad University Beyza Fars Iran Computer Science Islamic Azad University Ghier va karzin Fars Iran

The computing grid is a distributed parallel processing system that share and choosing resources dynamically and provide need of user operation power, cost and *** management resources does as a diagnostic and assigning resources scheduling and resource monitoring in grid. Scheduling process directs tasks to suitable resources. It must take place somehow that load work distributed equally on resources to get the maximum interest out of existed resource, establishing load balancing is one the important performance factors in grid resource management efficiency, in this paper, a model in accordance with tree and probabilistic scheduling algorithms with load balancing purpose was suggested, that in this algorithm class of work, cost, deadline and herd behavior have considered. We investigate the probability of a resource success in different algorithms in accordance with complete time, execute time and cost. Probabilistic algorithms chooses the resources that have better past and leave the duties to it, in case of execution or nonexecution on the resource the source will give a reward or punishment.

关键词： computing grid load balancing tree model probable

来源：评论

学校读者我要写书评

暂无评论

Design and analysis of heartbeat protocol in NIDS cluster

Design and analysis of heartbeat protocol in NIDS cluster

引用

The 2010 2nd international conference on Future Computer and Communication(第二届未来计算机与通信国际会议 ICFCC 2010)

作者： Wei Huang Gengyu Wei Nan Hu Yixian Yang Key Laboratory of network and information attack & defense technology of MOE BUPT National Engineering Laboratory for Disaster Backup and Recovery BUPT Beijing China

ISBN: (纸本)9781424458219;9781424458240

Heartbeat mechanism is widely used in designing high availability distributed syste, while publishsubscribe architectural style has recently emerged as a promising approach to build a NIDS cluster with high dynamism and plenty of computational resources. In comparison with the requirements of general distributed computing, frontend in NIDS cluster cannot redistribute tasks on nodes failure and parallel stateful intrusion detection additionally requires the integrity of received session packets on analyzers. Therefore, the contradictory requirements of immediate node failure notification and infrequent analyzer status variation should be both considered. In this contribution, we designed one heartbeat protocol with four variations in publish-subscribe framework. By applying probabilistic model checking on the proposed heartbeat protocol, uptime ratio of one node in different variations is computed and compared under different setups. Suggestions on how to choose a suitable heartbeat for a NIDS cluster is described as well.

关键词： heartbeat NIDS cluster high availability distributed computing probabilistic model checking PRISM

来源：评论

学校读者我要写书评

暂无评论

Mobile-friendly Peer-to-Peer client routing using out-of-band signaling

Mobile-friendly Peer-to-Peer client routing using out-of-ban...

引用

IEEE international Symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Wei Wu Jim Womack Xinhua Ling Advanced Technology Research In Motion Limited Irving TX USA BlackBerry System Architecture Research Research In Motion Limited Waterloo ONT Canada

ISBN: (纸本)9781424465330

It is expected that Peer-to-Peer (P2P) services will co-exist with the client-server based services such as IMS. Mobile users may subscribe to the traditional wireless cellular services while participating in P2P overlay networks. In this paper, a method is proposed to reduce the signaling overhead in a mobile P2P system. With the help of the underlying infrastructure, a mobile device in the P2P overlay can be located using out-of-band non-P2P signaling. This reduces its P2P signaling for location update while a mobile device is changing the point of attachment in the P2P overlay. As the signaling cost depends on both the client's mobility and traffic models, an analytical model has been developed to determine the optimal threshold for the registration update. Analytical results have shown that the proposed method could save up to 70% signaling cost when the Call-to-Mobility Ratio (CMR) is low. On the other hand, it would be better to fall back to the base client routing method when the CMR is high, i.e., perform the registration update whenever the client changes the point of attachment in the P2P overlay.

关键词： Peer to peer computing Routing protocols Internet Analytical models Handheld computers Wireless networks Cellular networks Cost function Traffic control Signal analysis

来源：评论

学校读者我要写书评

暂无评论

UREA: Uncovered Region Exploration Algorithm for reorganization of mobile sensor nodes to maximize coverage

UREA: Uncovered Region Exploration Algorithm for reorganizat...

引用

IEEE international conference on distributed computing in Sensor Systems Workshops (DCOSSW)

作者： Manisha J. Nene Rajendra S. Deodhar Lalit M. Patnaik Department of Applied Mathematics Defence Institute of Advanced Technology Pune India

The recent advances in radio and embedded system technologies have enabled the proliferation of wireless microsensor networks. Such wirelessly connected sensors are released in many diverse environments to perform various monitoring tasks. The effectiveness of these networks is determined to a large extent by the coverage provided by the sensor deployment. The positioning of sensors affect coverage, communication cost and resource management. In this paper we investigate two important aspects of non deterministic sensor node deployment in sensor network. We present a new algorithm called Uncovered Region Exploration Algorithm UREA as a sensor deployment strategy to enhance the coverage after an initial random deployment of sensors. UREA decides a new location based on the uncovered region around the node in consideration. Virtual Force Algorithm VFA designed for the same purpose, calculates new locations of a sensor node based on the locations of the remaining nodes. The performance of UREA is compared with that of VFA. It was observed that with the same number of sensor nodes, UREA provides better coverage than that by VFA in less number of iterations. UREA is found to be consistent and robust. During simulation, it is assumed that the sensor network is a bounded, homogeneous and mobile ad-hoc network. Once the effective sensor positions are identified, a one-time movement of each node is carried out to redeploy the sensors at these new positions. Simulation results clearly show that this onetime displacement of sensor benefits the deployed network so as to improve coverage. In non deterministic deployments, mobility feature of the mobile ad-hoc network can be best exploited to reposition the sensors so as to achieve the best network coverage.

关键词： Sensors Clustering algorithms Algorithm design and analysis Mobile communication Mobile computing Computational modeling Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Overlays with preferences: Approximation algorithms for matching with preference lists

Overlays with preferences: Approximation algorithms for matc...

引用

international Symposium on parallel and distributed Processing (IPDPS)

作者： Giorgos Georgiadis Marina Papatriantafilou Department of Computer Science and Engineering Chalmers University of Technology Göteborg Sweden

A key property of overlay networks, that is going to play an important part in future networking solutions, is the peers' ability to establish connections with other peers based on some suitability metric related to e.g. the node's distance, interests, recommendations, transaction history or available resources. Each node may choose individually an appropriate metric and try to connect or be matched with the available peers that it considers best. When there are no preference cycles among the peers, it has been proven that a stable matching exists, where peers have maximized the individual satisfaction gleaned of their choices. However, no such guarantees are currently being given for the cases where cycles may exist and known methods may not be able to resolve ¿oscillations¿ in preference-based connectivity and reach stability. In this work we employ the use of node satisfaction to move beyond classic stable matchings and towards the overlay network context. We present a simple yet powerful distributed algorithm that uses aggregate satisfaction as an optimization metric. The algorithm is a generalization of an approximation one-to-one matching algorithm, into the many-to-many case. We prove that the total satisfaction achieved by our algorithm is a constant factor approximation of the maximum total satisfaction in the network, depending also on the maximum number of possible connections of a peer in the overlay.

关键词： Approximation algorithms Peer to peer computing Computer science Marine technology History distributed algorithms Stability Aggregates Resource management Collaboration

来源：评论

学校读者我要写书评

暂无评论

Comparison of Load Balancing Algorithms in a Grid

Comparison of Load Balancing Algorithms in a Grid

引用

international conference on Data Storage and Data Engineering (DSDE)

作者： Janhavi Arvind Baikerikar Sunil K. Surve Sapna U. Prabhu Information Technology Dept. Don Bosco Institute of Technology Mumbai India Computer Dept. Fr. Conceicao Rodrigues College of Engineering Mumbai India Electronics Dept. Fr. Conceicao Rodrigues College of Engineering Mumbai India

The ever changing demands on the computational resources have generated the need for solutions that are more flexible. Using a ¿bigger box¿ that has more and faster processors and permanent storage or more random access memory (RAM) is not a viable solution as the system usage patterns vary. A grid based distributed system can solve this problem by allowing multiple independent jobs to run over a network of heterogeneous computing nodes. Keeping the workload represented by these jobs balanced over the network of computers requires network-aware load balancing algorithms that are dynamic and quick. The objective of this paper work is to review the different load balancing algorithms for the grid, identify the comparison metrics for the load balancing algorithms and to carry out comparison between these algorithms based on these identified metrics.

关键词： Load management Grid computing distributed computing Educational institutions Computer networks Runtime Data engineering Information technology Random access memory Read-write memory

来源：评论

学校读者我要写书评

暂无评论

An Efficient Self-healing Key Distribution Scheme with Constant-size Personal Keys for Wireless Sensor networks

An Efficient Self-healing Key Distribution Scheme with Const...

引用

IEEE international conference on Communications

作者： Song Han Biming Tian Y. Zhang J. Hu Curtin University of Technology Australia Victoria University Australia RMIT University Australia

The availability of group communications over inexpensive wireless networks has facilitated new types of applications and created new security challenges. One of the security challenges is how to securely distribute session keys over wireless networks. Self-healing key distribution mechanism is an ideal countermeasure for enabling session key distribution and recovery. In order to address the issue that personal keys could not be reused if more than a threshold number of nodes are revoked in self-healing key distribution schemes, a new self-healing key distribution scheme using bilinear pairings is proposed in this paper. Another motivation for developing this new scheme is to reduce computation cost in some existing ID-based self-healing key distribution schemes. The new scheme enables users to have constant size personal keys. The personal key of each user can be reused as long as it is not disclosed. Further, any coalition of non-authorized users can not recover the session keys. That is, the scheme is collusion-free secure. The ID-based scheme can support key management by mitigating the certificate management overload. Additional advantage includes sliding-window mechanism can be applied to our scheme such that it is unnecessary to determine the number of sessions during the Setup procedure.

关键词： Wireless sensor networks Wireless networks Broadcasting Telecommunication traffic Mobile communication Communications Society Paper technology Peer to peer computing distributed computing Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 194 195 196 197 198 199 200 201 202 203 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：