We consider two classes of computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. We argue that the task of program learning should be more tractable for these architectures than for conventional deterministic programs. We look at the recent advances in the “sampling the samplers” paradigm in higher-order probabilistic programmin...

An LP-digraph is a directed graph which consists of the vertices and edges of a polytope P directed by a linear function in general position. It is known that an LP-digraph satisfies three necessary conditions: it is acyclic, each face of P has a unique sink (USO), and the Holt-Klee condition holds. These three conditions are not sufficient in general for a directed graph on P to be an LP-digra...

For deterministic and probabilistic programs we investigate the problem of program synthesis and program optimisation (with respect to non-functional properties) in the general setting of global optimisation. This approach is based on the representation of the semantics of programs and program fragments in terms of linear operators, i.e. as matrices. We exploit in particular the fact that we ca...

Consider a linear program where the cost coefficients are uncertain, for which we have a Bayesian prior. We can collect information to improve our understanding of these coefficients, but this may be expensive, giving us a separate problem of optimizing the collection of information to improve the quality of the solution relative to the true cost coefficients. We formulate this information coll...

Klystrons capable of 75 MW output power at 11.4 GHz have been under development at SLAC for the last decade. The work has been part of the program to realize all the components necessary for the construction of the Next Linear Collider (NLC). The effort has produced a family of solenoid-focused 50 MW klystrons, which are currently powering a 0.5 GeV test accelerator at SLAC and several test sta...

We present an adaptation, based on program extraction in elementary linear logic, of Krivine & Leivant’s system FA2. This system allows to write higher-order equations in order to specify the computational content of extracted programs. The user can then prove a generic formula, using these equations as axioms, whose proof can be extracted into programs that normalize in elementary time and sat...

Program synthesis, or their fragments, is a way to write programs by providing only its meaning, without worrying about the implementation details. It avoids the drawback of writing sequential code, which might be di cult to check, error-prone or tedious. Our contribution is to provide complete program synthesis algorithms with unbounded data types in decidable theories. We present synthesis al...

This work is about an algorithm for solving a linear program which is simple to apply. There are three algorithms in this work. The first algorithm solves a two-variable linear program. This algorithm is built on simple concepts such as the slope and the intercept of a line. The core idea of the algorithm is the Deleting Principle based on the consistency between slopes and intercepts along the...

a non-linear finite element model could be a useful tool in the development of a method of predicting soil pressure-sinkage behaviour, and can be used to investigate and analyze soil compaction. this study was undertaken to emphasize that the finite element method (fem) is a proper technique to model soil pressure-sinkage behaviour. for this purpose, the finite element method was used to model ...