Showing papers on "Applied science published in 2004"

Analysis of Computer Networks Courses In Undergraduate Computer Science, Electrical Engineering and Information Science Programs

Abstract: This paper presents an analysis of computer networks courses offered by universities and colleges in the departments of computer science, electrical engineering, or information science. The results are based on the information collected from course web sites from twenty-seven universities and colleges in computer science, electrical engineering and information science departments, primarily within the United States. The data analyzed include the course titles, course structure, textbooks used, major topics and how they are covered, projects, and laboratory exercises, if any. We found that the courses can be divided into three categories: those that cover the general topics of computer networks using some practical examples, those that specifically discuss Internet protocols, and those that work through a set of programming projects after students have had a previous network course.

Materials Science and Technology: A curriculum that works

Abstract: Materials Science and Technology is a curriculum developed at Battelle Pacific Northwest National Laboratories, which emphasizes hands-on, minds-on studies of materials science and technology. This curriculum has been taught to over 1000 middle and high school teachers nationwide in a series of week-long institute programs, and is used in classrooms in 16 states. Evaluations have shown that the curriculum is highly effective in getting students interested in science and technology, and in encouraging them to study more science. This paper presents the basics of the curriculum and its approach, along with venues used for promoting the curriculum and the teaching methods used. Full evaluation results are discussed, including the assessment of increased student interest and increased student involvement their own learning. Means of adapting the program to a local situation are also presented.

Nursing Research in the Human Science and Natural Science Perspectives

Abstract: In this column Dobratz and Pilkington engage in a fascinating, informative discussion of nursing research conducted from two very different traditions, the human becoming and the natural sciences perspectives, using Parse’s theory and Roy’s model as the exemplars for each. Their discussion ranges from ontological assumptions about being human through transformative and instrumentalist knowledge development. Pilkington compares Dobratz’s study on the becoming-self in death and dying to her own study of the lived experience of grieving a loss, finding commonalities despite the differences in implications for knowledge and practice that can be derived from each. Dobratz speculates on a new way of knowing evolving within the Roy adaptation model given Roy’s redefinition of adaptation and her latest explication of philosophical assumptions. Together they offer new insights into future developments of both adaptation and human becoming theories.

Teaching Computational Materials Science for Nanoscale Science and Engineering

Abstract: We describe the development of a graduate level course designed to teach computational materials science and its application to nanoscale science and engineering. We discuss the use of MatDL, a web-based digital library and materials science resource, as a collaborative learning tool within the context of the course.

Graph-Theoretic Concepts in Computer Science

Abstract: In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain property. For example, the Cluster Deletion problem asks to delete as few edges as possible such that the resulting graph is a disjoint union of cliques. Graph modification problems appear in numerous applications, including the analysis of biological and social networks. Typically, graph modification problems are NP-hard, making them natural candidates for parameterized complexity studies. We discuss several fruitful interactions between the development of fixed-parameter algorithms and the design of heuristics for graph modification problems, featuring quite different aspects of mutual benefits.