In this paper we consider the duality gap function g that measures the difference between the optimal values of the primal problem and of the dual problem in linear programming and in linear semi-infinite programming....
详细信息
In this paper we consider the duality gap function g that measures the difference between the optimal values of the primal problem and of the dual problem in linear programming and in linear semi-infinite programming. We analyze its behavior when the data defining these problems may be perturbed, considering seven different scenarios. In particular we find some stability results by proving that, under mild conditions, either the duality gap of the perturbed problems is zero or + a around the given data, or g has an infinite jump at it. We also give conditions guaranteeing that those data providing a finite duality gap are limits of sequences of data providing zero duality gap for sufficiently small perturbations, which is a generic result.
Global computing involves the interplay of a vast variety of languages, but practially useful foundations for language specification and prototyping at the semantic level are lacking. In this paper we present a system...
详细信息
Voltage-to-frequency converters convert an input analog voltage to square waves at frequencies that are accurately proportional to the analog quantity. They are built into long-term high-precision integrators, digital...
详细信息
Voltage-to-frequency converters convert an input analog voltage to square waves at frequencies that are accurately proportional to the analog quantity. They are built into long-term high-precision integrators, digital voltmeters and two-wire high-noise-immunity digital transmission. The presented voltage-to-frequency converter is designed and implemented as an integrated analog IP core using Anadigm/sup /spl reg// FPAAs. As the physical platform, the FPAA architecture is built on a natural precision, generic form, and the switching fabric of a CMOS-based switched-capacitor (SC) network.
We study how the concept of genericprogramming using C++ templates, realized in the Standard Template Library (STL), can be efficiently exploited in the specific domain of parallel programming. We present our approac...
详细信息
ISBN:
(纸本)3540221190
We study how the concept of genericprogramming using C++ templates, realized in the Standard Template Library (STL), can be efficiently exploited in the specific domain of parallel programming. We present our approach, implemented in the DatTeL data-parallel library, which allows simple programming for various parallel architectures while staying within the paradigm of classical C++ template programming. The novelty of the DatTeL is the use of higher-order parallel constructs, skeletons, in the STL-context and the easy extensibility of the library with new, domain-specific skeletons. We describe the principles of our approach based on skeletons, and explain our design decisions and their implementation in the library. The presentation is illustrated with a case study - the parallelization of a generic algorithm for carry-lookahead addition. We compare the DatTeL to related work and report both absolute performance and speedups achieved for the case study on parallel machines with shared and distributed memory.
Multi-stage programming (MSP) is a paradigm for developing generic software that does not pay a runtime penalty for this generality. This is achieved through concise, carefully-designed language extensions that suppor...
详细信息
ISBN:
(纸本)3540221190
Multi-stage programming (MSP) is a paradigm for developing generic software that does not pay a runtime penalty for this generality. This is achieved through concise, carefully-designed language extensions that support runtime code generation and program execution. Additionally, type systems for MSP languages are designed to statically ensure that dynamically generated programs are type-safe, and therefore require no type checking after they are generated. This hands-on tutorial is aimed at the reader interested in learning the basics of MSP practice. The tutorial uses a freely available MSP extension of OCaml called MetaOCaml, and presents a detailed analysis of the issues that arise in staging an interpreter for a small programming language. The tutorial concludes with pointers to various resources that can be used to probe further into related topics.
There are several methods measuring the complexity of object-oriented programs. Most of them are based on some special object-oriented feature: number of methods/classes, cohesion of classes, inheritance, etc. In prac...
详细信息
There are several methods measuring the complexity of object-oriented programs. Most of them are based on some special object-oriented feature: number of methods/classes, cohesion of classes, inheritance, etc. In practice, however, object-oriented programs are constructed with the help of the same control structures as traditional ones. Moreover, recent ideas of multiparadigm programming (i.e., emerging use of genericprogramming and aspect-oriented programming) has the effect that in modern programs-and even in class libraries-object-orient at ion is only one (however major) construction tool among others. An adequate measure therefore should not be based on special features of one paradigm, but on basic language elements and construction rules which could be applied to many different paradigms. In our model discussed here, the complexity of a program is the sum of three components: the complexity of its control structure, the complexity of data types used, and the complexity of the data handling (i.e., the complexity of the connection between the control structure and the data types). We suggest a new complexity measure. First, we show that this measure works well on procedural programs, and then we extend it to object-oriented programs. There is a software tool under development based on gnu g++ compiler which computes our new measure. We can apply this tool to C and C++ sources to gain a number of quantitative results with our measure. (C) 2003 Elsevier Ltd. All rights reserved.
The proceedings contain 20 papers. The special focus in this conference is on genericprogramming. The topics include: Fundamentals of genericprogramming;requirement oriented programming;the refinement relation of gr...
ISBN:
(纸本)9783540410904
The proceedings contain 20 papers. The special focus in this conference is on genericprogramming. The topics include: Fundamentals of genericprogramming;requirement oriented programming;the refinement relation of graph-based generic programs;the construction principles of the class library KARLA;exception-safety in generic components;segmented iterators and hierarchical algorithms;theory and generality of complete traversals;translating parameterised types into java;software development in PVS using generic development steps;model checking generic container implementations;mizar correctness proofs of generic fraction field arithmetic;language independent container specification;applications of the genericprogramming paradigm in the design of CGAL;the STL model in the geometric domain and a genericprogramming environment for high-performance mathematical libraries.
This paper introduces GeoWin, a generic visualization tool for geometric algorithms. GeoWin can be easily interfaced with todays standard geometry software libraries like LEDA and CGAL. By supporting the generic progr...
详细信息
ISBN:
(纸本)3540433236
This paper introduces GeoWin, a generic visualization tool for geometric algorithms. GeoWin can be easily interfaced with todays standard geometry software libraries like LEDA and CGAL. By supporting the genericprogramming approach, it can be adapted to user-defined geometric objects and data types.
genericprogramming is requirement oriented programming. We study the concept of genericity and generic concepts. Support of genericprogramming is exemplified by TECTON formalizations of algebraic and STL concepts. W...
详细信息
ISBN:
(纸本)3540410902
genericprogramming is requirement oriented programming. We study the concept of genericity and generic concepts. Support of genericprogramming is exemplified by TECTON formalizations of algebraic and STL concepts. We call for a common effort to establish and maintain generic libraries.
暂无评论