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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是651-660 订阅

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

详细简洁

排序：

DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead 20

DConstructor: Efficient and Robust Network Construction with...

引用

39th symposium on principles of distributed computing

作者： Gilbert, Seth Pandurangan, Gopal Robinson, Peter Trehan, Amitabh Natl Univ Singapore Dept Comp Sci Singapore Singapore Univ Houston Dept Comp Sci Houston TX 77004 USA City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Loughborough Univ Dept Comp Sci Loughborough Leics England

ISBN: (纸本)9781450375825

With the rise of dynamic reconfigurable networks such as Peer-to-Peer (P2P) networks, overlay networks, ad hoc wireless and mesh networks, it has become important to construct and maintain topologies with various desirable properties (such as connectivity, low diameter, expansion, low degree etc.) in an efficient decentralized manner. The main result of this paper is a distributed protocol called DConstructor that given any (connected) network topology will "converge" to a given (desired) target topology such as an expander, hypercube, or Chord, with high probability. Our protocol is efficient, lightweight, and scalable, and it incurs only O (polylog(n)) overhead (where.. is the network size) for topology construction and maintenance: only polylogarithmic (in n) bits need to be processed and sent by each node per round, the convergence time is polylogarithmic rounds and any node's computation cost per round is also polylogarithmic. Our protocol is robust and self-repairing in the sense that it will converge to the desired topology in polylogarithmic rounds and polylogarithmic communication cost under dynamic topology changes and arbitrary insertions and deletions of nodes.

关键词： distributed Protocol Peer-to-Peer Network Randomized Algorithm Self-repairing Network Expander

来源：评论

学校读者我要写书评

暂无评论

distributed Approximation on Power Graphs 20

Distributed Approximation on Power Graphs

引用

39th symposium on principles of distributed computing

作者： Bar-Yehuda, Reuven Censor-Hillel, Keren Maus, Yannic Pai, Shreyas Pemmaraju, Sriram V. Technion Israel Inst Technol Haifa Israel Univ Iowa Iowa City IA USA

ISBN: (纸本)9781450375825

We investigate graph problems in the following setting: we are given a graph G and we are required to solve a problem on G(2). While we focus mostly on exploring this theme in the distributed CONGEST model, we also show new results and surprising connections to the centralized model of computation. In the CONGEST model, it is natural to expect that problems on G(2) would be quite difficult to solve efficiently on G, due to congestion. However, we show that the picture is both more complicated and more interesting. Specifically, we encounter two phenomena acting in opposing directions: (i) slowdown due to congestion and (ii) speedup due to structural properties of G(2). We demonstrate these two phenomena via two fundamental graph problems, namely, Minimum Vertex Cover (MVC) and Minimum Dominating Set (MDS). Among our many contributions, the highlights are the following. (1) In the CONGEST model, we show an O(n/epsilon)-round (1 + epsilon)approximation algorithm for MVC on G(2), whereas no o(n(2))round algorithm is known for any better-than-2 approximation for MVC on G. (2) We show a centralized polynomial time 5/3-approximation algorithm for MVC on G(2), whereas a better-than-2 approximation is UGC-hard for G. (3) In contrast, for MDS, in the CONGEST model, we show an (Omega) over tilde (n(2)) lower bound for a constant approximation factor for MDS on G(2), whereas an (Omega) over tilde (n(2)) lower bound for MDS on G is known only for exact computation.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Compact distributed Certification of Planar Graphs 20

Compact Distributed Certification of Planar Graphs

引用

39th symposium on principles of distributed computing

作者： Feuilloley, Laurent Fraigniaud, Pierre Montealegre, Pedro Rapaport, Ivan Remila, Eric Todinca, Ioan Univ Chile Dept Ingn Ind Santiago Chile Univ Paris Paris France CNRS Paris France Univ Adolfo Ibanez Fac Ingn & Ciencias Santiago Chile Univ Chile DIM CMM UMI 2807 CNRS Santiago Chile UJM St Etienne GATE Lyon St Etienne CNRS UMR 5824 St Etienne France Univ dOrleans LIFO Orleans France INSA Ctr Val de Loire Blois Loir & Cher France

ISBN: (纸本)9781450375825

Naor, Parter, and Yogev (SODA 2020) have recently demonstrated the existence of a distributed interactive proof for planarity (i.e., for certifying that a network is planar), using a sophisticated generic technique for constructing distributed IP protocols based on sequential IP protocols. The interactive proof for planarity is based on a distributed certification of the correct execution of any given sequential linear-time algorithm for planarity testing. It involves three interactions between the prover and the randomized distributed verifier (i.e., it is a dMAM protocol), and uses small certificates, on O(logn) bits in n-node networks. We show that a single interaction from the prover suffices, and randomization is unecessary, by providing an explicit description of a proof-labeling scheme for planarity, still using certificates on just O(logn) bits. We also show that there are no proof-labeling schemes - in fact, even no locally checkable proofs - for planarity using certificates on o(logn) bits.

关键词： distributed graph algorithms communication networks fault-tolerance

来源：评论

学校读者我要写书评

暂无评论

Topology-Aware distributed Smart Grid Control using a Clustering-Based Utility Maximization Approach 20

Topology-Aware Distributed Smart Grid Control using a Cluste...

引用

35th Annual acm symposium on Applied computing (SAC)

作者： Stuebs, Marius Ipach, Hanko Becker, Christian Univ Hamburg Hamburg Germany Hamburg Univ Technol Hamburg Germany

ISBN: (纸本)9781450368667

Efficiently balancing supply and demand in the electrical distribution grid is an important Smart Grid service. The development of applicable agent-based concepts for match-making energy generators with consumers is an active research field. Implementing Smart Grids as a system of Micro Grid systems, we propose an efficient decentralized optimization scheme, which avoids central components in order to increase dependability, robustness against communication failures, and denial-of-service attacks. The concept utilizes traditional peer-to-peer functionality in combination with locality-aware routing: Two explicit clusterings are evaluated awl compared to the fully-meshed communication approach. We investigate the impact of node clustering on the optimality and locality of the distributed Smart Grid control algorithm and show that our approach significantly reduces the electrical losses in the examined power distribution grid compared to the centralized approach.

关键词： Smart Grids System of Systems Cyber-Physical System distributed Control Algorithm Topological Clustering Utility Maximization Resilience Controller Hardware-in-the-Loop Iterative Optimization Electrical Power Balancing

来源：评论

学校读者我要写书评

暂无评论

Generalizing the Sharp Threshold Phenomenon for the distributed Complexity of the Lovasz Local Lemma 20

Generalizing the Sharp Threshold Phenomenon for the Distribu...

引用

39th symposium on principles of distributed computing

作者： Brandt, Sebastian Grunau, Christoph Rozhon, Vaclav Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450375825

Recently, Brandt, Maus and Uitto [PODC'19] showed that, in a restricted setting, the dependency of the complexity of the distributed Lovasz Local Lemma (LLL) on the chosen LLL criterion exhibits a sharp threshold phenomenon: They proved that, under the LLL criterion p2(d) < 1, if each random variable affects at most 3 events, the deterministic complexity of the LLL in the LOCAL model is O(d(2) + log* n). In stark contrast, under the criterion p2(d) <= 1, there is a randomized lower bound of O(log logn) by Brandt et al. [STOC'16] and a deterministic lower bound of O(logn) by Chang, Kopelowitz and Pettie [FOCS'16]. Brandt, Maus and Uitto conjectured that the same behavior holds for the unrestricted setting where each random variable affects arbitrarily many events. We prove their conjecture, by providing an algorithm that solves the LLL in time O(d(2) + log* n) under the LLL criterion p2(d) < 1, which is tight in bounded-degree graphs due to an Omega(log* n) lower bound by Chung, Pettie and Su [PODC'14]. By the work of Brandt, Maus and Uitto, obtaining such an algorithm can be reduced to proving that all members in a certain family of functions in arbitrarily high dimensions are convex on some specific domain. Unfortunately, an analytical description of these functions is known only for dimension at most 3, which led to the aforementioned restriction of their result. While obtaining those descriptions for functions of (substantially) higher dimension seems out of the reach of current techniques, we show that their convexity can be inferred by combinatorial means.

关键词： Lovasz Local Lemma LOCAL model exponential criterion sharp threshold phenomenon

来源：评论

学校读者我要写书评

暂无评论

On computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits

On Computing Multilinear Polynomials Using Multi-r-ic Depth ...

引用

作者： Chillara, Suryajith CRI University of Haifa Aba Hushi 199 Mount Carmel Haifa Israel

In this article, we are interested in understanding the complexity of computing multilinear polynomials using depth four circuits in which the polynomial computed at every node has a bound on the individual degree of r≥ 1 with respect to all its variables (referred to as multi-r-ic circuits). The goal of this study is to make progress towards proving superpolynomial lower bounds for general depth four circuits computing multilinear polynomials, by proving better bounds as the value of r increases. Recently, Kayal, Saha and Tavenas (Theory of computing, 2018) showed that any depth four arithmetic circuit of bounded individual degree r computing an explicit multilinear polynomial on nO(1) variables and degree d must have size at least (n/r1.1)ω(ĝd/r). This bound, however, deteriorates as the value of r increases. It is a natural question to ask if we can prove a bound that does not deteriorate as the value of r increases, or a bound that holds for a larger regime of r. In this article, we prove a lower bound that does not deteriorate with increasing values of r, albeit for a specific instance of d = d(n) but for a wider range of r. Formally, for all large enough integers n and a small constant η•, we show that there exists an explicit polynomial on nO(1) variables and degree η (log2 n) such that any depth four circuit of bounded individual degree r ≤ nη• must have size at least exp(ω(log2 n)). This improvement is obtained by suitably adapting the complexity measure of Kayal et al. (Theory of computing, 2018). This adaptation of the measure is inspired by the complexity measure used by Kayal et al. (SIAM J. computing, 2017). © 2021 acm.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

I/O lower bounds for auto-tuning of convolutions in CNNs 21

I/O lower bounds for auto-tuning of convolutions in CNNs

引用

26th acm SIGPLAN symposium on principles and Practice of Parallel Programming, PPoPP 2021

作者： Zhang, Xiaoyang Xiao, Junmin Tan, Guangming State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Science China

ISBN: (纸本)9781450382946

Convolution is the most time-consuming part in the computation of convolutional neural networks (CNNs), which have achieved great successes in numerous practical applications. Due to the complex data dependency and the increase in the amount of model samples, the convolution suffers from high overhead on data movement (i.e., memory access). This work provides comprehensive analysis and methodologies to minimize the communication for the convolution in CNNs. With an in-depth analysis of the recent I/O complexity theory under the red-blue game model, we develop a general I/O lower bound theory for a composite algorithm which consists of several different sub-computations. Based on the proposed theory, we establish the data movement lower bound results for two main convolution algorithms in CNNs, namely the direct convolution and Winograd algorithm, which represents the direct and indirect implementations of a convolution respectively. Next, derived from I/O lower bound results, we design the near I/O-optimal dataflow strategies for the two main convolution algorithms by fully exploiting the data reuse. Furthermore, in order to push the envelope of performance of the near I/O-optimal dataflow strategies further, an aggressive design of auto-tuning based on I/O lower bounds, is proposed to search an optimal parameter configuration for the direct convolution and Winograd algorithm on GPU, such as the number of threads and the size of shared memory used in each thread block. Finally, experiment evaluation results on the direct convolution and Winograd algorithm show that our dataflow strategies with the auto-tuning approach can achieve about 3.32× performance speedup on average over cuDNN. In addition, compared with TVM, which represents the state-of-the-art technique for auto-tuning, not only our auto-tuning method based on I/O lower bounds can find the optimal parameter configuration faster, but also our solution has higher performance than the optimal solution provided

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

distributed Construction of Light Networks 20

Distributed Construction of Light Networks

引用

39th symposium on principles of distributed computing

作者： Elkin, Michael Filtser, Arnold Neiman, Ofer Ben Gurion Univ Negev Beer Sheva Israel Columbia Univ New York NY 10027 USA

ISBN: (纸本)9781450375825

A t -spanner H of a weighted graph G = (V, E, w) is a subgraph that approximates all pairwise distances up to a factor of t. The lightness of H is defined as the ratio between the weight of H to that of the minimum spanning tree. An (alpha, beta)-Shallow Light Tree (SLT) is a tree of lightness beta, that approximates all distances from a designated root vertex up to a factor of alpha. A long line of works resulted in efficient algorithms that produce (nearly) optimal light spanners and SLTs. Some of the most notable algorithmic applications of light spanners and SLTs are in distributed settings. Surprisingly, so far there are no known efficient distributed algorithms for constructing these objects in general graphs. In this paper we devise efficient distributed algorithms in the CONGEST model for constructing light spanners and SLTs, with near optimal parameters. Specifically, for any k >= 1 and 0 < epsilon < 1, we show a (2k - 1) center dot (1 + epsilon)-spanner with lightnessO( k center dot n(1/k)) can be built in (O) over tilde (n 1/2 + 1/4k+2 + D) rounds (where n = |V | and D is the hop-diameter of G). In addition, for any alpha > 1 we provide an (alpha, 1 + O(1)/a-1)-SLT in (root n + D) center dot n(o(1)) rounds. The running times of our algorithms cannot be substantially improved. We also consider spanners for the family of doubling graphs, and devise a (root n + D) center dot n(o(1)) rounds algorithm in the CONGEST model that computes a (1 + epsilon)-spanner with lightness (logn)/epsilon(O(1)). As a stepping stone, which is interesting in its own right, we first develop a distributed algorithm for constructing nets (for arbitrary weighted graphs), generalizing previous algorithms that worked only for unweighted graphs.

关键词： CONGEST Light Spanners Shallow light tree Doubling Dimension

来源：评论

学校读者我要写书评

暂无评论

KYChain: User-Controlled KYC Data Sharing and Certification 20

KYChain: User-Controlled KYC Data Sharing and Certification

引用

35th Annual acm symposium on Applied computing (SAC)

作者： Dragan, Constantin Catalin Manulis, Mark Univ Surrey Surrey Ctr Cyber Secur Guildford Surrey England

ISBN: (纸本)9781450368667

Under Know Your Customer (KYC) regulations, financial institutions are required to verify the identity and assess the trustworthiness of any new client during on-boarding, and maintain up-to-date records for risk management. These processes are time consuming, expensive, typically have sub-par record-keeping steps, and disadvantage clients with nomad lifestyle. In this paper, we introduce KYChain as a privacy-preserving certification mechanism that allows users to share (certified) up-to-date KYC data across multiple financial institutions. We base KYChain on immutable ledgers and show that it offers confidentiality and certification compliance of KYC data.

关键词： Know Your Customer Privacy-Preserving distributed Ledger Technology Certification

来源：评论

学校读者我要写书评

暂无评论

Practical distributed Programming in C++ 20

Practical Distributed Programming in C++

引用

29th International symposium on High-Performance Parallel and distributed computing, HPDC 2020

作者： Drocco, Maurizio Castellana, Vito Giovanni Minutoli, Marco IBM TJ Watson Yorktown HeightsNY United States Pacific Northwest National Laboratory RichlandWA United States

ISBN: (纸本)9781450370523

The need for coupling high performance with productivity is steering the recent evolution of the C++ language where low-level aspects of parallel and distributed computing are now part of the standard or under discussion for inclusion. The Standard Template Library (STL) includes containers and algorithms as primary notions, coupled with execution policies that allow exploiting parallel platforms (e.g., multi-cores) on top of a well-defined operational semantics. In this work, we discuss the design of a stack for STL-compliant containers, iterators, algorithms, and execution policies targeting distributed-memory systems. Finally, we evaluate the proposed approach by analyzing the performance of our proof-of-concept implementation over a set of STL algorithms. © 2020 acm.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 62 63 64 65 66 67 68 69 70 71 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：