3 Pages

modified_groove

Course: CREATE 240, Fall 2009
School: UCSB
Rating:
 
 
 
 
 

Word Count: 3798

Document Preview

Skei Ingrid MAT 240A Fall 2004 Final Project Description Enhanced Groove.java My final project was the modification and enhancement of the Groove program taken from the Java Sound Demo. This application, in both its original and modified form, was a type of drum machine which used MIDI samples for its playback. The format was a 16 beat bar (i.e. 4 quarter note measure with 16th note subdivisions) where the user...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> UCSB >> CREATE 240

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.
Skei Ingrid MAT 240A Fall 2004 Final Project Description Enhanced Groove.java My final project was the modification and enhancement of the Groove program taken from the Java Sound Demo. This application, in both its original and modified form, was a type of drum machine which used MIDI samples for its playback. The format was a 16 beat bar (i.e. 4 quarter note measure with 16th note subdivisions) where the user could turn on or off different samples at different beats. A total of 47 samples were used ranging from standard percussion sounds (e.g. bass drum, snare, crash cymbals, etc.) to more uncommon instruments (e.g. cuica, agogo, etc.). Sound was actually produced by using Java's Sequencer interface. A sequencer is used to play back MIDI sequences, which contain lists of time-stamped MIDI data. In the program, whenever the user starts the sound playback, an object of Sequence is created that sets the tempo resolution to 4 beats per quarter note, thus giving us our 4/4 measure with 16th note subdivisions. A Track object is then created for the sequence, which is how the MIDI data for the sequence is composed and stored. First a message is sent to indicate the beginning of the Sequence, via the program change command, on 10th channel. Since the program is using only percussion MIDI samples, all sound will go through the rhythm channel, or channel 10. After the program change message is sent to the Track, the "note on"/"note off" messages are then added. These correspond to the "activated", or black, cells of the table. So whenever a note is found that needs to be played, a "note on" message is sent and added to the Track that gives the channel, the instrument, the tempo, and the tick number (i.e. the nth beat of the measure, where n corresponds to the beat that is "on"). Immediately after that message, a "note off" message is sent and added with the same information, except the tick number is incremented by 1. This results in a note lasting one beat (or, in the case of the layout for Groove, one 16th note). After all of the "note on"/"note off" messages are added to the...
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:

Delaware - MATH - 352
Bradley - PROJ - 201
PC-Based Control Workstation for Controller Algorithm EvaluationSenior Project Design ProposalDecember 10, 2003By: Matt Johnson Joe Faivre Advisor: Dr. Gary DempseyProject Summary: The objective of the project is to create a PC-based control wo
Siena - PHYS - 390
!"#$"%&'()*+,-.-/)0.1&2345/65 !"#$"% 74),&0889&-)&:0);< $86-,=8&>?,-1/08!"#$"%&!'()*+'(,-./'0,'12*. !'()*+'(,-'2&34*0'(,35. 63235&74*0'(30"138(&903:0'+.&63+*5(. ;5,(,'2,<'(,35 6'2-82'(,35#)*&!"#$"%&=>5?,035+*5(@()*.09&$/08&'0+,!"#$)*24&
Siena - PHYS - 390
!"#$"%&'()*+,-.-/)0.1&2345/65 !"#$"%& 74),&0889&-)&:0);< $86-,=8&>?,-1/08!"#$%&'()*(+,"&-./0&12$30#/$ 4#.5&6$720&8$9&:20720:20720&0/&4#.5" 6$720&1;/<&4#.5"&2"#$%&6<7/;0&=808&>6?8;9'()*(+&42$30#/$"21)-/0@&;/-3&!"#$"%+1)-7AB4BC!"#C<&@=&7./0
Siena - PHYS - 390
Name_ Chapter 1: Introduction and Exploration Find stars of different colors Record colors and data for each star Save data in spreadsheet Discover pattern in color and magnitude difference Total Chapter 2: The Definition of Color in Astronomy Practi
UConn - MATH - 245
HW 1Math245, September 2007Due Monday September 24 (1) Find the two vectors of norm 2 that are parallel to the vector (2, 2, 1). (2) Let a = (1, 1, 1), b = (1, 1, 1). Find the projection of a onto b. (3) Find the angle between the planes z = 5 and
UConn - MATH - 245
HW 2Math245, Fall 2007Due Monday October 8 or Wednesday October 10Read sections 2.22.5 and do the exercises, but do not submit. Submit problems (1)(8): (1) Is matrix A invertible? If not, justify your answer. If yes, nd the inverse of A. A= 1 1
UConn - MATH - 245
HW 3Math245, Fall 2007Due Monday October 15 or Wednesday October 17Read section 2.6 and submit the following exercises. Exercise 2: write a proof based on the theorems in the text. Exercise 4: look into the answers and write a proof based on the
UConn - MATH - 245
HW 4Math245, Fall 2007Due Monday October 22 or Wednesday October 24Read section 3.4 and submit the following exercises. Exercise 8: write a proof based on the theorems in the text. Exercise 11: write a proof based on the theorems in the text. Ex
UConn - MATH - 245
HW 5Math245, Fall 2007Due Wednesday October 31Read sections 3.8, 4.1, 4.2, 4.3. Read section 4.4 and submit the following exercise. Exercise 7: write a complete solution.Read section 4.5 and do the following exercises. Exercise 4: show your ca
UConn - MATH - 245
HW 6Math245, Fall 2007Due Wednesday November 7Read section 4.6 and do the following exercises. Exercises 1 and 2, (a) and (b) only. Exercises 7 and 8.Read section 4.7 and do the following exercises. Exercise 4 and 5, (a) and (b) only. Exercise
UConn - MATH - 245
HW 7Math245, Fall 2007Due Wednesday November 28Read chapter 9 and do the following exercises. Section 9.2, exercise 2. Section 9.3, exercises 4, 5, 11. Section 9.4, exercise 3.
UConn - MATH - 245
HW 8Math245, Fall 2007Due Wednesday December 5Section 9.6, Exercise 4. Hint: prove it by induction in k using formulas in the bottom of page 375. Read Sections 5.15.5. Section 5.4, Exercise 1(a,c,d). Section 5.5, Exercise 1(b,d). Hint: for each
UConn - MATH - 245
what everybody should know about the topology ofmetric spacesMath245, September 2007basics (1) denition: for all x, y X (i) d(x, y) > 0 if x = y, and d(x, x) = 0 (ii) d(x, y) = d(y, x) (iii) d(x, y) d(x, z) + d(z, y) Note: any subset of a metri
UConn - MATH - 245
what everybody should know about the topology ofvector geometryMath245, September 2007basics We are taking about nite dimensional vector spaces over R, such as Rn . We assume that an inner or scalar product ab is dened. (1) The length or norm of
Ball State - P - 416
Kate Rock Eddie Flecker Erin Cooper Gardner's Theory of Multiple Intelligences This theory was proposed by Howard Gardner in 1983 and was just recently revised in 1996. It was created in direct challenge to the "classical view of intelli
Ball State - P - 416
Brandy Snider Annette Castaldo Psych 416 Project 3 The Ideal Problem Solver People who are faced with a problem have many different ways of dealing with it. The way in which people handle their problems has to do with how each individual perceives th
Ball State - P - 416
Game TheoryImagine that two people have robbed a bank. The police have arrested two suspects who they believe are the perpetrators and have them both in separate interrogation rooms. If the two of them both confess, they will both go to jail for te
Ball State - P - 416
Elizabeth Carnes Kristen Montague Jeremy Schrock Paul Turner December 6, 2001Heuristic Decision-Making Model Abstract Heuristics are defined as "simple cognitive rules that are easy to apply and usually yield acceptable decisions but can lead to er
Ball State - P - 416
Jason Reeves Kelly McCormack Matthew McClure PSYSC 416 Project 3 November 27, 2001 Expected-Utility Theory Some decisions are easy to make. Would I rather have the liver and onions, or the medium-rare ribeye? Should I fasten my seatbelt or risk flyin
Allan Hancock College - COMP - 9514
%!PS-Adobe-2.0 %Creator: dvipsk 5.58f Copyright 1986, 1994 Radical Eye Software %Title: lecture1.dvi %Pages: 14 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %EndComments %DVIPSCommandLine: dvips -o lecture1.ps lecture1 %DVIPSParameters: dpi=600, comp
Allan Hancock College - COMP - 9514
%!PS-Adobe-2.0 %Creator: dvipsk 5.58f Copyright 1986, 1994 Radical Eye Software %Title: lecture2.dvi %Pages: 18 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %EndComments %DVIPSCommandLine: dvips -o lecture2.ps lecture2 %DVIPSParameters: dpi=600, comp
Allan Hancock College - COMP - 9514
%!PS-Adobe-2.0 %Creator: dvipsk 5.58f Copyright 1986, 1994 Radical Eye Software %Title: lecture3.dvi %Pages: 22 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %EndComments %DVIPSCommandLine: dvips -o lecture3.ps lecture3 %DVIPSParameters: dpi=600, comp
Allan Hancock College - COMP - 9514
%!PS-Adobe-2.0 %Creator: dvipsk 5.58f Copyright 1986, 1994 Radical Eye Software %Title: lecture4.dvi %Pages: 19 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %EndComments %DVIPSCommandLine: dvips -o lecture4.ps lecture4 %DVIPSParameters: dpi=600, comp
Allan Hancock College - COMP - 9514
%!PS-Adobe-2.0 %Creator: dvipsk 5.58f Copyright 1986, 1994 Radical Eye Software %Title: the.dvi %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %DocumentFonts: Times-Roman Times-Bold Times-Italic %EndComments %DVIPSCommandLine: dvips -o the.ps
UPenn - ESE - 0708
University of Pennsylvania Department of Electrical and Systems Engineering ESE 441 SENIOR DESIGN PROJECT FACULTY SUBMISSION FORM 1. Project Title: Lossless Floating Point Distillation or Multiprecision Summation 2. Proposer's Name: Andr De
UCSB - ECE - 152
DeMicheli Spring 93/94EE271Verilog According to Tom1.0 Whats Verilog?The name Verilog refers to both a language and a simulator which are used to functionally specify and model digital systems. This document describes Verilog in the context of
CSU Northridge - HCGEO - 007
gh Insi ew Nts in HistoricAr ea sVentura, 2009Another GreAt MeetinG on the PAcific coAst Pacific SectionS aaPG-SePM-SeG conventionMay 2 - 6, 2009 - Ventura, California Great Technical Papers and Field TripsSeep TourGreat ActivitiesSan
Acton School of Business - COMP - 212
Design Patterns for GamesStephen Wong Dung NguyenRice UniversityLet's Play a Game Sun's Tic-Tac-Toe What can we learn from this? Arrays For-loops Nested ConditionalsWhat aren't we learning? Delineation of concepts from implementation
Acton School of Business - COMP - 212
Hangman Milestone 1 Grading criteria1. 5% bonus for being done on original due date.2. (adapted from the "Checkpoint" at the bottom of the body parts page)At this point the students should be able to demonstrate:- A working IWord and IBody sy
Acton School of Business - COMP - 212
Design Patterns for GamesStephen Wong Dung NguyenRice UniversityWhat's in a Game?ModelRules Strategies PlayersXadapterViewButtons, etc. Display outputsXadapterInstall adaptersO OControllerGame ModelRules of the Game Board
UCSB - CS - 138
CS 136: Mid-quarter Examination 2Department of Computer Science University of California, Santa Barbara Closed-Book, 75 minutes Fall 2002Instructions Before you answer any questions, print your name and perm number. Read each question carefully.
Old Dominion - COMP - 0304
/*Lab 1Templates and command line argumentsToday, you'll create two template functions, mymin and mymax. You get two guesses what they do. As for command line arguments, you should note that I've used char *argv rather than char *argv[]. The
Acton School of Business - COMP - 212
#%-12345X@PJL JOB @PJL ENTER LANGUAGE = Postscript %!PS-Adobe-3.0 %Title: Microsoft Word - AntWorld.doc %Creator: Windows NT 4.0 %CreationDate: 23:24 10/4/2001 %Pages: (atend) %BoundingBox: 13 28 603 781 %LanguageLevel: 2 %DocumentNeededFonts: (atend
N.C. State - PE - 105
North Carolina State University Department of Physical Education Fall 2005 COURSE: P. E 105:Aerobics and Body Conditioning TH 10:15 Rm 1206 INSTRUCTOR: Joy Kagendo-Charles, Carmichael Gym, Rm. 2020, 513-1545 OFFICE HRS: MW:12:15-1:15 ; TTH 9:00 -10:0
Iowa State - EE - 527
A Probability ReviewOutline: A probability review. Shorthand notation: RV stands for random variable.EE 527, Detection and Estimation Theory, # 0b1A Probability ReviewReading: Go over handouts 25 in EE 420x notes. Basic probability rules:
Iowa State - EE - 527
EM AlgorithmOutline: Expectation-maximization (EM) algorithm. Examples. Reading: A.P. Dempster, N.M. Laird, and D.B. Rubin, "Maximum likelihood from incomplete data via the EM algorithm," J. R. Stat. Soc., Ser. B, vol. 39, no. 1, pp. 138, 1977 wh
Iowa State - EE - 527
General Bayesian Inference IOutline: Basic concepts, One-parameter models, Noninformative priors. Reading: Chapters 10 and 11 in Kay-I. (Occasional) Simplified Notation. potential for confusion, we may use f (x | ) instead of the more cumbersome
Iowa State - EE - 527
Bayesian Inference IIOutline: Multiparameter models. Reading: Chapter 10 in Kay-I.EE 527, Detection and Estimation Theory, # 4c1Multiparameter ModelsSo far, we have discussed Bayesian estimation for toy scenarios with single parameters. In
Iowa State - EE - 527
Outline: An introduction to detection theory, Bayesian decision-theoretic detection theory. Reading: Chapter 3 in Kay-II, Prof. Don Johnson's notes on detection theory, http:/www. ece.rice.edu/~dhj/courses/elec531/notes5.pdf. Notation: We use ()
Iowa State - EE - 527
Testing multiple hypotheses: a Bayesian decision-theoretic approachReading: Ch. 3 in Kay-II.EE 527, Detection and Estimation Theory, # 5b1Testing Multiple HypothesesChoose a parameter-space partitioning: sp(0)sp(1) sp(M -1) = sp, spi spj =
Iowa State - EE - 527
Outline: Neyman-Pearson test for simple binary hypotheses, receiver operating characteristic (ROC). An introduction to classical composite hypothesis testing. Reading: Chapter 3 in Kay-II, (part of) Chapter 5 in Levy.EE 527, Detection and Estim
Iowa State - EE - 527
An Introduction to Probabilistic Graphical ModelsReading: Chapters 17 and 18 in Wasserman.EE 527, Detection and Estimation Theory, An Introduction to Probabilistic Graphical Models1Directed GraphsWe wish to identify simple structure in larg
Iowa State - EE - 527
Hidden Markov Models (HMMs)(Discrete-time Discrete Observation Space Case) [1] is a classical reference on this topic, available on WebCT and IEEE Xplore, For a bioinformatics-related exposition, see Ch. 12 of W.J. Ewens and G.R. Grant, Statistical
Iowa State - EE - 527
EE 527, HW 8, due April 9, 2009.11. Binary vector channel . The output of a binary vector channel with multiplicative noise is is S[0] W [0] X[0] = . . X= S[N - 1] W [N - 1] X[N - 1] S[0] . S= S[N - 1] W [0] . W = W [N - 1] whereand
Iowa State - EE - 527
EE 527, HW 9, due April 16, 2009.11. (a) Find the -level Neyman-Pearson rule (with false-alarm probability ) for testing H0 : = 0 H1 : = 1 . where fX | (x | 0 ) = versus fX | (x | 1 ) = c1 (3 - |x|), |x| 3 0, else c0 x2 , |x| 1 0, else vers
Iowa State - EE - 527
EE 527, HW 10, due April 23, 2009.11. Suppose that we have collected data y k at times k = 1, 2, . . . , T and that the measurement model in (1)(5) in handout Kalman holds. Then, smoothing requires the computation of the following posterior predi
San Diego State - CS - 524
Running on SDSU/Rohan/Fall 06 Wed Nov 15 14:15:05 PST 2006 The input code: %ss%tpackage testloop is body fib : integer; oldfib : integer; tmpfib, i : integer;begin fib := 1; oldfib := 1; writeln("This program also c
San Diego State - CS - 524
Running on SDSU/Rohan/Fall 06 Wed Nov 15 10:40:28 PST 2006 The input code: %ss%t- testing comments.Package test_loop Is Bodyi, j:integer;%dmpBegini := 0;loopwriteln("simple loop, i=", i);i := i + 1;exit when i=3;end loop;
Michigan State University - CEM - 142
E. Kentucky - ITTC - 753
EECS 753 Embedded and Real Time Computer SystemsEECS 753 Embedded and Real Time Computer Systems (3). This course will cover emerging and proposed techniques and issues in embedded and real time computer systems. Topics will include new paradigms,
E. Kentucky - ITTC - 753
Embedded and Real Time Systems Lecture #4David Andrews dandrews@eecs.ukans.eduWhat We Will Cover Today Processing Timing Attributes Purely Cyclic Mostly Cyclic Asynchronous and somewhat predictable Asynchronous and unpredictable Mapping Int
E. Kentucky - ITTC - 753
Time in Embedded and Real Time Systems Lecture #6David Andrews dandrews@eecs.ukans.eduWhat We Will Cover TodayTime and Order1. 2. 3. 1. 2. 3. 1. 2. Causal Order Temporal Order Delivery Order Global Time Precision/Accuracy Sparse Time Internal Sy
E. Kentucky - ITTC - 753
Requirements Analysis Lecture #3David Andrews dandrews@eecs.ukans.eduWhat We Will Cover Today Typical Design Flow Top Down Design Approach Understanding Requirements Functional Behavioral Timing Physical Perform Requirements Analysis on
E. Kentucky - ITTC - 753
Time in Embedded and Real Time Systems Lecture #6David Andrews dandrews@eecs.ukans.eduWhat We Will Cover TodayTime and Order1. 2. 3. 1. 2. 3. 1. 2. Causal Order Temporal Order Delivery Order Global Time Precision/Accuracy Sparse Time Internal Sy
E. Kentucky - ITTC - 753
Embedded and Real Time Systems Lecture #3David Andrews dandrews@eecs.ukans.eduWhat We Will Cover Today Fundamental Concepts and Definitions Functional and Temporal Requirements What Is A Distributed System Things That Matter Most In Embedded
E. Kentucky - ITTC - 753
Embedded and Real Time SystemsDavid Andrews dandrews@eecs.ukans.eduEECS 753 Embedded and Real Time Systems What is an embedded system ?Computer inside a product What makes them different ? Reactive and Real Time Multi-dimensional design spa
E. Kentucky - ITTC - 753
Embedded and Real Time SystemsDavid Andrews dandrews@eecs.ukans.eduEECS 753 Embedded and Real Time Systems What is an embedded system ?Computer inside a product What makes them different ? Reactive and Real Time Multi-dimensional design spa
E. Kentucky - ITTC - 753
Time in Embedded and Real Time SystemsDavid Andrews dandrews@eecs.ukans.eduWhat We Will Cover TodayTime and Order1. 2. 3. 1. 2. 3. 1. 2. Causal Order Temporal Order Delivery Order Global Time Precision/Accuracy Sparse Time Internal Synchronizat
E. Kentucky - ITTC - 753
Requirements Analysis ExampleDavid Andrews dandrews@eecs.ukans.eduWhat We Will Cover Today Typical Design Flow Top Down Design Approach Understanding Requirements Functional Behavioral Timing Physical Perform Requirements Analysis on Sp
E. Kentucky - ITTC - 753
Data Acquisition for Embedded SystemsRajesh GuptaAcknowledgments: Jane Liu, Ki-Seok Chung, University of Illinois, Urbana-Champaign.Overviewl l l l Signal Processing Basics Sampling Digital-to-Analog Conversion Analog-to-Digital Conversion2