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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Increasing the Parallelism of Graph Coloring via Shortcutting 20

Increasing the Parallelism of Graph Coloring via Shortcuttin...

引用

25th acm SIGPLAN symposium on principles and Practice of Parallel Programming (PPoPP)

作者： Alabandi, Ghadeer Powers, Evan Burtscher, Martin Texas State Univ Dept Comp Sci San Marcos TX 78666 USA

ISBN: (纸本)9781450368186

Graph coloring is an assignment of colors to the vertices of a graph such that no two adjacent vertices get the same color. It is a key building block in many applications. Finding a coloring with a minimal number of colors is often only part of the problem. In addition, the solution also needs to be computed quickly. Several parallel implementations exist, but they may suffer from low parallelism depending on the input graph. We present an approach that increases the parallelism without affecting the coloring quality. On 18 test graphs, our technique yields an average of 3.4 times more parallelism. Our CUDA implementation running on a Titan V is 2.9 times faster on average and uses as few or fewer colors as the best GPU codes from the literature.

关键词： Graph coloring shortcuts parallelism GPU computing

来源：评论

学校读者我要写书评

暂无评论

Light4AR: a Shadow-based Estimator of Multiple Light Sources in Interactive Time for More Photorealistic AR Experiences 20

Light4AR: a Shadow-based Estimator of Multiple Light Sources...

引用

20th IEEE International symposium on Mixed and Augmented Reality (ISMAR)

作者： Fradet, Matthieu Hirtzlin, Patrice Jouet, Pierrick Laurent, Anthony Baillard, Caroline InterDigital Wilmington DE 19809 USA

ISBN: (纸本)9781665412988

We present Light4AR, a light source estimation solution based on the detection of real cast shadows in an image captured by a mobile device. Given the camera pose of the image and a local 3D model of the scene, the approach consists in analyzing shadows cast by a reference object onto its supporting plane to determine the 3D position and the intensity of multiple light sources. By creating virtual point lights based on the resulting parameters and adding them to the AR scene, all the virtual objects can be illuminated and cast virtual shadows consistent with the real environment lighting, thereby enhancing user experience and object presence. In addition to offering the ability to share results over multiple users while preserving device resources, the server-based GPU implementation provides results in interactive time and makes photorealistic AR experiences accessible to most mobile devices, not limiting them to recent ones or specific OS. The proposed approach requires small manual input, limited to placing in the scene a reference object of known geometry, then selecting a region including the shadows cast by this object. We show the potential of this approach on several challenging scenes with various lighting configurations and background textures.

关键词： Human-centered computing Human computer interaction (HCI) Interaction paradigms Mixed / augmented reality Computer systems organization Architectures distributed architectures Client-server architectures

来源：评论

学校读者我要写书评

暂无评论

Introducing Parallelism to First-Year CS Majors 20

Introducing Parallelism to First-Year CS Majors

引用

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

作者： Anthony, Barbara M. Erdil, D. Cenk Glebova, Olga Montante, Robert Southwestern Univ Georgetown TX 78626 USA Sacred Heart Univ Fairfield CT 06825 USA Georgia State Univ Atlanta GA 30302 USA Bloomsburg Univ Bloomsburg PA 17815 USA

ISBN: (纸本)9781450367936

We propose to strengthen the computer science (CS) curriculum by embedding parallel concepts in a required first-semester seminar taken by all incoming declared CS majors. We introduce students to parallel computing concepts through a series of unplugged activities so that students see parallel approaches as a natural form of solution to a task. We describe a pilot offering of the class and activities, with measurements and analysis of what students self-report and their performance on assessments.

关键词： Unplugged activities parallel and distributed computing computing education

来源：评论

学校读者我要写书评

暂无评论

distributed Computation and Reconfiguration in Actively Dynamic Networks 20

Distributed Computation and Reconfiguration in Actively Dyna...

引用

39th symposium on principles of distributed computing

作者： Michail, Othon Skretas, George Spirakis, Paul G. Univ Liverpool Dept Comp Sci Liverpool Merseyside England Univ Patras Comp Engn & Informat Dept Patras Greece

ISBN: (纸本)9781450375825

In this paper, we study systems of distributed entities that can actively modify their communication network. This gives rise to distributed algorithms that apart from communication can also exploit network reconfiguration in order to carry out a given task. At the same time, the distributed task itself may now require a global reconfiguration from a given initial network G(s). to a target network G(f). from a family of networks having some good properties, like small diameter. To formally capture costs associated with creating and maintaining connections, we define three reasonable edge-complexity measures: the total edge activations, the maximum activated edges per round, and the maximum activated degree of a node. We give (poly)log(n) time algorithms for the general task of transforming any G(s) into a G(f) of diameter (poly)log(n), while minimizing the edge-complexity. There is a natural trade-off between time and edge complexity. Our main lower bound shows that Omega(n) total edge activations and O(n/log n) activations per round must be paid by any algorithm (even centralized) that achieves an optimum of Theta( log n) rounds. On the positive side, we give three distributed algorithms for our general task. The first runs in O( log n) time, with at most 2n active edges per round, a total of O(n log n) edge activations, a maximum degree n - 1, and a target network of diameter 2. The second achieves bounded degree by paying an additional logarithmic factor in time and in total edge activations. It gives a target network of diameter O( log n) and uses O (n) active edges per round. Our third algorithm shows that if we slightly increase the maximum degree to polylog(n) then we can achieve a running time of o (log(2) n). This novel model of distributed computation and reconfiguration in actively dynamic networks and the proposed measures of the edge complexity of distributed algorithms, may open new avenues for research in the algorithmic theory of dynamic networks.

关键词： distributed algorithms dynamic networks reconfiguration transformation polylogarithmic time edge complexity

来源：评论

学校读者我要写书评

暂无评论

Does AP CS principles Broaden Participation in computing? An Analysis of APCSA and APCSP Participants 20

Does AP CS Principles Broaden Participation in Computing? An...

引用

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

作者： Sax, Linda J. Newhouse, Kaitlin N. S. Goode, Joanna Skorodinsky, Max Nakajima, Tomoko M. Sendowski, Michelle UCLA Grad Sch Educ & Informat Studies Los Angeles CA 90095 USA Univ Oregon Dept Educ Studies Eugene OR USA

ISBN: (纸本)9781450367936

A major attempt to broaden participation in computer science has centered on the design and development of a new high school Advanced Placement (AP) course, AP Computer Science principles (CSP). This course was created to intentionally engage a wider and more diverse group of students in learning about computing than those who had historically enrolled in programming-focused AP Computer Science "A" (CSA). After several years in the pilot phase, the course was officially offered by the College Board in 2016-17. This paper uses nationwide Freshman Survey data to examine the demographics and characteristics of students who took either CSA, the new CSP course, or both courses by the time they entered college in Fall 2017. Using crosstabs, z-tests, and one-way ANOVA, this study uncovered the similarities and differences between students who had participated in one or both of these courses. Our findings suggest that while students who took only CSP were more diverse than those who took only CSA, they exhibited less computing confidence and less interest in computing majors and tech careers. This study suggests that while CSP may be recruiting more females and racially diverse students into the course, this course alone may not serve as a direct pipeline into computing majors and careers.

关键词： AP Computer Science A Course/Exam AP Computer Science principles Course/Exam Gender and Diversity

来源：评论

学校读者我要写书评

暂无评论

proceedings - 20th IEEE/acm International symposium on Cluster, Cloud and Internet computing, CCGRID 2020

Proceedings - 20th IEEE/ACM International Symposium on Clust...

引用

20th IEEE/acm International symposium on Cluster, Cloud and Internet computing, CCGRID 2020

ISBN: (纸本)9781728160955

The proceedings contain 103 papers. The topics discussed include: DyBatch: efficient batching and fair scheduling for deep learning inference on time-sharing devices;a network cost-aware geo-distributed data analytics system;exploring mobility behaviors of moving agents from trajectory traces in cloud-fog-edge collaborative framework;NAMB: a quick and flexible stream processing application prototype generator;solving the interdependency problem: a secure virtual machine allocation method relying on the attacker?s efficiency and coverage;checkpoint restart support for heterogeneous HPC applications;merge, split, and cluster: dynamic deployment of stream processing applications;and a pattern-based API for mapping applications to a hierarchy of multi-core devices.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Genuinely distributed Byzantine Machine Learning 20

Genuinely Distributed Byzantine Machine Learning

引用

39th symposium on principles of distributed computing

作者： El-Mhamdi, El-Mahdi Guerraoui, Rachid Guirguis, Arsany Le Nguyen Hoang Rouault, Sebastien Ecole Polytech Fed Lausanne Lausanne VD Switzerland

ISBN: (纸本)9781450375825

Machine Learning (ML) solutions are nowadays distributed, according to the so-called server/worker architecture. One server holds the model parameters while several workers train the model. Clearly, such architecture is prone to various types of component failures, which can be all encompassed within the spectrum of a Byzantine behavior. Several approaches have been proposed recently to tolerate Byzantine workers. Yet all require trusting a central parameter server. We initiate in this paper the study of the "general" Byzantineresilient distributed machine learning problem where no individual component is trusted. In particular, we distribute the parameter server computation on several nodes. We show that this problem can be solved in an asynchronous system, despite the presence of 1/3 Byzantine parameter servers and 1/3 Byzantine workers (which is optimal). We present a new algorithm, ByzSGD, which solves the general Byzantine-resilient distributed machine learning problem by relying on three major schemes. The first, Scatter/Gather, is a communication scheme whose goal is to bound the maximum drift among models on correct servers. The second, distributed Median Contraction (DMC), leverages the geometric properties of the median in high dimensional spaces to bring parameters within the correct servers back close to each other, ensuring learning convergence. The third, Minimum-Diameter Averaging (MDA), is a statistically-robust gradient aggregation rule whose goal is to tolerate Byzantine workers. MDA requires loose bound on the variance of non-Byzantine gradient estimates, compared to existing alternatives (e.g., Krum [12]). Interestingly, ByzSGD ensures Byzantine resilience without adding communication rounds (on a normal path), compared to vanilla non-Byzantine alternatives. ByzSGD requires, however, a larger number of messages which, we show, can be reduced if we assume synchrony. We implemented ByzSGD on top of TensorFlow, and we report on our evaluation result

关键词： distributed machine learning Byzantine fault tolerance Byzantine parameter servers

来源：评论

学校读者我要写书评

暂无评论

YewPar: Skeletons for Exact Combinatorial Search 20

YewPar: Skeletons for Exact Combinatorial Search

引用

25th acm SIGPLAN symposium on principles and Practice of Parallel Programming (PPoPP)

作者： Archibald, Blair Maier, Patrick Stewart, Robert Trinder, Phil Univ Glasgow Glasgow Lanark Scotland Univ Stirling Stirling Scotland Heriot Watt Univ Edinburgh Midlothian Scotland

ISBN: (纸本)9781450368186

Combinatorial search is central to many applications, yet the huge irregular search trees and the need to respect search heuristics make it hard to parallelise. We aim to improve the reuse of intricate parallel search implementations by providing the first general purpose scalable parallel framework for exact combinatorial search, YewPar. We make the following contributions. (1) We present a novel formal model of parallel backtracking search, covering enumeration, decision, and optimisation search. (2) We introduce Lazy Node Generators as a uniform API for search tree generation. (3) We present the design and implementation of 12 widely applicable algorithmic skeletons for tree search on shared and distributed memory architectures. (4) Uniquely in the field we demonstrate how a wide range of parallel search applications can easily be constructed by composing Lazy Node Generators and the search skeletons. (5) We report a systematic performance analysis of all 12 YewPar skeletons on standard instances of 7 search applications, investigating skeleton overheads and scalability up to 255 workers on 17 distributed locations.

关键词： Combinatorial Search Algorithmic Skeletons distributed Memory Parallelism HPX

来源：评论

学校读者我要写书评

暂无评论

Beauty and Joy of computing: AP CS principles & Middle School Curriculum 2022

Beauty and Joy of Computing: AP CS Principles & Middle Schoo...

引用

proceedings of the 53rd acm Technical symposium on Computer Science Education V. 2

作者： Michael Ball Lauren Mock Dan Garcia Tiffany Barnes Marnie Hill Mary Fries Pamela Fox Yuan Garcia University of California Berkeley Berkeley CA USA North Carolina State University Raleigh NC USA Education Development Center Waltham MA USA Mills High School Millbrae CA USA

ISBN: (纸本)9781450390712

The Beauty and Joy of computing (BJC) is a CS principles (CSP) course created at UC Berkeley to reach high school and university nonmajors in computer science. It was chosen for the CSP pilot and endorsed by the College Board as an AP CSP curriculum and PD provider since the first AP CSP exam sitting in 2017. This past year, BJC developed a new course for middle school and early high school that teaches a functional approach to programming, emphasizing iteration and commands, and including exciting projects in graphics, data, and media. In this workshop, we will provide an overview of the BJC middle school and high school curriculum including course materials, teacher resources, and an introduction to Snap!, the chosen visual programming language of BJC. We will not only cover curriculum updates, Snap! updates, BJC for middle school, BJC in other languages, but also dive into labs with hands-on programming. Laptop is required.

关键词： blocks-based programming advanced placement middle school non-majors computer science principles broadening participation high school cs0

来源：评论

学校读者我要写书评

暂无评论

Bringing privacy control back to citizens: DISPEL - - a distributed privacy management platform for the internet of things 20

Bringing privacy control back to citizens: DISPEL - - a dist...

引用

35th Annual acm symposium on Applied computing, SAC 2020

作者： Stach, Christoph Gritti, Clémentine Mitschang, Bernhard University of Stuttgart IPVS / AS Stuttgart Germany NTNU Trondheim Norway

ISBN: (纸本)9781450368667

The Internet of Things (IoT) is becoming increasingly popular. It enables a variety of novel applications. Such applications require a lot of data about their users. To this end, sensors continuously monitor various aspects of daily life. Despite the indisputable benefits of IoT applications, this is a severe privacy threat. Due to the GDPR coming into force, there is a need for action on the part of IoT vendors. In this paper, we therefore introduce a Privacy by Design approach for IoT applications called DISPEL. It provides a configuration method enabling users to specify globally, which application may access what data for which purpose. Privacy protection is then applied at the earliest stage possible, i. e., directly on the IoT devices generating the data. Data transmission is protected against unauthorized access and manipulation. Evaluation results show that DISPEL fulfills the requirements towards an IoT privacy system. © 2020 acm.

关键词： Authorization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：