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

Dynamic verification of C++ generic algorithms

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1997年第5期23卷 314-323页

作者： Wang, CQ Musser, DR RENSSELAER POLYTECH INST DEPT COMP SCITROYNY 12180

Dynamic verification is a new approach to formal verification, applicable to generic algorithms such as those found in the Standard Template Library (STL, part of the Draft ANSI/ISO C++ Standard Library). Using behavioral abstraction and symbolic execution techniques, verifications are carried out at an abstract level such that the results can be used in a variety of instances of the generic algorithms without repeating the proofs. This is achieved by substituting for type parameters of generic algorithms special data types that model generic concepts by accepting symbolic inputs and deducing outputs using inference methods. By itself, this symbolic execution technique supports testing of programs with symbolic values at an abstract level. For formal verification we also need to generate multiple program execution paths and use assertions (to handle while loops, for example), but we show how this can be achieved via directives to a conventional debugger program and an analysis database. The assertions must still be supplied, but they can be packaged separately and evaluated as needed by appropriate transfers of control orchestrated via the debugger. Unlike all previous verification methods, the dynamic verification method thus works without having to transform source code or process it with special interpreters. We include an example of the formal verification of an STL generic algorithm.

关键词： specification verification generic algorithms software libraries C++ templates Standard Template Library

来源：评论

学校读者我要写书评

暂无评论

generic algorithms for polygonal mesh manipulation

Generic algorithms for polygonal mesh manipulation

引用

作者： Hmíra, Peter Charles University of Prague

This bachelor thesis analyses algorithms working with the volume data, especially the triangle or polygon mesh. The results of the analysis are applied in the design of the generic library which can be templated with any implementa- tion of mesh satisfying requirements of the library. The library is written in C++ using the norm C++11 with assistance of the boost library. The choice of the programming language is supported by the strong emphasis on the run-time per- formance as well as the capabilities of C++ to analyze a templated code during the compile-time. Later in thesis is described the implemenation of the library, usage of the algorithms and their concepts, the purpose of the adapters - tools that allow to run algorithms over such an implementation of the mesh that is not properly designed for the algorithm. The technique used in the development of this library can be later applied in the library developement, thus adding new algorithms to the library.

关键词： polygonal meshes boundary representation generic algorithms

来源：评论

学校读者我要写书评

暂无评论

generic algorithms FOR HALTING PROBLEM AND OPTIMAL MACHINES REVISITED

引用

LOGICAL METHODS IN COMPUTER SCIENCE 2016年第2期12卷

作者： Bienvenu, Laurent Desfontaines, Damien Shen, Alexander CNRS LIRMM 161 Rue Ada F-34095 Montpellier 5 France Univ Montpellier 161 Rue Ada F-34095 Montpellier 5 France Google Brandschenkestr 110 CH-8002 Zurich Switzerland Natl Res Univ Higher Sch Econ Moscow Russia

The halting problem is undecidable - but can it be solved for "most" inputs? This natural question was considered in a number of papers, in different settings. We revisit their results and show that most of them can be easily proven in a natural framework of optimal machines (considered in algorithmic information theory) using the notion of Kolmogorov complexity. We also consider some related questions about this framework and about asymptotic properties of the halting problem. In particular, we show that the fraction of terminating programs cannot have a limit, and all limit points are Martin-Lof random reals. We then consider mass problems of finding an approximate solution of halting problem and probabilistic algorithms for them, proving both positive and negative results. We consider the fraction of terminating programs that require a long time for termination, and describe this fraction using the busy beaver function. We also consider approximate versions of separation problems, and revisit Schnorr's results about optimal numberings showing how they can be generalized.

关键词： generic algorithms halting problem Kolmogorov complexity optimal enumerations

来源：评论

学校读者我要写书评

暂无评论

generic algorithms for solving ODE using the Tau method with an error estimation

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1999年第1期72卷 63-80页

作者： Adeniyi, RB Olugbara, OO Taiwo, OA Univ Ilorin Dept Math Comp Sci Ilorin Nigeria

The Tau method is an accurate and efficient method for the numerical solution of ordinary differential equation (O.D.E) with polynomial coefficients. In [1] Adeniyi et al., we derived a recursive formula for a fast reliable computational error estimate of Tau method. In the present work, we present the generic algorithms for solving O.D.E. using the Tau method. The pseudocodes describing the algorithms are in C-like language. The algorithms are assembled into a reusable Tau objects' Class Hierarchy (TOCH) with specification given in the interface definition language (IDL) representation and implemented using the C+ + Programming language.

关键词： polynomial coefficients generic algorithms Tau method Tau object class hierarchy interface definition language

来源：评论

学校读者我要写书评

暂无评论

Computational Science and Intelligence Programming in Business with Genetic, generic algorithms and AI Software Products: An Adaptive Algorithmic Approach 6

Computational Science and Intelligence Programming in Busine...

引用

6th Annual Conference on Computational Science and Computational Intelligence (CSCI)

作者： Lipitakis, Anastasia-Dimitra Lipitakis, Evangelia A. E. C. Harokopio Univ Dept Informat & Telemat Athens Greece Univ Kent Kent Business Sch Canterbury Kent England

ISBN: (纸本)9781728155845

In this research study the topic of Artificial Intelligence and Business is examined. AI methodologies and their usage in several organizations in various applications concerning staffing, careers etc. and hiring predictions are discussed. The concept of genetic and generic algorithms with their several important aspects are discussed and various related applications in a wide spectrum of topics are presented. Various genetic programming implementations with the corresponding related software products are given and several AI software packages, genetic algorithmic methodologies and related applications are presented.

关键词： Artificial intelligence businesses algorithmic methodologies AI applications evolution process generic algorithms genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Lower bounds on generic algorithms in groups

Lower bounds on generic algorithms in groups

引用

International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT 98)

作者： Maurer, U Wolf, S ETH Zurich Dept Comp Sci Swiss Fed Inst Technol CH-8092 Zurich Switzerland

ISBN: (纸本)3540645187

In this paper we consider generic algorithms for computational problems in cyclic groups. The model of a generic algorithm was proposed by Shoup at Eurocrypt '97. A generic algorithm is a general-purpose algorithm that does not make use of any particular property of the representation of the group elements. Shoup proved the hardness of the discrete logarithm problem and the Diffie-Hellman problem with respect to such algorithms for groups whose order contains a large prime factor. By extending Shoup's technique we prove lower bounds on the complexity of generic algorithms solving different problems in cyclic groups, and in particular of a generic reduction of the discrete logarithm problem to the Diffie-Hellman problem. It is shown that the two problems are not computationally equivalent in a generic sense for groups whose orders contain a multiple large prime factor. This complements earlier results which stated this equivalence for all other groups. Furthermore, it is shown that no generic algorithm exists that computes p-th roots efficiently in a group whose order is divisible by p(2) if p is a large prime.

关键词： Diffie-Hellman protocol discrete logarithms generic algorithms roots in finite groups complexity lower bounds

来源：评论

学校读者我要写书评

暂无评论

FPGA-based Implementation of Hardware Technology on generic algorithms

FPGA-based Implementation of Hardware Technology on Generic ...

引用

20th Chinese Control and Decision Conference

作者： Zhong Wei-sheng Wang Yu-Ti Zeng Xiao-Shu Nanchang Univ Mech & Elect Coll Nanchang 330029 Peoples R China Nanchang Univ Environm Sci & Engn Coll Nanchang 330029 Jiangxi Peoples R China

ISBN: (纸本)9781424417339

The research on generic algorithms is usually focused on software implement, which is always restricted in terms of high real-time by computer system because it is a serial calculation. This paper introduces a hardware structure on FPGA-Based generic algorithms, which programmed by VEDL language. All modules compilation and simulation were performed by Altera Quartus square 5.0 and were tested on EPIK100QC208-3. The experimental results show that the design achieves the required functions. At the end of this paper, a new idea of paralleled and pipelined hardware structure based on FPGA is presented.

关键词： generic algorithms FPGA VHDL Parallel Pipeline

来源：评论

学校读者我要写书评

暂无评论

Optimization of Mobile Phone Antennas using generic algorithms and Network Parallelization

Optimization of Mobile Phone Antennas using Generic Algorith...

引用

2010 IEEE International Symposium Antennas and Propagation/CNC-USNC/URSI Radio Science Meeting

作者： Chen, X. L. Ofli, E. Chavannes, N. Kuster, N. ITIS Fdn Zurich Switzerland Schmid & Partner Engn AG Zurich Switzerland

ISBN: (纸本)9781424449682

In this study, Genetic algorithms (GA) [1] in conjunction with network parallelization technique are utilized for the design and optimization of mobile phone antennas in a CAD derived environment. On the basis of a commercial mobile phone CAD model, three types of internally embedded multi-band antenna are designed and optimized within a fixed volume. Through the use of network parallelization, optimization time can be significantly reduced.

关键词： CAD electrical engineering computing generic algorithms genetic algorithms mobile antennas mobile phone CAD model mobile phone antennas mobile radio network parallelization technique

来源：评论

学校读者我要写书评

暂无评论

Optimization of Chosen Transport Task by Using generic algorithms 15th

Optimization of Chosen Transport Task by Using Generic Algor...

引用

15th IFIP TC 8 International Conference on Computer Information Systems and Industrial Management (CISIM)

作者： Burduk, Anna Musial, Kamil Wroclaw Univ Technol Dept Mech Wroclaw Poland

ISBN: (纸本)9783319453774;9783319453781

The paper presents genetic algorithms, their properties and capabilities in solving computational problems. Using a genetic algorithm an optimization task of transportation - production regard to the transport and processing of milk will be investigated. For the network of collection centers and processing plants (factories) the cost-optimal transportation plan regarding to raw materials to the relevant factories will be established. It is assumed that the functions defining the costs of processing are polynomials of the second degree. To solve the problem the program that uses genetic algorithms written in MATLAB will be used.

关键词： Optimization of production systems generic algorithms

来源：评论

学校读者我要写书评

暂无评论

generic algorithms for analysis of interdependent multidomain network systems

引用

INTERNATIONAL JOURNAL OF CRITICAL INFRASTRUCTURES 2010年第1期6卷 81-95页

作者： Feinauer, Lynn R. Ison, Molly E. Broadwater, Robert P. Elect Distribut Design Inc 217 Weyland Dr Grand Prairie TX 75052 USA Elect Distribut Design Inc Blacksburg VA 24060 USA

This paper presents a methodology for solving interdependent, multidomain networks with generic algorithms. The methodology enables modelling of very large systems. generic algorithms enable the system solver to be written such that it is independent of the system type. The solution of the system equations is implemented with Graph Trace Analysis (GTA), where traces through the directed graph of the system are implemented with iterators. The solution technique incorporates a binary search algorithm for the solution of looped systems. Example electrical and fluid systems are solved.

关键词： graph trace analysis GTA distributed processing generic algorithms critical infrastructures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：