A state constraint is a new programming construct designed to restrict the domain of definition of a program. It can be used to decompose a program pathwise, i.e., to divide the program into subprograms along the control flow, as opposed to divide the program across the control flow when the program is decomposed into functions and procedures. As the result one can now construct and manipulate ...

The Rosenblueth point estimate method is one of the probabilistic analyses in estimating failure probability of a system, such as a slope. The essence of the approach is to use two point estimates, mean value7standard deviation, to present a variable in safety evaluation. The simple and straightforward framework leads to its wide application, but as a system governed by n variables (n is large)...

A new instruction adapts LZ77 compression for use inside running programs. The instruction economically references and reuses code fragments that are too small to package as conventional subroutines. The compressed code is interpreted directly, with neither prior nor on-the-fly decompression. Hardware implementations seem plausible and could benefit both memoryconstrained and more conventional ...

Due to the difficulty of constructing new quantum algorithms, frameworks that facilitate this construction are of great importance in quantum computing. These frameworks reduce the problem of coming up with a quantum algorithm to that of constructing some combinatorial object that is often much simpler to reason about. The implementation and analysis of an algorithm for the specified problem fo...

This article describes the subroutine library SLICOT that provides Fortran implementations of numerical algorithms for computa tions in systems and control theory Around a nucleus of basic numerical linear algebra subroutines this library builds methods for the design and analysis of linear control systems A brief history of the library is given together with a description of the current versio...

In this paper we will present a detailed study on tuning double-precision matrix-matrix multiplication (DGEMM) on the Intel Xeon E5-2680 CPU. We selected an optimal algorithm from the instruction set perspective as well software tools optimized for Intel Advance Vector Extensions (AVX). Our optimizations included the use of vector memory operations, and AVX instructions. Our proposed algorithm ...

We describe a mechanical device which can be used as an analog computer to solve the transportation problem. In practice this device is simulated by a numerical algorithm. Tests show that this algorithm is 60 times faster than a current subroutine (NAG library) for an average 1000 × 1000 problem. Its performance is even better for degenerate problems in which the weights take only a small numbe...

In this paper we present an easy estimation approach for solving non-standard GEEs based on global optimization methods. Our approach has the added advantage that it can be easily implemented using existing software, such as the subroutine nlminb in Splus, which also allows for the inclusion of constraints. To illustrate our approach, we fit a non-linear dose response model with constraints to ...