• 検索結果がありません。

CrestMuseXML Toolkitで始める音楽情報処理入門

N/A
N/A
Protected

Academic year: 2021

シェア "CrestMuseXML Toolkitで始める音楽情報処理入門"

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)Vol.2010-MUS-84 No.1 2010/2/15. 情報処理学会研究報告 IPSJ SIG Technical Report. CrestMuseXML Toolkit で始める音楽情報処理入門 北. 原. 鉄. 朗†1,†2 戸. 谷. 直. 之†2. 徳. 網 亮. 輔†2. 本チュートリアルでは,我々が開発を進めている音楽情報処理研究のためのオープ ンソースソフトウェア「 CrestMuseXML Toolkit 」1を紹介する.CrestMuseXML Toolkit は,その名の通り,音楽系 XML ドキュメントを扱うためのツールであるが, データフロー型の API も備え,リアルタイム処理を伴う音楽情報処理システムの開発 にも利用できる.本チュートリアルでは,XML ド キュメントの処理と音楽データの リアルタイム処理のそれぞれについて,簡単な例題を取り上げて,使い方を解説する.. Introduction to Music Informatics: Get Started with CrestMuseXML Toolkit Tetsuro Kitahara ,†1,†2 Naoyuki Totani and Ryosuke Tokuami†2. †2. In this tutorial, we introduce the CrestMuseXML Toolkit1 , our open source software for the research of music informatics. The CrestMuseXML Toolkit is a tool for processing music-related XML documents, as the name implies, but it also has a data-flow API for developing music processing systems that involve real-time processing. In this tutorial, we explain how to use this toolkit based on simple samples of XML document processing and real-time music data processing.. †1 科学技術振興機構 CREST CrestMuse プロジェクト CrestMuse Project, CREST, JST †2 関西学院大学理工学部 School of Science and Technology, Kwansei Gakuin University 1 http://www.crestmuse.jp/cmx/. 1. c 2010 Information Processing Society of Japan .

(2)

参照

関連したドキュメント

 Following some incidents of abuse of power, including allegations of custodial death, inhuman treatment 35 and torture 36 , Bangladesh Legal Aid and Services Trust (BLAST),

This product includes software developed by the OpenSSL Project for use in the OpenSSL

The goods and/or their replicas, the technology and/or software found in this catalog are subject to complementary export regulations by Foreign Exchange and Foreign Trade Law

We construct a Lax pair for the E 6 (1) q-Painlev´ e system from first principles by employing the general theory of semi-classical orthogonal polynomial systems characterised

We show that a similar approximation holds also for the cubic variant of the 4-flow conjecture, i.e., that every bridgeless cubic graph without a Petersen minor has a nowhere-

For the multiparameter regular variation associated with the convergence of the Gaussian high risk scenarios we need the full symmetry group G , which includes the rotations around

We argue inductively for a tree node that the graph constructed by processing each of the child nodes of that node contains two root vertices and that these roots are available for

Following Speyer, we give a non-recursive formula for the bounded octahedron recurrence using perfect matchings.. Namely, we prove that the solution of the recur- rence at some