Hyperbolic regression analysis for kinetics, electrophoresis, ELISA, RIA, Bradford, Lowry, and other applications

Hyperbolic regression analysis is an effective method for fitting experimental data points obtained from a variety of experiments in molecular biology, including enzyme kinetics, agarose gel electrophoresis of DNA fragments, SDS-polyacrylamide gel electrophoresis of proteins, enzyme-linked immunosorbent assays (ELISA), radioimmunoassays (RIA), Bradford protein quantitation assays, Lowry protein assays, and other applications. Hyperbolic regression yields excellent fitted curves without the biases that are introduced by carrying out linear regression on double reciprocal coordinates, and it produces one simple equation, encompassing all the data points, that can be used easily in a pocket calculator to estimate the values of unknown samples from the known standards.     

Petri nets, algebras, morphisms, and compositionality

It is shown how a category of Petri nets can be viewed as a subcategory of two sorted algebras over multisets. This casts Petri nets in a familiar framework and provides a useful idea of morphism on nets different from the conventional definition—the morphisms here respect the behaviour of nets. The categorical constructions which result provide a useful way to synthesise nets and reason about nets in terms of their components; for example, various forms of parallel composition of Petri nets arise naturally from the product in the category. This abstract setting makes plain a useful functor from the category of Petri nets to a category of spaces of invariants and provides insight into the generalisations of the basic definition of Petri nets—for instance, the coloured and higher level nets of Kurt Jensen arise through a simple modification of the sorts of the algebras underlying nets. Further, it provides a smooth formal relation with other models of concurrency such as Milner's calculus of communicating systems (CCS) and Hoare's communicating sequential processes (CSP), though this is only indicated in this paper.     

Across disciplines: risk, design, method, process, and tools

In the search for solutions to make software development more predictable and controllable, one often looks for parallels in other disciplines such as architecture, bridge construction, and so on. The article looks at software development from the perspective of the electrical industry. Inspired by their management tradition, ATH techniek b.v. has learned to apply proven management techniques to software development. Simple and commonsense principles yield excellent results; for instance, developers reduced risk by estimating project effort using two different measures and by controlling execution. Comparing the software development processes with what goes on in the rest of the company or another application domain can be instructive     

Louis Kruh,Cryptologist, Editor,Activist

Abstract

The double transposition cipher was considered to be one of the most secure types of manual ciphers. It was extensively used in both World Wars and during the Cold War. In 1999, Otto Leiberich, the former head of the German federal office for information security, suggested that a double transposition challenge be published with specific parameters designed to ensure its security. Such a challenge was published by Klaus Schmeh in 2007. In November 2013, the authors solved the challenge using a ciphertext-only hill climbing attack. They also solved the challenge using a dictionary attack. In this article, they describe both methods, which are based on a “divide-and-conquer” approach. They additionally discuss the impact of their solutions with respect to the general security of the double transposition cipher.     

ALIENATION,EARLY SOCIALISM,PERESTROIKA, AND LIBERTY

The essential contradiction of the process of perestroika is that between alienation and liberty. Current Soviet society is a historically preliminary form of socialist society. The essence of early socialism is a rise in new quasi-socialist forms of alienation. Seven strata of alienation have appeared in the Soviet Union—alienation from participation in government, from the results of work, from the organization of work, from human needs, from self-consciousness, from personal safety, and from laws. The theoretical basis of liberty is that it is the antipole of alienation.     

Slope Intervals,Generalized Gradients,Semigradients, Slant Derivatives,and Csets

Many practical optimization problems are nonsmooth, and derivative-type methods cannot be applied. To overcome this difficulty, there are different concepts to replace the derivative of a function f : : interval slopes, semigradients, generalized gradients, and slant derivatives are some examples. These approaches generalize the success of convex analysis, and are effective in optimization. However, with the exception of interval slopes, it is not clear how to automatically compute these; having a general analogue to the chain rule, interval slopes can be computed with automatic differentiation techniques. In this paper we study the relationships among these approaches for nonsmooth Lipschitz optimization problems in finite dimensional Euclidean spaces. Inclusion theorems concerning the equivalence of these concepts when there exist one sided derivatives in one dimension and in multidimensional cases are proved separately. Valid enclosures are produced. Under containment set (cset) theory, for instance, the cset of the gradient of a locally Lipschitz function f near x is included in its generalized gradient.     

Phrenology, astrology, risk, and product quality

Engineering is the act of making intelligent tradeoffs and compromises among conflicting and sometimes mutually exclusive goals. To improve product performance, the die size might need to increase, which diminishes the chip's economic attractiveness. Assessing risk and product quality is not an exact science. Nevertheless, the computing industry's future rests as much on our success in achieving product quality as it does in continuing to innovate in circuits and microarchitectures     

Proofs, Programs, Processes

The objective of this paper is to provide a theoretical foundation for program extraction from inductive and coinductive proofs geared to practical applications. The novelties consist in the addition of inductive and coinductive definitions to a realizability interpretation for first-order proofs, a soundness proof for this system, and applications to the synthesis of non-trivial provably correct programs in the area of exact real number computation. We show that realizers, although per se untyped, can be assigned polymorphic recursive types and hence represent valid programs in a lazy functional programming language such as Haskell. Programs extracted from proofs using coinduction can be understood as perpetual processes producing infinite streams of data. Typical applications of such processes are computations in exact real arithmetic. As an example we show how to extract a program computing the average of two real numbers w.r.t. the binary signed digit representation.