Nuclear-spin relaxation of 207^{207}Pb in ferroelectric powders

Motivated by a recent proposal by O. P. Sushkov and co-workers to search for a P,T-violating Schiff moment of the $^{207}$Pb nucleus in a ferroelectric solid, we have carried out a high-field nuclear magnetic resonance study of the longitudinal and transverse spin relaxation of the lead nuclei from room temperature down to 10 K for powder samples of lead titanate (PT), lead zirconium titanate (PZT), and a PT monocrystal. For all powder samples and independently of temperature, transverse relaxation times were found to be $T_2\approx 1.5$ms, while the longitudinal relaxation times exhibited a temperature dependence, with $T_1$ of over an hour at the lowest temperatures, decreasing to $T_1\approx 7$s at room temperature. At high temperatures, the observed behavior is consistent with a two-phonon Raman process, while in the low temperature limit, the relaxation appears to be dominated by a single-phonon (direct) process involving magnetic impurities. This is the first study of temperature-dependent nuclear-spin relaxation in PT and PZT ferroelectrics at such low temperatures. We discuss the implications of the results for the Schiff-moment search.Comment: 6 pages, 4 figure

Does Scientific Progress Consist in Increasing Knowledge or Understanding?

Bird argues that scientific progress consists in increasing knowledge. Dellsén objects that increasing knowledge is neither necessary nor sufficient for scientific progress, and argues that scientific progress rather consists in increasing understanding. Dellsén also contends that unlike Bird’s view, his view can account for the scientific practices of using idealizations and of choosing simple theories over complex ones. I argue that Dellsén’s criticisms against Bird’s view fail, and that increasing understanding cannot account for scientific progress, if acceptance, as opposed to belief, is required for scientific understanding

Localization Recall Precision (LRP): A New Performance Metric for Object Detection

Average precision (AP), the area under the recall-precision (RP) curve, is the standard performance measure for object detection. Despite its wide acceptance, it has a number of shortcomings, the most important of which are (i) the inability to distinguish very different RP curves, and (ii) the lack of directly measuring bounding box localization accuracy. In this paper, we propose 'Localization Recall Precision (LRP) Error', a new metric which we specifically designed for object detection. LRP Error is composed of three components related to localization, false negative (FN) rate and false positive (FP) rate. Based on LRP, we introduce the 'Optimal LRP', the minimum achievable LRP error representing the best achievable configuration of the detector in terms of recall-precision and the tightness of the boxes. In contrast to AP, which considers precisions over the entire recall domain, Optimal LRP determines the 'best' confidence score threshold for a class, which balances the trade-off between localization and recall-precision. In our experiments, we show that, for state-of-the-art object (SOTA) detectors, Optimal LRP provides richer and more discriminative information than AP. We also demonstrate that the best confidence score thresholds vary significantly among classes and detectors. Moreover, we present LRP results of a simple online video object detector which uses a SOTA still image object detector and show that the class-specific optimized thresholds increase the accuracy against the common approach of using a general threshold for all classes. At https://github.com/cancam/LRP we provide the source code that can compute LRP for the PASCAL VOC and MSCOCO datasets. Our source code can easily be adapted to other datasets as well.Comment: to appear in ECCV 201

Optimality program in segment and string graphs

Planar graphs are known to allow subexponential algorithms running in time $2^{O(\sqrt n)}$ or $2^{O(\sqrt n \log n)}$ for most of the paradigmatic problems, while the brute-force time $2^{\Theta(n)}$ is very likely to be asymptotically best on general graphs. Intrigued by an algorithm packing curves in $2^{O(n^{2/3}\log n)}$ by Fox and Pach [SODA'11], we investigate which problems have subexponential algorithms on the intersection graphs of curves (string graphs) or segments (segment intersection graphs) and which problems have no such algorithms under the ETH (Exponential Time Hypothesis). Among our results, we show that, quite surprisingly, 3-Coloring can also be solved in time $2^{O(n^{2/3}\log^{O(1)}n)}$ on string graphs while an algorithm running in time $2^{o(n)}$ for 4-Coloring even on axis-parallel segments (of unbounded length) would disprove the ETH. For 4-Coloring of unit segments, we show a weaker ETH lower bound of $2^{o(n^{2/3})}$ which exploits the celebrated Erd\H{o}s-Szekeres theorem. The subexponential running time also carries over to Min Feedback Vertex Set but not to Min Dominating Set and Min Independent Dominating Set.Comment: 19 pages, 15 figure

Planning and Leveraging Event Portfolios: Towards a Holistic Theory

This conceptual paper seeks to advance the discourse on the leveraging and legacies of events by examining the planning, management, and leveraging of event portfolios. This examination shifts the common focus from analyzing single events towards multiple events and purposes that can enable cross-leveraging among different events in pursuit of attainment and magnification of specific ends. The following frameworks are proposed: (1) event portfolio planning and leveraging, and (2) analyzing events networks and inter-organizational linkages. These frameworks are intended to provide, at this infancy stage of event portfolios research, a solid ground for building theory on the management of different types and scales of events within the context of a portfolio aimed to obtain, optimize and sustain tourism, as well as broader community benefits

Biology of squids

This section is. based on the data collected in the squid jigging survey made by two vessels, M.F.V. Matsya Sugandhi and M.V. Blue Fin on the southwest coast of India during the 9-month period from June 19&& to February 19&9. The data were collected onboard by the scientists of CMFRI who partici;>ated in the survey. Three species of squids were jigged during the survey, and to understand some aspects of the biology of each of these species a general idea about their distribution and Telative abundance in space and time is necessary. For this' purpose, a one-degree square where jigging was done during the period is taken as a unit area

Mechanical Study of a Superconducting 28-GHz Ion Source Magnet for FRIB

The superconducting electron cyclotron resonance (ECR) source magnet for the facility for rare isotope beams at Michigan State University was designed and built by the Superconducting Magnet Group at Lawrence Berkeley National Laboratory (LBNL) in 2017. The 28 GHz NbTi ion source magnet features a sextupole-in-solenoids configuration which is comparable to the VENUS ECR magnet operated at LBNL. However, the mechanical design of this magnet utilizes a shell-based support structure which allows fine adjustments to the sextupole preload and reversibility of the magnet assembly process. The magnet has been assembled and tested to operational currents at LBNL. This paper describes the mechanical analyses performed to estimate the sextupole's and solenoids' preloads. We will report on the 3-D finite element analysis during room temperature assembly, cool-down, and magnet excitation, and then describe the magnet preload operations. Finally, we will describe the performance of the support structure during the quench training

Transcriptional and Translational Regulatory Responses to Iron Limitation in the Globally Distributed Marine Bacterium Candidatus Pelagibacter ubique

Iron is recognized as an important micronutrient that limits microbial plankton productivity over vast regions of the oceans. We investigated the gene expression responses of Candidatus Pelagibacter ubique cultures to iron limitation in natural seawater media supplemented with a siderophore to chelate iron. Microarray data indicated transcription of the periplasmic iron binding protein sfuC increased by 16-fold, and iron transporter subunits, iron-sulfur center assembly genes, and the putative ferroxidase rubrerythrin transcripts increased to a lesser extent. Quantitative peptide mass spectrometry revealed that sfuC protein abundance increased 27-fold, despite an average decrease of 59% across the global proteome. Thus, we propose sfuC as a marker gene for indicating iron limitation in marine metatranscriptomic and metaproteomic ecological surveys. The marked proteome reduction was not directly correlated to changes in the transcriptome, implicating post-transcriptional regulatory mechanisms as modulators of protein expression. Two RNA-binding proteins, CspE and CspL, correlated well with iron availability, suggesting that they may contribute to the observed differences between the transcriptome and proteome. We propose a model in which the RNA-binding activity of CspE and CspL selectively enables protein synthesis of the iron acquisition protein SfuC during transient growth-limiting episodes of iron scarcity

Small grid embeddings of 3-polytopes

We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by $O(2^{7.55n})=O(188^{n})$. If the graph contains a triangle we can bound the integer coordinates by $O(2^{4.82n})$. If the graph contains a quadrilateral we can bound the integer coordinates by $O(2^{5.46n})$. The crucial part of the algorithm is to find a convex plane embedding whose edges can be weighted such that the sum of the weighted edges, seen as vectors, cancel at every point. It is well known that this can be guaranteed for the interior vertices by applying a technique of Tutte. We show how to extend Tutte's ideas to construct a plane embedding where the weighted vector sums cancel also on the vertices of the boundary face