Archives

Combinatorial Properties of Reaction Systems September 4, 2008 1. Preliminaries a. Define an (r-i)-reaction. 2. Probability That a Reaction Is Enabled This section develops formulae for the probability that a random reaction is enabled for a random state. In particular, […]

is an Omidyar Fellow. Aaron’s research explores the physics of complex systems, focusing on methods for understanding the structure and function of networks, on the origins of morphological diversity in biology, and on patterns in terrorism and warfare. Outside of […]

Denver, and in Modern HealthCare magazine’s 100 Most Powerful People in Medicine. Their daughter Tenaya is on the chemistry faculty at Red Rocks Community College. Their son Aaron is a software engineer in the bioinformatics department of Memorial Sloan-Kettering Cancer […]

computational biology and health informatics; computational science and engineering; human- centered computing; networked devices and systems; software engineering; or systems. Computer science advisory board: Anshu Aggarwal (Zebek), Steve Bjorg (MindTouch, Inc.), Seven Bucuvalas (ioSemantics, LLC), Lori Clarke (University of Massachusetts, […]

systems. One work of ours impacting both academic research and technology advancement is the development of the LIRS algorithm (published in ACM SIGMETRICS’02). This algorithm fundamentally addresses the limits of the LRU replacement used in almost all memory-capable digital systems, […]

JAMES CARLSON (PhD) “Surface wrapping: a deformable mesh approach to semi-automatic 3d volume segmentation,” advised by Clayton Lewis. RANSOM CHRISTOFFERSON (BS) “Digital drum tutor,” advised by Ken Anderson. JASON COPE (PhD) “Data management for urgent computing nnvironments,” advised by Henry […]

research in the combinatorial properties of reaction systems, which are a mathematical model of biochemical systems that allows the study of how the state of a system changes over discrete time periods. MIKE EISENBERG received an NSF grant of $369,000 […]

loved teachers, even though he insists on deep thinking and hard work. His courses are, in my opinion, the most innovative in the department.” GERHARD FISCHER was elected a Fellow of the Association for Computing Machinery for his contributions to […]

Computer Science Cache News from the Computer Science Department at the University of Colorado at Boulder Here is a list of the items that we‘d like to have in the Spring 2010 newsletter. We‘ve decided to keep the name Computer […]

SAP Labs, LLC ($75,000) SRA Key Technology Laboratory ($5,000) Sun Microsystems ($3,000) VMWare ($3,000) Donations from individuals also allow the Computer Science Department to pursue education and research projects that would otherwise not be possible. We also gratefully acknowledge the […]

software work includes a 3D dynamic bicycle fitting system (retul.com), a 3D optical tracking system, and an object-oriented 3D geometry computation library. ∎ 1978 ∎ BRUCE SANDERS (MS)—we’re just checking to see whether you’re paying attention to these alum notices, […]

3D animation. The course covers the basics of 3D modeling (with polygon, subdivision, and smooth curve modeling), keyframe and path animation, materials and textures, hard and soft body collisions, cloth, particle dynamics, lighting and shading, and rendering. The students build […]

Mark Rentschler (Mechanical Engineering). In their work on Amorphous Computational Material (ACM), they ask you to “Imagine a material that is made from a large number of soft individual units that each sense, compute, actuate and communicate with one other. […]

evacuation prepare to leave quickly, and use smart phone applications to get information about evacuation routes and traffic conditions. But also, they post about their plans to leave; where they plan to go; as well as requests for help that […]

increasingly being developed by teams, rather than by individuals, a team-based development experience would more accurately reflect the real world and would better prepare our students for their careers. would allow for the development of significantly larger software projects, which […]

department, Jude was chair of the student-run CSUAC (Computer Science Undergraduate Advising Committee), and as he prepared to graduate he was busy coordinating a job fair and other CSUAC activities. He generously gave his time to at least a dozen […]

1 This is the first of several lectures which accompany the textbook Data Structures and Other Objects Using C++. Each lecture chooses one ❐An important topic: preconditions and postconditions. ❐They are a method of specifying what a function accomplishes. Data […]

14 But the third function call might return true, or it might return false, nobody really knows since the precondition has been violated. In fact, the situation is worse than that. Recall that I said to never violate a precondition. […]

1 This lecture is an introduction to trees, illustrating basic terminology for binary trees, and focusing on complete binary ❐Chapter 10 introduces trees. ❐This presentation illustrates the simplest kind of trees: Complete Binary Trees. Complete Binary Trees Data Structures and […]

19 Complete Binary Trees The second node of a complete binary tree is always the left child of the root… With a complete binary tree, the second node must be the left child of the root. 20 The next node […]

1 This lecture shows a common application of binary trees: Binary Search Trees used to implement a Dictionary data type. similar to a dictionary (for example, a bag or a set). ❐One of the tree applications in Chapter 10 is […]

21 Adding ❶Pretend that you are trying to find the key, but stop when there is no node to move to. Oklahoma Colorado Florida Iowa Which way will we move from the root if we are searching for Iowa? Arizona […]

32 Removing ‘Florida’ Oklahoma Colorado Florida ❷If necessary, do some rearranging. In general it is hard to recombine these two parts into a single tree. So, our goal is to find another item that is easier to remove, and copy […]

17 Removing the Top of a Heap ❶Move the last node onto the root. 23 45 42 We can also remove the top node from a heap. The first step of the removal is to move the last node of […]

1 This lecture introduces heaps, which are used in the Priority Queue project of Chapter 11. The lecture includes the algorithms for adding to ❐Chapter 11 has several programming projects, including a project that uses heaps. ❐This presentation shows you […]

17 Searching for a Key ❐The data that’s attached to a key can be found fairly quickly. Number 701466868 It is fairly easy to search for a particular item based on its key. [ 0 ] [ 1 ] [ […]

1 ❐Chapter 12 discusses several ways of storing information in an array, and later searching for the Hash Tables This lecture illustrates hash tables, using open addressing. Before this lecture, students should have seen other forms of a Dictionary, where […]

19 …and insert this element at the correct spot of the sorted side. [1] [2] [3] [4] [5] [6] 0 10 20 30 40 50 [1] [2] [3] [4] [5] [6] in the place that keeps the sorted side arranged […]

1 ❐Chapter 13 presents several common algorithms for sorting an array of integers. ❐Two slow but simple Quadratic Sorting The presentation illustrates two quadratic sorting algorithms: Selectionsort and Insertionsort. Before this lecture, students should know about arrays, and should have […]

21 Using the Thinking Cap ➋The instance name is followed The object name is followed by a period. by a period. int main( ) { ThinkingCap student; ThinkingCap fan; student.slots( “Hello”, “Goodbye”); A Period 22 Using the Thinking Cap ➌After […]

32 Thinking Cap Implementation ➊In the heading, the function’s name is preceded by the class name and :: – otherwise C++ won’t realize this is a class’s member function. void ThinkingCap::slots(char new_green[ ], char new_red[ ]) { assert(strlen(new_green) < 50); […]

1 This lecture is an introduction to classes, telling what classes are and Before this lecture, students should have a some understanding of 1. How an array of characters can be used as a string in C++ programming, and 2. […]

21 The Insert Function ❐Inserts a new number in the bag void Bag::insert(int new_entry) // Precondition: The Bag is not full. // Postcondition: A new copy of new_entry has // been added to the Bag. { . . . } […]

36 Implementation Details ❐We also need to keep track of how many numbers are in the bag. An array of integers 844 We don’t care what’s in this part of the array. An integer to keep track of the bag’s […]

1 This lecture introduces container classes from Chapter 3. Before this lecture, students should know about these items: ❐A container class is a data type that is capable of holding a collection of items. ❐In C++, container classes can be […]

35 Pseudocode for Inserting Nodes 15 10 7 null head_ptr ❷Otherwise (if the new node will not be first): ❐Start by setting a pointer named previous_ptr to point to the node which is just before the new node’s position This […]

1 This lecture shows three linked list operation in detail. The operations are: 2. Adding a new node in the middle of a linked list. 3. Removing a node from a linked list. The best time for this lecture is […]

21 void list_head_insert(Node*& head_ptr, const Node::Item& entry) { Node *insert_ptr; insert_ptr = new Node; insert_ptr->data = entry; insert_ptr->link = head_ptr; head_ptr = insert_ptr; } Inserting a Node at the Front head_ptr entry 13 null Does the function work correctly for […]

1 ❐Chapter 6 introduces templates, which are a C++ feature that easily permits the reuse of existing code for new purposes. Template Functions Templates are an important part of C++ that allows a programmer to reuse existing code for new […]

1 ❐ ❐Chapter 7 introduces the Chapter 7 introduces the stack stack data type. data type. ❐ ❐Several example Several example applications of stacks are applications of stacks are given in that chapter. given in that chapter. Using a Stack […]

17 How the program works How the program works …so we shift to …so we shift to column 2. But column 2. But In this example, there is a conflict with the placement of the new queen, so we move […]

1 This lecture demonstrates a typical pattern that arises in recursive functions. The lecture can be given shortly before or shortly after the students have read Section 9.1. ❐Chapter 9 introduces the technique of recursive programming. ❐As you have seen, […]

35 Pseudocode for ricochet ❶if moving_car.is_blocked( ), then the car is already at void ricochet(Car& moving_car); The recursive call …to the position where the recursive call was made. moving_car.move( ); ricochet(moving_car); . . . the barrier. In this case, just […]

21 The first action the function takes is to check for a very simple case: the case where the car is already blocked. Pseudocode for ricochet ❶if moving_car.is_blocked( ), then the car is already at the barrier. In this case, […]