4,463 research outputs found

    Experimental study of the effects of secondary air on the emissions and stability of a lean premixed combustor

    Get PDF
    Tests were run using a perforated plate flameholder with a relatively short attached recirculation zone and a vee gutter flameholder with a relatively long attached recirculation zone. Combustor streamlines were traced in cold flow tests at ambient pressure. The amount of secondary air entrainment in the recirculation zones of the flameholders was determined by tracer gas testing at cold flow ambient pressure conditions. Combustion tests were caried out at entrance conditions of 0.5 MPa/630K and emission of NOx, CO and unburned hydrocarbons were measured along with lean stability and flashback limits. The degree of entrainment increases as dilution air injection decreases. Flashback appears to be a function of overall equivalence ratio and resistance to flashback increases with increasing combustor entrance velocity. Lean stability limit appears to be a function of both primary zone and flameholder recirculation zone equivalence ratios and resistance to lean blowout increases with increasing combustor entrance velocity

    Flux corrected finite volume scheme for preserving scalar boundedness in reacting large-eddy simulations

    Get PDF
    Preserving scalar boundedness is an important prerequisite to performing large-eddy simulations of turbulent reacting flows. A number of popular combustion models use a conserved-scalar, mixture-fraction to parameterize reactions that, by definition, is bound between zero and one. To avoid unphysical clipping, the numerical scheme solving the conserved-scalar transport equation must preserve these bounds, while minimizing the amount of numerical diffusivity. To this end, a flux correction method is presented and applied to the quadratic-upwind biased interpolative convective scheme that ensures preservation of the scalar’s physical bounds while retaining the low numerical diffusivity of the original quadratic-upwind biased interpolative convective scheme. It is demonstrated that this bounded quadratic-upwind biased interpolative convective scheme outperforms the third-order weighted essentially nonoscillatory scheme in maintaining spatial accuracy and reducing numerical dissipation errors both in generic test cases as well as direct numerical simulation of canonical flows

    Subset feedback vertex set is fixed parameter tractable

    Full text link
    The classical Feedback Vertex Set problem asks, for a given undirected graph G and an integer k, to find a set of at most k vertices that hits all the cycles in the graph G. Feedback Vertex Set has attracted a large amount of research in the parameterized setting, and subsequent kernelization and fixed-parameter algorithms have been a rich source of ideas in the field. In this paper we consider a more general and difficult version of the problem, named Subset Feedback Vertex Set (SUBSET-FVS in short) where an instance comes additionally with a set S ? V of vertices, and we ask for a set of at most k vertices that hits all simple cycles passing through S. Because of its applications in circuit testing and genetic linkage analysis SUBSET-FVS was studied from the approximation algorithms perspective by Even et al. [SICOMP'00, SIDMA'00]. The question whether the SUBSET-FVS problem is fixed-parameter tractable was posed independently by Kawarabayashi and Saurabh in 2009. We answer this question affirmatively. We begin by showing that this problem is fixed-parameter tractable when parametrized by |S|. Next we present an algorithm which reduces the given instance to 2^k n^O(1) instances with the size of S bounded by O(k^3), using kernelization techniques such as the 2-Expansion Lemma, Menger's theorem and Gallai's theorem. These two facts allow us to give a 2^O(k log k) n^O(1) time algorithm solving the Subset Feedback Vertex Set problem, proving that it is indeed fixed-parameter tractable.Comment: full version of a paper presented at ICALP'1

    The eigenspectra of Indian musical drums

    Full text link
    In a family of drums used in the Indian subcontinent, the circular drum head is made of material of non-uniform density. Remarkably, and in contrast to a circular membrane of uniform density, the low eigenmodes of the non-uniform membrane are harmonic. In this work we model the drum head by a non-uniform membrane whose density varies smoothly between two prescribed values. Using a Fourier-Chebyshev spectral collocation method we obtain the eigenmodes and eigenvalues of the drum head. For a suitable choice of parameters, which we find by optimising a cost function, the eigenspectra obtained from our model are in excellent agreement with experimental values. Our model and the numerical method should find application in numerical sound synthesis

    Magnetic excitations in nuclei with neutron excess

    Full text link
    The excitation of the 1+1^+, 22^- and 3+3^+ modes in 16^{16}O, 22^{22}O, 24^{24}O, 28^{28}O, 40^{40}Ca, 48^{48}Ca, 52^{52}Ca and 60^{60}Ca nuclei is studied with self-consistent random phase approximation calculations. Finite-range interactions of Gogny type, containing also tensor-isospin terms, are used. We analyze the evolution of the magnetic resonances with the increasing number of neutrons, the relevance of collective effects, the need of a correct treatment of the continuum and the role of the tensor force.Comment: 18 pages, 12 figures, 2 tables, accepted for publication in Physical Review

    Monte Carlo simulations of pulse propagation in massive multichannel optical fiber communication systems

    Full text link
    We study the combined effect of delayed Raman response and bit pattern randomness on pulse propagation in massive multichannel optical fiber communication systems. The propagation is described by a perturbed stochastic nonlinear Schr\"odinger equation, which takes into account changes in pulse amplitude and frequency as well as emission of continuous radiation. We perform extensive numerical simulations with the model, and analyze the dynamics of the frequency moments, the bit-error-rate, and the mutual distribution of amplitude and position. The results of our numerical simulations are in good agreement with theoretical predictions based on the adiabatic perturbation approach.Comment: Submitted to Physical Review E. 8 pages, 5 figure

    Selection from read-only memory with limited workspace

    Full text link
    Given an unordered array of NN elements drawn from a totally ordered set and an integer kk in the range from 11 to NN, in the classic selection problem the task is to find the kk-th smallest element in the array. We study the complexity of this problem in the space-restricted random-access model: The input array is stored on read-only memory, and the algorithm has access to a limited amount of workspace. We prove that the linear-time prune-and-search algorithm---presented in most textbooks on algorithms---can be modified to use Θ(N)\Theta(N) bits instead of Θ(N)\Theta(N) words of extra space. Prior to our work, the best known algorithm by Frederickson could perform the task with Θ(N)\Theta(N) bits of extra space in O(NlgN)O(N \lg^{*} N) time. Our result separates the space-restricted random-access model and the multi-pass streaming model, since we can surpass the Ω(NlgN)\Omega(N \lg^{*} N) lower bound known for the latter model. We also generalize our algorithm for the case when the size of the workspace is Θ(S)\Theta(S) bits, where lg3NSN\lg^3{N} \leq S \leq N. The running time of our generalized algorithm is O(Nlg(N/S)+N(lgN)/lgS)O(N \lg^{*}(N/S) + N (\lg N) / \lg{} S), slightly improving over the O(Nlg(N(lgN)/S)+N(lgN)/lgS)O(N \lg^{*}(N (\lg N)/S) + N (\lg N) / \lg{} S) bound of Frederickson's algorithm. To obtain the improvements mentioned above, we developed a new data structure, called the wavelet stack, that we use for repeated pruning. We expect the wavelet stack to be a useful tool in other applications as well.Comment: 16 pages, 1 figure, Preliminary version appeared in COCOON-201

    Extended Quantum Dimer Model and novel valence-bond phases

    Get PDF
    We extend the quantum dimer model (QDM) introduced by Rokhsar and Kivelson so as to construct a concrete example of the model which exhibits the first-order phase transition between different valence-bond solids suggested recently by Batista and Trugman and look for the possibility of other exotic dimer states. We show that our model contains three exotic valence-bond phases (herringbone, checkerboard and dimer smectic) in the ground-state phase diagram and that it realizes the phase transition from the staggered valence-bond solid to the herringbone one. The checkerboard phase has four-fold rotational symmetry, while the dimer smectic, in the absence of quantum fluctuations, has massive degeneracy originating from partial ordering only in one of the two spatial directions. A resonance process involving three dimers resolves this massive degeneracy and dimer smectic gets ordered (order from disorder).Comment: 20 pages, 13 figures, accepted for publication in J. Stat. Mec
    corecore