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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

608 篇 会议
9 篇 期刊文献
3 册 图书

馆藏范围

620 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

341 篇 工学
- 332 篇 计算机科学与技术...
- 204 篇 软件工程
- 122 篇 信息与通信工程
- 34 篇 电气工程
- 25 篇 控制科学与工程
- 24 篇 电子科学与技术（可...
- 8 篇 动力工程及工程热...
- 8 篇 测绘科学与技术
- 7 篇 机械工程
- 7 篇 建筑学
- 6 篇 生物工程
- 5 篇 光学工程
- 5 篇 安全科学与工程
- 3 篇 力学（可授工学、理...
- 3 篇 土木工程
- 3 篇 生物医学工程（可授...
- 2 篇 仪器科学与技术
109 篇 理学
- 90 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 9 篇 物理学
- 9 篇 生物学
- 5 篇 化学
- 2 篇 大气科学
- 2 篇 地球物理学
76 篇 管理学
- 51 篇 管理科学与工程(可...
- 43 篇 工商管理
- 27 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
4 篇 医学
- 4 篇 临床医学
2 篇 法学
1 篇 教育学
1 篇 农学

主题

174 篇 distributed comp...
111 篇 computer network...
100 篇 software enginee...
93 篇 artificial intel...
73 篇 concurrent compu...
55 篇 computer science
47 篇 grid computing
47 篇 distributed comp...
45 篇 peer to peer com...
39 篇 application soft...
31 篇 parallel process...
31 篇 wireless sensor ...
30 篇 network topology
29 篇 parallel process...
29 篇 delay
28 篇 costs
25 篇 algorithm design...
25 篇 large-scale syst...
24 篇 protocols
23 篇 resource managem...

机构

3 篇 department of co...
3 篇 department of co...
3 篇 school of inform...
3 篇 national laborat...
3 篇 institute of com...
3 篇 school of comput...
3 篇 school of comput...
2 篇 univ sci & techn...
2 篇 huazhong univ sc...
2 篇 department of co...
2 篇 univ adelaide sc...
2 篇 school of comput...
2 篇 univ technol syd...
2 篇 department of co...
2 篇 school of manage...
2 篇 sharif universit...
2 篇 school of comput...
2 篇 lab. com. phys. ...
2 篇 natl univ def te...
2 篇 school of comput...

作者

4 篇 xicheng lu
4 篇 aaron harwood
4 篇 nong xiao
3 篇 shietung peng
3 篇 hong chen
3 篇 rui chu
3 篇 wenhong wei
3 篇 yongxuan lai
3 篇 huanguo zhang
3 篇 engelmann christ...
3 篇 gerald kunzmann
3 篇 wenjun xiao
2 篇 nandi asoke k.
2 篇 xing-ming li
2 篇 choi k.
2 篇 ling zhang
2 篇 wu cheng
2 篇 lo re giuseppe
2 篇 kodama eiichiro
2 篇 brzezinski krzys...

语言

620 篇 英文

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

共 620 条记录，以下是591-600 订阅

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

详细简洁

排序：

A cooperative game theoretical replica placement technique

A cooperative game theoretical replica placement technique

引用

international conference on parallel and distributed Systems (ICPADS)

作者： Samee Ullah Khan Ishfaq Ahmad Electrical and Computer Engineering Colorado State University USA Computer Science and Engineering University of Texas Arlington USA

Creating replicas of frequently accessed data objects across a read intensive network can lead to reduced communication cost and end-user response time. On the contrary, data replication in the presence of writes incurs extra cost due to multiple updates. The selection of data objects and servers requires solving a constraint optimization problem, which is NP-complete in general. A majority of the current state-of-the-art replica placement techniques suffer from high computational complexity issues. To circumvent such issues, we propose a cooperative game theoretical technique in which the servers (players) in the system collectively deliberate to converge at a replica schema that is beneficial to the system as a whole. In particular we make use of the Aumann-Shapley mechanism of cooperative game theory to propose an effective replica placement technique that yields good solutions when the system is very heavily loaded. Experimental comparisons are made against: (1) branch and bound, (2) greedy, (3) genetic, (4) Dutch auction, and (5) English auction. As demonstrated by the experimental results, the proposed technique maintains superior solution quality in terms of lower communication cost and reduced execution time.

关键词： Game theory Cost function Data engineering Delay Network servers Computational complexity distributed computing Computer networks Computer science Constraint optimization

来源：评论

学校读者我要写书评

暂无评论

FairTrust: Toward secure and high performance P2P networks

FairTrust: Toward secure and high performance P2P networks

引用

international conference on parallel and distributed Systems (ICPADS)

作者： Haiying Shen Yingwu Zhu Department of Computer Science and Engineering University of Arkansas Fayetteville AR USA Department of Computer Science & Software Engineering Seattle University Seattle WA USA

Peer-to-peer (P2P) networks are becoming increasingly popular and are an exciting new class of innovative, internet-based resource sharing systems. In a P2P network, a reputation system is essential to evaluate the trustworthiness of participating peers and to combat the selfish, dishonest, and malicious peer behaviors. The system collects locally-generated peer feedbacks and aggregates them to yield the global reputation values to represent peer trustworthiness. Reputation system guides peers in choosing a server for services/resources. Most of the approaches for peers to exploit reputation metrics are to select the one with the highest reputation value as a providing server. However, it may lead to unexpectedly low efficiency for high-reputed peers, and prevents P2P networks from taking full advantage of all resources for high performance. Other approaches restrict a peer to select a server in the same or lower reputation values. However, these approaches prevent P2P networks from achieving their goal of widely resource sharing and service exchanges. In this paper, we introduce a trust-based fairness-oriented server selection policy, FairTrust, for a peer to choose another peer to interact. FairTrust takes into account both reputation and capacity factors in server selection. It helps to create a secure P2P communication environment, and meanwhile to take full advantage of system resources for high performance by fair load distribution. Simulation results show the superiority of the FairTrust policy in achieving both high security and high performance in P2P networks in comparison with other related policies.

关键词： Peer to peer computing Resource management Network servers Application software Internet Telecommunication traffic Scalability File servers Computer science Feedback

来源：评论

学校读者我要写书评

暂无评论

Efficient Simulation of Large-Scale P2P networks: Modeling Network Transmission Times

Efficient Simulation of Large-Scale P2P Networks: Modeling N...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Gerald Kunzmann Robert Nagel Tobias Hossfeld Andreas Binzenhofer Kolja Eger Institute of Communication Networks Technical University of Munich Germany Institute of Communication Networks Technical University Munich Germany Institute of Computer Science University of Würzburg Germany Department of Communication Networks Hamburg University of Technology (TUHH) Germany

The ongoing process of globalization leads to a huge demand for highly scalable applications that are able to deal with millions of participants distributed all over the world. Peer-to-peer (P2P) technology enables an arbitrary large number of users to participate in distributed services like content distribution or collaboration tools. In order to verify a new protocol's performance and scalability simulation is a commonly used tool. First, predicting the network and peer behavior in the real world is only feasible if the simulation, i.e. all applied models as well as the peer state, is as realistic as possible. Second, many properties of the system only become observable when the number of participants is sufficiently large. Therefore, verifying the scalability of a system requires simulating huge worldwide networks. Due to limited processing power, central memory and availabe time, both requirements can only be fullfilled if the applied models are very efficient. In this paper we take a closer look at the network layer. We compare the most commonly-used network models and present a very efficient model for applying real-world network transmission times in large scale simulations

关键词： Large-scale systems Peer to peer computing Computational modeling Protocols Network topology Scalability Power system modeling Computer networks IP networks Communication networks

来源：评论

学校读者我要写书评

暂无评论

LORM: Supporting low-overhead P2P-based range-query and multi-attribute resource management in grids

LORM: Supporting low-overhead P2P-based range-query and mult...

引用

international conference on parallel and distributed Systems (ICPADS)

作者： Haiying Shen Amy Apon Cheng-Zhong Xu Department of Computer Science and Engineering University of Arkansas Fayetteville AR USA Department of Electrical & Computer Engineering Wayne State University Detroit MI USA

Resource management is critical to the usability and accessibility of grid computing systems. Conventional approaches to grid resource discovery are either centralized or hierarchical, and these prove to be inefficient as the size of the grid system increases. The peer-to-peer (P2P) paradigm has been applied to grid systems as a mechanism for providing scalable range- query and multi-attribute resource management. However, most current P2P-based resource management approaches support multi-attribute range queries at a high cost. They either depend on multiple P2P networks with each P2P network responsible for a single attribute, or they keep the resource information of all attributes in a single node. This paper presents a low-overhead range-query multi-attribute P2P-based resource management approach, LORM. Unlike other P2P-based approaches, it relies on a single P2P network and allocates resource information to different nodes based on resource attributes and values. Moreover, it has high capability to handle the large-scale and dynamic characteristics of resources in grids. Simulation results demonstrate the efficiency of LORM in comparison with other resource management approaches in terms of resource management overhead and resource discovery efficiency.

关键词： Resource management Peer to peer computing Grid computing Costs Large-scale systems Application software Floods Usability Quality of service Performance analysis

来源：评论

学校读者我要写书评

暂无评论

A Min-Min Max-Min selective algorihtm for grid task scheduling

A Min-Min Max-Min selective algorihtm for grid task scheduli...

引用

IEEE/IFIP international conference in Central Asia on Internet (ICI)

作者： Kobra Etminani M. Naghibzadeh Department of Computer Engineering Ferdowsi University of Mashhad Mashhad Iran

Today, the high cost of supercomputers in the one hand and the need for large-scale computational resources on the other hand, has led to use network of computational resources known as Grid. Numerous research groups in universities, research labs, and industries around the world are now working on a type of Grid called Computational Grids that enable aggregation of distributed resources for solving large-scale data intensive problems in science, engineering, and commerce. Several institutions and universities have started research and teaching programs on Grid computing as part of their parallel and distributed computing curriculum. To better use tremendous capabilities of this distributed system, effective and efficient scheduling algorithms are needed. In this paper, we introduce a new scheduling algorithm based on two conventional scheduling algorithms, Min-Min and Max-Min, to use their cons and at the same time, cover their pros. It selects between the two algorithms based on standard deviation of the expected completion time of tasks on resources. We evaluate our scheduling heuristic, the Selective algorithm, within a grid simulator called GridSim. We also compared our approach to its two basic heuristics. The experimental results show that the new heuristic can lead to significant performance gain for a variety of scenarios.

关键词： Grid computing Scheduling algorithm Job shop scheduling Large-scale systems Computer networks Educational institutions distributed computing Processor scheduling Costs Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Scalable Content-Based Publish/Subscribe Services over Structured Peer-to-Peer networks

Scalable Content-Based Publish/Subscribe Services over Struc...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Xiaoyu Yang Yingwu Zhu Yiming Hu Department of ECECS University of Cincinnati USA Department of CSSE University of Seattle USA

The scalability has remained a challenge in the design of distributed publish/subscribe systems. In this paper we propose a novel solution to address this problem in content-based pub/sub systems on top of distributed hash table. The main objective is to ensure an appropriate amount of rendezvous point nodes in the system, as well as maintain an even load distribution among them. An attribute-vector based publish/subscribe scheme and related load balancing mechanisms (ID space partitioning, attribute grouping, dynamic ID space split-merge) are proposed to achieve this goal. The experimental results show that our approaches can achieve a good scalability by efficiently distribute/balance load among an adaptive quantity of rendezvous point nodes, while retaining very small overhead and latency

关键词： Peer to peer computing Scalability Delay Subscriptions Load management Large-scale systems Algorithm design and analysis Aggregates Partitioning algorithms Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Self-Organizing Services for Browsing the World: Challenges and Directions

Self-Organizing Services for Browsing the World: Challenges ...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Franco Zambonelli Dipartimento di Scienze e Metodi dell'Ingegneria Università di Modena e Reggio Emila Italy

Summary form only given. The imminent mass deployment of pervasive computing technologies such as sensor networks and RFID tags, together with the increasing participation of the Web community in feeding geo-located information within tools such as Google Earth, will soon make available an incredible amount of information about the physical and social worlds and their processes. Overall, both the above trends contribute to the forming of a decentralized infrastructure that, by accumulating and making available in a ubiquitous way detailed digital information about the surrounding world, opens up the possibility of conceiving innovative context-aware services for "browsing the world" around us, as well as of enhancing the quality and effectiveness of current ICT services via context-awareness and dynamic personalization. However, this will also introduce a dramatic complexity increase in data and service management, making impossible for humans to stay in the control loop and directly manage the configuration and functioning of these systems, and compulsory calling for unsupervised self-organizing approaches at both the data and the service level. On the one hand, proper self-organizing approaches must be defined for processing and aggregating large amounts of data into a meaningful and manageable "world model" to be made available to services. On the other hand, proper distributed computing models and infrastructures must be defined to enable services to exploit such information to self-organize their distributed and context-aware activities at the best. In this talk, after having introduced my general vision of future pervasive computing scenarios, I try to identify the key research challenges that should be faced towards the effective provisioning of self-organizing and context-aware services in such scenarios, and will sketch some possibly promising research directions currently being investigated within the "Agents and Pervasive computing Group" of the Universit

关键词： Context-aware services Pervasive computing RFID tags Earth Humans Control systems distributed computing Context modeling Face detection

来源：评论

学校读者我要写书评

暂无评论

Smart Carpet: A Footstep Tracking Interface

Smart Carpet: A Footstep Tracking Interface

引用

international conference on Advanced Information Networking and Applications Workshops (AINAW)

作者： Domnic Savio Thomas Ludwig AIM ADS TI Infineon Technologies Neubiberg Germany Department of Parallel Distributed Systems University of Heidelberg Heidelberg Germany

distributed computing infrastructures provided by sensor networks supports new ways of observing human motion. In this paper, we discuss algorithms that use data from sensor networks for tracking the gait of human walk. Three methods for identifying footsteps and footstep patterns that describe a walk of a subject are discussed. The methods interpret the data into a set of coordinates that represent a trajectory of the subject's walk. The results show that the proposed methods are more accurate and cost less than existing methods.

关键词： Tiles Intelligent sensors Humans Tracking Sensor systems Costs Legged locomotion Transmitters Optical receivers Motion detection

来源：评论

学校读者我要写书评

暂无评论

Efficient search in file-sharing networks

Efficient search in file-sharing networks

引用

international conference on parallel and distributed Systems (ICPADS)

作者： Paul Burstein Alan Jay Smith Computer Science Division EECS Department University of California Berkeley Berkeley CA USA

Currently, the most popular file-sharing applications have used either centralized or flood-based search algorithms. Napster has been successful in providing a centralized index with presumably perfect query recall. Succeeding, more distributed protocols like Gnutella and Kazaa have used flood-based search procedures in which a query is propagated through an unstructured network. Query result quality in such networks suffers as queries for items that are rare have high probabilities of not being found as the entire corpus is not covered during a search. In this paper, we present a new and improved implementation of a distributed file-sharing system yielding (1) query result quality better than flooding and close to a centralized index, and (2) low-maintenance network overhead. These improvements result from our optimized approaches to (a) high churn rates (clients and servers frequently entering and leaving the system) and (b) skewed workloads (high variation in access frequencies vs. key). High churn rates are addressed by keeping all data in soft state, which is periodically refreshed, such that the loss of a server or client is quickly reflected in the indexes; higher refresh rates imply fewer false positives. Skewed workloads are load balanced with the use of a layer of indirection for placing and locating data, such that data is partitioned and distributed based on the frequency of use. A trace-driven prototype evaluation based on Gnutella system traces shows that our prototype implementation achieves a low network bandwidth, attains max-average load ratios within a factor of three across all servers, and has positive recall values for over 90% of all queries, despite a high churn rate; the recall would be 100% absent churn.

关键词： Peer to peer computing Prototypes Protocols Load management Application software Network servers Frequency Internet Publishing Computer science

来源：评论

学校读者我要写书评

暂无评论

BitTorrent Worm Sensor Network : P2P Worms Detection and Containment

BitTorrent Worm Sensor Network : P2P Worms Detection and Con...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Sinan Hatahet Yacine Challal Abdelmadjid Bouabdallah Heudiasyc UMR 6599 Université de Technologie de Compiegne Compiegne France

Peer-to-peer (p2p) networking technology has gained popularity as an efficient mechanism for users to obtain free services without the need for centralized servers. Protecting these networks from intruders and attackers is a real challenge. One of the constant threats on P2P networks is the propagation of active worms. In 2007, Worms have caused damages worth the amount of 8,391,800 USD in the United States alone. Nowadays, BitTorrent is becoming more and more popular, mainly due to its fair load distribution mechanism. Unfortunately, BitTorrent is particularly vulnerable to active worms. In this paper, we propose a novel worm detection system in BitTorrent and evaluate it. We show that our solution can detect various worm scans before 1% of the vulnerable hosts are infected in worst case scenarios. Our solution, the BitTorrent worm sensor network, is built over a network of immunized agents, which their main job is to efficiently stop worm spread in BitTorrent.

关键词： Peer to peer computing Internet Network servers Telecommunication traffic Protection Availability Scalability Costs Fault tolerance Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共62页 << < 53 54 55 56 57 58 59 60 61 62 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：