We consider whether or not protein chains in the HP model have unique or few optimal foldings. We solve the conjecture proposed by Aichholzer et al. that the open chain L2k−1 = (HP )(PH) for k ≥ 3 has exactly two optimal foldings on the square lattice. We show that some closed and open chains have unique optimal foldings on the hexagonal and triangular lattices, respectively.

Outline:

This paper proposes Allocational Temporal Logic (ATL) as a formalism to express prop-erties concerning the dynamic allocation (birth) and de-allocation (death) of entities, suchas the objects in an object-based system. The logic is interpreted on History-DependentAutomata, extended with a symbolic representation for certain cases of unbounded alloca-tion. The paper also pres...

Understanding observations of interacting objects requires one to reason about qualitative scene dynamics For example on observ ing a hand lifting a can we may infer that an active hand is applying an upwards force by grasping to lift a passive can We present an im plemented computational theory that derives such dynamic descriptions directly from camera input Our approach is based on an analys...

Many applications require that we learn the pa­ rameters of a model from data. EM (E xpectation­ Maximization) is a method for learning the pa­ rameters of probabilistic models with missing or hidden data. There are instances in which this method is slow to converge. Therefore, sev­ eral accelerations have been proposed to improve the method. None of the proposed acceleration methods are theore...

The suspension loop construction is used to de ne a process in a symmetric monoidal category The algebra of such processes is that of symmetric monoidal bicategories Processes in categories with prod ucts and in categories with sums are studied in detail and in both cases the resulting bicategories of processes are equipped with opera tions called feedback Appropriate versions of traced monoida...

Signcryption is a new cryptographic primitive that simultaneously fulfills both the functions of signature and encryption. The definition of generalized signcryption is proposed in the paper firstly. Generalized signcryption has a special feature that provides confidentiality or authenticity separately under the condition of specific inputs. So it is more useful than common ones. Based on ECDSA...

and partly results of my Ph. D. student Richard Cleyton. It is a pleasure to thank the Erwin Schrrdinger Institute and the organisers of the program on Holonomy Groups in Diierential Geometry for their kind hospitality.