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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

3,287 篇 工学
- 3,133 篇 计算机科学与技术...
- 1,641 篇 软件工程
- 413 篇 信息与通信工程
- 374 篇 电气工程
- 224 篇 控制科学与工程
- 82 篇 电子科学与技术（可...
- 53 篇 网络空间安全
- 48 篇 生物工程
- 34 篇 机械工程
- 30 篇 建筑学
- 24 篇 动力工程及工程热...
- 22 篇 生物医学工程（可授...
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 18 篇 农业工程
- 16 篇 材料科学与工程（可...
806 篇 理学
- 671 篇 数学
- 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...
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 篇 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 篇 toueg sam

语言

4,359 篇 英文
114 篇 其他
4 篇 中文

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

共 4477 条记录，以下是621-630 订阅

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

详细简洁

排序：

Lasagna: Accelerating Secure Deep Learning Inference in SGX-enabled Edge Cloud 12

Lasagna: Accelerating Secure Deep Learning Inference in SGX-...

引用

12th Annual acm symposium on Cloud computing (SoCC)

作者： Li, Yuepeng Zeng, Deze Gu, Lin Chen, Quan Guo, Song Zomaya, Albert Guo, Minyi Univ Geosci Sch Comp Sci Wuhan Peoples R China Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan Peoples R China Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China Univ Sydney Ctr Distributed & High Performance Comp Sch Informat Technol Sydney NSW 2006 Australia Shanghai Jiao Tong Univ Dept Comp Shanghai Peoples R China

ISBN: (纸本)9781450386388

Edge intelligence has already been widely regarded as a key enabling technology in a variety of domains. Along with the prosperity, increasing concern is raised on the security and privacy of intelligent applications. As these applications are usually deployed on shared and untrusted edge servers, malicious co-located attackers, or even untrustworthy infrastructure providers, may acquire highly security-sensitive data and code (i.e., the pre-trained model). Software Guard Extensions (SGX) provides an isolated Trust Execution Environment (TEE) for task security guarantee. However, we notice that DNN inference performance in SGX is severely affected by the limited enclave memory space due to the resultant frequent page swapping operations and the high enclave call overhead. To tackle this problem, we propose Lasagna, an SGX oriented DNN inference performance acceleration framework without compromising the task security. Lasagna consists of a local task scheduler and a global task balancer to optimize the system performance by exploring the layered-structure of DNN models. Our experiment results show that our layer-aware Lasagna effectively speeds up the well-known DNN inference in SGX by 1.31 x -1.97x.

关键词： SGX DNN Inference Task scheduling Edge intelligence

来源：评论

学校读者我要写书评

暂无评论

Tutorial: Edge computing for Mobile Internet of Things 11

Tutorial: Edge Computing for Mobile Internet of Things

引用

11th acm symposium on Design and Analysis of Intelligent Vehicular Networks and Applications, DIVANet 2021

作者： Coutinho, Rodolfo W. L. Concordia University MontrealQC Canada

ISBN: (纸本)9781450390811

Internet of things (IoT) has emerged as the enabling technology for smart applications in different domains, such as transportation, health-care, industry, smart homes and buildings, and education (e.g., [1-5]). IoT applications rely on the deployment of resourceconstrained devices that collect data from the environment it is immersed and control events of interest through actuators. One of the daunting challenges in many IoT applications is the need for the real-time processing of a large amount of produced data. Such processing is often impractical to be performed at the IoT devices, due to their resource-constrained nature and the incurred energy cost. In this regard, IoT data is often offloaded to be processed on distant powerful cloud servers, which return to IoT devices as the result of the heavy computations. This approach is well-suited for computation-intensive tasks in IoT applications. However, the process of task offloading to cloud servers incurs additional delays for the IoT application, in addition to the network overhead. Therefore, edge computing has been proposed to provide computation, communication, and storage resources closer to IoT devices. The general idea is to place resources in the proximity of IoT devices that will demand them. Thus, the latency involved in the IoT application is reduced since computation-intensive tasks are processed on edge devices rather than on distant cloud servers. One of the critical challenges in edge-aided IoT applications is that edge devices have limited resource capabilities when compared to cloud servers. In this regard, edge devices' resources must be managed and allocated in an efficient way, aimed at providing resources to IoT applications with guaranteed quality of service (QoS). This tutorial will motivate and explore the challenges, design principles, and goals of edge computing for IoT applications. It presents the building blocks for the design of optimization models for IoT task offloading to edge no

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Community Supported Agriculture: The Concept of Solidarity in Mitigating Between Harvests and Needs 21

Community Supported Agriculture: The Concept of Solidarity i...

引用

CHI Conference on Human Factors in computing Systems

作者： Landwehr, Marvin Engelbutzeder, Philip Wulf, Volker Univ Siegen Siegen Germany Int Inst SocioInformat IISI Bonn Germany

ISBN: (纸本)9781450380966

There is a developing recognition of the social and economic costs entailed in global supply chains. In this paper, we report on efforts to provide alternative, more sustainable and resilient models of production. Community Supported Agricultures (CSAs) address this problem but require new means of exchange which, we suggest, offer a design opportunity for sustainable HCI research. This paper presents a two months participatory observation in a food movement, a German CSA which developed a distribution system involving their own currency. Based on our ethnographic observations, we focus our discussion on (1) the solidaristic principles upon which the movement is based and (2) techniques of mediating between consumers' wishes and the constraints of local agricultural production. By relating to the continued development of CSAs, we identify three interrelated innovation gaps and discuss new software architectures aimed at resolving the problems which arise as the movement grows.

关键词： Community Supported Agriculture Sustainable HCI Solidarity Trust Currency distributed Ledger Technology Cooperative Work Technological Sovereignty Food Sovereignty

来源：评论

学校读者我要写书评

暂无评论

An Experiment-Driven Performance Model of Stream Processing Operators in Fog computing Environments 20

An Experiment-Driven Performance Model of Stream Processing ...

引用

35th Annual acm symposium on Applied computing (SAC)

作者： Arkian, HamidReza Pierre, Guillaume Tordsson, Johan Elmroth, Erik Univ Rennes INRIA CNRS IRISA Rennes France Elastisys AB Umea Sweden

ISBN: (纸本)9781450368667

Data stream processing (DSP) is an interesting computation paradigm in geo-distributed infrastructures such as Fog computing because it allows one to decentralize the processing operations and move them close to the sources of data. However, any decomposition of DSP operators onto a geo-distributed environment with large and heterogeneous network latencies among its nodes can have significant impact on DSP performance. In this paper, we present a mathematical performance model for geo-distributed stream processing applications derived and validated by extensive experimental measurements. Using this model, we systematically investigate how different topological changes affect the performance of DSP applications running in a geo-distributed environment. In our experiments, the performance predictions derived from this model are correct within 2% even in complex scenarios with heterogeneous network delays between every pair of nodes.

关键词： Fog computing

来源：评论

学校读者我要写书评

暂无评论

DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead 20

DConstructor: Efficient and Robust Network Construction with...

引用

39th symposium on principles of distributed computing

作者： Gilbert, Seth Pandurangan, Gopal Robinson, Peter Trehan, Amitabh Natl Univ Singapore Dept Comp Sci Singapore Singapore Univ Houston Dept Comp Sci Houston TX 77004 USA City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Loughborough Univ Dept Comp Sci Loughborough Leics England

ISBN: (纸本)9781450375825

With the rise of dynamic reconfigurable networks such as Peer-to-Peer (P2P) networks, overlay networks, ad hoc wireless and mesh networks, it has become important to construct and maintain topologies with various desirable properties (such as connectivity, low diameter, expansion, low degree etc.) in an efficient decentralized manner. The main result of this paper is a distributed protocol called DConstructor that given any (connected) network topology will "converge" to a given (desired) target topology such as an expander, hypercube, or Chord, with high probability. Our protocol is efficient, lightweight, and scalable, and it incurs only O (polylog(n)) overhead (where.. is the network size) for topology construction and maintenance: only polylogarithmic (in n) bits need to be processed and sent by each node per round, the convergence time is polylogarithmic rounds and any node's computation cost per round is also polylogarithmic. Our protocol is robust and self-repairing in the sense that it will converge to the desired topology in polylogarithmic rounds and polylogarithmic communication cost under dynamic topology changes and arbitrary insertions and deletions of nodes.

关键词： distributed Protocol Peer-to-Peer Network Randomized Algorithm Self-repairing Network Expander

来源：评论

学校读者我要写书评

暂无评论

distributed Approximation on Power Graphs 20

Distributed Approximation on Power Graphs

引用

39th symposium on principles of distributed computing

作者： Bar-Yehuda, Reuven Censor-Hillel, Keren Maus, Yannic Pai, Shreyas Pemmaraju, Sriram V. Technion Israel Inst Technol Haifa Israel Univ Iowa Iowa City IA USA

ISBN: (纸本)9781450375825

We investigate graph problems in the following setting: we are given a graph G and we are required to solve a problem on G(2). While we focus mostly on exploring this theme in the distributed CONGEST model, we also show new results and surprising connections to the centralized model of computation. In the CONGEST model, it is natural to expect that problems on G(2) would be quite difficult to solve efficiently on G, due to congestion. However, we show that the picture is both more complicated and more interesting. Specifically, we encounter two phenomena acting in opposing directions: (i) slowdown due to congestion and (ii) speedup due to structural properties of G(2). We demonstrate these two phenomena via two fundamental graph problems, namely, Minimum Vertex Cover (MVC) and Minimum Dominating Set (MDS). Among our many contributions, the highlights are the following. (1) In the CONGEST model, we show an O(n/epsilon)-round (1 + epsilon)approximation algorithm for MVC on G(2), whereas no o(n(2))round algorithm is known for any better-than-2 approximation for MVC on G. (2) We show a centralized polynomial time 5/3-approximation algorithm for MVC on G(2), whereas a better-than-2 approximation is UGC-hard for G. (3) In contrast, for MDS, in the CONGEST model, we show an (Omega) over tilde (n(2)) lower bound for a constant approximation factor for MDS on G(2), whereas an (Omega) over tilde (n(2)) lower bound for MDS on G is known only for exact computation.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Polylogarithmic-Time Deterministic Network Decomposition and distributed Derandomization 2020

Polylogarithmic-Time Deterministic Network Decomposition and...

引用

52nd Annual acm SIGACT symposium on Theory of computing (STOC)

作者： Rozhon, Vaclav Ghaffari, Mohsen Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450369794

We present a simple polylogarithmic-time deterministic distributed algorithm for network decomposition. This improves on a celebrated 2(O(root log n))-time algorithm of Panconesi and Srinivasan [STOC'92] and settles a central and long-standing question in distributed graph algorithms. It also leads to the first polylogarithmictime deterministic distributed algorithms for numerous other problems, hence resolving several well-known and decades-old open problems, including Linial's question about the deterministic complexity of maximal independent set [FOCS'87;SICOMP'92]-which had been called the most outstanding problem in the area. The main implication is a more general distributed derandomization theorem: Put together with the results of Ghaffari, Kuhn, and Maus [STOC'17] and Ghaffari, Harris, and Kuhn [FOCS'18], our network decomposition implies that P-RLOCAL = P-LOCAL. That is, for any problem whose solution can be checked deterministically in polylogarithmic-time, any polylogarithmic-time randomized algorithm can be derandomized to a polylogarithmic-time deterministic algorithm. Informally, for the standard first-order interpretation of efficiency as polylogarithmic-time, distributed algorithms do not need randomness for efficiency. By known connections, our result leads also to substantially faster randomized distributed algorithms for a number of well-studied problems including (Delta + 1)-coloring, maximal independent set, and Lovasz Local Lemma, as well as massively parallel algorithms for (Delta + 1)-coloring.

关键词： network decomposition distributed algorithms derandomization

来源：评论

学校读者我要写书评

暂无评论

Accelerating distributed online meta-learning via multi-agent collaboration under limited communication 21

Accelerating distributed online meta-learning via multi-agen...

引用

22nd International symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile computing, MobiHoc 2021

作者： Lin, Sen Dedeoglu, Mehmet Zhang, Junshan Arizona State University Tempe United States

ISBN: (纸本)9781450385589

Online meta-learning is emerging as an enabling technique for achieving edge intelligence in the IoT ecosystem. Nevertheless, to learn a good meta-model for within-task fast adaptation, a single agent alone has to learn over many tasks, and this is the so-called 'cold-start' problem. Observing that in a multi-agent network the learning tasks across different agents often share some model similarity, we ask the following fundamental question: "Is it possible to accelerate the online meta-learning across agents via limited communication and if yes how much benefit can be achieved?"To answer this question, we propose a multi-agent online meta-learning framework and cast it as an equivalent two-level nested online convex optimization (OCO) problem. By characterizing the upper bound of the agent-task-averaged regret, we show that the performance of multi-agent online meta-learning depends heavily on how much an agent can benefit from the distributed network-level OCO for meta-model updates via limited communication, which however is not well understood. To tackle this challenge, we devise a distributed online gradient descent algorithm with gradient tracking where each agent tracks the global gradient using only one communication step with its neighbors per iteration, and it results in an average regret O(T/N) per agent, indicating that a factor of 1/N speedup over the optimal single-agent regret O(T) after T iterations, where N is the number of agents. Building on this sharp performance speedup, we next develop a multi-agent online meta-learning algorithm and show that it can achieve the optimal task-average regret at a faster rate of O(1 N/T) via limited communication, compared to single-agent online meta-learning. Extensive experiments corroborate the theoretic results. © 2021 acm.

关键词： Gradient methods

来源：评论

学校读者我要写书评

暂无评论

Compact distributed Certification of Planar Graphs 20

Compact Distributed Certification of Planar Graphs

引用

39th symposium on principles of distributed computing

作者： Feuilloley, Laurent Fraigniaud, Pierre Montealegre, Pedro Rapaport, Ivan Remila, Eric Todinca, Ioan Univ Chile Dept Ingn Ind Santiago Chile Univ Paris Paris France CNRS Paris France Univ Adolfo Ibanez Fac Ingn & Ciencias Santiago Chile Univ Chile DIM CMM UMI 2807 CNRS Santiago Chile UJM St Etienne GATE Lyon St Etienne CNRS UMR 5824 St Etienne France Univ dOrleans LIFO Orleans France INSA Ctr Val de Loire Blois Loir & Cher France

ISBN: (纸本)9781450375825

Naor, Parter, and Yogev (SODA 2020) have recently demonstrated the existence of a distributed interactive proof for planarity (i.e., for certifying that a network is planar), using a sophisticated generic technique for constructing distributed IP protocols based on sequential IP protocols. The interactive proof for planarity is based on a distributed certification of the correct execution of any given sequential linear-time algorithm for planarity testing. It involves three interactions between the prover and the randomized distributed verifier (i.e., it is a dMAM protocol), and uses small certificates, on O(logn) bits in n-node networks. We show that a single interaction from the prover suffices, and randomization is unecessary, by providing an explicit description of a proof-labeling scheme for planarity, still using certificates on just O(logn) bits. We also show that there are no proof-labeling schemes - in fact, even no locally checkable proofs - for planarity using certificates on o(logn) bits.

关键词： distributed graph algorithms communication networks fault-tolerance

来源：评论

学校读者我要写书评

暂无评论

2021 Edsger W. Dijkstra Prize in distributed computing 21

2021 Edsger W. Dijkstra Prize in Distributed Computing

引用

proceedings of the 2021 acm symposium on principles of distributed computing

作者： Keren Censor-Hillel Pierre Fraigniaud Cyril Gavoille Seth Gilbert Andrzej Pelc David Peleg Technion Haifa Israel Université de Paris & CNRS Paris France LaBRI - Université de Bordeaux Bordeaux France National University of Singapore Singapore Singapore Université du Québec en Outaouais Gatineau PQ Canada Weizmann Institute of Science Rehovot Israel

No abstract available.

ISBN: (纸本)9781450385480

No abstract available.

关键词： edsgerw. dijkstra prize distributed computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 59 60 61 62 63 64 65 66 67 68 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：