cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
On maximal almost balanced non-overlapping codes and non-overlapping codes with restricted run-lengths
Creators: name: Stanovnik, Lidija
name: Moškon, Miha
name: Mraz, Miha
Publisher: name: arXiv
Year: 2024
Subjects: subject: Information Theory (cs.IT)
subject: Combinatorics (math.CO)
subject: FOS: Computer and information sciences
subject: FOS: Mathematics

description: This paper concerns non-overlapping codes, block codes motivated by synchronisation and DNA-based storage applications. Most existing constructions of these codes do not account for the restrictions posed by the physical properties of communication channels. If undesired sequences are not avoided, the system using the encoding may start behaving incorrectly. Hence, we aim to characterise all non-overlapping codes satisfying two additional constraints. For the first constraint, where approximately half of the letters in each word are positive, we derive necessary and sufficient conditions for the code's non-expandability and improve known bounds on its maximum size. We also determine exact values for the maximum sizes of polarity-balanced non-overlapping codes having small block and alphabet sizes. For the other constraint, where long sequences of consecutive equal symbols lead to undesired behaviour, we derive bounds and constructions of constrained non-overlapping codes. Moreover, we provide constructions of non-overlapping codes that satisfy both constraints and analyse the sizes of the obtained codes.
Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovasz Local Lemma
Creators: name: Harris, David G.
Publisher: name: arXiv
Year: 2016
Subjects: subject: Data Structures and Algorithms (cs.DS)
subject: Distributed, Parallel, and Cluster Computing (cs.DC)
subject: Probability (math.PR)
subject: FOS: Computer and information sciences
subject: FOS: Mathematics

description: Many randomized algorithms can be derandomized efficiently using either the method of conditional expectations or probability spaces with low (almost-) independence. A series of papers, beginning with Luby (1993) and continuing with Berger & Rompel (1991) and Chari et al. (2000), showed that these techniques can be combined to give deterministic parallel algorithms for combinatorial optimization problems involving sums of $w$-juntas. We improve these algorithms through derandomized variable partitioning and a new code construction for fooling Fourier characters over $GF(2)$. This reduces the processor complexity to essentially independent of $w$ while the running time is reduced from exponential in $w$ to linear in $w$. As a key subroutine, we give a new algorithm to generate a probability space which can fool a given set of neighborhoods. Schulman (1992) gave an NC algorithm to do so for neighborhoods of size $w \leq O(\log n)$. Our new algorithm is NC1, with essentially optimal time and processor complexity, when $w = O(\log n)$; it remains NC up to $w = \text{polylog}(n)$. This answers an open problem of Schulman. One major application of these algorithms is an NC algorithm for the Lovász Local Lemma. Previous NC algorithms, including the seminal algorithm of Moser & Tardos (2010) and the work of Chandrasekaran et. al (2013), required that (essentially) the bad-events could span only $O(\log n)$ variables; we relax this to $\text{polylog}(n)$ variables. We use this for an $\text{NC}^2$ algorithm for defective vertex coloring, which works for arbitrary degree graphs.
New bounds for the Moser-Tardos distribution
Creators: name: Harris, David G.
Publisher: name: arXiv
Year: 2016
Subjects: subject: Combinatorics (math.CO)
subject: Discrete Mathematics (cs.DM)
subject: Probability (math.PR)
subject: FOS: Mathematics
subject: FOS: Computer and information sciences

description: The Lovasz Local Lemma (LLL) is a probabilistic tool which has been used to show the existence of a variety of combinatorial structures with good "local" properties. The "LLL-distribution" can be used to show that the resulting structures have good global properties in expectation. The simplest, variable-based setting of the LLL was covered by the seminal algorithm of Moser & Tardos (2010). This has since been extended to other probability spaces including random permutations. One can similarly define an "MT-distribution" for these algorithms, that is, the distribution of the configuration they produce. Haeupler et al. (2011) showed bounds on the MT-distribution which essentially match the LLL-distribution for the variable-assignment setting; Harris & Srinivasan showed similar results for the permutation setting. In this work, we show new bounds on the MT-distribution which are significantly stronger than those known to hold for the LLL-distribution. In the variable-assignment setting, we show a tighter bound on the probability of a disjunctive event or singleton event. As a consequence, in $k$-SAT instances with bounded variable occurrence, the MT-distribution satisfies an $ε$-approximate independence condition asymptotically stronger than the LLL-distribution. We use this to show a nearly tight bound on the minimum implicate size of a CNF boolean formula. Another noteworthy application is constructing independent transversals which avoid a given subset of vertices; this provides a constructive analogue to a result of Rabern (2014). In the permutation LLL setting, we show a new type of bound which is similar to the cluster-expansion LLL criterion of Bissacot et al. (2011), but is stronger and takes advantage of the extra structure in permutations. We illustrate with improved bounds on weighted Latin transversals and partial Latin transversals.
(103162) Dorothy Edey Mary Maish
Creators: name: Professions, Victorian
Publisher: name: University of Oxford
Year: 2022
Subjects: subject: 220201 Business and Labour History
subject: FOS: Philosophy, ethics and religion
subject: History
subject: 140203 Economic History
subject: FOS: Economics and business

description: This three-year research project began in January 2014 and investigated whether, during the Victorian period, the professions formed a distinct self-sustaining social group with its own mores and values. The project looked at 16,000 individuals drawn from census data for Alnwick, Brighton, Bristol, Dundee, Greenock, Leeds, Merthyr Tydfil, Morpeth, and Winchester. The research project was funded by the UK Economic & Social Research Council and was based at the Universities of Oxford and Northumbria.
A constructive algorithm for the LLL on permutations
Creators: name: Harris, David G.
name: Srinivasan, Aravind
Publisher: name: arXiv
Year: 2016
Subjects: subject: Data Structures and Algorithms (cs.DS)
subject: Combinatorics (math.CO)
subject: FOS: Computer and information sciences
subject: FOS: Mathematics

description: While there has been significant progress on algorithmic aspects of the Lovász Local Lemma (LLL) in recent years, a noteworthy exception is when the LLL is used in the context of random permutations. The breakthrough algorithm of Moser & Tardos only works in the setting of independent variables, and does not apply in this context. We resolve this by developing a randomized polynomial-time algorithm for such applications. A noteworthy application is for Latin transversals: the best-known general result here (Bissacot et al., improving on Erdős and Spencer), states that any $n \times n$ matrix in which each entry appears at most $(27/256)n$ times, has a Latin transversal. We present the first polynomial-time algorithm to construct such a transversal. We also develop RNC algorithms for Latin transversals, rainbow Hamiltonian cycles, strong chromatic number, and hypergraph packing. In addition to efficiently finding a configuration which avoids bad-events, the algorithm of Moser & Tardos has many powerful extensions and properties. These include a well-characterized distribution on the output distribution, parallel algorithms, and a partial resampling variant. We show that our algorithm has nearly all of the same useful properties as the Moser-Tardos algorithm, and present a comparison of this aspect with recent works on the LLL in general probability spaces.
title: Unilateral Breast Edema: New Aspects of Diagnosis Using the Full Breast Ultrasonography
Creators: name: Georgescu, Aristida
Publisher: name: European Congress of Radiology
Year: 2017
Subjects: subject: Breast
subject: Oncology
subject: Lymph nodes
subject: Ultrasound-Colour Doppler
subject: Elastography
subject: Diagnostic procedure
subject: Technical aspects
subject: Cancer
subject: Oedema
subject: Inflammation

description: Learning objectives Background Findings and procedure details Conclusion Personal information References
description: Learning objectives: The knowledge of the most frequent etiologies that cause unilateral breast edema and their anatomical-sonographic appearances can aid accurate diagnosis. The benign etiologies cannot be overruled based only on the patient history, the clinical...
Supplementary document for A nonlocal Fourier modal method for analysing nonlocal plasmonic periodic nanostructures - 6209556.pdf
Creators: name: Kwiecien, Pavel
name: Burda, Milan
name: Richter, Ivan
Publisher: name: Optica Publishing Group
Year: 2023
Subjects: Uncategorized

description: The supplemental document describes the Fourier factorization, product continuity or discontinuity problem, and the S-matrix algorithm.
CamFlow: Managed Data-sharing for Cloud Services
Creators: name: Pasquier, Thomas F. J. -M.
name: Singh, Jatinder
name: Eyers, David
name: Bacon, Jean
Publisher: name: arXiv
Year: 2015
Subjects: subject: Cryptography and Security (cs.CR)
subject: Distributed, Parallel, and Cluster Computing (cs.DC)
subject: FOS: Computer and information sciences
subject: D.4.6

description: A model of cloud services is emerging whereby a few trusted providers manage the underlying hardware and communications whereas many companies build on this infrastructure to offer higher level, cloud-hosted PaaS services and/or SaaS applications. From the start, strong isolation between cloud tenants was seen to be of paramount importance, provided first by virtual machines (VM) and later by containers, which share the operating system (OS) kernel. Increasingly it is the case that applications also require facilities to effect isolation and protection of data managed by those applications. They also require flexible data sharing with other applications, often across the traditional cloud-isolation boundaries; for example, when government provides many related services for its citizens on a common platform. Similar considerations apply to the end-users of applications. But in particular, the incorporation of cloud services within `Internet of Things' architectures is driving the requirements for both protection and cross-application data sharing. These concerns relate to the management of data. Traditional access control is application and principal/role specific, applied at policy enforcement points, after which there is no subsequent control over where data flows; a crucial issue once data has left its owner's control by cloud-hosted applications and within cloud-services. Information Flow Control (IFC), in addition, offers system-wide, end-to-end, flow control based on the properties of the data. We discuss the potential of cloud-deployed IFC for enforcing owners' dataflow policy with regard to protection and sharing, as well as safeguarding against malicious or buggy software. In addition, the audit log associated with IFC provides transparency, giving configurable system-wide visibility over data flows. [...]
description: 14 pages, 8 figures
Oblivious resampling oracles and parallel algorithms for the Lopsided Lovasz Local Lemma
Creators: name: Harris, David G.
Publisher: name: arXiv
Year: 2017
Subjects: subject: Data Structures and Algorithms (cs.DS)
subject: Discrete Mathematics (cs.DM)
subject: Combinatorics (math.CO)
subject: FOS: Computer and information sciences
subject: FOS: Mathematics

description: The Lovász Local Lemma (LLL) is a probabilistic tool which shows that, if a collection of "bad" events $\mathcal B$ in a probability space are not too likely and not too interdependent, then there is a positive probability that no bad-events in $\mathcal B$ occur. Moser & Tardos (2010) gave sequential and parallel algorithms which transformed most applications of the variable-assignment LLL into efficient algorithms. A framework of Harvey & Vondrák (2015) based on "resampling oracles" extended this to general sequential algorithms for other probability spaces satisfying the Lopsided Lovász Local Lemma (LLLL). We describe a new structural property which holds for all known resampling oracles, which we call "obliviousness." Essentially, it means that the interaction between two bad-events $B, B'$ depends only on the randomness used to resample $B$, and not the precise state within $B$ itself. This property has two major consequences. First, combined with a framework of Kolmogorov (2016), it is the key to achieving a unified parallel LLLL algorithm, which is faster than previous, problem-specific algorithms of Harris (2016) for the variable-assignment LLLL algorithm and of Harris \& Srinivasan (2014) for permutations. This gives the first RNC algorithms for rainbow perfect matchings and rainbow hamiltonian cycles of $K_n$. Second, this property allows us to build LLLL probability spaces out of relatively simple "atomic" events. This provides the first sequential resampling oracle for rainbow perfect matchings on the complete $s$-uniform hypergraph $K_n^{(s)}$, and the first commutative resampling oracle for hamiltonian cycles of $K_n$.
Phase diagram of one-, two-, and three-dimensional quantum spin systems derived from entanglement properties
Creators: name: Braiorr-Orrs, B.
name: Weyrauch, M.
name: Rakov, M. V.
Publisher: name: arXiv
Year: 2015
Subjects: subject: Quantum Physics (quant-ph)
subject: Strongly Correlated Electrons (cond-mat.str-el)
subject: FOS: Physical sciences

description: We study the bipartite entanglement per bond to determine characteristic features of the phase diagram of various quantum spin models in different spatial dimensions. The bipartite entanglement is obtained from a tensor network representation of the ground state wave-function. Three spin-1/2 models (Ising, XY, XXZ, all in a transverse field) are investigated. Imaginary-time evolution (TEBD in 1D, `simple update' in 2D and 3D) is used to determine the ground states of these models. The phase structure of the models is discussed for all three dimensions.
description: 13 pages, 10 figures
(103152) John Culverwell
Creators: name: Professions, Victorian
Publisher: name: University of Oxford
Year: 2022
Subjects: subject: 220201 Business and Labour History
subject: FOS: Philosophy, ethics and religion
subject: History
subject: 140203 Economic History
subject: FOS: Economics and business

description: This three-year research project began in January 2014 and investigated whether, during the Victorian period, the professions formed a distinct self-sustaining social group with its own mores and values. The project looked at 16,000 individuals drawn from census data for Alnwick, Brighton, Bristol, Dundee, Greenock, Leeds, Merthyr Tydfil, Morpeth, and Winchester. The research project was funded by the UK Economic & Social Research Council and was based at the Universities of Oxford and Northumbria.
title: How MR Imaging contributes to evaluation of cardiac sarcomas?
Creators: name: Ruiz Peralbo, Rosa Maria
Publisher: name: European Congress of Radiology
Year: 2017
Subjects: subject: Neoplasia
subject: Imaging sequences
subject: MR
subject: Cardiac

description: Learning objectives Background Findings and procedure details Conclusion Personal information References
description: Learning objectives: Cardiac MR Imaging is an important technique of study of cardiac tumors, and specifically of cardiac sarcoma, a very rare tumor, but of poor prognosis, which affects young patients, so requires knowledge of the radiological behavior of this lethal...
Sorting and Transforming Program Repair Ingredients via Deep Learning Code Similarities
Creators: name: White, Martin
name: Tufano, Michele
name: Martinez, Matias
name: Monperrus, Martin
name: Poshyvanyk, Denys
Publisher: name: arXiv
Year: 2017
Subjects: subject: Software Engineering (cs.SE)
subject: FOS: Computer and information sciences

description: In the field of automated program repair, the redundancy assumption claims large programs contain the seeds of their own repair. However, most redundancy-based program repair techniques do not reason about the repair ingredients---the code that is reused to craft a patch. We aim to reason about the repair ingredients by using code similarities to prioritize and transform statements in a codebase for patch generation. Our approach, DeepRepair, relies on deep learning to reason about code similarities. Code fragments at well-defined levels of granularity in a codebase can be sorted according to their similarity to suspicious elements (i.e., code elements that contain suspicious statements) and statements can be transformed by mapping out-of-scope identifiers to similar identifiers in scope. We examined these new search strategies for patch generation with respect to effectiveness from the viewpoint of a software maintainer. Our comparative experiments were executed on six open-source Java projects including 374 buggy program revisions and consisted of 19,949 trials spanning 2,616 days of computation time. DeepRepair's search strategy using code similarities generally found compilable ingredients faster than the baseline, jGenProg, but this improvement neither yielded test-adequate patches in fewer attempts (on average) nor found significantly more patches than the baseline. Although the patch counts were not statistically different, there were notable differences between the nature of DeepRepair patches and baseline patches. The results demonstrate that our learning-based approach finds patches that cannot be found by existing redundancy-based repair techniques.
description: camera-ready paper for SANER 2019
title: Tracheal diverticula: frequency chest trauma and association with respiratory symptoms
Creators: name: Guzman Martinez, Nancy
Publisher: name: European Congress of Radiology
Year: 2017
Subjects: subject: Thorax
subject: Trauma
subject: CT-High Resolution
subject: Computer Applications-Detection, diagnosis
subject: Trauma

description: Aims and objectives Methods and materials Results Conclusion Personal information References
description: Aims and objectives: Describe the possible association of tracheal diverticula with thoracic trauma and respiratory symptoms. Tracheal diverticula are incidental findings in sectional studies, most of them seen during tracheostomy, laryngectomy, poor ventilation, trauma...
(103153) Melinda Blackmore
Creators: name: Professions, Victorian
Publisher: name: University of Oxford
Year: 2022
Subjects: subject: 220201 Business and Labour History
subject: FOS: Philosophy, ethics and religion
subject: History
subject: 140203 Economic History
subject: FOS: Economics and business

description: This three-year research project began in January 2014 and investigated whether, during the Victorian period, the professions formed a distinct self-sustaining social group with its own mores and values. The project looked at 16,000 individuals drawn from census data for Alnwick, Brighton, Bristol, Dundee, Greenock, Leeds, Merthyr Tydfil, Morpeth, and Winchester. The research project was funded by the UK Economic & Social Research Council and was based at the Universities of Oxford and Northumbria.
Urban transfer entropy across scales
Creators: name: Murcio, Roberto
name: Morphet, Robin
name: Gershenson, Carlos
name: Batty, Michael
Publisher: name: arXiv
Year: 2015
Subjects: subject: Physics and Society (physics.soc-ph)
subject: FOS: Physical sciences

description: The morphology of urban agglomeration is studied here in the context of information exchange between different spatio-temporal scales. Cities are multidimensional non-linear phenomena, so understanding the relationships and connectivity between scales is important in determining how the interplay of local/regional urban policies may affect the distribution of urban settlements. In order to quantify these relationships, we follow an information theoretic approach using the concept of Transfer Entropy. Our analysis is based on a stochastic urban fractal model, which mimics urban growing settlements and migration waves. The results indicate how different policies could affect urban morphology in terms of the information generated across geographical scales.
description: 19 pages, 4 figures
Edge-coloring linear hypergraphs with medium-sized edges
Creators: name: Faber, Vance
name: Harris, David G.
Publisher: name: arXiv
Year: 2017
Subjects: subject: Combinatorics (math.CO)
subject: FOS: Mathematics

description: Motivated by the Erdős-Faber-Lovász (EFL) conjecture for hypergraphs, we consider the list edge coloring of linear hypergraphs. We show that if the hyper-edge sizes are bounded between $i$ and $C_{i,ε} \sqrt{n}$ inclusive, then there is a list edge coloring using $(1 + ε) \frac{n}{i - 1}$ colors. The dependence on $n$ in the upper bound is optimal (up to the value of $C_{i,ε}$).
Stabilizing soliton-based multichannel transmission with frequency dependent linear gain-loss
Creators: name: Chakraborty, Debananda
name: Peleg, Avner
name: Nguyen, Quan M.
Publisher: name: arXiv
Year: 2015
Subjects: subject: Pattern Formation and Solitons (nlin.PS)
subject: Optics (physics.optics)
subject: FOS: Physical sciences

description: We report several major theoretical steps towards realizing stable long-distance multichannel soliton transmission in Kerr nonlinear waveguide loops. We find that transmission destabilization in a single waveguide is caused by resonant formation of radiative sidebands and investigate the possibility to increase transmission stability by optimization with respect to the Kerr nonlinearity coefficient $γ$. Moreover, we develop a general method for transmission stabilization, based on frequency dependent linear gain-loss in Kerr nonlinear waveguide couplers, and implement it in two-channel and three-channel transmission. We show that the introduction of frequency dependent loss leads to significant enhancement of transmission stability even for non-optimal $γ$ values via decay of radiative sidebands, which takes place as a dynamic phase transition. For waveguide couplers with frequency dependent linear gain-loss, we observe stable oscillations of soliton amplitudes due to decay and regeneration of the radiative sidebands.
description: 28 pages, 15 figures
Deterministic parallel algorithms for bilinear objective functions
Creators: name: Harris, David G.
Publisher: name: arXiv
Year: 2017
Subjects: subject: Data Structures and Algorithms (cs.DS)
subject: FOS: Computer and information sciences

description: Many randomized algorithms can be derandomized efficiently using either the method of conditional expectations or probability spaces with low independence. A series of papers, beginning with work by Luby (1988), showed that in many cases these techniques can be combined to give deterministic parallel (NC) algorithms for a variety of combinatorial optimization problems, with low time- and processor-complexity. We extend and generalize a technique of Luby for efficiently handling bilinear objective functions. One noteworthy application is an NC algorithm for maximal independent set. On a graph $G$ with $m$ edges and $n$ vertices, this takes $\tilde O(\log^2 n)$ time and $(m + n) n^{o(1)}$ processors, nearly matching the best randomized parallel algorithms. Other applications include reduced processor counts for algorithms of Berger (1997) for maximum acyclic subgraph and Gale-Berlekamp switching games. This bilinear factorization also gives better algorithms for problems involving discrepancy. An important application of this is to automata-fooling probability spaces, which are the basis of a notable derandomization technique of Sivakumar (2002). Our method leads to large reduction in processor complexity for a number of derandomization algorithms based on automata-fooling, including set discrepancy and the Johnson-Lindenstrauss Lemma.
(103160) Claude Edward Vere Maish
Creators: name: Professions, Victorian
Publisher: name: University of Oxford
Year: 2022
Subjects: subject: 220201 Business and Labour History
subject: FOS: Philosophy, ethics and religion
subject: History
subject: 140203 Economic History
subject: FOS: Economics and business

description: This three-year research project began in January 2014 and investigated whether, during the Victorian period, the professions formed a distinct self-sustaining social group with its own mores and values. The project looked at 16,000 individuals drawn from census data for Alnwick, Brighton, Bristol, Dundee, Greenock, Leeds, Merthyr Tydfil, Morpeth, and Winchester. The research project was funded by the UK Economic & Social Research Council and was based at the Universities of Oxford and Northumbria.
Dynamical mean-field study of partial Kondo screening in the periodic Anderson model on the triangular lattice
Creators: name: Aulbach, Maximilian W.
name: Assaad, Fakher F.
name: Potthoff, Michael
Publisher: name: arXiv
Year: 2015
Subjects: subject: Strongly Correlated Electrons (cond-mat.str-el)
subject: FOS: Physical sciences

description: The competition between Kondo screening and indirect magnetic exchange is studied for a system with geometrical frustration using dynamical mean-field theory (DMFT). We systematically scan the weak- to strong-coupling regime of the periodic Anderson model on the triangular lattice for a wide range of fillings n. The magnetic phase diagram is derived using a site-dependent DMFT approach by self-consistent mapping onto three independent single-impurity models corresponding to the three correlated f orbitals in the unit cell. At half-filling, the system is a non-magnetic Kondo insulator for all considered interaction strengths U>0 which immediately develops into a non-magnetic metallic Kondo-singlet phase for fillings slightly below half-filling. On the other hand, indirect magnetic exchange between the f moments results in antiferromagnetic order at lower fillings. The antiferromagnetic and the Kondo-singlet phases are separated in the U-n phase diagram by an extended region of partial Kondo screening, i.e., a phase where the magnetic moment at one site in the unit cell is Kondo screened while the remaining two are coupled antiferromagnetically. At even lower fillings the system crosses over from a local-moment to a mixed-valence regime where the minimization of the kinetic energy in a strongly correlated system gives rise to a metallic and partially polarized ferromagnetic state.
description: 11 pages, 8 figures, v2 with slightly extended discussion
Evolutionary dynamics in heterogeneous populations: a general framework for an arbitrary type distribution
Creators: name: Zusai, Dai
Publisher: name: arXiv
Year: 2018
Subjects: subject: Computer Science and Game Theory (cs.GT)
subject: Theoretical Economics (econ.TH)
subject: FOS: Computer and information sciences
subject: FOS: Economics and business
subject: 91A22

description: A general framework of evolutionary dynamics under heterogeneous populations is presented. The framework allows continuously many types of heterogeneous agents, heterogeneity both in payoff functions and in revision protocols and the entire joint distribution of strategies and types to influence the payoffs of agents. We clarify regularity conditions for the unique existence of a solution trajectory and for the existence of equilibrium. We confirm that equilibrium stationarity in general and equilibrium stability in potential games are extended from the homogeneous setting to the heterogeneous setting. In particular, a wide class of admissible dynamics share the same set of locally stable equilibria in a potential game through local maximization of the potential.
Improved detection of chaos with Lagrangian descriptors using differential algebra
Creators: name: Căliman, Alexandru
name: Daquin, Jérôme
name: Libert, Anne-Sophie
Publisher: name: arXiv
Year: 2024
Subjects: subject: Chaotic Dynamics (nlin.CD)
subject: FOS: Physical sciences

description: Lagrangian descriptors (LDs) based on the arc length of orbits previously demonstrated their utility in delineating structures governing the dynamics. Recently, a chaos indicator based on the second derivatives of the LDs, referred to as $\vert\vert Δ\rm{LD} \vert\vert$, has been introduced to distinguish regular and chaotic trajectories. Thus far, the derivatives are numerically approximated using finite differences on fine meshes of initial conditions. In this paper, we instead use the differential algebra (DA) framework as a form of automatic differentiation to introduce and compute $\vert\vert Δ\rm{LD} \vert\vert$ up to machine precision. We discuss and exemplify benefits of this framework, such as the determination of reliable thresholds to distinguish ordered from chaotic trajectories. Our extensive parametric study quantitatively assesses the accuracy and sensitivity of both the finite differences and differential arithmetic approaches by focusing on paradigmatic discrete models of Hamiltonian chaos, namely the Chirikov's standard map and coupled $4$-dimensional variants. Our results demonstrate that finite difference techniques for $\vert\vert Δ\rm{LD} \vert\vert$ might lead to significant misclassification rate, up to $20\%$ when the phase space supports thin resonant webs, due to the difficulty to determine appropriate thresholds. On the contrary, $\vert\vert Δ\rm{LD} \vert\vert$ computed through DA arithmetic leads to clear bimodal distributions which in turn lead to robust thresholds. As a consequence, the DA framework reveals as sensitive as established first order tangent map based indicators, independently of the underlying dynamical regime. Finally, the benefits of the DA framework are also highlighted for non-uniform depleted meshes of initial conditions.
description: Published in PhysicaD. 22 pages, 11 figures. Comments and feedback are welcome
title: Surgical-radiological correlation of ileal pouch-anal anastomosis: a pictorial essay
Creators: name: Rizzo, Christian
Publisher: name: European Congress of Radiology
Year: 2017
Subjects: subject: Obstruction / Occlusion
subject: Inflammation
subject: Diagnostic procedure
subject: Contrast agent-other
subject: Barium enema
subject: Fluoroscopy
subject: Digital radiography
subject: Conventional radiography
subject: Gastrointestinal tract
subject: Abdomen

description: Learning objectives Background Findings and procedure details Conclusion Personal information References
description: Learning objectives: Ileal pouch-anal anastomosis is a surgical technique developed to allow fecal continence and transanal defecation in patients who undergo proctocolectomy. Indications for this surgery include failure to therapy in patients with progressive...
Results of a randomized trial of partner notification in cases of hiv infection in north carolina
Creators: name: Landis, S.E.
name: Weber, D.J.
name: Landis, S.E.
name: Lewis, K.
name: Weber, D.J.
name: Krishan, B.
name: Koch, G.G.
name: Schoenbach, V.J.
name: Mittal, M.
Publisher: name: The University of North Carolina at Chapel Hill University Libraries
Year: 1992

description: Background: We sought to compare two methods of notifying sex partners of subjects infected with the human immunodeficiency virus (HIV) or persons who had shared needles with them (needle-sharing partners):“patient referral,”in which the responsibility for notifying partners was left to the patient, and“provider referral,”in which providers attempted to notify partners.Methods: Names of sex partners and needle-sharing partners and information on how to locate them were obtained from consenting HIV-infected subjects identified in the HIV-testing programs at three public health departments in North Carolina. The subjects were randomly assigned to a patient-referral group (in which patients had the initial responsibility for notifying their partners) or a provider-referral group (in which the study counselor notified the partners). The success of attempts to notify partners was monitored by means of interviews with counselors conducted both in the field and at the health department.Results: Of 534 HIV-positive persons identified at the health departments, 247 (46 percent) did not return for counseling after the test, 8 were counseled outside the study, and 117 (22 percent) were ineligible. Of the 162 invited to participate, 88 (54 percent) declined and 74 (46 percent) agreed. The subjects were mostly male (69 percent), black (87 percent), homosexual or bisexual (76 percent of the men), and had a median age of 30 years. Thirty-nine were assigned to the provider-referral group and 35 to the patient-referral group. In the provider-referral group 78 of 157 partners (50 percent) were successfully notified, whereas in the patient-referral group only 10 of 153 (7 percent) were notified. Of the partners notified by the counselors, 94 percent were not aware that they had been exposed to HIV. Overall, 23 percent of the partners notified and tested were HIV-positive.Conclusions: In this trial, leaving the notification of partners up to the subjects (patient referral) was quite ineffective, despite the North Carolina law requiring that partners be notified. Partner notification by public health counselors (provider referral) was significantly more effective. Although the effectiveness of notification procedures is constrained by the accuracy of the information provided by HIV-infected patients, counselors who notify the partners of an infected patient can refer them to educational, medical, and support services targeted to persons at high risk for HIV infection and may encourage the adoption of less-risky behavior.
title: Chikungunya fever outbreak in Rio de Janeiro, Brazil: ultrasonographic aspects of musculoskeletal complications
Creators: name: Mogami, Roberto
Publisher: name: European Congress of Radiology
Year: 2017
Subjects: subject: Arthritides
subject: Complications
subject: Ultrasound-Power Doppler
subject: Ultrasound
subject: Musculoskeletal soft tissue
subject: Musculoskeletal joint
subject: Extremities

description: Aims and objectives Methods and materials Results Conclusion Personal information References
description: Aims and objectives: Chikungunya in Makonde, a language spoken in Tanzania, means "that which bends up" and is the posture adopted by patients during walking, as a consequence of inflammatory involvement of the ankles. 1-4 The Chikungunya fever virus (CHIKV) is an...
Thermodynamic Magnon Recoil for Domain Wall Motion
Creators: name: Yan, Peng
name: Cao, Yunshan
name: Sinova, Jairo
Publisher: name: arXiv
Year: 2015
Subjects: subject: Mesoscale and Nanoscale Physics (cond-mat.mes-hall)
subject: Materials Science (cond-mat.mtrl-sci)
subject: Statistical Mechanics (cond-mat.stat-mech)
subject: FOS: Physical sciences

description: We predict a thermodynamic magnon recoil effect for domain wall motions in the presence of temperature gradients. All current thermodynamic theories assert that a magnetic domain wall must move toward the hotter side, based on equilibrium thermodynamic arguments. Microscopic calculations on the other hand show that a domain wall can move either along or against the direction of heat currents, depending on how strong the heat currents are reflected by the domain wall. We have resolved the inconsistency between these two approaches by augmenting the theory in the presence of thermal gradients by incorporating in the free energy of domain walls by a heat current term present in nonequilibrium steady states. The condition to observe a domain wall propagation toward the colder regime is derived analytically and can be tested by future experiments.
description: Submitted with revisions
Distributed local approximation algorithms for maximum matching in graphs and hypergraphs
Creators: name: Harris, David G.
Publisher: name: arXiv
Year: 2018
Subjects: subject: Data Structures and Algorithms (cs.DS)
subject: FOS: Computer and information sciences

description: We describe approximation algorithms in Linial's classic LOCAL model of distributed computing to find maximum-weight matchings in a hypergraph of rank $r$. Our main result is a deterministic algorithm to generate a matching which is an $O(r)$-approximation to the maximum weight matching, running in $\tilde O(r \log Δ+ \log^2 Δ+ \log^* n)$ rounds. (Here, the $\tilde O()$ notations hides $\text{polyloglog } Δ$ and $\text{polylog } r$ factors). This is based on a number of new derandomization techniques extending methods of Ghaffari, Harris & Kuhn (2017). As a main application, we obtain nearly-optimal algorithms for the long-studied problem of maximum-weight graph matching. Specifically, we get a $(1+ε)$ approximation algorithm using $\tilde O(\log Δ/ ε^3 + \text{polylog}(1/ε, \log \log n))$ randomized time and $\tilde O(\log^2 Δ/ ε^4 + \log^*n / ε)$ deterministic time. The second application is a faster algorithm for hypergraph maximal matching, a versatile subroutine introduced in Ghaffari et al. (2017) for a variety of local graph algorithms. This gives an algorithm for $(2 Δ- 1)$-edge-list coloring in $\tilde O(\log^2 Δ\log n)$ rounds deterministically or $\tilde O( (\log \log n)^3 )$ rounds randomly. Another consequence (with additional optimizations) is an algorithm which generates an edge-orientation with out-degree at most $\lceil (1+ε) λ\rceil$ for a graph of arboricity $λ$; for fixed $ε$ this runs in $\tilde O(\log^6 n)$ rounds deterministically or $\tilde O(\log^3 n )$ rounds randomly.
Approximation algorithms for stochastic clustering
Creators: name: Harris, David G.
name: Li, Shi
name: Pensyl, Thomas
name: Srinivasan, Aravind
name: Trinh, Khoa
Publisher: name: arXiv
Year: 2018
Subjects: subject: Data Structures and Algorithms (cs.DS)
subject: FOS: Computer and information sciences

description: We consider stochastic settings for clustering, and develop provably-good approximation algorithms for a number of these notions. These algorithms yield better approximation ratios compared to the usual deterministic clustering setting. Additionally, they offer a number of advantages including clustering which is fairer and has better long-term behavior for each user. In particular, they ensure that *every user* is guaranteed to get good service (on average). We also complement some of these with impossibility results.
description: The version of this paper published in JMLR is incorrect; specifically, Theorem 14 of that paper appears to be fatally flawed. The version posted here on arxiv removes the claimed incorrect results
Transparent Polyurethane Film as an Intravenous Catheter Dressing: A Meta-analysis of the Infection Risks
Creators: name: Rutala, W.A.
name: Weber, D.J.
name: Samsa, G.P.
name: Hoffmann, K.K.
Publisher: name: The University of North Carolina at Chapel Hill University Libraries
Year: 1992

description: Objective.—To obtain a quantitative estimate of the impact on infectious complications of using transparent dressings with intravenous catheters. Data Sources.—Meta-analysis of all studies published in the English literature, including abstracts, letters, and reports that examined the primary research question of infection risks associated with transparent compared with gauze dressings for use on central and peripheral venous catheters. Studies were identified by use of the MEDLINE database using the indexing terms occlusive dressings, transparent dressings, and infection and by review of referenced bibliographies. Study Selection.—Seven of the 15 studies (47%) of central venous catheters and seven of 12 studies (58%) of peripheral catheters met our inclusion criteria for analysis. All studies used a prospective cohort design, utilized hospitalized patients, and reported at least one of our defined outcomes. Extraction.—Data for each study were abstracted independently by three investigators. At least three studies were used in the analysis of each outcome. Data Synthesis.—Applying a Mantel-Haenszel χ2 analysis, use of transparent dressings on central venous catheters was significantly associated with an elevated relative risk (RR) of catheter tip infection (RR = 1.78; 95% confidence interval [CI], 1.38 to 2.30). Catheter-related sepsis (RR = 1.69; 95% CI, 0.97 to 2.95) and bacteremia (RR = 1.63; 95% CI, 0.76 to 3.47) were both associated with an elevated RR. Use of transparent dressings on peripheral catheters was associated with an elevated RR of catheter-tip infection (RR=1.53; 95% CI, 1.18 to 1.99) but not phlebitis (RR = 1.02; 95% CI, 0.86 to 1.20), infiltration (RR = 1.12; 95% CI, 0.92 to 1.37), or skin colonization (RR =0.99; 95% CI, 0.90 to 1.09). Conclusion.—The results demonstrated a significantly increased risk of catheter-tip infection with the use of transparent compared with gauze dressings when used with either central or peripheral catheters. An increased risk of bacteremia and catheter sepsis associated with the use of transparent compared with gauze dressings for use on central venous catheters was suggested.
Rock 'n' Roll Solutions to the Hubble Tension
Creators: name: Agrawal, Prateek
name: Cyr-Racine, Francis-Yan
name: Pinner, David
name: Randall, Lisa
Publisher: name: arXiv
Year: 2019
Subjects: subject: Cosmology and Nongalactic Astrophysics (astro-ph.CO)
subject: High Energy Physics - Phenomenology (hep-ph)
subject: FOS: Physical sciences

description: Local measurements of the Hubble parameter are increasingly in tension with the value inferred from a $Λ$CDM fit to the cosmic microwave background (CMB) data. In this paper, we construct scenarios in which evolving scalar fields significantly ease this tension by adding energy to the Universe around recombination in a narrow redshift window. We identify solutions with scalar field potential $V \propto ϕ^{2n}$ that have simple asymptotic behavior, both oscillatory (rocking) and rolling. These solutions consistently describe both the field evolution and its fluctuations without approximation. Our findings differ qualitatively from some of the existing literature, which rely upon a coarse-grained fluid description. Combining CMB data with low-redshift measurements, the best fit model has $n=2$ with a significantly higher value of the Hubble constant as compared to a $Λ$CDM fit to the same data. Future measurements of the late-time amplitude of matter fluctuations and of the reionization history could help distinguish these models from competing solutions.
description: 20 pages, 9 figures + appendice. V2: match published version
Hierarchy of approximations for describing quantum light from high-harmonic generation: A Fermi-Hubbard model study
Creators: name: Lange, Christian Saugbjerg
name: Madsen, Lars Bojer
Publisher: name: arXiv
Year: 2024
Subjects: subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: The quantum optical description of high-order harmonic generation where both the electrons of the generating medium and the driving and generated light fields are described quantum mechanically has been of significant interest in the past years. The quantum optical formulation leads to equations of motion for the generated light field in which the quantum optical field couples to the time-dependent current of the electronic medium irrespectively of the specifics of the electronic system being an atom, molecule, or solid. These equations of motion are not solvable for any realistic system and accurate and verified approximations are hence needed. In this work, we present a hierarchy of approximations for the equations of motion for the photonic state. At each level in this hierarchy, we compare it to the previous level justifying the validity using the Fermi-Hubbard model as an example of an electronic system with correlations. This model allows us to perform an accurate simulation of the electron motion of all the required states. We find that for the typical experimental situation of weak quantized-light-matter-coupling constant and at intensities well below the damage threshold, an explicit expression for the generated quantum light, referred to as the Markov-state approximation (MSA), captures the high-harmonic spectrum quantitatively and describes the single-mode quantum properties of the generated light as characterized by the Mandel-Q parameter and the degree of squeezing qualitatively.
(102867) Jane Florence Lewis
Creators: name: Professions, Victorian
Publisher: name: University of Oxford
Year: 2022
Subjects: subject: 220201 Business and Labour History
subject: FOS: Philosophy, ethics and religion
subject: History
subject: 140203 Economic History
subject: FOS: Economics and business

description: This three-year research project began in January 2014 and investigated whether, during the Victorian period, the professions formed a distinct self-sustaining social group with its own mores and values. The project looked at 16,000 individuals drawn from census data for Alnwick, Brighton, Bristol, Dundee, Greenock, Leeds, Merthyr Tydfil, Morpeth, and Winchester. The research project was funded by the UK Economic & Social Research Council and was based at the Universities of Oxford and Northumbria.
Response to Deltoid Muscle Injection of Hepatitis B Vaccine After Failure to Respond to Gluteal Injections
Creators: name: Kenyear, S.A.
name: Rutala, W.A.
name: Lemon, S.M.
name: Weber, D.J.
Publisher: name: The University of North Carolina at Chapel Hill University Libraries
Year: 1986

description: To the Editor. In their article entitled
"Prehospital Cardiopulmonary
Resuscitation: Is It Effective?" Cummins
and Eisenberg state: "Clinical
evidence provides strong support for
efforts to increase the percent of
persons in cardiac arrests who receive
early bystander CPR [cardiopulmonary
resuscitation]. These efforts do
no harm and clearly save lives." We
wish to report a subgroup of patients
in whom early bystander-initiated
CPR may be dramatically successful.
title: Chemotherapy induced bone density changes in young adults with aggressive lymphomas as assessed by PETCT
Creators: name: Ho, Ryan
Publisher: name: European Congress of Radiology
Year: 2017
Subjects: subject: Osteoporosis
subject: Computer Applications-General
subject: PET-CT
subject: Musculoskeletal bone
subject: Haematologic

description: Aims and objectives Methods and materials Results Conclusion Personal information References
description: Aims and objectives: Background: Increased incidence of osteoporosis is seen in childhood and elderly adult survivors of lymphoma. [1,2] Alkylator therapy impacting gonadal function and corticosteroid exposure contribute to bone loss. The effect of these treatments on...
Algorithms for weighted independent transversals and strong colouring
Creators: name: Graf, Alessandra
name: Harris, David G.
name: Haxell, Penny
Publisher: name: arXiv
Year: 2019
Subjects: subject: Data Structures and Algorithms (cs.DS)
subject: Discrete Mathematics (cs.DM)
subject: Combinatorics (math.CO)
subject: FOS: Computer and information sciences
subject: FOS: Mathematics

description: An independent transversal (IT) in a graph with a given vertex partition is an independent set consisting of one vertex in each partition class. Several sufficient conditions are known for the existence of an IT in a given graph with a given vertex partition, which have been used over the years to solve many combinatorial problems. Some of these IT existence theorems have algorithmic proofs, but there remains a gap between the best bounds given by nonconstructive results, and those obtainable by efficient algorithms. Recently, Graf and Haxell (2018) described a new (deterministic) algorithm that asymptotically closes this gap, but there are limitations on its applicability. In this paper we develop a randomized version of this algorithm that is much more widely applicable, and demonstrate its use by giving efficient algorithms for two problems concerning the strong chromatic number of graphs.