Browsing by Subject "Computer simulation."
Now showing 1 - 3 of 3
Results Per Page
Sort Options
Item Clustering in high dimension and choosing cluster representatives for SimPoint.(2007-12-03T18:49:58Z) Johnston, Joshua Benjamin.; Hamerly, Gregory James, 1977-; Computer Science.; Baylor University. Dept. of Computer Science.In computer architecture, researchers compare new processor designs by simulating them in software. Because simulation is slow, researchers simulate small parts of a workload to save time. The widely successful SimPoint approach identifies these key parts with k-means clustering. The extremely high-dimensional nature of these workloads causes difficulties for k-means, so SimPoint must reduce the dimension before clustering. We propose clustering workload data with the exponential Dirichlet compound multinomial (EDCM), a new relative of the multinomial probability distribution and the first model that has been used to cluster workload data without the need for dimension reduction. The EDCM mixture produces good models which have far fewer clusters than models generated by k-means, significantly reducing the amount of time spent in simulation. The EDCM mixture converges quickly and is a good model for "bursty" traits which appear in workloads. We discuss model selection and choosing cluster representatives for the EDCM mixture.Item A linked-plane obstacle-set algorithm for modeling broad muscle paths : application to the deltoid muscle.(2008-10-01T19:03:48Z) Xu, Bo, 1984-; Garner, Brian Alan, 1966-; Engineering.; Baylor University. Dept. of Mechanical Engineering.Computer modeling is commonly used to simulate muscle paths for the study of human biomechanics. Because some muscles, such as broad muscles, have complex morphology, modeling the paths of these muscles can be challenging. The aim of this study is to develop a new algorithm that quickly and realistically models the wrapping paths of broad muscles. The algorithm treats the muscle as a series of elastic bands wrapping around sphere-shaped obstacles. Each band is constrained to lie in its own plane and wrap around its own sphere. Each band plane forms a given angle with respect to the adjacent band plane, with the first band plane forming an optimized angle with respect to a fixed reference plane. The optimization seeks to minimize the sum total of all band lengths. The new algorithm accounts for tissue connectivity between muscle fibers in broad muscles, and can reproduce realistic muscle moment arm simulations.Item "Two-way" obliviousness in general aspect-oriented modeling.(2008-10-01T16:55:12Z) Roberts, Nathan V.; Song, Eunjee.; Computer Science.; Baylor University. Dept. of Computer Science.A key problem in software development is producing systems that are maintainable even as the concerns at play evolve. Aspect-oriented programming (AOP) seeks to foster maintainability by isolating the specifications of cross-cutting concerns, allowing them to be modified in relative isolation from the rest of the system. Research in aspect-oriented modeling (AOM) aims to develop a model-layer analogue of AOP, allowing integration with accepted modeling practices. Aspects usually allow developers of the primary model to be oblivious to the aspects that modify the primary model; because of this, aspects can be closely coupled to potentially transient details of the primary model. When those details change, the aspects that depend on them may no longer have the desired effect. In this thesis, we examine three approaches to AOM, and introduce a novel solution to the problem of obliviousness by extending a graph-transformational approach to AOM.