cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
Study of reliability of the on-tether subsystem of a tethered high-altitude unmanned telecommunication platform
Creators: name: Dharmaraja Selvamuthua
name: Adwaith H. Sivama
name: Raja, Raina
name: Vishnevskyb, Vladimir
Publisher: name: Reliability: Theory & Applications
Year: 2023
Subjects: Markov chain
reliability
tethered high-altitude platform
unmanned aerial vehicle

description: High-altitude platform (HAP) are stations on an object at an altitude of around 15-50 km at a specified nominal fixed point relative to Earth. Tethered high-altitude platform (tHAP) are unmanned aerial vehicle that are connected to the ground via a tether with a lift height of 100 − 150 meters, and a multi-copter as high altitude mode. The reliability of the tHAP can be assessed with a focus on the tether that connects it to the ground. This article proposes a Markov model which obtain the reliability of the tHAP. The tether is considered to be made up of multiple wires in such a way that the tether still operates for a given number of functioning wires. The failure rates of the wires are dependent on the number of failed wires. Through the reliability analysis of the proposed Markov model, the key performance measures such as reliability of the system, mean time between failures and the probability of the system being reliable are computed. The optimal number of wires is also obtained via the numerical computation of the performance measures.
STOCHASTIC ANALYSIS OF DISCRETE PARAMETRIC MARKOV CHAIN SYSTEM MODEL
Creators: name: Kumar, Manoj
name: Kumar, Shiv
Publisher: name: Reliability: Theory & Applications
Year: 2023
Subjects: Geometric distribution
Steady state transition probability
MTSF
Availability
Busy period
and Cost-benefit analysis

description: The present paper deals with the behavior of the parallel model system of two non-identical units, warm standby models have been developed by in view of all random variables are independent. Initially priority unit is working and the non-priority unit is warm standby. Two repairmen are always available with the system to carry out the system operation as soon as possible, skilled repairmen carry out phase-1 repair while ordinary repairmen carry out a phase-2 repair. The main unit is take two phases for his repair while the repair of the ordinary unit is completed in one phase. The statistical measures of the model are analyzed probabilistically by applying the regenerative point technique the distribution of failure and repair time of the system taken as a geometric distribution with different parameters.
Additional file 1 of A scaffolded and annotated reference genome of giant kelp (Macrocystis pyrifera)
Creators: name: Diesel, Jose
name: Molano, Gary
name: Montecinos, Gabriel J.
name: DeWeese, Kelly
name: Calhoun, Sara
name: Kuo, Alan
name: Lipzen, Anna
name: Salamov, Asaf
name: Grigoriev, Igor V.
name: Reed, Daniel C.
name: Miller, Robert J.
name: Nuzhdin, Sergey V.
name: Alberto, Filipe
Publisher: name: figshare
Year: 2023
Subjects: subject: Genetics
subject: FOS: Biological sciences

description: Additional file 1: Supplementary Figure 1. Kmer distributions generated from corrected Pacbio reads. The genome size can be estimated by summing the total number of kmers found in the Pacbio reads and dividing by the peak of kmers (essentially the coverage for the genome). For a kmer size of k = 25, the coverage was x28 and the genome estimate was ~495 MB. For a kmer size of k = 31, the coverage was x27 and the genome estimate was ~523 MB. Supplementary Figure 2. Percentage of variants found in different regions of the genome. Supplementary Figure 3. Decontamination of the giant kelp reference genome. Blobtools results showing the distribution of GC content, coverage, and taxonomic classification. Filters selected contigs with GC content between 0.35-0.65 with coverage between 5x-300x, with the addition of 29 contigs manually checked. Supplementary Table 1. Summary of repetitive elements in the giant kelp genome. Supplementary Table 2. Summary of impact of mutation by functional class.
THE INVERSE BURR LOG-LOGISTIC DISTRIBUTION: PROPERTIES, APPLICATIONS AND DIFFERENT METHODS OF ESTIMATION
Creators: name: Opone, Festus C.
name: Karakaya, Kadir
name: Osagiede, Francis E.U.
Publisher: name: Reliability: Theory & Applications
Year: 2023
Subjects: Bur distribution
log-logistic distribution
parameter estimation
quantile

description: Lifetime distributions have played a significant role in lifetime data analysis. Despite the numerous distributions in literature, there have been several motivations for developing new ones. In this paper, a new lifetime distribution is proposed. Some important functions of the new distribution, such as probability density, cumulative distribution, survival, hazard, and quantile are derived in closed form. Some distributional properties such as moments, moment generating function, linear representation, probability weighted moments, etc. are obtained. Some estimators such as the least square estimator (LSE), the weighted least square estimator (WLSE), the Anderson-Darling estimator (ADE) and the Cramer-von Mises estimator (CvME) are investigated for three unknown parameters. The efficiency of the estimators is checked via Monte Carlo simulation based on the bias and mean square error criteria. The usability of the new distribution is investigated with two real data sets and empirical results obtained reveal that the new distribution offers a promising fit for the data sets under study.
Convolution Algebras: Relational Convolution, Generalised Modalities and Incidence Algebras
Creators: name: Dongol, Brijesh
name: Hayes, Ian J.
name: Struth, Georg
Publisher: name: arXiv
Year: 2017
Subjects: subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences

description: Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of relational convolution leads to generalised binary and unary modal operators for qualitative and quantitative models, and to more conventional variants, when ternary relations arise from identities over partial semigroups. Convolution-based semantics for fragments of categorial, linear and incidence (segment or interval) logics are provided as qualitative applications. Quantitative examples include algebras of durations and mean values in the duration calculus.
High-yield parallel fabrication of quantum-dot monolayer single-electron devices displaying Coulomb staircase, contacted by graphene.
Creators: name: Fruhman, Joel M
name: Astier, Hippolyte P A G
name: Ehrler, Bruno
name: Böhm, Marcus L
name: Eyre, Lissa F L
name: Kidambi, Piran R
name: Sassi, Ugo
name: De Fazio, Domenico
name: Griffiths, Jonathan P
name: Robson, Alexander J
name: Robinson, Benjamin J
name: Hofmann, Stephan
name: Ferrari, Andrea C
name: Ford, Christopher J B
Publisher: name: Apollo - University of Cambridge Repository
Year: 2021

description: It is challenging for conventional top-down lithography to fabricate reproducible devices very close to atomic dimensions, whereas identical molecules and very similar nanoparticles can be made bottom-up in large quantities, and can be self-assembled on surfaces. The challenge is to fabricate electrical contacts to many such small objects at the same time, so that nanocrystals and molecules can be incorporated into conventional integrated circuits. Here, we report a scalable method for contacting a self-assembled monolayer of nanoparticles with a single layer of graphene. This produces single-electron effects, in the form of a Coulomb staircase, with a yield of 87 ± 13% in device areas ranging from 2 to 16 μm2, containing up to 650,000 nanoparticles. Our technique offers scalable assembly of ultra-high densities of functional particles or molecules that could be used in electronic integrated circuits, as memories, switches, sensors or thermoelectric generators.
Duality-symmetric actions for non-Abelian tensor fields
Creators: name: Bandos, Igor
name: Samtleben, Henning
name: Sorokin, Dmitri
Publisher: name: arXiv
Year: 2013
Subjects: subject: High Energy Physics - Theory (hep-th)
subject: FOS: Physical sciences

description: We construct the duality-symmetric actions for a large class of six-dimensional models describing hierarchies of non-Abelian scalar, vector and tensor fields related to each other by first-order (self-)duality equations that follow from these actions. In particular, this construction provides a Lorentz invariant action for non-Abelian self-dual tensor fields. The class of models includes the bosonic sectors of the 6d (1,0) superconformal models of interacting non-Abelian self-dual tensor, vector, and hypermultiplets.
description: 28 pages, v2: minor corrections, references added and updated
Die Kunstdenkmäler der Rheinprovinz. Erster Band. I. Die Kunstdenkmäler des Kreises Kempen; II. Die Kunstdenkmäler des Kreises Geldern
Creators: name: Wiedemann, Alfred
Publisher: name: Bonner Jahrbücher
Year: 2018

description: Rezension zu: Die Kunstdenkmäler der Rheinprovinz. Erster Band. I. Die Kunstdenkmäler des Kreises Kempen; II. Die Kunstdenkmäler des Kreises Geldern. Im Aufträge des Provinzialverbandes der Rheinprovinz herausgegeben von Paul Clemen. Düsseldorf. L. Schwann, 1891. gr. 8. XIV und 137; II und 113 S.
description: Bonner Jahrbücher, Bd. 92 (1892): Jahrbücher des Vereins von Alterthumsfreunden im Rheinlande
Iwasawa theory for symmetric powers of CM modular forms at non-ordinary primes
Creators: name: Harron, Robert
name: Lei, Antonio
Publisher: name: arXiv
Year: 2012
Subjects: subject: Number Theory (math.NT)
subject: FOS: Mathematics
subject: 11R23, 11F80, 11F67

description: Let f be a cuspidal newform with complex multiplication (CM) and let p be an odd prime at which f is non-ordinary. We construct admissible p-adic L-functions for the symmetric powers of f, thus verifying general conjectures of Dabrowski and Panchishkin in this special case. We also construct their "mixed" plus and minus counterparts and prove an analogue of Pollack's decomposition of the admissible p-adic L-functions into mixed plus and minus p-adic L-functions. On the arithmetic side, we define corresponding mixed plus and minus Selmer groups. We unite the arithmetic with the analytic by first formulating the Main Conjecture of Iwasawa Theory relating the plus and minus Selmer groups with the plus and minus p-adic L-functions, and then proving the exceptional zero conjecture for the admissible p-adic L-functions. The latter result takes advantage of recent work of Benois, while the former uses recent work of the second author, as well as the main conjecture of Mazur-Wiles.
description: Submitted. 24 pages. Comments welcome!
Transmuted Exponentiated Kumaraswamy Distribution
Creators: name: Jeena Joseph
name: Ravindran, Meera
Publisher: name: Reliability: Theory & Applications
Year: 2023
Subjects: Bonferroni and Lorenz curves
Hazard function
Maximum likelihood estimation
Moments
Transmuted Exponentiated Kumaraswamy Distribution
Transmuted family

description: In this paper, a generalization of the Exponentiated Kumaraswamy distribution referred to as the Transmuted Exponentiated Kumaraswamy distribution is proposed. The new transmuted distribution is developed using the quadratic rank transmutation map. The mathematical properties of the new distribution is provided. Explicit expressions are derived for the moments, incomplete moments, moment generating function, quantile function, entropy, mean deviation and order statistics. Survival analysis is also performed. The distribution parameters are estimated using the method of maximum likelihood. Simulation of random variables is performed in order to investigate the performance of the estimates. An analysis using real life data is conducted to demonstrate the usefulness of the proposed distribution.
Othmar Jaeggi, Attisch-rotfigurige Vasen des 4. Jhs. v. Chr. Aus den Sammlungen des Historisch-Kulturellen Reservats in Kerč, Band IV. Bemalte Keramik
Creators: name: Söldner, Magdalene
Publisher: name: Bonner Jahrbücher
Year: 2018

description: Rezension zu: Othmar Jaeggi, Attisch-rotfigurige Vasen des 4. Jhs. v. Chr. Aus den Sammlungen des Historisch-Kulturellen Reservats in Kerč, Band IV. Bemalte Keramik. Mit Beiträgen von Lydia M. Lazenkova. Verlag Mystetstvo Publishers, Kiew 2012. 344 Seiten, 120 Farbtafeln und 20 schwarzweißen Profiltafeln.
description: Bonner Jahrbücher, Bd. 213.2013(2014): Bonner Jahrbücher
Monadic Second Order Logic with Measure and Category Quantifiers
Creators: name: Mio, Matteo
name: Skrzypczak, Michał
name: Michalewski, Henryk
Publisher: name: arXiv
Year: 2017
Subjects: subject: Logic in Computer Science (cs.LO)
subject: Formal Languages and Automata Theory (cs.FL)
subject: Logic (math.LO)
subject: FOS: Computer and information sciences
subject: FOS: Mathematics

description: We investigate the extension of Monadic Second Order logic, interpreted over infinite words and trees, with generalized "for almost all" quantifiers interpreted using the notions of Baire category and Lebesgue measure.
Messaggio (quasi) alieno per le antenne dell’Inaf
Creators: Paolo Soletta
Publisher: name: Media Inaf
Year: 2021

La scorsa primavera il Sardinia Radio Telescope ha inaugurato le osservazioni dedicate al progetto Seti. Oggi, il 30 luglio 2021, alcune piccole antenne installate accanto alla grande parabola hanno captato, insieme a un’antenna dell’Inaf di Bologna, un segnale “alieno” simulato, lanciato da un satellite dell’azienda italiana D–Orbit. La ricerca di vita extraterrestre passa anche da questi esperimenti
Local Redundancy in SAT: Generalizations of Blocked Clauses
Creators: name: Kiesl, Benjamin
name: Seidl, Martina
name: Tompits, Hans
name: Biere, Armin
Publisher: name: arXiv
Year: 2017
Subjects: subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences

description: Clause-elimination procedures that simplify formulas in conjunctive normal form play an important role in modern SAT solving. Before or during the actual solving process, such procedures identify and remove clauses that are irrelevant to the solving result. These simplifications usually rely on so-called redundancy properties that characterize cases in which the removal of a clause does not affect the satisfiability status of a formula. One particularly successful redundancy property is that of blocked clauses, because it generalizes several other redundancy properties. To find out whether a clause is blocked---and therefore redundant---one only needs to consider its resolution environment, i.e., the clauses with which it can be resolved. For this reason, we say that the redundancy property of blocked clauses is local. In this paper, we show that there exist local redundancy properties that are even more general than blocked clauses. We present a semantic notion of blocking and prove that it constitutes the most general local redundancy property. We furthermore introduce the syntax-based notions of set-blocking and super-blocking, and show that the latter coincides with our semantic blocking notion. In addition, we show how semantic blocking can be alternatively characterized via Davis and Putnam's rule for eliminating atomic formulas. Finally, we perform a detailed complexity analysis and relate our novel redundancy properties to prominent redundancy properties from the literature.
Intuitionistic Layered Graph Logic: Semantics and Proof Theory
Creators: name: Docherty, Simon
name: Pym, David
Publisher: name: arXiv
Year: 2017
Subjects: subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences
subject: F.4.1

description: Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called ILGL that gives an account of layering. The logic is a bunched system, combining the usual intuitionistic connectives, together with a non-commutative, non-associative conjunction (used to capture layering) and its associated implications. We give soundness and completeness theorems for a labelled tableaux system with respect to a Kripke semantics on graphs. We then give an equivalent relational semantics, itself proven equivalent to an algebraic semantics via a representation theorem. We utilise this result in two ways. First, we prove decidability of the logic by showing the finite embeddability property holds for the algebraic semantics. Second, we prove a Stone-type duality theorem for the logic. By introducing the notions of ILGL hyperdoctrine and indexed layered frame we are able to extend this result to a predicate version of the logic and prove soundness and completeness theorems for an extension of the layered graph semantics . We indicate the utility of predicate ILGL with a resource-labelled bigraph model.
TRUNCATED PRANAV DISTRIBUTION: PROPERTIES AND APPLICATIONS
Creators: name: Shukla, Kamlesh Kumar
Publisher: name: Reliability: Theory & Applications
Year: 2023
Subjects: Akash distribution
Lindley distribution
Moments
Right Truncated
Left Truncated

description: In this paper, truncated Pranav distribution has been proposed. The behavior of truncated Pranav distribution has been presented graphically. Moment based measures including coefficient of variation, skewness, kurtosis, and Index of dispersion have been derived and presented graphically. Nature of survival and hazard rate functions are presented graphically. Maximum likelihood method has been used to estimate the parameter of proposed model. Simulation based study of proposed distribution has also been discussed. It has been applied on two data sets and its superiority has been compare and checked using goodness of fit (AIC and K. S. test) over other truncated distributions as well as one parameter distribution, such as exponential, Lindley, Pranav, Ishita, truncated Akash, truncated Lindley, and truncated Akash distribution. It was found good fit over above-mentioned distributions. It can be considered as good lifetime distribution especially for non-skewed data.
Reasoning with Finite Sets and Cardinality Constraints in SMT
Creators: name: Bansal, Kshitij
name: Barrett, Clark
name: Reynolds, Andrew
name: Tinelli, Cesare
Publisher: name: arXiv
Year: 2017
Subjects: subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences

description: We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for modeling program constructs directly. More importantly, sets are a basic construct of mathematics and thus natural to use when formalizing the properties of computational systems. We develop a calculus describing a modular combination of a procedure for reasoning about membership constraints with a procedure for reasoning about cardinality constraints. Cardinality reasoning involves tracking how different sets overlap. For efficiency, we avoid considering Venn regions directly, as done in previous work. Instead, we develop a novel technique wherein potentially overlapping regions are considered incrementally as needed, using a graph to track the interaction among the different regions. The calculus has been designed to facilitate its implementation within SMT solvers based on the DPLL($T$) architecture. Our experimental results demonstrate that the new techniques are competitive with previous techniques and can scale much better on certain classes of problems.
On Interpolation and Symbol Elimination in Theory Extensions
Creators: name: Sofronie-Stokkermans, Viorica
Publisher: name: arXiv
Year: 2017
Subjects: subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences

description: In this paper we study possibilities of interpolation and symbol elimination in extensions of a theory $\mathcal{T}_0$ with additional function symbols whose properties are axiomatised using a set of clauses. We analyze situations in which we can perform such tasks in a hierarchical way, relying on existing mechanisms for symbol elimination in $\mathcal{T}_0$. This is for instance possible if the base theory allows quantifier elimination. We analyze possibilities of extending such methods to situations in which the base theory does not allow quantifier elimination but has a model completion which does. We illustrate the method on various examples.
WEIBULL COMPARISON BASED ON RELIABILITY, AVAILABILITY, MAINTAINABILITY, AND DEPENDABILITY (RAMD) ANALYSIS
Creators: name: Maihulla, Anas Sani
name: Yusuf, Ibrahim
name: Saminu I. Bala
Publisher: name: Reliability: Theory & Applications
Year: 2023
Subjects: Availability
life data
Weibull-distribution
Maple
Reliability
Reverse Osmosis

description: As a continuous probability distribution, the Weibull distribution is widely used in the study of reliability, availability and other life data. In this research, we propose the RAMD analysis to estimate the three-parameter Weibull distribution. The estimation of the distribution parameters is an important problem that has received a lot of attention from researchers because of their effects in several measurements. The real data results indicate that our proposed estimation method is significantly consistent in estimation compared to the RAMD analysis method. The numerical values of filtration system reliability and availability were calculated using Maple software. The system of first-order differential equations is formulated using a mnemonic approach and solved recursively. Several scenarios were examined to determine the impact of the models under consideration. The calculations were done with Maple 13 software. Other reliability measures such as mean time to failure (MTTF), mean time to repair (MTTR), and dependability ratio was estimated. The comparative analysis was conducted using a reverse osmosis (RO) filtration system.
Flash glucose monitoring with the FreeStyle Libre 2 compared with self-monitoring of blood glucose in suboptimally controlled type 1 diabetes: the FLASH-UK randomised controlled trial protocol.
Creators: name: Wilmot, Emma G
name: Evans, Mark
name: Barnard-Kelly, Katharine
name: Burns, M
name: Cranston, Iain
name: Elliott, Rachel Ann
name: Gkountouras, G
name: Kanumilli, N
name: Krishan, A
name: Kotonya, C
name: Lumley, S
name: Narendran, P
name: Neupane, Sankalpa
name: Rayman, Gerry
name: Sutton, Christopher
name: Taxiarchi, V P
name: Thabit, H
name: Leelarathna, L
Publisher: name: Apollo - University of Cambridge Repository
Year: 2021
Subjects: Clinical Trials
Health Economics
General Diabetes
Diabetes & Endocrinology
Humans
Diabetes Mellitus, Type 1
Blood Glucose
Hypoglycemic Agents
Blood Glucose Self-Monitoring
Adolescent
State Medicine
Multicenter Studies as Topic
Randomized Controlled Trials as Topic
Pandemics
United Kingdom
COVID-19
SARS-CoV-2

description: IntroductionOptimising glycaemic control in type 1 diabetes (T1D) remains challenging. Flash glucose monitoring with FreeStyle Libre 2 (FSL2) is a novel alternative to the current standard of care self-monitoring of blood glucose (SMBG). No randomised controlled trials to date have explored the potential benefits of FSL2 in T1D. We aim to assess the impact of FSL2 in people with suboptimal glycaemic control T1D in comparison with SMBG.MethodsThis open-label, multicentre, randomised (via stochastic minimisation), parallel design study conducted at eight UK secondary and primary care centres will aim to recruit 180 people age ≥16 years with T1D for >1 year and glycated haemoglobin (HbA1c) 7.5%-11%. Eligible participants will be randomised to 24 weeks of FSL2 (intervention) or SMBG (control) periods, after 2-week of blinded sensor wear. Participants will be assessed virtually or in-person owing to the COVID-19 pandemic. HbA1c will be measured at baseline, 12 and 24 weeks (primary outcome). Participants will be contacted at 4 and 12 weeks for glucose optimisation. Control participants will wear a blinded sensor during the last 2 weeks. Psychosocial outcomes will be measured at baseline and 24 weeks. Secondary outcomes include sensor-based metrics, insulin doses, adverse events and self-report psychosocial measures. Utility, acceptability, expectations and experience of using FSL2 will be explored. Data on health service resource utilisation will be collected.AnalysisEfficacy analyses will follow intention-to-treat principle. Outcomes will be analysed using analysis of covariance, adjusted for the baseline value of the corresponding outcome, minimisation factors and other known prognostic factors. Both within-trial and life-time economic evaluations, informed by modelling from the perspective of the National Health Service setting, will be performed.EthicsThe study was approved by Greater Manchester West Research Ethics Committee (reference 19/NW/0081). Informed consent will be sought from all participants.Trial registration numberNCT03815006.Protocol version4.0 dated 29 June 2020.
La calvizie dei buchi neri salva la relatività generale
Creators: Valentina Guglielmo
Publisher: name: Media Inaf
Year: 2021

I campi magnetici intorno ai buchi neri decadono rapidamente, scrivono in un articolo pubblicato su Physical Review Letters i ricercatori del Flatiron Institute, della Columbia e di Princeton. Grazie a complesse e lunghe simulazioni al supercomputer, gli scienziati hanno studiato la fisica del plasma attorno al buco nero con una risoluzione senza precedenti, salvando l’ipotesi della “calvizie” magnetica dei buchi neri prevista dalla relatività generale di Einstein
Tensione nella notte sulla Stazione spaziale
Creators: Redazione Ansa
Publisher: name: Media Inaf
Year: 2021

Un’accensione non pianificata del modulo russo Nauka (Multipurpose Laboratory Module) ha provocato un movimento inatteso della Iss. L’equipaggio non è mai stato e non è in pericolo, fa sapere la Nasa. II centro di controllo della missione, a Houston, sta monitorando la situazione e valutandone l’impatto sul lancio del veicolo spaziale Boeing Starliner, rinviato a martedì 3 agosto
A survey on difference hierarchies of regular languages
Creators: name: Carton, Olivier
name: Perrin, Dominique
name: Pin, Jean-Éric
Publisher: name: arXiv
Year: 2017
Subjects: subject: Formal Languages and Automata Theory (cs.FL)
subject: FOS: Computer and information sciences
subject: 68Q70, 68Q45, 20M35

description: Difference hierarchies were originally introduced by Hausdorff and they play an important role in descriptive set theory. In this survey paper, we study difference hierarchies of regular languages. The first sections describe standard techniques on difference hierarchies, mostly due to Hausdorff. We illustrate these techniques by giving decidability results on the difference hierarchies based on shuffle ideals, strongly cyclic regular languages and the polynomial closure of group languages.
Stochastic dynamics on slow manifolds
Creators: name: Constable, George W A
name: McKane, Alan J
name: Rogers, Tim
Publisher: name: arXiv
Year: 2013
Subjects: subject: Statistical Mechanics (cond-mat.stat-mech)
subject: Adaptation and Self-Organizing Systems (nlin.AO)
subject: Populations and Evolution (q-bio.PE)
subject: FOS: Physical sciences
subject: FOS: Biological sciences

description: The theory of slow manifolds is an important tool in the study of deterministic dynamical systems, giving a practical method by which to reduce the number of relevant degrees of freedom in a model, thereby often resulting in a considerable simplification. In this article we demonstrate how the same basic methodology may also be applied to stochastic dynamical systems, by examining the behaviour of trajectories conditioned on the event that they do not depart the slow manifold. We apply the method to two models: one from ecology and one from epidemiology, achieving a reduction in model dimension and illustrating the high quality of the analytical approximations.
description: 21 pages, 4 figures
Martin Galinier und François Baratte (Herausgeber), Iconographie funéraire romaine et société. Corpus antique, approche nouvelle?
Creators: name: Grüner, Cathrin
Publisher: name: Bonner Jahrbücher
Year: 2018

description: Rezension zu: Martin Galinier und François Baratte (Herausgeber), Iconographie funéraire romaine et société. Corpus antique, approche nouvelle? Collection Histoire de l’art, Band 3. Presses universitaires de Perpignan, Perpignan 2013. 272 Seiten, 189 schwarzweiße Abbildungen.
description: Bonner Jahrbücher, Bd. 213.2013(2014): Bonner Jahrbücher
Approximations of Geometrically Ergodic Reversible Markov Chains
Creators: name: Negrea, Jeffrey
name: Rosenthal, Jeffrey S.
Publisher: name: arXiv
Year: 2017
Subjects: subject: Probability (math.PR)
subject: FOS: Mathematics

description: A common tool in the practice of Markov Chain Monte Carlo is to use approximating transition kernels to speed up computation when the desired kernel is slow to evaluate or intractable. A limited set of quantitative tools exist to assess the relative accuracy and efficiency of such approximations. We derive a set of tools for such analysis based on the Hilbert space generated by the stationary distribution we intend to sample, $L_2(π)$. Our results apply to approximations of reversible chains which are geometrically ergodic, as is typically the case for applications to Markov Chain Monte Carlo. The focus of our work is on determining whether the approximating kernel will preserve the geometric ergodicity of the exact chain, and whether the approximating stationary distribution will be close to the original stationary distribution. For reversible chains, our results extend the results of Johndrow et al. [18] from the uniformly ergodic case to the geometrically ergodic case, under some additional regularity conditions. We then apply our results to a number of approximate MCMC algorithms.
Multichannel dynamical symmetry and cluster-coexistence
Creators: name: Cseh, J.
name: Kato, K.
Publisher: name: arXiv
Year: 2013
Subjects: subject: Nuclear Theory (nucl-th)
subject: FOS: Physical sciences

description: A composite symmetry of the nuclear structure, called multichannel dynamical symmetry is established. It can describe different cluster configurations (defined by different reaction channels) in a unified framework, thus it has a considerable predictive power. The two-channel case is presented in detail, and its conceptual similarity to the dynamical supersymmetry is discussed.
description: published in Phys. Rev. C 87,067301 (2013)
Steven Ditsch, Dis Manibus. Die römischen Grabdenkmäler aus der Pfalz
Creators: name: Kremer, Gabrielle
Publisher: name: Bonner Jahrbücher
Year: 2018

description: Rezension zu: Steven Ditsch, Dis Manibus. Die römischen Grabdenkmäler aus der Pfalz. Archäologische Forschungen in der Pfalz, Band 3. Selbstverlag der Stiftung zur Förderung der pfälzischen Geschichtsforschung, Neustadt a. d. Weinstraße 2011. 257 Seiten, 93 Tafeln.
description: Bonner Jahrbücher, Bd. 213.2013(2014): Bonner Jahrbücher
Stelle in crisi di mezza età
Creators: Giuseppe Fiasconaro
Publisher: name: Media Inaf
Year: 2021

Durante la loro evoluzione, le stelle simili al Sole sperimentano una fase caratterizzata da un brusco crollo della loro attività magnetica e da una diminuzione del ritmo di rallentamento della velocità di rotazione. Secondo un nuovo studio pubblicato Mnras Letters da tre astrofisici indiani, la causa di questa crisi di mezza età sarebbe la dinamo stellare meno efficiente
Peter Scholz, Den Vätern folgen. Sozialisation und Erziehung der republikanischen Senatsaristokratie
Creators: name: Linke, Bernhard
Publisher: name: Bonner Jahrbücher
Year: 2018

description: Rezension zu: Peter Scholz, Den Vätern folgen. Sozialisation und Erziehung der republikanischen Senatsaristokratie. Studien zur Alten Geschichte, Band 13. Verlag Antike, Berlin 2011. 424 Seiten.
description: Bonner Jahrbücher, Bd. 213.2013(2014): Bonner Jahrbücher
Computer-Assisted Proofs of Some Identities for Bessel Functions of Fractional Order
Creators: name: Gerhold, Stefan
name: Kauers, Manuel
name: Koutschan, Christoph
name: Paule, Peter
name: Schneider, Carsten
name: Zimmermann, Burkhard
Publisher: name: arXiv
Year: 2013
Subjects: subject: Symbolic Computation (cs.SC)
subject: FOS: Computer and information sciences

description: We employ computer algebra algorithms to prove a collection of identities involving Bessel functions with half-integer orders and other special functions. These identities appear in the famous Handbook of Mathematical Functions, as well as in its successor, the DLMF, but their proofs were lost. We use generating functions and symbolic summation techniques to produce new proofs for them.
description: Final version, some typos were corrected. 21 pages, uses svmult.cls
Quasifinite Representations of Classical Lie subalgebras of $W_{\infty,p}$
Creators: name: García, José I.
name: Liberati, José I.
Publisher: name: arXiv
Year: 2012
Subjects: subject: Representation Theory (math.RT)
subject: FOS: Mathematics

description: We show that there are exactly two anti-involution $σ_{\pm}$ of the algebra of differential operators on the circle that are a multiple of $p(t\partial_t)$ preserving the principal gradation ($p\in\CC[x]$ non-constant). We classify the irreducible quasifinite highest weight representations of the central extension $\hat{\D}_p^{\pm}$ of the Lie subalgebra fixed by $-σ_{\pm}$. The most important cases are the subalgebras $\hat{\D}_x^{\pm}$ of $W_{\infty}$, that are obtained when $p(x)=x$. In these cases we realize the irreducible quasifinite highest weight modules in terms of highest weight representation of the central extension of the Lie algebra of infinite matrices with finitely many non-zero diagonals over the algebra $\CC[u]/(u^{m+1})$ and its classical Lie subalgebras of $C$ and $D$ types.
description: arXiv admin note: text overlap with arXiv:math/9801136 by other authors
A Universal Ordinary Differential Equation
Creators: name: Bournez, Olivier
name: Pouly, Amaury
Publisher: name: arXiv
Year: 2017
Subjects: subject: Classical Analysis and ODEs (math.CA)
subject: Computational Complexity (cs.CC)
subject: Logic in Computer Science (cs.LO)
subject: Systems and Control (eess.SY)
subject: Dynamical Systems (math.DS)
subject: FOS: Mathematics
subject: FOS: Computer and information sciences
subject: FOS: Electrical engineering, electronic engineering, information engineering

description: An astonishing fact was established by Lee A. Rubel (1981): there exists a fixed non-trivial fourth-order polynomial differential algebraic equation (DAE) such that for any positive continuous function $φ$ on the reals, and for any positive continuous function $ε(t)$, it has a $\mathcal{C}^\infty$ solution with $| y(t) - φ(t) | < ε(t)$ for all $t$. Lee A. Rubel provided an explicit example of such a polynomial DAE. Other examples of universal DAE have later been proposed by other authors. However, Rubel's DAE \emph{never} has a unique solution, even with a finite number of conditions of the form $y^{(k_i)}(a_i)=b_i$. The question whether one can require the solution that approximates $φ$ to be the unique solution for a given initial data is a well known open problem [Rubel 1981, page 2], [Boshernitzan 1986, Conjecture 6.2]. In this article, we solve it and show that Rubel's statement holds for polynomial ordinary differential equations (ODEs), and since polynomial ODEs have a unique solution given an initial data, this positively answers Rubel's open problem. More precisely, we show that there exists a \textbf{fixed} polynomial ODE such that for any $φ$ and $ε(t)$ there exists some initial condition that yields a solution that is $ε$-close to $φ$ at all times. In particular, the solution to the ODE is necessarily analytic, and we show that the initial condition is computable from the target function and error function.
Due asteroidi fuori posto
Creators: Albino Carbognani
Publisher: name: Media Inaf
Year: 2021

Gli asteroidi della fascia principale (203) Pompeja e (269) Justitia mostrano il caratteristico colore rosso degli asteroidi che si trovano oltre l’orbita di Nettuno. Questa sorprendente scoperta conferma che nel Sistema solare, per effetto dell’interazione gravitazionale con i pianeti maggiori, c’è stata una migrazione di piccoli corpi dalla periferia verso il centro, come prevedono alcuni scenari dell’evoluzione planetaria
Protopianeti giganti dove non te li aspetti
Creators: Rossella Spiga
Publisher: name: Media Inaf
Year: 2021

Tracce di protopianeti giganti sono state riscontrate dal radiotelescopio Alma a grande distanza dalla stella nel sistema sistema Hd 100546. Il nuovo modello permette di interpretare dati precedenti che testimoniavano la presenza di acqua nel disco. Alla guida dello studio, pubblicato su Astronomy & Astrophysics, Davide Fedele dell’Istituto nazionale di astrofisica
Giochi di luci e ombre dal nucleo della galassia
Creators: Eleonora Ferroni
Publisher: name: Media Inaf
Year: 2021

Ic 5063 si trova a 156 milioni di anni luce da noi. Si tratta di una galassia attiva (Agn) pervasa da un affascinante gioco di luci e ombre generato dal buco nero supermassiccio ed estremamente famelico al centro. I raggi di luce e i fasci di ombra si estendono attraverso la galassia per circa 36mila anni luce
On bifurcation for semilinear elliptic Dirichlet problems and the Morse-Smale index theorem
Creators: name: Portaluri, Alessandro
name: Waterstraat, Nils
Publisher: name: arXiv
Year: 2013
Subjects: subject: Analysis of PDEs (math.AP)
subject: Functional Analysis (math.FA)
subject: Spectral Theory (math.SP)
subject: FOS: Mathematics
subject: 35B32, 47A53, 35J25, 58E07

description: We study bifurcation from a branch of trivial solutions of semilinear elliptic Dirichlet boundary value problems on star-shaped domains, where the bifurcation parameter is introduced by shrinking the domain. In the proof of our main theorem we obtain in addition a special case of an index theorem due to S. Smale.
description: 6 pages; v2: all results improved from balls to star-shaped domains; v3: final version, accepted for publication in J. Math. Anal. Appl
Defective Coloring on Classes of Perfect Graphs
Creators: name: Belmonte, Rémy
name: Lampis, Michael
name: Mitsou, Valia
Publisher: name: arXiv
Year: 2017
Subjects: subject: Data Structures and Algorithms (cs.DS)
subject: Combinatorics (math.CO)
subject: FOS: Computer and information sciences
subject: FOS: Mathematics

description: In Defective Coloring we are given a graph $G$ and two integers $χ_d$, $Δ^*$ and are asked if we can $χ_d$-color $G$ so that the maximum degree induced by any color class is at most $Δ^*$. We show that this natural generalization of Coloring is much harder on several basic graph classes. In particular, we show that it is NP-hard on split graphs, even when one of the two parameters $χ_d$, $Δ^*$ is set to the smallest possible fixed value that does not trivialize the problem ($χ_d = 2$ or $Δ^* = 1$). Together with a simple treewidth-based DP algorithm this completely determines the complexity of the problem also on chordal graphs. We then consider the case of cographs and show that, somewhat surprisingly, Defective Coloring turns out to be one of the few natural problems which are NP-hard on this class. We complement this negative result by showing that Defective Coloring is in P for cographs if either $χ_d$ or $Δ^*$ is fixed; that it is in P for trivially perfect graphs; and that it admits a sub-exponential time algorithm for cographs when both $χ_d$ and $Δ^*$ are unbounded.
Quantifiers on languages and codensity monads
Creators: name: Gehrke, Mai
name: Petrisan, Daniela
name: Reggio, Luca
Publisher: name: arXiv
Year: 2017
Subjects: subject: Logic in Computer Science (cs.LO)
subject: Formal Languages and Automata Theory (cs.FL)
subject: Category Theory (math.CT)
subject: General Topology (math.GN)
subject: Logic (math.LO)
subject: FOS: Computer and information sciences
subject: FOS: Mathematics
subject: F.1.1; F.4.1; F.4.3

description: This paper contributes to the techniques of topo-algebraic recognition for languages beyond the regular setting as they relate to logic on words. In particular, we provide a general construction on recognisers corresponding to adding one layer of various kinds of quantifiers and prove a corresponding Reutenauer-type theorem. Our main tools are codensity monads and duality theory. Our construction hinges on a measure-theoretic characterisation of the profinite monad of the free S-semimodule monad for finite and commutative semirings S, which generalises our earlier insight that the Vietoris monad on Boolean spaces is the codensity monad of the finite powerset functor.
description: 30 pages. Presentation improved and details of several proofs added. The main results are unchanged
Tracce d’una devastante supernova primordiale
Creators: Ufficio stampa Inaf
Publisher: name: Media Inaf
Year: 2021

Identificate le tracce chimiche dell’esplosione di un’antichissima supernova di grande energia in una stella di seconda generazione, denominata AS0039, presente nella galassia nana di Sculptor. Il risultato è frutto d’una ricerca guidata da due ricercatrici dell’Università di Firenze associate all’Istituto nazionale di astrofisica
Sprazzi di luce dal lato nascosto del buco nero
Creators: Ilaria Barricella
Publisher: name: Media Inaf
Year: 2021

Osservando il buco nero supermassiccio che alberga nel cuore di I Zwicky 1 – una galassia dal nucleo attivo a 876 milioni di anni luce da noi – un team di astronomi guidato da Dan Wilkins della Stanford University ha notato riverberi di fotoni X provenienti da tutte le regioni del disco di accrescimento, comprese quelle “alle spalle” del buco nero. Ne parliamo con Elisa Costantini, astrofisica all’istituto di ricerca spaziale olandese Sron e coautrice dell’articolo pubblicato oggi su Nature
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
Creators: name: Knop, Dušan
name: Koutecký, Martin
name: Masařík, Tomáš
name: Toufar, Tomáš
Publisher: name: arXiv
Year: 2017
Subjects: subject: Computational Complexity (cs.CC)
subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences
subject: F.2.2; G.2.2
subject: F.2.2, G.2.2

description: This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity. A classical theorem of Courcelle states that any graph property definable in MSO is decidable in linear time on graphs of bounded treewidth. Algorithmic metatheorems like Courcelle's serve to generalize known positive results on various graph classes. We explore and extend three previously studied MSO extensions: global and local cardinality constraints (CardMSO and MSO-LCC) and optimizing the fair objective function (fairMSO). First, we show how these extensions of MSO relate to each other in their expressive power. Furthermore, we highlight a certain "linearity" of some of the newly introduced extensions which turns out to play an important role. Second, we provide parameterized algorithm for the aforementioned structural parameters. On the side of neighborhood diversity, we show that combining the linear variants of local and global cardinality constraints is possible while keeping the linear (FPT) runtime but removing linearity of either makes this impossible. Moreover, we provide a polynomial time (XP) algorithm for the most powerful of studied extensions, i.e. the combination of global and local constraints. Furthermore, we show a polynomial time (XP) algorithm on graphs of bounded treewidth for the same extension. In addition, we propose a general procedure of deriving XP algorithms on graphs on bounded treewidth via formulation as Constraint Satisfaction Problems (CSP). This shows an alternate approach as compared to standard dynamic programming formulations.
description: An extended abstract appeared in Proceedings of WG 2017
Inducing syntactic cut-elimination for indexed nested sequents
Creators: name: Ramanayake, Revantha
Publisher: name: arXiv
Year: 2017
Subjects: subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences

description: The key to the proof-theoretic study of a logic is a proof calculus with a subformula property. Many different proof formalisms have been introduced (e.g. sequent, nested sequent, labelled sequent formalisms) in order to provide such calculi for the many logics of interest. The nested sequent formalism was recently generalised to indexed nested sequents in order to yield proof calculi with the subformula property for extensions of the modal logic K by (Lemmon-Scott) Geach axioms. The proofs of completeness and cut-elimination therein were semantic and intricate. Here we show that derivations in the labelled sequent formalism whose sequents are `almost treelike' correspond exactly to indexed nested sequents. This correspondence is exploited to induce syntactic proofs for indexed nested sequent calculi making use of the elegant proofs that exist for the labelled sequent calculi. A larger goal of this work is to demonstrate how specialising existing proof-theoretic transformations alleviate the need for independent proofs in each formalism. Such coercion can also be used to induce new cutfree calculi. We employ this to present the first indexed nested sequent calculi for intermediate logics.
description: This is an extended version of the conference paper [20]
Dilepton production in proton-proton and Pb+Pb collisions at sqrt(s_NN)=2.76 TeV
Creators: name: Linnyk, O.
name: Cassing, W.
name: Manninen, J.
name: Bratkovskaya, E. L.
name: Gossiaux, P. B.
name: Aichelin, J.
name: Song, T.
name: Ko, C. M.
Publisher: name: arXiv
Year: 2012
Subjects: subject: Nuclear Theory (nucl-th)
subject: Nuclear Experiment (nucl-ex)
subject: FOS: Physical sciences

description: We study e^+e^- pair production in proton-proton and central Pb+Pb collisions at sqrt(s_NN)=2.76 TeV within two models: an extended statistical hadronization model (SHM) and the Parton-Hadron-String Dynamics (PHSD) transport approach. We find that the PHSD calculations roughly agree with the dilepton spectrum from hadronic sources with the 'cocktail' estimates from the statistical hadronization model matched to available data at LHC energies. The dynamical simulations within the PHSD show a moderate increase of the low mass dilepton yield essentially due to the in-medium modification of the rho-meson. Furthermore, pronounced traces of the partonic degrees of freedom are found in the PHSD results in the intermediate mass regime. The dilepton production from the strongly interacting quark-gluon plasma (sQGP) exceeds that from the semi-leptonic decays of open charm and bottom mesons. Additionally, we observe that a transverse momentum cut of 1 GeV/c further suppresses the relative contribution of the heavy meson decays to the dilepton yield, such that the sQGP radiation strongly dominates the spectrum for masses from 1 to 3 GeV, allowing a closer look at the electromagnetic emissivity of the partonic plasma in the early phase of Pb+Pb collisions.
description: 16 pages, 10 figures
Steiner Distance in Product Networks
Creators: name: Mao, Yaping
name: Cheng, Eddie
name: Wang, Zhao
Publisher: name: arXiv
Year: 2017
Subjects: subject: Combinatorics (math.CO)
subject: FOS: Mathematics

description: For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the \emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $n$ and $k$ be two integers with $2\leq k\leq n$. Then the \emph{Steiner $k$-eccentricity $e_k(v)$} of a vertex $v$ of $G$ is defined by $e_k(v)=\max \{d_G(S)\,|\,S\subseteq V(G), \ |S|=k, \ and \ v\in S\}$. Furthermore, the \emph{Steiner $k$-diameter} of $G$ is $sdiam_k(G)=\max \{e_k(v)\,|\, v\in V(G)\}$. In this paper, we investigate the Steiner distance and Steiner $k$-diameter of Cartesian and lexicographical product graphs. Also, we study the Steiner $k$-diameter of some networks.
description: 29 pages, 4 figures