11 Pages

lillaney03

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

Word Count: 398

Document Preview

Cognosensors Remote : Developing an NIR Imaging Model to Map Brain Function Prasheel Lillaney Project Advisor: Dr. Britton Chance Introduction Goal: Develop an untethered system for detection of oxygenation and blood volume levels in the pre-frontal cortex. Use oxygenation and blood volume information to tell us about subject behavior Why untethered? Eliminates nervousness and misleading signals Experimental...

Register Now

Unformatted Document Excerpt

Coursehero >> Pennsylvania >> UPenn >> PRESENTATI 03

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.
Cognosensors Remote : Developing an NIR Imaging Model to Map Brain Function Prasheel Lillaney Project Advisor: Dr. Britton Chance Introduction Goal: Develop an untethered system for detection of oxygenation and blood volume levels in the pre-frontal cortex. Use oxygenation and blood volume information to tell us about subject behavior Why untethered? Eliminates nervousness and misleading signals Experimental Setup Laser = 805 nm Subject (Phantom) Detector (PMT) 1-2 M Processing of Signal Basic PrincipleConvert photons from laser into an electrical signal Processing of signal is based on TCSPC (Time Correlated Single Photon Counting) Develop processing system- determine absorption coefficient (a) Standard Single Photon Counting System One source / One detector model at the moment Solved problem of trigger signal not being accepted by SPC board Some concern with grounding issues with the Hamamatsu R5600U PMT SPC Experimental Setup Laser Frequency varied from 15 MHz to 40 MHz Attenuators used are identical (anywhere from 1 dB to over 40 dB attenuation Amplifiers used not identical SPC Experimental Results 1 Trials 1,2,3 for Phantom 1 (a = 0.02 cm ) Trial 1 Trial 2 Trial 3 -1 70000 60000 50000 40000 30000 20000 10000 0 500 Photon C ounts Trials done with PMT/Subject distance at 60 cm Trial 3 done with subject position altered to increase reflection Enhanced Log Plot (Data points 575-625) Trial 1 4.4 LOG P hoton Counts 4.2 4 3.8 3.6 3.4 3.2 3 0 y = -0.016x + 4.2878 R2 = 0.9706 Linear (Trial 1) 550 600 Time Increment (1024=50ns) 650 Trials 1,2,3 for Phantom 1 (a = cm 0.02 ) Trial 1 Trial 2 Trial 3 -1 LO G Ph o to n Co u n ts 5 4.5 4 3.5 3 2.5 500 550 600 650 10 20 30 40 50 Time Increment (1024=50ns) Time Increment (1024=50ns) SPC Experimental Results 2 Remote Trial Demonstrating Seperation of Specular and Photon Migration 3.6 3.4 LOG Photon Counts 3.2 3 2.8 2.6 2.4 0 100 200 300 400 500 600 700 800 900 Time Increment (1024=50ns) Possible separation of reflection and diffuse photon signals? Possible artifact from PMT. Trial 1 4 3.8 LOG Photon Counts LOG Photon Counts 4 3.8 3.6 3.4 3.2 3 2.8 2.6 2.4 2.2 2 400 Trial 2 3.6 3.4 3.2 3 2.8 2.6 2.4 2.2 2 400 500 600 Time Increment (1024=50ns) 700 800 \ 500 600 Time Incremenet (1024=50ns) 700 800 Box Car System Reference: Chance, B. Initial Box Car Results Voltage Peak to Peak (mV) vs Frequency (MHz) 600 Voltage (mV) 500 400 300 200 100 0 0 1 2 3 Frequency (MHz) 4 5 6 Response from 1-gated integrator and pulse generator. Voltage decreased as frequ...

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 - PRESENTATI - 00
Cell-Based BiosensorCellGold Electrodes Teflon Covered surfaceGreen Tape MaterialDeAnna Burns Engineering Advisor: Haim Bau Biology Advisor: Jackie TanakaLong term goals for the sensor! Fabricationof a biosensor that is compatible with cel
UPenn - PRESENTATI - 97
STUDY TO IMPROVE FLUORESCENT DETECTION METHODSJUAN CARLOS SAEZ - UNIVERSITY OF PUERTO RICO, CAYEY ADVISOR: Dr. DAVID J. GRAVESNSF SUMMER UNDERGRADUATE FELLOWSHIP IN SENSOR TECHNOLOGIES, SUNFEST PROGRAMUNIVERSITY OF PENNSYLVANIAGOAL:4Find imp
UPenn - PRESENTATI - 03
Archeoviz: Improving the Camera Calibration ProcessJonathan Goulet Advisor: Dr. Kostas DaniilidisProject DescriptionProblem Complete 3-D reconstruction of site in Tiwanaku, Bolivia Program for archeologists in field Accurate 3-D displays from
UPenn - PRESENTATI - 00
Neural Networks: Tracing Cellular PathwaysLauren Berryman Sunfest 2000Neural Networks: Tracing Cellular Pathways Research Objective Background Methodology and Experimental Approach Results and Conclusions Summary and DiscussionCreditsDr. N
UPenn - PRESENTATI - 03
Aibo Motion Calibration and Control/Monitoring SystemBrian Corwin Dr. Daniel Lee- AdvisorPurpose Robotic devices, like the Sony dogs, often have many types of sensor outputs. Want to integrate all of these information sources, from multiple dog
UPenn - PRESENTATI - 01
Using Vision for Collision Avoidance and RecoveryBill Sacks SUNFEST 01 Advisor: Prof. Ostrowski 3 on 3 1 goalie, 2 players per team 2-meter by 3-meter field Legged league use Sony Aibo robots Sensors include> Camera (we use low res. camera)
UPenn - PRESENTATI - 99
Building a Lock-In Amplifier for a Network Sensor SystemBy: Catherine ReynosoAdvisors: SUNFEST Summer Research Program Dr. Jay Zemel & Mr. Carlos Lopez August 6, 1999To develop, test and evaluate the effectiveness of a distributed noise cancella
UPenn - PRESENTATI - 01
Automated Flight Control of an Unmanned BlimpVito Sabella SUNFEST 2001Unviersity of Pennsylvania SUNFEST Program 20012/12/20021Project GoalsTo Automate the Flight Control of an unmanned 30 foot blimp. A Subsidiary of the STWING-SEAS Blimp Pr
UPenn - PRESENTATI - 01
The Internal Friction of Conductive FibersSUNFEST 2001 Mary Kutteruf Advisor: Jorge J. Santiago-AvilesConducting Polymer FibersUses Production Spinning ElectrospinningElectrospinningElastic Materials & Hooks Law = M or = J with M = 1/J =
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
Univerisity ofPennsylvania DepartmentofElectricalEngineering ESE441SENIORDESIGN PROJECTFACULTYSUBMISSION FORM 1.ProjectTitle:PETScannerTriggerandReadout 2.Proposer'sName:RickVanBerg Email:rick@hep.upenn.eduAreyou willing andabletoserveasprojectadvi
UPenn - EE - 442
Univerisity ofPennsylvania DepartmentofElectricalEngineering ESE441SENIORDESIGN PROJECTFACULTYSUBMISSION FORM 1.ProjectTitle:PETScannerTriggerandReadout 2.Proposer'sName:RickVanBerg Email:rick@hep.upenn.eduAreyou willing andabletoserveasprojectadvi
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
EMTM600Spring2007(courtesyofProf.J.A.Toronto)IntroducingtheJavaPetStore2.0Application: DocumentationandAjaxTechnologyOverviewTheJavaPetStore2.0demoprovidesameetinggroundforbuyersandsellersofpets,aswell asorpetloversjustwantingtolook.Thisapplic
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 & 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 & 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 & 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