相关论文: Class Cardinality Comparison as a Fermi Problem
Estimating the difficulty of exam questions is essential for developing good exams, but professors are not always good at this task. We compare various Large Language Model-based methods with three professors in their ability to estimate…
Clusters of galaxies are important laboratories for understanding both galaxy evolution and constraining cosmological quantities. Any analysis of clusters, however, is best done when one can reliably determine which galaxies are members of…
Unassociated Fermi-LAT sources provide a population with discovery potential. We discuss efforts to find new source associations for this population, and summarize the successes to date. We discuss how the measured gamma-ray properties of…
The present situation of the teaching-learning relationship in astronomy is rarely investigated in our country. This is so, even when it is widely recognized that astronomy is an integral discipline, at the crossroads of advances in…
Graph pattern cardinality estimation is the problem of estimating the number of embeddings of a query graph in a data graph. This fundamental problem arises, for example, during query planning in subgraph matching algorithms. There are two…
Not only source catalogs are extracted from astronomy observations. Their sky coverage is always carefully recorded and used in statistical analyses, such as correlation and luminosity function studies. Here we present a novel method for…
With a decade of gamma-ray data from the Fermi-LAT telescope, we can now hope to answer how well we know the local Universe at gamma-ray frequencies. On the other hand, with gamma-ray data alone it is not possible to directly access the…
The Fermi Large Area Telescope First Source Catalog (1FGL) provided spatial, spectral, and temporal properties for a large number of gamma-ray sources using a uniform analysis method. After correlating with the most-complete catalogs of…
Online monitoring user cardinalities (or degrees) in graph streams is fundamental for many applications. For example in a bipartite graph representing user-website visiting activities, user cardinalities (the number of distinct visited…
We present a general probabilistic formalism for cross-identifying astronomical point sources in multiple observations. Our Bayesian approach, symmetric in all observations, is the foundation of a unified framework for object matching,…
This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]^{<kappa}, pcf-inaccessibility, entangled orders (and narrow Boolean Algebras),…
We perform the analysis of scientific collaboration at the level of universities. The scope of this study is to answer two fundamental questions: (i) can one indicate a category (i.e., a scientific discipline) that has the greatest impact…
One of the central themes in the classification task is the estimation of class posterior probability at a new point $\bf{x}$. The vast majority of classifiers output a score for $\bf{x}$, which is monotonically related to the posterior…
Let $X$ be a compact metric space and let $|A|$ denote the cardinality of a set $A$. We prove that if $f\colon X\to X$ is a homeomorphism and $|X|=\infty$ then for all $\delta>0$ there is $A\subset X$ such that $|A|=4$ and for all $k\in Z$…
Based on the well-known cardinal characteristics $\mathfrak{s}$, $\mathfrak{r}$ and $\mathfrak{i}$, we introduce nine related cardinal characteristics by using the notion of asymptotic density to characterise different intersection…
Modern astronomical surveys are producing datasets of unprecedented size and richness, increasing the potential for high-impact scientific discovery. This possibility, coupled with the challenge of exploring a large number of sources, has…
A memory-efficient framework is described for the cardinality-constrained structured data-fitting problem. Dual-based atom-identification rules are proposed that reveal the structure of the optimal primal solution from near-optimal dual…
We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…
Problem 5.1 in page 181 of [Fuc15] asks to find the cardinals $\lambda$ such that there is a universal abelian $p$-group for purity of cardinality $\lambda$, i.e., an abelian $p$-group $U_\lambda$ of cardinality $\lambda$ such that every…
We study online algorithms for maximum cardinality matchings with edge arrivals in graphs of low degree. Buchbinder, Segev, and Tkach showed that no online algorithm for maximum cardinality fractional matchings can achieve a competitive…