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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Collision Avoidance Proposal in a MEC based VANET environment 24

Collision Avoidance Proposal in a MEC based VANET environmen...

引用

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

作者： Nevigato, Nicolas Tropea, Mauro De Rango, Floriano Univ Calabria Dimes Dept Arcavacata Di Rende Italy

ISBN: (纸本)9781728173436

Mobile Edge computing (MEC) is a new network paradigm that allows resource management and IT services at the edge of a communication network and, so, closer to the devices guaranteeing low latency and high bandwidth requirements. This characteristic makes MEC paradigm suitable for critical communication services used in collaboration with container-based virtualization and with 5G networks. In this paper, an implementation of a collision avoidance system based on MEC in a VANET environment is proposed. This system makes use of cloud and edge computing and it is able to switch communication from edge to cloud server and vice versa when possible, trying to guarantee the required constraints and balancing the communication among the servers avoiding of overloading edge layer. The simulation results have proved how, in some cases, the MEC-5G combination is the best solution for avoiding collisions in a VANET environment.

关键词： VANET Collision Avoidance Mobile Edge computing (MEC) 5G

来源：评论

学校读者我要写书评

暂无评论

A Novel Deep Reinforcement Learning based service migration model for Mobile Edge computing 24

A Novel Deep Reinforcement Learning based service migration ...

引用

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

作者： Park, Sung Woon Boukerche, Azzedine Guan, Shichao Univ Ottawa Sch Elect Engn & Comp Sci Ottawa ON Canada

ISBN: (数字)9781728173436

ISBN: (纸本)9781728173436

Cloud computing has emerged as a foundation of smart environments by encapsulating and virtualizing the underlying design and implementation details. Concerning the inherent latency and deployment issues, Mobile Edge computing seeks to migrate services in the vicinity of mobile users. However, the current migration-based studies lack the consideration of migration cost, transaction cost, and energy consumption on the system-level with discussion on the impact of personalized user mobility. In this paper, we implement an enhanced service migration model to address user proximity issues. We formalize the migration cost, transaction cost, energy consumption related to the migration process. We model the service migration issue as a complex optimization problem and adapt Deep Reinforcement Learning to approximate the optimal policy. We compare the performance of the proposed model with the recent Q-learning method and other baselines. The results demonstrate that the proposed model can estimate the optimal policy with complicated computation requirements.

关键词： Mobile edge computing service migration deep reinforcement learning energy consumption migration cost

来源：评论

学校读者我要写书评

暂无评论

Single-Source Shortest Paths in the CONGEST Model with Improved Bound 20

Single-Source Shortest Paths in the CONGEST Model with Impro...

引用

39th symposium on principles of distributed computing

作者： Chechik, Shiri Mukhtar, Doron Tel Aviv Univ Tel Aviv Israel

ISBN: (纸本)9781450375825

We improve the time complexity of the single-source shortest path problem for weighted directed graphs (with non-negative integer weights) in the Broadcast CONGEST model of distributed computing. For polynomially bounded edge weights, the state-of-the-art algorithm for this problem requires (O) over tilde (min root nD(1/2), root nD(1/4) +n(3/5) + D}) rounds [Forster and Nanongkai, FOCS 2018], which is quite far from the known lower bound of (O) over tilde(root n + D) rounds [Elkin, STOC 2014];here D is the diameter of the underlying network and n is the number of vertices in it. For the approximate version of this problem, Forster and Nanongkai [FOCS 2018] obtained an upper bound of (O) over tilde (root nD(1/4) + D), and stated that achieving the same bound for the exact case remains a major open problem. In this paper we resolve the above mentioned problem by devising a new randomized algorithm for solving (the exact version of) this problem in (O) over tilde(root nD(1/4) + D) rounds. Our algorithm is based on a novel weight-modifying technique that allows us to compute bounded-hop distance approximation that preserves a certain form of the triangle inequality for the edges in the graph.

关键词： Broadcast CONGEST single-source shortest paths distributed algorithms overlay networks

来源：评论

学校读者我要写书评

暂无评论

Digital Twins at the Edge to Track Mobility for MaaS Applications 24

Digital Twins at the Edge to Track Mobility for MaaS Applica...

引用

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

作者： Campolo, Claudia Genovese, Giacomo Molinaro, Antonella Pizzimenti, Bruno Univ Mediterranea Reggio Calabria Calabria Italy

ISBN: (纸本)9781728173436

The research into wireless communication and mobile computing is called to formulate novel smart mobility solutions to improve the quality of a citizen's life in smart cities. In such a context, in this paper we elaborate on the role of technologies like multi-access edge computing (MEC), Internet of Things (IoT) messaging protocols, such as Constrained Application Protocol (CoAP) and Message Queue Telemetry Transport (MQTT), and virtualization (i.e., digital twins) in the design of a framework enabling the collection and processing of data about the mobility of commuters and public transport vehicles. Such data have the purpose to feed mobility monitoring and transport planning solutions. A Proof-of-Concept (PoC) is developed to validate the framework under realistic experimental settings. Results in terms of efficiency and effectiveness of the considered messaging protocols are reported.

关键词： Multi-access Edge computing CoAP Digital Twin OMA LwM2M MQTT MaaS

来源：评论

学校读者我要写书评

暂无评论

K-set agreement bounds in round-based models through combinatorial topology 20

K-set agreement bounds in round-based models through combina...

引用

39th symposium on principles of distributed computing

作者： Shimi, Adam Castaneda, Armando Univ Toulouse IRIT Toulouse France Univ Nacl Autonoma Mexico Mexico City DF Mexico

ISBN: (纸本)9781450375825

Round-based models are very common message-passing models;combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine both to study the computability of k -set agreement. Among all the possible round-based models, we consider oblivious ones, where the constraints are given only round per round by a set of allowed graphs. And among oblivious models, we focus on closed-above ones, that is models where the set of possible graphs contains all graphs with more edges than some starting graphs. These capture intuitively the underlying structure required by some communication model, like containing a ring. We then derive lower bounds and upper bounds in one round for k-set agreement, such that these bounds are proved using combinatorial topology but stated only in terms of graph properties. These bounds extend to multiple rounds when limiting our algorithms to be oblivious - recalling only pairs of processes and initial value, not who send what and when.

关键词： distributed Computability Set-agreeement Round-based models Combinatorial Topology Lower bounds Upper Bounds

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：