Real-time issues in computer music

Dannenberg, Roger B.; Jameson, David H.

doi:10.1109/real.1993.393491

Cited by 8 publications

(8 citation statements)

References 11 publications

(3 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To characterize the worst-case interference of the sporadic task, its minimum interarrival time has to be determined based on the system features. From the behavior described in the previous text, task 3 can be activated no more than once for every disk rotation, hence T 3 D 2 =! max .…”

Section: Estimation Of the Disk Velocitymentioning

confidence: 99%

“…As a consequence, in computergenerated music, the notes produced by a program have to be played at precise target times, with a tolerance of a few milliseconds. To describe such a timing property, Dannenberg and Jameson [3] 1182 G. BUTTAZZO, C. DI FRANCO AND M. MARINONI introduced a new task model where a deadline is not interpreted as the maximum time instant at which the execution must be completed, but as the best target time at which the output should be produced. In this case, the listener perceives a degradation in performance not only if a note is generated too late, but also if it is played too early with respect to the target time.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Design and analysis of target-sensitive real-time systems

Buttazzo

Franco

Marinoni

2015

Softw. Pract. Exper.

View full text Add to dashboard Cite

A significant number of real-time control applications include computational activities where the results have to be delivered at precise instants, rather than within a deadline. The performance of such systems significantly degrades if outputs are generated before or after the desired target time. This work presents a general methodology that can be used to design and analyze target-sensitive applications in which the timing parameters of the computational activities are tightly coupled with the physical characteristics of the system to be controlled. For the sake of clarity, the proposed methodology is illustrated through a sample case study used to show how to derive and verify real-time constraints from the mission requirements. Software implementation issues necessary to map the computational activities into tasks running on a real-time kernel are also discussed to identify the kernel mechanisms necessary to enforce timing constraints and analyze the feasibility of the application. A set of experiments are finally presented with the purpose of validating the proposed methodology

show abstract

Section: Estimation Of the Disk Velocitymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Design and analysis of target-sensitive real-time systems

Buttazzo

Franco

Marinoni

2015

Softw. Pract. Exper.

View full text Add to dashboard Cite

show abstract

“…Musical events tend to cluster around downbeats with relatively little work to be done in between. (b) In case of musical data, events cannot be scheduled too early [9].…”

Section: Literature Surveymentioning

confidence: 99%

Design of an Architecture for "An E-Tutor for Music'

Mammen

Krishnamurthi²,

Mohan

2010

2010 First International Conference on Integrated Intelligent Computing

View full text Add to dashboard Cite

The main goal of our work is to develop a framework which can train students on musical instruments. The student's musical instrument can be connected to the framework through MIDI connection. The framework receives input both from the MIDI instrument and from a source file containing exact notes, compares them to evaluate the performance of the student and grades the performance. It also has mechanism to evaluate the artistic beauty of the musical performance given by the student by analyzing how well the student had interpreted the annotations given by the author of the musical piece. The marks allotted by the proposed e-tutor was found to be comparable to that given by an expert.

show abstract

“…The identification or extraction of melody from polyphonic sources is a classic figure and ground problem (Byrd & Crawford, 2002). Early, yet still important, work in this area comes from research into the creation of automatic accompaniment programs to allow a computer to “accompany” the performances of live musicians in real time (Bloch & Dannenberg, 1985; Dannenberg, 1984).…”

Section: Revisiting the Facets Of Music Information: Affording Accessmentioning

confidence: 99%

Music information retrieval

Downie

2003

Annual Review Info Sci & Tec

242

120

View full text Add to dashboard Cite

Welcome friends and colleagues to the 2 nd Annual International Symposium on Music Information Retrieval -ISMIR 2001.Following on the heels of last year's groundbreaking inaugural conference, we're convening with colleagues this year at the beautiful campus of Indiana University, Bloomington. We hope the information exchange fostered by this conference will facilitate innovation and enhance collaboration in this dynamic area of research. This year's program is rich in content and variety. We are honored to have David Cope present this year's keynote address. The presentations by our four invited speakers, Roger Dannenberg, Jef Raskin, Youngmoo Kim, and Adam Lindsay provide added depth and breadth to an already dynamic and diverse program.This document includes the texts of the accepted papers along with the extended abstracts of the invited talks and poster presentations. All are also available on the ISMIR 2001Web site at: http:// ismir2001.indiana.edu/ As with last year, we were very encouraged by the number and quality of submissions. Response to our Call for Papers was remarkable. Selecting the twenty papers for presentation (out of 40 submissions) and the eighteen posters for exhibition was no easy task. I'd like to personally thank all those that gave of their time to help review submissions.Unending appreciation and thanks must be extended to the Program Committee: David Bainbridge (Program Chair), Gerry Bernbom, Donald Byrd, Tim Crawford, Jon Dunn, and Michael Fingerhut.Additionally I'd like to thank Dr. Stephen Griffin of the National Science Foundation, for helping us secure the foundational funding that made this symposium possible. Dr. Radha Nandkumar of the National Center for Supercomputing Applications, University of Illinois at Urbana-Champaign, must also be thanked for providing financial support to help us augment our student stipend program.Finally, several departments and individuals at our host institution, Indiana University Bloomington, deserve thanks. A great deal of the planning that went into this conference was done by Diane Jung, Charles Rondot, David Taylor, and Les Teach, of the Communications and Planning Office under the Office of the Vice President for Information Technology and CIO, and by Tawana Green and the staff of the IU Conference Bureau. Their assistance is much appreciated. In addition, the Indiana University School of Music generously supplied an extraordinary instrument, a fortepiano, for the mini-recital at the Mathers Museum. Sincerely ABSTRACTWe present a measure of the similarity of the long-term structure of musical pieces. The system deals with raw polyphonic data. Through unsupervised learning, we generate an abstract representation of music -the "texture score". This "texture score" can be matched to other similar scores using a generalized edit distance, in order to assess structural similarity. We notably apply this algorithm to the retrieval of different interpretations of the same song within a music database. MOTIVATIONMotivation for this system is our be...

show abstract

Real-time issues in computer music

Cited by 8 publications

References 11 publications

Design and analysis of target-sensitive real-time systems

Design and analysis of target-sensitive real-time systems

Design of an Architecture for "An E-Tutor for Music'

Music information retrieval

Contact Info

Product

Resources

About