Nonextensive Statistical Mechanics Application to Vibrational Dynamics of Protein Folding

The vibrational dynamics of protein folding is analyzed in the framework of Tsallis thermostatistics. The generalized partition functions, internal energies, free energies and temperature factor (or Debye-Waller factor) are calculated. It has also been observed that the temperature factor is dependent on the non-extensive parameter q which behaves like a scale parameter in the harmonic oscillator model. As $q\to 1$, we also show that these approximations agree with the result of Gaussian network model.Comment: 8 pages, 2 figure

Remarks on (1−q)(1-q) expansion and factorization approximation in the Tsallis nonextensive statistical mechanics

The validity of (1-q) expansion and factorization approximations are analysed in the framework of Tsallis statistics. We employ exact expressions for classical independent systems (harmonic oscillators) by considering the unnormalized and normalized constrainsts. We show that these approxiamtions can not be accurate in the analysis of systems with many degrees of freedom.Comment: Latex, 6 pages, 2 figure

A Practical Extension Mechanism for Decision Procedures

There is a growing awareness that tool support is needed to develop high-assurance industry-size software/hardware systems. The aim of these workshops was to provide a forum of researchers interested in the use and development of tools which support the use of mathematical techniques for the specification, development, analysis and verification of systems. This workshop was the fourth in a series of biennial events devoted to this topic. Th

Preface

This volume contains the refereed and accepted papers and system descriptions presented at the 19th Workshop on (Constraint) Logic Programming W(C)LP 2005 held in Ulm, Germany, from February 21 to 23, 2005. This year marks the 40th anniversary of Alan Robinson’s seminal paper on ”A Machine-Oriented Logic Based on the Resolution Principle ” that forms a basis for automated deduction and in particular logic programming, that started some three decades ago with the work of Robert Kowalski and Alain Colmerauer. The workshop on (constraint) logic programming is the annual meeting of the Society of Logic Programming (GLP e.V.) and brings together researchers interested in logic programming, constraint programming, and related areas like databases and artificial intelligence. Previous workshops have been held in Germany, Austria, and Switzerland. The technical program of the workshop included an invited talk, presentations of refereed and accepted papers and system descriptions, as well as non-refereed system demonstrations and poster presentations. The contributions in this volume were reviewed by at least two referees

CHR Grammars with multiple constraint stores

The Constraint Handling Rules (CHR) language has become a major specification and implementation language for constraint-based algorithms and applications. Algorithms are often specified using inference rules, rewrite rules, sequents, proof rules, or logical axioms that can be directly written in CHR. Based on first order predicate logic, this clean semantics of CHR facilitates non-trivial program analysis and transformation. Several implementations of CHR exist in Prolog, Haskell, and Java. A particular emphasis of this first workshop was the comparison, joint development, consolidation and common extension of the various CHR implementations

An Agile Development Methodology for Knowledge-Based Systems Including a Java Framework for Knowledge Modeling and Appropriate Tool Support

The goal of this thesis is to help make the development of knowledge-based systems more efficient. For that purpose, it proposes a new, agile software and knowledge engineering methodology, called XP.K (eXtreme Programming of Knowledge-based systems). This methodology is based on the four values simplicity, community, feedback, andcourage, and applies object-oriented Round-Trip Engineering to knowledge modeling. The thesis is founded on the observation that for most knowledge-based systems, knowledge must necessarily be modeled evolutionary, in a close collaboration between domain experts and engineers. The author argues that existing “heavy-weight ” development methodologies from object-oriented Software Engineering and Knowledge Engineering are often inefficient, because they make changes in knowledge models too expensive. Furthermore, they provide little support for the transitions between knowledge, knowledge models, and the remaining executable system. The starting point of XP.K is the hypothesis that “lightweight” – or agile – development processes (such as Extreme Programming) are suitable for knowledge modeling, because they are optimized for projects with frequently changin

conga: A Conducting Gesture Analysis Framework

Conducting an orchestra is a highly sophisticated art form that matured over centuries. In the last few decades, conducting has also become a form of human-computer interaction, giving conductors different ways to enter conducting input with varying degrees of control and varying levels of success in making the computer perform the way the conductor wants it to. This diploma thesis describes a framework developed to aid analysis and recognition of conducting gesture input in form of two-dimensional trajectories of the movement of the conductor’s baton, or of his right hand, if he is conducting without a baton. The thesis explains the concepts behind the framework, lists some of its characteristic components and gives examples how to use it. In addition, the thesis provides an overview of several computer-based systems that enable their users to conduct musical pieces and briefly looks into other frameworks that have been used to process conducting gesture input in some of the presented systems. It also judges strengths and weaknesses of the framework and mentions how the framework could be extended both for its intended application domain as well as for other application domains. i Acknowledgements I would like to express my gratitude to all people who helped me with my work on this paper and the conga framework. In particular, I thank the following persons