13 Pages

todd

Course: CE 260, Fall 2009
School: Hudson VCC
Rating:
 
 
 
 
 

Word Count: 452

Document Preview

Unifying Ecohydrology: Techniques for the study of Aquatic Systems Todd Clason CE 260 - Hydrology 4-29-04 Goals: Define the idea of Ecohydrology Discuss its Application via Case Studies Ecohydrology is as yet Poorly Defined in the literature. Provisional Definition: Ecohydrology: the effective combination of principals and methodologies from the fields of ecology and hydrology towards the understanding of...

Register Now

Unformatted Document Excerpt

Coursehero >> New York >> Hudson VCC >> CE 260

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Unifying Ecohydrology: Techniques for the study of Aquatic Systems Todd Clason CE 260 - Hydrology 4-29-04 Goals: Define the idea of Ecohydrology Discuss its Application via Case Studies Ecohydrology is as yet Poorly Defined in the literature. Provisional Definition: Ecohydrology: the effective combination of principals and methodologies from the fields of ecology and hydrology towards the understanding of aquatic systems. By definition, then, the field should be interdisciplinary. What do searches for ecology and hydrology turn up? Case Study #1 Biggs, B.J.F, Tuchman, N., Lowe, R. and R. Stevenson, 1999. Resource Stress Alters Hydrological Disturbance Effects in a Stream Periphyton Community. Oikos 85(1): 95-108. DIATOMS! Periphyton: Microalgae growing on plants. Epilithon: Microalgae growing on rocks. Epipelon: Microalgae on the sediment surface. Authors tested periphyton resistance and resilience under variable light and nutrient regimes. Used an artificial stream system with natural river water, artificial substrates, and stream "troughs," -- rain gutters. Interesting results -- but no quantitative measure of disturbance. They need a hydrologist! Case Study #2 Tillman, D.C., A. Moerke, Ziehl, C., and G. Lamberti, 2003. Subsurface Hydrology and Degree of Burial Affect Mass Loss and Invertebrate Colonisation of Leaves in a Woodland Stream. Freshwater Biology 48(1): 98-107. Authors tested leaf pack breakdown in upwelling and downwelling zones in a stream system. Ecological implications of POC (particulate organic carbon) processing, with respect to local VHG (vertical hydraulic gradient). VHG Measured with minipiezometers. Results show increased DOC processing in downwelling zones and taxa-specific hydrologic responses. A good illustration of effective combination of hydrologic techniques to answer ecological questions. Case Study #3 Thomas, S.A., Newbold, J., Monaghan, M., Minshall, G., Georgian, T. and C. Cushing, 2001. The Influence of Particle Size on Seston Deposition in Streams. Limnology and Oceanography 46(6): 1415-1424. Authors interested in the relationship between dep -field deposition velocity, and fall -- quiescent water fall velocity and its implication for particle transport. Measured h, water depth; u, water velocity; A, cross-sectional area; Q, discharge; Qw, unit width discharge; S, channel slope; U*, shear velocity; , shear stress; , transient storage coefficient of exchange; As, cross-sectional area of the transient storage zone; w, mass transfer coefficient of water; and Sw uptake length of the water -- And used a di...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Hudson VCC - CE - 260
Effect of Plant Species on Wetland Evapotranspiration CalculationsPresentation by Tom DiPietroPresentation Outline Purpose Process Review Evaporation Transpiration Evapotranspiration (ET) models Comparison of Plant Species Conclusions1
Hudson VCC - CE - 260
Effect of Plant Species on Wetland Evapotranspiration CalculationsPresentation by Tom DiPietroPresentation Outline Purpose Process Review Evaporation Transpiration Evapotranspiration (ET) models Comparison of Plant Species ConclusionsObj
Berkeley - OCF - 228
Massacre in Taiwan RememberedThis space is dedicated in the memory of the tens of thousands of Taiwanese massacred by Chiang Kai-shek's Nationalist Chinese government on February 28, 1947, and during the following decades of White Terror. Martial La
UMass Lowell - CS - 404
2 About InductionInduction is one of the main tools we use for reasoning about discrete objects, such as programs and data structures. Most of you already have some experience with induction. Your experience falls into two categories: For instance,
UMass Lowell - CS - 404
cs260: Concrete Mathematics Andrei BroderStanford UniversityHandout #4 Friday, April 5, 1996Introduction to RecurrencesLecture #1: Scribe: April 4, 1996 Michael Goldwasser1 AdministrationClass started today with a quick review of the course
UMass Lowell - CS - 404
UMass Lowell - CS - 404
Strassen's Matrix-Multiplication AlgorithmApril 23, 19961Strassen's Matrix-Multiplication Algorithm Theory of Algorithms April 23, 1996The source for the following material is Aho, Hopcroft, and Ullman, section 6.2. Strassen showed that 2 2 ma
UMass Lowell - CS - 404
f(n) = O(g(n) f(n) = (g(n) f(n) = (g(n) f(n) = o(g(n) lim a = a n!1 n sup S inf S lim sup ann!1 ;n klim inf an n!1De nitions i 9 positive c n0 such that 0 f(n) cg(n) 8n n0. i 9 positive c n0 such that f(n) cg(n) 0 8n n0. i f(n) = O(g(n) and f(n)
UMass Lowell - CS - 404
Comparing running times [From CLR] Suppose we have implementations of insertion sort and merge sort that run in time A1(n) = 8 n 2 and A2(n) = 64 n lg n respectively on an input of size n Which algorithm is better? 8n2 64nlgn n 4 128 512 8 512 1536
UMass Lowell - CS - 404
Recursion Tree forT(n) = 3 T (n / 4 ) + c n 2 Recursion Tree for T(n) = 3 T (n / 4 ) + c n 2Recursion-Tree MethodMaster Theorem :Let Then : 1. If f(n) = O ( n [log b a ]- ) for some > o then T ( n ) = ( n log b a ) 2. If f (n) = (n log b a
UMass Lowell - CS - 404
Recurrence RelationsIntroduction Defn: A recurrence relation for the sequence a0,a1,a2,. is an equation that relates an to certain of its predecessors. Initial conditions for the sequence are explicitly given values for a finite number of the terms
UMass Lowell - CS - 404
Merge_Sort ( A,p,r) if p = r , return Merge_Sort ( A , p , (p + r ) / 2 ) Merge_Sort ( A , (p + r ) / 2 + 1 , r ) Merge results and return All cases is O ( n log n ) Quicksort ( A, p, r) If p < r Then q Partition ( A, p, r) Quicksort ( A, p, q ) Quic
UMass Lowell - CS - 404
Chapter 8Sorting in Linear TimeChapter 8Sorting in Linear TimeSeveral algorithms that sort n numbers in O ( n log n ) time: Mergesort and Heapsort achieve this upper bound in the worst case Quicksort achieves it on average For each of these
UMass Lowell - CS - 404
Topological sortA topological sort of a dag G = (V, E) is a linear ordering of all its vertices such that if G contains an edge (u, v), then u appears before v in the ordering. (If the graph is not acyclic, then no linear ordering is possible.) A to
UMass Lowell - CS - 404
GRAPH TRAVERSALS Depth-First Search91.404 :Depth First Search Breadth-First SearchExploring a Labyrinth Without Getting Lost A depth-first search (DFS) in an undirected graph G is like wandering in a labyrinth with a string and a can of red
UMass Lowell - CS - 404
GREEDY ALGORITHMS Making Change : In USA currency, minimize the # bills and coins in making change Soln: Use the maximum # of the largest denomination possible at each step of the processSort by increasing finish time before beginningFixed Length
UMass Lowell - CS - 404
Chapter 11 - HashingA dynamic set , in a computational environment, is a set that is manipulated by a variety of algorithms - not necessarily an array - can grow, shrink, change values,. over time Operations on this set include : Insert, Delete, Tes
UMass Lowell - CS - 404
Linear Programminguse graphs and trees as useful modeling abstractions to help us develop computational solutions for a wide variety of problems A linear program is simply another modeling abstraction (tool in your toolbox) Developing routines tha
UMass Lowell - CS - 404
Minimum Spanning Trees (Forests)Given an undirected graph G=(V,E) with each edge e having a weight w(e) : Find a subgraph T of G of minimum total weight s.t. every pair of vertices connected in G are also connected in T if G is connected then T is
UMass Lowell - CS - 404
Merge Sort Algorithm1. Merge_Sort ( A,p,r) 2. if p = r return 3. Merge_Sort ( A , p , (p + r ) / 2 ) 4. Merge_Sort ( A , (p + r ) / 2 + 1 , r ) 5. Merge results and returnLemma : Merging 2 lists with m and n elements respectively, requires m + n 1
UMass Lowell - CS - 404
Graph Algorithms: Shortest PathWe are given a weighted, directed graph G = (V, E), with weight function w: E R mapping edges to real valued weights.Graph Algorithms: Shortest PathDijkstra's algorithm solves this problem efficiently for the case i
UMass Lowell - CS - 404
UMass Lowell Computer Science 91.404Nature of the CourseAnalysis of AlgorithmsProf. Tom CostelloSpring, 2005Core course: required for all CS majors Advanced undergraduate levelGraduate students take separate course (91.503)Lecture 1 Introd
UMass Lowell - CS - 404
SortingAlgorithm:well-defined computational procedure that transforms input into output steps for the computer to follow to solve a problemText Chapters 1, 2instanceSorting Problem:Input: A sequence of n numbers < a1 , a2 , L , an > Output:
UMass Lowell - CS - 404
Chapter 9 - Order StatisticsDefinition : The order statistic of a set of elements is the smallest element in the set. so, the minimum of the set is the 1st order statistic and the maximum value in a set of n elements is the nth order statistic. the
UMass Lowell - CS - 404
Red-black tree properties Every node in a red-black tree is either black or red Every null leaf is black No path from a leaf to a root can have two consecutive red nodes - i.e. the children of a red node must be black Every path from a node, x, t
UMass Lowell - CS - 404
Analysis of Algorithms, 91.404 Homework Set #1 Due: Friday February 11,20051. Using Figure 2.2 as a model, illustrate the operation of INSERTION-SORT on the array A = < 40, 15, 30, 5, 25, 10, 20, 35 >. 2. Using Figure 2.4 as a model, illustrate the
UMass Lowell - CS - 404
Analysis of Algorithms, 91.404 Homework Set #2 Due: Tuesday February 22,2005* Work to be typed rather than handwritten and you should include your name on each sheet!1. Solve the following recurrences using the Master Theorem: In each case show yo
UMass Lowell - CS - 404
UMass Lowell - CS - 404
Analysis of Algorithms, 91.404 Homework Set #3 Due: Friday, March 4, 20051. Let A = { 503, 087, 512, 061, 908, 897, 426,154, 509, 612, 677, 765 } be a given input sequence. i) Sort the array using Merge Sort - show each step of the process. ii) Sort
UMass Lowell - CS - 404
UMass Lowell - CS - 404
91.404 Analysis of Algorithms Problem Set 4 Due : Friday April 1, 20051. pg. 229, #11.2-2 2. pg. 236, 11.3-4 3. pg. 244, 11.4-1 4. Consider the hash function Hash(X) = X mod 11 and the ordered input sequence of keys 32, 23, 86, 54, 99, 20. Draw the
UMass Lowell - CS - 404
91.404 Analysis of Algorithms Problem Set 5 Due: Friday April 15, 20051. pg. 264, # 12.3-2 (Omit ) 1. ( replacement ) Create a red-black tree by inserting 41 and then 38 into an initially empty tree. If you now insert another key into the tree and
UMass Lowell - CS - 404
91.404 Analysis of Algorithms Problem Set 6 Due: Monday May 2, 20051. (10 points) Chapter 23: Depth-First Search: For this undirected graph: a) (2 points) Draw an adjacency matrix representation in which rows and columns are labeled in alphabetic or
UMass Lowell - CS - 404
UML CSAnalysis of Algorithms 91.404 Homework Set 7Spring, 2005Assigned: Friday May 6, 2005 Due: NOT to be Handed in This assignment covers textbook material in Chapters 24 & 29.D A E G C B F : a) Transform it into a weighted graph by assigning
Sveriges lantbruksuniversitet - MATH - 818
ALGEBRAIC CURVESAn Introduction to Algebraic GeometryWILLIAM FULTON January 28, 2008PrefaceThird Preface, 2008This text has been out of print for several years, with the author holding copyrights. Since I continue to hear from young algebraic
Sveriges lantbruksuniversitet - MATH - 818
Algebraic Curves Robert F. Coleman Lecture 1 Office hours WF 2:10-3, 901 Evans,email; coleman@math, website: www.math.berkeley.edu/ coleman/Courses/00/curves.html. There will be weekly homework and a take home final exam. Student presentations will b
Sveriges lantbruksuniversitet - MATH - 818
%!PS-Adobe-2.0 %Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software %Title: Math-255.dvi %Pages: 97 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSCommandLine: dvips Math-255 %DVIPSParameter
Penn State - EMK - 190
~ Erin M. Kennedy ~4701 College Drive Mailbox #851 ~ Erie, PA 16563 Home: 724-758-5433 Cell: 724-657-7824emk190@psu.edu_ ~ PROFIL E ~ _ Energetic, dependable Student with academic experience in communications, public relations, and English. Curre
Penn State - EMK - 190
Erin Kennedy CAS 203 Reflection Paper #1 February 5, 2007 Self-Actualization Saint Catherine of Siena once said "Nothing great is ever achieved without much enduring." The quest for self-actualization, perhaps one of the greatest things an individual
Penn State - EMK - 190
Erin Kennedy CAS 203 Reflection Paper #2 February 26, 2007 Observations on Communication Behaviors Each of us communicates with other individuals countless times on a day-to-day basis, whether it be in a verbal or nonverbal manner. Since this communi
Penn State - EMK - 190
Kennedy 1 Erin Kennedy English 30 Assignment #1 September 16, 2005The Hierarchies of Hockey Each fall, fanatics across the nation gather in crowed stadiums, bars, and homes to witness the ritual seasonal opening of one of the most venerated sports
Penn State - EMK - 190
Kennedy 1 Erin Kennedy English 30 Assignment #2 September 30, 2005Cellular Culture: Teenagers and Cellular Phones On April 3, 1973 the first public wireless phone call was placed. Martin Cooper, the man who placed this famous call, recalls the gapi
Trinity U - CS - 1300
How to Defragment Your Hard Drive _ Frequently Asked Questions (nice explanation) Go the the Start Menu and Choose All Programs:From the list of all programs, choose Accessories:At the Drop down list, choose System Tools and then Disk Defragmente
Trinity U - CS - 1300
vti_encoding:SR|utf8-nl vti_author:SR|CS-NEREID\Administrator vti_modifiedby:SR|CS-NEREID\Administrator vti_timelastmodified:TR|17 Jan 2007 17:45:56 -0000 vti_timecreated:TR|17 Jan 2007 17:45:56 -0000 vti_cacheddtm:TX|17 Jan 2007 17:45:56 -0000 vti_f
New Mexico - ECE - 415
%!PS-Adobe-3.0 %BoundingBox: (atend) %Pages: (atend) %PageOrder: (atend) %DocumentFonts: (atend) %DocumentNeedsFonts: (atend) %DocumentSuppliedFonts: (atend) %Creator: Frame 5.5 %DocumentData: Clean7Bit %EndComments %BeginProlog % % Frame ps_prolog 5
New Mexico - ECE - 415
%!PS-Adobe-3.0 %BoundingBox: (atend) %Pages: (atend) %PageOrder: (atend) %DocumentFonts: (atend) %DocumentNeedsFonts: (atend) %DocumentSuppliedFonts: (atend) %Creator: Frame 5.5 %DocumentData: Clean7Bit %EndComments %BeginProlog % % Frame ps_prolog 5
New Mexico - ECE - 415
%!PS-Adobe-3.0 %BoundingBox: (atend) %Pages: (atend) %PageOrder: (atend) %DocumentFonts: (atend) %DocumentNeedsFonts: (atend) %DocumentSuppliedFonts: (atend) %Creator: Frame 5.5 %DocumentData: Clean7Bit %EndComments %BeginProlog % % Frame ps_prolog 5
New Mexico - ECE - 415
%!PS-Adobe-3.0 %BoundingBox: (atend) %Pages: (atend) %PageOrder: (atend) %DocumentFonts: (atend) %DocumentNeedsFonts: (atend) %DocumentSuppliedFonts: (atend) %Creator: Frame 5.5 %DocumentData: Clean7Bit %EndComments %BeginProlog % % Frame ps_prolog 5
New Mexico - ECE - 415
%!PS-Adobe-3.0 %BoundingBox: (atend) %Pages: (atend) %PageOrder: (atend) %DocumentFonts: (atend) %DocumentNeedsFonts: (atend) %DocumentSuppliedFonts: (atend) %Creator: Frame 5.5 %DocumentData: Clean7Bit %EndComments %BeginProlog % % Frame ps_prolog 5
New Mexico - ECE - 415
%!PS-Adobe-3.0 %BoundingBox: (atend) %Pages: (atend) %PageOrder: (atend) %DocumentFonts: (atend) %DocumentNeedsFonts: (atend) %DocumentSuppliedFonts: (atend) %Creator: Frame 5.5 %DocumentData: Clean7Bit %EndComments %BeginProlog % % Frame ps_prolog 5
New Mexico - ECE - 415
%!PS-Adobe-3.0 %BoundingBox: (atend) %Pages: (atend) %PageOrder: (atend) %DocumentFonts: (atend) %DocumentNeedsFonts: (atend) %DocumentSuppliedFonts: (atend) %Creator: Frame 5.5 %DocumentData: Clean7Bit %EndComments %BeginProlog % % Frame ps_prolog 5
New Mexico - ECE - 415
%!PS-Adobe-3.0 %BoundingBox: (atend) %Pages: (atend) %PageOrder: (atend) %DocumentFonts: (atend) %DocumentNeedsFonts: (atend) %DocumentSuppliedFonts: (atend) %Creator: Frame 5.5 %DocumentData: Clean7Bit %EndComments %BeginProlog % % Frame ps_prolog 5
New Mexico - ECE - 415
%!PS-Adobe-3.0 %BoundingBox: (atend) %Pages: (atend) %PageOrder: (atend) %DocumentFonts: (atend) %DocumentNeedsFonts: (atend) %DocumentSuppliedFonts: (atend) %Creator: Frame 5.5 %DocumentData: Clean7Bit %EndComments %BeginProlog % % Frame ps_prolog 5
New Mexico - ECE - 415
%!PS-Adobe-3.0 %BoundingBox: (atend) %Pages: (atend) %PageOrder: (atend) %DocumentFonts: (atend) %DocumentNeedsFonts: (atend) %DocumentSuppliedFonts: (atend) %Creator: Frame 5.5 %DocumentData: Clean7Bit %EndComments %BeginProlog % % Frame ps_prolog 5
New Mexico - ECE - 415
%!PS-Adobe-3.0 %BoundingBox: (atend) %Pages: (atend) %PageOrder: (atend) %DocumentFonts: (atend) %DocumentNeedsFonts: (atend) %DocumentSuppliedFonts: (atend) %Creator: Frame 5.5 %DocumentData: Clean7Bit %EndComments %BeginProlog % % Frame ps_prolog 5
New Mexico - ECE - 415
%!PS-Adobe-3.0 %BoundingBox: (atend) %Pages: (atend) %PageOrder: (atend) %DocumentFonts: (atend) %DocumentNeedsFonts: (atend) %DocumentSuppliedFonts: (atend) %Creator: Frame 5.5 %DocumentData: Clean7Bit %EndComments %BeginProlog % % Frame ps_prolog 5
CSU Chico - CSCI - 272
Downloading Book Chapters Go to my web page: http:/www.ecst.csuchico.edu/~hilzer/ Select CSCI-540 and then select Book Programs Download all files to a csci540 directory you created on an ect-unix (tiglon) machine by clicking on usp all.tar Type
CSU Chico - CSCI - 272
Downloading Book Chapters Go to my web page: http:/www.ecst.csuchico.edu/~hilzer/ Select CSCI-540 and then select Book Programs Download all files to a csci540 directory you created on an ect-unix (tiglon) machine by clicking on usp all.tar Type
CSU Chico - CSCI - 272
MidtermMiscoding 101 Example 1parent forks child1 and child2; child1 forks grandchild; wait(NULL); Question: Who executes wait(NULL)? Answer: parent, child1, child2, and grandchild parent terminates either child1 or child 2 child1 terminates gran
CSU Chico - CSCI - 272
Name:_Directions: Neatly write your response to each question in the space provided on the exam or on separate scratch paper. This is an open book/open notes exam worth 100 points. Although it is an open exam I expect you to understand the mat
CSU Chico - CSCI - 272
Device_handler: Running devicehandlerDevice: Running deviceUser: Stream: 4 Mode: 0 File: 0User: Stream: 0 Mode: 1 File: 0User: Stream: 2 Mode: 1 File: 0User: Stream: 1 Mode: 1 File: 0User: Stream: 3 Mode: 0 File: 1For user: 4 block # : 20 was