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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

372 篇 distributed comp...
262 篇 distributed comp...
134 篇 distributed algo...
106 篇 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...
42 篇 edge computing

机构

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,425 篇 英文
44 篇 其他
4 篇 中文

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

共 4473 条记录，以下是151-160 订阅

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

详细简洁

排序：

HPDC 2023 - proceedings of the 32nd International symposium on High-Performance Parallel and distributed computing

HPDC 2023 - Proceedings of the 32nd International Symposium ...

引用

32nd International symposium on High-Performance Parallel and distributed computing, HPDC 2023

ISBN: (纸本)9798400701559

The proceedings contain 36 papers. The topics discussed include: computing everywhere, all at once: harnessing the computing continuum for science;redundancy-free high-performance dynamic GNN training with hierarchical pipeline parallelism;Auto-HPCnet: an automatic framework to build neural network-based surrogate for high-performance computing applications;performance optimization using multimodal modeling and heterogeneous GNN;GPU-enabled asynchronous multi-level checkpoint caching and prefetching;RAPIDS: reconciling availability, accuracy, and performance in managing geo-distributed scientific data;FZ-GPU: a fast and high-ratio lossy compressor for scientific computing applications on GPUs;closing the performance gap between leveling and tiering compaction via bundle compaction;and let it go: relieving garbage collection pain for latency critical applications in Golang.

关键词：

来源：评论

学校读者我要写书评

暂无评论

distributed Edge Coloring in Time Polylogarithmic in " 41

Distributed Edge Coloring in Time Polylogarithmic in "

引用

41st acm symposium on principles of distributed computing, PODC 2022

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

ISBN: (纸本)9781450392624

We provide new deterministic algorithms for the edge coloring problem, which is one of the classic and highly studied distributed local symmetry breaking problems. As our main result, we show that a (2Δ- 1)-edge coloring can be computed in time poly log Δ+ O(log∗n) in the LOCAL model. This improves a result of Balliu, Kuhn, and Olivetti [PODC '20], who gave an algorithm with a quasi-polylogarithmic dependency on ". We further show that in the CONGEST model, an (8 + ) "-edge coloring can be computed in poly log Δ+ O(log∗n) rounds. The best previous O( ")-edge coloring algorithm that can be implemented in the CONGEST model is by Barenboim and Elkin [PODC '11] and it computes a 2O(1/) "- edge coloring in time O( "+ log∗n) for any ĝ (0, 1]. © 2022 acm.

关键词： Coloring

来源：评论

学校读者我要写书评

暂无评论

A Case Study of Taking AP Computer Science principles: A Student's Perspective 2024

A Case Study of Taking AP Computer Science Principles: A Stu...

引用

55th acm Technical symposium on Computer Science Education, SIGCSE 2024

作者： Cameron, Sarah Pham, Tony Bagui, Sikha Department of Computer Science University of West Florida PensacolaFL United States

ISBN: (纸本)9798400704246

With the increased demand for Computer Science degrees in the work force, Computer Science is becoming more prominent in high schools. AP Computer Science principles (AP CSP) is a course that serves as a bridge into Computer Science. *** provides a year-long curriculum for this AP course to be led by teachers in the classroom. Beyond an analysis of the pass rates of students, and with the recency of the AP CSP course, a reflection of the AP CSP curriculum from the student's perspective is in order. This study breaks down the strengths and weaknesses of AP CSP from a student's perspective. Results show there are many strengths compared to weaknesses in relation to the *** curriculum. However, the course can be a little challenging in motivating and engaging students if not executed properly by the teacher. © 2024 Owner/Author.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

Creating a Quantum Programming Course from Scratch A Computer Science Professor's Journey 2025

Creating a Quantum Programming Course from Scratch A Compute...

引用

56th Technical symposium on Computer Science Education

作者： Guerin, Joshua T. Univ Northern Colorado Greeley CO 80639 USA

ISBN: (纸本)9798400705328

Quantum computing is generating significant excitement within the interdisciplinary academic community, government, and industry. Despite rapid growth in the area, formal education in non-classical computing is limited or absent in many computer science programs. Among the contributing factors is the cutting-edge nature of the field and, until somewhat recently, lack of available platforms for development. Consequently, many computer science graduates will enter the field with little or no background, or even conversational fluency in basic quantum principles. In the near term this will hinder broader adoption of quantum technologies, and will leave interested students underprepared for possible careers in the area or continued studies in graduate school. This experience report details the creation of a new course in Quantum Programming at a mid-sized, regional comprehensive university from initial conception to deployment. This work differs from previous treatments, as the professor came into the project without any background in quantum computing or physics. The course was written from a software-development perspective and is intended for a post-secondary audience from interdisciplinary, technical backgrounds. The course was successfully deployed in the fall semester of 2022 with positive reactions by both students and the professor. The author hopes that this project will add to the growing body of literature in this area, and serve as a template for other educators.

关键词： quantum computing quantum programming experience report curriculum instruction pedagogy

来源：评论

学校读者我要写书评

暂无评论

PPDP '24: proceedings of the 26th International symposium on principles and Practice of Declarative Programming 26

PPDP '24: Proceedings of the 26th International Symposium on...

引用

26th International symposium on principles and Practice of Declarative Programming, PPDP 2024, 26th International symposium on Formal Methods and held in conjunction with LOPSTR 2024

作者： Bruni, Alessandro Momigliano, Alberto Pradella, Matteo Rossi, Matteo

ISBN: (纸本)9798400709692

The proceedings contain 19 papers. The topics discussed include: a simple view of multiparty session types;on the preciseness of subtyping in session types: 10 years later;higher-order unification for free!: reusing the meta-language unification for the object language;declarative macro-programming of collective systems with aggregate computing: an experience report;hierarchical higher-order port-graphs: a rewriting-based modelling language;on the almost-sure termination of binary sessions;formal verification of executable matrix inversion via adjoint matrix and gaussian elimination;grammar-based pattern matching and type checking for difference data structures;evidence tampering and chain of custody in layered attestations;and towards effective ASP-based stream reasoning: facilitate the reasoning over patterns of events.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal distributed Dominating Set in Bounded Arboricity Graphs 22

Near-Optimal Distributed Dominating Set in Bounded Arboricit...

引用

acm symposium on principles of distributed computing (PODC)

作者： Dory, Michal Ghaffari, Mohsen Ilchi, Saeed Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450392624

We describe a simple deterministic O(epsilon(-1) log Delta) round distributed algorithm for (2 alpha+ 1) (1 + epsilon) approximation of minimum weighted dominating set on graphs with arboricity at most alpha. Here Delta denotes the maximum degree. We also show a lower bound proving that this round complexity is nearly optimal even for the unweighted case, via a reduction from the celebrated KMW lower bound on distributed vertex cover approximation [Kuhn, Moscibroda, and Wattenhofer Jacm'16]. Our algorithm improves on all the previous results (that work only for unweighted graphs) including a randomized O(alpha(2)) approximation in O(log n) rounds [Lenzen and Wattenhofer DISC'10], a deterministic O(alpha log Delta) approximation in O(log Delta) rounds [Lenzen and Wattenhofer DISC'10], a deterministic O(alpha) approximation in O(log(2) Delta) rounds [implicit in Bansal and Umboh IPL'17 and Kuhn, Moscibroda, and Wattenhofer SODA'06], and a randomized O(alpha) approximation in O(alpha log n) rounds [Morgan, Solomon and Wein DISC'21]. We also provide a randomized O(alpha log Delta) round distributed algorithm that sharpens the approximation factor to alpha (1 + o(1)). If each node is restricted to do polynomial-time computations, our approximation factor is tight in the first order as it is NP-hard to achieve alpha - 1 - epsilon approximation [Bansal and Umboh IPL'17].

关键词： distributed computing Dominating Set Arboricity Approximation Algorithms

来源：评论

学校读者我要写书评

暂无评论

proceedings - 23rd IEEE/acm International symposium on Cluster, Cloud and Internet computing, CCGrid 2023

Proceedings - 23rd IEEE/ACM International Symposium on Clust...

引用

23rd IEEE/acm International symposium on Cluster, Cloud and Internet computing, CCGrid 2023

ISBN: (纸本)9798350301199

The proceedings contain 59 papers. The topics discussed include: rethinking design paradigm of graph processing system with a CXL-like memory semantic fabric;a case study of data management challenges presented in large-scale machine learning workflows;an asynchronous dataflow-driven execution model for distributed accelerator computing;an empirical study of container image configurations and their impact on start times;how workflow engines should talk to resource managers: a proposal for a common workflow scheduling interface;Layercake: efficient inference serving with cloud and mobile resources;optimal sizing of a globally distributed low carbon cloud federation;predicting the performance-cost trade-off of applications across multiple systems;a deep learning pipeline parallel optimization method;HDFL: a heterogeneity and client dropout-aware federated learning framework;heterogeneous federated learning using dynamic model pruning and adaptive gradient;and measuring the impact of gradient accumulation on cloud-based distributed training.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GEOtiled: A ScalableWorkflow for Generating Large Datasets of High-Resolution Terrain Parameters 23

GEOtiled: A ScalableWorkflow for Generating Large Datasets o...

引用

32nd International symposium on High-Performance Parallel and distributed computing (HPDC) part of the acm Federated computing Research Conference (FCRC)

作者： Roa, Camila Olaya, Paula Llamas, Ricardo Vargas, Rodrigo Taufer, Michela Univ Tennessee Knoxville TN 37916 USA Univ Delaware Newark DE USA

ISBN: (纸本)9798400701559

Terrain parameters such as slope, aspect, and hillshading are essential in various applications, including agriculture, forestry, and hydrology. However, generating high-resolution terrain parameters is computationally intensive, making it challenging to provide these value-added products to communities in need. We present a scalable workflow called GEOtiled that leverages data partitioning to accelerate the computation of terrain parameters from digital elevation models, while preserving accuracy. We assess our workflow in terms of its accuracy and wall time by comparing it to SAGA, which is highly accurate but slow to generate results, and to GDAL, which supports memory optimizations but not data parallelism. We obtain a coefficient of determination (R-2) between GEOtiled and SAGA of 0.794, ensuring accuracy in our terrain parameters. We achieve an X6 speedup compared to GDAL when generating the terrain parameters at a high-resolution (10 m) for the Contiguous United States (CONUS).

关键词： High Throughput computing Data Partitioning Cloud computing Soil moisture

来源：评论

学校读者我要写书评

暂无评论

Speedup of distributed Algorithms for Power Graphs in the CONGEST Model 38

Speedup of Distributed Algorithms for Power Graphs in the CO...

引用

38th International symposium on distributed computing, DISC 2024

作者： Barenboim, Leonid Goldenberg, Uri Open University of Israel Ra’anana Israel Ben-Gurion University of the Negev Beersheba Israel

ISBN: (纸本)9783959773522

We obtain improved distributed algorithms in the CONGEST message-passing setting for problems on power graphs of an input graph G. This includes Coloring, Maximal Independent Set, and related problems. For R = f(∆k, n), we develop a general deterministic technique that transforms R-round LOCAL model algorithms for Gk with certain properties into O(R · ∆k/2-1)-round CONGEST algorithms for Gk. This improves the previously-known running time for such transformation, which was O(R · ∆k-1). Consequently, for problems that can be solved by algorithms with the required properties and within polylogarithmic number of rounds, we obtain quadratic improvement for Gk and exponential improvement for G2. We also obtain significant improvements for problems with larger number of rounds in G. Notable implications of our technique are the following deterministic distributed algorithms: We devise a distributed algorithm for O(∆4)-coloring of G2 whose number of rounds is O(log ∆ + log∗ n). This improves exponentially (in terms of ∆) the best previously-known deterministic result of Halldorsson, Kuhn and Maus.[25] that required O(∆ + log∗ n) rounds, and the standard simulation of Linial [30] algorithm in Gk that required O(∆ · log∗ n) rounds. We devise an algorithm for O(∆2)-coloring of G2 with O(∆ · log ∆ + log∗ n) rounds, and (∆2 + 1)-coloring with O(∆1.5 · log ∆ + log∗ n) rounds. This improves quadratically, and by a power of 4/3, respectively, the best previously-known results of Halldorsson, Khun and Maus. [25]. For k > 2, our running time for O(∆2k)-coloring of Gk is O(k · ∆k/2-1 · log ∆ · log∗ n). Our running time for O(∆k)-coloring of Gk is Õ(k · ∆k-1 · log∗ n). This improves best previously-known results quadratically, and by a power of 3/2, respectively. For constant k > 2, our upper bound for O(∆2k)-coloring of Gk nearly matches the lower bound of Fraigniaud, Halldorsson and Nolin. [16] for checking the correctness of a coloring in Gk © Leonid Barenboim and Uri Goldenberg.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model 22

Brief Announcement: Near Optimal Bounds for Replacement Path...

引用

acm symposium on principles of distributed computing (PODC)

作者： Manoharan, Vignesh Ramachandran, Vijaya Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781450392624

We present round complexity results in the CONGEST model for Replacement Paths (RPaths), Minimum Weight Cycle (MWC), and All Nodes Shortest Cycles (ANSC). We study these fundamental problems in both directed and undirected graphs, weighted and unweighted. Many of our results are optimal to within a polylog factor: For an.. -node graph.. we establish near linear lower and upper bounds for RPaths if.. is directed andweighted, and forMWC and ANSC if.. is weighted, directed or undirected;near root n lower and upper bounds for undirected weighted RPaths;and Theta(D) bound for undirected unweighted RPaths. We also present lower and upper bounds for approximation: a (2 - ( 1/g))-approximation algorithm for undirected unweighted MWC that runs in O-similar to (root n +D) rounds, improving on the previous best bound of O-similar to (root ng +D) rounds, where.. is the MWC length, and a ( 1 +epsilon)-approximation algorithm for directed weighted RPaths and (2 +epsilon)-approximation for weighted undirected MWC, for any constant epsilon > 0, that beat the round complexity lower bound for an exact solution.

关键词： distributed algorithms CONGEST lower bounds replacement paths minimum weight cycle

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：