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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,074 篇 工学
- 1,045 篇 计算机科学与技术...
- 459 篇 软件工程
- 168 篇 电气工程
- 148 篇 信息与通信工程
- 76 篇 控制科学与工程
- 41 篇 网络空间安全
- 19 篇 电子科学与技术（可...
- 9 篇 农业工程
- 7 篇 建筑学
- 7 篇 化学工程与技术
- 6 篇 机械工程
- 6 篇 生物工程
- 5 篇 材料科学与工程（可...
- 5 篇 生物医学工程（可授...
- 4 篇 光学工程
- 4 篇 仪器科学与技术
302 篇 理学
- 274 篇 数学
- 67 篇 统计学（可授理学、...
- 17 篇 物理学
- 11 篇 系统科学
- 9 篇 生物学
- 8 篇 化学
- 4 篇 大气科学
71 篇 管理学
- 39 篇 管理科学与工程(可...
- 33 篇 图书情报与档案管...
- 24 篇 工商管理
12 篇 经济学
- 12 篇 应用经济学
12 篇 教育学
- 12 篇 教育学
9 篇 法学
- 7 篇 社会学
9 篇 农学
- 9 篇 作物学
1 篇 医学

主题

243 篇 distributed comp...
88 篇 distributed algo...
79 篇 distributed comp...
31 篇 distributed algo...
31 篇 consensus
29 篇 distributed syst...
26 篇 cloud computing
25 篇 algorithms
24 篇 congest model
23 篇 approximation al...
23 篇 computer systems...
23 篇 fault tolerance
20 篇 local model
19 篇 message passing
18 篇 distributed grap...
17 篇 shared memory
16 篇 self-stabilizati...
14 篇 fault-tolerance
14 篇 randomized algor...
13 篇 graph algorithms

机构

26 篇 swiss fed inst t...
24 篇 technion haifa
15 篇 univ freiburg fr...
14 篇 mit cambridge ma...
11 篇 tel aviv univ te...
10 篇 natl univ singap...
9 篇 ben gurion univ ...
9 篇 technion dept co...
9 篇 aalto univ espoo
8 篇 weizmann inst sc...
8 篇 univ michigan an...
8 篇 carnegie mellon ...
7 篇 ben gurion univ ...
6 篇 cispa helmholtz ...
6 篇 national univers...
6 篇 st. olaf college...
5 篇 georgetown univ ...
5 篇 technion
5 篇 department of co...
5 篇 ecole polytech f...

作者

24 篇 kuhn fabian
20 篇 ghaffari mohsen
17 篇 raynal michel
17 篇 elkin michael
17 篇 censor-hillel ke...
16 篇 suomela jukka
16 篇 fraigniaud pierr...
15 篇 wattenhofer roge...
15 篇 pandurangan gopa...
14 篇 peleg david
14 篇 toueg sam
14 篇 rajsbaum sergio
14 篇 kutten shay
14 篇 brandt sebastian
13 篇 patt-shamir boaz
13 篇 guerraoui rachid
12 篇 chang yi-jun
12 篇 balliu alkida
12 篇 maus yannic
12 篇 olivetti dennis

语言

1,356 篇 英文
6 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 2013 ACM symposium on Principles of distributed computing"

共 1363 条记录，以下是61-70 订阅

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

详细简洁

排序：

Fully Local Succinct distributed Arguments 38

Fully Local Succinct Distributed Arguments

引用

38th International symposium on distributed computing, DISC 2024

作者： Tshuva, Eden Aldema Oshman, Rotem Tel Aviv University Israel

ISBN: (纸本)9783959773522

distributed certification is a proof system for detecting illegal network states or improper execution of distributed algorithms. A certification scheme consists of a proving algorithm, which assigns a certificate to each node, and a verification algorithm where nodes use these certificates to decide whether to accept or reject. The system must ensure that all nodes accept if and only if the network is in a legal state, adhering to the principles of completeness and soundness. The main goal is to design a scheme where the verification process is local and the certificates are succinct, while using as efficient as possible proving algorithm. In cryptographic proof systems, the soundness requirement is often relaxed to computational soundness, where soundness is guaranteed only against computationally bounded adversaries. Computationally sound proof systems are called arguments. Recently, Aldema Tshuva, Boyle, Cohen, Moran, and Oshman (TCC 2023) showed that succinct distributed arguments can be used to enable any polynomially bounded distributed algorithm to certify its execution with polylogarithmic-length certificates. However, their approach required a global communication phase, adding O(D) communication rounds in networks of diameter D, which limits its applicability to local algorithms. In this work, we give the first construction of a fully local succinct distributed argument system, where the prover and the verifier are both local. We show that a distributed algorithm that runs in R rounds, has polynomial local computation, and messages of B bits each can be compiled into a self-certifying algorithm that runs in R + polylog(n) rounds and sends messages of size B + polylog(n), with certificates of length polylog(n). This construction has several applications, including self-certification for local algorithms, ongoing certification of long-lived algorithms, and efficient local mending of the certificates when the network changes. © Eden Aldema Tshuva and Rotem O

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

distributed MIS in O (log log n) Awake Complexity 23

Distributed MIS in O (log log n) Awake Complexity

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Dufoulon, Fabien Moses, William K., Jr. Pandurangan, Gopal Univ Houston Houston TX 77004 USA Univ Durham Durham England

ISBN: (纸本)9798400701214

Maximal Independent Set (MIS) is one of the fundamental and most well-studied problems in distributed graph algorithms. Even after four decades of intensive research, the best known (randomized) MIS algorithms have O (log n) round complexity on general graphs [Luby, STOC 1986] (where n is the number of nodes), while the best known lower bound is Omega(root logn/log logn) [Kuhn, Moscibroda, Wattenhofer, Jacm 2016]. Breaking past the O (log n) round complexity upper bound or showing stronger lower bounds have been longstanding open problems. E nergy is a premium resource in various settings such as batterypowered wireless networks and sensor networks. The bulk of the energy is used by nodes when they are awake, i.e., when they are sending, receiving, and even just listening for messages. On the other hand, when a node is sleeping, it does not perform any communication and thus spends very little energy. Several recent works have addressed the problem of designing energy-efficient distributed algorithms for various fundamental problems. These algorithms operate by minimizing the number of rounds in which any node is awake, also called the (worst-case) awake complexity. An intriguing open question is whether one can design a distributed MIS algorithm that has significantly smaller awake complexity compared to existing algorithms. In particular, the question of obtaining a distributed MIS algorithm with o (log n) awake complexity was left open in [Chatterjee, Gmyr, Pandurangan, PODC 2020]. Our main contribution is to show that MIS can be computed in awake complexity that is exponentially better compared to the best known round complexity of O( log n) and also bypassing its fundamental Omega(root logn/log log n) round complexity lower bound exponentially. Specifically, we show that MIS can be computed by a randomized distributed (Monte Carlo) algorithm in O (log log n) awake complexity with high probability.1 However, this algorithm has a round complexity that is O ( poly

关键词： Maximal Independent Set Sleeping model energy-efficient awake complexity round complexity trade-offs

来源：评论

学校读者我要写书评

暂无评论

Completing the Node-Averaged Complexity Landscape of LCLs on Trees 24

Completing the Node-Averaged Complexity Landscape of LCLs on...

引用

43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024

作者： Balliu, Alkida Brandt, Sebastian Kuhn, Fabian Olivetti, Dennis Schmid, Gustav Gran Sasso Science Institute L'Aquila Italy Cispa Helmholtz Center for Information Security Saarbrücken Germany University of Freiburg Freiburg Germany

ISBN: (纸本)9798400706684

The node-averaged complexity of a problem captures the number of rounds nodes of a graph have to spend on average to solve the problem in the LOCAL model. A challenging line of research with regards to this new complexity measure is to understand the complexity landscape of locally checkable labelings (LCLs) on families of bounded-degree graphs. Particularly interesting in this context is the family of bounded-degree trees as there, for the worst-case complexity, we know a complete characterization of the possible complexities and structures of LCL problems. A first step for the node-averaged complexity case has been achieved recently [DISC '23], where the authors in particular showed that in bounded-degree trees, there is a large complexity gap: There are no LCL problems with a deterministic node-averaged complexity between ω(log∗n) and no(1). For randomized algorithms, they even showed that the node-averaged complexity is either O(1) or nω(1). In this work we fill in the remaining gaps and give a complete description of the node-averaged complexity landscape of LCLs on bounded-degree trees. Our contributions are threefold.•On bounded-degree trees, there is no LCL with a node-averaged complexity between ω(1) and (log∗n)o(1).•For any constants 0 1 2 ≤ 1 and ϵ > 0, there exists a constant c and an LCL problem with node-averaged complexity between ω((log∗n)c) and O((log∗n)c+ϵ).•For any constants 0 0, there exists an LCL problem with node-averaged complexity Φ(nx) for some x ϵ [α, α + ϵ]. © 2024 Association for computing Machinery. All rights reserved.

关键词： locally checkable labelings node-averaged complexity distributed complexity theory

来源：评论

学校读者我要写书评

暂无评论

Optimal Eventual Byzantine Agreement Protocols with Omission Failures 23

Optimal Eventual Byzantine Agreement Protocols with Omission...

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Alpturer, Kaya Halpern, Joseph Y. van der Meyden, Ron Cornell Univ Ithaca NY 14850 USA UNSW Sydney Sydney NSW Australia

ISBN: (纸本)9798400701214

Work on optimal protocols for Eventual Byzantine Agreement (EBA)-protocols that, in a precise sense, decide as soon as possible in every run and guarantee that all nonfaulty agents decide on the same value-has focused on full-information protocols (FIPs), where agents repeatedly send messages that completely describe their past observations to every other agent. While it can be shown that, without loss of generality, we can take an optimal protocol to be an FIP, full information exchange is impractical to implement for many applications due to the required message size. We separate protocols into two parts, the information-exchange protocol and the action protocol, so as to be able to examine the effects of more limited information exchange. We then define a notion of optimality with respect to an information-exchange protocol. Roughly speaking, an action protocol P is optimal with respect to an information-exchange protocol epsilon if, with P, agents decide as soon as possible among action protocols that exchange information according to epsilon. We present a knowledge-based EBA program for omission failures all of whose implementations are guaranteed to be correct and are optimal if the information exchange satisfies a certain safety condition. We then construct concrete programs that implement this knowledge-based program in two settings of interest that are shown to satisfy the safety condition. Finally, we show that a small modification of our program results in an FIP that is both optimal and efficiently implementable, settling an open problem posed by Halpern, Moses, and Waarts (SIAM J. Comput., 2001).

关键词： distributed algorithms Epistemic logic Reasoning about knowledge Byzantine Agreement Consensus Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Visibility Algorithms for Dynamic Dependence Analysis and distributed Coherence 23

Visibility Algorithms for Dynamic Dependence Analysis and Di...

引用

28th acm SIGPLAN Annual symposium on principles and Practice of Parallel Programming, PPoPP 2023

作者： Bauer, Michael Slaughter, Elliott Treichler, Sean Lee, Wonchan Garland, Michael Aiken, Alex NVIDIA United States SLAC National Accelerator Laboratory Stanford University United States

ISBN: (纸本)9798400700156

Implicitly parallel programming systems must solve the joint problems of dependence analysis and coherence to ensure apparently-sequential semantics for applications run on distributed memory machines. Solving these problems in the presence of data-dependent control flow and arbitrary aliasing is a challenge that most existing systems eschew by compromising the expressivity of their programming models and/or the performance of their implementations. We demonstrate a general class of solutions to these problems via a reduction to the visibility problem from computer graphics. © 2023 Owner/Author.

关键词： Visibility

来源：评论

学校读者我要写书评

暂无评论

proceedings of the Annual acm symposium on principles of distributed computing

Proceedings of the Annual ACM Symposium on Principles of Dis...

引用

2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge computing Paradigms, TOPIC 2018, in conjunction with the 37th acm symposium on principles of distributed computing, PODC 2018

ISBN: (纸本)9781450357760

The proceedings contain 7 papers. The topics discussed include: Relays: towards a link layer for robust and secure fog computing;distributing computations in fog architectures;scheduling at the edge for assisting cloud real-time systems;enabling exclusive shared access to cloud of things resources;digital epidemiology and beyond;a novel NFV schedule optimization approach with sensitivity to packets dropping positions;and GoEdge: a scalable and stateless local breakout method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Overcoming Congestion in distributed Coloring 22

Overcoming Congestion in Distributed Coloring

引用

acm symposium on principles of distributed computing (PODC)

作者： Halldorsson, Magnus M. Nolin, Alexandre Tonoyan, Tigran Reykjavik Univ Reykjavik Iceland Krisp Technol Inc Yerevan Armenia

ISBN: (纸本)9781450392624

We present a new technique to efficiently sample and communicate a large number of elements from a distributed sampling space. When used in the context of a recent Local algorithm for (degree + 1)-list-coloring (D1LC), this allows us to solve D1LC in O(log(5) log n) Congest rounds, and in only O(log* n) rounds when the graph has minimum degree Omega(log(7) n), w.h.p. The technique also has immediate applications in testing some graph properties locally, and for estimating the sparsity/density of local subgraphs in O(1) CONGEST rounds, w.h.p.

关键词： CONGEST model distributed graph coloring pseudorandomness

来源：评论

学校读者我要写书评

暂无评论

A Cryptographic Hardware Engineering Course based on FPGA and Security Analysis Equipment 24

A Cryptographic Hardware Engineering Course based on FPGA an...

引用

34th Great Lakes symposium on VLSI (GLSVLSI)

作者： Lu, Zhaojun Chen, Qidong Xu, Peng Zhang, Jiliang Qu, Gang HUST Wuhan JinYinHu Lab Sch Cyber Sci & Engn Hubei Key Lab Distributed Syst Secur Wuhan Hubei Peoples R China HUST Sch Cyber Sci & Engn Wuhan Hubei Peoples R China HNU Changsha Coll Integrated Circuits Coll Semicond Changsha Hunan Peoples R China Univ Maryland College Pk MD 20742 USA

ISBN: (纸本)9798400706059

Cryptographic Hardware Engineering (CHE) is an emerging field that amalgamates cryptography principles with hardware design and implementation. It plays an increasingly important role as secure and trustworthy computing and communication is needed in all applications. In order to introduce CHE into undergraduate curriculum to prepare the next generation workforce, students must have a solid theoretical foundation in cryptography, be proficient in digital circuit design, and have access to commercial design tools and equipment. In this paper, we report our experience in developing and teaching a CHE course for junior students. The course consists of three components that are complementary to each other: digital circuits and FPGA design fundamentals, hardware implementation of cryptographic algorithms, and security analysis of cryptographic hardware. Through this course, students get a good comprehension of CHE principles and gain hands-on experience in secure cryptographic hardware design and analysis.

关键词： Cryptographic Hardware Engineering Field Programmable Gate Array Side-Channel Attack Fault Injection Attack

来源：评论

学校读者我要写书评

暂无评论

(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, log n) Time in the distributed and Parallel Settings 23

(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, l...

引用

42nd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2023

作者： Huang, Shang-En Su, Hsin-Hao Boston College Chestnut HillMA United States

ISBN: (纸本)9798400701214

The maximum weighted matching (mwm) problem is one of the most well-studied combinatorial optimization problems in distributed graph algorithms. Despite a long development on the problem, and the recent progress of Fischer, Mitrovic, and Uitto [16] who gave a poly(1/ϵ, log n)-round algorithm for obtaining a (1 - ϵ)-approximate solution for unweighted maximum matching, it had been an open problem whether a (1 - ϵ)-approximate mwm can be obtained in poly(1/ϵ, log n) rounds in the CONGEST model. Algorithms with such running times were only known for special graph classes such as bipartite graphs [1] and minor-free graphs [8]. For general graphs, the previously known algorithms require exponential in (1/ϵ) rounds for obtaining a (1 - ϵ)-approximate solution [13] or achieve an approximation factor of at most 2/3 [1]. In this work, we settle this open problem by giving a deterministic poly(1/ϵ, log n)-round algorithm for computing a (1 - ϵ)-approximate mwm for general graphs in the CONGEST model. Our proposed solution extends the algorithm of Fischer, Mitrovic, and Uitto [16], blends in the sequential algorithm from Duan and Pettie [11] and the work of Faour, Fuchs, and Kuhn [13]. Interestingly, this solution also implies a CREW PRAM algorithm with poly(1/ϵ, log n) span using only O(m) processors, and a poly(1/ϵ)-passes algorithm in the semi-streaming model. © 2023 Owner/Author(s).

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Quantum Byzantine Agreement Against Full-Information Adversary 38

Quantum Byzantine Agreement Against Full-Information Adversa...

引用

38th International symposium on distributed computing, DISC 2024

作者： Li, Longcheng Sun, Xiaoming Zhu, Jiadong State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783959773522

We exhibit that, when given a classical Byzantine agreement protocol designed in the private-channel model, it is feasible to construct a quantum agreement protocol that can effectively handle a full-information adversary. Notably, both protocols have equivalent levels of resilience, round complexity, and communication complexity. In the classical private-channel scenario, participating players are limited to exchanging classical bits, with the adversary lacking knowledge of the exchanged messages. In contrast, in the quantum full-information setting, participating players can exchange qubits, while the adversary possesses comprehensive and accurate visibility into the system’s state and messages. By showcasing the reduction from quantum to classical frameworks, this paper demonstrates the strength and flexibility of quantum protocols in addressing security challenges posed by adversaries with increased visibility. It underscores the potential of leveraging quantum principles to improve security measures without compromising on efficiency or resilience. By applying our reduction, we demonstrate quantum advantages in the round complexity of asynchronous Byzantine agreement protocols in the full-information model. It is well known that in the full-information model, any classical protocol requires Ω(n) rounds to solve Byzantine agreement with probability one even against Fail-stop adversary when resilience t = Θ(n) [2]. We show that quantum protocols can achieve O(1) rounds (i) with resilience t 0, therefore surpassing the classical lower bound. © Longcheng Li, Xiaoming Sun, and Jiadong Zhu.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共137页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：