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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,032 篇 会议
19 册 图书
8 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

626 篇 工学
- 576 篇 计算机科学与技术...
- 291 篇 软件工程
- 229 篇 电气工程
- 225 篇 信息与通信工程
- 80 篇 控制科学与工程
- 41 篇 仪器科学与技术
- 38 篇 动力工程及工程热...
- 37 篇 网络空间安全
- 36 篇 交通运输工程
- 36 篇 安全科学与工程
- 17 篇 电子科学与技术（可...
- 12 篇 机械工程
- 11 篇 生物工程
- 7 篇 建筑学
- 7 篇 环境科学与工程（可...
- 4 篇 化学工程与技术
- 4 篇 生物医学工程（可授...
122 篇 理学
- 62 篇 数学
- 36 篇 化学
- 13 篇 系统科学
- 12 篇 生物学
- 10 篇 统计学（可授理学、...
- 6 篇 物理学
111 篇 管理学
- 81 篇 管理科学与工程(可...
- 64 篇 图书情报与档案管...
- 34 篇 工商管理
8 篇 经济学
- 8 篇 应用经济学
5 篇 医学
- 5 篇 基础医学(可授医学...
- 5 篇 临床医学
3 篇 法学
- 3 篇 社会学
1 篇 军事学

主题

121 篇 distributed comp...
73 篇 computer science
57 篇 protocols
56 篇 distributed comp...
55 篇 cloud computing
53 篇 mobile computing
49 篇 middleware
47 篇 computer archite...
46 篇 costs
42 篇 scalability
41 篇 application soft...
41 篇 computer network...
40 篇 computational mo...
39 篇 intelligent netw...
38 篇 bandwidth
36 篇 real time system...
35 篇 peer to peer com...
33 篇 monitoring
31 篇 network servers
31 篇 internet

机构

4 篇 university of st...
4 篇 school of scienc...
3 篇 college of compu...
3 篇 department of co...
3 篇 ibm thomas j. wa...
3 篇 school of comput...
3 篇 brown univ dept ...
3 篇 dept. of cs geor...
3 篇 department of el...
3 篇 univ chicago il ...
3 篇 nppd tehran
3 篇 georgia institut...
3 篇 institute of com...
3 篇 natl univ def te...
3 篇 distributed syst...
2 篇 department of co...
2 篇 school of comput...
2 篇 univ nevada dept...
2 篇 department of co...
2 篇 the chinese univ...

作者

5 篇 yi pan
4 篇 uwe breitenbüche...
4 篇 frank leymann
3 篇 y. shibata
3 篇 jianhua sun
3 篇 dustdar schahram
3 篇 nong xiao
3 篇 hai jin
3 篇 takizawa hiroyuk...
3 篇 jiannong cao
2 篇 j.a. stankovic
2 篇 posdorfer wolf
2 篇 miremadi seyed g...
2 篇 datskova olga
2 篇 m. ito
2 篇 garcia jordi
2 篇 li j
2 篇 jukan admela
2 篇 souissi samia
2 篇 cheng yijun

语言

1,059 篇 英文

检索条件"任意字段=23rd International Conference on Distributed Computing Systems Workshops"

共 1059 条记录，以下是361-370 订阅

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

详细简洁

排序：

Managing the enterprise with the Application Response Measurement API (ARM) 23

Managing the enterprise with the Application Response Measur...

引用

Proceedings of the 1997 23rd international conference for the Resource Management & Performance Evaluation of Enterprise computing systems. Part 1 (of 2)

作者： Morris, Denise Hewlett-Packard Co Palo Alto United States

One of the most difficult parts of an enterprise performance or capacity analyst's job is to characterize computer system and network resource consumption by a particular application or workload. The continuing movement towards distributed systems, especially the client/server model, has complicated this activity even more. Add to this the lack of consistent (and in some cases, totally inadequate) resource measurement metrics on the platforms being used to implement distributed data processing, and the problem begins to appear overwhelming. This paper is intended to define the problem of enterprise management based upon business transactions in a single system, as well as a distributed environment, and present an emerging industry defacto standard solution to the problem.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A distributed system for answering range queries on sensor network data

A distributed system for answering range queries on sensor n...

引用

3rd IEEE international conference on Pervasive computing and Communications

作者： Cuzzocrea, A Furfaro, F Greco, S Masciari, E Mazzeo, GM Saccà, D Univ Calabria DEIS I-87030 Commenda Di Rende Italy

ISBN: (纸本)0769523005

A distributed system for approximate query answering on sensor network data is proposed, where a suitable compression technique is exploited to represent data and support query answering. Each node of the system stores either detailed or summarized sensor readings. Query answers are computed by identifying the set of nodes that contain (either compressed or not) data involved in the query, and eventually partitioning the query in a set of sub-queries to be evaluated at different nodes. Queries are partitioned according to a cost model aiming at making the evaluation efficient and guaranteeing the desired degree of accuracy of query answers.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A generic HLA-based communication architecture for distributed virtual environments

A generic HLA-based communication architecture for distribut...

引用

IASTED international conference on Parallel and distributed computing and Networks, as part of the 23rd IASTED international Multi-conference on Applied Informatics

作者： Ta, Duong Nguyen Binh Zhou, Suiping Shen, Haifeng School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

distributed Virtual Environments (DVEs) are distributed systems that allow multiple geographically distributed users to interact concurrently in a shared virtual world. With recent advances in computer graphics, network technologies and CPU processing power, DVEs are very popular nowadays. These systems are currently used in many different types of application, such as collaborative design, military training, e-learning, multi-player games, etc. In general, the most important requirements for DVEs are scalability, consistency and responsiveness. The communication architecture of DVEs is one of the key factors that should be considered to address these requirements. In this paper, we describe a communication architecture for DVEs based on the High Level Architecture (HLA). A prototype implementation with this architecture, the prey-predator federation, is also presented together with some preliminary characterization experiments and results.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A robust distributed generalized matching protocol that stabilizes in linear time

A robust distributed generalized matching protocol that stab...

引用

international conference on distributed computing systems Workshop

作者： W. Goddard S.T. Hedetniemi D.R. Jacobs P.K. Srimani Department of Computer Science Clemson University Clemson SC USA

We present a self-stabilizing algorithm for finding a generalized maximal matching (b-matching) in an arbitrary distributed network. We show that the algorithm converges in O(m) moves under an unfair central demon independent of the b-values at different nodes. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2].

关键词： Robustness Protocols Fault tolerant systems Costs Scheduling algorithm Intelligent networks Jacobian matrices Computer science Delay Bandwidth

来源：评论

学校读者我要写书评

暂无评论

ER-KV: High Performance Hybrid Fault-Tolerant Key-Value Store 23

ER-KV: High Performance Hybrid Fault-Tolerant Key-Value Stor...

引用

23rd IEEE international conference on High Performance computing and Communications, 7th IEEE international conference on Data Science and systems, 19th IEEE international conference on Smart City and 7th IEEE international conference on Dependability in Sensor, Cloud and Big Data systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Geng, Yingjie Luo, Jinfei Wang, Gang Liu, Xiaoguang College of Computer Science Tklndst Nankai University Tianjin China

ISBN: (纸本)9781665494571

In-memory Key-Value store (KV-store) has been widely used to meet increasing performance requirements. Such system stores user data in main memory and when a node fails, all data will be lost due to the volatile nature of DRAM. Therefore, it usually takes fault-tolerance mechanisms such as primary-backup replication (PBR) and erasure coding to ensure reliability and availability. PBR achieves high availability and scalability at the cost of high data redundancy. Erasure coding has higher utilization of storage but introduces additional computing and network overhead. This paper presents a high-performance fault-tolerant distributed KV-store, the Erasure-coded Replication KV (ER-KV), which takes advantage of both erasure coding and PBR by applying a two-level fault-tolerant mechanism. To achieve both fast recovery speed and low storage overhead, ER-KV gives priority to PBR for fault tolerance but will turn to erasure coding for data recovery when backup nodes are all offline. When generating parity data, ER-KV leverages erasure coding for large value while applying PBR to small-sized key to avoid frequent encoding and decoding. ER-KV also introduces pipelining into erasure coding to improve system performance, and simultaneously, ER-KV still maintains data consistency. Besides, ER-KV applies persistent memory (PM) to achieve the persistence of redundant data and improve recovery speed. We have applied ER-KV to Redis and the experimental results show that it saves 33% of storage compared with PBR. As for erasure coding, ER-KV has higher recovery efficiency and system availability. And it also brings 15X-80X speedup in data reconstruction when applying PM to backup nodes. © 2021 IEEE.

关键词： Fault tolerance Costs Smart cities System performance Scalability Fault tolerant systems Redundancy

来源：评论

学校读者我要写书评

暂无评论

Peer-to-peer protocols for resource discovery in the Grid

Peer-to-peer protocols for resource discovery in the Grid

引用

IASTED international conference on Parallel and distributed computing and Networks, as part of the 23rd IASTED international Multi-conference on Applied Informatics

作者： Al-Dmour, N.A. Teahan, W.J. School of Informatics University of Wales Bangor Dean Street Bangor Gwynedd LL57 1UT United Kingdom

One of the basic services in the Grid is resource discovery. When a user request services, he gives a set of attributes that should be satisfied by a candidate resource. The resource discovery mechanism returns a set of best resources for the given set of attributes. We present two P2P protocols for resource discovery: the Query Resource Discovery Mechanism (QrdM), and the Seeking Resource Discovery Mechanism (SrdM). They are based on the main characteristics of P2P systems: decentralization and selforganization.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Game-Theoretic Analysis of an Incentivized Verifiable Computation System 4th

Game-Theoretic Analysis of an Incentivized Verifiable Comput...

引用

23rd international conference on Financial Cryptography and Data Security

作者： Nabi, Mahmudun Avizheh, Sepideh Kumaramangalam, Muni Venkateswarlu Safavi-Naini, Reihaneh Univ Calgary Calgary AB Canada

ISBN: (纸本)9783030437244;9783030437251

Outsourcing computation allows a weak client to outsource its computation to a powerful server and receive the result of the computation. Verifiable outsourcing enables clients to verify the computation result of untrusted servers. Permissionless distributed outsourcing systems provide an attractive marketplace for users to participate in the system as a problem-giver who needs solution to a problem, or problemsolver who is willing to sell its computational resources. Verification of computation in these systems, that do not assume trusted computational nodes, is a challenging task. In this paper we provide a game-theoretic analysis of an incentivized outsourcing computation system, proposed by Harz and Boman [Harz et al. 2018] (HB), at WTSC 2018 (FC Workshop), and show that the system is vulnerable to collusion and Sybil attacks, that result in incorrect solutions to be accepted by the system. We also show that malicious computational node can succeed in polluting the blockchain. We propose modifications to the system that incentivizes honest behavior, and improve the system's correctness guarantee. We provide a high-level analysis of the modified system using our game theoretic approach, and show the effectiveness of the proposed modifications.

关键词： Outsourcing computation Verifiable distributed computation Rational adversaries Incentivized security

来源：评论

学校读者我要写书评

暂无评论

MRTOM: Mostly Reliable Totally Ordered Multicast, a Network Primitive to Offload distributed systems 43

MRTOM: Mostly Reliable Totally Ordered Multicast, a Network ...

引用

43rd IEEE international conference on distributed computing systems (ICDCS)

作者： Liu, Zhang Grunwald, Dirk Izraelevitz, Joseph Wang, Gaukas Ha, Sangtae Univ Colorado Boulder CO 80309 USA

ISBN: (纸本)9798350339864

As datacenters become the new computing platform, integrating server-centric distributed systems into modern network hardware is gaining interest under the diminishing Moore's law. Researchers want to build reusable primitives that can take advantage of modern network hardware and offload common system components of a broad range of applications. In this paper, we present Mostly Reliable Totally Ordered Multicast, a reusable network primitive that can embed reliable group communication into the network. MRTOM is a network-centric approach that handles message replication, ordering, and reliable delivery using a network fast path, freeing server CPUs for application logic. MRTOM can be implemented in the programmable switches and edge interfaces (e.g., SmartNICs), significantly reducing network traffic compared to the existing approaches and improving job finish time amid packet loss. With MRTOM, we were able to accelerate multiple high-performance applications whose fast path can be totally offloaded into the network. For example, a Paxos application, MRTOM-Paxos, achieves > 1,100,000 transactions/secs and 23 mu s minimum latency. A replicated key-value store, MRTOM-KV, also shows significant latency reduction with eBPF/XDP in the Linux Kernel, which is further improved by offloading into SmartNICs.

关键词： programmable network network primitives distributed system offloading

来源：评论

学校读者我要写书评

暂无评论

A note on efficient key location in pure P2P systems under an environment with dynamic key modifications

A note on efficient key location in pure P2P systems under a...

引用

IASTED international conference on Parallel and distributed computing and Networks, as part of the 23rd IASTED international Multi-conference on Applied Informatics

作者： Fujita, Satoshi Department of Information Engineering Graduate School of Engineering Hiroshima University Japan

In this paper, we consider the problem of finding a key from elements distributed over a peer-to-peer (P2P) system, where elements locally stored in each node are drawn from a totally ordered set such as the set of integers and the set of English words. As the basic technique to realize an efficient key location, we focus on the combination of binary search and an approximated sorting of the elements. We provide a detailed analysis of the sorting-based key location scheme, and indicate possible directions for further research.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Data Partitioning Strategies for Stencil Computations on NUMA systems 1

引用

23rd international conference on Parallel and distributed computing (Euro-Par)

作者： Feinbube, Frank Plauth, Max Knaust, Marius Polze, Andreas Univ Potsdam Hasso Plattner Inst Software Syst Engn Operating Syst & Middleware Grp Potsdam Germany

ISBN: (数字)9783319751788

ISBN: (纸本)9783319751788;9783319751771

Many scientific problems rely on the efficient execution of stencil computations, which are usually memory-bound. In this paper, stencils on two-dimensional data are executed on NUMA architectures. Each node of a NUMA system processes a distinct partition of the input data independent from other nodes. However, processors may need access to the memory of other nodes at the edges of the partitions. This paper demonstrates two techniques based on machine learning for identifying partitioning strategies that reduce the occurrence of remote memory access. One approach is generally applicable and is based on an uninformed search. The second approach caps the search space by employing geometric decomposition. The partitioning strategies obtained with these techniques are analyzed theoretically. Finally, an evaluation on a real NUMA machine is conducted, which demonstrates that the expected reduction of the remote memory accesses can be achieved.

关键词： NUMA Stencil computation Data partitioning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共106页 << < 33 34 35 36 37 38 39 40 41 42 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：