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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

computing Shortest Paths and Diameter in the Hybrid Network Model 20

Computing Shortest Paths and Diameter in the Hybrid Network ...

引用

39th symposium on principles of distributed computing

作者： Kuhn, Fabian Schneider, Philipp Univ Freiburg Freiburg Germany

ISBN: (纸本)9781450375825

The HYBRID model, introduced in [Augustine et al., SODA '20], provides a theoretical foundation for networks that allow multiple communication modes. The model follows the principles of synchronous message passing, whereas nodes are allowed to use two fundamentally different communication modes. First, a local mode where nodes may exchange arbitrary information per round over edges of a local communication graph G (akin to the LOCAL model). Second, a global mode where every node may exchange O(log n) messages of size O(log n) bits per round with arbitrary nodes in the network. The HYBRID model intends to reflect the conditions of many real hybrid networks, where high-bandwidth but inherently local communication is combined with highly flexible global communication with restricted bandwidth. We continue to explore the power and limitations of the HYBRID model by investigating the complexity of computing shortest paths and diameter of the local communication graph G. We show that the all pair shortest paths problem can be solved exactly in (O) over tilde(root n) rounds, which improves on the previous (O) over tilde (n(2/3)) round algorithm and closes the gap to the known (Omega) over tilde(root n) lower bound (up to polylog n factors). Furthermore, we give constant approximations for the k-source shortest paths problem (k-SSP) with runtime (O) over tilde(root k), provided that k is sufficiently large. As k-SSP has a lower bound of (Omega) over tilde(root k) even for large approximation ratios, our k-SSP algorithms are almost tight for large enough k. In the case of a single source we give an exact (O) over tilde (n(2/5))-round algorithm, improving on the known (O) over tilde(root D)-round algorithm for graphs with large diameter D. For the diameter problem we provide algorithms with complexities (O) over tilde (n(1/3) /epsilon) and (O) over tilde (n(0.397) /epsilon) and approximation factors (3/2+epsilon) and (1+epsilon), respectively. On the negative side, we demonst

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Learning to Parallelize in a Shared-Memory Environment with Transformers 23

Learning to Parallelize in a Shared-Memory Environment with ...

引用

proceedings of the 28th acm SIGPLAN Annual symposium on principles and Practice of Parallel Programming

作者： Re'em Harel Yuval Pinter Gal Oren Department of Computer Science Ben-Gurion University of the Negev Department of Physics Scientific Computing Center Nuclear Research Center - Negev Israel Department of Computer Science Ben-Gurion University of the Negev Israel Department of Computer Science Technion - Israel Institute of Technology Scientific Computing Center Nuclear Research Center - Negev Israel

ISBN: (纸本)9798400700156

In past years, the world has switched to multi and many core shared memory architectures. As a result, there is a growing need to utilize these architectures by introducing shared memory parallelization schemes, such as OpenMP, to applications. Nevertheless, introducing OpenMP work-sharing loop construct into code, especially legacy code, is challenging due to pervasive pitfalls in management of parallel shared memory. To facilitate the performance of this task, many source-to-source (S2S) compilers have been created over the years, tasked with inserting OpenMP directives into code automatically. In addition to having limited robustness to their input format, these compilers still do not achieve satisfactory coverage and precision in locating parallelizable code and generating appropriate directives. In this work, we propose leveraging recent advances in machine learning techniques, specifically in natural language processing (NLP), to suggest the need for an OpenMP work-sharing loop directive and data-sharing attributes clauses --- the building blocks of concurrent programming. We train several transformer models, named PragFormer, for these tasks and show that they outperform statistically-trained baselines and automatic source-to-source (S2S) parallelization compilers in both classifying the overall need for an parallel for directive and the introduction of private and reduction clauses. In the future, our corpus can be used for additional tasks, up to generating entire OpenMP directives. The source code and database for our project can be accessed on GitHub 1 and HuggingFace 2.

关键词： concurrent computing methodologies machine learning

来源：评论

学校读者我要写书评

暂无评论

CML-IOT 2020: The Second Workshop on Continual and Multimodal Learning for Internet of Things 20

CML-IOT 2020: The Second Workshop on Continual and Multimoda...

引用

acm International Joint Conference on Pervasive and Ubiquitous computing (UbiComp) / acm International symposium on Wearable Computers (ISWC)

作者： Xu, Susu Pan, Shijia Yu, Tong Qualcomm AI Res San Diego CA 92121 USA Univ Calif Merced CA USA Samsung Res Amer Mountain View CA USA

ISBN: (纸本)9781450380768

With the deployment of Internet of Things (IoT), large amount of sensors are connected into the Internet, providing large-amount, streaming, and multimodal data. These data have distinct statistical characteristics over time and sensing modalities, which are hardly captured by traditional learning methods. Continual and multimodal learning allows integration, adaptation, and generalization of the knowledge learned from experiential data collected with heterogeneity to new situations. Therefore, continual and multimodal learning is an important step to enable efficient ubiquitous computing on IoT devices. The major challenges to combine continual learning and multimodal learning with real-world data include 1) how to fuse and transfer knowledge between the multimodal data under constrained computational resources, 2) how to learn continually despite the missing, imbalanced or noisy data under constrained computational resources, 3) how to effectively reserve privacy and retain security when learning knowledge from streaming and multimodal data collected by multiple stakeholders, and 4) how to develop large-scale distributed learning systems to efficiently learn from continual and multimodal data. We organize this workshop to bring people working on different disciplines together to tackle these challenges in this topic. This workshop aims to explore the intersection and combination of continual machine learning and multimodal modeling with applications in the Internet of Things. The workshop welcomes works addressing these issues in different applications/domains as well as algorithmic and systematic approaches to leverage continual learning on multimodal data. We further seek to develop a community that systematically handles the streaming multimodal data widely available in real-world ubiquitous computing systems. In 2019, we held the First Workshop on Continual and Multimodal Learning for Internet of Things (https://***/) with Ubicomp 2019, London

关键词： Ubiquitous computing Internet of Things Multimodal Learning Continual learning

来源：评论

学校读者我要写书评

暂无评论

The Energy Complexity of BFS in Radio Networks 20

The Energy Complexity of BFS in Radio Networks

引用

39th symposium on principles of distributed computing

作者： Chang, Yi-Jun Dani, Varsha Hayes, Thomas P. Pettie, Seth Swiss Fed Inst Technol Zurich Switzerland Univ New Mexico Albuquerque NM USA Univ Michigan Ann Arbor MI 48109 USA

ISBN: (纸本)9781450375825

We consider a model of energy complexity in Radio Networks in which transmitting or listening on the channel costs one unit of energy and computation is free. This simplified model captures key aspects of battery-powered sensors: that battery-life is most influenced by transceiver usage, and that at low transmission powers, the actual cost of transmitting and listening are very similar. The energy complexity of tasks in single-hop (clique) networks are well understood [6, 9, 20, 32]. Recent work of Chang et al. [8] considered energy complexity in multi-hop networks and showed that Broadcast admits an energy-efficient protocol, by which we mean each of the n nodes in the network spends O(polylog(n)) energy. This work left open the strange possibility that all natural problems in multi-hop networks might admit such an energyefficient solution. In this paper we prove that the landscape of energy complexity is rich enough to support a multitude of problem complexities. Whereas Broadcast can be solved by an energy-efficient protocol, exact computation of Diameter cannot, requiring Omega(n) energy. Our main result is that BreadthFirstSearch has sub-polynomial energy complexity at most 2(O)((root log n log log n)) = n(o(1));whether it admits an efficient O(polylog(n))-energy protocol is an open problem. Our main algorithm involves recursively solving a generalized BFS problem on a "cluster graph" introduced by Miller, Peng, and Xu [31]. In this application, we make crucial use of a close relationship between distances in this cluster graph, and distances in the original network. This relationship is new and may be of independent interest. We also consider the problem of approximating the network Diameter. From our main result, it is immediate that Diameter can be 2-approximated using no(1) energy per node. We observe that, for all epsilon > 0, approximating Diameter to within a (2 - epsilon) factor requires Omega(n) energy per node. However, this lower bound is only due to

关键词： distributed computing graph algorithms energy-aware computing radio networks sensor networks

来源：评论

学校读者我要写书评

暂无评论

Introducing Parallel computing Concepts through a POGIL Activity: A Pilot Study 20

Introducing Parallel Computing Concepts through a POGIL Acti...

引用

51st acm SIGCSE Technical symposium on Computer Science Education (SIGCSE)

作者： Mezei, Razvan A. Blanco, Saul A. Liu, David Q. Hossain, Mahmood Carman, E. Preston, Jr. St Martins Univ Lacey WA 98503 USA Indiana Univ Bloomington IN 47405 USA Purdue Univ Ft Wayne IN USA Fairmont State Univ Fairmont WV USA Walla Walla Univ College Pl WA USA

ISBN: (纸本)9781450367936

POGIL activities have been used for various computer science courses. However, there is no published POGIL activity for introducing parallel and distributed computing concepts. Recent ABET curriculum recommendations include the introduction of parallel and distributed computing concepts in undergraduate Computer Science/Engineering programs. In this work, we plan a cross-university study of evaluating the impact of using POGIL to introduce parallel computing topics in Data Structures and Algorithms or similar courses in an undergraduate computer science curriculum. We designed a POGIL tool that includes an unplugged activity that helps demonstrate some fundamental concepts of parallel computing. This unplugged activity is then followed by a set of reflective questions regarding potential advantages and challenges of using parallel computing. We plan to use PRE/POST surveys to collect data from undergraduate CS students from five universities located in different parts of the US with diverse student population. At the end of this work in progress, we will use the data to investigate how this POGIL activity helps students gain an understanding of parallel computing.

关键词： POGIL activities parallel computing classroom activity

来源：评论

学校读者我要写书评

暂无评论

Assignments that Blend Ethics and Technology 20

Assignments that Blend Ethics and Technology

引用

51st acm SIGCSE Technical symposium on Computer Science Education (SIGCSE)

作者： Doore, Stacy A. Fiesler, Casey Kirkpatrick, Michael S. Peck, Evan Sahami, Mehran Bowdwoin Coll Brunswick ME 04011 USA Univ Colorado Boulder CO 80309 USA James Madison Univ Harrisonburg VA 22807 USA Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450367936

With the 2018 revision of the acm Code of Ethics and Professional Conduct, there is a growing interest in how computer science faculty can integrate these principles into the education of future practitioners. This special session illustrates one approach by highlighting assignments that blend ethics and technology. These assignments can be used in a variety of courses, including CS1, CS2, and later courses. Presenters will provide an overview of each assignment and gather feedback from the audience. All materials, including descriptions, starter files, and guidelines for instructors, will be published at https://***/SIGCSE2020.

关键词： acm Code of Ethics computing ethics CS education pedagogy

来源：评论

学校读者我要写书评

暂无评论

Undirected (1+𝜀)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms 2022

Undirected (1+𝜀)-shortest paths via minor-aggregates: nea...

引用

proceedings of the 54th Annual acm SIGACT symposium on Theory of computing

作者： Václav Rozhoň Christoph Grunau Bernhard Haeupler Goran Zuzic Jason Li ETH Zurich Switzerland ETH Zurich Switzerland / Carnegie Mellon University USA University of California at Berkeley USA

ISBN: (纸本)9781450392648

This paper presents near-optimal deterministic parallel and distributed algorithms for computing (1+eps)-approximate single-source shortest paths in any undirected weighted graph. On a high level, we deterministically reduce this and other shortest-path problems to Õ(1) Minor-Aggregations. A Minor-Aggregation computes an aggregate (e.g., max or sum) of node-values for every connected component of some subgraph. Our reduction immediately implies: Optimal deterministic parallel (PRAM) algorithms with Õ(1) depth and near-linear work. Universally-optimal deterministic distributed (CONGEST) algorithms, whenever deterministic Minor-Aggregate algorithms exist. For example, an optimal Õ(hopDiameterG)-round deterministic CONGEST algorithm for excluded-minor networks. Several novel tools developed for the above results are interesting in their own right: A local iterative approach for reducing shortest path computations “up to distance D” to computing low-diameter decompositions “up to distance D/2”. Compared to the recursive vertex-reduction approach of [Li20], our approach is simpler, suitable for distributed algorithms, and eliminates many derandomization barriers. A simple graph-based Õ(1)-competitive ℓ1-oblivious routing based on low-diameter decompositions that can be evaluated in near-linear work. The previous such routing [ZGY+20] was no(1)-competitive and required no(1) more work. A deterministic algorithm to round any fractional single-source transshipment flow into an integral tree solution. The first distributed algorithms for computing Eulerian orientations.

关键词： Shortest Path distributed Algorithms Parallel Algorithms

来源：评论

学校读者我要写书评

暂无评论

Simulation of hybrid edge computing architectures 21

Simulation of hybrid edge computing architectures

引用

proceedings of the 2021 IEEE/acm 25th International symposium on distributed Simulation and Real Time Applications

作者： Luca Serena Mirko Zichichi Gabriele D'Angelo Stefano Ferretti University of Bologna Bologna Italy Universidad Politécnica de Madrid Madrid Spain University of Bologna Cesena Italy University of Urbino "Carlo Bo" Urbino Italy

ISBN: (纸本)9781665433266

Dealing with a growing amount of data is a crucial challenge for the future of information and communication technologies. More and more devices are expected to transfer data through the Internet, therefore new solutions have to be designed in order to guarantee low latency and efficient traffic management. In this paper, we propose a solution that combines the edge computing paradigm with a decentralized communication approach based on Peer-to-Peer (P2P). According to the proposed scheme, participants to the system are employed to relay messages of other devices, so as to reach a destination (usually a server at the edge of the network) even in absence of an Internet connection. This approach can be useful in dynamic and crowded environments, allowing the system to outsource part of the traffic management from the Cloud servers to end-devices. To evaluate our proposal, we carry out some experiments with the help of LUNES, an open source discrete events simulator specifically designed for distributed environments. In our simulations, we tested several system configurations in order to understand the impact of the algorithms involved in the data dissemination and some possible network arrangements.

关键词： communication peer-to-peer edge computing performance evaluation simulation

来源：评论

学校读者我要写书评

暂无评论

Design principles behind Beauty and Joy of computing 20

Design Principles behind Beauty and Joy of Computing

引用

51st acm SIGCSE Technical symposium on Computer Science Education (SIGCSE)

作者： Goldenberg, Paul Mark, June Harvey, Brian Cuoco, Al Fries, Mary EDC Waltham MA 02451 USA UCB Berkeley CA USA

ISBN: (纸本)9781450367936

This paper shares the design principles of one Advanced Placement Computer Science principles (AP CSP) course, Beauty and Joy of computing (BJC), both for schools considering curriculum, and for developers in this still-new field. BJC students not only learn about CS, but do some and analyze its social implications;we feel that the job of enticing students into the field isn't complete until students find programming, itself, something they enjoy and know they can do, and its key ideas accessible. Students must feel invited to use their own creativity and logic, and enjoy the power of their logic and the beauty and elegance of the code by which they express it. All kids need genuine challenge and sensible support so all can have the joy of making-seeing themselves as creators, not just consumers, and seeing that it is their own intellect, not just our instructions, that is the source of that making. Framework standards are woven into a consistent social and intellectual storyline to give the curriculum integrity. principles guide even our choice of programming language. Learners should focus on the logic and structure of their thinking, not on misplaced semicolons;attention to such syntactic detail is antithetical to broadening participation. We feature recursion and higher-order functions because they beautifully exemplify abstraction, a key idea in CS and the CSP framework. BJC also places significant emphasis on the social implications of computing, balancing fundamental optimism about computing technology with a critical view of specific uses of technology.

关键词： CS education Curriculum Design Advanced Placement Computer Science principles

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 2020 IEEE/acm 24th International symposium on distributed Simulation and Real Time Applications, DS-RT 2020

Proceedings of the 2020 IEEE/ACM 24th International Symposiu...

引用

24th IEEE/acm International symposium on distributed Simulation and Real Time Applications, DS-RT 2020

ISBN: (纸本)9781728173436

The proceedings contain 32 papers. The topics discussed include: model checking actor-based cyber-physical systems;e-scooter sharing: leveraging open data for system design;bio-inspired drones recruiting strategy for precision agriculture domain;collision avoidance proposal in a MEC based VANET environment;a novel deep reinforcement learning based service migration model for mobile edge computing;a cost-effective scheduling control for a safety critical hybrid power system;real-time feedback in node-RED for IoT development: an empirical study;agent-based modeling and simulation for emergency scenarios: a holistic approach;CoSim: a simulator for co-scheduling of batch and on-demand jobs in HPC datacenters;and heuristic contention-free scheduling algorithm for multi-core processor using LET model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 64 65 66 67 68 69 70 71 72 73 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：