20,993 research outputs found

    Modifying the pom-pom model for extensional viscosity overshoots

    Get PDF
    We have developed a variant of the pom-pom model that qualitatively describes two surprising features recently observed in filament stretching rheometer experiments of uniaxial extensional flow of industrial branched polymer resins: (i) Overshoots of the transient stress during steady flow and (ii) strongly accelerated stress relaxation upon cessation of the flow beyond the overshoot. Within the context of our model, these overshoots originate from entanglement stripping (ES) during the processes of normal chain retraction and branch point withdrawal. We demonstrate that, for a single mode, the predictions of our overshoot model are qualitatively consistent with experimental data. To provide a quantitative fit, we represent an industrial melt by a superposition of several individual modes. We show that a minimal version of our model, in which ES due to normal chain retraction is omitted, can provide a reasonable, but not perfect, fit to the data. With regard the stress relaxation after (kinematically) steady flow, we demonstrate that the differential version of tube orientation dynamics in the original pom-pom model performs anomalously. We discuss the reasons for this and suggest a suitable alternative

    Manipulation Strategies for the Rank Maximal Matching Problem

    Full text link
    We consider manipulation strategies for the rank-maximal matching problem. In the rank-maximal matching problem we are given a bipartite graph G=(AâˆȘP,E)G = (A \cup P, E) such that AA denotes a set of applicants and PP a set of posts. Each applicant a∈Aa \in A has a preference list over the set of his neighbours in GG, possibly involving ties. Preference lists are represented by ranks on the edges - an edge (a,p)(a,p) has rank ii, denoted as rank(a,p)=irank(a,p)=i, if post pp belongs to one of aa's ii-th choices. A rank-maximal matching is one in which the maximum number of applicants is matched to their rank one posts and subject to this condition, the maximum number of applicants is matched to their rank two posts, and so on. A rank-maximal matching can be computed in O(min⁥(cn,n)m)O(\min(c \sqrt{n},n) m) time, where nn denotes the number of applicants, mm the number of edges and cc the maximum rank of an edge in an optimal solution. A central authority matches applicants to posts. It does so using one of the rank-maximal matchings. Since there may be more than one rank- maximal matching of GG, we assume that the central authority chooses any one of them randomly. Let a1a_1 be a manipulative applicant, who knows the preference lists of all the other applicants and wants to falsify his preference list so that he has a chance of getting better posts than if he were truthful. In the first problem addressed in this paper the manipulative applicant a1a_1 wants to ensure that he is never matched to any post worse than the most preferred among those of rank greater than one and obtainable when he is truthful. In the second problem the manipulator wants to construct such a preference list that the worst post he can become matched to by the central authority is best possible or in other words, a1a_1 wants to minimize the maximal rank of a post he can become matched to

    Popular matchings with two-sided preferences and one-sided ties

    Full text link
    We are given a bipartite graph G=(AâˆȘB,E)G = (A \cup B, E) where each vertex has a preference list ranking its neighbors: in particular, every a∈Aa \in A ranks its neighbors in a strict order of preference, whereas the preference lists of b∈Bb \in B may contain ties. A matching MM is popular if there is no matching Mâ€ČM' such that the number of vertices that prefer Mâ€ČM' to MM exceeds the number of vertices that prefer MM to~Mâ€ČM'. We show that the problem of deciding whether GG admits a popular matching or not is NP-hard. This is the case even when every b∈Bb \in B either has a strict preference list or puts all its neighbors into a single tie. In contrast, we show that the problem becomes polynomially solvable in the case when each b∈Bb \in B puts all its neighbors into a single tie. That is, all neighbors of bb are tied in bb's list and bb desires to be matched to any of them. Our main result is an O(n2)O(n^2) algorithm (where n=∣AâˆȘB∣n = |A \cup B|) for the popular matching problem in this model. Note that this model is quite different from the model where vertices in BB have no preferences and do not care whether they are matched or not.Comment: A shortened version of this paper has appeared at ICALP 201

    Quantum gravitational contributions to quantum electrodynamics

    Full text link
    Quantum electrodynamics describes the interactions of electrons and photons. Electric charge (the gauge coupling constant) is energy dependent, and there is a previous claim that charge is affected by gravity (described by general relativity) with the implication that the charge is reduced at high energies. But that claim has been very controversial with the situation inconclusive. Here I report an analysis (free from earlier controversies) demonstrating that that quantum gravity corrections to quantum electrodynamics have a quadratic energy dependence that result in the reduction of the electric charge at high energies, a result known as asymptotic freedom.Comment: To be published in Nature. 19 pages LaTeX, no figure

    Nickel-catalyzed cocyclotrimerization of oxa- and azabenzonorbornadienes with alkynes: reaction with multiple synthetic applications

    Get PDF
    [[abstract]]Oxa- and azabenzonorbornadienes react with alkynes in the presence of nickel complexes to give the corresponding [2 + 2 + 2] cycloadducts; these reactions can be applied to the construction of multiple fused rings, the preparation of precursors of isobenzofurans and isoindoles and aromatic compounds.[[fileno]]2010326010022[[department]]挖歾

    Ultrasensitive force and displacement detection using trapped ions

    Full text link
    The ability to detect extremely small forces is vital for a variety of disciplines including precision spin-resonance imaging, microscopy, and tests of fundamental physical phenomena. Current force-detection sensitivity limits have surpassed 1 aN/HzaN/\sqrt{Hz} (atto =10−18=10^{-18}) through coupling of micro or nanofabricated mechanical resonators to a variety of physical systems including single-electron transistors, superconducting microwave cavities, and individual spins. These experiments have allowed for probing studies of a variety of phenomena, but sensitivity requirements are ever-increasing as new regimes of physical interactions are considered. Here we show that trapped atomic ions are exquisitely sensitive force detectors, with a measured sensitivity more than three orders of magnitude better than existing reports. We demonstrate detection of forces as small as 174 yNyN (yocto =10−24=10^{-24}), with a sensitivity 390±150\pm150 yN/HzyN/\sqrt{Hz} using crystals of n=60n=60 9^{9}Be+^{+} ions in a Penning trap. Our technique is based on the excitation of normal motional modes in an ion trap by externally applied electric fields, detection via and phase-coherent Doppler velocimetry, which allows for the discrimination of ion motion with amplitudes on the scale of nanometers. These experimental results and extracted force-detection sensitivities in the single-ion limit validate proposals suggesting that trapped atomic ions are capable of detecting of forces with sensitivity approaching 1 yN/HzyN/\sqrt{Hz}. We anticipate that this demonstration will be strongly motivational for the development of a new class of deployable trapped-ion-based sensors, and will permit scientists to access new regimes in materials science.Comment: Expanded introduction and analysis. Methods section added. Subject to press embarg

    Electronic measurement and control of spin transport in Silicon

    Full text link
    The electron spin lifetime and diffusion length are transport parameters that define the scale of coherence in spintronic devices and circuits. Since these parameters are many orders of magnitude larger in semiconductors than in metals, semiconductors could be the most suitable for spintronics. Thus far, spin transport has only been measured in direct-bandgap semiconductors or in combination with magnetic semiconductors, excluding a wide range of non-magnetic semiconductors with indirect bandgaps. Most notable in this group is silicon (Si), which (in addition to its market entrenchment in electronics) has long been predicted a superior semiconductor for spintronics with enhanced lifetime and diffusion length due to low spin-orbit scattering and lattice inversion symmetry. Despite its exciting promise, a demonstration of coherent spin transport in Si has remained elusive, because most experiments focused on magnetoresistive devices; these methods fail because of universal impedance mismatch obstacles, and are obscured by Lorentz magnetoresistance and Hall effects. Here we demonstrate conduction band spin transport across 10 microns undoped Si, by using spin-dependent ballistic hot-electron filtering through ferromagnetic thin films for both spin-injection and detection. Not based on magnetoresistance, the hot electron spin-injection and detection avoids impedance mismatch issues and prevents interference from parasitic effects. The clean collector current thus shows independent magnetic and electrical control of spin precession and confirms spin coherent drift in the conduction band of silicon.Comment: Single PDF file with 4 Figure

    Surveying adjustment datum and relative deformation accuracy analysis

    Get PDF
    In the surveying adjustment, unknown parameters are usually not direct observations, but the elements related to these direct observations. In order to determine the unknown parameters adequate known data should be provided, and these necessarily required known data are used to form the adjustment datum. Under different datums, different results will be obtained even with the same direct observations. However, in the practical adjustment calculation, the datum and its effect on the results are always ignored. In this paper, the adjustment datum is firstly discussed and defined as datum equations. Then an adjustment method based on the datum equations and least squares is presented. This method is a generic one, not only suited for the case in an ordinary datum but also in the gravity centre datum or a quasi-datum, and can be easily used to analyse different deformations. Based on this method, the transformation between different reference frames is derived. It shows that the calculation results, deformation and positioning accuracy under one kind of datum are relative and generic. A case study is further introduced and used to test this new method. Based on the case study, the conclusions are reached. It is found that the relative positional root mean square error of each point becomes bigger as the distance between the point and the datum increases, and the relative deformation offsets under different kinds of datum are helpful for reliable deformation analysis
    • 

    corecore