cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
Binary Codes and Period-2 Orbits of Sequential Dynamical Systems
Creators: name: Defant, Colin
Publisher: name: arXiv
Year: 2015
Subjects: subject: Combinatorics (math.CO)
subject: Information Theory (cs.IT)
subject: FOS: Mathematics
subject: FOS: Computer and information sciences
subject: 37E15, 05C69

description: Let $[K_n,f,π]$ be the (global) SDS map of a sequential dynamical system (SDS) defined over the complete graph $K_n$ using the update order $π\in S_n$ in which all vertex functions are equal to the same function $f\colon\mathbb F_2^n\to\mathbb F_2^n$. Let $η_n$ denote the maximum number of periodic orbits of period $2$ that an SDS map of the form $[K_n,f,π]$ can have. We show that $η_n$ is equal to the maximum number of codewords in a binary code of length $n-1$ with minimum distance at least $3$. This result is significant because it represents the first interpretation of this fascinating coding-theoretic sequence other than its original definition.
description: 12 pages, 2 figures
Automated Synthesis of Distributed Self-Stabilizing Protocols
Creators: name: Faghih, Fathiyeh
name: Bonakdarpour, Borzoo
name: Tixeuil, Sebastien
name: Kulkarni, Sandeep
Publisher: name: arXiv
Year: 2015
Subjects: subject: Software Engineering (cs.SE)
subject: Distributed, Parallel, and Cluster Computing (cs.DC)
subject: FOS: Computer and information sciences

description: In this paper, we introduce an SMT-based method that automatically synthesizes a distributed self-stabilizing protocol from a given high-level specification and network topology. Unlike existing approaches, where synthesis algorithms require the explicit description of the set of legitimate states, our technique only needs the temporal behavior of the protocol. We extend our approach to synthesize ideal-stabilizing protocols, where every state is legitimate. We also extend our technique to synthesize monotonic-stabilizing protocols, where during recovery, each process can execute an most once one action. Our proposed methods are fully implemented and we report successful synthesis of well-known protocols such as Dijkstra's token ring, a self-stabilizing version of Raymond's mutual exclusion algorithm, ideal-stabilizing leader election and local mutual exclusion, as well as monotonic-stabilizing maximal independent set and distributed Grundy coloring.
Metallanalysen römischer Gebrauchsgegenstände
Creators: name: Riederer, Josef
name: Briese, Elke
Publisher: name: Jahrbuch des Römisch-Germanischen Zentralmuseums Mainz
Year: 2017
Subjects: Römerzeit; 3. Jh. n.Chr.; Südeuropa; Italien; Tiber; Flussfunde; Metallanalysen

description: [nicht vorhanden / not available]
description: Jahrbuch des Römisch-Germanischen Zentralmuseums Mainz, Bd. 19 (1972)
Pattern Avoidance for Random Permutations
Creators: name: Crane, Harry
name: DeSalvo, Stephen
Publisher: name: arXiv
Year: 2015
Subjects: subject: Combinatorics (math.CO)
subject: Probability (math.PR)
subject: FOS: Mathematics
subject: 05A05, 05A15, 05A16, 60C05

description: Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences and a corresponding joint distribution of independent Bernoulli random variables, which as a corollary yields a Poisson approximation for the distribution of the number of occurrences of any pattern. We also investigate occurrences of consecutive patterns in random Mallows permutations, of which uniform random permutations are a special case. These bounds allow us to estimate the probability that a pattern occurs any number of times and, in particular, the probability that a random permutation avoids a given pattern.
description: 24 pages, 2 Figures, 4 Tables
Optimizing CUDA Code By Kernel Fusion---Application on BLAS
Creators: name: Filipovič, J.
name: Madzin, M.
name: Fousek, J.
name: Matyska, L.
Publisher: name: arXiv
Year: 2013
Subjects: subject: Distributed, Parallel, and Cluster Computing (cs.DC)
subject: FOS: Computer and information sciences

description: Modern GPUs are able to perform significantly more arithmetic operations than transfers of a single word to or from global memory. Hence, many GPU kernels are limited by memory bandwidth and cannot exploit the arithmetic power of GPUs. However, the memory locality can be often improved by kernel fusion when a sequence of kernels is executed and some kernels in this sequence share data. In this paper, we show how kernels performing map, reduce or their nested combinations can be fused automatically by our source-to-source compiler. To demonstrate the usability of the compiler, we have implemented several BLAS-1 and BLAS-2 routines and show how the performance of their sequences can be improved by fusions. Compared to similar sequences using CUBLAS, our compiler is able to generate code that is up to 2.61x faster for the examples tested.
description: Manuscript submitted to SIAM Journal on Scientific Computing
Best and worst case permutations for random online domination of the path
Creators: name: Coscia, Christopher
name: DeWitt, Jonathan
name: Yang, Fan
name: Zhang, Yiguang
Publisher: name: arXiv
Year: 2015
Subjects: subject: Combinatorics (math.CO)
subject: FOS: Mathematics

description: We study a randomized algorithm for graph domination, by which, according to a uniformly chosen permutation, vertices are revealed and added to the dominating set if not already dominated. We determine the expected size of the dominating set produced by the algorithm for the path graph $P_n$ and use this to derive the expected size for some related families of graphs. We then provide a much-refined analysis of the worst and best cases of this algorithm on $P_n$ and enumerate the permutations for which the algorithm has the worst-possible performance and best-possible performance. The case of dominating the path graph has connections to previous work of Bouwer and Star, and of Gessel on greedily coloring the path.
description: 13 pages, 1 figure
Chorizococcus pazoukii Moghaddam
Creators: name: MOGHADDAM, MASUMEH
name: WATSON, GILLIAN W.
Publisher: name: Zenodo
Year: 2022
Subjects: Biodiversity
Taxonomy
Animalia
Arthropoda
Insecta
Hemiptera
Pseudococcidae
Chorizococcus
Chorizococcus pazoukii

description: Chorizococcus pazoukii Moghaddam
(Fig. 8, distribution map Fig. 66 G)
 Chorizococcus pazoukii Moghaddam in Moghaddam & Alikhani, 2014.
 Field characteristics: Not recorded.
 Microscopic diagnosis: Slide-mounted adult female oval to broadly oval. Anal lobes poorly developed. Antennae each with 8 segments. Legs well developed, small for size of body. Hind leg with large translucent pores on dorsal surface of tibia; tarsal digitules pointed at tip and shorter than claw. Cerarii numbering a single pair situated on anal lobes, each cerarius with 2 large conical setae, 3 or 4 auxiliary setae and a group of trilocular pores, all situated on a slightly sclerotized area. Circulus divided by an intersegmental line. Ostioles well developed. Anal ring with 2 rows of pores and bearing 6 setae.
 Dorsum with setae short and stiff. Multilocular disc pores absent. Trilocular and discoidal pores evenly distributed. Oral rim tubular ducts of 2 sizes: larger type numerous in bands over entire dorsum, except for abdominal segment VIII; and smaller type present across posterior abdominal segments. Oral collar tubular ducts few, present on margins of abdominal segments IV ‒ VIII.
 Venter with normal flagellate setae. Multilocular disc pores each with 12 loculi, present medially in more or less double rows at posterior edges of abdominal segments VI and VII, and posterior to vulva. Trilocular pores and discoidal pores present. Oral rim tubular ducts of 2 sizes: larger type, similar to those on dorsum, present over body except for posterior to vulva; smaller type present in marginal and submarginal zones. Oral collar tubular ducts, same as those on dorsum, present mainly around lateral margins of posterior abdominal segments and at posterior edges of abdominal segments III ‒ VIII.
 Distribution: This Iranian species has been recorded from Markazi province (Moghaddam & Alikhani 2014).
 Host-plants: Chorizococcus pazoukii was found on the roots of an unknown plant (Moghaddam & Alikhani 2014).
 Economic importance: None.
 Natural enemies: None recorded.
 Comments: Chorizococcus pazoukii is similar to C. neomexicanus (Tinsley) in having numerous oral rim tubular ducts on the dorsum, but differs by lacking oral rim tubular ducts in medial areas of the venter.
 The accompanying illustration of C. pazoukii is reproduced from Moghaddam & Alikhani (2014), page 57, Fig.
 1, with kind permission from the Editor of Journal of the Entomological Society of Iran.
description: Published as part of MOGHADDAM, MASUMEH & WATSON, GILLIAN W., 2022, The Scale Insects Of Iran (Hemiptera: Coccomorpha) Part 2 The Mealybugs (Pseudococcidae And Rhizoecidae) And Putoidae, pp. 1-169 in Zootaxa 5126 (1) on pages 34-35, DOI: 10.11646/zootaxa.5126.1.1, http://zenodo.org/record/6460412
Additional file 1 of Identification of cerebral spinal fluid protein biomarkers in Niemann-Pick disease, type C1
Creators: name: Campbell, Kiersten
name: Cawley, Niamh X.
name: Luke, Rachel
name: Scott, Katelin E. J.
name: Johnson, Nicholas
name: Farhat, Nicole Y.
name: Alexander, Derek
name: Wassif, Christopher A.
name: Li, Wenping
name: Cologna, Stephanie M.
name: Berry-Kravis, Elizabeth
name: Do, An Dang
name: Dale, Ryan K.
name: Porter, Forbes D.
Publisher: name: figshare
Year: 2023
Subjects: subject: Biochemistry
subject: Medicine
subject: Genetics
subject: FOS: Biological sciences
subject: Neuroscience
subject: Physiology
subject: 69999 Biological Sciences not elsewhere classified
subject: Cancer
subject: 110309 Infectious Diseases
subject: FOS: Health sciences

description: Additional file 1: Figure 1. Principal component plot of the comparison non-NPC1 samples. The two pediatric laboratory samples that were excluded as outliers are indicated in red.
Mutation Rules and the Evolution of Sparseness and Modularity in Biological Systems
Creators: name: Friedlander, Tamar
name: Mayo, Avraham E.
name: Tlusty, Tsvi
name: Alon, Uri
Publisher: name: arXiv
Year: 2013
Subjects: subject: Molecular Networks (q-bio.MN)
subject: Populations and Evolution (q-bio.PE)
subject: FOS: Biological sciences

description: Biological systems exhibit two structural features on many levels of organization: sparseness, in which only a small fraction of possible interactions between components actually occur; and modularity - the near decomposability of the system into modules with distinct functionality. Recent work suggests that modularity can evolve in a variety of circumstances, including goals that vary in time such that they share the same subgoals (modularly varying goals), or when connections are costly. Here, we studied the origin of modularity and sparseness focusing on the nature of the mutation process, rather than on connection cost or variations in the goal. We use simulations of evolution with different mutation rules. We found that commonly used sum-rule mutations, in which interactions are mutated by adding random numbers, do not lead to modularity or sparseness except for in special situations. In contrast, product-rule mutations in which interactions are mutated by multiplying by random numbers - a better model for the effects of biological mutations - led to sparseness naturally. When the goals of evolution are modular, in the sense that specific groups of inputs affect specific groups of outputs, product-rule mutations also lead to modular structure; sum-rule mutations do not. Product-rule mutations generate sparseness and modularity because they tend to reduce interactions, and to keep small interaction terms small.
Das Grabrelief des Nardos Chalbos aus Syrien
Creators: name: Künzl, Ernst
Publisher: name: Jahrbuch des Römisch-Germanischen Zentralmuseums Mainz
Year: 2017
Subjects: Römerzeit; 2. Jh. n.Chr.; Vorderasien; Syrien; Relief; figürliche Darstellungen; Grabstein

description: [nicht vorhanden / not available]
description: Jahrbuch des Römisch-Germanischen Zentralmuseums Mainz, Bd. 19 (1972)
title: Micro-Biosensor Devices for Biochemical Analysis Applications
Creators: name: Zhang, Han
Publisher: name: Utah State University
Year: 2020

description: A biosensor is an analytical device integrating a biological element and a physicochemical transducer that convert a biological response into a measurable signal. The advantages of biosensors include low cost, small size, quick, sensitivity and selectivity greater than the conventional instruments. Biosensors have a wide range of applications ranging from clinical diagnostics through to environmental monitoring, agriculture industry, et al.
The different types of biosensors are classified based on the sensor device as well as the biological material. Biosensors can be broadly classified into (piezoelectric, etc.), electrochemical biosensors (potentiometric, amperometric, etc.), and optical types of biosensors (fiber optics, etc.).
Here, we introduce a novel microfluidics-integrated biosensor platform system that can be flexibly adapted to form individual biosensors for different applications. In this dissertation, we present five examples of different emerging areas with this biosensor system including anti-cancer drug screening, glucose monitoring, heavy metal elements measurement, obesity healthcare, and waterborne pathogen DNA detection. These micro-biosensors have great potential to be further developed to emerging portable sensing devices especially for the uses in the developing and undeveloped world. At the last chapter, Raman spectroscopy applied to assess gestational status and the potential for pregnancy complications is presented and discussed. This technique could significantly benefit animal reproduction.
Asymptotic Density of Zimin Words
Creators: name: Cooper, Joshua
name: Rorabaugh, Danny
Publisher: name: arXiv
Year: 2015
Subjects: subject: Combinatorics (math.CO)
subject: FOS: Mathematics

description: Word $W$ is an instance of word $V$ provided there is a homomorphism $ϕ$ mapping letters to nonempty words so that $ϕ(V) = W$. For example, taking $ϕ$ such that $ϕ(c)=fr$, $ϕ(o)=e$ and $ϕ(l)=zer$, we see that "freezer" is an instance of "cool". Let $\mathbb{I}_n(V,[q])$ be the probability that a random length $n$ word on the alphabet $[q] = \{1,2,\cdots q\}$ is an instance of $V$. Having previously shown that $\lim_{n \rightarrow \infty} \mathbb{I}_n(V,[q])$ exists, we now calculate this limit for two Zimin words, $Z_2 = aba$ and $Z_3 = abacaba$.
description: 25 pages
Bericht über die Tätigkeit der Gesellschaft der Freunde des Römisch-Germanischen Zentralmuseums im Jahre 1972
Creators: name: Böhner, Kurt
Publisher: name: Jahrbuch des Römisch-Germanischen Zentralmuseums Mainz
Year: 2017
Subjects: Tätigkeitsbericht Freunde RGZM

description: [nicht vorhanden / not available]
description: Jahrbuch des Römisch-Germanischen Zentralmuseums Mainz, Bd. 19 (1972)
Disclosing the Radio Loudness Distribution Dichotomy in Quasars: An Unbiased Monte Carlo Approach Applied to the SDSS-FIRST Quasar Sample
Creators: name: Balokovic, Mislav
name: Smolcic, Vernesa
name: Ivezic, Zeljko
name: Zamorani, Gianni
name: Schinnerer, Eva
name: Kelly, Brandon C.
Publisher: name: arXiv
Year: 2012
Subjects: subject: Astrophysics of Galaxies (astro-ph.GA)
subject: High Energy Astrophysical Phenomena (astro-ph.HE)
subject: FOS: Physical sciences

description: We investigate the dichotomy in the radio loudness distribution of quasars by modelling their radio emission and various selection effects using a Monte Carlo approach. The existence of two physically distinct quasar populations, the radio-loud and radio-quiet quasars, is controversial and over the last decade a bimodal distribution of radio loudness of quasars has been both affirmed and disputed. We model the quasar radio luminosity distribution with simple unimodal and bimodal distribution functions. The resulting simulated samples are compared to a fiducial sample of 8,300 quasars drawn from the SDSS DR7 Quasar Catalog and combined with radio observations from the FIRST survey. Our results indicate that the SDSS-FIRST sample is best described by a radio loudness distribution which consists of two components, with 12+/-1 % of sources in the radio-loud component. On the other hand, the evidence for a local minimum in the loudness distribution (bimodality) is not strong and we find that previous claims for its existence were probably affected by the incompleteness of the FIRST survey close to its faint limit. We also investigate the redshift and luminosity dependence of the radio loudness distribution and find tentative evidence that at high redshift radio-loud quasars were rarer, on average "louder", and exhibited a smaller range in radio loudness. In agreement with other recent work, we conclude that the SDSS-FIRST sample strongly suggests that the radio loudness distribution of quasars is not a universal function, and that more complex models than presented here are needed to fully explain available observations.
description: Accepted for publication in ApJ; 13 pages, 10 figures
title: Working Memory and Syntactic Processing in Bilingual and Monolingual Children
Creators: name: Orellana, Carla I.
Publisher: name: Utah State University
Year: 2020

description: The purpose of this study was to examine the relationship between complex auditory working memory, syntactic knowledge, and complex sentence comprehension in bilingual and monolingual children using both offline (behavioral)and online(eye-tracking)measures.There were 19 children in the monolingual group and 19 children in the bilingual group with an average age of 11 years. The children listened to sentences, while looking at a screen with three images of the three nouns in the sentence. They were instructed to select the doer of the action (agent). Their eye movements were recorded as they completed this task. The four sentence types were: subject verb object (SVO), subject relative (SR), passive (PAS), and object relative (OR). Both groups of children had better sentence comprehension accuracy of SVO and SR sentences than PAS and OR sentences. Children with higher working memory tended to obtain better scores than children with lower working memory. This effect was strongest in the PAS and OR sentences. Additionally, for PAS and OR sentences, bilingual children with similar levels of working memory as the monolingual children obtained lower scores of sentence comprehension. Children with high working memory were slower to respond. Bilingual children selected the answers more quickly than the monolingual children. Children with high working memory focused on the agent less than children with low working memory. Bilingual children had mixed results relating to their focus of attention.
Rethinking Boltzmannian Equilibrium
Creators: name: Werndl, Charlotte
name: Frigg, Roman
Publisher: name: arXiv
Year: 2015
Subjects: subject: Statistical Mechanics (cond-mat.stat-mech)
subject: Dynamical Systems (math.DS)
subject: Chaotic Dynamics (nlin.CD)
subject: History and Philosophy of Physics (physics.hist-ph)
subject: FOS: Physical sciences
subject: FOS: Mathematics

description: Boltzmannian statistical mechanics partitions the phase space of a system into macro-regions, and the largest of these is identified with equilibrium. What justifies this identification? Common answers focus on Boltzmann's combinatorial argument, the Maxwell-Boltzmann distribution, and maximum entropy considerations. We argue that they fail and present a new answer. We characterise equilibrium as the macrostate in which a system spends most of its time and prove a new theorem establishing that equilibrium thus defined corresponds to the largest macro-region. Our derivation is completely general, and does not rely on assumptions about the dynamics or internal interactions.
description: arXiv admin note: substantial text overlap with arXiv:1510.02260
title: Characteristics of Family and Consumer Sciences Teachers Adopting Instructional Technologies in the State of Utah
Creators: name: Manwaring, Nicole J. B.
Publisher: name: Utah State University
Year: 2020

description: Effective instructional technology use increases student learning outcomes. There has been an increase in the number and variety of new instructional technologies, but previous research has not focused on the demographic of Family and Consumer Sciences (FCS) teachers. More research was needed to identify correlations among technology adopters and how they perceived student learning.
The researcher developed an online survey adapted from previous research to identify technologies being used in FCS classrooms, teacher attitudes on technology integration and perceptions on student learning, and demographic information. A comparison of high school and middle school settings was conducted. It was found that FCS teachers in the state of Utah use a variety of instructional technologies, they lean toward a constructivist point of view, and there is no difference amongst technology adopters regarding age, years teaching experience, or middle school and high school classroom settings.
This study adds to the literature regarding instructional technology use, teacher attitudes and perceptions related to instructional technologies and student learning, and characteristics of teacher technology adopters. This information is important to anyone who plans professional development regarding technology use and adoption.
Andreas Lippert: Das Gräberfeld von Welzelach (Osttirol). Eine Bergwerksnekropole der späten Hallstattzeit
Creators: name: Kilian-Dirlmeier, Irma
Publisher: name: Jahrbuch des Römisch-Germanischen Zentralmuseums Mainz
Year: 2017
Subjects: Buchbesprechung

description: Rezension zu: Andreas Lippert: Das Gräberfeld von Welzelach (Osttirol). Eine Bergwerksnekropole der späten Hallstattzeit. Antiquitas, Reihe 3: Abhandlungen zur Vor- und Frühgeschichte, zur klassischen und provinzial-römischen Archäologie und zur Geschichte des Altertums Bd. 12 (Rudolf Habelt Verlag, Bonn 1972) 83 S., 50 Taf.
description: Jahrbuch des Römisch-Germanischen Zentralmuseums Mainz, Bd. 20 (1973)
Leda in Gold. Eine Teekanne und ihre Schöpfer
Creators: name: Glaser, Silvia
Publisher: name: KulturGut : aus der Forschung des Germanischen Nationalmuseums
Year: 2017

description: KulturGut : aus der Forschung des Germanischen Nationalmuseums, Nr. 56 (2018): KulturGut: aus der Forschung des Germanischen Nationalmuseums
List-antimagic labeling of vertex-weighted graphs
Creators: name: Berikkyzy, Zhanar
name: Brandt, Axel
name: Jahanbekam, Sogol
name: Larsen, Victor
name: Rorabaugh, Danny
Publisher: name: arXiv
Year: 2015
Subjects: subject: Combinatorics (math.CO)
subject: FOS: Mathematics

description: A graph $G$ is $k$-$weighted-list-antimagic$ if for any vertex weighting $ω\colon V(G)\to\mathbb{R}$ and any list assignment $L\colon E(G)\to2^{\mathbb{R}}$ with $|L(e)|\geq |E(G)|+k$ there exists an edge labeling $f$ such that $f(e)\in L(e)$ for all $e\in E(G)$, labels of edges are pairwise distinct, and the sum of the labels on edges incident to a vertex plus the weight of that vertex is distinct from the sum at every other vertex. In this paper we prove that every graph on $n$ vertices having no $K_1$ or $K_2$ component is $\lfloor{\frac{4n}{3}}\rfloor$-weighted-list-antimagic. An oriented graph $G$ is $k$-$oriented-antimagic$ if there exists an injective edge labeling from $E(G)$ into $\{1,\dotsc,|E(G)|+k\}$ such that the sum of the labels on edges incident to and oriented toward a vertex minus the sum of the labels on edges incident to and oriented away from that vertex is distinct from the difference of sums at every other vertex. We prove that every graph on $n$ vertices with no $K_1$ component admits an orientation that is $\lfloor{\frac{2n}{3}}\rfloor$-oriented-antimagic.
description: 10 pages, 1 figure
Patterns in Inversion Sequences I
Creators: name: Corteel, Sylvie
name: Martinez, Megan A.
name: Savage, Carla D.
name: Weselcouch, Michael
Publisher: name: arXiv
Year: 2015
Subjects: subject: Combinatorics (math.CO)
subject: FOS: Mathematics
subject: 05A05, 05A19

description: Permutations that avoid given patterns have been studied in great depth for their connections to other fields of mathematics, computer science, and biology. From a combinatorial perspective, permutation patterns have served as a unifying interpretation that relates a vast array of combinatorial structures. In this paper, we introduce the notion of patterns in inversion sequences. A sequence $(e_1,e_2,\ldots,e_n)$ is an inversion sequence if $0 \leq e_i π_i \}|$. This correspondence makes it a natural extension to study patterns in inversion sequences much in the same way that patterns have been studied in permutations. This paper, the first of two on patterns in inversion sequences, focuses on the enumeration of inversion sequences that avoid words of length three. Our results connect patterns in inversion sequences to a number of well-known numerical sequences including Fibonacci numbers, Bell numbers, Schröder numbers, and Euler up/down numbers.
Bildnis der Octavia
Creators: name: Winter, Fr.
Publisher: name: Bonner Jahrbücher
Year: 2018

description: [nicht vorhanden / not available]
description: Bonner Jahrbücher, Bd. 128 (1923): Bonner Jahrbücher : Jahrbücher des Vereins von Altertumsfreunden im Rheinlande
Additional file 2 of Identification of cerebral spinal fluid protein biomarkers in Niemann-Pick disease, type C1
Creators: name: Campbell, Kiersten
name: Cawley, Niamh X.
name: Luke, Rachel
name: Scott, Katelin E. J.
name: Johnson, Nicholas
name: Farhat, Nicole Y.
name: Alexander, Derek
name: Wassif, Christopher A.
name: Li, Wenping
name: Cologna, Stephanie M.
name: Berry-Kravis, Elizabeth
name: Do, An Dang
name: Dale, Ryan K.
name: Porter, Forbes D.
Publisher: name: figshare
Year: 2023
Subjects: subject: Biochemistry
subject: Medicine
subject: Genetics
subject: FOS: Biological sciences
subject: Neuroscience
subject: Physiology
subject: 69999 Biological Sciences not elsewhere classified
subject: Cancer
subject: 110309 Infectious Diseases
subject: FOS: Health sciences

description: Additional file 2: Figure 2. ELISA results for FABP5. For NPC1 samples open circles correspond to individuals who were on miglustat.
Search for Supersymmetry in Events with Large Missing Transverse Momentum, Jets, and at Least One Tau Lepton in 7 TeV Proton-Proton Collision Data with the ATLAS Detector
Creators: name: The ATLAS Collaboration
Publisher: name: arXiv
Year: 2012
Subjects: subject: High Energy Physics - Experiment (hep-ex)
subject: FOS: Physical sciences

description: A search for supersymmetry (SUSY) in events with large missing transverse momentum, jets, and at least one hadronically decaying tau lepton, with zero or one additional light lepton (e/mu), has been performed using 4.7 fb-1 of proton-proton collision data at sqrt(s) = 7 TeV recorded with the ATLAS detector at the Large Hadron Collider. No excess above the Standard Model background expectation is observed and a 95% confidence level visible cross-section upper limit for new phenomena is set. In the framework of gauge-mediated SUSY-breaking models, lower limits on the mass scale Lambda are set at 54 TeV in the regions where the stau is the next-to-lightest SUSY particle (tan(beta) > 20). These limits provide the most stringent tests to date of GMSB models in a large part of the parameter space considered.
description: 11 pages plus author list (25 pages in total), 5 figures, 4 tables, submitted to EPJC
Additional file 2 of Evolutionary trade-off between innate and acquired immune defences in birds
Creators: name: Minias, Piotr
name: Peng, Wei-Xuan V. -H.
name: Matson, Kevin D.
Publisher: name: figshare
Year: 2023
Subjects: subject: Immunology
subject: FOS: Clinical medicine

description: Additional file 2. Supplementary methods and supplementary results of Bayesian phylogenetic mixed models testing associations between innate and acquired immune defences in birds (Tables S1–S3 and Fig. S1).
Shortest paths in one-counter systems
Creators: name: Chistikov, Dmitry
name: Czerwiński, Wojciech
name: Hofman, Piotr
name: Pilipczuk, Michał
name: Wehar, Michael
Publisher: name: arXiv
Year: 2015
Subjects: subject: Formal Languages and Automata Theory (cs.FL)
subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences

description: We show that any one-counter automaton with $n$ states, if its language is non-empty, accepts some word of length at most $O(n^2)$. This closes the gap between the previously known upper bound of $O(n^3)$ and lower bound of $Ω(n^2)$. More generally, we prove a tight upper bound on the length of shortest paths between arbitrary configurations in one-counter transition systems (weaker bounds have previously appeared in the literature).
description: 28 pages, 2 figures
Inhalt / Impressum
Creators: name: Redaktion, Die
Publisher: name: Unser Münster / Die Informationsschrift des Münsterbauvereins Breisach e.V.
Year: 2017

description: Unser Münster / Die Informationsschrift des Münsterbauvereins Breisach e.V., Nr. 54 (2017): Unser Münster: Meisterliche Altäre
The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations
Creators: name: Albert, Michael H.
name: Lackner, Marie-Louise
name: Lackner, Martin
name: Vatter, Vincent
Publisher: name: arXiv
Year: 2015
Subjects: subject: Combinatorics (math.CO)
subject: Data Structures and Algorithms (cs.DS)
subject: FOS: Mathematics
subject: FOS: Computer and information sciences
subject: 05A05, 68Q25

description: The Permutation Pattern Matching problem, asking whether a pattern permutation $π$ is contained in a permutation $τ$, is known to be NP-complete. In this paper we present two polynomial time algorithms for special cases. The first algorithm is applicable if both $π$ and $τ$ are $321$-avoiding; the second is applicable if $π$ and $τ$ are skew-merged. Both algorithms have a runtime of $O(kn)$, where $k$ is the length of $π$ and $n$ the length of $τ$.
Mathematical Modeling for Tomography in Domains with Reflecting Obstacles
Creators: name: Lozev, Kamen
Publisher: name: arXiv
Year: 2012
Subjects: subject: Numerical Analysis (math.NA)
subject: FOS: Mathematics

description: This work develops new numerical methods for the solution of the tomography problem in domains with reflecting obstacles. We compare the solution's performance for Lambertian reflection, for classical tomography with unbroken rays and for specular reflection. Our numerical method using Lambertian reflection improves the solution's accuracy by an order of magnitude compared to classical tomography with unbroken rays and for tomography in the presence of a specularly reflecting obstacle the numerical method improves the solution's accuracy approximately by a factor of three times. We present efficient new algorithms for the solution's software implementation and analyze the solution's performance and effectiveness. The new method from this work for reducing the number of equations in tomography linear systems is applicable to improving the performance of a wide class of algebraic tomographic reconstruction methods.
description: 10 pages, 4 tables. arXiv admin note: substantial text overlap with arXiv:1209.0130
The permutation class Av(4213,2143)
Creators: name: Bevan, David
Publisher: name: arXiv
Year: 2015
Subjects: subject: Combinatorics (math.CO)
subject: FOS: Mathematics
subject: 05A05, 05A15, 05A16

description: We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutation consists of the skew sum of a sequence of plane trees, together with an increasing sequence of points above and an increasing sequence of points to its left. We use this characterisation to establish the generating function enumerating these permutations. We also investigate the properties of a typical large permutation in the class and prove that if a large permutation that avoids 4213 and 2143 is chosen uniformly at random, then it is more likely than not to avoid 2413 as well.
description: 14 pages
Descent c-Wilf Equivalence
Creators: name: Bach, Quang T.
name: Remmel, Jeffrey B.
Publisher: name: arXiv
Year: 2015
Subjects: subject: Combinatorics (math.CO)
subject: FOS: Mathematics
subject: 05A15, 05E05

description: Let $S_n$ denote the symmetric group. For any $σ\in S_n$, we let $\mathrm{des}(σ)$ denote the number of descents of $σ$, $\mathrm{inv}(σ)$ denote the number of inversions of $σ$, and $\mathrm{LRmin}(σ)$ denote the number of left-to-right minima of $σ$. For any sequence of statistics $\mathrm{stat}_1, \ldots \mathrm{stat}_k$ on permutations, we say two permutations $α$ and $β$ in $S_j$ are $(\mathrm{stat}_1, \ldots \mathrm{stat}_k)$-c-Wilf equivalent if the generating function of $\prod_{i=1}^k x_i^{\mathrm{stat}_i}$ over all permutations which have no consecutive occurrences of $α$ equals the generating function of $\prod_{i=1}^k x_i^{\mathrm{stat}_i}$ over all permutations which have no consecutive occurrences of $β$. We give many examples of pairs of permutations $α$ and $β$ in $S_j$ which are $\mathrm{des}$-c-Wilf equivalent, $(\mathrm{des},\mathrm{inv})$-c-Wilf equivalent, and $(\mathrm{des},\mathrm{inv},\mathrm{LRmin})$-c-Wilf equivalent. For example, we will show that if $α$ and $β$ are minimally overlapping permutations in $S_j$ which start with 1 and end with the same element and $\mathrm{des}(α) = \mathrm{des}(β)$ and $\mathrm{inv}(α) = \mathrm{inv}(β)$, then $α$ and $β$ are $(\mathrm{des},\mathrm{inv})$-c-Wilf equivalent.
description: arXiv admin note: text overlap with arXiv:1510.04319
Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations
Creators: name: Bastos, Josefran de Oliveira
name: Coregliano, Leonardo Nagami
Publisher: name: arXiv
Year: 2015
Subjects: subject: Combinatorics (math.CO)
subject: Discrete Mathematics (cs.DM)
subject: FOS: Mathematics
subject: FOS: Computer and information sciences
subject: 05A05 (Primary), 05D99 (Secondary)

description: In this paper, we present two new results of layered permutation densities. The first one generalizes theorems from Hästö (2003) and Warren (2004) to compute the permutation packing of permutations whose layer sequence is~$(1^a,\ell_1,\ell_2,\ldots,\ell_k)$ with~$2^a-a-1\geq k$ (and similar permutations). As a second result, we prove that the minimum density of monotone sequences of length~$k+1$ in an arbitrarily large layered permutation is asymptotically~$1/k^k$. This value is compatible with a conjecture from Myers (2003) for the problem without the layered restriction (the same problem where the monotone sequences have different lengths is also studied).
description: 24 pages
Additional file 3 of Identification of cerebral spinal fluid protein biomarkers in Niemann-Pick disease, type C1
Creators: name: Campbell, Kiersten
name: Cawley, Niamh X.
name: Luke, Rachel
name: Scott, Katelin E. J.
name: Johnson, Nicholas
name: Farhat, Nicole Y.
name: Alexander, Derek
name: Wassif, Christopher A.
name: Li, Wenping
name: Cologna, Stephanie M.
name: Berry-Kravis, Elizabeth
name: Do, An Dang
name: Dale, Ryan K.
name: Porter, Forbes D.
Publisher: name: figshare
Year: 2023
Subjects: subject: Biochemistry
subject: Medicine
subject: Genetics
subject: FOS: Biological sciences
subject: Neuroscience
subject: Physiology
subject: 69999 Biological Sciences not elsewhere classified
subject: Cancer
subject: 110309 Infectious Diseases
subject: FOS: Health sciences

description: Additional file 3: Figure 3. ELISA results for CALB2, CHI3L1, MIF, CCL18 and FABP5 separated by miglustat therapy status. P-values are from unpaired, two-sided t-tests.
คำคม คนคณิตศาสตร์ เบลส์ ปาสกาล : รูปสามเหลี่ยมของปาสกาล
Creators: name: จิณดิษฐ์ ละออปักษิณ
Publisher: name: วารสารคณิตศาสตร์ โดย สมาคมคณิตศาสตร์แห่งประเทศไทย ในพระบรมราชูปถัมภ์
Year: 2021
Subjects: ปาสกาล
ชีวประวัติ
คำคมคนคณิตศาสตร์

description: วารสารคณิตศาสตร์ โดย สมาคมคณิตศาสตร์แห่งประเทศไทย ในพระบรมราชูปถัมภ์, 66, 704, 1 - 6
Jubiläumswein feierlich gekürt
Creators: name: Johanßen, Henning
Publisher: name: Unser Münster / Die Informationsschrift des Münsterbauvereins Breisach e.V.
Year: 2017

description: Unser Münster / Die Informationsschrift des Münsterbauvereins Breisach e.V., Nr. 54 (2017): Unser Münster: Meisterliche Altäre
Additional file 1 of Delivering the Thinking Healthy Programme as a universal group intervention integrated into routine antenatal care: a randomized-controlled pilot study
Creators: name: Boran, Perran
name: Dönmez, Melike
name: Barış, Ezgi
name: Us, Mahmut Caner
name: Altaş, Zeynep Meva
name: Nisar, Anum
name: Atif, Najia
name: Sikander, Siham
name: Hıdıroğlu, Seyhan
name: Save, Dilşad
name: Rahman, Atif
Publisher: name: figshare
Year: 2023
Subjects: subject: Medicine
subject: Cell Biology
subject: Biotechnology
subject: 69999 Biological Sciences not elsewhere classified
subject: FOS: Biological sciences
subject: Cancer
subject: Science Policy
subject: 111714 Mental Health
subject: FOS: Health sciences

description: Additional file 1. Description of the assessment instruments.
title: The Use of Innovative Learning Methods in the System of Modern Economic Education in the Russian Federation
Creators: name: Pashkov, Aleksey
name: Mikhailova, Anna
name: Gryaznukhin, Aleksandr
name: Movchun, Vasily
name: Dvoryankin, Oleg
name: Natalia, Ivanova
Publisher: name: TEM Journal
Year: 2020

description: We proposed ways to solve the issues by applying the latest learning models used in the formal and informal education processes, in particular, the methods of case study, brainstorming, gamification, and mass open online courses; considered the relevance of using the methods and their implementation in the economic and business education; and provided examples of successful application of the state-of-theart teaching modes in Russia. The study has shown that a more thorough implementation of the theoretical background of the education process can be achieved by combining innovative and conventional methods. The obtained results can be used in developing curricula and education programs, as well as in the process of bringing the education system of the Russian Federation in compliance with the modern requirements.
Quantifying Morphological Computation
Creators: name: Zahedi, Keyan
name: Ay, Nihat
Publisher: name: arXiv
Year: 2013
Subjects: subject: Artificial Intelligence (cs.AI)
subject: Information Theory (cs.IT)
subject: FOS: Computer and information sciences

description: The field of embodied intelligence emphasises the importance of the morphology and environment with respect to the behaviour of a cognitive system. The contribution of the morphology to the behaviour, commonly known as morphological computation, is well-recognised in this community. We believe that the field would benefit from a formalisation of this concept as we would like to ask how much the morphology and the environment contribute to an embodied agent's behaviour, or how an embodied agent can maximise the exploitation of its morphology within its environment. In this work we derive two concepts of measuring morphological computation, and we discuss their relation to the Information Bottleneck Method. The first concepts asks how much the world contributes to the overall behaviour and the second concept asks how much the agent's action contributes to a behaviour. Various measures are derived from the concepts and validated in two experiments which highlight their strengths and weaknesses.
Pattern avoidance in forests of binary shrubs
Creators: name: Bevan, David
name: Levin, Derek
name: Nugent, Peter
name: Pantone, Jay
name: Pudwell, Lara
name: Riehl, Manda
name: Tlachac, ML
Publisher: name: arXiv
Year: 2015
Subjects: subject: Combinatorics (math.CO)
subject: FOS: Mathematics

description: We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary shrub forests. In this context, we enumerate forests avoiding patterns of length three. In four of the five non-equivalent cases, we present explicit enumerations by exhibiting bijections with certain lattice paths bounded above by the line $y=\ell x$, for some $\ell\in\mathbb{Q}^+$, one of these being the celebrated Duchon's club paths with $\ell=2/3$. In the remaining case, we use the machinery of analytic combinatorics to determine the minimal polynomial of its generating function, and deduce its growth rate.
title: Development and Validation of a Synchronous Model to Simulate Skeletal Muscle Damage Due to Spaceflight Ionizing Radiation and Microgravity
Creators: name: Caldwell, Lori M.
Publisher: name: Utah State University
Year: 2020

description: Astronauts traveling or researching in space are subject to a harsh environment that includes high levels of ionizing radiation and microgravity. Ionizing radiation is dangerous to overall health because it causes double-stranded DNA breaks, increases the production of free radicals or reactive oxygen species, and leads to an enhanced risk of cardiovascular disease and cancer over a person’s lifetime. Similarly, microgravity is hazardous to astronaut health because humans require gravity to maintain a healthy heart and muscular and vascular systems.
Both ionizing radiation and microgravity have been studied individually in previous research, but there is a lack of information on how these stressors work in combination to damage cellular health. To simulate the spaceflight radiation environment, Utah State University’s Space Survivability Test Chamber was used to irradiate mouse skeletal muscle cells with doses similar to what astronauts will be exposed to on a Mars mission. Microgravity was simulated within the radiation test chamber by designing a custom miniature rotary cell culture system. This device rotates muscle cells growing on polystyrene microcarrier beads so that the cell clusters remain suspended at their terminal settling velocity.
The mouse muscle cells irradiated with a long-term spaceflight dosage exhibited significant amounts of double-stranded DNA damage as well as significantly increased production of reactive oxygen species compared to the short-term mission models. The combined model of ionizing radiation and microgravity designed here is more representative of the spaceflight environment than either condition alone. Our model is a valuable platform that can be used to study the effects of space travel on a variety of cell types and test potential treatments.
Particle dynamics in two-dimensional random energy landscapes - experiments and simulations
Creators: name: Evers, Florian
name: Zunke, Christoph
name: Hanes, Richard D. L.
name: Bewerunge, Joerg
name: Ladadwa, Imad
name: Heuer, Andreas
name: Egelhaaf, Stefan U.
Publisher: name: arXiv
Year: 2013
Subjects: subject: Soft Condensed Matter (cond-mat.soft)
subject: FOS: Physical sciences

description: The dynamics of individual colloidal particles in random potential energy landscapes were investigated experimentally and by Monte Carlo simulations. The value of the potential at each point in the two-dimensional energy landscape follows a Gaussian distribution. The width of the distribution, and hence the degree of roughness of the energy landscape, was varied and its effect on the particle dynamics studied. This situation represents an example of Brownian dynamics in the presence of disorder. In the experiments, the energy landscapes were generated optically using a holographic set-up with a spatial light modulator, and the particle trajectories were followed by video microscopy. The dynamics are characterized using, e.g., the time-dependent diffusion coefficient, the mean squared displacement, the van Hove function and the non-Gaussian parameter. In both, experiments and simulations, the dynamics are initially diffusive, show an extended sub-diffusive regime at intermediate times before diffusive motion is recovered at very long times. The dependence of the long-time diffusion coefficient on the width of the Gaussian distribution agrees with theoretical predictions. Compared to the dynamics in a one-dimensional potential energy landscape, the localization at intermediate times is weaker and the diffusive regime at long times reached earlier, which is due to the possibility to avoid local maxima in two-dimensional energy landscapes.
Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays
Creators: name: Pan, Ran
name: Remmel, Jeffrey B.
Publisher: name: arXiv
Year: 2015
Subjects: subject: Combinatorics (math.CO)
subject: FOS: Mathematics

description: A permutation $τ$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $τ$ in a permutation $σ$ can share at most one element. Bóna \cite{B} showed that the proportion of minimal overlapping patterns in $S_j$ is at least $3 -e$. Given a permutation $σ$, we let $\text{Des}(σ)$ denote the set of descents of $σ$. We study the class of permutations $σ\in S_{kn}$ whose descent set is contained in the set $\{k,2k, \ldots (n-1)k\}$. For example, up-down permutations in $S_{2n}$ are the set of permutations whose descent equal $σ$ such that $\text{Des}(σ) = \{2,4, \ldots, 2n-2\}$. There are natural analogues of the minimal overlapping permutations for such classes of permutations and we study the proportion of minimal overlapping patterns for each such class. We show that the proportion of minimal overlapping permutations in such classes approaches $1$ as $k$ goes to infinity. We also study the proportion of minimal overlapping patterns in standard Young tableaux of shape $(n^k)$.
description: Accepted by Discrete Math and Theoretical Computer Science. Thank referees' for their suggestions
Physical-Layer Multicasting by Stochastic Transmit Beamforming and Alamouti Space-Time Coding
Creators: name: Wu, Xiaoxiao
name: Ma, Wing-Kin
name: So, Anthony Man-Cho
Publisher: name: arXiv
Year: 2013
Subjects: subject: Information Theory (cs.IT)
subject: FOS: Computer and information sciences

description: Consider transceiver designs in a multiuser multi-input single-output (MISO) downlink channel, where the users are to receive the same data stream simultaneously. This problem, known as physical-layer multicasting, has drawn much interest. Presently, a popularized approach is transmit beamforming, in which the beamforming optimization is handled by a rank-one approximation method called semidefinite relaxation (SDR). SDR-based beamforming has been shown to be promising for a small or moderate number of users. This paper describes two new transceiver strategies for physical-layer multicasting. The first strategy, called stochastic beamforming (SBF), randomizes the beamformer in a per-symbol time-varying manner, so that the rank-one approximation in SDR can be bypassed. We propose several efficiently realizable SBF schemes, and prove that their multicast achievable rate gaps with respect to the MISO multicast capacity must be no worse than 0.8314 bits/s/Hz, irrespective of any other factors such as the number of users. The use of channel coding and the assumption of sufficiently long code lengths play a crucial role in achieving the above result. The second strategy combines transmit beamforming and the Alamouti space-time code. The result is a rank-two generalization of SDR-based beamforming. We show by analysis that this SDR-based beamformed Alamouti scheme has a better worst-case effective signal-to-noise ratio (SNR) scaling, and hence a better multicast rate scaling, than SDR-based beamforming. We further the work by combining SBF and the beamformed Alamouti scheme, wherein an improved constant rate gap of 0.39 bits/s/Hz is proven. Simulation results show that under a channel-coded, many-user setting, the proposed multicast transceiver schemes yield significant SNR gains over SDR-based beamforming at the same bit error rate level.
description: To appear in IEEE Transactions on Signal Processing