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

Operation Dependencies in Loop Pipelining for High-Level Synthesis

Operation Dependencies in Loop Pipelining for High-Level Syn...

2018 South-East Europe Design Automation, computer engineering, computer Networks and Social Media Conference, SEEDA_CECNSM 2018

作者： Dimitriou, Georgios Dossis, Michael Stamoulis, Georgios Dept. of Computer Science University of Thessaly Lamia Greece Dept. of Inf. Engineering TEI of W. Macedonia Kastoria Greece Dept. of Electrical and Computer Engineering University of Thessaly Volos Greece

ISBN: (纸本)9786188331419

Research and industry interest in high-level synthesis has been renewed in the last few years, proven by the introduction of new tools or improved versions of existing tools. Academic tools like Gaut or CCC have recently appeared in new versions with expanded functionality in order to cover increased hardware design requirements. Likewise, industrial tools like Xilinx VivadoHLS or, more recently, Cadence Stratus have appeared and are continuously evolving in their effort to succeed in the market. One technology that high-level synthesis tools have chosen to invest on is compiler-driven code optimizations, which are a promising means to improve efficiency of automatically generated hardware. Loop transformations are among the most popular compiler optimizations, for both software and hardware targets. Loop unrolling and loop pipelining, coupled with careful instruction reordering, can deliver highly optimized output. Instruction dependencies play a significant role in such optimizations, limiting performance improvement for the final code. In this paper, we discuss the issue of dependencies among loop body operations, especially those forming cycles, and their impact on high-level synthesis. We present results from experiments with several benchmarks on the CCC and VivadoHLS tools, showing that CCC can deliver better output than VivadoHLS in the presence of complex operation dependence cycles. © 2018 Tei of Western Macedonia.

关键词： High level synthesis

来源：评论

学校读者我要写书评

暂无评论

Power-consumption outage challenge in next-generation cellular networks

arXiv

引用

arXiv 2019年

作者： Yang, Jing Zhong, Yi Ge, Xiaohu Chao, Han-Chieh Dept. School of Electron. Inf. & Commun Huazhong University of Science and Technology Wuhan China Dept. School of Electrical Engineering National Dong Hwa University Hualien Taiwan

The conventional outage in wireless communication systems is caused by the deterioration of the wireless communication link, i.e., the received signal power is less than the minimum received signal power. Is there a possibility that the outage occurs in wireless communication systems with a good channel state? Based on both communication and heat transfer theories, a power-consumption outage in the wireless communication between millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) base stations (BSs) and smartphones has been modeled and analyzed. Moreover, the total transmission time model with respect to the number of power-consumption outages is derived for mmWave massive MIMO communication systems. Simulation results indicate that the total transmission time is extended by the power-consumption outage, which deteriorates the average transmission rate of mmWave massive MIMO BSs. Copyright © 2019, The Authors. All rights reserved.

关键词： Outages

来源：评论

学校读者我要写书评

暂无评论

Power-Consumption Outage Challenge in Next-Generation Cellular Networks

Power-Consumption Outage Challenge in Next-Generation Cellul...

引用

IEEE Global Communications Conference

作者： Jing Yang Yi Zhong Xiaohu Ge Han-Chieh Chao Dept. School of Electron. Inf. & Commun. Huazhong University of Science and Technology Wuhan China Dept. School of Electrical Engineering National Dong Hwa University Hualien Taiwan

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

关键词： Smart phones Wireless communication MIMO communication Heat transfer Heating systems Heat sinks Power system reliability

来源：评论

学校读者我要写书评

暂无评论

Friendly and Progressive Visual Secret Sharing with Lossless Reconstruction

Friendly and Progressive Visual Secret Sharing with Lossless...

引用

International Conference on science in inf.rmation Technology (ICSITech)

作者： Heri Prasetyo Jing-Ming Guo Chih-Hsien Hsia Departement of Informatics Universitas Sebelas Maret Surakarta Indonesia Departement of Electrical Engineering National Taiwan Univ. Sci. Technol. Taipei Taiwan Dept. Computer Sci. and Inf. Eng. National Ilan University Yilan Taiwan

This paper presents a new simple and efficient technique for secret sharing. This technique inherits the effectiveness of Progressive Visual Secret Sharing (PVSS), in which the quality of recovered secret image is improved if more shared images are stacked together using the eXclusive-OR (XOR) operation. The proposed method also extends the usability of PVSS approach into the Friendly Visual Secret Sharing (PVSS). The content of shared image is converted into more friendly appearances rather than in the noise-like shared image. The proposed method offers promising result for grayscale and color image. It also produces recovered secret image in the lossless condition. The proposed method can be regarded as a good candidate for secret sharing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Granger causality on horizontal sum of Boolean algebras

arXiv

引用

arXiv 2018年

作者： Bohdalová, Mária Kalina, Martin Nánásiová, Olga Dept. of Inf. Systems Faculty of Management Comenius University Bratislava Dept. of Mathematics Faculty of Civil Engineering Slovak University of Technology Bratislava Institute of Computer Science and Mathematics Faculty of Electrical Engineering and Information Technology Slovak University of Technology Bratislava

The intention of this paper is to discuss the mathematical model of causality introduced by C.W.J. Granger in 1969. The Granger's model of causality has become well-known and often used in various econometric models describing causal systems, e.g., between commodity prices and exchange rates. Our paper presents a new mathematical model of causality between two measured objects. We have slightly modified the well-known Kol-mogorovian probability model. In particular, we use the horizontal sum of set σ-algebras instead of their direct *** Codes 03G12, 06C15, 81P10 Copyright © 2018, The Authors. All rights reserved.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

Efficient handling of SPARQL optional for OBDA (Extended Version)

arXiv

引用

arXiv 2018年

作者： Xiao, G. Kontchakov, R. Cogrel, B. Calvanese, D. Botoeva, E. KRDB Research Centre Free University of Bozen-Bolzano Italy Dept. of Computer Science and Inf. Sys. Birkbeck University of London United Kingdom

OPTIONAL is a key feature in SPARQL for dealing with missing inf.rmation. While this operator is used extensively, it is also known for its complexity, which can make efficient evaluation of queries with OPTIONAL challenging. We tackle this problem in the Ontology-Based Data Access (OBDA) setting, where the data is stored in a SQL relational database and exposed as a virtual RDF graph by means of an R2RML mapping. We start with a succinct translation of a SPARQL fragment into SQL. It fully respects bag semantics and three-valued logic and relies on the extensive use of the LEFT JOIN operator and COALESCE function. We then propose optimisation techniques for reducing the size and improving the structure of generated SQL queries. Our optimisations capture interactions between JOIN, LEFT JOIN, COALESCE and integrity constraints such as attribute nullability, uniqueness and foreign key constraints. Finally, we empirically verify effectiveness of our techniques on the BSBM OBDA benchmark. Copyright © 2018, The Authors. All rights reserved.

关键词： Many valued logics

来源：评论

学校读者我要写书评

暂无评论

Optimization of a two-hop network with energy conferencing relays

arXiv

引用

arXiv 2018年

作者： Abdel-Razeq, Sharief Zhao, Ming Zhou, Shengli Wang, Zhengdao Dept. of Electrical and Computer Engineering University of Connecticut StorrsCT United States Dept. of Electronic Engineering and Inf. Sci. Univ. of Sci. and Tech. of China Hefei China Dept. of Electrical and Computer Engineering Iowa State University AmesIA United States

This paper considers a two-hop network consisting of a source, two parallel half-duplex relay nodes, and two destinations. While the destinations have an adequate power supply, the source and relay nodes rely on harvested energy for data transmission. Different from all existing works, the two relay nodes can also transfer their harvested energy to each other. For such a system, an optimization problem is formulated with the objective of maximizing the total data rate and conserving the source and relays transmission energy, where any extra energy saved in the current transmission cycle can be used in the next cycle. It turns out that the optimal solutions for this problem can be either found in a closed-form or through one-dimensional searches, depending on the scenario. Simulation results based on both the average data rate and the outage probability show that energy cooperation between the two relays consistently improves the system performance. Copyright © 2018, The Authors. All rights reserved.

关键词： Energy harvesting

来源：评论

学校读者我要写书评

暂无评论

Very hard electoral control problems

arXiv

引用

arXiv 2018年

作者： Fitzsimmons, Zack Hemaspaandra, Edith Hoover, Alexander Narváez, David E. Dept. of Math. and Comp. Science College of the Holy Cross WorcesterMA01610 United States Dept. of Computer Science Rochester Institute of Technology RochesterNY14623 United States Dept. of Computer Science University of Chicago ChicagoIL60637 United States College of Comp. and Inf. Sciences Rochester Institute of Technology RochesterNY14623 United States

It is important to understand how the outcome of an election can be modified by an agent with control over the structure of the election. Electoral control has been studied for many election systems, but for all studied systems the winner problem is in P, and so control is in NP. There are election systems, such as Kemeny, that have many desirable properties, but whose winner problems are not in NP. Thus for such systems control is not in NP, and in fact we show that it is typically complete for Σp2 (i.e., NPNP, the second level of the polynomial hierarchy). This is a very high level of complexity. Approaches that perform quite well for solving NP problems do not necessarily work for Σp2-complete problems. However, answer set programming is suited to express problems in Σp2, and we present an encoding for Kemeny control. Copyright © 2018, The Authors. All rights reserved.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Graph-Based Technique for Extracting Keyphrases in a Single-Document (GTEK)

Graph-Based Technique for Extracting Keyphrases in a Single-...

引用

International Conference on Promising Electronic Technologies (ICPET)

作者： Mahmoud R. Alfarra Abdalfattah Alfarra Computer Science and Information Technology Department University College of Science and Technology Khan Younis Palestine Comput. Sci. & Inf. Technol. Dept. Univ. Coll. of Sci. & Technol. Khan Younis Palestinian Authority

In this paper, a novel Graph-based Technique for Extracting Keyphrases in a single document (GTEK) is introduced to be used in extractive summarization of text. GTEK is based on the graph-based representation of text, which depends on terms and phrase numeration in sentences rather than some structural document features. GTEK considers the impact of the sentence on the phrases in a document, motivated by the fact that a phrase may be important if it appears in the most important sentences in the document. The Graph-based Growing Self-Organizing Map (G-GSOM) is used to group the sentences into graph-based clusters. TextRank algorithm is applied on graphs of clusters under the assumption that the top-ranked nodes should represent the most important sentences, where the most frequent phrases in these sentences are selected as document keyphrases. Experimental results show that our innovative technique extracts the most keyphrases of two datasets.

关键词： Clustering algorithms Feature extraction Data mining Task analysis Semantics Indexes computer science

来源：评论

学校读者我要写书评

暂无评论

Recent developments from attribute profiles for remote sensing image classification

arXiv

引用

arXiv 2018年

作者： Pham, Minh-Tan Lefèvre, Sébastien Aptoula, Erchan Bruzzone, Lorenzo IRISA - Université Bretagne Sud UMR 6074 VannesF-56000 France Institute of Information Technologies Gebze Technical University Kocaeli41400 Turkey Dept. of Inf. Eng. Computer Science University of Trento TrentoI-3812 Italy

Morphological attribute profiles (APs) are among the most effective methods to model the spatial and contextual inf.rmation for the analysis of remote sensing images, especially for classification task. Since their first introduction to this field in early 2010’s, many research studies have been contributed not only to exploit and adapt their use to different applications, but also to extend and improve their performance for better dealing with more complex data. In this paper, we revisit and discuss different developments and extensions from APs which have drawn significant attention from researchers in the past few years. These studies are analyzed and gathered based on the concept of multi-stage AP construction. In our experiments, a comparative study on classification results of two remote sensing data is provided in order to show their significant improvements compared to the originally proposed APs. Copyright © 2018, The Authors. All rights reserved.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：