INFORMS Journal on Computing articles from June 2006

INFORMS Journal on Computing archives from June 2006

From the Guest Editor: special cluster on computation in music.(Editorial)
June 22, 2006... The issues in computational modeling of music have risen to the forefront due to the massive, and rapidly growing, amount of music that is now available in digital format. Propelled by the industry's demand for content-based music indexing, for...

Segmental pattern discovery in music.
June 22, 2006... In this paper we describe a new method for discovering recurrent patterns in a corpus of segmented melodies. Elements of patterns in this scheme do not represent individual notes but rather represent melodic segments that are sequences of...

Tonal description of polyphonic audio for music content processing.
June 22, 2006... We present a method to extract a description of the tonal aspects of music from polyphonic audio signals. We define this tonal description using different levels of abstraction, differentiating between low-level signal descriptors and...

Slicing it all ways: mathematical models for tonal induction, approximation, and segmentation using the spiral array.
June 22, 2006... This paper presents the spiral array model and its associated algorithms for tonal induction, approximation, and segmentation. The spiral array is a geometric model for tonality that clusters perceptually similar tonal entities. The model...

Recurrent neural networks for music computation.
June 22, 2006... Some researchers in the computational sciences have considered music computation, including music reproduction and generation, as a dynamic system, i.e., a feedback process. The key element is that the state of the musical system depends on a...

Methodologies for evaluation of note-based music-retrieval systems.
June 22, 2006... There have been many proposed music-retrieval systems, based on a variety of principles. How the effectiveness of these systems compares is not clear. The evaluation of some systems has been informal, without the rigor applied in other areas of...

The multilevel capacitated minimum spanning tree problem.
June 22, 2006... In this paper, we consider the multilevel capacitated minimum spanning tree (MLCMST) problem, a generalization of the well-known capacitated minimum spanning tree (CMST) problem, that allows for multiple facility types in the design of the...

Base station location and service assignments in W-CDMA networks.
June 22, 2006... Designing a wideband code division multiple access (W-CDMA) network is a complicated task requiring the selection of sites for radio towers, analysis of customer demand, and assurance of service quality in terms of signal-to-interference ratio...

A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem.
June 22, 2006... This paper considers the multimode resource-constrained project-scheduling problem (MRCPSP) with a minimum-makespan objective. An exact branch and cut algorithm is presented based on the integer linear programming (ILP) formulation of the...

The shortest-path problem with resource constraints and k-cycle elimination for k [greater than or equal to] 3.
June 22, 2006... The elementary shortest-path problem with resource constraints (ESPPRC) is a widely used modeling tool in formulating vehicle-routing and crew-scheduling applications. The ESPPRC often occurs as a subproblem of an enclosing problem, where it is...