125 research outputs found

    Enumeration of Circuits and Minimal Forbidden Sets

    Get PDF
    In resource-constrained scheduling, it is sometimes important to know all inclusion-minimal subsets of jobs that must not be scheduled simultaneously. These so-called minimal forbidden sets are given implicitly by a linear inequality system, and can be interpreted more generally as the circuits of a particular independence system. We present several complexity results related to computation, enumeration, and counting of the circuits of an independence system. On this account, we also propose a backtracking algorithm that enumerates all minimal forbidden sets for resource constrained scheduling problems

    Affective responses to high-intensity interval training with continuous and respite music

    Get PDF
    © 2020 Informa UK Limited, trading as Taylor & Francis Group. Music has been shown to enhance affective responses to continuous exercise, but the most effective application of music during interval exercise is poorly understood. This study examined two contrasting applications of music designed to assuage the decline in pleasure often experienced during high-intensity interval training (HIIT). In a repeated measures crossover design, 18 recreationally active participants (10 men and 8 women; M age = 25.1 ± 5.1 years; M BMI = 23.08 ± 2.01 kg/m 2; M VO2max = 38.82 ± 10.73 ml/kg/min) completed three HIIT sessions (10 x 60 s efforts at 100% Wmax, separated by 75 s recovery) on a cycle ergometer. Participants completed two experimental conditions: respite music (applied only during the recovery periods), continuous music (applied throughout the entire HIIT session); and a no-music control condition. Results indicated that music did not influence affective valence during the work bouts or recovery periods of the HIIT sessions (ps >.05), but that listening to music continuously elicited greater post-task enjoyment (p =.032, d = 0.66) and remembered pleasure (p =.044, d = 0.5). This study is the first to investigate the application of music during a practical HIIT protocol and to compare the effects of respite versus continuous music during interval exercise

    Measurement of the Bottom-Strange Meson Mixing Phase in the Full CDF Data Set

    Get PDF
    We report a measurement of the bottom-strange meson mixing phase \beta_s using the time evolution of B0_s -> J/\psi (->\mu+\mu-) \phi (-> K+ K-) decays in which the quark-flavor content of the bottom-strange meson is identified at production. This measurement uses the full data set of proton-antiproton collisions at sqrt(s)= 1.96 TeV collected by the Collider Detector experiment at the Fermilab Tevatron, corresponding to 9.6 fb-1 of integrated luminosity. We report confidence regions in the two-dimensional space of \beta_s and the B0_s decay-width difference \Delta\Gamma_s, and measure \beta_s in [-\pi/2, -1.51] U [-0.06, 0.30] U [1.26, \pi/2] at the 68% confidence level, in agreement with the standard model expectation. Assuming the standard model value of \beta_s, we also determine \Delta\Gamma_s = 0.068 +- 0.026 (stat) +- 0.009 (syst) ps-1 and the mean B0_s lifetime, \tau_s = 1.528 +- 0.019 (stat) +- 0.009 (syst) ps, which are consistent and competitive with determinations by other experiments.Comment: 8 pages, 2 figures, Phys. Rev. Lett 109, 171802 (2012

    Velocity-space sensitivity of the time-of-flight neutron spectrometer at JET

    Get PDF
    The velocity-space sensitivities of fast-ion diagnostics are often described by so-called weight functions. Recently, we formulated weight functions showing the velocity-space sensitivity of the often dominant beam-target part of neutron energy spectra. These weight functions for neutron emission spectrometry (NES) are independent of the particular NES diagnostic. Here we apply these NES weight functions to the time-of-flight spectrometer TOFOR at JET. By taking the instrumental response function of TOFOR into account, we calculate time-of-flight NES weight functions that enable us to directly determine the velocity-space sensitivity of a given part of a measured time-of-flight spectrum from TOFOR

    Relationship of edge localized mode burst times with divertor flux loop signal phase in JET

    Get PDF
    A phase relationship is identified between sequential edge localized modes (ELMs) occurrence times in a set of H-mode tokamak plasmas to the voltage measured in full flux azimuthal loops in the divertor region. We focus on plasmas in the Joint European Torus where a steady H-mode is sustained over several seconds, during which ELMs are observed in the Be II emission at the divertor. The ELMs analysed arise from intrinsic ELMing, in that there is no deliberate intent to control the ELMing process by external means. We use ELM timings derived from the Be II signal to perform direct time domain analysis of the full flux loop VLD2 and VLD3 signals, which provide a high cadence global measurement proportional to the voltage induced by changes in poloidal magnetic flux. Specifically, we examine how the time interval between pairs of successive ELMs is linked to the time-evolving phase of the full flux loop signals. Each ELM produces a clear early pulse in the full flux loop signals, whose peak time is used to condition our analysis. The arrival time of the following ELM, relative to this pulse, is found to fall into one of two categories: (i) prompt ELMs, which are directly paced by the initial response seen in the flux loop signals; and (ii) all other ELMs, which occur after the initial response of the full flux loop signals has decayed in amplitude. The times at which ELMs in category (ii) occur, relative to the first ELM of the pair, are clustered at times when the instantaneous phase of the full flux loop signal is close to its value at the time of the first ELM

    23rd IAEA Fusion Energy Conference: summary of sessions EX/C and ICC

    Full text link
    An overview is given of recent experimental results in the areas of innovative confinement concepts, operational scenarios and confinement experiments as presented at the 2010 IAEA Fusion Energy Conference. Important new findings are presented from fusion devices worldwide, with a strong focus towards the scientific and technical issues associated with ITER and W7-X devices, presently under construction

    Uma visão sobre qualidade do solo

    Full text link

    On the generation of circuits and minimal forbidden sets

    Get PDF
    We present several complexity results related to generation and counting of all circuits of an independence system. Our motivation to study these problems is their relevance in the solution of resource constrained scheduling problems, where an independence system arises as the subsets of jobs that may be scheduled simultaneously. We are interested in the circuits of this system, the so-called minimal forbidden sets, which are minimal subsets of jobs that must not be scheduled simultaneously. As a consequence of the complexity results for general independence systems, we obtain several complexity results in the context of resource constrained scheduling. On that account, we propose and analyze a simple backtracking algorithm that generates all minimal forbidden sets for such problems. The performance of this algorithm, in comparison to a previously suggested divide-and-conquer approach, is evaluated empirically using instances from the project scheduling library PSPLIB

    On the enumeration of minimal covers and minimal forbidden sets

    Get PDF

    Enumeration of circuits and minimal forbidden sets

    Get PDF
    In resource-constrained scheduling, it is sometimes important to know all inclusion-minimal subsets of jobs that must not be scheduled simultaneously. These so-called minimal forbidden sets are given implicitly by a linear inequality system, and can be interpreted more generally as the circuits of a particular independence system. We present several complexity results related to computation, enumeration, and counting of the circuits of an independence system. On this account, we also propose a backtracking algorithm that enumerates all minimal forbidden sets for resource constrained scheduling problems
    corecore