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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,316 篇 会议
151 篇 期刊文献
6 册 图书

馆藏范围

4,472 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

3,283 篇 工学
- 3,129 篇 计算机科学与技术...
- 1,640 篇 软件工程
- 413 篇 信息与通信工程
- 374 篇 电气工程
- 224 篇 控制科学与工程
- 82 篇 电子科学与技术（可...
- 53 篇 网络空间安全
- 48 篇 生物工程
- 34 篇 机械工程
- 30 篇 建筑学
- 24 篇 动力工程及工程热...
- 22 篇 生物医学工程（可授...
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 18 篇 农业工程
- 16 篇 材料科学与工程（可...
807 篇 理学
- 672 篇 数学
- 129 篇 统计学（可授理学、...
- 66 篇 系统科学
- 52 篇 生物学
- 43 篇 物理学
- 26 篇 化学
376 篇 管理学
- 225 篇 管理科学与工程(可...
- 176 篇 图书情报与档案管...
- 171 篇 工商管理
120 篇 教育学
- 120 篇 教育学
46 篇 法学
- 37 篇 社会学
45 篇 经济学
- 44 篇 应用经济学
17 篇 农学
- 17 篇 作物学
16 篇 医学
1 篇 文学
1 篇 军事学

主题

377 篇 distributed comp...
259 篇 distributed comp...
134 篇 distributed algo...
107 篇 grid computing
99 篇 cloud computing
93 篇 distributed syst...
91 篇 computational mo...
61 篇 concurrent compu...
61 篇 computer network...
55 篇 computer science
53 篇 fault tolerance
50 篇 distributed algo...
49 篇 application soft...
48 篇 algorithms
46 篇 parallel computi...
44 篇 computer archite...
44 篇 distributed data...
43 篇 message passing
42 篇 computer systems...
41 篇 high performance...

机构

47 篇 swiss fed inst t...
32 篇 technion haifa
30 篇 universidade do ...
27 篇 carnegie mellon ...
24 篇 mit cambridge ma...
22 篇 univ freiburg fr...
17 篇 vienna universit...
16 篇 univ michigan an...
15 篇 university of au...
14 篇 tel aviv univ te...
14 篇 natl univ singap...
13 篇 georgia inst tec...
12 篇 univ toronto on
12 篇 uas technikum vi...
12 篇 ben gurion univ ...
12 篇 cornell univ ith...
12 篇 aalto univ espoo
12 篇 univ calif berke...
11 篇 ecole polytech f...
11 篇 indiana univ blo...

作者

33 篇 kuhn fabian
31 篇 ghaffari mohsen
24 篇 elkin michael
22 篇 awerbuch baruch
22 篇 chen haibo
22 篇 pandurangan gopa...
21 篇 suomela jukka
20 篇 censor-hillel ke...
19 篇 peleg david
19 篇 fraigniaud pierr...
18 篇 chang yi-jun
18 篇 rui oliveira
17 篇 raynal michel
17 篇 wattenhofer roge...
16 篇 rajsbaum sergio
16 篇 guerraoui rachid
16 篇 kutten shay
16 篇 brandt sebastian
15 篇 karl m. goeschka
15 篇 patt-shamir boaz

语言

4,388 篇 英文
81 篇 其他
4 篇 中文

检索条件"任意字段=Proceedings of the ACM Symposium on Principles of Distributed Computing"

共 4473 条记录，以下是591-600 订阅

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

详细简洁

排序：

P³S: A High Accuracy Probabilistic Prediction Processing System for CNN Acceleration 22

P<SUP>3</SUP>S: A High Accuracy Probabilistic Prediction Pro...

引用

32nd Great Lakes symposium on VLSI (GLSVLSI)

作者： Xiao, Hang Xu, Haobo Chen, Xiaoming Wang, Yujie Han, Yinhe Univ Chinese Acad Sci Chinese Acad Sci Inst Comp Technol Res Ctr Intelligent Comp Syst Beijing Peoples R China

ISBN: (纸本)9781450393225

Convolutional Neural Networks (CNNs) achieve state-of-the-art performance for perception tasks at the cost of billions of computational operations. In this paper, we propose a probabilistic prediction processing system, dubbed (PS)-S-3, to eliminate redundant compute-heavy convolution operations by predicting whether output activations are zero-valued. By exploiting the probability characteristic of Gaussian-like distributed activations and weights in CNNs, (PS)-S-3 calculates the partial convolution across values greater than a standard deviation-related threshold, to predict the ineffectual output activations. (PS)-S-3 skips remaining convolutions and sets outputs to zero in advance if output activations are predicted to be zero. (PS)-S-3 reduces 67% computations within 0.2% accuracy loss and does not even require retraining or fine-tuning CNNs. We further implement a (PS)-S-3-based CNN accelerator that achieves 2.02x speedup and 2.23x energy efficiency on average over the traditional accelerator. Compared with the state-of-the-art prediction-based accelerator with 3% accuracy degradation, our (PS)-S-3 yields up to 1.49x speedup and 1.69x energy efficiency.

关键词： CNN accelerator predictive activation computation reduction approximate computing

来源：评论

学校读者我要写书评

暂无评论

Fine-grained Analysis on Fast Implementations of distributed Multi-writer Atomic Registers 20

Fine-grained Analysis on Fast Implementations of Distributed...

引用

39th symposium on principles of distributed computing

作者： Huang, Kaile Huang, Yu Wei, Hengfeng Nanjing Univ State Key Lab Novel Software Technol Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781450375825

distributed multi-writer atomic registers are at the heart of a large number of distributed algorithms. While enjoying the benefits of atomicity, researchers further explore fast implementations of atomic reigsters which are optimal in terms of data access latency. Though it is proved that multi-writer atomic register implementations are impossible when both read and write are required to be fast, it is still open whether implementations are impossible when only write or read is required to be fast. This work proves the impossibility of fast write implementations based on a series of chain arguments among indistiguishable executions. We also show the necessary and sufficient condition for fast read implementations by extending the results in the single-writer case. This work concludes a series of studies on fast implementations of distributed atomic registers.

关键词： atomicity fast implementation impossibility result chain argument

来源：评论

学校读者我要写书评

暂无评论

Session details: Theme: distributed systems: MCANET - mobile computing and applications and networking track 22

Session details: Theme: Distributed systems: MCANET - mobile...

引用

proceedings of the 37th acm/SIGAPP symposium on Applied computing

作者： Hong Va Leong Sheikh Iqbal Ahamed Mario M. Freire Maria Curado Ivan Ganchev The Hong Kong Polytechnic University China Marquette University University of Beira Interior Portugal University of Coimbra Portugal University of Limerick Ireland

No abstract available.

ISBN: (纸本)9781450387132

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Byzantine Agreement with Unknown Participants and Failures 20

Brief Announcement: Byzantine Agreement with Unknown Partici...

引用

39th symposium on principles of distributed computing

作者： Khanchandani, Pankaj Wattenhofer, Roger Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450375825

A set of participants that want to agree on a common opinion despite the presence of malicious or Byzantine participants need to solve an instance of a Byzantine agreement problem. This classic problem has been well studied but most of the existing solutions assume that the participants are aware of n - the total number of participants in the system - and f - the upper bound on the number of Byzantine participants. In this paper, we examine a synchronous system with Byzantine faults where the participants are neither aware of n nor f. The participants have unique identifiers, which are not necessarily consecutive. For such a system, we give algorithms for rotor-coordinator and consensus, both with the resiliency of n > 3f, which is also the optimal resiliency for solving consensus when the participants know n and f. Thus, resiliency is unaffected even if the Byzantine participants can lie about n and f.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

IHC 2021 - proceedings of the 20th Brazilian symposium on Human Factors in computing Systems

IHC 2021 - Proceedings of the 20th Brazilian Symposium on Hu...

引用

20th Brazilian symposium on Human Factors in computing Systems, IHC 2021

ISBN: (纸本)9781450386173

The proceedings contain 56 papers. The topics discussed include: affecting userâ€™s self-esteem: analysis under the self-determination theory perspective and design recommendations;analysis and convergence of studies on recommendations for digital memorials;analysis of the user experience with a multiperspective tool for explainable machine learning in light of interactive principles;analytical model for classifying areas of interest in interactive systems;analyzing the presentation of multilingual user reviews in accommodation websites;applying usability heuristics in the context of labeling systems;beyond barriers: a practical analysis of the SIM-SR method to inspect the communicability of interactive systems for visually impaired users;building an iot programming environment with and for preschool children;and challenges of interaction design for counter-hegemonic contexts: highlighting and overcoming contradictions for social transformation and responsiveness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Tight distributed Listing of Cliques 32

Tight Distributed Listing of Cliques

引用

32nd Annual acm-SIAM symposium on Discrete Algorithms (SODA)

作者： Censor-Hillel, Keren Chang, Yi-Jun Le Gall, Francois Leitersdorf, Dean Technion Haifa Israel Swiss Fed Inst Technol Zurich Switzerland Nagoya Univ Nagoya Aichi Japan

ISBN: (纸本)9781611976465

Much progress has recently been made in understanding the complexity landscape of subgraph finding problems in the CONGEST model of distributed computing. However, so far, very few tight bounds are known in this area. For triangle (i.e., 3-clique) listing, an optimal (O) over tilde (n(1/3))-round distributed algorithm has been constructed by Chang et al. [SODA 2019, PODC 2019]. Recent works of Eden et al. [DISC 2019] and of Censor-Hillel et al. [PODC 2020] have shown sublinear algorithms for K-p-listing, for each p >= 4, but still leaving a significant gap between the upper bounds and the known lower bounds of the problem. In this paper, we completely close this gap. We show that for each p >= 4, there is an (O) over tilde (n(1-2/p))-round distributed algorithm that lists all p-cliques K-p in the communication network. Our algorithm is optimal up to a polylogarithmic factor, due to the (Omega) over tilde (n(1-2/p))-round lower bound of Fischer et al. [SPAA 2018], which holds even in the CONGESTED CLIQUE model. Together with the trianglelisting algorithm by Chang et al. [SODA 2019, PODC 2019], our result thus shows that the round complexity of K-p-listing, for all p, is the same in both the CONGEST and CONGESTED CLIQUE models, at (Theta) over tilde (n(1-2/p)) rounds. For p = 4, our result additionally matches the (Omega) over tilde (n(1/2)) lower bound for K-4 -detection by Czumaj and Konrad [DISC 2018], implying that the round complexities for detection and listing of K-4 are equivalent in the CONGEST model.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

How much does randomness help with locally checkable problems? 20

How much does randomness help with locally checkable problem...

引用

39th symposium on principles of distributed computing

作者： Balliu, Alkida Brandt, Sebastian Olivetti, Dennis Suomela, Jukka Univ Freiburg Freiburg Germany Swiss Fed Inst Technol Zurich Switzerland Aalto Univ Espoo Finland

ISBN: (纸本)9781450375825

Locally checkable labeling problems (LCLs) are distributed graph problems in which a solution is globally feasible if it is locally feasible in all constant-radius neighborhoods. Vertex colorings, maximal independent sets, and maximal matchings are examples of LCLs. On the one hand, it is known that some LCLs benefit exponentially from randomness-for example, any deterministic distributed algorithm that finds a sinkless orientation requires Theta(logn) rounds in the LOCAL model, while the randomized complexity of the problem is Theta(log logn) rounds. On the other hand, there are also many LCLs in which randomness is useless. Previously, it was not known whether there are any LCLs that benefit from randomness, but only subexponentially. We show that such problems exist: for example, there is an LCL with deterministic complexity Theta(log(2) n) rounds and randomized complexity T(logn log logn) rounds.

关键词： locally checkable labeling problems LOCAL model distributed computational complexity

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerance in distributed Optimization: The Case of Redundancy 20

Fault-Tolerance in Distributed Optimization: The Case of Red...

引用

39th symposium on principles of distributed computing

作者： Gupta, Nirupam Vaidya, Nitin H. Georgetown Univ Dept Comp Sci Washington DC 20057 USA

ISBN: (纸本)9781450375825

This paper considers the problem of Byzantine fault-tolerance in distributed multi-agent optimization. In this problem, each agent has a local cost function. The goal of a distributed optimization algorithm is to allow the agents to collectively compute a minimum of their aggregate cost function. We consider the case when a certain number of agents may be Byzantine faulty. Such faulty agents may not follow a prescribed algorithm, and they may send arbitrary or incorrect information regarding their local cost functions. Unless a fault-tolerance mechanism is employed, traditional distributed optimization algorithms cannot tolerate such faulty agents. A reasonable goal in presence of faulty agents is to minimize the aggregate cost of the non-faulty agents. However, we show that this goal is impossible to achieve unless the cost functions of the non-faulty agents have a minimal redundancy property. We further propose a distributed optimization algorithm that allows the non-faulty agents to obtain a minimum of their aggregate cost if the minimal redundancy property holds. The scope of our algorithm is demonstrated through distributed sensing and learning applications, which are special cases of distributed optimization.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

On the Locality of the Lovász Local Lemma 25

On the Locality of the Lovász Local Lemma

引用

proceedings of the 57th Annual acm symposium on Theory of computing

作者： Peter Davies-Peck Durham University Durham United Kingdom

ISBN: (纸本)9798400715105

The Lovász Local Lemma is a versatile result in probability theory, characterizing circumstances in which a collection of n ‘bad events’, each occurring with probability at most p and dependent on a set of underlying random variables, can be avoided. It is a central tool of the probabilistic method, since it can be used to show that combinatorial objects satisfying some desirable properties must exist. While the original proof was existential, subsequent work has shown algorithms for the Lovász Local Lemma: that is, in circumstances in which the lemma proves the existence of some object, these algorithms can constructively find such an object. One main strand of these algorithms, which began with Moser and Tardos’s well-known result (Jacm 2010), involves iteratively resampling the dependent variables of satisfied bad events until none remain *** this paper, we present a novel analysis that can be applied to resampling-style Lovász Local Lemma algorithms. This analysis shows that an output assignment for the dependent variables of most events can be determined only from O(loglog1/p n)-radius local neighborhoods, and that the events whose variables may still require resampling can be identified from these neighborhoods. This allows us to improve randomized complexities for the constructive Lovász Local Lemma (with polynomial criterion) in several parallel and distributed *** particular, we obtain a LOCAL algorithm with O(loglog1/p n) node-averaged complexity (while matching the O(log1/p n) worst-case complexity of Chung, Pettie, and Su), an algorithm for the LCA and VOLUME models requiring dO(loglog1/p n) probes per query, and an O(logloglog1/p n)-round algorithm for the CONGESTED CLIQUE, linear space MPC, and Heterogenous MPC models.

关键词： distributed Algorithms

来源：评论

学校读者我要写书评

暂无评论

Creative Labs in a CS1 Course: Self-directed Labs Enhance Inclusivity in Computer Science Learning 2024

Creative Labs in a CS1 Course: Self-directed Labs Enhance In...

引用

proceedings of the 55th acm Technical symposium on Computer Science Education V. 2

作者： Melinda Mcdaniel Georgia Institute of Technology Atlanta USA

ISBN: (纸本)9798400704246

Most CS1 classes are designed to teach programming and computational thinking using a specific programming language such as Python or Java. This type of in-depth study leaves little room for creative exploration by students. In particular, at large colleges and universities, the programming assignments are usually autograded to keep up with expanding enrollment. This lightning talk will introduce the idea that simply adding three creative labs that do not use the actual course material, but instead expose students to other computing concepts, can give the students who are struggling a chance to catch up, while also offering them a much-needed breather doing something in computing that is individually directed and *** the last few years, my Teaching Assistants (TAs) and I have developed three simple web development labs as assignments for our large CS1 classes. These three labs are usually given around each of the exam weeks and provide a much-needed break for the students from the regular class material that continues to build upon prior learning. Many students report that the labs were their favorite part of the course because they were creative and *** lightning talk aims to gather feedback on this concept and assess its potential for integration into advanced CS courses. I'm also keen to hear suggestions for alternative labs in a CS1 class that would both introduce students to further CS principles and allow them to showcase their creativity.

关键词： computing education creativity cs1 individualized instruction

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 56 57 58 59 60 61 62 63 64 65 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：