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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

48 篇 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...
12 篇 univ toronto on
12 篇 georgia inst tec...
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 篇 wattenhofer roge...
18 篇 rui oliveira
17 篇 raynal michel
16 篇 rajsbaum sergio
16 篇 guerraoui rachid
16 篇 kutten shay
16 篇 brandt sebastian
15 篇 karl m. goeschka
15 篇 patt-shamir boaz

语言

4,414 篇 英文
54 篇 其他
4 篇 中文

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

共 4472 条记录，以下是441-450 订阅

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

详细简洁

排序：

Byzantine Agreement and Leader Election: From Classical to the Modern 21

Byzantine Agreement and Leader Election: From Classical to t...

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Augustine, John Molla, Anisur Rahaman Pandurangan, Gopal IIT Madras Dept Comp Sci & Engn Chennai Tamil Nadu India Indian Stat Inst Kolkata Crypto & Secur Res Unit Kolkata W Bengal India Univ Houston Dept Comp Sci Houston TX 77204 USA

ISBN: (纸本)9781450385480

We will present the fundamentals of Byzantine agreement and leader election problems from a modern perspective. Byzantine fault tolerant protocols are at the heart of secure and robust protocols that can tolerate the presence of malicious nodes in a distributed system, such as a Peer-to-Peer (P2P) network, which allows a large number of peers to enter the network with little or no admission control. Such malicious peers acting alone or in collaboration can cause disruption of service in P2P systems. Our tutorial is largely inspired by recent P2P applications like Blockchain and cryptocurrencies that espouse permissionless settings whereby peers can anonymously and dynamically join and leave the network at will. Our presentation will be in three parts. In the first part, we will present the historic foundations of Byzantine agreement and leader election and describe the fundamentals that underlie our modern understanding of these problems. Much of the classical results focus on complete networks where nodes have global knowledge. In the second part, motivated by real-world distributed networks such as P2P networks which are typically sparse and bounded degree with nodes having only local knowledge, we focus on Byzantine protocols for sparse networks. While the first two parts will focus on static settings, motivated by modern applications such as blockchains and cryptocurrencies which operate on dynamic P2P networks, the third part will delve into Byzantine procotols for dynamic networks where nodes continuously join and leave the system. The tutorial will cover various tools and techniques that are useful in designing Byzantine protocols in sparse and dynamic networks and will discuss key open problems in the area.

关键词： Byzantine protocols leader election agreement consensus distributed algorithms blockchain sparse networks P2P networks dynamic networks

来源：评论

学校读者我要写书评

暂无评论

FRAME 2022: The 2nd Workshop on Flexible Resource and Application Management on the Edge 22

FRAME 2022: The 2nd Workshop on Flexible Resource and Applic...

引用

31st International symposium on High-Performance Parallel and distributed computing (HPDC)

作者： Ferrucci, Luca Coppola, Massimo Kavalionak, Hanna Kontopoulos, Ioannis ISTI Consiglio Nazl Ric Pisa Italy Harokopio Univ Athens Athens Greece

ISBN: (纸本)9781450391993

The 2nd InternationalWorkshop on Flexible Resource and Application Management on the Edge (FRAME 2022) is dedicated to the so-called Cloud/Edge Continuum, where Cloud and Edge infrastructures can work together to fulfill requirements from a variety of NextGen applications. Clouds provide appropriate levels of performance to large groups of different users, whereas Edge resources act as a first layer of computing capacity that is closer to the user, to reduce the service latency. With respect to Clouds, Edge infrastructures typically are composed of heterogeneous and constrained resources and introduce new challenges from the viewpoint of security, orchestration and resource management. Tackling these new issues calls for innovative combinations of tools and abstractions, where AI and machine learning techniques complement algorithmic orchestration and optimization, bringing about new levels of distributed adaptivity and self-management. As real-time data-driven decisions can be promptly taken on the spot, without the need to wait for data to travel to the Cloud and back, also interactive and time-sensitive services like the immersive data processing of Extended Reality (XR) applications can be partially extended toward the edge, thus exploiting a better computation to communication tradeoff and smoother connections to improve their QoE and remote collaboration. The FRAME'22 workshop proceedings are available at: https://***/***?id=3526059.

关键词： network mobility edge storage autonomic management federated learning cloud computing resource management artificial intelligence edge continuum virtualization 3d point cloud cloud federation edge computing machine learning edge orchestration

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: distributed Quantum Interactive Proofs 36

Brief Announcement: Distributed Quantum Interactive Proofs

引用

36th International symposium on distributed computing, DISC 2022

作者： Le Gall, François Miyamoto, Masayuki Nishimura, Harumichi Graduate School of Mathematics Nagoya University Japan Graduate School of Informatics Nagoya University Japan

ISBN: (纸本)9783959772556

The study of distributed interactive proofs was initiated by Kol, Oshman, and Saxena [PODC 2018] as a generalization of distributed decision mechanisms (proof-labeling schemes, etc.), and has received a lot of attention in recent years. In distributed interactive proofs, the nodes of an n-node network G can exchange short messages (called certificates) with a powerful prover. The goal is to decide if the input (including G itself) belongs to some language, with as few turns of interaction and as few bits exchanged between nodes and the prover as possible. There are several results showing that the size of certificates can be reduced drastically with a constant number of interactions compared to non-interactive distributed proofs. In this brief announcement, we introduce the quantum counterpart of distributed interactive proofs: certificates can now be quantum bits, and the nodes of the network can perform quantum computation. The main result of this paper shows that by using quantum distributed interactive proofs, the number of interactions can be significantly reduced. More precisely, our main result shows that for any constant k, the class of languages that can be decided by a k-turn classical (i.e., non-quantum) distributed interactive protocol with f(n)-bit certificate size is contained in the class of languages that can be decided by a 5-turn distributed quantum interactive protocol with O(f(n))-bit certificate size. We also show that if we allow to use shared randomness, the number of turns can be reduced to 3-turn. Since no similar turn-reduction classical technique is currently known, our result gives evidence of the power of quantum computation in the setting of distributed interactive proofs as well. © François Le Gall, Masayuki Miyamoto, and Harumichi Nishimura.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

HiPS2022: The 2nd Workshop on High Performance Serverless computing 31

HiPS2022: The 2nd Workshop on High Performance Serverless Co...

引用

31st International symposium on High-Performance Parallel and distributed computing, HPDC 2022

作者： Narasimhamurthy, Sai Lockwood, Glenn Seagate Systems Marlow United Kingdom Lawrence Berkeley National Laboratory BerkeleyCA United States

ISBN: (纸本)9781450391993

Exciting changes are coming to the fore in the world of Storage and I/O for High Performance and Data Intensive computing. Existing data access and data retrieval methods that suitably support the new generation of data intensive applications in the realm of HPC and AI are being re-assessed. These new applications need to support both evolutionary as well as revolutionary approaches to data access and storage. Open source is enabling the adoption of these new techniques. This workshop looks at cutting edge trends in storage systems and solutions for data intensive HPC and AI applications with specific focus primarily on community driven initiatives and commercial products that may inspire the community. © 2022 Owner/Author.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Automated Verification of Idempotence for Stateful Serverless Applications 17

Automated Verification of Idempotence for Stateful Serverles...

引用

17th USENIX symposium on Operating Systems Design and Implementation (OSDI)

作者： Ding, Haoran Wang, Zhaoguo Shen, Zhuohao Chen, Rong Chen, Haibo Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst SEIEE Shanghai Peoples R China Shanghai AI Lab Shanghai Peoples R China

ISBN: (纸本)9781939133342

Serverless computing has become a popular cloud computing paradigm. By default, when a serverless function fails, the serverless platform re-executes the function to tolerate the failure. However, such a retry-based approach requires functions to be idempotent, which means that functions should expose the same behavior regardless of retries. This requirement is challenging for developers, especially when functions are stateful. Failures may cause functions to repeatedly read and update shared states, potentially corrupting data consistency. This paper presents Flux, the first toolkit that automatically verifies the idempotence of serverless applications. It proposes a new correctness definition, idempotence consistency, which stipulates that a serverless function's retry is transparent to users. To verify idempotence consistency, Flux defines a novel property, idempotence simulation, which decomposes the proof for a concurrent serverless application into the reasoning of individual functions. Furthermore, Flux extends existing verification techniques to realize automated reasoning, enabling Flux to identify idempotence-violating operations and fix them with existing log-based methods. We demonstrate the efficacy of Flux with 27 representative serverless applications. Flux has successfully identified previously unknown issues in 12 applications. Developers have confirmed 8 issues. Compared to state-of-the-art systems (namely Beldi and Boki) that log every operation, Flux achieves up to 6x lower latency and 10x higher peak throughput, as it logs only the identified idempotence-violating ones.

关键词：

来源：评论

学校读者我要写书评

暂无评论

distributed computing Systems and Approaches for Polar Science Research: An Interdisciplinary Systematic Review

Distributed Computing Systems and Approaches for Polar Scien...

引用

Cluster, Cloud and Internet computing Workshops (CCGridW), IEEE/acm International symposium on

作者： Pradeeban Kathiravelu Ryan Birmingham University of Alaska Anchorage Anchorage AK USA Emory University Atlanta GA USA

ISBN: (数字)9798350377514

ISBN: (纸本)9798350377521

Polar science is an umbrella term for several research disciplines practiced in Earth’s polar regions and other planets. Polar science research includes studies performed on land (such as geology and archeology on the circumpolar tundra), air (atmospheric research), sky (planetary observations due to dark, clear, and clean skies during the polar nights), and ocean (marine studies in the Arctic and the Southern Oceans). Many polar science research works look into overlapping complementary studies. distributed computing is a discipline of computer science that involves computations across multiple distinct physically separated computing resources, such as computer clusters, clouds, and the edge. distributed computing has enabled efficient, scalable, and elastic execution of complex computational problems on utility hardware without expecting access to expensive infrastructure or *** this paper, we screen 770 for the interdisciplinary research of distributed computing used in or developed for polar science. After systematically removing the irrelevant studies, we assess the full text of 72 papers to understand the distributed systems research landscape for polar science. We then specifically study 22 polar science research works that develop or heavily utilize distributed computing frameworks or principles in detail. Our study finds distributed execution frameworks instrumental for polar science due to the complex and real-time computational needs, coupled with the remote location requiring efficient network bandwidth availability and usage to access remote resources.

关键词： Computer science Cloud computing Planets Instruments Geology Conferences Real-time systems Hardware Computational efficiency Tundra

来源：评论

学校读者我要写书评

暂无评论

distributed Tracing for Cascading Changes of Objects in the Kubernetes Control Plane 25

Distributed Tracing for Cascading Changes of Objects in the ...

引用

40th Annual acm symposium on Applied computing, SAC 2025

作者： Ehira, Tomoyuki Kotani, Daisuke Okabe, Yasuo Kyoto University Kyoto Japan

ISBN: (纸本)9798400706295

Kubernetes is a container orchestration system that employs a declarative configuration management approach. In Kubernetes, each desired and actual state is represented in an "object", and multiple controllers autonomously monitor related objects and update their objects towards the desired state in the control plane. Because of this design, changes to one object cause changes to other objects in a chain, and the time to complete these cascading changes is an important metric for cluster operators to maintain application service quality on the cluster. However, there is no practical way to observe this kind of cascading change in detail, such as sequence of objects updated and the elapsed time of this update. distributed tracing techniques, which are used in the microservice architecture to monitor application performance, are mainly based on RPC model that clearly identify request and response pairs, thus they are not directly applicable to the control plane of Kubernetes, where controllers just monitor objects and autonomously trigger changes to objects. In this paper, we propose a system that automatically traces changes to objects in the control plane. Our method adds one identifier, a Change Propagation ID (CPID), to the metadata of each object, and the controller that observes an object change propagates CPID in the object to the objects that the controller updates. When multiple changes need to be merged on an object, a new CPID is generated, and a pair of the original CPIDs and the new CPID is sent to the trace server for recording and analysis. Through evaluation, we confirmed that the proposed system can capture change propagation and its time, and the overhead of the proposed system is not significant. Copyright © 2025 held by the owner/author(s).

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Efficient Randomized distributed Coloring in CONGEST 2021

Efficient Randomized Distributed Coloring in CONGEST

引用

53rd Annual acm SIGACT symposium on Theory of computing (STOC)

作者： Halldorsson, Magnus M. Kuhn, Fabian Maus, Yannic Tonoyan, Tigran Reykjavik Univ Reykjavik Iceland Univ Freiburg Freiburg Germany Technion Haifa Israel

ISBN: (纸本)9781450380539

distributed vertex coloring is one of the classic problems and probably also the most widely studied problems in the area of distributed graph algorithms. We present a new randomized distributed vertex coloring algorithm for the standard CONGEST model, where the network is modeled as an n-node graph G, and where the nodes of G operate in synchronous communication rounds in which they can exchange O (log n)-bit messages over all the edges of G. For graphs with maximum degree A, we show that the (Delta + 1)-list coloring problem (and therefore also the standard (Delta + 1)-coloring problem) can be solved in O (log(5) log n) rounds. Previously such a result was only known for the significantly more powerful LOCAL model, where in each round, neighboring nodes can exchange messages of arbitrary size. The best previous (Delta + 1)-coloring algorithm in the CONGEST model had a running time of O (log Delta + log(6) log n) rounds. As a function of n alone, the best previous algorithm therefore had a round complexity of O (log n), which is a bound that can also be achieved by a naive folklore algorithm. For large maximum degree Delta, our algorithm hence is an exponential improvement over the previous state of the art.

关键词： randomized vertex coloring CONGEST model

来源：评论

学校读者我要写书评

暂无评论

Increase Performance in CS 2 via a Spiral Redesign of CS 1 2022

Increase Performance in CS 2 via a Spiral Redesign of CS 1

引用

53rd Annual acm SIGCSE Technical symposium on Computer Science Education (SIGCSE)

作者： Lionelle, Albert Ghosh, Sudipto Say, Benjamin Beveridge, J. Ross Colorado State Univ Ft Collins CO 80523 USA Metropolitan Community Coll Omaha NE USA

ISBN: (纸本)9781450390705

Computer Science (CS 1) offerings in most universities tend to be notoriously difficult. Over the past 60 years about a third of the students either fail or drop out of the course. Past research has focused on improving teaching methods through small changes without changing the overall course structure. The premise of our research is that restructuring the CS 1 course using a Spiral pedagogy based on principles for improving memory and recall can help students learn the information and retain it for future courses. Using the principles of Spacing, Interleaving, Elaboration, Practiced Retrieval, and Reflection, we fundamentally redesigned CS 1 with a complete reordering of topics. We evaluated the newly designed CS 1 by comparing the students with those coming from a traditional offering in terms of (1) CS 1 performance, (2) retention of students between CS 1 and 2, and (3) CS 2 performance. We demonstrate that the Spiral method helped students outperform those who learn via the traditional method by 9% on final exam scores in CS 1. Retention is increased between CS 1 and CS 2 with a 19.2% increase for women, and 9.2% overall. Furthermore, students continue to do better in CS 2 with increased grades across all assessments and show a 15% increase in passing grades. We provide a framework for the Spiral methodology so that others may replicate the design. Our results lead us to consider evaluating and improving the underlying methodology with which we teach Computer Science.

关键词： computing education CS1 CS2 course design pedagogy

来源：评论

学校读者我要写书评

暂无评论

Search via Parallel Levy Walks on Z² 21

Search via Parallel Levy Walks on Z<SUP>2</SUP>

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Clementi, Andrea D'Amore, Francesco Giakkoupis, George Natale, Emanuele Univ Roma Tor Vergata Rome Italy Univ Cote dAzur INRIA CNRS I3S Sophia Antipolis France Univ Rennes CNRS INRIA IRISA Rennes France

ISBN: (纸本)9781450385480

Motivated by the Levy foraging hypothesis - the premise that various animal species have adapted to follow Levy walks to optimize their search efficiency - we study the parallel hitting time of Levy walks on the infinite two-dimensional grid. We consider k independent discrete-time Levy walks, with the same exponent alpha is an element of(1, infinity), that start from the same node, and analyze the number of steps until the first walk visits a given target at distance l. We show that for any choice of k and l from a large range, there is a unique optimal exponent alpha(k,l) is an element of(2, 3), for which the hitting time is (O) over tilde (l(2)/k) w.h.p., while modifying the exponent by any constant term epsilon > 0 increases the hitting time by a factor polynomial in l, or the walks fail to hit the target almost surely. Based on that, we propose a surprisingly simple and effective parallel search strategy, for the setting where k and l are unknown: The exponent of each Levy walk is just chosen independently and uniformly at random from the interval (2, 3). This strategy achieves optimal search time (modulo polylogarithmic factors) among all possible algorithms (even centralized ones that know k). Our results should be contrasted with a line of previous work showing that the exponent alpha = 2 is optimal for various search problems. In our setting of k parallel walks, we show that the optimal exponent depends on k and l, and that randomizing the choice of the exponents works simultaneously for all k and l.

关键词： Levy walk parallel Levy walks infinite 2D grid hitting time distributed search Levy foraging hypothesis ANTS problem biological distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 41 42 43 44 45 46 47 48 49 50 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：