Generating 1
Authors: François Pachet, Pierre Roy, Alexandre Papadopoulos, Jason Sakellariou
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We illustrate our constraint with a melody generation problem, and show that the addition of the Voss constraint tends indeed to produce sequences whose spectrum have a 1/f distribution, regardless of the other constraints of the problem. We discuss the advantages and limitations of this approach and possible extensions. For each case we compute the log-log spectrum and estimate the slope of curve as previously. The spectrum of case #1 (Voss constraint only, see Figure 11) is shown in Figure 7. It can be seen clearly that the spectrum is in 1/f. Running times and number of backtracks, averaged for one solution, are reported for each setup on Table 2. |
| Researcher Affiliation | Collaboration | SONY CSL, 6 rue Amyot, 75005 Paris 2Sorbonne Universit es, UPMC Univ Paris 06, UMR 7606, LIP6, F-75005, Paris, France |
| Pseudocode | Yes | Algorithm 1: Voss algorithm as described by Gardner. |
| Open Source Code | No | The paper does not provide concrete access to source code for the methodology described. |
| Open Datasets | No | The paper discusses generating sequences and mentions using a Markov model estimated from two well-known songs, but it does not provide concrete access information for a publicly available or open dataset used for training or experiments. |
| Dataset Splits | No | The paper does not provide specific dataset split information (e.g., train/validation/test percentages or counts) needed to reproduce data partitioning. |
| Hardware Specification | Yes | All the experiments ran on a machine with a Core i7, 2.3 GHz CPU, with 16GB RAM, and running an Oracle Java 7 VM under Windows 8. |
| Software Dependencies | Yes | We implemented the Voss constraint in Back Java, an in-house Java finite-domain constraint solver similar in nature to Choco [choco Team, 2010], as well as the Mus ES musical object library [Pachet, 1994]. All the experiments ran on a machine with a Core i7, 2.3 GHz CPU, with 16GB RAM, and running an Oracle Java 7 VM under Windows 8. |
| Experiment Setup | Yes | We generate sequences of integers (representing the pitch of musical notes) of length 512, so that the spectrum can be computed without side effects. The range of pitches (i.e., the domain D of sequence variables ) is [0, 16], i.e., covers roughly 2 octaves in a diatonic setting. The number of dice is 9 (= log2(512)), and their range is [0, 1, 2]. |