Computational Engineering Commons^™

A Computational Analysis Of Cognitive Effort, Luca Longo, Stephen Barrett

Books/Book Chapters

Cognitive effort is a concept of unquestionable utility in understanding human behaviour. However, cognitive effort has been defined in several ways in literature and in everyday life, suffering from a partial understanding. It is common to say “Pay more attention in studying that subject” or “How much effort did you spend in resolving that task?”, but what does it really mean? This contribution tries to clarify the concept of cognitive effort, by introducing its main influencing factors and by presenting a formalism which provides us with a tool for precise discussion. The formalism is implementable as a computational concept and …

Studies Of Dynamic Crack Propagation And Crack Branching With Peridynamics, Youn Doh Ha, Florin Bobaru

Department of Engineering Mechanics: Faculty Publications

In this paper we discuss the peridynamic analysis of dynamic crack branching in brittle materials and show results of convergence studies under uniform grid refinement (m-convergence) and under decreasing the peridynamic horizon (δ-convergence). Comparisons with experimentally obtained values are made for the crack-tip propagation speed with three different peridynamic horizons.We also analyze the influence of the particular shape of themicro-modulus function and of different materials (Duran 50 glass and soda-lime glass) on the crack propagation behavior. We show that the peridynamic solution for this problem captures all the main features, observed experimentally, of dynamic crack propagation and branching, as well …

Modeling Biological Structures Via Abstract Grammars To Solve Common Problems In Computational Biology, David J. Russell

Department of Electrical and Computer Engineering: Dissertations, Theses, and Student Research

Grammars are generally understood to be the set of rules that define the relationships between elements of a language. However, grammars can also be used to elucidate structural relationships within sequences constructed from any finite alphabet. In this work abstract grammars are used to model the primary and secondary structures present in biological data. These grammar models are inferred and applied to efficiently solve various sequence analysis problems in computational biology, including multiple sequence alignment, fragment assembly, database redundancy removal, and structural prediction.

The primary structures, or sequential ordering of symbols, of biological data are first modeled with Lempel-Ziv (LZ) …