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

High-level algorithms for the optimization of gate-level area in digit-serial multiple constant multiplications

INTEGRATION-THE VLSI JOURNAL 2012年第3期45卷 294-306页

作者： Aksoy, Levent Lazzari, Cristiano Costa, Eduardo Flores, Paulo Monteiro, Jose INESC ID Lisbon Portugal Univ Catolica Pelotas Pelotas Brazil Univ Tecn Lisboa INESC ID IST Lisbon Portugal

The last two decades have seen tremendous effort on the development of high-level synthesis algorithms for efficient realization of the multiplication of a variable by a set of constants using only addition, subtraction, and shift operations. These algorithms generally target the minimization of the number of adders and subtractors, assuming that shifts are realized using only wires due to the bit-parallel processing of the input data. On the other hand, digit-serial architectures offer alternative low-complexity designs since digit-serial operators occupy less area and are independent of the data wordlength. However, in this case, shifts are no longer free in terms of hardware and require D flip-flops. Moreover, each digit-serial addition, subtraction, and shift operation has different implementation cost at gate-level. Hence, this article introduces high-level algorithms that optimize the area of digit-serial constant multiplications under the shift-adds architecture by taking into account the implementation cost of each operation at gate-level. Experimental results indicate that our high-level algorithms obtain better solutions than prominent algorithms designed for the minimization of the number of operations in terms of gate-level area and their solutions lead to less complex digit-serial MCM designs. It is also shown that the use of shift-adds architecture yields significant area reductions when compared to the constant multiplications designed using generic digit-serial constant multipliers. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Multiple constant multiplications Digit-serial architectures Gate-level area optimization 0-1 Integer linear programming graph-based algorithms

来源：评论

学校读者我要写书评

暂无评论

ESA*: A generic framework for semi-supervised inductive learning

引用

NEUROCOMPUTING 2021年 447卷 102-117页

作者： Yang, Shuyi Ienco, Dino Esposito, Roberto Pensa, Ruggero G. Univ Turin Comp Sci Dept Cso Svizzera 185 I-10149 Turin Italy Intesa Sanpaolo Turin Italy INRAE UMR TETIS Montpellier France

Semi-supervised learning is crucial in many applications where accessing class labels is unaffordable or costly. The most promising approaches are graph-based but they are transductive and they do not provide a generalized model working on inductive scenarios. To address this problem, we propose a generic framework, ESA*, for inductive semi-supervised learning based on three components: an ensemble of semi-supervised autoencoders providing a new data representation that leverages the knowledge supplied by the reduced amount of available labels;a graph-based step that helps augmenting the training set with pseudo-labeled instances and, finally, a classifier trained with labeled and pseudo-labeled instances. Additionally, we also introduce two variants of our framework adopting different graph-based pseudo-labeling strategies: the first, ESA(LP), is based on a confidence-aware label propagation algorithm, while the second, ESA(GAT), on a graph convolutional attention network. The experimental results show that our framework outperforms state-of-the-art inductive semi-supervised methods. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Semi-supervised learning graph-based algorithms Inductive methods

来源：评论

学校读者我要写书评

暂无评论

algorithms for Multiplierless Multiple Constant Multiplication in Online Arithmetic

引用

CIRCUITS SYSTEMS AND SIGNAL PROCESSING 2018年第11期37卷 5127-5142页

作者： Joseph, Georgina Binoy Devanathan, R. Toc H Inst Sci & Technol Dept Elect & Commun Engn Kochi Kerala India Hindustan Inst Technol & Sci Sch Elect Engn Madras Tamil Nadu India

Online arithmetic operators offer advantages of reduction in resource utilization and interconnection complexity besides providing pipelining at digit level. Multiplierless constant coefficient multiplication using the shift-and-add technique is widely used in digital signal processing applications. This paper proposes a novel bit serial adaptation of the parallel shift-and-add algorithm to online arithmetic. The proposed multipliers use right shifts instead of the traditional left shifts resulting in causal online implementations. graph-based and hybrid algorithms are developed for the estimation of the distance of a constant from a set of constants in terms of the number of additions and for the synthesis of online multiple constant multipliers under area and online delay constraints. The computational complexity of the algorithms is determined. Results of implementation on randomly generated constant sets and FIR filter instances show substantial improvements in the number of operations required using the distance heuristic. Further, it is shown that the proposed techniques and algorithms result in significant savings in resource utilization, logic depth, and clock frequency compared to parallel and digit-serial algorithms.

关键词： Online arithmetic Digital signal processing Constant coefficient multiplication graph-based algorithms Field-programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

A dynamic clustering algorithm for building overlapping clusters

引用

INTELLIGENT DATA ANALYSIS 2012年第2期16卷 211-232页

作者： Perez-Suarez, Airel Fco Martinez-Trinidad, Jose Carrasco-Ochoa, Jesus A. Medina-Pagola, Jose E. Natl Inst Astrophys Dept Comp Sci Puebla 72840 Mexico Adv Technol Applicat Ctr Havana Cuba

Clustering is a Data Mining technique which has been widely used in many practical applications. In some of these applications like, medical diagnosis, categorization of digital libraries, topic detection and others, the objects could belong to more than one cluster. However, most of the clustering algorithms generate disjoint clusters. Moreover, processing additions, deletions and modifications of objects in the clustering built so far, without having to rebuild the clustering from the beginning is an issue that has been little studied. In this paper, we introduce DCS, a clustering algorithm which includes a new graph-cover strategy for building a set of clusters that could overlap, and a strategy for dynamically updating the clustering, managing multiple additions and/or deletions of objects. The experimental evaluation conducted over different collections demonstrates the good performance of the proposed algorithm.

关键词： Data mining overlapping clustering graph-based algorithms

来源：评论

学校读者我要写书评

暂无评论

On Constructing Minimal Formulae

引用

COMPUTER JOURNAL 2011年第7期54卷 1067-1075页

作者： Dunne, Paul E. Univ Liverpool Dept Comp Sci Liverpool Merseyside England

Given a Boolean propositional formula, phi(X-n) over the basis Omega = {boolean AND, boolean OR, ->}, we consider the following decision problem: is there a subset of literals, S, for which phi(X-n) equivalent to boolean AND(gamma is an element of S) y or phi(X-n) equivalent to boolean OR(gamma is an element of S) y? We prove that the 'obvious' Sigma(p)(2) upper bound is suboptimal and that the problem is decidable in P-parallel to(NP) the class of languages decidable by polynomial time methods allowed to make non-adaptive quer| i| es to an np oracle. We further show that the associated function problem of computing a witnessing such subset when one exists can be solved in FP parallel to NP.

关键词： Boolean formulae minimum equivalent expression problem non-adaptive np oracle computations graph-based algorithms

来源：评论

学校读者我要写书评

暂无评论

Label propagation based on local information with adaptive determination of number and degree of neighbor's similarity

引用

NEUROCOMPUTING 2015年 153卷 41-53页

作者： Saffari, Seyed Alireza Ebrahimi-Moghadam, Abbas Ferdowsi Univ Mashhad Dept Elect Engn Mashhad Iran

In many practical applications of machine vision, a small number of samples are labeled and therefore, classification accuracy is low. On the other hand, labeling by humans is a very time consuming process, which requires a degree of proficiency. Semi-supervised learning algorithms may be used as a proper solution in these situations, where epsilon-neighborhood or k nearest neighborhood graphs are employed to build a similarity graph. These graphs, on one hand, have a high degree of sensitivity to noise. On the other hand, optimal determination of epsilon and k parameters is a complex task. In some classification algorithms, sparse representation (SR) is employed in order to overcome these obstacles. Although SR has its own advantages, SR theory in its coding stage does not reflect local information and it requires a time consuming and heavy optimization process. Locality-constrained Linear Coding (LLC) addresses these problems and regards the local information in the coding process. In this paper we examine the effectiveness of using local information in form of label propagation algorithm and present three new label propagation modifications. Experimental results on three UCI datasets, two face databases and a biometric database show that our proposed algorithms have higher classification rates compared to other competitive algorithms. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Semi-supervised learning algorithms graph-based algorithms Sparse representation Local information

来源：评论

学校读者我要写书评

暂无评论

Multiplierless Design of Very Large Constant Multiplications in Cryptography

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2022年第11期69卷 4503-4507页

作者： Aksoy, Levent Roy, Debapriya Basu Imran, Malik Karl, Patrick Pagliarini, Samuel Tallinn Univ Technol Ctr Hardware Secur Dept Comp Syst EE-12618 Tallinn Estonia Tech Univ Munich Dept Elect & Comp Engn Chair Secur Informat Technol D-80333 Munich Germany

This brief addresses the problem of implementing very large constant multiplications by a single variable under the shift-adds architecture using a minimum number of adders/subtractors. Due to the intrinsic complexity of the problem, we introduce an approximate algorithm, called TOLL, which partitions the very large constants into smaller ones. To reduce the number of operations, TOLL incorporates graph-based and common subexpression elimination methods proposed for the shift-adds design of constant multiplications. It can also consider the delay of a multiplierless design defined in terms of the maximum number of operations in series, i.e., the number of adder-steps, while reducing the number of operations. High-level experimental results show that the adder-steps of a shift-adds design can be reduced significantly with a little overhead in the number of operations. Gate-level experimental results indicate that while the shift-adds design can lead to a 36.6% reduction in gate-level area with respect to a design using a multiplier, the delay-aware optimization can yield a 48.3% reduction in minimum achievable delay of the shift-adds design when compared to the area-aware optimization.

关键词： Very large constant multiplication shift-adds design graph-based algorithms common subexpression elimination delay-aware optimization cryptography

来源：评论

学校读者我要写书评

暂无评论

RANDOM WALK TERM WEIGHTING FOR IMPROVED TEXT CLASSIFICATION

引用

INTERNATIONAL JOURNAL OF SEMANTIC COMPUTING 2007年第4期1卷 421-439页

作者： Hassan, Samer Mihalcea, Rada Banea, Carmen Univ North Texas Dept Comp Sci & Engn POB 311366 Denton TX 76203 USA

This paper describes a new approach for estimating term weights in a document, and shows how the new weighting scheme can be used to improve the accuracy of a text classifier. The method uses term co-occurrence as a measure of dependency between word features. A random walk model is applied on a graph encoding words and co-occurrence dependencies, resulting in scores that represent a quantification of how a particular word feature contributes to a given context. Experiments performed on three standard classification datasets show that the new random walk based approach outperforms the traditional term frequency approach of feature weighting.

关键词： Random walk models graph-based algorithms TextRank term weighting text classification

来源：评论

学校读者我要写书评

暂无评论

COMPUTER-GENERATED MULTI-ROW SCHEMATICS

引用

COMPUTER-AIDED DESIGN 1985年第1期17卷 25-29页

作者： MAY, M Akademie der Wissenschaften der DDR Zentralinstitut für Kybernetik und Informationsprozesse 1086 Berlin Kurstrasse 33 GDR

This paper is concerned with the automatic generation of multi-row schematics. The characteristics of those schematics and the conditions to be met in the layout process are examined in detail. All stages of the generation cycle including data entry, partitioning, placement, and routing are considered. Brief descriptions of the main algorithms are given. A graph theoretic approach to the preplacement of the components is presented having some interesting applications to matrix theory. The physical placement aims at supporting the aesthetics of the drawing. A modified channel router is used to draw the interconnections between the symbols of the schematics. At present the algorithms are implemented to generate logic schematics.

关键词： design automation computer aided drafting and documentation multi-row schematics logic diagrams automatic layout placement channel routing graph-based algorithms

来源：评论

学校读者我要写书评

暂无评论

Search algorithms for the multiple constant multiplications problem: Exact and approximate

引用

MICROPROCESSORS AND MICROSYSTEMS 2010年第5期34卷 151-162页

作者： Aksoy, Levent Gunes, Ece Olcay Flores, Paulo Istanbul Tech Univ Dept Elect & Commun Engn TR-34469 Istanbul Turkey Univ Tecn Lisboa INESC ID IST P-1000029 Lisbon Portugal

This article addresses the multiplication of one data sample with multiple constants using addition/subtraction and shift operations, i.e., the multiple constant multiplications (MCM) operation. In the last two decades, many efficient algorithms have been proposed to implement the MCM operation using the fewest number of addition and subtraction operations. However, due to the NP-hardness of the problem, almost all the existing algorithms have been heuristics. The main contribution of this article is the proposal of an exact depth-first search algorithm that, using lower and upper bound values of the search space for the MCM problem instance, finds the minimum solution consuming less computational resources than the previously proposed exact breadth-first search algorithm. We start by describing the exact breadth-first search algorithm that can be applied on real mid-size instances. We also present our recently proposed approximate algorithm that finds solutions close to the minimum and is able to compute better bounds for the MCM problem. The experimental results clearly indicate that the exact depth-first search algorithm can be efficiently applied to large size hard instances that the exact breadth-first search algorithm cannot handle and the heuristics can only find suboptimal solutions. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Multiple constant multiplications problem Depth-first search Breadth-first search graph-based algorithms Finite Impulse Response filters

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：