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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

888 篇 工学
- 822 篇 计算机科学与技术...
- 596 篇 软件工程
- 256 篇 信息与通信工程
- 147 篇 控制科学与工程
- 132 篇 电气工程
- 64 篇 电子科学与技术（可...
- 58 篇 网络空间安全
- 31 篇 动力工程及工程热...
- 29 篇 机械工程
- 24 篇 材料科学与工程（可...
- 21 篇 仪器科学与技术
- 18 篇 生物工程
- 10 篇 建筑学
- 9 篇 力学（可授工学、理...
- 9 篇 光学工程
- 9 篇 化学工程与技术
- 8 篇 交通运输工程
- 7 篇 土木工程
- 7 篇 环境科学与工程（可...
422 篇 理学
- 366 篇 数学
- 182 篇 统计学（可授理学、...
- 38 篇 系统科学
- 24 篇 物理学
- 20 篇 生物学
- 15 篇 化学
187 篇 管理学
- 161 篇 管理科学与工程(可...
- 105 篇 工商管理
- 36 篇 图书情报与档案管...
25 篇 法学
- 24 篇 社会学
24 篇 经济学
- 24 篇 应用经济学
6 篇 农学
5 篇 教育学
3 篇 医学
2 篇 军事学

主题

69 篇 computer simulat...
67 篇 computational mo...
66 篇 computer network...
52 篇 computer systems...
33 篇 measurement
28 篇 analytical model...
26 篇 computer archite...
23 篇 computer science
23 篇 wireless sensor ...
23 篇 computer operati...
21 篇 discrete event s...
21 篇 distributed comp...
17 篇 queueing network...
17 篇 scheduling
17 篇 computer systems
16 篇 telecommunicatio...
15 篇 client server co...
14 篇 costs
14 篇 time measurement
14 篇 response time (c...

机构

8 篇 department of co...
8 篇 department of co...
7 篇 department of co...
5 篇 department of co...
5 篇 department of co...
4 篇 univ of washingt...
4 篇 univ of californ...
4 篇 department of co...
4 篇 carnegie mellon ...
4 篇 computer systems...
4 篇 computer systems...
4 篇 dept. of comp. s...
4 篇 department of co...
4 篇 department of co...
4 篇 computer science...
4 篇 department of co...
4 篇 computer science...
4 篇 department of co...
3 篇 school of comput...
3 篇 univ of californ...

作者

19 篇 towsley don
9 篇 lazowska edward ...
8 篇 liu alex x.
8 篇 vernon mary k.
8 篇 zahorjan john
8 篇 tripathi satish ...
7 篇 stankovic john a...
7 篇 estrin deborah
7 篇 crovella mark
7 篇 shenoy prashant
7 篇 wang jia
6 篇 don towsley
6 篇 dowdy lawrence w...
6 篇 wood david a.
6 篇 van houdt benny
6 篇 harchol-balter m...
5 篇 pai vivek s.
5 篇 feamster nick
5 篇 martonosi margar...
5 篇 zhang zhi-li

语言

1,315 篇 英文
39 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 1994 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems"

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

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

详细简洁

排序：

Are data caps reasonable? 13

Are data caps reasonable?

引用

13th Workshop on the Economics of Networks, systems, and Computation, NetEcon 2018 - In conjunction with the acm sigmetrics International conference on measurement and modeling of computer systems, acm sigmetrics 2018

作者： Jordan, Scott Department of Computer Science University of California Irvine IrvineCA92697 United States

ISBN: (纸本)9781450359160

We discuss how data caps may be evaluated under the FCC's 2015 Open Internet Order. We find that heavy-users caps on mobile broadband service are likely to satisfy the Order's rules, that profit-maximizing caps on mobile broadband service may or may not satisfy the rules, and that caps on fixed broadband service are unlikely to satisfy the rules. © 2018 Copyright is held by the owner/author(s).

关键词： Net neutrality Open Internet

来源：评论

学校读者我要写书评

暂无评论

Disaggregating user evaluations using the shapley value 13

Disaggregating user evaluations using the shapley value

引用

作者： Feldotto, Matthias Haake, Claus-Jochen Skopalik, Alexander Stroh-Maraun, Nadja Department of Computer Science Paderborn University Germany Department of Economics Paderborn University Germany

ISBN: (纸本)9781450359160

We consider a market where final products or services are compositions of a number of basic services. Users are asked to evaluate the quality of the composed product after purchase. The quality of the basic service influences the performance of the composed services but cannot be observed directly. The question we pose is whether it is possible to use user evaluations on composed services to assess the quality of basic services. We discuss how to combine aggregation of evaluations across users and disaggregation of information on composed services to derive valuations for the single components. As a solution we propose to use the (weighted) average as aggregation device in connection with the Shapley value as disaggregation method, since this combination fulfills natural requirements in our context. In addition, we address some occurring computational issues: We give an approximate solution concept using only a limited number of evaluations which guarantees nearly optimal results with reduced running time. Lastly, we show that a slightly modified Shapley value and the weighted average are still applicable if the evaluation profiles are incomplete. © 2018 Association for Computing Machinery.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

On the power-of-d-choices with least loaded server selection 18

On the power-of-d-choices with least loaded server selection

引用

2018 acm International conference on measurement and modeling of computer systems, sigmetrics 2018

作者： Hellemans, Tim Houdt, Benny Van Department of Mathematics and Computer Science IDLab University of Antwerp Belgium

ISBN: (纸本)9781450358460

Diffusion models and mean-field models have been used to approximate many stochastic dynamical systems. A functional strong law of large numbers or a functional central limit theorem justifies such an approximation. Such a result, however, does not justify the convergence of the equilibria of pre-limit systems to the equilibrium of a limit system. In this talk, I will touch on three recently developed methods for justifying equilibrium convergence in the setting of bandwidth sharing networks and multiclass queueing networks, with a focus on moment generating function method and the state-space-collapse. Based on joint works with Anton Braverman, Chang Cao, Masakiyo Miyazawa, and Xiangyu Zhang..

关键词： Large scale systems

来源：评论

学校读者我要写书评

暂无评论

Hound: Causal learning for datacenter-scale straggler diagnosis 18

Hound: Causal learning for datacenter-scale straggler diagno...

引用

2018 acm International conference on measurement and modeling of computer systems, sigmetrics 2018

作者： Zheng, Pengfei Lee, Benjamin C. Duke University Department of Computer Science United States

ISBN: (纸本)9781450358460

Stragglers are exceptionally slow tasks within a job that delay its completion. Stragglers, which are uncommon within a single job, are pervasive in datacenters with many jobs. We present Hound, a statistical machine learning framework that infers the causes of stragglers from traces of datacenter-scale jobs. Hound is designed to achieve several objectives: datacenter-scale diagnosis, unbiased inference, interpretable models, and computational efficiency. We demonstrate Hound’s capabilities for a production trace from Google’s warehouse-scale datacenters and two Spark traces from Amazon EC2 clusters. (This work is accepted as a full paper for oral presentation at sigmetrics’18 and published in POMACS, Volume2, Issue 1, March 2018 [8].). © 2018 Copyright held by the owner/author(s).

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

A winners-take-all incentive mechanism for crowd-powered systems 13

A winners-take-all incentive mechanism for crowd-powered sys...

引用

作者： Jiang, Pengfei Wang, Weina Ying, Lei Zhou, Yao He, Jingrui School of Electrical Computer and Energy Engineering Arizona State University United States Coordinated Science Laboratory University of Illinois United States School of Computing Informatics and Decision Systems Engineering Arizona State University United States

ISBN: (纸本)9781450359160

This paper studies incentive mechanisms for crowd-powered systems, including applications such as collection of personal data for big-data analytics and crowdsourcing. In big-data analytics using personal data, an individual may control the quality of reported data via a privacy-preserving mechanism that randomizes the answer. In crowdsourcing, the quality of the reported answer depends on the amount of effort spent by a worker or a team. In these applications, incentive mechanisms are critical for eliciting data/answers with target quality. This paper focuses the following two fundamental questions: what is the minimum payment required to incentivize an individual to submit a data/answer with quality level ∈? and what incentive mechanisms can achieve the minimum payment? Let ∈i denote the quality of the data/answer reported by individual i: In this paper, we first derive a lower bound on the minimum amount of payment required for guaranteeing quality level ∈i: Inspired by the lower bound, we propose an incentive mechanism, named Winners-Take-All (WINTALL). WINTALL first decides a winning answer based on the reported data, cost functions of individuals, and some prior distribution;and then pays to individuals whose reported data match the winning answer. Under some assumptions, we show that the expected payment of WINTALL matches the lower bound. In the application of private discrete distribution estimation, we show that WINTALL simply rewards individuals whose reported answers match the most popular answer from the reported ones (the prior distribution is not needed in this case). © 2018 Copyright held by the owner/author(s).

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Testing the Limits of Tapered Fat Tree Networks 10

Testing the Limits of Tapered Fat Tree Networks

引用

10th IEEE/acm Performance modeling, Benchmarking and Simulation of High Performance computer systems (PMBS) held as part of the 31st acm/IEEE International conference for High Performance Computing, Networking, Storage and Analysis (SC

作者： Taffet, Philip Rao, Sanil Leon, Edgar A. Karlin, Ian Rice Univ Dept Comp Sci Houston TX 77005 USA Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA Lawrence Livermore Natl Lab Livermore Comp Lawrence CA USA

ISBN: (纸本)9781728159775

HPC system procurement with a fixed budget is an optimization problem with many trade-offs. In particular, the choice of an interconnection network for a system is a major choice, since communication performance is important to overall application performance and the network makes up a substantial fraction of a supercomputer's overall price. It is necessary to understand how sensitive representative jobs are to various aspects of network performance to procure the right network. Unlike previous studies, which used mostly communication-only motifs or simulation, this work employs a real system and measures the performance of representative applications under controlled environments. We vary background congestion, job mapping, and job placement with different levels of network tapering on a fat tree. Overall, we find that a 2:1 tapered fat tree provides sufficiently robust communication performance for a representative mix of applications while generating meaningful cost savings relative to a full bisection bandwidth fat tree. Furthermore, our results advise against further tapering, as the resulting performance degradation would exceed cost savings. However, application-specific mappings and topology-aware schedulers may reduce global bandwidth needs, providing room for additional network tapering.

关键词： Communication performance system procurement networking application benchmarking performance measurement high performance computing

来源：评论

学校读者我要写书评

暂无评论

A Quantitative evaluation of contemporary GPU simulation methodology 18

A Quantitative evaluation of contemporary GPU simulation met...

引用

2018 acm International conference on measurement and modeling of computer systems, sigmetrics 2018

作者： Jain, Akshay Khairy, Mahmoud Rogers, Timothy G. Department of Electrical and Computer Engineering Purdue University United States

ISBN: (纸本)9781450358460

Contemporary Graphics Processing Units (GPUs) are used to accelerate highly parallel compute workloads. For the last decade, researchers in academia and industry have used cycle-level GPU architecture simulators to evaluate future designs. This paper performs an in-depth analysis of commonly accepted GPU simulation methodology, examining the effect both the workload and the choice of instruction set architecture have on the accuracy of a widely-used simulation infrastructure, GPGPU-Sim. We analyze numerous aspects of the architecture, validating the simulation results against real hardware. Based on a characterized set of over 1700 GPU kernels, we demonstrate that while the relative accuracy of compute-intensive workloads is high, inaccuracies in modeling the memory system result in much higher error when memory performance is critical. We then perform a case study using a recently proposed GPU architecture modification, demonstrating that the cross-product of workload characteristics and instruction set architecture choice can have an affect on the predicted efficacy of the technique. © 2018 Copyright held by the owner/author(s).

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Network resilience and the length-bounded multicut problem: Reaching the dynamic billion-scale with guarantees 18

Network resilience and the length-bounded multicut problem: ...

引用

2018 acm International conference on measurement and modeling of computer systems, sigmetrics 2018

作者： Kuhnle, Alan Crawford, Victoria G. Thai, My T. Department of Computer and Information Science and Engineering University of Florida GainesvilleFL United States

ISBN: (纸本)9781450358460

Motivated by networked systems in which the functionality of the network depends on vertices in the network being within a bounded distance T of each other, we study the length-bounded multicut problem: given a set of pairs, find a minimum-size set of edges whose removal ensures the distance between each pair exceeds T. We introduce the first algorithms for this problem capable of scaling to massive networks with billions of edges and nodes: three highly scalable algorithms with worst-case performance ratios. Furthermore, one of our algorithms is fully dynamic, capable of updating its solution upon incremental vertex / edge additions or removals from the network while maintaining its performance ratio. Finally, we show that unless NP ? BPP, there is no polynomial-time, approximation algorithm with performance ratio better than ?(T), which matches the ratio of our dynamic algorithm up to a constant factor. © 2018 Copyright held by the owner/author(s).

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

SOAP: One clean analysis of all age-based scheduling policies 18

SOAP: One clean analysis of all age-based scheduling policie...

引用

2018 acm International conference on measurement and modeling of computer systems, sigmetrics 2018

作者： Scully, Ziv Harchol-Balter, Mor Scheller-Wolf, Alan Carnegie Mellon University Computer Science Department PittsburghPA United States

ISBN: (纸本)9781450358460

We consider an extremely broad class of M/G/1 scheduling policies called SOAP: Schedule Ordered by Age-based Priority. The SOAP policies include almost all scheduling policies in the literature as well as an infinite number of variants which have never been analyzed, or maybe not even conceived. SOAP policies range from classic policies, like first-come, first-serve (FCFS), foreground-background (FB), class-based priority, and shortest remaining processing time (SRPT);to much more complicated scheduling rules, such as the famously complex Gittins index policy and other policies in which a job’s priority changes arbitrarily with its age. While the response time of policies in the former category is well understood, policies in the latter category have resisted response time analysis. We present a universal analysis of all SOAP policies, deriving the mean and Laplace-Stieltjes transform of response time. © 2018 Copyright held by the owner/author(s).

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

On a class of stochastic multilayer networks 18

On a class of stochastic multilayer networks

引用

2018 acm International conference on measurement and modeling of computer systems, sigmetrics 2018

作者： Jiang, Bo Towsley, Don Nain, Philippe Guha, Saikat College of Information and Computer Sciences University of Massachusetts Amherst MA United States Inria Lyon69364 France College of Optical Sciences University of Arizona TucsonAZ United States

ISBN: (纸本)9781450358460

In this paper, we introduce a new class of stochastic multilayer networks. A stochastic multilayer network is the aggregation of M networks (one per layer) where each is a subgraph of a foundational network G. Each layer network is the result of probabilistically removing links and nodes from G. The resulting network includes any link that appears in at least K layers. This model is an instance of a non-standard site-bond percolation model. Two sets of results are obtained:fi rst, we derive the probability distribution that the M-layer network is in a given configuration for some particular graph structures (explicit results are provided for a line and an algorithm is provided for a tree), where a configuration is the collective state of all links (each either active or inactive). Next, we show that for appropriate scalings of the node and link selection processes in a layer, links are asymptotically independent as the number of layers goes to infinity, and follow Poisson distributions. Numerical results are provided to highlight the impact of having several layers on some metrics of interest (including expected size of the cluster a node belongs to in the case of the line). This model finds applications in wireless communication networks with multichannel radios, multiple social networks with overlapping memberships, transportation networks, and, more generally, in any scenario where a common set of nodes can be linked via co-existing means of connectivity. © 2018 Copyright held by the owner/author(s).

关键词： Poisson distribution

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：