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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

80 篇 会议
15 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

22 篇 工学
- 17 篇 计算机科学与技术...
- 8 篇 信息与通信工程
- 8 篇 软件工程
- 7 篇 电气工程
- 7 篇 控制科学与工程
- 3 篇 网络空间安全
- 2 篇 机械工程
- 1 篇 电子科学与技术（可...
7 篇 理学
- 4 篇 数学
- 2 篇 系统科学
- 1 篇 大气科学
5 篇 管理学
- 3 篇 管理科学与工程(可...
- 3 篇 工商管理
- 2 篇 图书情报与档案管...
3 篇 经济学
- 1 篇 应用经济学

主题

42 篇 computer network...
24 篇 laboratories
14 篇 ip networks
12 篇 application soft...
10 篇 peer to peer com...
9 篇 energy consumpti...
9 篇 processor schedu...
9 篇 web and internet...
8 篇 computer archite...
8 篇 real time system...
8 篇 internet
7 篇 timing
7 篇 protocols
7 篇 embedded system
7 篇 embedded computi...
6 篇 electronic mail
6 篇 resource managem...
6 篇 intelligent netw...
6 篇 pricing
6 篇 hardware

机构

15 篇 computer enginee...
13 篇 computer enginee...
10 篇 computer enginee...
9 篇 computer enginee...
4 篇 computer enginee...
3 篇 computer enginee...
2 篇 computer enginee...
2 篇 tik eth zürich
2 篇 department of in...
2 篇 columbia univers...
2 篇 department of co...
2 篇 department of in...
2 篇 information syst...
2 篇 computer enginee...
2 篇 computer enginee...
2 篇 ipvr university ...
2 篇 department of co...
2 篇 institute of pro...
2 篇 technical univer...
2 篇 computer enginee...

作者

17 篇 lothar thiele
15 篇 b. stiller
14 篇 jian-jia chen
10 篇 stiller burkhard
9 篇 b. plattner
5 篇 l. thiele
5 篇 roger wattenhofe...
5 篇 stefan schmid
4 篇 reichl peter
4 篇 burkhard stiller
3 篇 andreas schranzh...
3 篇 tei-wei kuo
3 篇 k. strehl
3 篇 t. dubendorfer
3 篇 chuan-yue yang
2 篇 e. zitzler
2 篇 hasan
2 篇 h.o. trutmann
2 篇 s. bleuler
2 篇 t. gutekunst

语言

98 篇 英文

检索条件"机构=Computer Engineering and Networks Laboratory TIK"

共 98 条记录，以下是21-30 订阅

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

详细简洁

排序：

Distributed asymmetric verification in computational grids

Distributed asymmetric verification in computational grids

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Michael Kuhn Stefan Schmid Roger Wattenhofer Computer Engineering and Networks Laboratory (TIK) ETH Zurich Zurich Switzerland

Lucrative incentives in grid computing do not only attract honest participants, but also cheaters. To prevent selfish behavior, verification mechanisms are required. Today's solutions mostly base on redundancy and inherently exhibit a considerable overhead. Often, however, the verification of a result takes much less time than its computation. In this paper we propose a distributed checking scheme that exploits this asymmetry. Our mechanism detects wrong results and excludes cheaters in a distributed manner and hence disburdens the central of the grid server. We show how the verification scheme is used in an application which aims at breaking the discrete logarithm problem by a parallel implementation of the Pollard-p algorithm. Our implementation extends the BOINC server software and is robust to various rational attacks even in the presence of colluders.

关键词： Distributed computing Grid computing computer networks Algorithm design and analysis Laboratories Application software Robustness Scalability Network servers Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Rescuing Tit-for-Tat with Source Coding

Rescuing Tit-for-Tat with Source Coding

引用

International Conference on Peer-to-Peer Computing

作者： Thomas Locher Stefan Schmid Roger Wattenhofer Computer Engineering and Networks Laboratory (TIK) ETH Zurich Zurich Switzerland

Tit-for-tat is widely believed to be the most effective strategy to enforce collaboration among selfish users. However, it has been shown that its usefulness for decentralized and dynamic environments such as peer-to-peer networks is marginal, as peers can rapidly end up in a deadlock situation. Many proposed solutions to this problem are either less resilient to freeloading behavior or induce a computational overhead that cannot be sustained by regular peers. In contrast, we retain tit-for-tat, but enhance the system with a novel form of source coding and an effective scheme to prevent peers from freeloading from seeding peers. We show that our system performs well without the risk of peer starvation and without sacrificing fairness. The proposed solution has a reasonably low overhead, and may hence be suitable for fully distributed content distribution applications in real networks.

关键词： Source coding Peer to peer computing computer networks Laboratories International collaboration System recovery Centralized control System performance Acceleration Distributed computing

来源：评论

学校读者我要写书评

暂无评论

The Evaluation of the Efficient Prepaid Scheme TICA for All-IP networks and Internet Services

The Evaluation of the Efficient Prepaid Scheme TICA for All-...

引用

IFIP/IEEE International Symposium on Integrated Network Management

作者： Pascal Kurtansky Peter Reichl Burkhard Stiller Computer Engineering and Networks Laboratory TIK Swiss Federal Institute of Technology Zurich Switzerland Telecommunications Research Center Vienna Vienna Austria Department of Informatics IFI University of Zurich Zurich Switzerland

ISBN: (纸本)1424407982

Future all-IP networks will support a variety of high-value IP-based services including the upcoming integration of today's non-IP services offered by mobile telecommunication providers. Besides postpaid charging, prepaid charging will play an important role in all-IP environments due to the financial control of providers and customers, thus determining effective economic management means for Internet services. Since existing prepaid charging solutions do not meet imposed all-IP requirements, a novel approach-TICA (time interval calculation algorithm)-with three variants has been presented recently in [14,16]. To prove its optimized performance for many service mixes foreseen, this paper performs a thorough evaluation based on different scenarios. Additionally, comparing TICA's overall performance with existing online charging solutions shows TICA's promising results in terms of way smaller quantity of credit checks required and smaller financial risks for providers to be achieved. Finally, the three TICA variants reveal a clear sensitivity to defined input parameters. These findings indicate that a numbers of suitable settings can be used by service providers.

关键词： Web and internet services Environmental economics IP networks Performance evaluation Circuits Costs Pricing computer networks Laboratories Informatics

来源：评论

学校读者我要写书评

暂无评论

eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System

eQuus: A Provably Robust and Locality-Aware Peer-to-Peer Sys...

引用

International Conference on Peer-to-Peer Computing

作者： T. Locher S. Schmid R. Wattenhofer Computer Engineering and Networks Laboratory TIK ETH Zurich Zurich Switzerland

Peer-to-peer systems (p2p) are highly dynamic in nature. They may consist of millions of peers joining only for a limited period of time, resulting in hundreds of join and leave events per second. In this paper we introduce eQuus, a novel distributed hash table (DHT) suitable for highly dynamic environments. eQuus guarantees that lookups are always fast - in terms of both the delay and the total number of routing hops -, although peers may join and leave the network at any time and concurrently

关键词： Robustness Peer to peer computing Routing computer networks Laboratories Delay effects Load management Indexing Design optimization Network topology

来源：评论

学校读者我要写书评

暂无评论

Cryptree: A Folder Tree Structure for Cryptographic File Systems

Cryptree: A Folder Tree Structure for Cryptographic File Sys...

引用

Reliable Distributed Systems

作者： Dominik Grolimund Luzius Meisser Stefan Schmid Roger Wattenhofer Computer Engineering and Networks Laboratory (TIK) ETH Zurich Zurich Switzerland

We present Cryptree, a cryptographic tree structure which facilitates access control in file systems operating on untrusted storage. Cryptree leverages the file system's folder hierarchy to achieve efficient and intuitive, yet simple, access control. The highlights are its ability to recursively grant access to a folder and all its subfolders in constant time, the dynamic inheritance of access rights which inherently prevents scattering of access rights, and the possibility to grant someone access to a file or folder without revealing the identities of other accessors. To reason about and to visualize Cryptree, we introduce the notion of cryptographic links. We describe the Cryptrees we have used to enforce read and write access in our own file system. Finally, we measure the performance of the Cryptree and compare it to other approaches

关键词： Tree data structures File systems Access control Permission Public key cryptography computer networks Laboratories Scattering Visualization Testing

来源：评论

学校读者我要写书评

暂无评论

Dominating Set Based Support for Distributed Services in Mobile Ad Hoc networks

Dominating Set Based Support for Distributed Services in Mob...

引用

IEEE Symposium on Network Operations and Management

作者： K. Farkas F. Maurer L. Ruf B. Plattner Computer Engineering and Networks Laboratory (TIK) Swiss Federal Institute of Technology Zurich Switzerland

Using distributed real-time applications in mobile environments, e.g., multiplayer games or collaborative working tools, is getting popular as mobile devices and wireless networks are becoming ubiquitous. Especially mobile networked gaming, in regard to the current trends, is considered by game developers, mobile device manufacturers and service providers to be a very attractive source of future revenue. Furthermore, the appearance and evolution of new communication paradigms like mobile ad hoc networking offer new ways and unique features for real-time mobile applications and even for mobile gaming. However, ad hoc networks reserve special challenges mainly due to their self-organized behavior and the resource constraints of the participating mobile devices. One of these challenges is how we can manage applications and support their smooth running in this dynamic and error prone environment. In this paper, we present our algorithm called PBS (priority based selection) which is based on graph theory using dominating sets to give support to distributed services in mobile ad hoc networks. PBS computes an appropriate dominating set of the network graph in a fully distributed manner and it is the first approach in contrast to the existing algorithms that offers continuous maintenance of this set even in dynamically changing network topologies. To get an appreciation about PBS we discuss and analyze our algorithm, evaluate it via simulations and show how the dominating set created and maintained by applying PBS can be used in managing real-time multiplayer games in mobile ad hoc networks

关键词： Mobile ad hoc networks Collaborative tools Collaborative work Wireless networks Manufacturing Mobile communication Ad hoc networks Environmental management Graph theory computer networks

来源：评论

学校读者我要写书评

暂无评论

A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves

A Blueprint for Constructing Peer-to-Peer Systems Robust to ...

引用

International Workshop on Quality of Service

作者： Fabian Kuhn Stefan Schmid Joest Smit Roger Wattenhofer Microsoft Research Limited Mountain View CA USA Computer Engineering and Networks Laboratory TIK ETH Zurich Zurich Switzerland

ISBN: (纸本)1424404762

Until now, the analysis of fault tolerance of peer-to-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as well as joins and leaves occurring in a worst-case manner are hardly considered. In this paper, we devise techniques to build dynamic peer-to-peer systems which remain fully functional in spite of an adversary which continuously adds and removes peers. We exemplify our algorithms on a pancake topology and present a system which maintains peer degree and network diameter O(log n/log log n), where n is the total number of peers in the system

关键词： Peer to peer computing Robustness computer crashes computer networks Silicon Fault tolerant systems Network topology IP networks Software systems Protocols

来源：评论

学校读者我要写书评

暂无评论

Call Control on Lines

Call Control on Lines

引用

International Conference on Communication Systems Software and Middleware (COMSWARE)

作者： R. Sai Anand T. Erlebach Computer Engineering and Networks Laboratory Eidgenössische Technische Hochschule Zürich TIK Switzerland Department of Computer Science University of Leicester UK

Call admission control, call control for short, is a fundamental optimization problem arising in communication networks. The objective of the problem is to maximize the profit of call requests that can be accommodated in the network without violating the bandwidth constraints on the links. We study the offline variant of the problem on line networks. We provide polynomial time approximation schemes (PTAS) or algorithms with good approximation ratios for the problem when varying restrictions are imposed

关键词： Bandwidth Communication system control Joining processes Communication networks Call admission control Polynomials Approximation algorithms Routing computer networks Laboratories

来源：评论

学校读者我要写书评

暂无评论

QoS Extensions to Mobile Ad Hoc Routing Supporting Real-Time Applications

QoS Extensions to Mobile Ad Hoc Routing Supporting Real-Time...

引用

ACS/IEEE International Conference on computer Systems and Applications

作者： K. Farkas D. Budke B. Plattner O. Wellnitz L. Wolf Computer Engineering and Networks Laboratory TIK Swiss Federal Institute of Technology Zurich ETH Zurich Zurich Switzerland Institute of Operating Systems and Computer Networks IBR Technische Universitäat Braunschweig Brunswick Germany

来源：评论

学校读者我要写书评

暂无评论

Toward the Mobile Grid:Service Provisioning in a Mobile Dynamic Virtual Organization

Toward the Mobile Grid:Service Provisioning in a Mobile Dyna...

引用

ACS/IEEE International Conference on computer Systems and Applications

作者： M. Waldburger B. Stiller Department of Informatics IFI Universität Zürich Zurich Switzerland Computer Engineering and Networks Laboratory TIK ETH Zürich Zurich Switzerland

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共10页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：