It is a consequence of existing literature that least and greatest fixed-points of monotone polynomials on Heyting algebras—that is, the algebraic models of the Intuitionistic Propositional Calculus—always exist, even when these algebras are not complete as lattices. The reason is that these extremal fixed-points are definable by formulas of the IPC. Consequently, the μ-calculus based on intuit...

Empirical Colebrook equation implicit in unknown flow friction factor (λ) is an accepted standard for calculation of hydraulic resistance in hydraulically smooth and rough pipes. The Colebrook equation gives friction factor (λ) implicitly as a function of the Reynolds number (Re) and relative roughness (ε/D) of inner pipe surface; i.e. λ0=f(λ0, Re, ε/D). The paper presents a problem that requir...

z990 floatingpoint unit G. Gerwig H. Wetter E. M. Schwarz J. Haess C. A. Krygowski B. M. Fleischer M. Kroener The floating-point unit (FPU) of the IBM z990 eServer is the first one in an IBM mainframe with a fused multiply-add dataflow. It also represents the first time that an SRT divide algorithm (named after Sweeney, Robertson, and Tocher, who independently proposed the algorithm) was used i...

In this paper, we present an automated technique swati: Synthesizing Wordlengths Automatically Using Testing and Induction, which uses a combination of Nelder-Mead optimization based testing, and induction from examples to automatically synthesize optimal fixedpoint implementation of numerical routines. The design of numerical software is commonly done using floating-point arithmetic in design-...

Abstract: The problem of robust dynamic pricing of an abstract commodity, whose inventory is specified at an initial time but never subsequently replenished, originally studied by Perakis and Sood (2006) in discrete time, is considered from the perspective of continuous time. We use a multiplicative demand function to model the uncertain demand, and develop a robust counterpart to replace the u...

We present what we call Constructive Default Logic (CDL) a default logic in which the fixedpoint definition of extensions is replaced by a constructive definition which yield so-called constructive extensions. Selection functions are used to represent explicitly the control of the reasoning process in this default logic. It is well-known that Reiter's original default logic lacks, in general, a...

The goal of this paper is to study approaches to bridge the gap between first-order and second-order type methods for composite convex programs. Our key observations are: i) Many well-known operator splitting methods, such as forward-backward splitting (FBS) and Douglas-Rachford splitting (DRS), actually define a possibly semi-smooth and monotone fixed-point mapping; ii) The optimal solutions o...

Lynn Margulis in the 1960s elegantly proposed a shared phylogenetic history between bacteria and mitochondria; this relationship has since become a cornerstone of modern cellular biology. Yet, an interesting facet of the interaction between the microbiome and mitochondria has been mostly ignored, that of the systems biology relationship that underpins host health and longevity. The mitochondria...

For communication-intensive parallel applications, the max imum degree of concurrency achievable i s limited by the communication throughput made available by the network. In previous work [lo], we showed experimentally that the performance of certain parallel applications running o n a workstation network can be improved significantly if a congestion control protocol i s used t o enhance netwo...

SystemC is a new C-based system level design language whose ultimate objective is to enable System-on-a-Chip (SoC) design and verification. Fixed-point design based on the SystemC data types is rapidly becoming the standard for optimizing DSP systems. In this paper, we propose to create a formalization of SystemC fixed-point arithmetic in the HOL theorem proving environment. The SystemC fixedpo...