216,427 Hits in 2.6 sec

Chern-Simons number diffusion with hard thermal loops

Guy D. Moore, Chaoran Hu, Berndt Müller
1998 Physical Review D, Particles and fields  
Then we use the extended system to study the diffusion constant for Chern-Simons number.  ...  We argue that this will correctly reproduce the "hard thermal loop" effects of hard degrees of freedom, while giving a local implementation which is numerically tractable.  ...  Diffusion of Chern-Simons number An outstanding question which the method developed here can answer is; what is the diffusion constant for Chern-Simons number N CS in the symmetric electroweak phase, or  ... 
doi:10.1103/physrevd.58.045001 fatcat:i3zwdpt2o5h63lxx2ap3ibxvwe

Hard Thermal Loops, Chern-Simons Theory and the Quark-Gluon Plasma [article]

1994 arXiv   pre-print
I review how this functional is related to the eikonal for a Chern-Simons theory, and using an auxiliary field, to the gauged WZNW-action.  ...  The generating functional for hard thermal loops in QCD is important in setting up a resummed perturbation theory.  ...  (10) , is thus the eikonal of the Chern-Simons theory. (The wave function of the Chern-Simons theory will be Ψ ∼ e iI ; cf. the lectures by R.Jackiw.)  ... 
arXiv:hep-th/9403145v1 fatcat:lhmcmu43prd4nes3zmlm62smxm

Chern-Simons number diffusion and hard thermal loops on the lattice

D. Bödeker, Guy D. Moore, K. Rummukainen
2000 Physical Review D, Particles and fields  
We develop a discrete lattice implementation of the hard thermal loop effective action by the method of added auxiliary fields.  ...  the hard thermal loops.  ...  Measuring the Chern-Simons number diffusion The baryon number violation rate is related to the diffusion of the Chern-Simons number, defined as the charge associated with the right-hand side of the anomaly  ... 
doi:10.1103/physrevd.61.056003 fatcat:qni6fe4v3fdmlnf57auaxp2dyu

In the Kingdom of the Shadows: A Companion to Early Cinema Colin Harding Simon Popple

Martin Sopocy
1998 Film quarterly  
Eric Smoodin Harding, Colin, and Simon Popple, eds. In the Kingdom of the Shadows: A Companion to Early Cinema. Cygnus Arts/Fairleigh Dickenson University Press, 1997. $55.00.  ...  Eric SmoodinHarding, Colin, and Simon Popple, eds. In the Kingdom of the Shadows: A Companion to Early Cinema. Cygnus Arts/Fairleigh Dickenson University Press, 1997. $55.00.  ... 
doi:10.2307/1213413 fatcat:kvsidhwl25cjzohxmfrpcguobu

Soft Pion Emission in Hard Exclusive Pion Production [article]

Maxim V. Polyakov, Simone Stratmann
2006 arXiv   pre-print
We investigate hard exclusive reactions on the nucleon with soft pion emission.  ...  Some observables for the process of hard charged pion production on the proton with soft pion emission are computed.  ... 
arXiv:hep-ph/0609045v1 fatcat:wpg6ivta4bar5nom22tmlnfiqy

Amalgamation is PSPACE-hard [article]

Manuel Bodirsky and Simon Knäuer and Jakub Rydval
2021 arXiv   pre-print
We prove that the computational problem whether a given universal sentence Φ has the amalgamation property is PSPACE-hard, even if Φ is additionally Horn and the signature of Φ only contains relation symbols  ...  PSPACE-hardness of the AP In this section we prove that the problem of deciding whether the class of all finite models of a given universal Horn sentence Φ has the amalgamation property is PSPACE-hard.  ...  We prove the PSPACE-hardness of this problem (Theorem 2) even if all the symbols in the signature have arity at most three. The following questions remain open.  ... 
arXiv:2108.00452v2 fatcat:gxjhpolynnawplvflpvzhkxq34

Driving a Hard Bargain with Diamond Qubits

Simon Benjamin, Jason Smith
2011 Physics  
NV centers also benefit from the extreme hardness of diamond, which corresponds to an unusual phonon spectrum and thus allows certain quantum properties to persist, even at room temperature.  ...  About the Authors Simon C. Benjamin Simon Benjamin is the Senior Fellow in Quantum Materials in the Department of Materials at the University of Oxford.  ...  NV centers also benefit from the extreme hardness of diamond, which corresponds to an unusual phonon spectrum and thus allows certain quantum properties to persist, even at room temperature.  ... 
doi:10.1103/physics.4.78 fatcat:brore3ogfrdtjeiuzoxvovnvcq

Brexit: Challenges for Universities in Hard Times

Simon Marginson
2017 International Higher Education  
Brexit: Challenges for Universities in Hard Times Simon Marginson Simon Marginson is professor of International Higher Education, Institute of Education, University College London, and director, ESRC  ...  A "hard Brexit" directly undermines the UK finance sector in the City of London, the strongest British industry and one of two domains where the United Kingdom is a clear global leader.  ... 
doi:10.6017/ihe.2017.88.9682 fatcat:u2xscnqphbg27pdonyxkm4p2ca

Hardness of Network Satisfaction for Relation Algebras with Normal Representations [article]

Manuel Bodirsky, Simon Knäuer
2020 arXiv   pre-print
If B contains a non-trivial equivalence relation with a finite number of equivalence classes, then the network satisfaction problem for A is NP-hard.  ...  As a second result, we prove hardness if B has domain size at least three and contains no non-trivial equivalence relations but a symmetric atom a with a forbidden triple (a,a,a), that is, a ≰a ∘ a.  ...  Both of our hardness proofs come from the technique of factoring Pol(B) with respect to a congruence with finitely many classes, and using known hardness conditions from corresponding finite-domain constraint  ... 
arXiv:1912.08482v2 fatcat:z7gpd5ppxngydfsx2ns7rwg2wi

Generic Expression Hardness Results for Primitive Positive Formula Comparison [article]

Simone Bova and Hubie Chen and Matthew Valeriote
2012 arXiv   pre-print
We present two generic hardness results for the studied problems, and discuss evidence that they are optimal and yield, for each of the problems, a complexity trichotomy.  ...  For a complexity class C, we say that the problem PPEQ(A) is C-hard if PPEQ(A) contains a problem PPEQ(B) that is C-hard. We define C-hardness similarly for PPCON(A). Proof .  ...  In this paper, we present two general expression hardness results on the problems of interest.  ... 
arXiv:1205.5745v1 fatcat:awy4jocw5rh5tnfehgxfmzv5yq

Polynomial space hardness without disjunction property

Simone Bova, Franco Montagna
2013 Theoretical Computer Science  
logics lacking the disjunction property have a PSPACE-hard tautology problem.  ...  In [HT11], Horčík and Terui show that if a substructural logic enjoys the disjunction property, then its tautology problem is PSPACE-hard.  ...  Then the equational theory of V is PSPACE-hard. Proof . Let V be a variety such that HW ⊆ V ⊆ CIBGBL.  ... 
doi:10.1016/j.tcs.2012.08.025 fatcat:m5mqi2r3ereibdg6xgqjhldka4

Iterative Hard Thresholding for Low-Rank Recovery from Rank-One Projections [article]

Simon Foucart, Srinivas Subramanian
2018 arXiv   pre-print
The algorithm, a variation on the iterative hard thresholding algorithm for low-rank recovery, is designed to succeed in situations where the standard rank-restricted isometry property fails, e.g. in case  ...  hard thresholding with default parameters and with parameters s = r and t = 2r.  ...  The largest value t can take is N = min{N 1 , N 2 }, in which case the hard thresholding operator does not do anything.  ... 
arXiv:1810.11749v1 fatcat:koci2qvwhbfs3lvehgezujcvl4

Magnetic Resonance Imaging of Hard Tissues and Hard Tissue Engineered Bio-substitutes

Simone Mastrogiacomo, Weiqiang Dou, John A. Jansen, X. Frank Walboomers
2019 Molecular Imaging and Biology  
In addition, a section dedicated to MR imaging of novel biomaterials developed for hard tissue applications was given as well.  ...  Within this article, MRI techniques developed for the detection of hard tissues, such as bone and dental tissues, have been reviewed.  ...  Anatomical Considerations on Hard Tissues Hard tissues comprise all the tissues that show a mineralized component in their extracellular matrix, such as bone and teeth.  ... 
doi:10.1007/s11307-019-01345-2 pmid:30989438 fatcat:2s5vy4iu5ncp7ffs3roixnac3y

Optimization of lattice surgery is NP-hard

Daniel Herr, Franco Nori, Simon J. Devitt
2017 npj Quantum Information  
to a circuit with the lowest resource requirements in terms of physical qubits and computational time, and prove that the complexity of optimizing a quantum circuit in the lattice surgery model is NP-hard  ...  In complexity theory, problems are divided into categories, which determine their hardness.  ...  The proof whether theoretical optimality is reachable implies that the optimization problem itself is NP-hard.  ... 
doi:10.1038/s41534-017-0035-1 fatcat:xwi55yhn2rcazeqd44to5imw7u

Hard hits of distress

Wendy Dean, Simon G. Talbot
2020 Journal of Pediatric Rehabilitation Medicine  
doi:10.3233/prm-200017 pmid:32176672 fatcat:fuinrrxmtvbj5chdi3mj3ywcsq
« Previous Showing results 1 — 15 out of 216,427 results