18,223 research outputs found

    The Hardness of Embedding Grids and Walls

    Full text link
    The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph GG from some class KK of "pattern graphs" can be embedded into a given graph HH (that is, is isomorphic to a subgraph of HH) is fixed-parameter tractable if KK is a class of graphs of bounded tree width and W[1]W[1]-complete otherwise. Towards this conjecture, we prove that the embedding problem is W[1]W[1]-complete if KK is the class of all grids or the class of all walls

    MODELLING THE ELECTRON WITH COSSERAT ELASTICITY

    Get PDF
    Interactions between a finite number of bodies and the surrounding fluid, in a channel for instance, are investigated theoretically. In the planar model here the bodies or modelled grains are thin solid bodies free to move in a nearly parallel formation within a quasi-inviscid fluid. The investigation involves numerical and analytical studies and comparisons. The three main features that appear are a linear instability about a state of uniform motion, a clashing of the bodies (or of a body with a side wall) within a finite scaled time when nonlinear interaction takes effect, and a continuum-limit description of the body–fluid interaction holding for the case of many bodies

    On Feedback Vertex Set: New Measure and New Structures

    Full text link
    We present a new parameterized algorithm for the {feedback vertex set} problem ({\sc fvs}) on undirected graphs. We approach the problem by considering a variation of it, the {disjoint feedback vertex set} problem ({\sc disjoint-fvs}), which finds a feedback vertex set of size kk that has no overlap with a given feedback vertex set FF of the graph GG. We develop an improved kernelization algorithm for {\sc disjoint-fvs} and show that {\sc disjoint-fvs} can be solved in polynomial time when all vertices in GFG \setminus F have degrees upper bounded by three. We then propose a new branch-and-search process on {\sc disjoint-fvs}, and introduce a new branch-and-search measure. The process effectively reduces a given graph to a graph on which {\sc disjoint-fvs} becomes polynomial-time solvable, and the new measure more accurately evaluates the efficiency of the process. These algorithmic and combinatorial studies enable us to develop an O(3.83k)O^*(3.83^k)-time parameterized algorithm for the general {\sc fvs} problem, improving all previous algorithms for the problem.Comment: Final version, to appear in Algorithmic

    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

    The roles of apex dipoles and field penetration in the physics of charged, field emitting, single-walled carbon nanotubes

    Get PDF
    A 1 μm long, field emitting, (5, 5) single-walled carbon nanotube (SWCNT) closed with a fullerene cap, and a similar open nanotube with hydrogen-atom termination, have been simulated using the modified neglect of diatomic overlap quantum-mechanical method. Both contain about 80 000 atoms. It is found that field penetration and band bending, and various forms of chemically and electrically induced apex dipole play roles. Field penetration may help explain electroluminescence associated with field emitting CNTs. Charge-density oscillations, induced by the hydrogen adsorption, are also found. Many of the effects can be related to known effects that occur with metallic or semiconductor field emitters; this helps both to explain the effects and to unify our knowledge about FE emitters. However, it is currently unclear how best to treat correlation-and-exchange effects when defining the CNT emission barrier. A new form of definition for the field enhancement factor (FEF) is used. Predicted FEF values for these SWCNTs are significantly less than values predicted by simple classical formulae. The FEF for the closed SWCNT decreases with applied field; the FEF for the H-terminated open SWCNT is less than the FEF for the closed SWCNT but increases with applied field. Physical explanations for this behavior are proposed but the concept of FEF is clearly problematical for CNTs. Curved Fowler-Nordheim plots are predicted. Overall, the predicted field emission performance of the H-terminated open SWCNT is slightly better than that of the closed SWCNT, essentially because a C-H dipole is formed that reduces the height of the tunneling barrier. In general, the physics of a charged SWCNT seems much more complex than hitherto realized. © 2008 American Institute of Physics.published_or_final_versio

    Glueball masses in the large N limit

    Full text link
    The lowest-lying glueball masses are computed in SU(NN) gauge theory on a spacetime lattice for constant value of the lattice spacing aa and for NN ranging from 3 to 8. The lattice spacing is fixed using the deconfinement temperature at temporal extension of the lattice NT=6N_T = 6. The calculation is conducted employing in each channel a variational ansatz performed on a large basis of operators that includes also torelon and (for the lightest states) scattering trial functions. This basis is constructed using an automatic algorithm that allows us to build operators of any size and shape in any irreducible representation of the cubic group. A good signal is extracted for the ground state and the first excitation in several symmetry channels. It is shown that all the observed states are well described by their large NN values, with modest O(1/N2){\cal O}(1/N^2) corrections. In addition spurious states are identified that couple to torelon and scattering operators. As a byproduct of our calculation, the critical couplings for the deconfinement phase transition for N=5 and N=7 and temporal extension of the lattice NT=6N_T=6 are determined.Comment: 1+36 pages, 22 tables, 21 figures. Typos corrected, conclusions unchanged, matches the published versio

    Characterization of low pathogenic H5 subtype influenza viruses from Eurasia: Implications for the origin of highly pathogenic H5N1 viruses

    Get PDF
    Oral Presentations - Genetic and Antigenic EvolutionHighly pathogenic avian influenza (HPAI) H5N1 viruses are now endemic in many Asian countries. The immediate precursor of these HPAI viruses was recognized as A/Goose/Guangdong/1/96 (Gs/Gd)-like H5N1 HPAI viruses first detected in Guangdong in 1996. However, precursors of the Gs/GD-like viruses and their subsequent reassortants have not been fully determined. Here we characterize low pathogenic avian influenza (LPAI) H5 subtype viruses isolated from poultry and migratory birds in southern China and Europe from the 1970s to the 2000s. Phylogenetic analyses revealed that Gs/GD-like virus was likely derived from an LPAI H5 virus in migratory birds. However, its variants arose from multiple reassortments between Gs/GD-like virus and viruses from migratory birds, or with those Eurasian viruses isolated in the 1970s. It is of note that unlike HPAI H5N1 viruses, those recent LPAI H5 viruses have not become established in aquatic or terrestrial poultry. Phylogenetic analyses revealed the dynamic nature of the influenza gene pool in Eurasia with repeated transmissions between the eastern and western extremities of the continent. The data also shows reassortment between influenza viruses from domestic and migratory birds in this region that has contributed to the expanded diversity of the influenza gene pool among poultry in Eurasia ...postprin

    On the Interface Formation Model for Dynamic Triple Lines

    Full text link
    This paper revisits the theory of Y. Shikhmurzaev on forming interfaces as a continuum thermodynamical model for dynamic triple lines. We start with the derivation of the balances for mass, momentum, energy and entropy in a three-phase fluid system with full interfacial physics, including a brief review of the relevant transport theorems on interfaces and triple lines. Employing the entropy principle in the form given in [Bothe & Dreyer, Acta Mechanica, doi:10.1007/s00707-014-1275-1] but extended to this more general case, we arrive at the entropy production and perform a linear closure, except for a nonlinear closure for the sorption processes. Specialized to the isothermal case, we obtain a thermodynamically consistent mathematical model for dynamic triple lines and show that the total available energy is a strict Lyapunov function for this system

    Parameterized Edge Hamiltonicity

    Full text link
    We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al. by showing that Edge Hamiltonian Path is FPT parameterized by vertex cover, and that it also admits a cubic kernel. We then show fixed-parameter tractability even for a generalization of the problem to arbitrary hypergraphs, parameterized by the size of a (supplied) hitting set. We also consider the problem parameterized by treewidth or clique-width. Surprisingly, we show that the problem is FPT for both of these standard parameters, in contrast to its vertex version, which is W-hard for clique-width. Our technique, which may be of independent interest, relies on a structural characterization of clique-width in terms of treewidth and complete bipartite subgraphs due to Gurski and Wanke
    corecore