# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

12 Pages

### mary

Course: PRESENTATI 01, Fall 2009
School: UPenn
Rating:

Word Count: 177

#### Document Preview

Internal The Friction of Conductive Fibers SUNFEST 2001 Mary Kutteruf Advisor: Jorge J. Santiago-Aviles Conducting Polymer Fibers Uses Production Spinning Electrospinning Electrospinning Elastic Materials &amp; Hooks Law = M or = J with M = 1/J = stress &amp; = strain For every stress there is a unique equilibrium strain Equilibrium is reached instantaneously The stress strain relationship is...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Pennsylvania >> UPenn >> PRESENTATI 01

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.
Internal The Friction of Conductive Fibers SUNFEST 2001 Mary Kutteruf Advisor: Jorge J. Santiago-Aviles Conducting Polymer Fibers Uses Production Spinning Electrospinning Electrospinning Elastic Materials & Hooks Law = M or = J with M = 1/J = stress & = strain For every stress there is a unique equilibrium strain Equilibrium is reached instantaneously The stress strain relationship is linear. Anelastic Materials Equilibrium is not reached instantaneously. Periodic stress leads strain. is the internal friction. Periodic force removed exponential decay A(t)=A0e-f t A0=initial amplitude f = frequency = Experiment Run current the through fiber in an orthogonal oscillating magnetic field Adjust frequency of oscillation to obtain resonance Turning off the current through the fiber & measure the decay Analysis of the decay of the induced current reveals the internal friction of the fiber Gold Wire Model Polyaniline Film Conductive film Did not pass enough current to move stiff film in magnetic field. Volt...

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:

UPenn - ESE - 0708
University ofPennsylvania DepartmentofElectricalEngineering ESE441SENIORDESIGN PROJECTFACULTYSUBMISSION FORM 1.ProjectTitle:PersonalMemoryAssistant(PMA) 2.Proposer'sName:Kenneth R.Laker Email:laker@seas.upenn.eduAreyou willing andabletoserveasproje
UPenn - EE - 0506
Univerisity ofPennsylvania DepartmentofElectricalEngineering ESE441SENIORDESIGN PROJECTFACULTYSUBMISSION FORM 1.ProjectTitle:SiGe Analog CircuitDesign 2.Proposer'sName:MitchNewcomer Email:mitch@hep.upenn.eduAreyou willing andabletoserveasprojectadv
UPenn - EE - 442
Univerisity ofPennsylvania DepartmentofElectricalEngineering ESE441SENIORDESIGN PROJECTFACULTYSUBMISSION FORM 1.ProjectTitle:SiGe Analog CircuitDesign 2.Proposer'sName:MitchNewcomer Email:mitch@hep.upenn.eduAreyou willing andabletoserveasprojectadv
UPenn - EE - 0506
University ofPennsylvania DepartmentofElectricalandSystems Engineering ESE441SENIORDESIGN PROJECTFACULTYSUBMISSION FORM 1.ProjectTitle:Testing acustom madepolarization video sensor 2.Proposer'sName:J.VanderSpiegel andViktorGruev Email:jan@seas,vgruev
UPenn - EE - 442
University ofPennsylvania DepartmentofElectricalandSystems Engineering ESE441SENIORDESIGN PROJECTFACULTYSUBMISSION FORM 1.ProjectTitle:Testing acustom madepolarization video sensor 2.Proposer'sName:J.VanderSpiegel andViktorGruev Email:jan@seas,vgruev
UPenn - EE - 0506
UPenn - EE - 442
UPenn - MAY - 04
Probabilistic Polynomial-Time Process Calculus for Security Protocol AnalysisJ. Mitchell, A. Ramanathan, A. Scedrov, V. Teague Partially supported by ONR CIP/SW URIOutlineSecurity protocols uResearch goals uSpecific process calculus Probabi
UPenn - CIS - 673
Run-time VerificationOleg SokolskyCIS 673 Fall 2006OutlineMotivation and overview Why run-time verification Formal methods and run-time verification Property specification Incremental property checkingMaC framework ApplicationsRun-t
UPenn - NOV - 05
Trustworthy Infrastructure, Mechanisms, and Experimentation for Diffuse Computing (TIME DC)U Penn, Stanford, Cornell, YaleMURI, June 2004Infection AttemptsEmail: scedrov@math.upenn.eduNetwork Intrusion AttemptsWWW: http:/www.cis.upenn.edu/~ti
UPenn - CIT - 594
Profiling code, Timing MethodsApr 10, 2009OptimizationOptimization is the process of making a program as fast (or as small) as possible Heres what the experts say about optimization: Sir Tony Hoare: Premature optimization is the roo
UPenn - CIT - 594
Analysis of AlgorithmsApr 10, 2009Time and spaceTo analyze an algorithm means:developing a formula for predicting how fast an algorithm is, based on the size of the input (time complexity), and/or developing a formula for predicting how m
UPenn - CIT - 591
Regular Expressions in JavaApr 10, 2009Regular ExpressionsA regular expression is a kind of pattern that can be applied to text (Strings, in Java) A regular expression either matches the text (or part of the text), or it fails to match
UPenn - CIT - 594
Greedy Algorithms1A short list of categoriesAlgorithm types we will consider include: Simple recursive algorithms Backtracking algorithms Divide and conquer algorithms Dynamic programming algorithms Greedy algorithms Branch and bound
UPenn - CIT - 594
Simple Sorting AlgorithmsOutline We are going to look at three simple sorting techniques: Bubble Sort, Selection Sort, and Insertion Sort We are going to develop the notion of a loop invariant We will write code for Bubble Sort and Selecti
UPenn - CIT - 594
Priority QueuesPriority queue A stack is first in, last out A queue is first in, first out A priority queue is least-first-out The smallest element is the first one removed The definition of smallest is up to the programmer (for example, you m
UPenn - CIT - 594
Analysis of AlgorithmsTime and space To analyze an algorithm means: developing a formula for predicting how fast an algorithm is, based on the size of the input (time complexity), and/or developing a formula for predicting how much memory an alg
UPenn - CIT - 591
Error messagesApr 10, 2009Types of errorsThere are three general types of errors:Syntax (or compile time) errorsSyntax errors are grammatical errors and are detected when you compile the program Syntax errors prevent your program from
UPenn - CIT - 591
AppletsApr 10, 2009AppletsAn applet is a program that is typically embedded in a Web page and can be run from a browser You need special HTML in the Web page to tell the browser about the applet You dont need to supply a main method; the b
UPenn - CIT - 591
Managing ComplexityProgramming is more than just syntaxLearning things that matterThings change rapidly in computer scienceLanguages go in and out of popularity, operating systems change, even programming styles changes Half of what you le
UPenn - CIT - 591
Style Rules IStyle is important Everyone agrees that good style is important Everyone agrees on most of the essentials But some people have religious wars over style Its the subtle points that get people really upset Subtle points mostly arent
UPenn - CIT - 594
Comments on the Three Piles ProblemApr 10, 2009My timingsSolved10000problemsofsize5in15milliseconds. Averagetimeperproblem:0.0015ms. Solved200problemsofsize10in16milliseconds. Averagetimeperproblem:0.08ms. Solved200problemsofsize15in718milliseco
UPenn - CIT - 594
Using MapsA simple map: HashtableTo create a Hashtable, use:importjava.util.*; Hashtabletable=newHashtable();To put things into a Hashtable, use: table.put(key, value); To retrieve a value from a Hashtable, use: value =table.get(key);2
UPenn - CIT - 594
Priority QueuesPriority queue A stack is first in, last out A queue is first in, first out A priority queue is least-first-out The smallest element is the first one removed The definition of smallest is up to the programmer (for example, you m
UPenn - EMTM - 600
UPenn - LHUANG - 3
A Cascaded Linear Model for Joint Chinese Word Segmentation and Part-of-Speech TaggingWenbin JiangInstitute of Computing TechnologyINSTITUTE OF COMPUTING TECHNOLOGYLiang HuangUniversity of PennsylvaniaQun Liu &amp; Yajuan LInstitute of Computin
UPenn - LHUANG - 3
Statistical Syntax-Directed Translation with Extended Domain of LocalityLiang Huang Kevin Knight University of Pennsylvania USC/ISI Philadelphia, PA 19104 Marina del Rey, CA 90292 lhuang3@cis.upenn.edu knight@isi.edu Aravind Joshi University of Penn
UPenn - LHUANG - 3
Liang HuangContact Information Research Interests 1350 Charleston Rd., Google Research Mountain View, CA 94043, USA Computational Linguistics Ecient Algorithms for Parsing and Machine Translation Syntax-based Machine Translation Formal Properties of
UPenn - LHUANG - 2
Dynamic Programming Algorithms in Semiring and Hypergraph FrameworksLiang Huang Department of Computer and Information Science University of Pennsylvania lhuang3@cis.upenn.edu November 27, 2006Contents1 Introduction 2 Semirings 3 Dynamic Programm
UPenn - LHUANG - 3
Dynamic Programming Algorithms in Semiring and Hypergraph FrameworksLiang Huang Department of Computer and Information Science University of Pennsylvania lhuang3@cis.upenn.edu November 27, 2006Contents1 Introduction 2 Semirings 3 Dynamic Programm
UPenn - LHUANG - 3
Better k-best ParsingLiang Huang (Penn) David Chiang (Maryland)9th International Workshop on Parsing Technologies (IWPT 2005) Vancouver, B.C., CanadaMotivations NLP pipeline 1-best is not always optimal in the future postpone disambiguation
UPenn - LHUANG - 3
Intuition and Dedication My Philosophy for Teaching Theoretical Computer ScienceLiang Huang, Department of Computer and Information ScienceI teach courses in Theoretical Computer Science, perhaps one of the most abstract and mathematically rigorou
UPenn - LHUANG - 3
For Notes and recordsThe interest of G.H. Hardy, F.R.S. in the philosophy and the history of mathematicsI. GRATTAN-GUINNESS Middlesex University at Enfield, Middlesex EN3 4SF, England E-mail: IVOR2@MDX.AC.UKSUMMARY Hardys research career shows a
UPenn - LHUANG - 3
Binarization of Synchronous Context-Free GrammarsLiang Huang Hao ZhangUniversity of PennsylvaniaUniversity of Rochester USC/Information Sciences InstituteDaniel GildeaUniversity of RochesterKevin KnightSystems based on synchronous gramma
UPenn - LHUANG - 3
Advice to the beginnerA. Connes Coll`ge de France, Institut des Hautes Etudes e Scientiques and Vanderbilt University. Mathematics is the backbone of modern science and a remarkably ecient source of new concepts and tools to understand the reality
UPenn - LHUANG - 3
Statistical Syntax-Directed Translationwith Extended Domain of LocalityLiang Huang (Penn), Kevin Knight (ISI), Aravind Joshi (Penn)AMTA 2006, Boston, MASyntax-Directed Translation How do we human-beings do translation?1. understand the source
UPenn - LHUANG - 3
June 19, 2006 9:13 WSPC/139-IJMPA03319International Journal of Modern Physics A Vol. 21, No. 15 (2006) 30313038 c World Scientic Publishing CompanyALBERT EINSTEIN: OPPORTUNITY AND PERCEPTIONCHEN NING YANGHuang Ji-Bei &amp; Lu Kai-Qun ProfessorT
UPenn - LHUANG - 2
Dynamic Programming Algorithmsin Semiring and Hypergraph FrameworksLiang Huang Clunch talk and WPE II exam November 28th, 2006Dynamic Programming Dynamic Programming is everywhere in NLP Viterbi Algorithm for Hidden Markov Models CKY Algorithm
UPenn - LHUANG - 3
Dynamic Programming Algorithmsin Semiring and Hypergraph FrameworksLiang Huang Clunch talk and WPE II exam November 28th, 2006Dynamic Programming Dynamic Programming is everywhere in NLP Viterbi Algorithm for Hidden Markov Models CKY Algorithm
UPenn - LHUANG - 3
if you understand a theorem and you can prove itpublish it in a mathematical journalif you understand it but can't prove itsubmit it to a physics journalif you can neither understand it nor prove itsend it to a journal of engineering
UPenn - MONTEREY - 06
On the Correctness of Model Transformations in the Development of Embedded SystemsGabor Karsai, Anantha Narayanan, Sandeep Neema Institute for Software-Integrated Systems Vanderbilt University Nashville, TN 37235, USAOverviewThe Problem Backgroun
UPenn - HCMDSS - 09
CALL FOR PAPERS2nd Joint Workshop On High Confidence Medical Devices, Software, and Systems (HCMDSS) and Medical Device Plug-and-Play (MD PnP) Interoperability (HCMDSS/MDPnP '09)April 16, 2009 San Francisco, CA http:/www.cis.upenn.edu/hcmdss09/Th
UPenn - MONTEREY - 06
Shaping Process SemanticsChristoph Kirsch Universitt SalzburgJoint work with Harald Rck Monterey Workshop, Paris, October 2006The Idea we apply trafc shaping technology knownin the networking community to software processes access resources, p
UPenn - MONTEREY - 06
Industrial Challenges in Composition of Embedded SystemsDr. David Corman, Dr. James Paunicka Technical Fellow Network Centric Operations Boeing Phantom Works16 October, 2006This document does not contain technical data as defined in the Internat
UPenn - HCES - 04
Code Generation from CHARONRajeev Alur, Yerang Hur, Franjo Ivancic, Jesung Kim, Insup Lee, and Oleg Sokolsky University of PennsylvaniaContentsMotivation CHARON overview Example: Sony dog Code generation procedure Soundness of generated code
UPenn - HCES - 04
Monte Carlo Model CheckingScott Smolka SUNY at Stony BrookJoint work with Radu Grosu Main source of support: ARO David HislopModel CheckingS |= ?Is system S a model of formula ?Automata-Theoretic Approach[Vardi &amp; Wolper LICS86] Bchi aut
UPenn - HCES - 04
Symbolic Simulation of Tunneling ProtocolsCarl A. Gunter, Matthew Jacobs, Gaurav Shah, Mark-Oliver Stehr (UIUC), andAlwyn Goodloe HCES 2004OverviewMotivating problem from wireless security. Solution by composing secure tunnels. Software enginee
UPenn - HCES - 04
AutomaticGenerationandAnalysisof AttackGraphsJeannetteM.WingComputerScienceDepartment CarnegieMellonUniversity Pittsburgh,PAUSAjointworkwithOlegSheyner,SomeshJha(Wisconsin), RomanV.Lototski,AlexeyRoschyna,ArvindKannan,andMeeraSridharExampleofA
UPenn - RV - 2003
University of Colorado at Boulder(Please Type or Print Clearly)Summer Conference Housing ReservationDepartment of Housing - Office of Conference Services Telephone: (303) 492-5151 Fax: (303) 492-5959 Name of Conference: Participants Name:Last
UPenn - MONTEREY - 06
FZI Forschungszentrum Informatikan der Universitt Karlsruhe13th Monterey Workshop, Paris, 18-October-2006Supporting System Level Designof Distributed Real Time Systems for Automotive ApplicationsProf. Dr.-Ing. Klaus D. Mller-Glaser Universitt
UPenn - MONTEREY - 06
Time-triggered Message-triggered Object Programming SchemeK.H. (Kane) KimDirector of DREAM Laboratory University of California, IrvineJuan A. ColmenaresDREAM Lab University of California, IrvinePresented by Juan A. Colmenares at the 2006 Monte
UPenn - RV - 2007
7th International Workshop on Run-time VericationPreliminary ProceedingsMarch 13, 2007 Vancouver, British Columbia, CanadaProgram Committee:Mehmet Aksit Howard Barringer Saddek Bensalem Eric Bodden Bernd Finkbeiner Cormac Flanagan Vijay Garg K
UPenn - HCES - 04
Run-tim Ve e rification with re gular e ssions xpreOle S g okolskyJoint withArvind Easwaran, I nsup Le , Usa S m e am apunUnive rsity of Pe nnsylvania4th Workshop on High-C onfide Em dde S m nce be d yste s April 26-27, 2004Outline What i
UPenn - LDC - 99
File: tsidcorp.doc = Description of the Tactical Speaker Identification Corpus 0. Introduction -This corpus was collected by Douglas Reynolds and Gerald C. O'Leary of MIT Lincoln Labs. It contains recordings of 35 speakers (4 female, 31 male), using
UPenn - LDC - 2004
The NIST Meeting Room Pilot CorpusJohn S. Garofolo, Christophe D. Laprun, Martial Michel, Vincent M. Stanford, Elham TabassiNational Institute of Standards and Technology, 100 Bureau Drive, Gaithersburg MD 20899, USA Systems Plus Inc., 1370 Picc
UPenn - LDC - 2002
Emotion CategoriesDescriptorsSituations that may elicit this responseNo emotion DisgustMatter-of-fact, simple statement, detachment (without boredom) Aversion, repugnant, intense dislike, nauseating, provoke loathing PanicSudden over
UPenn - LDC - 2002
The 2001 NIST Evaluation Plan for Recognition of Conversational Speech over the Telephone (a.k.a. Hub5) Phonetic Analysis Supplement IntroductionA phonetic analysis component is being supported as part of the Hub5 evaluation this year for a second
UPenn - LDC - 2002
The 2001 NIST Evaluation Plan for Recognition of Conversational Speech over the TelephoneVersion 1.1, 30-Oct-00IntroductionThe 2001 evaluation of conversational speech recognition over the telephone is part of an ongoing series of periodic evalua
UPenn - LDC - 94
* Multi-Language Telephone Speech Corpus Distribution DATA.DOC release January, 1994 Copyright 1994 Center for Spoken Language Understanding Oregon Graduate Institute ** The speech and transcription filenames are of the form: &lt;langcode&gt;&lt;callnumber&gt;&lt;t
UPenn - LDC - 2003
Entity Detection and Tracking Phase 1 EDT and Metonymy Annotation Guidelines Version 2.5.1 200305021 Intro.2 2 Basic Concepts..2 3 Text to Annotate.3 4 Entities and Mentions..3 4.1 Entity Types.3 4.1.1 Persons..3 4.1.2 Organizations.5 4.1.3 Locatio
UPenn - LDC - 2002
TED Database /doc/TED.doc L. Lamel / J. Mariani 04/01/94* THE TRANSLANGUAGE ENGLISH DATABASE (TED) The idea of TED, the Translanguage English Database, was first conceived at Eurospeech-91 in Genoa, Italy, and follow-up discussions at the COCOSDA m