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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Weak signal detection in 5g+ systems: a distributed deep learning framework 21

Weak signal detection in 5g+ systems: a distributed deep lea...

引用

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

作者： Guo, Yifan Yu, Lixing Wang, Qianlong Ji, Tianxi Fang, Yuguang Wei-Kocsis, Jin Li, Pan Case Western Reserve University ClevelandOH United States Towson University TowsonMD United States University of Florida GainesvilleFL United States Purdue University West LafayetteIN United States

ISBN: (纸本)9781450385589

Internet connected mobile devices in 5G and beyond (simply 5G+) systems are penetrating all aspects of people's daily life, transforming the way we conduct business and live. However, this rising trend has also posed unprecedented traffic burden on existing telecommunication infrastructure including cellular systems, consistently causing network congestion. Although additional spectrum resources have been allocated, exponentially increasing traffic tends to always outpace the added capacity. In order to increase the data rate and reduce the latency, 5G+ systems have heavily relied on hyperdensification and higher frequency bands, resulting in dramatically increased interference temperature, and consequently significantly more weak signals (i.e., signals with low Signal-to-Noise-plus-Interference (SINR) ratio). With traditional detection mechanisms, a large number of weak signals will not be detected, and hence be wasted, leading to poor throughput in 5G+ systems. To this end, in this paper, we develop an online weak-signal detection scheme to recover weak signals for mobile users so as to significantly boost their data rates without adding additional spectrum resource. Specifically, we first formulate weak signal detection as a high dimensional user-time signal matrix factorization problem and solve this problem by devising a novel learning model, called Dual-CNN Deep Matrix Factorization (DCDMF). Then, we design an online distributed learning framework to collaboratively train and update our proposed DCDMF model between an edge network and mobile users, with correctly decoded signals at users only. By conducting simulations on real-world traffic datasets, we demonstrate that our proposed weak signal detection scheme can achieve throughput gain of up to 3.12 times, with computing latency of 0.84 ms per KB signals on average. © 2021 acm.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

An Energy Management System at the Edge based on Reinforcement Learning 24

An Energy Management System at the Edge based on Reinforceme...

引用

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

作者： Cicirelli, F. Gentile, A. F. Greco, E. Guerrieri, A. Spezzano, G. Vinci, A. Natl Res Council Italy Inst High Performance Comp & Networking ICAR Arcavacata Di Rende CS Italy

ISBN: (纸本)9781728173436

In this work, we propose an IoT edge-based energy management system devoted to minimizing the energy cost for the daily-use of in-home appliances. The proposed approach employs a load scheduling based on a load shifting technique, and it is designed to operate in an edge-computing environment naturally. The scheduling considers all together time-variable profiles for energy cost, energy production, and energy consumption for each shiftable appliance. Deadlines for load termination can also be expressed. In order to address these goals, the scheduling problem is formulated as a Markov decision process and then processed through a reinforcement learning technique. The approach is validated by the development of an agent-based real-world test case deployed in an edge context.

关键词： Edge computing Reinforcement Learning Energy Management Systems Internet of Things Multi-Agent Systems

来源：评论

学校读者我要写书评

暂无评论

Enabling Wireless Ad Hoc Edge Systems with Yggdrasil 20

Enabling Wireless Ad Hoc Edge Systems with Yggdrasil

引用

35th Annual acm symposium on Applied computing (SAC)

作者： Costa, Pedro Akos Rosa, Andre Leitao, Joao Univ Lisbon NOVA LINCS Lisbon Portugal Univ Lisbon DI FCT NOVA Lisbon Portugal

ISBN: (纸本)9781450368667

Wireless ad hoc networks were extensively studied in the past given their potential for scalability, ease of deployment, and suitability for scenarios where no infrastructure is available. Considering the recent relevance of applications, particularly in the Internet of Things (IoT) and edge computing domains, revisiting these networks becomes a necessity, as to develop novel distributed applications. distributed applications are highly complex as they require multiple services and abstractions supported by a wide range of distributed protocols, specially in such adverse domains. To simplify the development of applications in ad hoc networks, in this paper we present Yggdrasil, a novel framework and middleware specifically tailored for the development and execution of distributed applications and associated protocols using commodity devices in such networks. Yggdrasil provides a simple yet effective development environment, which is achieved by combining an event driven programming model with a multi-threaded execution environment that shield the programmer from concurrency issues. A fully functional prototype was developed in C and experimentally evaluated using a fleet of 24 Raspberry Pis.

关键词： Wireless Ad Hoc Networks distributed Protocols Framework

来源：评论

学校读者我要写书评

暂无评论

Reduction of Inter-process Communication in distributed Simulation of Road Traffic 24

Reduction of Inter-process Communication in Distributed Simu...

引用

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

作者： Potuzak, Tomas Univ West Bohemia Fac Appl Sci Dept Comp Sci & Engn Plzen Czech Republic

ISBN: (数字)9781728173436

ISBN: (纸本)9781728173436

A detailed computer simulation is an important tool for the managing of road traffic. Since it can be very time consuming, it is often performed in a distributed computing environment. The simulated road traffic network is then divided into sub-networks simulated by processes on the nodes of the distributed computer. The inter-process communication necessary for the vehicle transfer and the synchronization can then significantly influence the performance of the distributed road traffic simulation. In this paper, two efficient communication protocols for distributed road traffic simulation, which we developed during our previous research, are compared. These protocols - the Long Step (LS) protocol and the Long Step Binary (LSB) protocol - reduce the inter-process communication using an aggregate message transfer and/or a lossy data compression. Semi-centralized, centralized, and distributed variants of both protocols were thoroughly tested and compared to a reference communication protocol representing a common protocol of distributed road traffic simulators. The tests indicate significant savings of the number of transferred messages and, more importantly, of the total computation time.

关键词： road traffic distributed simulation communication reduction aggregate transfer lossy data compression

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Improved distributed Approximations for Maximum-Weight Independent Set 20

Brief Announcement: Improved Distributed Approximations for ...

引用

39th symposium on principles of distributed computing

作者： Kawarabayashi, Ken-ichi Khoury, Seri Schild, Aaron Schwartzman, Gregory NII Tokyo Japan Univ Calif Berkeley Berkeley CA USA Univ Washington Seattle WA 98195 USA JAIST Nomi Japan

ISBN: (纸本)9781450375825

We present improved algorithms for approximating maximum-weight independent set (MaxIS) in the CONGEST model. Given an input graph, let n and Delta be the number of nodes and maximum degree, respectively, and let MIS(n,Delta ) be the running time of finding a maximal independent set (MIS) in the CONGEST model. Bar-Yehuda et al. [PODC 2017] showed that there is an algorithm in the CONGEST model that finds a.-approximation for MaxIS in O ( MIS(n,Delta) log W) rounds, where.. is the maximum weight of a node in the graph, which can be as high as poly(n). Whether their algorithm is deterministic or randomized depends on the MIS algorithm that is used as a black-box. Our results: (1) A deterministic O(MIS(n, Delta)/epsilon)-round algorithm that finds a (1 + epsilon)Delta-approximation for MaxIS in the CONGEST model. (2) Arandomized ( poly( log log n)/epsilon)-round algorithm that finds, with high probability, a (1 +epsilon)Delta-approximation for MaxIS in the CONGEST model. That is, by sacrificing only a tiny fraction of the approximation guarantee, we achieve an exponential speed-up in the running time over the previous best known result.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A Privacy-Protecting Indoor Emergency Monitoring System based on Floor Vibration 20

A Privacy-Protecting Indoor Emergency Monitoring System base...

引用

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

作者： Yu, Yang Weis, Torben Univ Duisburg Essen Distributed Syst Grp Duisburg Germany

ISBN: (纸本)9781450380768

In this work we present an indoor emergency context monitoring system based on ground vibration caused by persons in the target area. The system is designed for production plants and large buildings to perceive the safety status of this area. Our approach is privacy-protecting, because it requires neither video nor sound. Instead, piezo sensors on the floor measure vibrations, which are analyzed with machine learning to compute the safety status of the covered area. This way our system can determine whether an emergency occurred, but it is not straight forward possible to attach names to the detected persons. We compare the impact of different feature extraction methods and different types of classifiers on the classification results. Our experiments show that we can determine an emergency event with an average F1 score of 0.97.

关键词： vibration signal pattern recognition deep learning privacy protection emergency detecton ontext recognition piezo sensor

来源：评论

学校读者我要写书评

暂无评论

A New Julia-Based Parallel Time-Domain Simulation Algorithm for Analysis of Power System Dynamics 24

A New Julia-Based Parallel Time-Domain Simulation Algorithm ...

引用

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

作者： Kyesswa, Michael Schmurr, Philipp Cakmak, Hueseyin K. Kuehnapfel, Uwe Hagenmeyer, Veit Karlsruhe Inst Technol Inst Automat & Appl Informat Karlsruhe Germany

ISBN: (纸本)9781728173436

The present paper describes a new parallel time-domain simulation algorithm using a high performance computing environment - Julia - for the analysis of power system dynamics in large networks. The parallel algorithm adapts a parallel-in-space decomposition scheme to a previously sequential algorithm in order to develop a new parallelizable numerical solution of the power system equations. The parallel-in-space decomposition is based on the block bordered diagonal form, which reformulates the network admittance matrix into sub-blocks that can be solved in parallel. For the optimal spatial decomposition of the network, a new extended graph partitioning strategy is developed for load balancing and minimizing the communication between subnetworks. The new parallel simulation algorithm is tested using standard test networks of varying complexity. The simulation results are compared to those obtained from a sequential implementation in order to validate the solution accuracy and to determine the performance improvement in terms of computational speedup. Test simulations are conducted using the ForHLR II supercomputing cluster and show a huge potential in computational speedup with increasing network complexity.

关键词： Graph partitioning parallel computing power systems time-domain simulation transient stability analysis

来源：评论

学校读者我要写书评

暂无评论

CoSim: A Simulator for Co-Scheduling of Batch and On-Demand Jobs in HPC Datacenters 24

CoSim: A Simulator for Co-Scheduling of Batch and On-Demand ...

引用

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

作者： Maurya, Avinash Nicolae, Bogdan Guliani, Ishan Rafique, M. Mustafa Rochester Inst Technol Rochester NY 14623 USA Argonne Natl Lab Argonne IL 60439 USA

ISBN: (纸本)9781728173436

The increasing scale and complexity of scientific applications are rapidly transforming the ecosystem of tools, methods, and workftows adopted by the high-performance computing (HPC) community. Big data analytics and deep learning are gaining traction as essential components in this ecosystem in a variety of scenarios, such as, steering of experimental instruments, acceleration of high-fidelity simulations through surrogate computations, and guided ensemble searches. In this context, the batch job model traditionally adopted by the supercomputing infrastructures needs to be complemented with support to schedule opportunistic on-demand analytics jobs, leading to the problem of efficient preemption of batch jobs with minimum loss of progress. In this paper, we design and implement a simulator, CoSim, that enables on-the-fty analysis of the trade-offs arising between delaying the start of opportunistic on-demand jobs, which leads to longer analytics latency, and loss of progress due to preemption of batch jobs, which is necessary to make room for on-demand jobs. To this end, we propose an algorithm based on dynamic programming with predictable performance and scalability that enables supercomputing infrastructure schedulers to analyze the aforementioned trade-off and take decisions in near real-time. Compared with other state-of-art approaches using traces of the Theta pre-Exascale machine, our approach is capable of finding the optimal solution, while achieving high performance and scalability.

关键词： High-performance computing batch job preemption job checkpointing

来源：评论

学校读者我要写书评

暂无评论

Lower Bounds for distributed Sketching of Maximal Matchings and Maximal Independent Sets 20

Lower Bounds for Distributed Sketching of Maximal Matchings ...

引用

39th symposium on principles of distributed computing

作者： Assadi, Sepehr Kol, Gillat Oshman, Rotem Rutgers State Univ Piscataway NJ 08854 USA Princeton Univ Princeton NJ 08544 USA Tel Aviv Univ Tel Aviv Israel

ISBN: (纸本)9781450375825

Consider the following distributed graph sketching model: There is a referee and n vertices in an undirected graph G sharing public randomness. Each vertex v only knows its neighborhood in G and the referee receives no input initially. The vertices simultaneously each sends a message, called a sketch, to the referee who then based on the received sketches outputs a solution to some combinatorial problem on G, say, the minimum spanning tree problem. Previous work on graph sketching have shown that numerous problems, including connectivity, minimum spanning tree, edge or vertex connectivity, cut or spectral sparsifiers, and (Delta+1)-vertex coloring, all admit efficient algorithms in this model that only require sketches of size polylog(n) per vertex. In contrast, we prove that the two fundamental problems of maximal matching and maximal independent set do not admit such efficient solutions: Any algorithm for either problem that errs with a small constant probability requires sketches of size Omega(n(1/2-epsilon)) for any constant epsilon > 0. We prove our results by analyzing communication complexity of these problems in a communication model that allows sharing of inputs between limited number of players, and hence lies between the standard number-in-hand and number-on-forehead multi-party communication models. Our proofs are based on a family of hard instances using Ruzsa-Szemeredi graphs and information-theoretic arguments to establish the communication lower bounds.

关键词： distributed sketching maximal matching maximal independent set communication complexity broadcast congested clique

来源：评论

学校读者我要写书评

暂无评论

DADS: Dynamic Slicing Continuously-Running distributed Programs with Budget Constraints 2020

DADS: Dynamic Slicing Continuously-Running Distributed Progr...

引用

28th acm Joint Meeting on European Software Engineering Conference and symposium on the Foundations of Software Engineering (ESEC/FSE)

作者： Fu, Xiaoqin Cai, Haipeng Li, Li Washington State Univ Pullman WA 99164 USA Monash Univ Clayton Vic Australia

ISBN: (纸本)9781450370431

We present DADS, the first distributed, online, scalable, and cost-effective dynamic slicer for continuously-running distributed programs with respect to user-specified budget constraints. DADS is distributed by design to exploit distributed and parallel computing resources. With an online analysis, it avoids tracing hence the associated time and space costs. Most importantly, DADS achieves and maintains practical scalability and cost-effectiveness tradeoffs according to a given budget on analysis time by continually and automatically adjusting the configuration of its analysis algorithm on the fly via reinforcement learning. Against eight real-world Java distributed systems, we empirically demonstrated the scalability and cost-effectiveness merits of DADS. The open-source tool package of DADS with a demo video is publicly available.

关键词： distributed system dynamic slicing reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共448页 << < 61 62 63 64 65 66 67 68 69 70 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：