cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
Disentangling Image Distortions in Deep Feature Space
Creators: name: Bianco, Simone
name: Celona, Luigi
name: Napoletano, Paolo
Publisher: name: arXiv
Year: 2020
Subjects: subject: Computer Vision and Pattern Recognition (cs.CV)
subject: FOS: Computer and information sciences

description: Previous literature suggests that perceptual similarity is an emergent property shared across deep visual representations. Experiments conducted on a dataset of human-judged image distortions have proven that deep features outperform classic perceptual metrics. In this work we take a further step in the direction of a broader understanding of such property by analyzing the capability of deep visual representations to intrinsically characterize different types of image distortions. To this end, we firstly generate a number of synthetically distorted images and then we analyze the features extracted by different layers of different Deep Neural Networks. We observe that a dimension-reduced representation of the features extracted from a given layer permits to efficiently separate types of distortions in the feature space. Moreover, each network layer exhibits a different ability to separate between different types of distortions, and this ability varies according to the network architecture. Finally, we evaluate the exploitation of features taken from the layer that better separates image distortions for: i) reduced-reference image quality assessment, and ii) distortion types and severity levels characterization on both single and multiple distortion databases. Results achieved on both tasks suggest that deep visual representations can be unsupervisedly employed to efficiently characterize various image distortions.
Models for undergraduate project courses in software engineering
Creators: name: Shaw, Mary
name: J. E.(James E.) Tomayko
Publisher: name: Figshare
Year: 2018
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: Abstract: "The software engineering course provides undergraduates with an opportunity to learn something about real-world software development. Since software engineering is far from being a mature engineering discipline, it is not possible to define a completely satisfactory syllabus. Content with a sound basis is in short supply, and the material most often taught is at high risk of becoming obsolete within a few years. Undergraduate software engineering courses are now offered in more than a hundred universities. Although three textbooks dominate the market, there is not yet consensus on the scope and form of the course.The two major decisions an instructor faces are the balance between technical and management topics and the relation between the lecture andproject components. We discuss these two decisions, with support from sample syllabi and survey data on course offerings in the United States and Canada. We also offer some advice on the management of a project-oriented course."
Measuring baryon acoustic oscillations with future SKA surveys
Creators: name: Bull, Philip
name: Camera, Stefano
name: Raccanelli, Alvise
name: Blake, Chris
name: Ferreira, Pedro G.
name: Santos, Mario G.
name: Schwarz, Dominik J.
Publisher: name: arXiv
Year: 2015
Subjects: subject: Cosmology and Nongalactic Astrophysics (astro-ph.CO)
subject: FOS: Physical sciences

description: The imprint of baryon acoustic oscillations (BAO) in large-scale structure can be used as a standard ruler for mapping out the cosmic expansion history, and hence for testing cosmological models. In this article we briefly describe the scientific background to the BAO technique, and forecast the potential of the Phase 1 and 2 SKA telescopes to perform BAO surveys using both galaxy catalogues and intensity mapping, assessing their competitiveness with current and future optical galaxy surveys. We find that a 25,000 sq. deg. intensity mapping survey on a Phase 1 array will preferentially constrain the radial BAO, providing a highly competitive 2% constraint on the expansion rate at z ~ 2. A 30,000 sq. deg. galaxy redshift survey on SKA2 will outperform all other planned experiments for z < 1.4.
description: 16 pages, 4 figures. For the busy reader: see Fig. 3. Submitted on behalf of the SKA Cosmology Science working group, for the conference "Advancing Astrophysics with the SKA" (AASKA14), Giardini-Naxos, Italy, June 9th-13th 2014
Additional file 1 of Imaging biomarkers for clinical applications in neuro-oncology: current status and future perspectives
Creators: name: Chiu, Fang-Ying
name: Yen, Yun
Publisher: name: figshare
Year: 2024
Subjects: Space Science
Medicine
Cell Biology
Pharmacology
Biotechnology
Biological Sciences not elsewhere classified
Cancer

description: Additional file 1: Fig. S1. PRISMA flow diagram of the systematic search.
NetProbe: A Fast and Scalable System for Fraud Detection in Online Auction Networks
Creators: name: Shashank  Pandit
name: Duen Horng  Chau
name: Wang, Samuel
name: Faloutsos, Christos
Publisher: name: Figshare
Year: 2018
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: Given a large online network of online auction users and
their histories of transactions, how can we spot anomalies
and auction fraud? This paper describes the design and
implementation of NetProbe, a system that we propose for
solving this problem. NetProbe models auction users and
transactions as a Markov Random Field tuned to detect the
suspicious patterns that fraudsters create, and employs a
Belief Propagation mechanism to detect likely fraudsters.
Our experiments show that NetProbe is both efficient and
effective for fraud detection. We report experiments on synthetic graphs with as many as 7,000 nodes and 30,000 edges,
where NetProbe was able to spot fraudulent nodes with over
90% precision and recall, within a matter of seconds. We
also report experiments on a real dataset crawled from eBay,
with nearly 700,000 transactions between more than 66,000
users, where NetProbe was highly effective at unearthing
hidden networks of fraudsters, within a realistic response
time of about 6 minutes. For scenarios where the underlying data is dynamic in nature, we propose Incremental
NetProbe, which is an approximate, but fast, variant of Net-
Probe. Our experiments prove that Incremental NetProbe
executes nearly doubly fast as compared to NetProbe, while
retaining over 99% of its accuracy.
title: A scalable architecture for the demand-driven deployment of location-neutral software services
Creators: name: MacInnis, Robert F.
Publisher: name: University of St Andrews
Year: 2010

description: This thesis presents a scalable service-oriented architecture for the demand-driven deployment of location-neutral software services, using an end-to-end or ‘holistic’ approach to address identified shortcomings of the traditional Web Services model. The architecture presents a multi-endpoint Web Service environment which abstracts over Web Service location and technology and enables the dynamic provision of highly-available Web Services. The model describes mechanisms which provide a framework within which Web Services can be reliably addressed, bound to, and utilized, at any time and from any location. The presented model eases the task of providing a Web Service by consuming deployment and management tasks. It eases the development of consumer agent applications by letting developers program against what a service does, not where it is or whether it is currently deployed. It extends the platform-independent ethos of Web Services by providing deployment mechanisms which can be used independent of implementation and deployment technologies. Crucially, it maintains the Web Service goal of universal interoperability, preserving each actor’s view upon the system so that existing Service Consumers and Service Providers can participate without any modifications to provider agent or consumer agent application code. Lastly, the model aims to enable the efficient consumption of hosting resources by providing mechanisms to dynamically apply and reclaim resources based upon measured consumer demand.
Decay and structure of the Hoyle state
Creators: name: Ishikawa, Souichi
Publisher: name: arXiv
Year: 2014
Subjects: subject: Nuclear Theory (nucl-th)
subject: Nuclear Experiment (nucl-ex)
subject: FOS: Physical sciences

description: The first $0^+$ resonant state of the $^{12}$C nucleus ${}^{12}$C$(0_2^+)$, so called the Hoyle state, is investigated in a three-$α$-particle (3-$α$) model. A wave function for the photodisintegration reaction of a $^{12}$C bound state to 3-$α$ final states is defined and calculated by the Faddeev three-body formalism, in which three-body bound- and continuum states are treated consistently. From the wave function at the Hoyle state energy, I calculated distributions of outgoing $α$-particles and density distributions at interior region of the Hoyle state. Results show that a process through a two-$α$ resonant state is dominant in the decay and contributions of the rest process are very small, less than 1 \%. There appear some peaks in the interior density distribution corresponding to configurations of an equilateral- and an isosceles triangles. It turns out that these results are obtained independently of the choice of $α$-particle interaction models, when they are made to reproduce the Hoyle state energy.
description: 5 pages, 3 figures
On Eigenvalues of Geometrically Finite Hyperbolic Manifolds with Infinite Volume
Creators: name: Han, Xiaolong Hans
Publisher: name: arXiv
Year: 2020
Subjects: subject: Differential Geometry (math.DG)
subject: FOS: Mathematics
subject: 53C25, 53C35

description: Let $M$ be an oriented geometrically finite hyperbolic manifold of infinite volume with dimension at least $3$. For all $k \geq 0$, we provide a lower bound on the $k$th eigenvalue of the Laplace-Beltrami operator of $M$ by the $k$th eigenvalue of some neighborhood of the thick part of the convex core, up to a constant. As an application, we recover a theorem similar to the one of Burger and Canary which bounds the bottom $λ_0$ of the spectrum from below by $\frac{c}{\text{vol}(C_1(M))^2}$, where $C_1(M)$ is the $1$-neighborhood of the convex core and $c$ is a constant.
description: Incorporated referee's comments. Accepted by J. Topol. Anal
Spin-lattice relaxation times of single donors and donor clusters in silicon
Creators: name: Hsueh, Yu-Ling
name: Büch, Holger
name: Tan, Yaohua
name: Wang, Yu
name: Hollenberg, Lloyd C. L.
name: Klimeck, Gerhard
name: Simmons, Michelle Y.
name: Rahman, Rajib
Publisher: name: arXiv
Year: 2015
Subjects: subject: Mesoscale and Nanoscale Physics (cond-mat.mes-hall)
subject: FOS: Physical sciences

description: An atomistic method of calculating the spin-lattice relaxation times ($T_1$) is presented for donors in silicon nanostructures comprising of millions of atoms. The method takes into account the full band structure of silicon including the spin-orbit interaction. The electron-phonon Hamiltonian, and hence the deformation potential, is directly evaluated from the strain-dependent tight-binding Hamiltonian. The technique is applied to single donors and donor clusters in silicon, and explains the variation of $T_1$ with the number of donors and electrons, as well as donor locations. Without any adjustable parameters, the relaxation rates in a magnetic field for both systems are found to vary as $B^5$ in excellent quantitative agreement with experimental measurements. The results also show that by engineering electronic wavefunctions in nanostructures, $T_1$ times can be varied by orders of magnitude.
description: 5 pages, 4 figures
Network-based multicomputers : redefining high performance computing in the 1990s
Creators: name: H. T. Kung
Publisher: name: Figshare
Year: 2018
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: Abstract: "One of the most significant advances in computer systems over the past decade is parallel processing. This is a direct consequence of close interactions between system design and VLSI technology. This integrated approach has allowed insights in computations, systems and applications to have fundamental influences on the design of hardware structures, and vice versa. The cooperation will be even more crucial as we enter the next decade when parallel computers are expected to be not only powerful in performance but also easy to use. A key point here is to use the power of VLSI to implement general and very high performance networks for large-scale multicomputers. In this paper we briefly review current work at Carnegie Mellon in this area, and give a taxonomy to show the general architectural trends. It is concluded that multicomputers based on flexible, extensible and efficient network backplanes will be a major thrust in high performance computing in the 1990s."
New streaming algorithms for fast detection of superspreaders
Creators: name: Venkataraman, Shobha
Publisher: name: Figshare
Year: 2018
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: Abstract: "High-speed monitoring of Internet traffic is an important and challenging problem, with applications to real-time attack detection and mitigation, traffic engineering, etc. However, packet-level monitoring requires fast streaming algorithms that use very little memory space and little communication among collaborating network monitoring points. In this paper, we consider the problem of detecting superspreaders, which are sources that connect to a large number of distinct destinations. We propose several new streaming algorithms for detecting superspreaders, and prove guarantees on their accuracy and memory requirements. We also show experimental results on real network traces. Our algorithms are substantially more efficient (both theoretically and experimentally) than previous approaches. We also provide several extensions to our algorithms -- we show how to identify superspreaders in a distributed setting, with sliding windows, and when deletions are allowed in the stream. More generally, our algorithms are applicable to any problem that can be formulated as follows: given a stream of (x,y) pairs, find all the x's that are paired with a large number of distinct y's. We call this the heavy distinct-hitters problem. There are many network security applications of this general problem. This paper discusses these and other applications, and for concreteness, focuses on the superspreader problem."
Effects of creatine, coffee, and caffeine anhydrous on strength and sprint performance
Creators: name: Trexler, Eric
Publisher: name: University of North Carolina at Chapel Hill Graduate School
Year: 2015
Subjects: Nutrition
Kinesiology

description: The current study sought to directly compare effects of caffeine-matched (300 mg) doses of caffeine anhydrous (CAF) and coffee (COF) on strength and sprint performance, and to determine if CAF or COF intake modulate the effects of creatine (CRE) loading. Resistance-trained males (n=54) completed baseline tests of strength and sprint performance, with post-tests occurring after acute and chronic supplementation periods. COF ingested 30 minutes pre-exercise improved leg press one-rep max to a greater extent than CAF (32.2±18.6 vs. 15.3±16.9 lbs; P=0.03), while both attenuated total work and peak power reductions compared to placebo (P<0.05). CRE loading (five days) did not improve strength or sprint performance compared to placebo (P>0.05). Effects of CRE were not influenced by chronic COF or CAF intake, but the combination of CRE+CAF resulted in mild gastrointestinal discomfort. Results may inform supplement dosing and timing strategies for concurrent use of CRE with CAF or COF.
The radius of comparison of the crossed product by a tracially strictly approximately inner action
Creators: name: Asadi-Vasfi, M. Ali
Publisher: name: arXiv
Year: 2020
Subjects: subject: Operator Algebras (math.OA)
subject: FOS: Mathematics
subject: 46L55, 46L35 (primary), 19K14, 46L80 (secondary)

description: Let $G$ be a finite group, let $A$ be an infinite-dimensional stably finite simple unital C*-algebra, and let $α\colon G \to \operatorname{Aut} (A)$ be a tracially strictly approximately inner action of $G$ on $A$. Then the radius of comparison satisfies $\operatorname{rc} (A) \leq \operatorname{rc} \big( C^*(G, A, α) \big)$ and if $C^*(G, A, α)$ is simple, then $\operatorname{rc} (A) \leq \operatorname{rc} \big( C^*(G, A, α) \big) \leq \operatorname{rc} (A^α)$. Further, the inclusion of $A$ in $C^*(G, A, α)$ induces an isomorphism from the purely positive part of the Cuntz semigroup $\operatorname{Cu} (A)$ to its image in $\operatorname{Cu} \left(C^*(G, A, α)\right)$. If $α$ is strictly approximately inner, then in fact $\operatorname{Cu} (A) \to \operatorname{Cu} \left(C^*(G, A, α) \right)$ is an ordered semigroup isomorphism onto its range. Also, for every finite group $G$ and for every $η\in \left(0, \frac{1}{\operatorname{card} (G)}\right)$, we construct a simple separable unital AH algebra $A$ with stable rank one and a strictly approximately inner action $α\colon G \to \operatorname{Aut} (A)$ such that: (1) $α$ is pointwise outer and doesn't have the weak tracial Rokhlin property. (2) $\operatorname{rc} (A) =\operatorname{rc} \left(C^*(G, A, α)\right)= η$.
description: 35 Pages
Multi-Attribute Exchange Market: Theory and Experiments
Creators: name: Fink, Eugene
name: Johnson, Josh
name: Hershberger, John
Publisher: name: Figshare
Year: 2018
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: The Internet has opened opportunities for efficient on-line trading, and researchers have developed algorithms for various auctions, as well as exchanges for standardized commodities; however, they have done little work on exchanges for complex nonstandard goods. We propose a formal model for trading complex goods, present an exchange system that allows traders to describe purchases and sales by multiple attributes, and give the results of applying it to a used-car market and corporate-bond market.
Emotionsregulation. Wie sich diese Fähigkeit entwickelt... ...und Lehrpersonen dies unterstützen können. Eine Theorie-und Literaturarbeit
Creators: name: Gruber, Léonie
Publisher: name: Zenodo
Year: 2021
Subjects: Sonderpädagogik
Vertiefungsrichtung: Schulische Heilpädagogik
Emotionsregulation
emotionale Kompetenzen
Masterarbeite

description: Die emotionalen Kompetenzen bieten ein vielschichtiges Forschungsfeld. Verschiedenste Studien belegen Wechselwirkungen zwischen sozialen und emotionalen Kompetenzen. Schwach ausgeprägte emotionale Kompetenzen können zu sozialen Verhaltensauffälligkeiten führen. Als besonders einflussreich gilt die Fähigkeit der Emotionsregulation. Um Verhaltensschwierigkeiten vorzubeugen, stellt sich aus schulischer Sicht die Frage, inwiefern sich die Entwicklung der Emotionsregulationsfähigkeit fördern lässt. Diese Arbeit untersucht bisherige Forschungsergebnisse anhand ausgewählter Fachliteratur. Dafür wird die Methode «Qualitativen Inhaltsanalyse» angewendet. Die kategoriengeleitete Literaturanalyse ergibt eine Auswahl an Handlungsansätzen. Sie können situationsentsprechend zur Förderung der Emotionsregulationsfähigkeit eingesetzt werden. Im Fokus stehen Handlungsansätze für das Vorschulalter.
Noise stability of functions with low influences: invariance and optimality
Creators: name: Mossel, Elchanan
name: O'Donnell, Ryan
name: Oleszkiewicz, Krzysztof
Publisher: name: Figshare
Year: 2018
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: In this paper we study functions with low influences on product probability spaces. These are
 functions f : Ω1 ×⋯ × Ωn → ℝ that
 have E[VarΩi[f]] small
 compared to Var[f] for
 each i. The analysis
 of boolean functions f : {−1,1}n →{−1,1}
 with low influences has become a central problem in discrete Fourier analysis. It is
 motivated by fundamental questions arising from the construction of probabilistically
 checkable proofs in theoretical computer science and from problems in the theory of
 social choice in economics.

   We prove an invariance principle for multilinear polynomials with low influences
 and bounded degree; it shows that under mild conditions the distribution of such
 polynomials is essentially invariant for all product spaces. Ours is one of the very
 few known nonlinear invariance principles. It has the advantage that its
 proof is simple and that its error bounds are explicit. We also show that the
 assumption of bounded degree can be eliminated if the polynomials are slightly
 “smoothed”; this extension is essential for our applications to “noise stability”-type
 problems.

   In particular, as applications of the invariance principle we prove two conjectures:
 Khot, Kindler, Mossel, and O’Donnell’s “Majority Is Stablest” conjecture from
 theoretical computer science, which was the original motivation for this work, and
 Kalai and Friedgut’s “It Ain’t Over Till It’s Over” conjecture from social choice
 theory.
Optimal Drug Regimen and Combined Drug Therapy and its Efficacy in the Treatment of COVID-19 : An Within-Host Modeling Study
Creators: name: Chhetri, Bishal
name: Bhagat, Vijay M.
name: Vamsi, D. K. K.
name: S, Ananth V
name: Prakash, Bhanu
name: Muthuswamy, Swapna
name: Deshmukh, Pradeep
name: Sanjeevi, Carani B
Publisher: name: arXiv
Year: 2020
Subjects: subject: Populations and Evolution (q-bio.PE)
subject: Dynamical Systems (math.DS)
subject: Optimization and Control (math.OC)
subject: FOS: Biological sciences
subject: FOS: Mathematics
subject: 37N25, 37N35, 49K15, 92-10, 92C60

description: The COVID-19 pandemic has resulted in more than 30.35 million infections and 9, 50, 625 deaths in 212 countries over the last few months. Different drug intervention acting at multiple stages of pathogenesis of COVID-19 can substantially reduce the infection induced mortality. The current within-host mathematical modeling studies deals with the optimal drug regimen and the efficacy of combined therapy in treatment of COVID-19. The drugs/interventions considered include Arbidol, Remdesivir, Inteferon (INF) and Lopinavir/Ritonavir. It is concluded that these drug interventions when administered individually or in combination reduce the infected cells and viral load. Four scenarios involving administration of single drug intervention, two drug interventions, three drug interventions and all the four have been discussed. In all these scenarios the optimal drug regimen is proposed based on two methods. In the first method these medical interventions are modeled as control interventions and a corresponding objective function and optimal control problem is formulated. In this setting the optimal drug regimen is proposed. Later using the the comparative effectiveness method the optimal drug regimen is proposed based on basic reproduction number and viral load. The average infected cell count and viral load decreased the most when all the four interventions were applied together. On the other hand the average susceptible cell count decreased the best when Arbidol alone was administered. The basic reproduction number and viral count decreased the best when all the four interventions were applied together reinstating the fact obtained earlier in the optimal control setting. These findings may help physicians with decision making in treatment of life-threatening COVID-19 pneumonia.
description: 16 pages, 13 figures
Photon transport enhanced by transverse Anderson localization in disordered superlattices
Creators: name: Hsieh, Pin-Chun
name: Chung, Chung-Jen
name: McMillan, James
name: Tsai, Min-An
name: Lu, Ming
name: Panoiu, Nicolae
name: Wong, Chee Wei
Publisher: name: arXiv
Year: 2014
Subjects: subject: Optics (physics.optics)
subject: FOS: Physical sciences

description: One of the daunting challenges in optical physics is to accurately control the flow of light at the subwavelength scale, by patterning the optical medium one can design anisotropic media. The light transport can also be significantly affected by Anderson localization, namely the wave localization in a disordered medium, a ubiquitous phenomenon in wave physics. Here we report the photon transport and collimation enhanced by transverse Anderson localization in chip-scale dispersion engineered anisotropic media. We demonstrate a new type of anisotropic photonic structure in which diffraction is nearly completely arrested by cascaded resonant tunneling through transverse guided resonances. By perturbing the shape of more than 4,000 scatterers in these superlattices we add structural disordered in a controlled manner and uncover the mechanism of disorder-induced transverse localization at the chip-scale. Arrested spatial divergence is captured in the power-law scaling, along with exponential asymmetric mode profiles and enhanced collimation bandwidth for increasing disorder. With increasing disorder, we observe the crossover from cascaded guided resonances into the transverse localization regime, beyond the ballistic and diffusive transport of photons.
Control Intervention Strategies for Within-Host, Between-Host and their Efficacy in the Treatment, Spread of COVID-19 : A Multi Scale Modeling Approach
Creators: name: D, Bhanu Prakash
name: Vamsi, D. K. K.
name: Rajesh, D. Bangaru
name: Sanjeevi, Carani B
Publisher: name: arXiv
Year: 2020
Subjects: subject: Populations and Evolution (q-bio.PE)
subject: Dynamical Systems (math.DS)
subject: FOS: Biological sciences
subject: FOS: Mathematics

description: The COVID-19 pandemic has resulted in more than 14.5 million infections and 6,04,917 deaths in 212 countries over the last few months. Different drug intervention acting at multiple stages of pathogenesis of COVID-19 can substantially reduce the infection induced,thereby decreasing the mortality. Also population level control strategies can reduce the spread of the COVID-19 substantially. Motivated by these observations, in this work we propose and study a multi scale model linking both within-host and between-host dynamics of COVID-19. Initially the natural history dealing with the disease dynamics is studied. Later, comparative effectiveness is performed to understand the efficacy of both the within-host and population level interventions. Findings of this study suggest that a combined strategy involving treatment with drugs such as Arbidol, remdesivir, Lopinavir/Ritonavir that inhibits viral replication and immunotherapies like monoclonal antibodies, along with environmental hygiene and generalized social distancing proved to be the best and optimal in reducing the basic reproduction number and environmental spread of the virus at the population level.
Observations of the M82 SN 2014J with the Kilodegree Extremely Little Telescope
Creators: name: Siverd, Robert J.
name: Goobar, Ariel
name: Stassun, Keivan G.
name: Pepper, Joshua
Publisher: name: arXiv
Year: 2014
Subjects: subject: High Energy Astrophysical Phenomena (astro-ph.HE)
subject: Solar and Stellar Astrophysics (astro-ph.SR)
subject: FOS: Physical sciences

description: We report observations of the bright M82 supernova 2014J serendipitously obtained with the Kilodegree Extremely Little Telescope (KELT). The SN was observed at high cadence for over 100 days, from pre-explosion, to early rise and peak times, through the secondary bump. The high cadence KELT data with high S/N is completely unique for SN 2014J and for any other SNIa, with the exception of the (yet) unpublished Kepler data. Here, we report determinations of the SN explosion time and peak time. We also report measures of the "smoothness" of the light curve on timescales of minutes/hours never before probed, and we use this to place limits on energy produced from short-lived isotopes or inhomogeneities in the explosion or the circumstellar medium. From the non-observation of significant perturbations of the light curves, we derive a 3sigma upper-limit corresponding to 8.7 x 10^36 erg/s for any such extra sources of luminosity at optical wavelengths.
description: Accepted by ApJ Letters. Companion paper by Goobar et al is arxiv:1410.1363
Additional file 1 of Bioinformatics screening of colorectal-cancer causing molecular signatures through gene expression profiles to discover therapeutic targets and candidate agents
Creators: name: Horaira, Md Abu
name: Islam, Md. Ariful
name: Kibria, Md. Kaderi
name: Alam, Md. Jahangir
name: Kabir, Syed Rashel
name: Mollah, Md. Nurul Haque
Publisher: name: figshare
Year: 2024
Subjects: subject: Genetics
subject: FOS: Biological sciences

description: Additional file 1. Table S1. Different lists of hub-genes [HubGs] for colorectal cancer [CRC] published in different articles. Table S2. Association of cKGs with other disease risks.
Isoperimetric Regions in $\mathbb{R}^n$ with density $r^p$
Creators: name: Boyer, Wyatt
name: Brown, Bryan
name: Chambers, Gregory R.
name: Loving, Alyssa
name: Tammen, Sarah
Publisher: name: arXiv
Year: 2015
Subjects: subject: Differential Geometry (math.DG)
subject: FOS: Mathematics
subject: 53

description: We show that the unique isoperimetric hypersurfaces in $\mathbb{R}^n$ with density $r^p$ for $n \ge 3$ and $p>0$ are spheres that pass through the origin.
description: published online in Analysis and Geometry in Metric Spaces, revised according to referee report, 29 pages, 10 figures
Nonparametric Transforms of Graph Kernels for Semi-Supervised Learning
Creators: name: Xiaojin  Zhu
name: Kandola, Jan
name: Zoubin  Ghahramani
name: Lafferty, John D.
Publisher: name: Figshare
Year: 2018
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: We present an algorithm based on convex optimization for constructing
kernels for semi-supervised learning. The kernel matrices are derived
from the spectral decomposition of graph Laplacians, and combine labeled
and unlabeled data in a systematic fashion. Unlike previous work
using diffusion kernels and Gaussian random field kernels, a nonparametric
kernel approach is presented that incorporates order constraints
during optimization. This results in flexible kernels and avoids the need
to choose among different parametric forms. Our approach relies on
a quadratically constrained quadratic program (QCQP), and is computationally
feasible for large datasets. We evaluate the kernels on real
datasets using support vector machines, with encouraging results.
Supplementary document for Metamaterial Eigenmodes beyond Homogenization - 5862846.pdf
Creators: name: Günzler, Antonio
name: Schumacher, Cédric
name: Steiner, Ullrich
name: Saba, Matthias
Publisher: name: Optica Publishing Group
Year: 2022
Subjects: subject: Uncategorized
subject: 20503 Nonlinear Optics and Spectroscopy
subject: FOS: Physical sciences

description: Supplemental
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
Creators: name: Cimatti, Alessandro
name: Clarke, Edmund M
name: Giunchiglia, Enrico
name: Giunchiglia, Fausto
name: Pistore, Marco
name: Rovere, Marco
name: Sebastiani, Roberto
name: Tacchella, Armando
Publisher: name: Figshare
Year: 2018
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: This paper describes version 2 of the NuSMV tool. NuSMV is a symbolic model
checker originated from the reengineering, reimplementation and extension of SMV,
the original BDD-based model checker developed at CMU [15]. The NuSMV project
aims at the development of a state-of-the-art symbolic model checker, designed to be
applicable in technology transfer projects: it is a well structured, open, flexible and
documented platform for model checking, and is robust and close to industrial systems
standards [6].
BCGGAN: Ballistocardiogram artifact removal in simultaneous EEG-fMRI using generative adversarial network
Creators: name: Lin, Guang
name: Zhang, Jianhai
name: Liu, Yuxi
name: Gao, Tianyang
name: Kong, Wanzeng
name: Lei, Xu
name: Qiu, Tao
Publisher: name: arXiv
Year: 2020
Subjects: subject: Machine Learning (cs.LG)
subject: FOS: Computer and information sciences

description: Due to its advantages of high temporal and spatial resolution, the technology of simultaneous electroencephalogram-functional magnetic resonance imaging (EEG-fMRI) acquisition and analysis has attracted much attention, and has been widely used in various research fields of brain science. However, during the fMRI of the brain, ballistocardiogram (BCG) artifacts can seriously contaminate the EEG. As an unpaired problem, BCG artifact removal now remains a considerable challenge. Aiming to provide a solution, this paper proposed a novel modular generative adversarial network (GAN) and corresponding training strategy to improve the network performance by optimizing the parameters of each module. In this manner, we hope to improve the local representation ability of the network model, thereby improving its overall performance and obtaining a reliable generator for BCG artifact removal. Moreover, the proposed method does not rely on additional reference signal or complex hardware equipment. Experimental results show that, compared with multiple methods, the technique presented in this paper can remove the BCG artifact more effectively while retaining essential EEG information.
Additional file 3 of Bioinformatics screening of colorectal-cancer causing molecular signatures through gene expression profiles to discover therapeutic targets and candidate agents
Creators: name: Horaira, Md Abu
name: Islam, Md. Ariful
name: Kibria, Md. Kaderi
name: Alam, Md. Jahangir
name: Kabir, Syed Rashel
name: Mollah, Md. Nurul Haque
Publisher: name: figshare
Year: 2024
Subjects: subject: Genetics
subject: FOS: Biological sciences

description: Additional file 3. Correlation plots illustrating the relationship between gene expression and immune infiltration levels across multiple types of cancers, using the bioinformatics tool TIMER 2.0.
Oblivious Network Design
Creators: name: Gupta, Anupam
name: MohammadTaghi  Hajiaghayi
name: Racke, Harald
Publisher: name: Figshare
Year: 2018
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: Consider the following network design problem: given a network G = (V, E), source-sink pairs {si, ti} arrive and desire to send a unit of flow between themselves. The cost of the routing is this: if edge e carries a total of fe  flow (from all the terminal pairs), the cost is given by Σ el(fe), where l is some concave cost function; the goal is to minimize the total cost incurred. However, we want the routing to be oblivious: when terminal pair {si, ti} makes its routing decisions, it does not know the current flow on the edges of the network, nor the identity of the other pairs in the system. Moreover, it does not even know the identity of the function l, merely knowing that l is a concave function of the total flow on the edge. How should it (obliviously) route its one unit of flow? Can we get competitive algorithms for this problem?In this paper, we develop a framework to model oblivious network design problems (of which the above problem is a special case), and give algorithms with poly-logarithmic competitive ratio for problems in this framework (and hence for this problem). Abstractly, given a problem like the one above, the solution is a multicommodity flow producing a "load" on each edge of Le = l(f1(e),f2(e), ..., fk(e)), and the total cost is given by an "aggregation function" agg (Le1,...,Lem) of the loads of all edges. Our goal is to develop oblivious algorithms that approximately minimize the total cost of the routing, knowing the aggregation function agg, but merely knowing that l lies in some class C, and having no other information about the current state of the network. Hence we want algorithms that are simultaneously "function-oblivious" as well as "traffic-oblivious".The aggregation functions we consider are the max and σ objective functions, which correspond to the well-known measures of congestion and total cost of a network; in this paper, we prove the following:• If the aggregation function is Σ, we give an oblivious algorithm with O(log2  n) competitive ratio whenever the load function l is in the class of monotone sub-additive functions. (Recall that our algorithm is also "function-oblivious"; it works whenever each edge has a load function l in the class.)• For the case when the aggregation function is max, we give an oblivious algorithm with O(log2  n log log n) competitive ratio, when the load function l  is a norm; we also show that such a competitive ratio is not possible for general sub-additive functions.These are the first such general results about oblivious algorithms for network design problems, and we hope the ideas and techniques will lead to more and improved results in this area.
AARP 2019 Boomer Travel Trends
Creators: name: AARP
Publisher: name: Roper Center for Public Opinion Research
Year: 2022

description: Anticipated 2019 international travel (13); anticipated 2019 domestic travel (13); travel motivations (3); summer vacation (2); family trip (2); holiday travel (2); celebration trip (2); solo vacation (2); mode of transportation (2); types of accommodation (2); traveling with grandparents/grandchildren (10); heritage/roots trip (3); "authentic" experiences (2); vacation rentals/Airbnb/Vrbo (5); anticipated spending on travel (2); loyalty programs (2); smartphone usage (4); vacation accrual/paid time off (2); time spent working while on vacation (2); add on to a business trip (2); obstacles to traveling more (1).
Fourier Monte Carlo Renormalization Group Approach to Crystalline Membranes
Creators: name: Tröster, Andreas
Publisher: name: arXiv
Year: 2015
Subjects: subject: Statistical Mechanics (cond-mat.stat-mech)
subject: FOS: Physical sciences

description: The computation of the critical exponent eta characterizing the universal elastic behavior of crystalline membranes in the flat phase continues to represent challenges to theorists as well as computer simulators that manifest themselves in a considerable spread of numerical results for eta published in the literature. We present new insight to this problem that results from combining Wilson's momentum shell renormalization group method with the power of modern computer simulations based on the Fourier Monte Carlo algorithm. After discussing the ideas and difficulties underlying this combined scheme, we present a calculation of the renormalization group flow of the effective 2d Young modulus for momentum shells of different thickness. Extrapolation to infinite shell thickness allows to produce results in reasonable agreement with those obtained by functional renormalization group or by Fourier Monte Carlo simulations in combination with finite size scaling. Moreover, our new method allows for the first time to obtain a decent estimate for the value of the Wegner exponent omega that determines the leading correction to scaling, which in turn allows to refine our numerical estimate for eta previously obtained from precise finite size scaling data.
description: Phys. Rev. E, in print
Primitive prime divisors and the $n$-th cyclotomic polynomial
Creators: name: Glasby, S. P.
name: Lübeck, Frank
name: Niemeyer, Alice C.
name: Praeger, Cheryl E.
Publisher: name: arXiv
Year: 2015
Subjects: subject: Number Theory (math.NT)
subject: FOS: Mathematics
subject: 11T22, 11Y40, 20G05

description: Primitive prime divisors play an important role in group theory and number theory. We study a certain number theoretic quantity, called $Φ^*_n(q)$, which is closely related to the cyclotomic polynomial $Φ_n(x)$ and to primitive prime divisors of $q^n-1$. Our definition of $Φ^*_n(q)$ is novel, and we prove it is equivalent to the definition given by Hering. Given positive constants $c$ and $k$, we give an algorithm for determining all pairs $(n,q)$ with $Φ^*_n(q)\le cn^k$. This algorithm is used to extend (and correct) a result of Hering which is useful for classifying certain families of subgroups of finite linear groups.
description: 14 pages, 5 tables in Journal of the Australian Mathematical Society We replaced $n>1$ with $n>2$ in the statement of Bang's theorem on page 2 (we thank Tim Penttila for pointing this out)
The Effects of Missing Time-Varying Covariates in Multilevel Models
Creators: name: Bainter, Sierra A.
Publisher: name: University of North Carolina at Chapel Hill
Year: 2013

description: Multilevel models are commonly used in psychological research to examine developmentally-motivated hypotheses concerning the within- and between- person effects of a time-varying covariate on some outcome. Whereas multilevel models are flexible to accommodate incomplete data on the outcome, missing time-varying covariates present significant challenges to researchers. Unless multiple imputation is used, missing time-varying covariates will lead to a loss of data. This project evaluated the effects of missing time-varying covariates and imputation of missing time-varying covariates in multilevel models using a multifaceted simulation study. My results showed that missing time-varying covariates can lead to biased parameter estimates. However this bias is likely minor compared to bias already present in complete data due to unreliable estimates of the person-mean of the time-varying covariate. The results presented here are clear motivation for researchers to choose alternative estimation strategies that can account for measurement error in the person mean, whether or not time-varying covariates are missing.
On the Consistency of a Random Forest Algorithm in the Presence of Missing Entries
Creators: name: Gómez-Méndez, Irving
name: Joly, Emilien
Publisher: name: arXiv
Year: 2020
Subjects: subject: Statistics Theory (math.ST)
subject: FOS: Mathematics

description: This paper tackles the problem of constructing a non-parametric predictor when the latent variables are given with incomplete information. The convenient predictor for this task is the random forest algorithm in conjunction to the so-called CART criterion. The proposed technique enables a partial imputation of the missing values in the data set in a way that suits both a consistent estimator of the regression function as well as a partial recovery of the missing values. A proof of the consistency of the random forest estimator is given in the case where each latent variable is missing completely at random (MCAR).
On the existence of a superlight scalar boson
Creators: name: van Beveren, Eef
name: Coito, Susana
name: Rupp, George
Publisher: name: arXiv
Year: 2014
Subjects: subject: High Energy Physics - Phenomenology (hep-ph)
subject: FOS: Physical sciences

description: In this lecture we show that the study of hadronic resonances is severely hampered by the lack of accurate data and, moreover, that for similar reason the study of Weak substructure does not make sufficient progress. We furthermore report on an unexplained high statistics signal that may indicate the existence of a superlight scalar boson.
description: Lecture prepared for 3rd International Conference on New Frontiers in Physics, 28 July - 6 August, Kolymbari (Crete, Greece). 19 pages, figures, plain LaTeX
Additional file 1 of A translatome-transcriptome multi-omics gene regulatory network reveals the complicated functional landscape of maize
Creators: name: Zhu, Wanchao
name: Miao, Xinxin
name: Qian, Jia
name: Chen, Sijia
name: Jin, Qixiao
name: Li, Mingzhu
name: Han, Linqian
name: Zhong, Wanshun
name: Xie, Dan
name: Shang, Xiaoyang
name: Li, Lin
Publisher: name: figshare
Year: 2024
Subjects: subject: Genetics
subject: FOS: Biological sciences

description: Additional file 1. Supplementary figures S1-S24.
Supplementary information from Cultural transmission of move choice in chess
Creators: name: Lappo, Egor
name: Rosenberg, Noah A.
name: Feldman, Marcus W.
Publisher: name: The Royal Society
Year: 2023
Subjects: Evolutionary Biology not elsewhere classified
Animal Behaviour
Biological Mathematics

description: Supplementary sections detailing model fitting, input data, calculation of counterfactual probabilities, game sample size.
Modeling Skewed Distribution Using Multifractals and the `80-20' Law
Creators: name: Faloutsos, Christos
name: Matias, Yossi
name: Silberschatz, Avi
Publisher: name: Figshare
Year: 2018
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: The focus of this paper is on the characterization of the skewness of an attribute-value distribution and on the extrapolations for interesting parameters. More specifically, given a vector with the highest h multiplicities mvec = (m1, m2, ..., mh), and some frequency moments Fq =\sum miq , (e.g., q=0, 2), we provide effective schemes for obtaining estimates about either its statistics or subsets/supersets of the relation.

We assume an 80/20 law, and specifically, a p/(1-p) law. This law gives a distribution which is commonly known in the fractals literature as `multifractal'. We show how to estimate p from the given information (first few multiplicities and a few moments), and present the results of our experimentations on real data. Our results demonstrate that schemes based on our multifractal assumption consistently outperforms those schemes based on the uniformity assumption, which are commonly used in current DBMSs. Moreover, our schemes can be used to provide estimates for supersets of a relation, which the uniformity assumption based schemes can not not provide at all.
Harmonic Forms, Minimal Surfaces and Norms on Cohomology of Hyperbolic $3$-Manifolds
Creators: name: Han, Xiaolong Hans
Publisher: name: arXiv
Year: 2020
Subjects: subject: Geometric Topology (math.GT)
subject: Differential Geometry (math.DG)
subject: FOS: Mathematics
subject: 57M50 (Primary), 49Q05, 53C65 (Secondary)

description: We bound the $L^2$-norm of an $L^2$ harmonic $1$-form in an orientable cusped hyperbolic $3$-manifold $M$ by its topological complexity, measured by the Thurston norm, up to a constant depending on $M$. It generalizes two inequalities of Brock-Dunfield. We also study the sharpness of the inequalities in the closed and cusped cases, using the interaction of minimal surfaces and harmonic forms. We unify various results by defining two functionals on orientable closed and cusped hyperbolic $3$-manifolds, and formulate several questions and conjectures.
description: Incorporated referee's comments. Accepted by IMRN