Scholar iON
Academic Synthesis
The papers under review explore complex problems within computational and physical systems, highlighting the interplay between theoretical models and practical applications. Lei and Huang's work on protein folding employs statistical physics and introduces the CSAW model, which combines self-avoiding walk and Monte Carlo methods to simulate protein folding dynamics, revealing universal principles and scaling laws relevant to biological and physical processes. In contrast, Ferrand, Lesaint, and Tessier focus on constraint satisfaction problems (CSP) within the context of constraint logic programming, emphasizing the utility of domain reduction and chaotic iteration for debugging and failure analysis. Together, these studies underscore the significance of theoretical models in understanding complex systems, whether in biological or computational contexts, offering insights into universal principles and practical applications in diagnostics and error correction.
In this paper, we introduce an approach to the protein folding problem from the point of view of statistical physics. Protein folding is a stochastic process by which a polypeptide folds into its characteristic and functional 3D structure from random coil. The process involves an intricate interplay between global geometry and local structure, and each protein seems to present special problems. We introduce CSAW (conditioned self-avoiding walk), a model of protein folding that combines the features of self-avoiding walk (SAW) and the Monte Carlo method. In this model, the unfolded protein chain is treated as a random coil described by SAW. Folding is induced by hydrophobic forces and other interactions, such as hydrogen bonding, which can be taken into account by imposing conditions on SAW. Conceptually, the mathematical basis is a generalized Langevin equation. To illustrate the flexibility and capabilities of the model, we consider several examples, including helix formation, elastic properties, and the transition in the folding of myoglobin. From the CSAW simulation and physical arguments, we find a universal elastic energy for proteins, which depends only on the radius of gyration $R_{g}$ and the residue number $N$. The elastic energy gives rise to scaling laws $R_{g}\sim N^ν$ in different regions with exponents $ν=3/5,3/7,2/5$, consistent with the observed unfolded stage, pre-globule, and molten globule, respectively. These results indicate that CSAW can serve as a theoretical laboratory to study universal principles in protein folding.
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, constraint solving amounts to domain reduction. A computation is formalized by a chaotic iteration. The computed result is described as a closure. This model is well suited to the design of debugging notions and tools, for example failure explanations or error diagnosis. In this paper we detail an application of the model to an explanation of a value withdrawal in a domain. Some other works have already shown the interest of such a notion of explanation not only for failure analysis.