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

2017 3rd Workshop on Advanced Research and Technology in Industry Applications(WARTIA 2017)

作者： Wei Wu School of Cryptography Information Engineering University

Step counting function can be implemented according to the acceleration data collected by appropriate algorithm. Based on the features analysis of intelligent mobile phone sensor, the paper describes the design principle of the algorithm of counting steps, and gives the implementation methods of data acquisition module, data processing module and data display module of the of the step counting algorithm to provide some references for the relevant researchers.

关键词： algorithm design and implementation Counting steps Mobile phone sensor

来源：评论

学校读者我要写书评

暂无评论

A software framework based on a conceptual unified model for evolutionary multiobjective optimization: ParadisEO-MOEO

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2011年第2期209卷 104-112页

作者： Liefooghe, Arnaud Jourdan, Laetitia Talbi, El-Ghazali Univ Lille 1 Lab Informat Fondamentale Lille UMR CNRS 8022 INRIA Lille Nord Europe F-59650 Villeneuve Dascq France Univ Coimbra CISUC Dept Informat Engn P-3000 Coimbra Portugal King Saud Univ Riyadh Saudi Arabia

This paper presents a general-purpose software framework dedicated to the design and the implementation of evolutionary multiobjective optimization techniques: ParadisEO-MOEO. A concise overview of evolutionary algorithms for multiobjective optimization is given. A substantial number of methods has been proposed so far, and an attempt of conceptually unifying existing approaches is presented here. Based on a fine-grained decomposition and following the main issues of fitness assignment, diversity preservation and elitism, a conceptual model is proposed and is validated by regarding a number of state-of-the-art algorithms as simple variants of the same structure. This model is then incorporated into the ParadisEO-MOEO software framework. This framework has proven its validity and high flexibility by enabling the resolution of many academic, real-world and hard multiobjective optimization problems. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Multiple objective programming Evolutionary algorithms Conceptual unified model algorithm design and implementation Software framework

来源：评论

学校读者我要写书评

暂无评论

Optimized Interpolation of Four-Term Karatsuba Multiplication and a Method of Avoiding Negative Multiplicands

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2022年第3期69卷 1199-1209页

作者： Gu, Zhen Li, Shuguo Tsinghua Univ Sch Integrated Circuits Beijing 100084 Peoples R China

In this paper, we presented a method of minimizing the number of overlapped partial products in the accumulation of four-term Karatsuba multiplication. This method reduced the summation of 13 overlapped partial products to 9 and the summation of 40 overlapped partial products to 24 in the case of four-term Karatsuba multiplication and eight-term Karatsuba multiplication, respectively. Moreover, to deal with the problem of negative multiplicands introduced by the choice in the evaluation of four-term Karatsuba multiplication, we further presented a method of converting negative multiplicands to non-negative multiplicands. In this way, our method would lead to the reduction of summation complexity and not using signed multipliers. Compared to the original Karatsuba multiplication designs, our proposed Karatsuba-like multiplication with optimal interpolation would lead to up to 7.7% reduction in ADP (area-delay-product) in ASIC implementations, and up to 20.2% reduction in ADP compared with built-in designs of Synopsys design Compiler.

关键词： Interpolation Arithmetic Cryptography Parallel processing Indexes Field programmable gate arrays Elliptic curve cryptography Four-term Karatsuba multiplication modular multiplication large integer arithmetic algorithm design and implementation public-key cryptography

来源：评论

学校读者我要写书评

暂无评论

A Division-Free Toom-Cook Multiplication-Based Montgomery Modular Multiplication

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2019年第8期66卷 1401-1405页

作者： Gu, Zhen Li, Shuguo Tsinghua Univ Inst Microelect Beijing 100084 Peoples R China

Toom-Cook multiplication is a theoretically more efficient multiplication algorithm than traditionally used Karatsuba and schoolbook multiplication but is rarely used in practical hardware designs due to its inherent exact divisions, which are time-consuming and difficult for parallel and serial acceleration. This brief proposes a method of division-free Toom-Cook multiplication based Montgomery modular multiplication, which makes it possible for Toom-Cook multiplication to be applied in practical and efficient hardware implementations. We also provide a hardware implementation of modular multipliers of 256 bits and 1024 bits with advantages on area-time-product over previous researches.

关键词： Toom-Cook multiplication Montgomery modular multiplication large integer arithmetic algorithm design and implementation public-key cryptography

来源：评论

学校读者我要写书评

暂无评论

ENGINEERING A SORT FUNCTION

引用

SOFTWARE-PRACTICE & EXPERIENCE 1993年第11期23卷 1249-1265页

作者： BENTLEY, JL MCILROY, MD AT & T Bell Laboratories 600 Mountain Avenue Murray Hill NJ 07974 U.S.A.

We recount the history of a new qsort function for a C library. Our function is clearer, faster and more robust than existing sorts. It chooses partitioning elements by a new sampling scheme;it partitions by a novel solution to Dijkstra's Dutch National Flag problem;and it swaps efficiently. Its behavior was assessed with timing and debugging testbeds, and with a program to certify performance. The design techniques apply in domains beyond sorting.

关键词： QUICKSORT SORTING algorithmS PERFORMANCE TUNING algorithm design and implementation TESTING

来源：评论

学校读者我要写书评

暂无评论

Symmetry partition sort

引用

SOFTWARE-PRACTICE & EXPERIENCE 2008年第7期38卷 761-773页

作者： Chen, Jing-Chao DongHua Univ Sch Informat Shanghai 200051 Peoples R China

In this paper, we propose a useful replacement for quicksort-style utility functions. The replacement is called Symmetry Partition Sort, the principle of which is similar to that of Proportion Extend Sort. The main characteristic of the new algorithm is that it always places partially sorted inputs (used as a basis for proportional extensions) at each end of an array when entering the partitioning routine. This is advantageous in speeding up the processing for partitioning. The library function we developed based on the new algorithm is more attractive than the Psort library function introduced in 2004 because of its simple implementation mechanism, clearer source code, and faster operation with a performance guarantee of O(n log n). Increased robustness and adaptivity also make it highly competitive as a library function. Copyright (C) 2007 John Wiley & Sons, Ltd.

关键词： Proportion Extend Sort high-performance sorting algorithm design and implementation library sort functions

来源：评论

学校读者我要写书评

暂无评论

Building a new sort function for a C library

引用

SOFTWARE-PRACTICE & EXPERIENCE 2004年第8期34卷 777-795页

作者： Chen, JC DongHua Univ Dept Commun Shanghai 200051 Peoples R China

Up to now, the most efficient sort function for a C library was a variant of Hoare's Quicksort (qsort, for short), which was proposed by Bentley and McIlroy in the early 1990s. Here we call this library function BM qsort. This paper introduces a library function which is based on Chen's Proportion Extend Sort (psort). This work is inspired by the fact that psort is generally faster than qsort, and in the worst case, qsort requires O(n(2)) comparisons, while psort requires O(n log n). In our library function, many tricks used in BM qsort have been adopted, such as sorting a small array by an insertion sort and the handling of equal elements. Some new tricks are also proposed, however, such as the adaptive partitioning scheme. To assess more effectively the behavior of our function, the test cases are enhanced. The empirical results show that our function is robust and faster than BM qsort. On particular classes of inputs, such as 'already sorted', it is linear time. Copyright (C) 2004 John Wiley Sons, Ltd.

关键词： Proportion Extend Sort sorting algorithms performance tuning algorithm design and implementation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：