819 research outputs found

    Parameterized and Approximation Algorithms for the Load Coloring Problem

    Get PDF
    Let c,kc, k be two positive integers and let G=(V,E)G=(V,E) be a graph. The (c,k)(c,k)-Load Coloring Problem (denoted (c,k)(c,k)-LCP) asks whether there is a cc-coloring φ:V[c]\varphi: V \rightarrow [c] such that for every i[c]i \in [c], there are at least kk edges with both endvertices colored ii. Gutin and Jones (IPL 2014) studied this problem with c=2c=2. They showed (2,k)(2,k)-LCP to be fixed parameter tractable (FPT) with parameter kk by obtaining a kernel with at most 7k7k vertices. In this paper, we extend the study to any fixed cc by giving both a linear-vertex and a linear-edge kernel. In the particular case of c=2c=2, we obtain a kernel with less than 4k4k vertices and less than 8k8k edges. These results imply that for any fixed c2c\ge 2, (c,k)(c,k)-LCP is FPT and that the optimization version of (c,k)(c,k)-LCP (where kk is to be maximized) has an approximation algorithm with a constant ratio for any fixed c2c\ge 2

    Validity of the Law of Mass Action in Three-Dimensional Coagulation Processes

    Get PDF
    Diffusion-limited reactions are studied in detail on the classical coalescing process. We demonstrate how, with the aid of a recent renormalization group approach, fluctuations can be integrated systematically. We thereby obtain an exact relation between the microscopic physics (lattice structure and particle shape and size) and the macroscopic decay rate in the law of mass action. Moreover, we find a strong violation of the law of mass action. The corresponding term in the kinetic equations originates in longwavelength fluctuations and is a universal function of the macroscopic decay rate

    The radiating part of circular sources

    Get PDF
    An analysis is developed linking the form of the sound field from a circular source to the radial structure of the source, without recourse to far-field or other approximations. It is found that the information radiated into the field is limited, with the limit fixed by the wavenumber of source multiplied by the source radius (Helmholtz number). The acoustic field is found in terms of the elementary fields generated by a set of line sources whose form is given by Chebyshev polynomials of the second kind, and whose amplitude is found to be given by weighted integrals of the radial source term. The analysis is developed for tonal sources, such as rotors, and, for Helmholtz number less than two, for random disk sources. In this case, the analysis yields the cross-spectrum between two points in the acoustic field. The analysis is applied to the problems of tonal radiation, random source radiation as a model problem for jet noise, and to noise cancellation, as in active control of noise from rotors. It is found that the approach gives an accurate model for the radiation problem and explicitly identifies those parts of a source which radiate.Comment: Submitted to Journal of the Acoustical Society of Americ

    High intensity study of THz detectors based on field effect transistors

    Full text link
    Terahertz power dependence of the photoresponse of field effect transistors, operating at frequencies from 0.1 to 3 THz for incident radiation power density up to 100 kW/cm^2 was studied for Si metal-oxide-semiconductor field-effect transistors and InGaAs high electron mobility transistors. The photoresponse increased linearly with increasing radiation power up to kW/cm^2 range. The saturation of the photoresponse was observed for all investigated field effect transistors for intensities above several kW/cm^2. The observed signal saturation is explained by drain photocurrent saturation similar to saturation in direct currents output characteristics. The theoretical model of terahertz field effect transistor photoresponse at high intensity was developed. The model explains quantitatively experimental data both in linear and nonlinear (saturation) range. Our results show that dynamic range of field effect transistors is very high and can extend over more than six orderd of magnitudes of power densities (from 0.5 mW/cm^2 to 5 kW/cm^2)

    Deviations from the mean field predictions for the phase behaviour of random copolymers melts

    Full text link
    We investigate the phase behaviour of random copolymers melts via large scale Monte Carlo simulations. We observe macrophase separation into A and B--rich phases as predicted by mean field theory only for systems with a very large correlation lambda of blocks along the polymer chains, far away from the Lifshitz point. For smaller values of lambda, we find that a locally segregated, disordered microemulsion--like structure gradually forms as the temperature decreases. As we increase the number of blocks in the polymers, the region of macrophase separation further shrinks. The results of our Monte Carlo simulation are in agreement with a Ginzburg criterium, which suggests that mean field theory becomes worse as the number of blocks in polymers increases.Comment: 6 pages, 4 figures, Late

    Parameterized Directed kk-Chinese Postman Problem and kk Arc-Disjoint Cycles Problem on Euler Digraphs

    Full text link
    In the Directed kk-Chinese Postman Problem (kk-DCPP), we are given a connected weighted digraph GG and asked to find kk non-empty closed directed walks covering all arcs of GG such that the total weight of the walks is minimum. Gutin, Muciaccia and Yeo (Theor. Comput. Sci. 513 (2013) 124--128) asked for the parameterized complexity of kk-DCPP when kk is the parameter. We prove that the kk-DCPP is fixed-parameter tractable. We also consider a related problem of finding kk arc-disjoint directed cycles in an Euler digraph, parameterized by kk. Slivkins (ESA 2003) showed that this problem is W[1]-hard for general digraphs. Generalizing another result by Slivkins, we prove that the problem is fixed-parameter tractable for Euler digraphs. The corresponding problem on vertex-disjoint cycles in Euler digraphs remains W[1]-hard even for Euler digraphs

    Folding of small proteins: A matter of geometry?

    Full text link
    We review some of our recent results obtained within the scope of simple lattice models and Monte Carlo simulations that illustrate the role of native geometry in the folding kinetics of two state folders.Comment: To appear in Molecular Physic

    Time series irreversibility: a visibility graph approach

    Get PDF
    We propose a method to measure real-valued time series irreversibility which combines two differ- ent tools: the horizontal visibility algorithm and the Kullback-Leibler divergence. This method maps a time series to a directed network according to a geometric criterion. The degree of irreversibility of the series is then estimated by the Kullback-Leibler divergence (i.e. the distinguishability) between the in and out degree distributions of the associated graph. The method is computationally effi- cient, does not require any ad hoc symbolization process, and naturally takes into account multiple scales. We find that the method correctly distinguishes between reversible and irreversible station- ary time series, including analytical and numerical studies of its performance for: (i) reversible stochastic processes (uncorrelated and Gaussian linearly correlated), (ii) irreversible stochastic pro- cesses (a discrete flashing ratchet in an asymmetric potential), (iii) reversible (conservative) and irreversible (dissipative) chaotic maps, and (iv) dissipative chaotic maps in the presence of noise. Two alternative graph functionals, the degree and the degree-degree distributions, can be used as the Kullback-Leibler divergence argument. The former is simpler and more intuitive and can be used as a benchmark, but in the case of an irreversible process with null net current, the degree-degree distribution has to be considered to identifiy the irreversible nature of the series.Comment: submitted for publicatio
    corecore