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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

16 篇 会议
1 册 图书

馆藏范围

17 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

10 篇 工学
- 8 篇 计算机科学与技术...
- 3 篇 电气工程
- 3 篇 软件工程
- 1 篇 力学（可授工学、理...
- 1 篇 信息与通信工程
3 篇 理学
- 2 篇 数学
- 1 篇 物理学
3 篇 管理学
- 2 篇 图书情报与档案管...
- 1 篇 管理科学与工程(可...

主题

2 篇 parallel computa...
2 篇 multi-access edg...
2 篇 fast matrix mult...
1 篇 vehicle dynamics
1 篇 compilers
1 篇 sparse fourier t...
1 篇 theory of comput...
1 篇 radio transmitte...
1 篇 distributed algo...
1 篇 simulation
1 篇 computation offl...
1 篇 counting
1 篇 power amplifiers
1 篇 algorithms
1 篇 vertex-centric c...
1 篇 network topology
1 篇 image edge detec...
1 篇 precoding
1 篇 drone
1 篇 matrix chain pro...

机构

2 篇 hebrew univ jeru...
1 篇 dept. of compute...
1 篇 university of te...
1 篇 cwi
1 篇 univ south carol...
1 篇 state key labora...
1 篇 dept. of compute...
1 篇 zhejiang univ sc...
1 篇 natl inst inform...
1 篇 beihang univ sch...
1 篇 univ tsukuba dep...
1 篇 sysu cmu shunde ...
1 篇 university of wa...
1 篇 univ edinburgh s...
1 篇 univ oxford dept...
1 篇 gwangju korea re...
1 篇 brno univ techno...
1 篇 school of electr...
1 篇 sun yat sen univ...
1 篇 king's college u...

作者

2 篇 schwartz oded
1 篇 zhang qingyang
1 篇 chang yong-jun
1 篇 radoszewski jaku...
1 篇 machida fumio
1 篇 honghao lv
1 篇 wu weigang
1 篇 deyou zhang
1 篇 fox kyle
1 篇 weigang wu
1 篇 hoque safi shams...
1 篇 olsak ondrej
1 篇 jaros jiri
1 篇 hu zhenjiang
1 篇 lin xiaola
1 篇 crochemore maxim...
1 篇 zuba wiktor
1 篇 zakian timothy a...
1 篇 sahin alphan com...
1 篇 capelli ludovic ...

语言

17 篇 英文

检索条件"任意字段=33rd International Symposium on Algorithms and Computation, ISAAC 2022"

共 17 条记录，以下是1-10 订阅

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

详细简洁

排序：

33rd international symposium on algorithms and computation, isaac 2022

33rd International Symposium on Algorithms and Computation, ...

引用

33rd international symposium on algorithms and computation, isaac 2022

ISBN: (纸本)9783959772587

The proceedings contain 65 papers. The topics discussed include: a local search algorithm for the min-sum submodular cover problem;algorithms for coloring reconfiguration under recolorability digraphs;algorithms for landmark hub labeling;an optimal oracle separation of classical and quantum hybrid schemes;approximating the minimum logarithmic arrangement problem;bi-criteria approximation algorithms for bounded-degree subset TSP;budgeted out-tree maximization with submodular prizes;clustering with faulty centers;combinatorial and algorithmic aspects of monadic stability;complexity and algorithms for isometric path cover on chordal graphs and beyond;computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws;computing palindromes on a trie in linear time;distortion-oblivious algorithms for scheduling on multiple machines;and entropy matters: understanding performance of sparse random embeddings.

关键词：

来源：评论

学校读者我要写书评

暂无评论

computation of Cycle Bases in Surface Embedded Graphs 33

Computation of Cycle Bases in Surface Embedded Graphs

引用

33rd international symposium on algorithms and computation, isaac 2022

作者： Fox, Kyle Stanley, Thomas University of Texas at Dallas RichardsonTX United States Dallas TX United States

ISBN: (纸本)9783959772587

We present an O(n3g2 log g + m) + Õ(nω+1) time deterministic algorithm to find the minimum cycle basis of a directed graph embedded on an orientable surface of genus g. This result improves upon the previous fastest known running time of O(m3n + m2n2 log n) applicable to general directed graphs. While an O(nω + 22gn2 + m) time deterministic algorithm was known for undirected graphs, the use of the underlying field Q in the directed case (as opposed to Z2 for the undirected case) presents extra challenges. It turns out that some of our new observations are useful for both variants of the problem, so we present an O(nω + n2g2 log g + m) time deterministic algorithm for undirected graphs as well. © Kyle Fox and Thomas Stanley.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

computation of Matrix Chain Products on Parallel Machines 33

Computation of Matrix Chain Products on Parallel Machines

引用

33rd IEEE international Parallel and Distributed Processing symposium (IPDPS)

作者： Schwartz, Oded Weiss, Elad Hebrew Univ Jerusalem Jerusalem Israel

ISBN: (纸本)9781728112466

The Matrix Chain Ordering Problem is a well studied optimization problem, aiming at finding optimal parentheses assignment for minimizing the number of arithmetic operations required when computing a chain of matrix multiplications. Existing algorithms include the O(N-3) dynamic programming of Godbole (1973) and the faster O(N log N) algorithm of Hu and Shing (1982). We show that both may result in suboptimal parentheses assignment on modern machines as they do not take into account inter-processor communication costs that often dominate the running time. Further, the optimal solution may change when using fast matrix multiplication algorithms. We show that the O(N-3) dynamic-programing algorithm easily adapts to provide optimal solutions for modern matrix multiplication algorithms, and obtain an adaption of the O(N log N) algorithm that guarantees a constant approximation.

关键词： algorithms I/O Complexity Fast Matrix Multiplication Parallel computation Matrix Chain Products

来源：评论

学校读者我要写书评

暂无评论

NOMA Enabled Multi-Access Edge Computing: A Joint MU-MIMO Precoding and computation Offloading Design 33

NOMA Enabled Multi-Access Edge Computing: A Joint MU-MIMO Pr...

引用

33rd international symposium on Industrial Electronics (ISIE)

作者： Zhang, Deyou Lyu, Honghao Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China Zhejiang Univ Sch Mech Engn State Key Lab Fluid Power & Mechatron Syst Hangzhou Peoples R China

ISBN: (纸本)9798350394085;9798350394092

This paper investigates computation offloading and transmit precoding co-design for multi-access edge computing (MEC), where multiple MEC users (MUs) equipped with multiple antennas access the MEC server in a non-orthogonal multiple access manner. We aim to minimize the total energy consumption of all MUs while satisfying the latency constraints by jointly optimizing the computational frequency, offloading ratio, and precoding matrix of each MU. For tractability, we first decompose the original problem into three subproblems and then solve these subproblems iteratively until convergence. Simulation results validate the convergence of the proposed method and demonstrate its superiority over baseline algorithms.

关键词： Multi-access edge computing non-orthogonal multiple access computation offloading precoding design

来源：评论

学校读者我要写书评

暂无评论

Revisiting the I/O-Complexity of Fast Matrix Multiplication with Recomputations 33

Revisiting the I/O-Complexity of Fast Matrix Multiplication ...

引用

33rd IEEE international Parallel and Distributed Processing symposium (IPDPS)

作者： Nissim, Roy Schwartz, Oded Hebrew Univ Jerusalem Jerusalem Israel

ISBN: (纸本)9781728112466

Communication costs, between processors and across the memory hierarchy, often dominate the runtime of algorithms. Can we trade these costs for recomputations? Most algorithms do not utilize recomputation for this end, and most communication cost lower bounds assume no recomputation, hence do not address this fundamental question. Recently, Bilardi and De Stefani (2017), and Bilardi, Scquizzato, and Silvestri (2018) showed that recomputations cannot reduce communication costs in Strassen's fast matrix multiplication and in fast Fourier transform. We extend the former bound and show that recomputations cannot reduce communication costs for a few other fast matrix multiplication algorithms.

关键词： DO-complexity Fast Matrix Multiplication Recomputation Memory Hierarchy Parallel computation

来源：评论

学校读者我要写书评

暂无评论

Accurate and Efficient Counting in Dynamic Networks 33

Accurate and Efficient Counting in Dynamic Networks

引用

IEEE 33rd international symposium on Reliable Distributed Systems

作者： Yang, Zhiwei Wu, Weigang Chen, Yishun Lin, Xiaola Sun Yat Sen Univ Dept Comp Sci Guangzhou 510006 Guangdong Peoples R China Zhongkai Univ Agr & Engn Coll Computat Sci Guangzhou 510006 Guangdong Peoples R China SYSU CMU Shunde Int Joint Res Inst Shunde Peoples R China

ISBN: (纸本)9781479955848

Dynamic network is the abstraction of networks with frequent topology changes arising from node mobility or other reasons. With the model of dynamic network, fundamental distributed computing problems can be formally studied with rigorous correctness. In this work, we study the counting problem, which plays a significant role in many applications, such as all-to-all information dissemination. Existing counting algorithms for dynamic networks are mostly estimation based and randomized, and cannot achieve accurate results deterministically. To address this problem, we adopt the diffusing computation approach in this paper. Although this approach has been widely used to solve different distributed computing problems, due to dynamic topology changes, existing diffusing computation algorithms cannot work under dynamic network models. To address such challenge, we firstly define a new dynamicity model, named (Q, S)-distance, which is used to describe dynamic changes of information propagation time. Based on (Q, S)-distance, we design two different counting algorithms. The first algorithm focuses on extending typical diffusing computation approach by handling topology changes. Different from existing algorithms, which have two phases, our algorithms contain three phases and the new phase is used to determine and notify the termination of tree growing, which the major challenge is caused by topology dynamicity. The second algorithm further extends the first one by incorporating a cluster-based hierarchy to reduce communication cost. The correctness of both the algorithms is formally proved and their performances in time cost and communication cost are analyzed.

关键词： counting dynamic network diffusing computation distributed algorithm cluster

来源：评论

学校读者我要写书评

暂无评论

Techniques for Efficient Fourier Transform computation in Ultrasound Simulations 24

Techniques for Efficient Fourier Transform Computation in Ul...

引用

33rd international symposium on High-Performance Parallel and Distributed Computing (HPDC)

作者： Olsak, Ondrej Jaros, Jiri Brno Univ Technol Fac Informat Technol Brno Czech Republic

ISBN: (纸本)9798400704130

Noninvasive ultrasound surgeries represent a rapidly growing field in medical applications. Preoperative planning often relies on computationally expensive ultrasound simulations. This paper explores methods to accelerate these simulations by reducing the computation time of the Fourier transform, which is an integral part of the simulation in the k-Wave toolbox. Two experiments and their results will be presented. The first investigates substituting the standard Fast Fourier Transform (FFT) with a Sparse Fourier Transform (SFT). The second approach utilises filtering of the frequency spectrum, inspired by image compression algorithms. The aim of both experiments is to find a suitable method for accelerating the Fourier transform while utilising the sparsity of the spectrum in acoustic pressure. Our findings show that filtering offers significantly better results in terms of computation error, leading to a substantial reduction in overall simulation runtime.

关键词： Ultrasound wave propagation k-Wave Sparse Fourier Transform

来源：评论

学校读者我要写书评

暂无评论

Chirp-Based Over-the-Air computation for Long-Range Federated Edge Learning 33

Chirp-Based Over-the-Air Computation for Long-Range Federate...

引用

33rd IEEE Annual international symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Hoque, Safi Shams Muhtasimul Adeli, Mohammad Hassan Sahin, Alphan Comma Univ South Carolina Dept Elect Engn Columbia SC 29208 USA

ISBN: (数字)9781665480536

ISBN: (纸本)9781665480536

In this study, we propose circularly-shifted chirp (CSC)-based majority vote (MV) (CSC-MV), a power-efficient over-the-air computation (OAC) scheme, to achieve long-range federated edge learning (FEEL). The proposed approach maps the votes (i.e., the sign of the local gradients) from the edge devices (EDs) to the linear CSCs constructed with a discrete Fourier transform-spread orthogonal frequency division multiplexing (DFT-s-OFDM) transmitter. At the edge server (ES), the MV is calculated with an energy detector. We compare our proposed scheme with one-bit broadband digital aggregation (OBDA) and show that the output-power back-off (OBO) requirement of the transmitters with an adjacent-channel-leakage ratio (ACLR) constraint for CSC-MV is lower than the one with OBDA. For example, with an ACLR constraint of -22 dB, CSC-MV can have an OBO requirement of 6- 7 dB less than the one with OBDA. When the power amplifier (PA) non-linearity is considered, we demonstrate that CSC-MV outperforms OBDA in terms of test accuracy for both homogeneous and heterogeneous data distributions, without using channel state information (CSI) at the ES and EDs.

关键词： Chirp Broadband amplifiers Image edge detection OFDM Radio transmitters Power amplifiers Detectors

来源：评论

学校读者我要写书评

暂无评论

Incrementalization of Vertex-Centric Programs 33

Incrementalization of Vertex-Centric Programs

引用

33rd IEEE international Parallel and Distributed Processing symposium (IPDPS)

作者： Zakian, Timothy A. K. Capelli, Ludovic A. R. Hu, Zhenjiang Univ Oxford Dept Comp Sci Oxford England Univ Edinburgh Sch Informat Edinburgh Midlothian Scotland Natl Inst Informat Informat Syst Architecture Res Div Tokyo Japan

ISBN: (纸本)9781728112466

As the graphs in our world become ever larger, the need for programmable, easy to use, and highly scalable graph processing has become ever greater. One such popular graph processing model the vertex-centric computational model does precisely this by distributing computations across the vertices of the graph being computed over. Due to this distribution of the program to the vertices of the graph, the programmer "thinks like a vertex" when writing their graph computation, with limited to no sense of shared memory and where almost all communication between each on-vertex computation must be sent over the network. Because of this inherent communication overhead in the computational model, reducing the number of messages sent while performing a given computation is a central aspect of any efforts to optimize vertex-centric programs. While previous work has focused on reducing communication overhead by directly changing communication patterns by altering the way the graph is partitioned and distributed, or by altering the graph topology itself in this paper we present a different optimization strategy based on a family of complementary compile-time program transformations in order to minimize communication overhead by changing both the messaging and computational structures of programs. Particularly, we present and formalize a method by which a compiler can automatically incrementalize a vertex-centric program through a series of compile-time program transformations by modifying the on-vertex computation and messaging between vertices so that messages between vertices represent patches to be applied to the other vertex's local state. We empirically evaluate these transformations on a set of common vertex-centric algorithms and graphs and achieve an average reduction of 2.7X in total computational time, and 2.9X in the number of messages sent across all programs in the benchmark suite. Furthermore, since these are compile-time program transformations alone, other prior o

关键词： Compilers Vertex-Centric computation

来源：评论

学校读者我要写书评

暂无评论

Performance Bottleneck Analysis of Drone computation Offloading to a Shared Fog Node 33

Performance Bottleneck Analysis of Drone Computation Offload...

引用

33rd IEEE international symposium on Software Reliability Engineering (ISSRE)

作者： Zhang, Qingyang Machida, Fumio Andrade, Ermeson Univ Tsukuba Dept Comp Sci Tsukuba Ibaraki Japan Univ Fed Rural Pernambuco Dept Comp Recife PE Brazil

ISBN: (纸本)9781665476799

Computing in drones has recently become popular for various real-world applications. To assure the performance and reliability of drone computing, systems can also adopt computation offloading to a nearby fog or edge server through a wireless network. As the offloading performance is significantly affected by the amount of workload, the network stability, and the competing use of a shared resource, performance estimation is essential for such systems. In this paper, we analyze the performance bottleneck of a drone system consisting of multiple drones that offload the tasks to a shared fog node. We investigate how resource conflict due to computation offloading causes the performance bottleneck of the drone computation system. To model the behavior of the system and analyze the performance and availability, we use Stochastic Reward Nets (SRNs). Through the numerical experiments, we confirm that the benefit of computation offloading deteriorates as the number of competing drones increases. To overcome the performance bottleneck, we also discuss potential solutions to mitigate the issue of a shared fog node.

关键词： Drone Fog computing Offload Performance bottleneck Stochastic reward nets

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：