Shaping electron wave functions in a carbon nanotube with a parallel magnetic field

A magnetic field, through its vector potential, usually causes measurable changes in the electron wave function only in the direction transverse to the field. Here we demonstrate experimentally and theoretically that in carbon nanotube quantum dots, combining cylindrical topology and bipartite hexagonal lattice, a magnetic field along the nanotube axis impacts also the longitudinal profile of the electronic states. With the high (up to 17T) magnetic fields in our experiment the wave functions can be tuned all the way from "half-wave resonator" shape, with nodes at both ends, to "quarter-wave resonator" shape, with an antinode at one end. This in turn causes a distinct dependence of the conductance on the magnetic field. Our results demonstrate a new strategy for the control of wave functions using magnetic fields in quantum systems with nontrivial lattice and topology.Comment: 5 figure

Pseudovector vs. pseudoscalar coupling in one-boson exchange NN potentials

We examine the effects of pseudoscalar and pseudovector coupling of the pi and eta mesons in one-boson exchange models of the NN interaction using two approaches: time-ordered perturbation theory unitarized with the relativistic Lippmann-Schwinger equation, and a reduced Bethe-Salpeter equation approach using the Thompson equation. Contact terms in the one-boson exchange amplitudes in time-ordered perturbation theory lead naturally to the introduction of s-channel nucleonic cutoffs for the interaction, which strongly suppresses the far off-shell behavior of the amplitudes in both approaches. Differences between the resulting NN predictions of the various models are found to be small, and particularly so when coupling constants of the other mesons are readjusted within reasonable limits.Comment: 24 pages, 4 figure

Institutions as constraints and resources: explaining cross-national divergence in performance management

This article compares performance management practices in call centres from four telecommunications firms in the UK, France, Denmark, and Germany. Findings show that different combinations of institutional constraints, such as strong job security protections, and participation resources supporting worker voice were influential in shaping choices among HRM policies to motivate and discipline workers. Performance management most closely approached a high involvement model where both constraints and resources were high: where worker representatives were able both to restrict management’s use of sanctions and to establish procedures that improved the perceived fairness of incentives. Findings contribute to debates concerning the role of contextual factors in the design and effectiveness of HRM

Comment on the letter of the Society of Vertebrate Paleontology (SVP) dated April 21, 2020 regarding 'Fossils from conflict zones and reproducibility of fossil‑based scientific data': Myanmar amber

Recently, the Society of Vertebrate Paleontology (SVP) has sent around a letter, dated 21st April, 2020 to more than 300 palaeontological journals, signed by the President, Vice President and a former President of the society (Rayfield et al. 2020). The signatories of this letter request significant changes to the common practices in palaeontology. With our present, multi-authored comment, we aim to argue why these suggestions will not lead to improvement of both practice and ethics of palaeontological research but, conversely, hamper its further development. Although we disagree with most contents of the SVP letter, we appreciate this initiative to discuss scientific practices and the underlying ethics. Here, we consider different aspects of the suggestions by Rayfield et al. (2020) in which we see weaknesses and dangers. It is our intent to compile views from many different fields of palaeontology, as our discipline is (and should remain) pluralistic. This contribution deals with the aspects concerning Myanmar amber. Reference is made to Haug et al. (2020a) for another comment on aspects concerning amateur palaeontologists/citizen scientists/private collectors

Comment on the letter of the Society of Vertebrate Paleontology (SVP) dated April 21, 2020 regarding “Fossils from conflict zones and reproducibility of fossil‑based scientific data”: Myanmar amber

Non peer reviewe

Qualitative modelling via constraint programming

Qualitative modelling is a technique integrating the fields of theoretical computer science, artificial intelligence and the physical and biological sciences. The aim is to be able to model the behaviour of systems without estimating parameter values and fixing the exact quantitative dynamics. Traditional applications are the study of the dynamics of physical and biological systems at a higher level of abstraction than that obtained by estimation of numerical parameter values for a fixed quantitative model. Qualitative modelling has been studied and implemented to varying degrees of sophistication in Petri nets, process calculi and constraint programming. In this paper we reflect on the strengths and weaknesses of existing frameworks, we demonstrate how recent advances in constraint programming can be leveraged to produce high quality qualitative models, and we describe the advances in theory and technology that would be needed to make constraint programming the best option for scientific investigation in the broadest sense

Sequential and parallel solution-biased search for subgraph algorithms

Funding: This work was supported by the Engineering and Physical Sciences Research Council (grant numbers EP/P026842/1, EP/M508056/1, and EP/N007565).The current state of the art in subgraph isomorphism solving involves using degree as a value-ordering heuristic to direct backtracking search. Such a search makes a heavy commitment to the first branching choice, which is often incorrect. To mitigate this, we introduce and evaluate a new approach, which we call “solution-biased search”. By combining a slightly-random value-ordering heuristic, rapid restarts, and nogood recording, we design an algorithm which instead uses degree to direct the proportion of search effort spent in different subproblems. This increases performance by two orders of magnitude on satisfiable instances, whilst not affecting performance on unsatisfiable instances. This algorithm can also be parallelised in a very simple but effective way: across both satisfiable and unsatisfiable instances, we get a further speedup of over thirty from thirty-six cores, and over one hundred from ten distributed-memory hosts. Finally, we show that solution-biased search is also suitable for optimisation problems, by using it to improve two maximum common induced subgraph algorithms.Postprin