Recherche

Recherche simple

Recherche avancée

Panier électronique

Votre panier ne contient aucune notice

Connexion à la base

Identification

(Identifiez-vous pour accéder aux fonctions de mise à jour. Utilisez votre login-password de courrier électronique)

Entrepôt OAI-PMH

Soumettre une requête

	Consulter la notice détaillée
	Version complète en ligne
	Version complète en ligne accessible uniquement depuis l'Ircam
	Ajouter la notice au panier
	Retirer la notice du panier

English version

(full translation not yet available)

Liste complète des articles

Consultation des notices

Vue détaillée

Vue Refer

Vue Labintel

Vue BibTeX

%0 Generic
%A Toro-Bermúdez, Mauricio
%T Exploring the possibilities and limitations of Concurrent Programming for Multimedia Interaction and exploring Visual Programming for Musical Constraint Satisfaction Problems
%D 2008
%I Pontificia Universidad Javeriana
%F ToroBermudez08a
%K concurrent constraint programming
%K constraint satisfaction problem
%K constraints
%K ntcc
%K gelisp
%K csp
%K interpreter
%K ccp
%K ntccrt
%K openmusic
%K real-time
%K gecol
%K gecode
%X Multimedia interaction systems are inherently concurrent. Developing correct concurrent systems is difficult because we need to consider all the possible interactions between processes. To reason formally about concurrent systems, there are several concurrent process calculi. We developed multiple prototypes for real-time capable interpreters for both, Concurrent Constraint Programming (CCP) and Non-deterministic Timed Concurrent Constraint (ntcc). We found out that using lightweight threads to implement these interpreters is not appropriate for real-time (RT) interaction. Instead, we recommend using event-driven programming. Using this model of concurrency, we developed Ntccrt, an interpreter for ntcc capable of RT interaction. Ntccrt is based on encoding ntcc processes as Gecode propagators. Using Ntccrt, we executed some models in Pure Data. Due to our success using Gecode, we upgraded Gelisp, providing a graphical interface to solve musical Constraint Satisfaction Problems (CSP) in OpenMusic based on Gecode. In Gelisp, constraints, search heuristics, and optimization criteria can be represented graphically. Using Gelisp, we successfully solved a CSP proposed by compositor Michael Jarrell.
%1 8
%2 1
%U http://articles.ircam.fr/textes/ToroBermudez08a/