Predictability of music descriptor time series and its application to cover song detection

Intuitively, music has both predictable and unpredictable components. In this work we assess this qualitative statement in a quantitative way using common time series models fitted to state-of-the-art music descriptors. These descriptors cover different musical facets and are extracted from a large collection of real audio recordings comprising a variety of musical genres. Our findings show that music descriptor time series exhibit a certain predictability not only for short time intervals, but also for mid-term and relatively long intervals. This fact is observed independently of the descriptor, musical facet and time series model we consider. Moreover, we show that our findings are not only of theoretical relevance but can also have practical impact. To this end we demonstrate that music predictability at relatively long time intervals can be exploited in a real-world application, namely the automatic identification of cover songs (i.e. different renditions or versions of the same musical piece). Importantly, this prediction strategy yields a parameter-free approach for cover song identification that is substantially faster, allows for reduced computational storage and still maintains highly competitive accuracies when compared to state-of-the-art systems.

Long-Range Goals for Iowa's Criminal& Junvenile Justice Systems, 2005

The attached plan builds upon work done over the last decade. The first plan developed after the creation of the Division of Criminal and Juvenile Justice Planning in 1986 was issued in 1990 and annually updated through 1994. Since 1992, the CJJPAC has been required to coordinate their planning activities with those of the Iowa Juvenile Justice Advisory Council (JJAC). In 1995, these two councils developed a new plan consisting of a set of long-range justice system goals to assist policy makers and justice system practitioners as they plan and operate the justice system through the next twenty years. The statutory mandate for such long-range planning required the identification of goals specific enough to provide guidance, but broad enough to be of relevance over a long period of time. The long-range goals adopted by these councils in 1995 covered a wide variety of topics and offered a framework within which current practices could be defined and assessed. Collectively, these long-range goals were meant to provide a single source of direction to the complex assortment of practitioners and policymakers whose individual concerns and decisions collectively define the nature and effectiveness of Iowa’s justice system. The twenty-year goals established in 1995 were reviewed by the councils in 2000 to assess their current relevance. It was determined that, with a few revisions, the goals established in 1995 should be restated in 2000 with a renewed emphasis on their long-range status. This plan builds upon those issued in 1995 and 2000, continuing much of the emphasis of plans, with some new directions charted as appropriate.

Silver space-time trellis-coded modulation

Silver Code (SilC) was originally discovered in [1–4] for 2×2 multiple-input multiple-output (MIMO) transmission. It has non-vanishing minimum determinant 1/7, slightly lower than Golden code, but is fast-decodable, i.e., it allows reduced-complexity maximum likelihood decoding [5–7]. In this paper, we present a multidimensional trellis-coded modulation scheme for MIMO systems [11] based on set partitioning of the Silver Code, named Silver Space-Time Trellis Coded Modulation (SST-TCM). This lattice set partitioning is designed specifically to increase the minimum determinant. The branches of the outer trellis code are labeled with these partitions. Viterbi algorithm is applied for trellis decoding, while the branch metrics are computed by using a sphere-decoding algorithm. It is shown that the proposed SST-TCM performs very closely to the Golden Space-Time Trellis Coded Modulation (GST-TCM) scheme, yetwith a much reduced decoding complexity thanks to its fast-decoding property.

Towards robust network based complex systems : from evolutionary cellular automata to biological models

Abstract Sitting between your past and your future doesn't mean you are in the present. Dakota Skye Complex systems science is an interdisciplinary field grouping under the same umbrella dynamical phenomena from social, natural or mathematical sciences. The emergence of a higher order organization or behavior, transcending that expected of the linear addition of the parts, is a key factor shared by all these systems. Most complex systems can be modeled as networks that represent the interactions amongst the system's components. In addition to the actual nature of the part's interactions, the intrinsic topological structure of underlying network is believed to play a crucial role in the remarkable emergent behaviors exhibited by the systems. Moreover, the topology is also a key a factor to explain the extraordinary flexibility and resilience to perturbations when applied to transmission and diffusion phenomena. In this work, we study the effect of different network structures on the performance and on the fault tolerance of systems in two different contexts. In the first part, we study cellular automata, which are a simple paradigm for distributed computation. Cellular automata are made of basic Boolean computational units, the cells; relying on simple rules and information from- the surrounding cells to perform a global task. The limited visibility of the cells can be modeled as a network, where interactions amongst cells are governed by an underlying structure, usually a regular one. In order to increase the performance of cellular automata, we chose to change its topology. We applied computational principles inspired by Darwinian evolution, called evolutionary algorithms, to alter the system's topological structure starting from either a regular or a random one. The outcome is remarkable, as the resulting topologies find themselves sharing properties of both regular and random network, and display similitudes Watts-Strogtz's small-world network found in social systems. Moreover, the performance and tolerance to probabilistic faults of our small-world like cellular automata surpasses that of regular ones. In the second part, we use the context of biological genetic regulatory networks and, in particular, Kauffman's random Boolean networks model. In some ways, this model is close to cellular automata, although is not expected to perform any task. Instead, it simulates the time-evolution of genetic regulation within living organisms under strict conditions. The original model, though very attractive by it's simplicity, suffered from important shortcomings unveiled by the recent advances in genetics and biology. We propose to use these new discoveries to improve the original model. Firstly, we have used artificial topologies believed to be closer to that of gene regulatory networks. We have also studied actual biological organisms, and used parts of their genetic regulatory networks in our models. Secondly, we have addressed the improbable full synchronicity of the event taking place on. Boolean networks and proposed a more biologically plausible cascading scheme. Finally, we tackled the actual Boolean functions of the model, i.e. the specifics of how genes activate according to the activity of upstream genes, and presented a new update function that takes into account the actual promoting and repressing effects of one gene on another. Our improved models demonstrate the expected, biologically sound, behavior of previous GRN model, yet with superior resistance to perturbations. We believe they are one step closer to the biological reality.

The achievable region approach to the optimal control of stochastic systems

The achievable region approach seeks solutions to stochastic optimisation problems by: (i) characterising the space of all possible performances(the achievable region) of the system of interest, and (ii) optimisingthe overall system-wide performance objective over this space. This isradically different from conventional formulations based on dynamicprogramming. The approach is explained with reference to a simpletwo-class queueing system. Powerful new methodologies due to the authorsand co-workers are deployed to analyse a general multiclass queueingsystem with parallel servers and then to develop an approach to optimalload distribution across a network of interconnected stations. Finally,the approach is used for the first time to analyse a class of intensitycontrol problems.

Contagion and efficiency in gross and net interbank payment systems

The increased fragility of the banking industry has generatedgrowing concern about the risks associated with the paymentsystems. Although in most industrial countries differentinterbank payment systems coexist, little is really knownabout their propierties in terms of risk and efficiency. Wetackle this question by comparing the two main types ofpayment systems, gross and net, in a framework whereuncertainty arises from several sources: the time ofconsumption, the location of consumption and the return oninvestment. Payments across locations can be made either bydirectly transferrring liquidity or by transferring claimsagainst the bank in the other location. The two mechanism areinterpreted as the gross and net settlement systems ininterbank payments. We characterize the equilibria in the twosystems and identify the trade-off in terms of safety andefficiency.

It's parties that choose electoral systems (or Duverger's Law upside down)

This article presents, discusses and tests the hypothesis that it is the number of parties what can explain the choice of electoral systems, rather than the other way round. Already existing political parties tend to choose electoral systems that, rather than generate new party systems by themselves, will crystallize, consolidate or reinforce previously existing party configurations. A general model develops the argument and presents the concept of 'behavioral-institutional equilibrium' to account for the relation between electoral systems and party systems. The most comprehensive dataset and test of these notions to date, encompassing 219 elections in 87 countries since the 19th century, are presented. The analysis gives strong support to the hypotheses that political party configurations dominated by a few parties tend to establish majority rule electoral systems, while multiparty systems already existed before the introduction of proportional representation. It also offers the new theoretical proposition that strategic party choice of electoral systems leads to a general trend toward proportional representation over time.

On the throughput-WIP trade-off in queueing systems, diminishing returns and the threshold property: A linear programming approach

We present a new unifying framework for investigating throughput-WIP(Work-in-Process) optimal control problems in queueing systems,based on reformulating them as linear programming (LP) problems withspecial structure: We show that if a throughput-WIP performance pairin a stochastic system satisfies the Threshold Property we introducein this paper, then we can reformulate the problem of optimizing alinear objective of throughput-WIP performance as a (semi-infinite)LP problem over a polygon with special structure (a thresholdpolygon). The strong structural properties of such polygones explainthe optimality of threshold policies for optimizing linearperformance objectives: their vertices correspond to the performancepairs of threshold policies. We analyze in this framework theversatile input-output queueing intensity control model introduced byChen and Yao (1990), obtaining a variety of new results, including (a)an exact reformulation of the control problem as an LP problem over athreshold polygon; (b) an analytical characterization of the Min WIPfunction (giving the minimum WIP level required to attain a targetthroughput level); (c) an LP Value Decomposition Theorem that relatesthe objective value under an arbitrary policy with that of a giventhreshold policy (thus revealing the LP interpretation of Chen andYao's optimality conditions); (d) diminishing returns and invarianceproperties of throughput-WIP performance, which underlie thresholdoptimality; (e) a unified treatment of the time-discounted andtime-average cases.

Identification of C(4)-dicarboxylate transport systems in Pseudomonas aeruginosa PAO1.

Pseudomonas aeruginosa utilizes preferentially C(4)-dicarboxylates such as malate, fumarate, and succinate as carbon and energy sources. We have identified and characterized two C(4)-dicarboxylate transport (Dct) systems in P. aeruginosa PAO1. Inactivation of the dctA(PA1183) gene caused a growth defect of the strain in minimal media supplemented with succinate, fumarate or malate, indicating that DctA has a major role in Dct. However, residual growth of the dctA mutant in these media suggested the presence of additional C(4)-dicarboxylate transporter(s). Tn5 insertion mutagenesis of the ΔdctA mutant led to the identification of a second Dct system, i.e., the DctPQM transporter belonging to the tripartite ATP-independent periplasmic (TRAP) family of carriers. The ΔdctA ΔdctPQM double mutant showed no growth on malate and fumarate and residual growth on succinate, suggesting that DctA and DctPQM are the only malate and fumarate transporters, whereas additional transporters for succinate are present. Using lacZ reporter fusions, we showed that the expression of the dctA gene and the dctPQM operon was enhanced in early exponential growth phase and induced by C(4)-dicarboxylates. Competition experiments demonstrated that the DctPQM carrier was more efficient than the DctA carrier for the utilization of succinate at micromolar concentrations, whereas DctA was the major transporter at millimolar concentrations. To conclude, this is the first time that the high- and low-affinity uptake systems for succinate DctA and DctPQM have been reported to function coordinately to transport C(4)-dicarboxylates and that the alternative sigma factor RpoN and a DctB/DctD two-component system regulates simultaneously the dctA gene and the dctPQM operon.

Hierarchical location-allocation models for congested systems

In this paper we address the issue of locating hierarchical facilities in the presence of congestion. Two hierarchical models are presented, where lower level servers attend requests first, and then, some of the served customers are referred to higher level servers. In the first model, the objective is to find the minimum number of servers and theirlocations that will cover a given region with a distance or time standard. The second model is cast as a Maximal Covering Location formulation. A heuristic procedure is then presented together with computational experience. Finally, some extensions of these models that address other types of spatial configurations are offered.

Male and female reproductive systems of Stolas conspersa (Germar) (Coleoptera, Chrysomelidae, Cassidinae)

Male and female reproductive systems of Stolas conspersa (Germar) (Coleoptera, Chrysomelidae, Cassidinae). The male and female reproductive systems of Stolas conspersa (Germar, 1824) are described and illustrated for the first time. The male reproductive system shows no difference from the subfamily pattern, which is a tubular well-developed median lobe; "Y", "V" or T-shaped tegmen; reduced pygidium; internal sac membranous and tubular; flagellum generally well developed needle-like structured and gastral spiculum absent. However, the female differs from the pattern proposed for Stolas in two aspects: ovary with 28 ovarioles and a reduced ampulla with indistinct velum.

Unified formalism for non-autonomous mechanical systems

We present a unified geometric framework for describing both the Lagrangian and Hamiltonian formalisms of regular and non-regular time-dependent mechanical systems, which is based on the approach of Skinner and Rusk (1983). The dynamical equations of motion and their compatibility and consistency are carefully studied, making clear that all the characteristics of the Lagrangian and the Hamiltonian formalisms are recovered in this formulation. As an example, it is studied a semidiscretization of the nonlinear wave equation proving the applicability of the proposed formalism.

Interaction of alpha-melanotropin with central dopamine systems: role of hormonal state and molecular structure

The tubero-infundibular and nigrostriatal DA neurone systems of rats respond to systemic (i.p.) injection of alpha-MSH (2-100 microgram/kg). The response of the tubero-infundibular (arcuate) DA neurones, an increase in cellular fluorescence intensity which can be interpreted as a sign of increased neuronal activity, is essentially the same in males, estrogen-progesterone-pretreated ovariectomized females and hypophysectomized males, whereas the type of response elicited by alpha-MSH in the nigral DA neurones depends upon the hormonal state of the animal. Differences between the two DA neurone groups exist also with regard to the effects of peptide fragments containing the two active sites of the alpha-MSH molecule. Results of lesion experiments in the lower brainstem (area postrema) and of blockade of muscarinic mechanisms by atropine further point to differences in the mechanisms underlying the peptide effects on the two neurone systems. The reaction of the tubero-infundibular DA system (which controls the pars intermedia of the pituitary) can be considered to reflect the activation of a feedback mechanism on MSH secretion, while the functional counterpart of the changes observed in the nigral system remains unknown at the present time.

Efficient T cell activation requires an optimal dwell-time of interaction between the TCR and the pMHC complex.

Cytotoxic T cell (CTL) activation by antigen requires the specific detection of peptide-major histocompatibility class I (pMHC) molecules on the target-cell surface by the T cell receptor (TCR). We examined the effect of mutations in the antigen-binding site of a Kb-restricted TCR on T cell activation, antigen binding and dissociation from antigen.These parameters were also examined for variants derived from a Kd-restricted peptide that was recognized by a CTL clone. Using these two independent systems, we show that T cell activation can be impaired by mutations that either decrease or increase the binding half-life of the TCR-pMHC interaction. Our data indicate that efficient T cell activation occurs within an optimal dwell-time range of TCR-pMHC interaction. This restricted dwell-time range is consistent with the exclusion of either extremely low or high affinity T cells from the expanded population during immune responses.

Maize response to nitrogen fertilization timing in two tillage systems in a soil with high organic matter content

No-tillage systems, associated to black oat as preceding cover crop, have been increasingly adopted. This has motivated anticipated maize nitrogen fertilization, transferring it from the side-dress system at the stage when plants have five to six expanded leaves to when the preceding cover crop is eliminated or to maize sowing. This study was conducted to evaluate the effects of soil tillage system and timing of N fertilization on maize grain yield and agronomic efficiency of N applied to a soil with high organic matter content. A three-year field experiment was conducted in Lages, state of Santa Catarina, from 1999 onwards. Treatments were set up in a split plot arrangement. Two soil tillage systems were tested in the main plots: conventional tillage (CT) and no-tillage (NT). Six N management systems were assessed in the split-plots: S1 - control, without N application; S2 - all N (100 kg ha-1) applied at oat desiccation; S3 - all N applied at maize sowing; S4 - all N side-dressed when maize had five expanded leaves (V5 growth stage); S5 - 1/3 of N rate applied at maize sowing and 2/3 at V5; S6 - 2/3 of nitrogen rate applied at maize sowing and 1/3 at V5. Maize response to the time and form of splitting N was not affected by the soil tillage system. Grain yield ranged from 6.0 to 11.8 t ha-1. The anticipation of N application (S2 and S3) decreased grain yield in two of three years. In the rainiest early spring season (2000/2001) of the experiment, S4 promoted an yield advantage of 2.2 t ha-1 over S2 and S3. Application of total N rate before or at sowing decreased the number of kernels produced per ear in 2000/2001 and 2001/2002 and the number of ears produced per area in 2001/2002, resulting in reduced grain yield. The agronomic efficiency of applied N (kg grain increase/kg of N applied) ranged from 13.9 to 38.8 and was always higher in the S4 than in the S2 and S3 N systems. Short-term N immobilization did not reduce grain yield when no N was applied before or at maize sowing in a soil with high organic matter content, regardless of the soil tillage system.