SDMay 3, 2017
Modeling temporal constraints for a system of interactive scoresMauricio Toro, Myriam Desainte-Catherine, Antoine Allombert
In this chapter we explain briefly the fundamentals of the interactive scores formalism. Then we develop a solution for implementing the ECO machine by mixing petri nets and constraints propagation. We also present another solution for implementing the ECO machine using concurrent constraint programming. Finally, we present an extension of interactive score with conditional branching.
LOMay 3, 2017
Concurrent Constraint Conditional-Branching Timed Interactive ScoresMauricio Toro, Myriam Desainte-Catherine
Multimedia scenarios have multimedia content and interactive events associated with computer programs. Interactive Scores (IS) is a formalism to represent such scenarios by temporal objects, temporal relations (TRs) and interactive events. IS describe TRs, but IS cannot represent TRs together with conditional branching. We propose a model for conditional branching timed IS in the Non-deterministic Timed Concurrent Constraint (ntcc) calculus. We ran a prototype of our model in Ntccrt (a real-time capable interpreter for ntcc) and the response time was acceptable for real-time interaction. An advantage of ntcc over Max/MSP or Petri Nets is that conditions and global constraints are represented declaratively.
MMOct 11, 2015
An Extension of Interactive Scores for Multimedia Scenarios with Temporal Relations for Micro and Macro ControlsMauricio Toro, Myriam Desainte-Catherine, Julien Castet
Software to design multimedia scenarios is usually based either on a fixed timeline or on cue lists, but both models are unrelated temporally. On the contrary, the formalism of interactive scores can describe multimedia scenarios with flexible and fixed temporal relations among the objects of the scenario, but cannot express neither temporal relations for micro controls nor signal processing. We extend interactive scores with such relations and with sound processing. We show some applications and we describe how they can be implemented in Pure Data. Our implementation has low average relative jitter even under high cpu load.