DOCSLIB.ORG

Society for Range Management and Weed Science Society of America Annual Meeting Program Guide Sheraton Denver Hotel Denver, Colorado February 7-11, 2010

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Society for Range Management and Weed Science Society of America Annual Meeting Program Guide Sheraton Denver Hotel Denver, Colorado February 7-11, 2010 WORKING LANDSCAPES PROVIDING FOR THE FUTURE Society for Range Management and Weed Science Society of America Annual Meeting Program Guide Sheraton Denver Hotel Denver, Colorado February 7-11, 2010 tAble of contentS Welcome………………………………….........4 Technical Program Sheraton Hotel Room Locator……………........5 Technical Program Summary…….......27 SRM Committee Activities……………….......10 Saturday-February 6, 2010……….......31 WSSA Committee Activities…………….....…14 Sunday – February 7, 2010………...... 31 Student Activities…………………………......17 Monday -- February 8, 2010……….....32 Tours and Social Events…………………....…20 Poster papers Session A………..…....40 Agency on the Spot Hiring………………....…22 Tuesday – February 9, 2010…….….....47 Open Space Symposium………………....…....23 Poster papers Session B……….….....66 Producer Forum…………………………….....24 Wednesday – February 10, 2010….......73 Taste of Colorado...............................................25 Poster papers Session C……….….....88 Plenary Session………………………....…......26 Thursday – February 11, 2010…..….…96 2010 Annual Meeting Committee…………....144 Author Index………………………………..….108 3 Welcome to Denver, Colorado The Colorado Section members of the Society for Range Management in partnership with the Weed Science Society of America welcomes you to Denver, Colorado. This event is the 63rd Annual Meeting of the Society for Range Management and the 50th An- nual Meeting of the Weed Science Society of America. Members of the two Societies have been working for over 2 years to make this meeting a rewarding experience for all. Both Societies have long been involved in creating the scientific basis for the protection, conservation and management of the Nation’s productive lands. The meeting theme “Working Landscapes- Providing for the Future” sets the stage to promote discussions that move us all beyond our traditional disciplinary boundaries. From the Plenary Session through the broad mix of technical programs, symposiums, and social activities, we have strived to create an atmosphere of collaboration while retaining the character and inter- ests of each Society. As a joint meeting you will find participants from other disciplines and areas that you may never have a chance to meet otherwise. Please take advantage of the many opportunities to advance your knowledge in technical areas, become acquainted with a broad spectrum of professionals, renew old friendships and enjoy the Mile High city of Denver, Colorado. We also hope that you will use this occasion to form new friendships, expand your network and provide the basis for new and productive partnerships. We are committed to your enjoyment and learning experience. Please contact us with any particular needs or questions you might have. General Co-Chairs Roy Roath John Jachetta Lana Pearson Dale Shaner Society for Range Management Weed Science Society of America 4 BUILDING-ROOM Location PLAzA BUILDING CONCOURSE LEVEL TOWER BUILDING MEzzANINE LEVEL Plaza Ballroom DEnvEr Plaza A, B, C, D, E. F sPruCE Plaza Court 1, 2, 3, 4, 5, 6, 7, 8 CEntury GovErnor’s squarE 9, 10, 11, 12, 13, 14, 15, 16, 17 GolD Plaza rEGistration oFFiCE silvEr Plaza ExhiBit ColoraDo asPEn BoarDroom PLAzA BUILDING STREET LEVEL DirECtor’s row E, F, G, h, i, J TOWER BUILDING TERRACE LEVEL ColumBinE TOWER BUILDING SECOND LEVEL tErraCE GranD Ballroom 1,2 CaPitol north ConvEntion loBBy BiltmorE south ConvEntion loBBy BEvErly towEr Court 1, 2, 3, 4 winDows TOWER BUILDING MAjESTIC LEVEL maJEstiC Ballroom vail savoy 5 towEr BuilDinG mEzzaninE lEvEl 6 towEr BuilDinG TErraCE lEvEl towEr BuilDinG maJEstiC lEvEl 7 Plaza BuilDinG ConCoursE lEvEl 8 Plaza BuilDinG strEEt lEvEl towEr BuilDinG sEConD lEvEl 9 SRM coMMittee ActivitieS committee/Activity Start time End time Location Saturday february 6 SRM Board of Directors 7:00 AM 5:00 PM Century ARS/CEAP 8:00 AM 6:00 PM Plaza Court 3 2010 Planning Committee 1:30 PM 3:30 PM Plaza Court 1 Registration 5:00 PM 7:00 PM Plaza Registration Office SRM Board of Directors Meeting w/ 6:00 PM 8:00 PM Tower Court D Committee Chairs and Vice-Chairs Sunday february 7 2010 Planning Committee 6:30 AM 7:30 AM Plaza Court 1 Registration & Information 7:00 AM 5:30 PM Plaza Registration Office ARS/CEAP 8:00 AM 12:00 PM Plaza Court 1 SRM Advisory Council 8:00 AM 4:30 PM Governor's Square 12 SRM Nominations Committee 8:00 AM 5:00 PM Colorado SRM RAM Committee 8:00 AM 5:00 PM Spruce SRM Section Membership Chairs 8:00 AM 11:00 AM Governor's Square 11 SRM Public Affairs 8:00 AM 12:00 PM Governor's Square 15 SRM Government Policy and Programs Committee 8:00 AM 12:00 PM Governor's Square 14 SRM Watershed/Riparian Committee 8:00 AM 12:00 PM Plaza Court 5 SRM Rangelands Steering Committee 8:00 AM 12:00 PM Plaza Court 4 SRM Range Science Education Council 8:00 AM 12:30 PM Governor's Square 9 Rangeland CEAP 9:00 AM 12:00 PM Plaza Court 3 SRM Student Activities Committee 9:00 AM 2:00 PM Columbine SRM -Finance Committee 9:00 AM 3:00 PM Plaza Court 7 SRM Coordinated Resource Management Committee 10:00 AM 12:00 PM Tower Court D SRM Information & Education Committee 12:00 PM 4:00 PM Plaza Court 5 Silent Auction set-up 12:00 PM 6:00 PM Plaza Court 2 Tradeshow set up 12:00 PM 6:00 PM Plaza Exhibit Area SRM REM Editorial Board & Steering Committee 1:00 PM 3:00 PM Governor's Square 9 SRM Accreditation Panel 1:00 PM 3:00 PM Tower Court C SRM Publications Committee 1:00 PM 3:00 PM Tower Court B 10 SRM coMMittee ActivitieS (continued) committee/Activity Start time End time Location Sunday february 7 (continued) SRM Rangeland Invasive Species Committee 1:00 PM 4:00 PM Gold SRM Wildlife Habitat Committee 1:00 PM 4:00 PM Plaza Court 1 SRM Remote Sensing/GIS Committee 1:00 PM 4:00 PM Windows SRM Public Affairs 1:00 PM 5:00 PM Governor's Square 15 SRM Government Policy and Programs Committee 1:00 PM 5:00 PM Governor's Square 14 SRM International Affairs Committee 1:00 PM 5:00 PM Governor's Square 16 SRM (CPRM) Certified Professional Range Managers Committee 1:00 PM 5:00 PM Silver SRM Rangelands Editorial Board 1:00 PM 5:00 PM Plaza Court 4 SRM Awards Committee 3:00 PM 5:00 PM Tower Court C SRM Endowment Fund Board of Governors 3:00 PM 5:00 PM Tower Court D SRM GLCI Task Force 3:00 PM 5:00 PM Governor's Square 10 SRM History Archives & Library Committee 3:00 PM 5:00 PM Plaza Court 7 SRM Membership Task Force 3:00 PM 5:00 PM Tower Court B SRM Leadership Development Committee 4:00 PM 6:00 PM Gold SRM Contestants Registration 5:00 PM 6:00 PM Grand Ballroom - Section 2 SRM Young Professionals Conclave 5:00 PM 7:00 PM Governor's Square 9 SRM International Producer's Program Social 5:00 PM 8:00 PM Governor's Square 16 hosted by Dow AgroSciences SRM Student Conclave Business Meeting & Mixer 5:00 PM 8:00 PM Grand Ballroom - Section 2 Targeted Grazing Committee 5:00 PM 9:00 PM Colorado SRM Youth Activities Workshop 5:30 PM 7:00 PM Tower Court A SRM Association of Range Consultants 7:00 PM 9:00 PM Windows Monday february 8 2010 Planning Committee 6:30 AM 7:30 AM Plaza Court 1 2011 Annual Meeting Planning Committee 7:00 AM 9:00 AM Plaza Court 7 Registration & Information 7:00 AM 5:30 PM Plaza Registration Office Tradeshow Set-Up 8:00 AM 11:00 AM Plaza Exhibit Area 11 SRM coMMittee ActivitieS (continued) committee/Activity Start time End time Location Monday february 8 (continued) Daily Trail Boss 8:00 AM 6:00 PM Plaza Court 6 Tours Desk 8:00 AM 6:00 PM hotel lobby Silent Auction 8:00 AM 8:00 PM Plaza Court 2 Press Room 9:00 AM 12:00 PM Governor's Square 9 SRM Past Presidents, Founding & Charter Member Luncheon 12:00 PM 2:00 PM Governor's Square 10 Tradeshow 12:00 PM 8:00 PM Plaza Exhibit Area SRM Advisory Council 1:00 PM 4:30 PM Windows SRM - CPRM Exam Review 1:00 PM 5:00 PM Tower Court C tuesday february 9 2010 Planning Committee 6:30 AM 7:30 AM Plaza Court 1 Registration & Information 7:00 AM 5:30 PM Plaza Registration Office New Members Breakfast 7:00 AM 8:00 AM Plaza Ballroom F SRM Board of Directors Meeting 8:00 AM 10:00 AM Governor's Square 9 (Committee/Advisory Council Reports) SRM - CPRM Exam 8:00 AM 12:00 PM Plaza Court 3 Forest Service Rangeland Management Director's Meeting 8:00 AM 12:00 PM Capital Daily Trail Boss 8:00 AM 6:00 PM Plaza Court 6 Tours Desk 8:00 AM 6:00 PM hotel lobby Silent Auction 8:00 AM 6:00 PM Plaza Court 2 Tradeshow 8:00 AM 8:00 PM Plaza Exhibit Area Association of University Rangeland Resource Programs 1:00 PM 3:00 PM Plaza Court 1 US Forest Service I-web Training 1:00 PM 4:00 PM Terrace SRM Board of Director's Meeting Continuation 1:00 PM 5:00 PM Plaza Court 5 SRM - Chicago Climate Exchange Verifier Review and Exam 1:00 PM 5:00 PM Capital 12 SRM coMMittee ActivitieS (continued) committee/Activity Start time End time location Wednesday, february 10 2010 Planning Committee 6:30 AM 7:30 AM Plaza Court 1 SRM Board of Directors and Committee Chairs discussion 7:00 AM 8:00 AM Vail Registration & Information 7:00 AM 12:00 PM Plaza Registration Office Joint Planning Planning Committee Meeting 7:30 AM 9:30 AM Plaza Court 7 Silent Auction 8:00 AM 12:00 AM Plaza Court 2 Trade Show 8:00 AM 12:00 AM Plaza Exhibit Area BLM Agency Workshop 8:00 AM 12:00 PM Windows Tours Desk 8:00 AM 6:00 PM hotel lobby Daily Trail Boss 8:00 AM 6:00 PM Plaza Court 6 SRM Association of University Rangeland Resource 10:00 AM 12:00 PM Plaza Court 5 Programs Committee Tradeshow Tear Down 1:00 PM 6:00 PM Plaza Exhibit Area USDA - CSREES Project Director's Meeting 7:00 PM 9:00 PM Plaza Court 5 thursday, february 11 2010 Planning Committee 6:30 AM 7:30 AM Plaza Court 1 Registration & Information 7:00 AM 10:30 PM Plaza
Load more

Recommended publications
  • An Ε-Relaxation Method for Separable Convex Cost Generalized Network Flow Problems
    Math. Program., Ser. A 88: 85–104 (2000) Digital Object Identifier (DOI) 10.1007/s101070000153 Paul Tseng · Dimitri P. Bertsekas An -relaxation method for separable convex cost generalized network flow problems? Received: November 10, 1996 / Accepted: October 1999 Published online April 20, 2000 – Springer-Verlag 2000 Abstract. We generalize the -relaxation method of [14] for the single commodity, linear or separable convex cost network flow problem to network flow problems with positive gains. The method maintains -complementary slackness at all iterations and adjusts the arc flows and the node prices so as to satisfy flow conservation upon termination. Each iteration of the method involves either a price change on a node or a flow change along an arc or a flow change along a simple cycle. Complexity bounds for the method are derived. For one implementation employing -scaling, the bound is polynomial in the number of nodes N, the number of arcs A, a certain constant 0 depending on the arc gains, and ln(0=),where0 and denote, respectively, the initial and the final tolerance . 1. Introduction Consider a directed graph G D .N ; A/ with node set N Df1;::: ;Ng and arc set A ⊂ N × N . We denote by N the number of nodes and by A the number of arcs. (The implicit assumption that there exists at most one arc in each direction between any pair of nodes is made for notational convenience and can be dispensed with.) We are given, for each node i 2 N , a scalar si (supply of i) and, for each arc .i; j/ 2 A, a positive scalar γij (gain of .i; j/) and a convex, closed, proper function fij V<!<[f1g (cost function of .i; j/).
    [Show full text]
  • ISMP BP Front
    Conference Program 1 TABLE OF CONTENTS Welcome from the Chair . 2 Schedule of Daily Events & Sessions . 3 20TH INTERNATIONAL SYMPOSIUM ON Speaker Information . 5 MATHEMATICAL PROGRAMMING August 23-28, 2009 Social Events & Excursions . 6 Chicago, Illinois, USA Internet Access . 7 Opening Session & Prizes . 8 Area Map . 9 PROGRAM ORGANIZING COMMITTEE COMMITTEE Exhibitors . 10 Chair Mihai Anitescu John R. Birge Argonne National Lab Plenary & Semi-Plenary Sessions . 12 University of Chicago USA Track Schedule . 17 USA John R. Birge Karen Aardal University of Chicago Floor Plans & Maps . 22 Centrum Wiskunde & USA Informatica Michael Ferris Cluster Chairs . 24 The Netherlands University of Wisconsin- Michael Ferris Madison Technical Sessions University of Wisconsin- USA Monday . 25 Madison Jeff Linderoth USA University of Wisconsin- Tuesday . 49 Michael Goemans Madison Wednesday . 74 Massachusetts Institute of USA Thursday . 98 Technology Todd Munson USA Argonne National Lab Friday . 121 Michael Jünger USA Universität zu Köln Jorge Nocedal Session Chair Index . 137 Germany Northwestern University Masakazu Kojima USA Author Index . 139 Tokyo Institute of Technology Jong-Shi Pang Session Index . 147 Japan University of Illinois at Urbana- Rolf Möhring Champaign Advertisers Technische Universität Berlin USA World Scientific . .150 Germany Stephen J. Wright Andy Philpott University of Wisconsin- IOS Press . .151 University of Auckland Madison OptiRisk Systems . .152 New Zealand USA Claudia Sagastizábal Taylor & Francis . .153 CEPEL LINDO Systems . .154 Brazil Springer . .155 Stephen J. Wright University of Wisconsin- Mosek . .156 Madison USA Sponsors . Back Cover Yinyu Ye Stanford University USA 2 Welcome from the Chair On behalf of the Organizing Committee and The University of Chicago, I The University of Chicago welcome you to ISMP 2009, the 20th International Symposium on Booth School of Business Mathematical Programming.
    [Show full text]
  • Rancho Mastatal Updates January 2005
    Rancho Mastatal Updates January 2005 The Ranch is bustling at the moment with a group of amazing, motivated and fascinating volunteers. Their skills range from carpentry, natural healing, writing, massage therapy, painting and even cake eating. With such a great work force at our disposal, we are continuing to move forward on many fronts. We are making great headway on the new composting toilet and shower structure highlighted by our first foray into waddle and daub. We’ve mixed up our first batch of lime putty, the base for future plasters and natural Toucan Portrait, an oil pastel piece by Delfino Cornali photo by Delfino Cornali paints and renders. Robin has a beautifully improved window and a new shelving unit and baseboards in her soon-to-be studio. The workbench is soon to follow and will pave the way for some beautiful stone and silver pieces made by the skilled hands of our matriarch. We have a new back door over at Jeanne’s house and even the solar cooker has been getting some much-needed attention. Everything is more or less status quo in the community, although Marcelo is currently in the hospital with a yet to be defined sickness. Please send him and his family some good energy and love. We’re looking forward to the upcoming renewable energy workshop and our first university group visit of the year. The weather’s been gorgeous. We’ve even been getting some unexpected but much welcome rains, helping keep everything green. As always, we’re looking forward to see many of you down here in the coming months.
    [Show full text]
  • The Global Technology Revolution China, In-Depth Analyses
    Transportation, Space, and Technology A RAND INFRASTRUCTURE, SAFETY, AND ENVIRONMENT PROGRAM THE ARTS This PDF document was made available from www.rand.org as a public CHILD POLICY service of the RAND Corporation. CIVIL JUSTICE EDUCATION ENERGY AND ENVIRONMENT Jump down to document6 HEALTH AND HEALTH CARE INTERNATIONAL AFFAIRS NATIONAL SECURITY The RAND Corporation is a nonprofit research POPULATION AND AGING organization providing objective analysis and effective PUBLIC SAFETY solutions that address the challenges facing the public SCIENCE AND TECHNOLOGY and private sectors around the world. SUBSTANCE ABUSE TERRORISM AND HOMELAND SECURITY TRANSPORTATION AND INFRASTRUCTURE WORKFORCE AND WORKPLACE Support RAND Purchase this document Browse Books & Publications Make a charitable contribution For More Information Visit RAND at www.rand.org Explore the RAND Transportation, Space, and Technology Program View document details Limited Electronic Distribution Rights This document and trademark(s) contained herein are protected by law as indicated in a notice appearing later in this work. This electronic representation of RAND intellectual property is provided for non-commercial use only. Unauthorized posting of RAND PDFs to a non-RAND Web site is prohibited. RAND PDFs are protected under copyright law. Permission is required from RAND to reproduce, or reuse in another form, any of our research documents for commercial use. For information on reprint and linking permissions, please see RAND Permissions. This product is part of the RAND Corporation technical report series. Reports may include research findings on a specific topic that is limited in scope; present discus- sions of the methodology employed in research; provide literature reviews, survey instruments, modeling exercises, guidelines for practitioners and research profes- sionals, and supporting documentation; or deliver preliminary findings.
    [Show full text]
  • Optima 82 Publishes the Obituary of Paul Tseng by His Friends Affected by the Proposed Change; Only Their Subtitles Would Change
    OPTIMA Mathematical Programming Society Newsletter 82 Steve Wright MPS-sponsored meetings: the International Conference on Stochas- MPS Chair’s Column tic Programming (ICSP) XII (Halifax, August 14–20), the Interna- tional Conference on Engineering Optimization (Lisbon, September 6–9), and the IMA Conference on Numerical Linear Algebra and March 16, 2010. You should recently have received a letter con- Optimization (Birmingham, September 13–15). cerning a possible change of name for MPS, to “Mathematical Op- timization Society”. This issue has been discussed in earnest since ISMP 2009, where it was raised at the Council and Business meet- ings. Some of you were kind enough to send me your views follow- Note from the Editors ing the mention in my column in Optima 80. Many (including me) believe that the term “optimization” is more widely recognized and The topic of this issue of Optima is Mechanism Design –aNobel better understood as an appellation for our field than the current prize winning theoretical field of economics. name, both among those working in the area and our colleagues We present the main article by Jay Sethuraman, which introduces in other disciplines. Others believe that the current name should the main concepts and existence results for some of the models be retained, as it has the important benefits of tradition, branding, arising in mechanism design theory. The discussion column by Garud and name recognition. To ensure archival continuity in the literature, Iyengar and Anuj Kumar address a specific example of such a model the main titles of our journals Mathematical Programming, Series A which can be solved by the means of optimization.
    [Show full text]
  • 2013 Newsletter
    AUTUMN 2013 NEWSLETTER OF THE DEPARTMENT OF MATHEMATICS AT THE UNIVERSITY OF WASHINGTON Mathematics NEWS 1 DEPARTMENT OF MATHEMATICS NEWS Message From The Chair I made a cameo appearance on to continuing his research and teaching, Jack has taken on the this page twelve years ago, during university’s largest role in shared governance, that of the chair a one-year stint as chair before I of our Faculty Senate. headed across the street to the Our undergraduate majors continue to amaze. Last spring, dean’s office of the College of Sam Hopkins became our tenth student in the past twelve Arts and Sciences. Leaving the years to receive the Dean’s Medal in the Natural Sciences. department was difficult, what I’ve been following Sam’s career since he was a child, and with mathematics being at the so it was a special pleasure to have him in my algebra class center of my intellectual life two winters ago. He is now studying computer science at since childhood and my social Cornell, with funding from an NSF graduate fellowship. life for all of adulthood. But I See also mention on a later page of the awarding to two survived-prospered even-to the point that I returned to the additional math majors, David Jekel and Eric Lei, of the department in 2008 with trepidation, all the more as we university’s Freshman and Junior Medals. And speaking of were soon enmeshed in severe university-wide budget cuts as NSF fellowships, Ioana Dumitriu’s student Elliot Paquette fallout of the nation’s economic downturn.
    [Show full text]
  • Chapter 5: Lasso and Sparsity in Statistics
    5 Lasso and Sparsity in Statistics Robert J. Tibshirani Stanford University, Stanford, CA In this chapter, I discuss the lasso and sparsity, in the area of supervised learn- ing that has been the focus of my research and that of many other statisticians. This area can be described as follows. Many statistical problems involve mod- eling important variables or outcomes as functions of predictor variables. One objective is to produce models that allow predictions of outcomes that are as accurate as possible. Another is to develop an understanding of which variables in a set of potential predictors are strongly related to the outcome variable. For example, the outcome of interest might be the price of a company's stock in a week's time, and potential predictor variables might include information about the company, the sector of the economy it operates in, recent fluctu- ations in the stock's price, and other economic factors. With technological development and the advent of huge amounts of data, we are frequently faced with very large numbers of potential predictor variables. 5.1 Sparsity, `1 Penalties and the Lasso The most basic statistical method for what is called supervised learning relates an outcome variable Y to a linear predictor variables x1; : : : ; xp, viz. p X Y = β0 + xjβj + , (5.1) j=1 where is an error term that represents the fact that knowing x1; : : : ; xp does not normally tell us exactly what Y will be. We often refer to the right-hand side of (5.1), minus , as the predicted outcome. These are referred to as linear regression models.
    [Show full text]
  • Copyright © by SIAM. Unauthorized Reproduction of This Article Is Prohibited. EXACT REGULARIZATION of CONVEX PROGRAMS 1327
    SIAM J. OPTIM. c 2007 Society for Industrial and Applied Mathematics Vol. 18, No. 4, pp. 1326–1350 EXACT REGULARIZATION OF CONVEX PROGRAMS∗ † ‡ MICHAEL P. FRIEDLANDER AND PAUL TSENG Abstract. The regularization of a convex program is exact if all solutions of the regularized problem are also solutions of the original problem for all values of the regularization parameter below some positive threshold. For a general convex program, we show that the regularization is exact if and only if a certain selection problem has a Lagrange multiplier. Moreover, the regularization pa- rameter threshold is inversely related to the Lagrange multiplier. We use this result to generalize an exact regularization result of Ferris and Mangasarian [Appl. Math. Optim., 23 (1991), pp. 266–273] involving a linearized selection problem. We also use it to derive necessary and sufficient condi- tions for exact penalization, similar to those obtained by Bertsekas [Math. Programming, 9 (1975), pp. 87–99] and by Bertsekas, Nedi´c, and Ozdaglar [Convex Analysis and Optimization, Athena Sci- entific, Belmont, MA, 2003]. When the regularization is not exact, we derive error bounds on the distance from the regularized solution to the original solution set. We also show that existence of a “weak sharp minimum” is in some sense close to being necessary for exact regularization. We illustrate the main result with numerical experiments on the 1 regularization of benchmark (degen- erate) linear programs and semidefinite/second-order cone programs. The experiments demonstrate the usefulness of 1 regularization in finding sparse solutions. Key words. convex program, conic program, linear program, regularization, exact penalization, Lagrange multiplier, degeneracy, sparse solutions, interior-point algorithms AMS subject classifications.
    [Show full text]
  • 2010 Mathematics Newsletter
    AUTUMN 2010 NEWSLETTER OF THE DEPARTMENT OF MATHEMATICS AT THE UNIVERSITY OF WASHINGTON Mathematics NEWS 1 DEPARTMENT OF MATHEMATICS NEWS MESSAGE FROM THE CHAIR The 2009–10 academic year, which now followed by an RTG grant, both from the NSF, started with the tragic loss of our and from a number of new endowments established by colleague Paul Tseng, was trans- the Department’s friends and alumni. formed into a most exciting one Despite the tight job market, our PhD graduates con- by our students and faculty. High- tinue to place into excellent positions. During the past lights you will read about in this three years alone, they have received postdoctoral newsletter include the Putnam Fel- appointments at Penn, Columbia, Princeton, Stanford, lowship won by Will Johnson, the Northwestern, MIT, UC Davis, UBC and Warwick, and UW Sophomore and Junior Medals jobs at Chevron, Microsoft and Google. awarded to Mark Bun and Will Johnson, the selection of the team of Mark Bun, Jerry Li, and Ian Zemke as As students, teaching assistants and researchers, our one of the nine Outstanding Winners among the 2,254 graduate students make critical contributions to every teams that participated in the Mathematical Contest aspect of the Department’s mission. The Department in Modeling, the Dean’s Medal and a National Science has worked very hard during the past dozen years Foundation (NSF) Graduate Fellowship won by Nate to build a vigorous graduate program of nearly 90 Bottman, an equally prestigious Department of Energy students. I am very pleased to see that we have main- Graduate Fellowship awarded to Genia Vogman, NSF tained the size, quality and morale of the program Postdoctoral Fellowships awarded to Jim Gill and our even as we go through the worst economic crisis of PhD graduate Catherine Williams, the election of Gun- our lifetimes.
    [Show full text]
  • Curriculum Vitae James V
    Curriculum Vitae James V. Burke April, 2008 University of Washington Phone: 206–543–6163 Department of Mathematics FAX: 206–543–0397 Box 354350 E–mail: [email protected] Seattle, WA 98195–4350 URL: http://www.math.washington.edu/ burke/ EDUCATION AND APPOINTMENTS Education Ph.D., Mathematics, University of Illinois at Urbana-Champaign, October, 1983. B.S., Mathematics, Knox College, Galesburg, Illinois, May 1977. Appointments University of Washington 97- : Full Professor, Mathematics 06- : Associate Director, Resource Facility for Population Kinetics, Bioengineering 00- : Scientific Computing Team Lead, Resource Facility for Population Kinetics, Bioengineering 02- : Adjunct Professor, Statistics 00- : Adjunct Professor, Bioengineering 98- : Adjunct Professor, Applied Mathematics 01-05: Director, Applied and Computational Mathematical Sciences Program 91-97: Associate Professor, Mathematics 85-91: Assistant Professor, Mathematics University of Kentucky 83-85: Assistant Professor, Mathematics Visiting Spring 93: Argonne National Laboratories, Argonne, Illinois Autumn 92: University of New South Wales, Sydney, Australia Summer 90: Universit´ede Pau et C.N.R.S., Pau, France Summer 89: University of New South Wales, Sydney, Australia Summer 85: Argonne National Laboratories, Argonne, Illinois RESEARCH Grant Support National Institutes of Health 03-08: NIH/NIBIB 2 P41 EB01975 (PI Dr. Paolo Vicini) (03/01/2003 - 02/28/2008) Resource Facility for Population Kinetics Role: Investigator 30% salary support Total Award: $4.7 million 98-02: NIH/BRTP 1 P41 RR12609-02 (PI Dr.s David Foster and Paolo Vicini) (03/01/98 - 02/29/02) Resource Facility for Population Kinetics Role: Investigator 20% salary support Total Award: $4.7 million 96-97: NIH/BRTP 1 P41 (PI Dr.
    [Show full text]
  • Taking Rhetoric to Work: a Dramatistic Analysis Of
    TAKING RHETORIC TO WORK: A DRAMATISTIC ANALYSIS OF ORGANIZATIONAL LEADERSHIP IN THE OFFICE A Thesis Submitted to the College of Graduate Studies and Research in Partial Fulfillment of the Requirements for the Degree of Master of Arts in Rhetoric and Organizational Communication University of Saskatchewan, Saskatoon By Julian John Demkiw Copyright, Julian Demkiw, December 2010, All Rights Reserved i Permission to Use In presenting this thesis in partial fulfillment of the requirements for a Postgraduate degree from the University of Saskatchewan, I agree that the Libraries of this University may make it freely available for inspection. I further agree that permission for copying of this thesis in any manner, in whole or in part, for scholarly purposes may be granted by the professor or professors who supervised my thesis work or, in their absence, by the Head of the Department or the Dean of the College in which my thesis work was done. It is understood that any copying or publication or use of this thesis or parts thereof for financial gain shall not be allowed without my written permission. It is also understood that due recognition shall be given to me and to the University of Saskatchewan in any scholarly use which may be made of any material in my thesis. Requests for permission to copy or to make other use of material in this dissertation, in whole or in part, should be addressed to: Department Head, Interdisciplinary Studies College of Graduate Studies and Research University of Saskatchewan Room C180 Administration Building 105 Administration Place Saskatoon, SK S7N 5A2 ii Abstract This thesis focuses on ways that rhetorical theory can assist in better understanding the dysfunctions of the modern organizational environment.
    [Show full text]
  • Joint Descent: Training and Tuning Simultane
    Under review as a conference paper at ICLR 2021 JOINT DESCENT:TRAINING AND TUNING SIMULTANE- OUSLY Anonymous authors Paper under double-blind review ABSTRACT Typically in machine learning, training and tuning are done in an alternating manner: for a fixed set of hyperparameters y, we apply gradient descent to our objective f(x; y) over trainable variables x until convergence; then, we apply a tuning step over y to find another promising setting of hyperparameters. Because the full training cycle is completed before a tuning step is applied, the optimization procedure greatly emphasizes the gradient step, which seems justified as first- order methods provides a faster convergence rate. In this paper, we argue that an equal emphasis on training and tuning lead to faster convergence both theoretically and empirically. We present Joint Descent (JD) and a novel theoretical analysis of acceleration viap an unbiased gradient estimate to give an optimal iteration complexity of O( κny log(n/)), where κ is the condition number and ny is the dimension of y. This provably improves upon the naive classical bound and implies that we essentially train for free if we apply equal emphasis on training and tuning steps. Empirically, we observe that an unbiased gradient estimate achieves the best convergence results, supporting our theory. 1 INTRODUCTION For many practical machine learning tasks, the importance of efficient hyperparameter tuning in order to achieve state-of-the-art performance is often overlooked. Because modern neural network architec- tures and learning models have become increasingly complicated, the need to precisely and efficiently tune the growing number of hyperparameters has also increased in traditional supervised learning (Snoek et al., 2012), as well as diverse applications such as reinforcement learning (Choromanski et al., 2018), neural network attacks (Papernot et al., 2017), and generative adversarial networks (Goodfellow et al., 2014).
    [Show full text]