Abstract State Machines 1988-1998: Commented ASM Bibliography

An annotated bibliography of papers which deal with or use Abstract State Machines (ASMs), as of January 1998.Comment: Also maintained as a BibTeX file at http://www.eecs.umich.edu/gasm

Interior points of the completely positive cone.

A matrix A is called completely positive if it can be decomposed as A = BB^T with an entrywise nonnegative matrix B. The set of all such matrices is a convex cone. We provide a characterization of the interior of this cone as well as of its dual

Time out of mind: Subben's checklist revisited: A partial description of the development of quantitative OR papers over a period of 25 years

This short paper aims to investigate some of the historical developments of one classic, well-cited and highly esteemed scientific journal in the domain of quantitative operations research - namely the INFORMS journal Operations Research - over a period of 25 years between 1981 and 2006. As such this paper, and the journal in question, represents one representative attempt to analyze - for the purpose of possible future generalization - how research production has evolved, and evolves, over time. Among the general developments that we think we can trace are that (a) the historical overviews (i.e., literature surveys) in the articles, as well as the list of references, somewhat counter-intuitively shrink over time, while (b) the motivating and modelling parts grow. We also attempt to characterize - in some detail - the appearance and character, over time, of the most cited, as well as the least cited, papers over the years studied. In particular, we find that many of the least cited papers are quite imbalanced. For example, some of them include one main section only, and the least cited papers also have shorter reference lists. We also analyse the articles' utilization of important buzz words representing the constitutive parts of an OR journal paper, based on Subben's checklist (Larsson and Patriksson, 2014, 2016). Based on a word count of these buzz words we conclude through a citation study, utilizing a collection of particularly highly or little cited papers, that there is a quite strong positive correlation between a journal paper being highly cited and its degree of utilization of this checklist

Perspectives for proof unwinding by programming languages techniques

In this chapter, we propose some future directions of work, potentially beneficial to Mathematics and its foundations, based on the recent import of methodology from the theory of programming languages into proof theory. This scientific essay, written for the audience of proof theorists as well as the working mathematician, is not a survey of the field, but rather a personal view of the author who hopes that it may inspire future and fellow researchers