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

1st ieee/acm symposium on edge computing, SEC 2016

ISBN: (纸本)9781509033218

The proceedings contain 36 papers. The topics discussed include: fast, scalable and secure onloading of edge functions using airbox;establishing trusted identities in disconnected edge environments;a scalable coded computing framework for edge-facilitated wireless distributed computing;firework: big data processing in collaborative edge environment;access point ranking for cloudlet placement in edge computing environment;API QoS prediction for apps in cellular networks;a multi-user computation offloading algorithm based on game theory in mobile cloud computing;smart urban surveillance using fog computing;continuous computing from cloud to edge;and a distributed and resilient platform for city-scale smart systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 4th acm/ieee symposium on edge computing, SEC 2019

Proceedings of the 4th ACM/IEEE Symposium on Edge Computing,...

引用

4th acm/ieee symposium on edge computing, SEC 2019

ISBN: (纸本)9781450367332

The proceedings contain 64 papers. The topics discussed include: linearize, predict and place: minimizing the makespan for edge-based stream processing of directed acyclic graphs;LinkShare: device-centric control for concurrent and continuous mobile-cloud interactions;sandpaper: mitigating performance interference in CDN edge proxies;E2M: an energy-eï¬ƒcient middleware for computer vision applications on autonomous mobile robots;F-Cooper: feature based cooperative perception for autonomous vehicle edge computing system using 3D point clouds;and collaborative learning between cloud and end devices: an empirical study on location prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

proceedings - 2024 ieee/acm symposium on edge computing, SEC 2024

Proceedings - 2024 IEEE/ACM Symposium on Edge Computing, SEC...

引用

9th Annual ieee/acm symposium on edge computing, SEC 2024

ISBN: (纸本)9798350378283

The proceedings contain 65 papers. The topics discussed include: elastic execution of multi-tenant DNNs on heterogeneous edge MPSoCs;optimizing edge offloading decisions for object detection;an accurate and efficient clustered federated learning for mobile edge devices;adaptive frame-aware network for driver monitoring systems;camera: churn-tolerant mutual exclusion for the edge;are we there yet? – use cases and requirements for the industrial metaverse;LiDAR utilization for enhanced vehicle capabilities;edgeCore: resource dependency-aware multi-tenant orchestration for mobile edge clouds;righteous: automatic right-sizing for complex edge deployments;colibri: efficient collection of fine-grained resource metrics necessary for mobile edge computing;and CroMA: enhancing fault-resilience of machine learning-coupled IoT applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

proceedings - 2022 ieee/acm 7th symposium on edge computing, SEC 2022

Proceedings - 2022 IEEE/ACM 7th Symposium on Edge Computing,...

引用

7th ieee/acm symposium on edge computing, SEC 2022

ISBN: (纸本)9781665486118

The proceedings contain 75 papers. The topics discussed include: towards out-of-core neural networks on microcontrollers;learn to learn on chip: hardware-aware meta-learning for quantized few-shot learning at the edge;shepherd: seamless stream processing on the edge;time minimization in hierarchical federated learning;characterizing variability in heterogeneous edge systems: a methodology & case study;Gemini: a real-time video analytics system with dual computing resource control;ENTS: an edge-native task scheduling system for collaborative edge computing;Preva: protecting inference privacy through policy-based video-frame transformation;Rev: a video engine for object re-identification at the city scale;opportunities for optimizing the container runtime;and blockchain-enabled federated edge learning for big data quality assessment.

关键词：

来源：评论

学校读者我要写书评

暂无评论

proceedings - 2020 ieee/acm symposium on edge computing, SEC 2020

Proceedings - 2020 IEEE/ACM Symposium on Edge Computing, SEC...

引用

5th ieee/acm symposium on edge computing, SEC 2020

ISBN: (纸本)9781728159430

The proceedings contain 62 papers. The topics discussed include: feather: hierarchical querying for the edge;elasticity control for latency-intolerant mobile edge applications;towards a robust edge-native storage system;fooling edge computation offloading via stealthy interference attack;QoE-based server selection for mobile video streaming;secure and energy-efficient offloading and resource allocation in a NOMA-based MEC network;BEAF: a blockchain and edge assistant framework with data sharing for IoT networks;GLAMAR: geo-location assisted mobile augmented reality for industrial automation;an improvement on distance based positioning on network edges;CHA: a caching framework for home-based voice assistant systems;and CloudSLAM: edge offloading of stateful vehicular applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

proceedings - 2018 3rd acm/ieee symposium on edge computing, SEC 2018

Proceedings - 2018 3rd ACM/IEEE Symposium on Edge Computing,...

引用

3rd acm/ieee symposium on edge computing, SEC 2018

ISBN: (纸本)9781538694459

The proceedings contain 57 papers. The topics discussed include: Vigilia: securing smart home edge computing;learning from differentially private neural activations with edge computing;harpocrates: giving out your secrets and keeping them too;application-aware IoT camera virtualization for video analytics edge computing;edge-based discovery of training data for machine learning;bandwidth-efficient live video analytics for drones via edge computing;Aggio: a coupon safe for privacy-preserving smart retail environments;from cell towers to smart street lamps: placing cloudlets on existing urban infrastructures;scalable edge computing for low latency data dissemination in topic-based publish/subscribe;dependency mining for service resilience at the edge;cooperative-competitive task allocation in edge computing for delay-sensitive social sensing;portable energy-aware cluster-based edge computers;and scalability and performance evaluation of edge cloud systems for latency constrained applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

proceedings - 2023 ieee/acm symposium on edge computing, SEC 2023

Proceedings - 2023 IEEE/ACM Symposium on Edge Computing, SEC...

引用

8th Annual ieee/acm symposium on edge computing, SEC 2023

ISBN: (纸本)9798400701238

The proceedings contain 50 papers. The topics discussed include: semantic privacy-preserving for video surveillance services on the edge;distributed tracking and verifying: a real-time and high-accuracy visual tracking edge computing framework for Internet of Things;Octopus: in-network content adaptation to control congestion on 5G links;experimental test-bed for computation offloading for cooperative inference on edge devices;on balancing latency and quality of edge-native multi-view 3D reconstruction;RAVAS: interference-aware model selection and resource allocation for live edge video analytics;democratizing drone autonomy via edge computing;energy time fairness: balancing fair allocation of energy and time for GPU workloads;unveiling energy efficiency in deep learning: measurement, prediction, and scoring across edge devices;and bang for the buck: evaluating the cost-effectiveness of heterogeneous edge platforms for neural network workloads.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fast distributed approximation for TAP and 2-edge-connectivity

引用

DISTRIBUTED computing 2020年第2期33卷 145-168页

作者： Censor-Hillel, Keren Dory, Michal Technion Dept Comp Sci Haifa Israel

The tree augmentation problem (TAP) is a fundamental network design problem, in which the input is a graph G and a spanning tree T for it, and the goal is to augment T with a minimum set of edges Aug from G, such that T boolean OR Aug is 2-edge-connected. TAP has been widely studied in the sequential setting. The best known approximation ratio of 2 for the weighted case dates back to the work of Frederickson and JaJa (SIAM J Comput 10(2):270-283, 1981). Recently, a 3/2-approximation was given for unweighted TAP by Kortsarz and Nutov (acm Trans Algorithms 12(2):23, 2016). Recent breakthroughs give an approximation of 1.458 for unweighted TAP (Grandoni et al. in: proceedings of the 50th annual acm SIGACT symposium on theory of computing (STOC 2018), 2018), and approximations better than 2 for bounded weights (Adjiashvili in: proceedings of the twenty-eighth annual acm-SIAM symposium on discrete algorithms (SODA), 2017;Fiorini et al. in: proceedings of the twenty-ninth annual acm-SIAM symposium on discrete algorithms (SODA 2018), New Orleans, LA, USA, 2018. 10.1137/1.9781611975031.53). In this paper, we provide the first fast distributed approximations for TAP. We present a distributed 2-approximation for weighted TAP which completes in O(h) rounds, where h is the height of T. When h is large, we show a much faster 4-approximation algorithm for the unweighted case, completing in O(D+root nlog*n) rounds, where n is the number of vertices and D is the diameter of G. Immediate consequences of our results are an O(D)-round 2-approximation algorithm for the minimum size 2-edge-connected spanning subgraph, which significantly improves upon the running time of previous approximation algorithms, and an O(h(MST)+root nlog*n)-round 3-approximation algorithm for the weighted case, where h(MST) is the height of the MST of the graph. Additional applications are algorithms for verifying 2-edge-connectivity and for augmenting the connectivity of any connected spanning subgraph to 2.

关键词： Distributed graph algorithms Approximation algorithms Distributed network design Connectivity augmentation

来源：评论

学校读者我要写书评

暂无评论

A GENERAL FRAMEWORK FOR GRAPH SPARSIFICATION

引用

SIAM JOURNAL ON computing 2019年第4期48卷 1196-1223页

作者： Fung, Wai-Shing Hariharan, Ramesh Harvey, Nicholas J. A. Panigrahi, Debmalya Univ Waterloo Dept Combinator & Optimizat Waterloo ON N2L 3G1 Canada Strand Life Sci Bangalore 560024 Karnataka India Indian Inst Sci Dept Comp Sci & Automat Bangalore 560012 Karnataka India Univ British Columbia Dept Comp Sci Vancouver BC V6T 1Z4 Canada Duke Univ Dept Comp Sci Durham NC 27708 USA MIT Comp Sci & Artificial Intelligence Lab 77 Massachusetts Ave Cambridge MA 02139 USA

We present a general framework for constructing cut sparsifiers in undirected graphs- weighted subgraphs for which every cut has the same weight as the original graph, up to a multiplicative factor of (1 +/- epsilon). Using this framework, we simplify, unify, and improve upon previous sparsification results. As simple instantiations of this framework, we show that sparsifiers can be constructed by sampling edges according to their strength (a result of Benczur and Karger [Approximating s-t minimum cuts in (o) over tilde (n(2)) time, in proceedings of the Twenty-eighth Annual acm symposium on Theory of computing, acm, New York, 1996, pp. 47-55], [SIAM T. Comput., 44 (2015), pp. 290-319]), effective resistance (a result of Spielman and Srivastava [SIAM J. Comput., 40 (2011), pp. 1913-1926]), or edge connectivity. Sampling according to edge connectivity is the most aggressive method, and the most challenging to analyze. Our proof that this method produces sparsifiers resolves an open question of Benczur and Karger. While the above results are interesting from a combinatorial standpoint, we also prove new algorithmic results. In particular, we give the first (optimal) O(m)-time sparsification algorithm for unweighted graphs. Our algorithm has a running time of O(m) + (O) over tilde (n/epsilon(2)) for weighted graphs, which is also linear unless the input graph is very sparse itself. In both cases, this improves upon the previous best running times (due to Benczur and Karger [Approximating s-t minimum cuts in (o) over tilde (n(2)) time, in proceedings of the Twenty-eighth Annual acm symposium on Theory of computing, acm, New York, 1996, pp. 47-551, [SIAM T. Comput., 44 (2015), pp. 290-319]) of O(m log(2) n) (for the unweighted case) and O(m log(3) n) (for the weighted case), respectively. Our algorithm constructs sparsifiers that contain O(n log n/epsilon(2)) edges in expectation. A key ingredient of our proofs is a natural generalization of Karger's bound on the number

关键词： cut sparsification edge connectivity edge sampling

来源：评论

学校读者我要写书评

暂无评论

Poster: Cost-Effective Microservice Scaling at edge 4

Poster: Cost-Effective Microservice Scaling at Edge

引用

4th acm/ieee symposium on edge computing (SEC)

作者： Samanta, Amit Li, Yong IIT Kharagpur Kharagpur W Bengal India Tsinghua Univ Beijing Peoples R China

We propose a cost-effective microservice scaling to manage complex IoT and microservices for future edge computing applications. We design a small scale prototype to show it's basic functionality considering scali... 详细信息

ISBN: (纸本)9781450367332

关键词： edge Cloud microservices scaling evaluation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：