28212389
Biomedical computing and visualization
21779382
Computational Engineering and Science Program at the University of Utah
We describe a new graduate program at the Univesity of Utah that we consider a first step towards the modernization of the University's curriculum in what we call "Computational Engineering and Science" (CES). Our goal is to provide a mechanism by which a graduate student can obtain integrated expertise and skills in all areas that are required for the solution of a particular computational problem.
8344660
Top Scientific Visualization Research Problems
Scientific visualization as currently understood and practiced is still a relatively new discipline. As a result, we visualization researches are not necessarily accustomed to undertaking the sorts of self-examinations that other scientists routinely undergo in relation to their work. Yet if we are to creat a disciplinary culture focused on matters of real scientific importance and committed to real progress, it is essential that we ask ourselves hard questions on an ongoing basis. What are the most important research issues facing us? What underlying assumptions needs to be challenged and perhaps abandoned? What practices need to be reviewed? In this article, I attempt to start a discussion of these issues by proposing a list of top research problems and issues in scientific visualization.
15670
Display of vector fields using a reaction-diffusion model
Effective visualization of vector fields relies on the ability to control the size and density of the underlying mapping to visual cues used to represent the field. In this paper we introduce the use of a reaction-diffusion model, already well known for its ability to form irregular spatio-temporal patters, to control the size, density, and placement of the vector field representation. We demonstrate that it is possible to encode vector field information (orientation and magnitude) into the parameters governing a reaction-diffusion model to form a spot pattern with the correct orientation, size, and density, creating an effective visualization. To encode direction we texture the spots using a light to dark fading texture. We also show that it is possible to use the reaction-diffusion model to visualize an additional scalar value, such as the uncertainty in the orientation of the vector field. An additional benefit of the reaction-diffusion visualization technique arises from its automatic density distribution. This benefit suggests using the technique to augment other vector visualization techniques. We demonstrate this utility by augmenting a LIC visualization with a reaction-diffusion visualization. Finally, the reaction-diffusion visualization method provides a technique that can be used for streamline and glyph placement.
15050037
Journeys in non-classical computation I: A grand challenge for computing research
1. The challengeA gateway event [35] is a change to a system that leads to the possibility of huge increases inkinds and levels of complexity. It opens up a whole new kind of phase space to the system’sdynamics.Gatewayeventsduringevolutionoflifeonearthincludetheappearanceofeukaryotes(organisms with a cell nucleus), an oxygen atmosphere, multi-cellular organisms and grass.Gatewayeventsduringthedevelopmentofmathematicsincludeeachinventionofanewclassofnumbers (negative, irrational, imaginary, ...), and dropping Euclid’s parallel postulate.A gateway event produces a profound and fundamental change to the system: Oncethrough the gateway, life is never the same again. We are currently poised on the threshold ofa signiﬁcant gateway event in computation: That of breaking free from many of our current“classical computational” assumptions. Our Grand Challenge for computer science isto journey through the gateway event obtained by breaking our current classicalcomputational assumptions, and thereby develop a mature science of Non-ClassicalComputation2. Journeys versus goals
7042682
Choosing people: the role of social capital in information seeking behaviour
It is an almost universal finding in studies investigating human information behaviour that people choose other people as their preferred source of information. An explanation for the use of people as information sources is that they are easier to approach than more formal sources and therefore are a least effort option. However there have been few studies that have investigated who the people chosen as information sources are and what their relationship to the information seeker is. This paper reports findings that come out of a larger investigation of the information seeking behaviour of a random sample of residents of Ulaanbaatar, Mongolia. Using the theory of social capital as a conceptual framework and the methods of social network analysis, this study investigated the relational factors associated with the choice of people as information sources. Results indicate that respondents chose people who had better resources than they had and were not well known by them. This suggests that respondents were deliberate in their choice of people information sources and therefore it is speculated that people are not necessarily the least effort option but may require considerable effort to seek out and consult.
17884377
Converse to the Parter-Wiener theorem: The case of non-trees
Through a succession of results, it is known that if the graph of an Hermitian matrix A is a tree and if for some index j, @l@?@s(A)@?@s(A(j)), then there is an index i such that the multiplicity of @l in @s(A(i)) is one more than that in A. We exhibit a converse to this result by showing that it is generally true only for trees. In particular, it is shown that the minimum rank of a positive semidefinite matrix with a given graph G is =
31563337
The trees for which maximum multiplicity implies the simplicity of other eigenvalues
Among those real symmetric matrices whose graph is a given tree T, the maximum multiplicity is known to be the path cover number of T. An explicit characterization is given for those trees for which whenever the maximum multiplicity is attained, all other multiplicities are 1.
8792186
Artificial Immune Systems and the Grand Challenge for Non-classical Computation
The UK Grand Challenges for Computing Research is an initiative to map out certain key areas that could be used to help drive research over the next 10–15 years. One of the identified Grand Challenges is Non-Classical Computation, which examines many of the fundamental assumptions of Computer Science, and asks what would result if they were systematically broken. In this discussion paper, we explain how the sub-discipline of Artificial Immune Systems sits squarely in the province of this particular Grand Challenge, and we identify certain key questions.