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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

314 篇 会议
100 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

237 篇 工学
- 201 篇 计算机科学与技术...
- 149 篇 软件工程
- 49 篇 信息与通信工程
- 29 篇 电气工程
- 21 篇 控制科学与工程
- 20 篇 生物工程
- 13 篇 生物医学工程（可授...
- 10 篇 电子科学与技术（可...
- 9 篇 安全科学与工程
- 8 篇 力学（可授工学、理...
- 8 篇 动力工程及工程热...
- 8 篇 环境科学与工程（可...
- 7 篇 建筑学
- 7 篇 交通运输工程
- 5 篇 机械工程
97 篇 理学
- 66 篇 数学
- 23 篇 生物学
- 15 篇 物理学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 7 篇 化学
69 篇 管理学
- 37 篇 管理科学与工程(可...
- 35 篇 图书情报与档案管...
- 25 篇 工商管理
11 篇 法学
- 9 篇 社会学
9 篇 医学
- 9 篇 基础医学(可授医学...
- 9 篇 临床医学
- 7 篇 公共卫生与预防医...
7 篇 经济学
- 7 篇 应用经济学
7 篇 教育学
- 7 篇 教育学
3 篇 农学
1 篇 文学

主题

63 篇 computer science
30 篇 application soft...
25 篇 computer archite...
24 篇 educational inst...
19 篇 computational mo...
18 篇 protocols
17 篇 distributed comp...
16 篇 middleware
14 篇 hardware
13 篇 peer to peer com...
13 篇 software enginee...
12 篇 runtime
11 篇 real time system...
11 篇 internet
10 篇 concurrent compu...
10 篇 pervasive comput...
10 篇 bandwidth
10 篇 monitoring
10 篇 control systems
9 篇 parallel process...

机构

33 篇 distributed syst...
14 篇 distributed syst...
12 篇 distributed syst...
10 篇 institute of par...
7 篇 distributed syst...
7 篇 parallel and dis...
7 篇 parallel computi...
6 篇 computer network...
6 篇 distributed syst...
6 篇 school of electr...
6 篇 service oriented...
5 篇 distributed and ...
5 篇 distributed syst...
4 篇 center for appli...
4 篇 shanghai key lab...
4 篇 laboratory schoo...
4 篇 faculty of compu...
4 篇 parallel and dis...
4 篇 inst. f. theoret...
4 篇 distributed syst...

作者

22 篇 cahill vinny
22 篇 v. cahill
18 篇 dustdar schahram
11 篇 chen haibo
8 篇 buyya rajkumar
7 篇 middendorf marti...
7 篇 vinny cahill
7 篇 schahram dustdar
7 篇 wang zhaoguo
7 篇 a. boukerche
6 篇 wieseke nicolas
6 篇 rana omer
6 篇 gill sukhpal sin...
6 篇 li jinyang
6 篇 merkle daniel
5 篇 guan haibing
5 篇 clarke siobhán
5 篇 stadler peter f.
5 篇 zang binyu
5 篇 thomas fahringer

语言

415 篇 英文
7 篇 其他
1 篇 中文

检索条件"机构=Parallel and Distributed Systems Group Department of Computer Science"

共 423 条记录，以下是91-100 订阅

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

详细简洁

排序：

Issues of security and network security in health care information systems

Issues of security and network security in health care infor...

引用

作者： Patel, Ahmed Kantzavelou, Ioanna Computer Networks and Distributed Systems Research Group Department of Computer Science University College Dublin Belfield Dublin 4 Ireland

A Health Care Establishment (HCE) is an establishment where medical services are rendered. The above services are provided by the health care personnel. The infrastructure of a HCE may include Information Technology (IT) equipment that stores and processes HC information. Previously, IT equipment consisted solely of stand-alone systems, whereas in recent years, the trend has been towards computer networks and distributed systems in HCEs. The spread of distributed information technology in HCEs have necessitated the implementation of Security in HCISs, to assure confidentiality, integrity and availability of HCE information. This paper discusses the issues of Security and Network Security in Health Care Information systems (HCISs). It also suggests a method in establishing Network Security Guidelines and describes Principles for the provision of Network Security in HCEs. © 1996, The SEISMED Consortium.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Detection of botnet collusion by degree distribution of domains

Detection of botnet collusion by degree distribution of doma...

引用

作者： Burghouwt, Pieter Spruit, Marcel Sips, Henk Research Group Information Security Hague University of Applied Sciences Netherlands Parallel and Distributed Group Department of Computer Science Delft University of Technology Netherlands

ISBN: (纸本)9781424488629

Malicious botnets threaten the Internet by DDoS-attacks, spam, information theft and other criminal activities. They are using increasingly sophisticated techniques to hide the Command and Control traffic. Many existing detection techniques can be defeated by encryption, tunneling in popular protocols, delays, and flow perturbation. We introduce a new DNS-based detection approach, that detects botnet collusion by anomalies in the degree distribution of visited domains, without any assumption about message content and statistical properties of the traffic. The proposed technique is difficult to evade, without major changes in the bot Command and Control Infrastructure or reduced utility. We evaluate evasion possibilities, derive a theoretical model of the detector performance and test the detector with a combination of captured Internet traffic and simulated botnet-traffic.

关键词： Botnet

来源：评论

学校读者我要写书评

暂无评论

Improving Accuracy and Coverage in an Internet-Deployed Reputation Mechanism

Improving Accuracy and Coverage in an Internet-Deployed Repu...

引用

International Conference on Peer-to-Peer Computing

作者： R. Delaviz N. Andrade J. A. Pouwelse Parallel and Distributed Systems Group Department of Computer Science Delft University of Technnology Netherlands

P2P systems can benefit from reputation mechanisms to promote cooperation and help peers to identify good service providers. However, in spite of a large number of proposed reputation mechanisms, few have been investigated in real situations. BarterCast is a distributed reputation mechanism used by our Internet-deployed Bittorent-based file-sharing client Tribler. In BarterCast, each peer uses messages received from other peers to build a weighted, directed subjective graph that represents the upload and download activity in the system. A peer calculates the reputations of other peers by applying the maxflow algorithm to its subjective graph. For efficiency reasons, only paths of at most two hops are considered in this calculation. In this paper, we identify and assess three potential modifications to BarterCast for improving its accuracy and coverage (fraction of peers for which a reputation value can be computed). First, a peer executes maxflow from the perspective of the node with the highest betweenness centrality in its subjective graph instead of itself. Second, we assume a gossiping protocol that gives each peer complete information about upload and download activities in the system, and third, we lift the path length restriction in the maxflow algorithm. To assess these modifications, we crawl the Tribler network and collect the upload and download actions of the peers for three months. We apply BarterCast with and without the modifications on the collected data and measure accuracy and coverage.

关键词： Peer to peer computing Accuracy Crawlers Protocols Testing Training Measurement

来源：评论

学校读者我要写书评

暂无评论

Modeling and analysis of bandwidth-inhomogeneous swarms in BitTorrent

Modeling and analysis of bandwidth-inhomogeneous swarms in B...

引用

International Conference on Peer-to-Peer Computing

作者： M. Meulpolder J. A. Pouwelse D. H. J. Epema H. J. Sips Parallel and Distributed Systems Group Department of Computer Science Delft University of Technnology Netherlands

ISBN: (纸本)9781424450664

A number of analytical models exists that capture various properties of the BitTorrent protocol. However, until now virtually all of these models have been based on the assumption that the peers in the system have homogeneous bandwidths. As this is highly unrealistic in real swarms, these models have very limited applicability. Most of all, these models implicitly ignore BitTorrent's most important property: peer selection based on the highest rate of reciprocity. As a result, these models are not suitable for understanding or predicting the properties of real BitTorrent networks. Furthermore, they are hardly of use in the design of realistic BitTorrent simulators and new P2P protocols. In this paper, we extend existing work by presenting a model of a swarm in BitTorrent where peers have arbitrary upload and download bandwidths. In our model we group peers with (roughly) the same bandwidth in classes, and then analyze the allocation of upload slots from peers in one class to peers in another class. We show that our model accurately predicts the bandwidth clustering phenomenon observed experimentally in other work, and we analyze the resulting data distribution in swarms. We validate our model with experiments using real BitTorrent clients. Our model captures the effects of BitTorrent's well-known `tit-for-tat' mechanism in bandwidth-inhomogeneous swarms and provides an accurate mathematical description of the resulting dynamics.

关键词： Bandwidth Protocols Predictive models Mathematical model Peer to peer computing computer science Internet Mechanical factors Fluid dynamics Analytical models

来源：评论

学校读者我要写书评

暂无评论

Modeling and Analysis of Sharing Ratio Enforcement in Private BitTorrent Communities

Modeling and Analysis of Sharing Ratio Enforcement in Privat...

引用

IEEE International Conference on Communications (ICC)

作者： Adele L. Jia Lucia D'Acunto Michel Meulpolder Johan A. Pouwelse Parallel and Distributed Systems Group Department of Computer Science Delft University of Technology Netherlands

Providing incentives for user contribution has been one of the primary design goals of Peer-to-Peer systems. The newly-emerged BitTorrent private communities adopt Sharing Ratio Enforcement (SRE) on top of BitTorrent's incentive mechanism, Tit-For-Tat, in order to strictly enforce a minimum contribution a member has to provide, in relation to the amount of service it has received. In this paper, we provide a theoretical model to analyze 1) how SRE provides seeding incentives, and 2) how SRE influences the download performance in the system. Specifically, we study the influence of the SRE threshold (i.e., the minimum sharing ratio requirement) and the bandwidth heterogeneity of the peers in the system. In our analysis, we assume users to be rational, i.e., peers seed only the minimum amount required by SRE, and we show that the download performance as predicted by our model represents a lower bound for the actual performance that can be reached in a BitTorrent private community. Hence, following our model, community administrators can predict the minimum performance level their systems will be able to reach.

关键词： Thin film transistors Communities Analytical models Bandwidth Peer to peer computing Mathematical model Steady-state

来源：评论

学校读者我要写书评

暂无评论

BarterCast: A practical approach to prevent lazy freeriding in P2P networks

BarterCast: A practical approach to prevent lazy freeriding ...

引用

International Symposium on parallel and distributed Processing (IPDPS)

作者： M. Meulpolder J.A. Pouwelse D.H.J. Epema H.J. Sips Parallel and Distributed Systems Group Department of Computer Science Delft University of Technnology Netherlands

A well-known problem in P2P systems is freeriding, where users do not share content if there is no incentive to do so. In this paper, we distinguish lazy freeriders that are merely reluctant to share but follow the protocol, versus die-hard freeriders that employ sophisticated methods to subvert the protocol. Existing incentive designs often provide theoretically attractive resistance against die-hard freeriding, yet are rarely deployed in real networks because of practical infeasibility. Meanwhile, real communities benefit greatly from prevention of lazy freeriding, but have only centralized technology available to do so. We present a lightweight, fully distributed mechanism called BARTERCAST that prevents lazy freeriding and is deployed in practice. BarterCast uses a maxflow reputation algorithm based on a peer's private history of its data exchanges as well as indirect information received from other peers. We assess different reputation policies under realistic, trace-based community conditions and show that our mechanism is consistent and effective, even when significant fractions of peers spread false information. Furthermore, we present results of the deployment of BarterCast in the BitTorrent-based Tribler network which currently has thousands of users worldwide.

关键词： Protocols Intelligent networks computer science History Peer to peer computing Proposals Privacy Particle measurements

来源：评论

学校读者我要写书评

暂无评论

Fast download but eternal seeding: The reward and punishment of Sharing Ratio Enforcement

Fast download but eternal seeding: The reward and punishment...

引用

International Conference on Peer-to-Peer Computing

作者： Adele L. Jia Rameez Rahman Tamás Vinkó Johan A. Pouwelse Dick H.J. Epema Parallel and Distributed Systems Group Department of Computer Science Delft University of Technology Netherlands

Many private BitTorrent communities employ Sharing Ratio Enforcement (SRE) schemes to incentivize users to contribute their upload resources. It has been demonstrated that communities that use SRE are greatly oversupplied, i.e., they have much higher seeder-to-leecher ratios than communities in which SRE is not employed. The first order effect of oversupply under SRE is a positive increase in the average downloading speed. However, users are forced to seed for extremely long times to maintain adequate sharing ratios to be able to start new downloads. In this paper, we propose a fluid model to study the effects of oversupply under SRE, which predicts the average downloading speed, the average seeding time, and the average upload capacity utilization for users in communities that employ SRE. We notice that the phenomenon of oversupply has two undesired negative effects: a) Peers are forced to seed for long times, even though their seeding efforts are often not very productive (in terms of low upload capacity utilization); and b) SRE discriminates against peers with low bandwidth capacities and forces them to seed for longer durations than peers with high capacities. To alleviate these problems, we propose four different strategies for SRE, which have been inspired by ideas in social sciences and economics. We evaluate these strategies through simulations. Our results indicate that these new strategies release users from needlessly long seeding durations, while also being fair towards peers with low capacities and maintaining high system-wide downloading speeds.

关键词： Communities Steady-state Peer to peer computing Bandwidth IEEE Communications Society Analytical models Thin film transistors

来源：评论

学校读者我要写书评

暂无评论

Density estimation with adaptive sparse grids for large data sets 14

Density estimation with adaptive sparse grids for large data...

引用

14th SIAM International Conference on Data Mining, SDM 2014

作者： Peherstorfer, Benjamin Pflüger, Dirk Bungartz, Hans-Joachim Aerospace Computational Design Laboratory AeroAstro Massachusetts Institute of Technology United States Simulation of Large Systems Group Institute for Parallel and Distributed Systems University of Stuttgart Germany Scientific Computing Group Department of Computer Science Technische Universität München Germany

ISBN: (纸本)9781510811515

Nonparametric density estimation is a fundamental problem of statistics and data mining. Even though kernel density estimation is the most widely used method, its performance highly depends on the choice of the kernel bandwidth, and it can become computationally expensive for large data sets. WTe present an adaptive sparse-grid-based density estimation method which discretizes the estimated density function on basis functions centered at grid points rather than on kernels centered at the data points. Thus, the costs of evaluating the estimated density function are independent from the number of data points. We give details on how to estimate density functions on sparse grids and develop a cross validation technique for the parameter selection. We show numerical results to confirm that our sparse-grid-based method is well-suited for large data sets, and, finally, employ our method for the classification of astronomical objects to demonstrate that it is competitive to current kernel-based density estimation approaches with respect to classification accuracy and runtime. Copyright © SIAM.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

HSkip+: A self-stabilizing overlay network for nodes with heterogeneous bandwidths 14

HSkip+: A self-stabilizing overlay network for nodes with he...

引用

14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014

作者： Feldotto, Matthias Scheideler, Christian Graffi, Kalman Heinz Nixdorf Institute Department of Computer Science University of Paderborn Germany Theory of Distributed Systems Group Department of Computer Science University of Paderborn Germany Technology of Social Networks Group Department of Computer Science University of Düsseldorf Germany

ISBN: (纸本)9781479962013

In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [1] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates. © 2014 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Using message-based threading for multimedia applications

Using message-based threading for multimedia applications

引用

2001 IEEE International Conference on Multimedia and Expo, ICME 2001

作者： Koster, Rainer Kramp, Thorsten Distributed Systems Group Department of Computer Science University of Kaiserslautern P.O. Box 3049 Kaiserslautern67653 Germany

ISBN: (纸本)0769511988

Components of a complex multimedia application typically work reactively processing events such as notifications from other threads, signals, and network packets. To better support these applications we have built a message-based threading platform providing more flexibilty than event handling with one thread and easier synchronisation than conventional multithreading approaches. Reuse and reconfiguration are facilitated by using a uniform message interface for all types of events. Moreover, scheduling can be based on timing constraints attached to messages rather than to threads. The reimplementation of a multi-stream video player shows the benefits of this approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共43页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：