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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,624 篇 会议
13 篇 期刊文献
9 册 图书

馆藏范围

1,646 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

916 篇 工学
- 838 篇 计算机科学与技术...
- 323 篇 软件工程
- 211 篇 信息与通信工程
- 133 篇 电气工程
- 63 篇 控制科学与工程
- 31 篇 生物工程
- 22 篇 生物医学工程（可授...
- 17 篇 电子科学与技术（可...
- 15 篇 动力工程及工程热...
- 15 篇 安全科学与工程
- 14 篇 网络空间安全
- 13 篇 建筑学
- 12 篇 土木工程
- 10 篇 仪器科学与技术
- 10 篇 交通运输工程
- 9 篇 机械工程
- 9 篇 材料科学与工程（可...
- 8 篇 化学工程与技术
183 篇 理学
- 89 篇 数学
- 68 篇 物理学
- 33 篇 生物学
- 19 篇 系统科学
- 18 篇 统计学（可授理学、...
134 篇 管理学
- 94 篇 管理科学与工程(可...
- 59 篇 图书情报与档案管...
- 57 篇 工商管理
20 篇 法学
- 16 篇 社会学
17 篇 经济学
- 15 篇 应用经济学
17 篇 医学
- 16 篇 临床医学
- 14 篇 基础医学(可授医学...
2 篇 农学
1 篇 教育学
1 篇 文学
1 篇 军事学
1 篇 艺术学

主题

156 篇 distributed comp...
113 篇 cloud computing
78 篇 peer to peer com...
74 篇 application soft...
67 篇 protocols
67 篇 computer network...
64 篇 computational mo...
63 篇 mobile computing
56 篇 computer science
56 篇 computer archite...
49 篇 high performance...
47 篇 routing
46 篇 bandwidth
45 篇 internet
45 篇 middleware
43 篇 privacy
40 篇 costs
39 篇 resource managem...
39 篇 distributed comp...
38 篇 social networkin...

机构

14 篇 state key labora...
10 篇 gansu provincial...
9 篇 beijing universi...
7 篇 institute of com...
7 篇 cern geneva
6 篇 college of compu...
6 篇 shenzhen institu...
6 篇 tokyo denki univ...
5 篇 department of ph...
5 篇 dept. of astrono...
5 篇 dept. of physics...
5 篇 dept. of physics...
5 篇 iii. physikalisc...
5 篇 erlangen centre ...
5 篇 département de p...
5 篇 school of physic...
5 篇 dept. of physics...
5 篇 dept. of physics...
5 篇 department of ph...
5 篇 institut für phy...

作者

8 篇 takizawa makoto
6 篇 huang lican
6 篇 enokido tomoya
6 篇 makoto takizawa
5 篇 de ridder s.
5 篇 choi k.
5 篇 an r.
5 篇 haungs a.
5 篇 fürst p.
5 篇 cross r.
5 篇 bradascio f.
5 篇 fan k.l.
5 篇 bourbeau e.
5 篇 fritz a.
5 篇 bastian b.
5 篇 gündüz m.
5 篇 dvorak e.
5 篇 halve l.
5 篇 gonzalez j.g.
5 篇 de clercq c.

语言

1,636 篇 英文
8 篇 中文
5 篇 其他

检索条件"任意字段=Proceedings of the 22nd International Conference on Distributed Computing and Networking"

共 1646 条记录，以下是1501-1510 订阅

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

详细简洁

排序：

Scalable and efficient update dissemination for distributed interactive applications

Scalable and efficient update dissemination for distributed ...

引用

international conference on distributed computing Systems

作者： Tianying Chang G. Popescu C. Codella College of Computing Georgia Institute of Technology Atlanta USA IBM Thomas J. Watson Research Center Yorktown Heights USA

distributed interactive applications such as multiplayer games will become increasingly popular in wide area distributed systems. To provide the response time desired by users despite high and unpredictable communication latency in such systems, shared objects will be replicated or cached by clients that participate in the applications. Any updates to the shared objects will have to be disseminated to clients that actually use the objects to maintain consistency. We address the problem of efficient and scalable update dissemination in an environment where client interests can change dynamically and the number of multicast channels available for update dissemination is limited. We present a heuristic based algorithm that can group objects and clients in a way that it handles limited bandwidth resources. We show that our algorithm can produce better results than several algorithms that have been developed in the past for update dissemination.

关键词： Delay Multicast algorithms Internet distributed computing Bandwidth Unicast Educational institutions Heuristic algorithms Games Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Specification and verification of quality requirements in distributed multimedia presentations

Specification and verification of quality requirements in di...

引用

international conference on distributed computing Systems Workshop

作者： C. Mourlas Department of Computer Science University of Cyprus Nicosia Cyprus

Continuous media applications have an implied temporal dimension, i.e. they are presented at a particular rate for a particular length of time and if the required rate of presentation is not met the integrity of these media is destroyed. We present a set of language constructs suitable for the definition of the required QoS and the real-time dimension of the media that participate in a multimedia application. We propose a new modeling scheme where we can represent every different presentation by a periodic task and then we describe a method that provides low-level support to these language constructs. The emphasis of the proposed strategy is on deterministic guarantees and can be considered as a next step for the design and the implementation of predictable continuous media applications over a network.

关键词： Streaming media Quality of service Runtime environment Channel allocation Computer science Application software TV Telephony Timing Internet

来源：评论

学校读者我要写书评

暂无评论

An adaptive maintenance of hierarchical structure in ad hoc networks and its evaluation

An adaptive maintenance of hierarchical structure in ad hoc ...

引用

international conference on distributed computing Systems Workshop

作者： T. Ohta S. Inoue Y. Kakuda K. Ishida K. Maeda Faculty of Information Sciences Hiroshima City University Hiroshima Japan

Hierarchical routing is effective for large ad hoc networks. However, it is difficult to maintain the hierarchical structure for routing due to node movement. This paper proposes an adaptive method for maintaining the hierarchical structure. The features of the proposed method are (1) the roles of nodes for the hierarchical structure are changed depending on the status of nodes in the restricted vicinity, and (2) the cluster size is adjusted so that the number of nodes in each cluster is bounded by two constants. The adaptability of the proposed method has been evaluated by theoretical considerations and simulation experiments. The results show that node roles and clusters efficiently converges to stable states because of the features. The proposed method therefore has high adaptability to node movement.

关键词： Intelligent networks Ad hoc networks Routing protocols Robustness Joining processes Base stations Disaster management Scattering Computational modeling distributed computing

来源：评论

学校读者我要写书评

暂无评论

Design of a policy-driven middleware for secure distributed collaboration

Design of a policy-driven middleware for secure distributed ...

引用

international conference on distributed computing Systems

作者： A.R. Tripathi T. Ahmed R. Kumar S. Jaman Department of Computer Science University of Minnesota Minneapolis MN USA

We present the execution model of policy-driven middleware for building secure distributed collaboration systems from their high level specifications. Our specification model supports nested collaboration activities, and uses role-based security policies and event count based coordination specification. From the specifications of a collaboration environment, appropriate policy modules are derived for enforcing security and coordination requirements. Policy-driven distributed middleware provides services to users to join roles in an activity, perform role specific operations, or create new activities. We describe the design challenges for middleware and present the run-time structures and protocols supported by it for creating activities, roles, and objects.

关键词： Middleware Collaborative work Protocols National security Real time systems Online Communities/Technical Collaboration Collaborative software Runtime environment Computer science Buildings

来源：评论

学校读者我要写书评

暂无评论

A demand based algorithm for rapid updating of replicas

A demand based algorithm for rapid updating of replicas

引用

international conference on distributed computing Systems Workshop

作者： J. Acosta-Elias L. Navarro-Moldes Polytechnic University of Catalonia Spain

In many Internet scale replicated system, not all replicas can be dealt with in the same way, since some will be in greater demand than others. In the case of weak consistency algorithms, we have observed that updating first replicas having most demand, a greater number of clients would gain access to updated content in a shorter period of time. In this work we have investigated the benefits that can be obtained by prioritizing replicas with greater demand, and considerable improvements have been achieved. In zones of higher demand, the consistent state is reached up to six times quicker than with a normal weak consistency algorithm, without incurring the additional costs of the strong consistency.

关键词： Delay Costs Web and internet services Web server Telecommunication traffic Contracts Collaborative work Entropy Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

A replica distribution method with consideration of the positions of mobile hosts on wireless ad-hoc networks

A replica distribution method with consideration of the posi...

引用

international conference on distributed computing Systems Workshop

作者： M. Tamori S. Ishihara T. Watanabe T. Mizuno Graduate School of Information Shizuoka University Hamamatsu Japan Faculty of Engineering Japan Faculty of Information Japan

One of the features of wireless ad hoc network technology is that networks can be constructed without a fixed network infrastructure. Communication in a disaster is one application of a mobile ad hoc network. Data on the disaster can be collected by mobile hosts. The mobile hosts can then exchange data to decide rescue priority, etc. However connectivity in a wireless ad hoc network is not guaranteed because hosts encounter obstacles. Thus, the accessibility of the data objects held in a particular host is very important. To ensure accessibility, we propose a method for distributing replicas of regional data on mobile ad-hoc networks.

关键词： Ad hoc networks Mobile ad hoc networks Mobile communication Spread spectrum communication Broadcasting Bluetooth Radio communication Communication networks Routing protocols distributed computing

来源：评论

学校读者我要写书评

暂无评论

Fast Collect in the absence of contention

Fast Collect in the absence of contention

引用

international conference on distributed computing Systems

作者： B. Englert E. Gafni Department of Mathematics University of California Los Angeles Los Angeles CA USA Department of Computer Science University of California Los Angeles Los Angeles CA USA

We present a generic module, called Fast Collect. Fast Collect is an implementation of single-writer multi-reader (SWMR) shared-memory in an asynchronous system in which a processor updates its cell and then reads in any order all the other cells. Our simple implementation of Fast Collect uses some multiwriter multi-reader (MWMR) variables and one local Boolean per processor, such that eventually, in the absence of contention, i.e. if only a single processor repeatedly performs collect, the amortized cost per each collect is a constant. With the example of Disk Paxos we show how Fast Collect can be used as a building block in wait-free algorithms.

关键词： Concurrent computing Costs Software algorithms Adaptive algorithm Chromium distributed algorithms Computer bugs Mathematics Computer science Steady-state

来源：评论

学校读者我要写书评

暂无评论

Group-based management of distributed file caches

Group-based management of distributed file caches

引用

international conference on distributed computing Systems

作者： A. Amer D.D.E. Long R.C. Burns Department of Computer Science University of California Santa Cruz USA Department of Computer Science Johns Hopkins University USA

We describe a way to manage distributed file system caches based upon groups of files that are accessed together. We use file access patterns to automatically construct dynamic groupings of files and then manage our cache by fetching groups, rather than single files. We present experimental results, based on trace-driven workloads, demonstrating that grouping improves cache performance. At the file system client, grouping can reduce LRU demand fetches by 50 to 60%. At the server cache hit rate improvements are much more pronounced, but vary widely (20 to over 1200%) depending upon the capacity of intervening caches. Our treatment includes information theoretic results that justify our approach to file grouping.

关键词： Prefetching Delay File systems Predictive models Computer science Timing Accuracy System performance Performance gain Statistics

来源：评论

学校读者我要写书评

暂无评论

Towards an access control mechanism for wide-area publish/subscribe systems

Towards an access control mechanism for wide-area publish/su...

引用

international conference on distributed computing Systems Workshop

作者： Z. Miklos Distributed Systems Group Technical University of of Vienna Vienna Austria

The publish/subscribe communication model is increasingly considered for implementing middleware infrastructures for widely distributed applications. Scalability issues and routing algorithms of such systems have recently been the focus of intensive research. So far little attention has been given to the security and management issues. In current publish/subscribe systems, malicious publishers can very easily insert bogus notifications which may propagated to a large number of subscribers. Moreover, there is no method to control what notifications the subscribers are authorized to receive. We describe a method to specify access control policy rules using expressions similar to subscription expressions. These policies define access rules for publish and subscribe functions and screening rules for notifications.

关键词： Access control Subscriptions Routing Internet Permission Middleware Scalability Communication system security Joining processes Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

On the performance of group key agreement protocols

On the performance of group key agreement protocols

引用

international conference on distributed computing Systems

作者： Y. Amir Y. Kim C. Nita-Rotaru G. Tsudik CS Department Johns Hopkins University Baltimore MD USA ICS Department University of California Irvine CA USA

Group key agreement (GKA) is a fundamental building block for securing peer group communication systems (GCS). Several group key agreement protocols were proposed in the past, all assuming an underlying group communication infrastructure. This paper presents a performance evaluation of 5 notable GKA protocols integrated with a reliable group communication system (Spread). They are: centralized group key distribution (CKD), Burmester-Desmedt (BD), Steer et al. (STR), group Diffie-Hellman GDH) and tree-based group Diffie-Hellman (TGDH).. We present concrete results obtained in experiments on local- and wide-area networks. Our analysis of these results offers insights into their relative scalability and practicality.

关键词： Protocols Personal communication networks Costs System testing Local area networks Linux Wide area networks distributed computing Telecommunication network reliability Concrete

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共165页 << < 147 148 149 150 151 152 153 154 155 156 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：