SlideFinderPowerPoint search engine with thumbnail results
Advanced search
Newest Viewed Downloaded

Universities > United States Showing 1 - 20 of 89 items

(Southern Oregon University)

Southern Oregon University (SOU) is a public liberal arts college located in Ashland, Oregon, United States. Founded in 1926, it was formerly known as Southern Oregon College (SOC) and Southern Oregon State College (SOSC). The university offers criminology, natural sciences, including environmental science, Shakespearean studies and theatre arts programs. It is headquarters for Jefferson Public Radio and public access station Rogue Valley Television. SOU is a member of the Council of Public Liberal Arts Colleges.

More information: http://en.wikipedia.org/wiki/Southern_Oregon_University

Serializable Objects Serializable objects Directly read/write from/to disk with a single statement Convert from/to a sequence of bytes when read/write implements Serializable needs to be on the class signature line The package java.io.Serializable needs to be available. The statement import java.io.*; suffices Most, but not all, classes in the java class library are serialized Sub classes referenced in a serialized class must also be serialized Transient variables Ex: private transient int x; declares the integer x to be transient. Transient variable are not read or written with the object

JavaScript Decision Statements if (** condition **) { **** block of instructions if condition is true**** } else { **** block of instructions if condition is false **** } Notes: The braces are not needed if a block has only one instruction The else part is optional, and can be skipped Caution: syntax MUST be exact for it to work The next slide describes what conditions are More commonly called condition statements
Client-Server Model

Client-Server Model

Client Server Note: As a highway passes through many cities, the path from the client to the server passes through many computers Client requests information from Server Examples: Give me a web-page; Give me my e-mail Server replies with the information to the Client Examples: Here is your web-page; Here is your e-mail

Speech Recognition Front End Pre-emphasis Temporal Features Consolidate Features Frequency Features Spectral Analysis windowing Enhance Features Speech Feature Vectors This week’s focus is on the spectral analysis
Wide/Narrow Band Spectrograms

Wide/Narrow Band Spectrograms

Wide band (left) Combines harmonics Voiced speech vocal fold pulses (glottis air puffs) show as vertical lines Narrow band(right) Individual harmonics Narrow-band displays formants horizontally No vocal pulses shown Display parameters Generally log power (log(amplitude2) Frame shift: 1 ms typical Spectrogram for a vowel sound Spectrograms: vowel with varying pitch
Spring Wave Oscillations

Spring Wave Oscillations

External force causes oscillations Governing equation: f = ½π(k/m)½ The spring stiffness and quantity of mass determines the frequency Force determines displacement Damping resistance leads to exponential decay (like a filter) No resistance would create an unstable system Differences from sound Components are discrete, not distributed There is no traveling wave k = spring constant x = displacement F = external force B = damper m = mass f = oscillation frequency Spring Oscillation

Forms Most application interface with users through a Graphical User Interface (GUI) GUI objects are components that allow users to enter information. They are largely standard across many modern applications A form is a collection of GUI objects that work together to interact with a user and accomplish a task.

Hyperlinks Types of Links Link to the places in the same page Link to pages within the same site Link to the e-mail system Caution: Will not work without a e-mail set up Link to other sites Caution: Check often for broken links Mouse clicks to change what the browser displays
Pulse Code Modulation (PCM )

Pulse Code Modulation (PCM )

We measure the amplitude of a signal at points in time and store them in an array. Usually 2 bytes per sample big or little endian Ulaw and Alaw takes advantage of human perception which is logarithmic One byte per sample containing logarithmic values To accurately represent a frequency, f, we need 2f measurements per second to prevent aliases (Nyquest). Compression algorithms code speech differently, but we decode to PCM for analysis.
Introduction

Introduction

Phonetics: Speech production and perception Phonology: Study of sound combinations Orthography: Writing Systems We’ll talk about each area and how they impact Natural Language Processing
Basics of Message-passing

Basics of Message-passing

Mechanics of message-passing A means of creating separate processes on different computers A way to send and receive messages Single program multiple data (SPMD) model Logic for multiple processes merged into one program Control Statements separate processor blocks of logic A compiled program is stored on each processor All executables are started together statically Example: MPI Multiple program multiple data (MPMD) model Each processor has a separate master program Master program spawns child processes dynamically Example: PVM
Embarrassingly Parallel (or pleasantly parallel)

Embarrassingly Parallel (or pleasantly parallel)

Domain divisible into a large number of independent parts. Minimal or no communication Each processor performs the same calculation independently “Nearly embarrassingly parallel” Small Computation/Communication ratio Communication limited to the distribution and gathering of data Computation is time consuming and hides the communication

Load Balancing How? Partition the computation into units of work (tasks or jobs) Assign tasks to different processors Load Balancing Categories Static (load assigned before application runs) Dynamic (load assigned as applications run) Centralized (Tasks assigned by the master or root process) De-centralized (Tasks reassigned among slaves) Semi-dynamic (application periodically suspended and load balanced) Load Balancing Algorithms are: Adaptive if they adapt to different system load levels Thresholds control how they adapt Stable if load balancing traffic is independent of load levels Symmetric if both senders and receivers initiate action Effective if load balancing overhead is minimal A load is balanced if no processes are idle Load balancing is an np-complete problem.
Parallel Programming

Parallel Programming

Techniques to use multiple computers that coordinate to solve problems Categories Hardware parallelism Fine Grain parallelism (instruction level) Course Grain parallelism (block level) Parallel Systems Shared Memory Systems Uniform Memory Access (UMA) Cache Only Memory Access (COMA) Non-uniform Memory Access (NUMA) Distributed Memory Systems Beowulf Clusters Networks or Cluster of Workstations Computational Grids Heterogeneous and Geographically Separated Hardware Parallelism Device Controllers Multiple Arithmetic Units Array Processors Pipelining Instruction reordering Memory Hierarchy Fine Grain Parallelism Loop partitioning Complex Instructions (Array Processing) Course Grain Parallelism Threads, Mutual Exclusion, Critical Sections Message Passing

Parallel Strategies Partitioning consists of the following steps Divide the problem into parts Compute each part separately Merge the results Divide and Conquer Dividing problem recursively into sub-problems of the same type Assign sub-problems to individual processors (e.g. Save and hold) Domain (Data) Decomposition Assign parts of the data to separate processors Functional Decomposition Assign application functions to separate processors Note We describe save and hold on a later slide
Parallel Sorting Algorithms

Parallel Sorting Algorithms

A B Max(A,B) Min(A,B) B Min(A,B) Max(A,B) A Comparison Sorts if (A>B) { temp=A; A=B; B=temp; } Potential Speed-up Optimal Comparison Sort: O(N lg N) Optimal Parallel speed-up O(lg N) if P=N Huge Big Oh constant Source of problems Duplicate computations to reduce message passing Different precision at different processors Key Processors independently working on data sections

Sorting Data Considerations Average, best, worst case complexity For swaps and compares Is extra memory required? Difficulty to program? Stability of equal keys What is the fastest possible sort using comparisons?
Client-Server Model

Client-Server Model

Client Server Note: As a highway passes through many cities, the path from the client to the server passes through many computers Client requests information from Server Examples: Give me a web-page; Give me my e-mail Server replies with the information to the Client Examples: Here is your web-page; Here is your e-mail

Review of Terminology Variable, Constant, Identifier, Reserved word, Scope, Case sensitive Operator, Precedence, Cast Array, Vector Primitive data, Object, Reference, Alias Class, Object, Inheritance, Polymorphism Assignment, Widening, Narrowing Constructor, Destructor, Garbage collection Static method, Static variable, Instance variable Private, Public, Protected Method signature, Overloading, Formal, Actual, this, super String, Concatenation, Escape sequence, white space Byte code, Applet, Compiler, Interpreter Pre-test, Post-test, Counter controlled Boolean, Block statement, condition These are terms taught in Programming I and Programming II This list provides a list of terms to review
12345 Next >>
Sitemap