Flexoelectric Polarization in a Nematic Liquid Crystal Enhanced by Dopants with Different Molecular Shape Polarities

Funding Information: We would like to acknowledge the great support which we received from Prof. I. Muševič, JSI, Ljubljana, Slovenia, Dr M. Klasen-Memmer, Merck, Germany, Dr Santanu Kumar Pal and Dr Golam Mohiuddin, Indian Institute of Science Education and Research (IISER) Mohali, India, and Prof. P. Kula and K. Garbat, MUT, Warsaw, Poland. This work has been partially supported by SeeReal Technologies and MUT Research Grants 13-843/WAT/2022.Peer reviewedPublisher PD

Irradiated Esophageal Cells are Protected from Radiation-Induced Recombination by MnSOD Gene Therapy

Radiation-induced DNA damage is a precursor to mutagenesis and cytotoxicity. During radiotherapy, exposure of healthy tissues can lead to severe side effects. We explored the potential of mitochondrial SOD (MnSOD) gene therapy to protect esophageal, pancreatic and bone marrow cells from radiation-induced genomic instability. Specifically, we measured the frequency of homologous recombination (HR) at an integrated transgene in the Fluorescent Yellow Direct Repeat (FYDR) mice, in which an HR event can give rise to a fluorescent signal. Mitochondrial SOD plasmid/liposome complex (MnSOD-PL) was administered to esophageal cells 24 h prior to 29 Gy upper-body irradiation. Single cell suspensions from FYDR, positive control FYDR-REC, and negative control C57BL/6NHsd (wild-type) mouse esophagus, pancreas and bone marrow were evaluated by flow cytometry. Radiation induced a statistically significant increase in HR 7 days after irradiation compared to unirradiated FYDR mice. MnSOD-PL significantly reduced the induction of HR by radiation at day 7 and also reduced the level of HR in the pancreas. Irradiation of the femur and tibial marrow with 8 Gy also induced a significant increase in HR at 7 days. Radioprotection by intraesophageal administration of MnSOD-PL was correlated with a reduced level of radiation-induced HR in esophageal cells. These results demonstrate the efficacy of MnSOD-PL for suppressing radiation-induced HR in vivo.National Institutes of Health (U.S.) (NIH Grant R01-CA83876-8)National Institute of Allergy and Infectious Diseases (U.S.) (NIH grant U19A1068021)National Institutes of Health (U.S.) (Grant T32-ES07020)United States. Dept. of Energy (DOE DE-FG01-04ER04)National Institutes of Health (U.S.) (NIH P01-CA26735

Rectangular tile covers of 2D-strings

We consider tile covers of 2D-strings which are a generalization of periodicity of 1D-strings. We say that a 2D-string A is a tile cover of a 2D-string S if S can be decomposed into non-overlapping 2D-strings, each of them equal to A or to AT, where AT is the transpose of A. We show that all tile covers of a 2D-string of size N can be computed in O(N1+ε) time for any ε > 0. We also show a linear-time algorithm for computing all 1D-strings being tile covers of a 2D-string

Linear-time computation of cyclic roots and cyclic covers of a string

Cyclic versions of covers and roots of a string are considered in this paper. A prefix V of a string S is a cyclic root of S if S is a concatenation of cyclic rotations of V . A prefix V of S is a cyclic cover of S if the occurrences of the cyclic rotations of V cover all positions of S. We present O(n)-time algorithms computing all cyclic roots (using number-theoretic tools) and all cyclic covers (using tools related to seeds) of a length-n string over an integer alphabet. Our results improve upon O(n log log n) and O(n log n) time complexities of recent algorithms of Grossi et al. (WALCOM 2023) for the respective problems and provide novel approaches to the problems. As a by-product, we obtain an optimal data structure for Internal Circular Pattern Matching queries that generalize Internal Pattern Matching and Cyclic Equivalence queries of Kociumaka et al. (SODA 2015)

Circular pattern matching with k mismatches

We consider the circular pattern matching with k mismatches (k-CPM) problem in which one is to compute the minimal Hamming distance of every length-m substring of T and any cyclic rotation of P, if this distance is no more than k. It is a variation of the well-studied k-mismatch problem. A multitude of papers has been devoted

Approximate circular pattern matching

We investigate the complexity of approximate circular pattern matching (CPM, in short) under the Hamming and edit distance. Under each of these two basic metrics, we are given a length-n text T, a length-m pattern P, and a positive integer threshold k, and we are to report all starting positions (called occurrences) of fragments of T that are at distance at most k from some cyclic rotation of P. In the decision version of the problem, we are to check if there is any such occurrence. All previous results for approximate CPM were either average-case upper bounds or heuristics, with the exception of the work of Charalampopoulos et al. [CKP+, JCSS'21], who considered only the Hamming distance. For the reporting version of the approximate CPM problem, under the Hamming distance we improve upon the main algorithm of [CKP+, JCSS'21] from O(n+(n/m) k4) to O(n+(n/m) k3 log log k) time; for the edit distance, we give an O(nk2)-time algorithm. Notably, for the decision versions and wide parameter-ranges, we give algorithms whose complexities are almost identical to the state-of-the-art for standard (i.e., non-circular) approximate pattern matching: For the decision version of the approximate CPM problem under the Hamming distance, we obtain an O(n + (n/m) k2 log k/ log log k)-time algorithm, which works in O(n) time whenever k = O( p mlog log m/logm). In comparison, the fastest algorithm for the standard counterpart of the problem, by Chan et al. [CGKKP, STOC'20], runs in O(n) time only for k = O(√ m). We achieve this result via a reduction to a geometric problem by building on ideas from [CKP+, JCSS'21] and Charalampopoulos et al. [CKW, FOCS'20]. For the decision version of the approximate CPM problem under the edit distance, the O(nk log3 k) runtime of our algorithm near matches the O(nk) runtime of the Landau-Vishkin algorithm [LV, J. Algorithms'89] for approximate pattern matching under edit distance; the latter algorithm remains the fastest known for k = Ω(m2/5). As a stepping stone, we propose an O(nk log3 k)-time algorithm for solving the Longest Prefix k-Approximate Match problem, proposed by Landau et al. [LMS, SICOMP'98], for all k ∈ {1, , k}. Our algorithm is based on Tiskin's theory of seaweeds [Tiskin, Math. Comput. Sci.'08], with recent advancements (see Charalampopoulos et al. [CKW, FOCS'22]), and on exploiting the seaweeds' relation to Monge matrices. In contrast, we obtain a conditional lower bound that suggests a polynomial separation between approximate CPM under the Hamming distance over the binary alphabet and its non-circular counterpart. We also show that a strongly subquadratic-time algorithm for the decision version of approximate CPM under edit distance would refute the Strong Exponential Time Hypothesis

NA61/SHINE facility at the CERN SPS: beams and detector system

NA61/SHINE (SPS Heavy Ion and Neutrino Experiment) is a multi-purpose experimental facility to study hadron production in hadron-proton, hadron-nucleus and nucleus-nucleus collisions at the CERN Super Proton Synchrotron. It recorded the first physics data with hadron beams in 2009 and with ion beams (secondary 7Be beams) in 2011. NA61/SHINE has greatly profited from the long development of the CERN proton and ion sources and the accelerator chain as well as the H2 beamline of the CERN North Area. The latter has recently been modified to also serve as a fragment separator as needed to produce the Be beams for NA61/SHINE. Numerous components of the NA61/SHINE set-up were inherited from its predecessors, in particular, the last one, the NA49 experiment. Important new detectors and upgrades of the legacy equipment were introduced by the NA61/SHINE Collaboration. This paper describes the state of the NA61/SHINE facility - the beams and the detector system - before the CERN Long Shutdown I, which started in March 2013

Three-nucleon force effects in the analyzing powers of the dp breakup at 130 MeV

A measurement of the analyzing powers for the 1H(~d, pp)n breakup reaction at 130MeV polarized deuteron beam energy was carried out at KVI Groningen. The experimental setup covered a large fraction of the phase space. Obtained tensor analyzing powers T22 for selected kinematical configurations have been compared to theoretical predictions based on various approaches: the rigorous Faddeev calculations using the realistic nucleon–nucleon potentials with and without three nucleon force (3NF) models, predictions of the chiral perturbation theory, and coupled channel calculations with the explicit degrees of freedom. In the presented configurations the results of all predictions are very close to one another and there are no significant 3NF influences. Not all of the data can be satisfactory reproduced by the theoretical calculations