489 research outputs found

    Reconfiguring Independent Sets in Claw-Free Graphs

    Get PDF
    We present a polynomial-time algorithm that, given two independent sets in a claw-free graph GG, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex vv from the current independent set SS and to add a new vertex ww (not in SS) such that the result is again an independent set. We also consider the more restricted model where vv and ww have to be adjacent

    Potential for measurement of the tensor magnetic polarizability of the deuteron in storage ring experiments

    Full text link
    General formulas describing deuteron spin dynamics in storage rings with allowance for the tensor electric and magnetic polarizabilities are derived. It is found that an initially tensor-polarized deuteron beam can acquire a final horizontal vector polarization of the order of 1%. This effect allows one to measure the tensor magnetic polarizability of the deuteron in storage ring experiments. We also confirm an existence of the effect found by Baryshevsky and Gurinovich, hep-ph/0506135 and Baryshevsky, hep-ph/0510158; hep-ph/0603191 that the tensor magnetic polarizability of the deuteron causes the spin rotation with two frequencies and experiences beating for polarized deuteron beams in storage rings.Comment: Corrected text, 8 page

    Independent Set Reconfiguration in Cographs

    Get PDF
    We study the following independent set reconfiguration problem, called TAR-Reachability: given two independent sets II and JJ of a graph GG, both of size at least kk, is it possible to transform II into JJ by adding and removing vertices one-by-one, while maintaining an independent set of size at least kk throughout? This problem is known to be PSPACE-hard in general. For the case that GG is a cograph (i.e. P4P_4-free graph) on nn vertices, we show that it can be solved in time O(n2)O(n^2), and that the length of a shortest reconfiguration sequence from II to JJ is bounded by 4n2k4n-2k, if such a sequence exists. More generally, we show that if XX is a graph class for which (i) TAR-Reachability can be solved efficiently, (ii) maximum independent sets can be computed efficiently, and which satisfies a certain additional property, then the problem can be solved efficiently for any graph that can be obtained from a collection of graphs in XX using disjoint union and complete join operations. Chordal graphs are given as an example of such a class XX

    Feedback Systems for Linear Colliders

    Get PDF
    Feedback systems are essential for stable operation of a linear collider, providing a cost-effective method for relaxing tight tolerances. In the Stanford Linear Collider (SLC), feedback controls beam parameters such as trajectory, energy, and intensity throughout the accelerator. A novel dithering optimization system which adjusts final focus parameters to maximize luminosity contributed to achieving record performance in the 1997-98 run. Performance limitations of the steering feedback have been investigated, and improvements have been made. For the Next Linear Collider (NLC), extensive feedback systems are planned as an intregal part of the design. Feedback requiremetns for JLC (the Japanese Linear Collider) are essentially identical to NLC; some of the TESLA requirements are similar but there are significant differences. For NLC, algorithms which incorporate improvements upon the SLC implementation are being prototyped. Specialized systems for the damping rings, rf and interaction point will operate at high bandwidth and fast response. To correct for the motion of individual bunches within a train, both feedforward and feedback systems are planned. SLC experience has shown that feedback systems are an invaluable operational tool for decoupling systems, allowing precision tuning, and providing pulse-to-pulse diagnostics. Feedback systems for the NLC will incorporate the key SLC features and the benefits of advancing technologies.Comment: Invited talk presented at IEEE Particle Accelerator Conference (PAC99

    School-based curriculum development in Scotland: Curriculum policy and enactment

    Get PDF
    Recent worldwide trends in curriculum policy have re-emphasised the role of teachers in school-based curriculum development. Scotland’s Curriculum for Excellence is typical of these trends, stressing that teachers are agents of change. This paper draws upon empirical data to explore school-based curriculum development in response to Curriculum for Excellence. We focus on two case studies – secondary schools within a single Scottish local education authority. In the paper we argue that the nature and extent of innovation in schools is dependent upon teachers being able to make sense of often complex and confusing curriculum policy, including the articulation of a clear vision about what such policy means for education within each school

    Semilinear mixed problems on Hilbert complexes and their numerical approximation

    Full text link
    Arnold, Falk, and Winther recently showed [Bull. Amer. Math. Soc. 47 (2010), 281-354] that linear, mixed variational problems, and their numerical approximation by mixed finite element methods, can be studied using the powerful, abstract language of Hilbert complexes. In another recent article [arXiv:1005.4455], we extended the Arnold-Falk-Winther framework by analyzing variational crimes (a la Strang) on Hilbert complexes. In particular, this gave a treatment of finite element exterior calculus on manifolds, generalizing techniques from surface finite element methods and recovering earlier a priori estimates for the Laplace-Beltrami operator on 2- and 3-surfaces, due to Dziuk [Lecture Notes in Math., vol. 1357 (1988), 142-155] and later Demlow [SIAM J. Numer. Anal., 47 (2009), 805-827], as special cases. In the present article, we extend the Hilbert complex framework in a second distinct direction: to the study of semilinear mixed problems. We do this, first, by introducing an operator-theoretic reformulation of the linear mixed problem, so that the semilinear problem can be expressed as an abstract Hammerstein equation. This allows us to obtain, for semilinear problems, a priori solution estimates and error estimates that reduce to the Arnold-Falk-Winther results in the linear case. We also consider the impact of variational crimes, extending the results of our previous article to these semilinear problems. As an immediate application, this new framework allows for mixed finite element methods to be applied to semilinear problems on surfaces.Comment: 22 pages; v2: major revision, particularly sharpening of error estimates in Section

    Consumer credit in comparative perspective

    Full text link
    We review the literature in sociology and related fields on the fast global growth of consumer credit and debt and the possible explanations for this expansion. We describe the ways people interact with the strongly segmented consumer credit system around the world—more specifically, the way they access credit and the way they are held accountable for their debt. We then report on research on two areas in which consumer credit is consequential: its effects on social relations and on physical and mental health. Throughout the article, we point out national variations and discuss explanations for these differences. We conclude with a brief discussion of the future tasks and challenges of comparative research on consumer credit.Accepted manuscrip
    corecore