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

54th IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)

作者： Ouerhani, Yousri Jridi, Maher Alfalou, A. Lab L BISEN CS 42807 Equipe Vis F-29228 Brest 2 France

ISBN: (纸本)9781612848570

In this paper, our objective is to detail know-how and techniques that can help the designer of electronic circuits to develop and to optimize their own IP in a reasonable time. For this reason, we propose to optimize existing FFT algorithms for low-cost FPGA implementations. For that, we have used short length structures to obtain higher length transforms. Indeed, we can obtain a VLSI structure by using log(4) (N) 4-point FFTs to construct N-point FFT rather than (N/8) logs (N) 8-point FFTs. Furthermore, two techniques are used to yield with VLSI architecture. Firstly, the radix-4 FFT is modified to process one sample per clock cycle. Secondly, the memory is shared and divided into 4 parts to reduce the consumed resources and to improve the overall latency. Comparisons with commercial IP cores show that the low area architecture presents the best compromise in terms of speed/area.

关键词： N-point FFT Registers VLSI structure fast Fourier transforms field programmable gate arrays high-order FFT higher length transforms implementation techniques low-cost FPGA radix-4 FFT short length structures

来源：评论

学校读者我要写书评

暂无评论

RELATING THE implementation techniques OF FUNCTIONAL AND FUNCTIONAL LOGIC LANGUAGES

引用

NEW GENERATION COMPUTING 1993年第2期11卷 179-215页

作者： LOOGEN, R 1. Lehrstuhl für Informatik II RWTH Aachen Ahornstra?e 55 W-5100 Aachen Germany

Functional logic languages are declarative programming languages that integrate the programming paradigms of functional and logic languages within a single framework. They are extensions of functional languages with principles derived from logic programming. Narrowing, the evaluation mechanism of functional logic languages, can be defined as a generalization of reduction, the evaluation mechanism of purely functional languages. The unidirectional pattern matching, which is used for parameter passing in functional languages, is simply replaced by the bidirectional unification known from logic programming languages. We show in this paper, how to extend a reduction machine, that has been designed for the evaluation of purely functional programs to a machine that performs narrowing. The necessary extensions concern the realization of unification and backtracking, for which we fall back upon the methods of Warren's Prolog engine.21) The narrowing machine embodies an optimized treatment of deterministic computations. A complete specification of the reduction and the narrowing machine and of the translation of a sample language into abstract machine code is given. Comparative results of a C-implementation of the reduction and the narrowing machine show that the time overhead of the more complex narrowing evaluation is, in general, less than 10% of the reduction evaluation.

关键词： DECLARATIVE PROGRAMMING LANGUAGES NARROWING AND REDUCTION implementation techniques ABSTRACT MACHINES FORMAL SPECIFICATION

来源：评论

学校读者我要写书评

暂无评论

Optimizing main-memory join on modern hardware

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2002年第4期14卷 709-730页

作者： Manegold, S Boncz, P Kersten, M CWI NL-1098 SJ Amsterdam Netherlands

In the past decade, the exponential growth in commodity CPU's speed has far outpaced advances in memory latency. A second trend is that CPU performance advances are not only brought by increased clock rate, but also by increasing parallelism inside the CPU. Current database systems have not yet adapted to these trends and show poor utilization of both CPU and memory resources on current hardware. In this paper, we show how these resources can be optimized for large joins and translate these insights into guidelines for future database architectures, encompassing data structures, algorithms, cost modeling, and implementation. In particular, we discuss how vertically fragmented data structures optimize cache performance on sequential data access. On the algorithmic side, we refine the partitioned hash-join with a new partitioning algorithm called radix-cluster, which is specifically designed to optimize memory access. The performance of this algorithm is quantified using a detailed analytical model that incorporates memory access costs in terms of a limited number of parameters, such as cache sizes and miss penalties. We also present a calibration. tool that extracts such parameters automatically from any computer hardware. The accuracy of our models is proven by exhaustive experiments conducted with the Monet database system on three different hardware platforms. Finally, we investigate the effect of implementation techniques that optimize CPU resource usage. Our experiments show that large joins can be accelerated almost an-order of magnitude on modern RISC hardware when both memory and CPU resources are optimized.

关键词： main-memory databases query processing memory access optimization decomposed storage model join algorithms implementation techniques

来源：评论

学校读者我要写书评

暂无评论

ON PARALLELIZING THE DEMPSTER-SHAFER METHOD USING TRANSPUTER NETWORK

引用

PARALLEL COMPUTING 1993年第7期19卷 807-822页

作者： WONG, YC HWANG, SY NATL CHIAO TUNG UNIV DEPT COMP SCI & INFORMAT ENGN HSINCHU 300 TAIWAN

Manipulating uncertain information is a necessary capability for any intelligent system. Several approaches, such as the Bayesian theory, Certainty Factors, and the Dempster-Shafer method, have been proposed to handle uncertainty. Among them the Dempster-Shafer method is the most theoretical sound and consistent with human behavior;however, it is argued on its computational complexity. This article presents a parallel reasoning algorithm based on the Dempster-Shafer method and implements it on the transputer network. We first analyze the best topologies of the transputer network with various numbers of processors;then the performance of the parallel program, such a speedup and efficiency, is measured on these best topologies.

关键词： UNCERTAIN REASONING DEMPSTER-SHAFER METHOD TRANSPUTER NETWORK PERFORMANCE ANALYSIS implementation techniques

来源：评论

学校读者我要写书评

暂无评论

Evaluation of declarative n-queens recursion: A deductive database approach

引用

INFORMATION SCIENCES 1998年第1-4期105卷 69-100页

作者： Han, JW Liu, L Lu, T Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada

Can we evaluate a logic program declaratively? That is, can a logic program be evaluated correctly and efficiently, independent of query modes and rule/predicate ordering, finding a complete set of answers, and terminating properly? the answer could be "yes", at least for a good subclass of logic programs, based on our investigation and experimentation using a deductive database approach. In this paper, an n-queens problem, a classical logic program, is used as a running example to demonstrate the methodology. Our analysis shows that binding analysis and constraint exploration are two essential issues in the realization of declarative logic programming. The limitations of our methodology are also discussed in the paper. (C) 1998 Elsevier Science Inc. All rights reserved.

关键词： declarative programming logic programming deductive database search constraint-based processing query evaluation implementation techniques

来源：评论

学校读者我要写书评

暂无评论

Concurrent object-oriented programming using term graph rewriting techniques

引用

INFORMATION AND SOFTWARE TECHNOLOGY 1996年第8期38卷 539-547页

作者： Papadopoulos, GA Department of Computer Science University of Cyprus 75 Kallipoleos Str. Nicosia P.O.B. 537 CY 1678 Cyprus

The generalized computational model of Term Graph Rewriting Systems is used as the basis for expressing concurrent object-oriented programming techniques exploiting the fine grain highly parallel features of TGRS in a language independent fashion that renders it able to act as the basis for developing specific languages based on object-orientation but also to study and compare existing approaches to the modelling of object-oriented programming techniques such as delegation, various forms of inheritance, etc.

关键词： concurrent object-oriented programming term graph rewriting systems (TGRS) implementation techniques Dactl

来源：评论

学校读者我要写书评

暂无评论

The state of art and future development of morphological software towards generic algorithms

引用

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE 2003年第2期17卷 231-255页

作者： D'Ornellas, MC Van Den Boomgaard, R Univ Fed Santa Maria Dept Comp Sci PIGS Grp BR-97105900 Santa Maria RS Brazil Univ Amsterdam NL-1098 SJ Amsterdam Netherlands

The goal of this paper is to establish the fundamental requirements of any morphological software in such a way as to produce reliable, precise, and generic algorithm representations in order to overcome the combinatorial explosion of the code needed to deal with all possible kinds of data structures and image types. Algorithms should be built with the guarantee that the desired implementation is written once, process data in an abstract way, and is efficient at the same time. Requirements are derived from a review of some of the most used software packages and image libraries with respect to mathematical morphology including Mmach, Mmorph, Micromorph and Visilog. Such a review makes it possible to characterize their advantages and drawbacks. These aspects call for software for mathematical morphology that has to be generic and should support a large variety of data types.

关键词： mathematical morphology software development implementation techniques morphological software packages generic programming

来源：评论

学校读者我要写书评

暂无评论

EVALUATION OF REGULAR NONLINEAR RECURSIONS BY DEDUCTIVE DATABASE techniques

引用

INFORMATION SYSTEMS 1995年第5期20卷 419-441页

作者： HAN, JW LAKSHMANAN, LVS CONCORDIA UNIV DEPT COMP SCI MONTREAL PQ H3G 1M8 CANADA

Nonlinear recursion is one of the most challenging classes of logic programs for efficient evaluation in logic programming systems. We identify one popular class of nonlinear recursion, regular nonlinear recursion, and investigate its efficient implementation by a deductive database approach. The approach performs a detailed query binding analysis based on query information, constraint information and the structure of a recursion, selects an appropriate predicate evaluation order and generates an efficient query evaluation plan. Interesting query evaluation techniques, such as chain-following, chain-split, and constraint pushing, are developed for the efficient evaluation of different kinds of queries. Furthermore, the technique can be extended to the evaluation of regular nonlinear recursions in HiLog and F-logic programs. The study not only presents a method for the evaluation of regular nonlinear recursions in a declarative way but also demonstrates the power of the deductive database approach in the analysis and evaluation of sophisticated logic programs.

关键词： DEDUCTIVE DATABASE LOGIC PROGRAMMING DECLARATIVE PROGRAMS implementation techniques RECURSIVE QUERY EVALUATION NONLINEAR RECURSION REGULAR NONLINEAR RECURSION

来源：评论

学校读者我要写书评

暂无评论

Reducing the space requirement of suffix trees

引用

SOFTWARE-PRACTICE & EXPERIENCE 1999年第13期29卷 1149-1171页

作者： Kurtz, S Univ Bielefeld Techn Fak D-33501 Bielefeld Germany

We show that suffix trees store various kinds of redundant information, We exploit these redundancies to obtain more space efficient representations. The most space efficient of our representations requires 20 bytes per input character in the worst case, and 10.1 bytes per input character on average for a collection of 42 files of different type. This is an advantage of more than 8 bytes per input character over previous work. Our representations can be constructed without extra space, and as fast as previous representations. The asymptotic running times of suffix tree applications are retained. Copyright (C) 1999 John Wiley & Sons, Ltd.

关键词： data structures suffix trees implementation techniques space reduction

来源：评论

学校读者我要写书评

暂无评论

Privacy as an Integral Part of the implementation of Cloud Solutions

引用

COMPUTER JOURNAL 2015年第10期58卷 2213-2224页

作者： Kavakli, Evangelia Kalloniatis, Christos Mouratidis, Haralambos Gritzalis, Stefanos Univ Aegean Dept Cultural Technol & Commun Cultural Informat Lab GR-81100 Mitilini Greece Univ Brighton Sch Comp Engn & Math Brighton E Sussex England Univ Aegean Dept Informat & Commun Syst Engn Informat & Commun Syst Secur Lab GR-83200 Samos Greece

Bridging the gap between design and implementation stages has been a major concern of designers, analysts and developers of information systems (ISs) and a major aspiration of a number of IS engineering approaches. Cloud computing exacerbates the strain on traditional IS engineering approaches that service-oriented computing has started. At the same time, recent research has argued about the importance of security and privacy in a cloud environment and highlighted a number of security and privacy challenges that are not present in traditional environments and need special attention when implementing or migrating ISs into a cloud environment. This paper contributes to this direction. Specifically, it presents a number of privacy-related cloud properties that analysts need to consider when designing privacy-aware systems in a cloud environment. Also it indicates a number of implementation techniques that can assist developers in assuring the respective properties.

关键词： cloud computing privacy properties implementation techniques software engineering PETs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：