ABSTRACT In this paper, we provide predictions for the black hole (BH) population that would be observable with planned JWST surveys at 5 ? z 15. We base our study on recently developed Cosmic Archaeology Tool, which allows us to model BH seeds formation and growth while being consistent general of active galactic nuclei (AGNs) galaxies observed 4 7. find will a complementary view BHs > ...

Logs contain valuable information about the runtime behaviors of software systems. Thus, practitioners rely on logs for various tasks such as debugging, system comprehension, and anomaly detection. However, are difficult to analyze due their unstructured nature large size. In this paper, we propose a novel approach called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http:...

Let s(x) denote the maximum number of non-overlapping unit squares which can be packed into a large square of side length x. Let W (x) = x − s(x) denote the “wasted” area, i.e., the area not covered by the unit squares. In this note we prove that W (x) = O ( x √ 2)/7 log x ) . This improves earlier results of Erdős-Graham and Montgomery in which the upper bounds of W (x) = O(x) and W (x) = O(x(...

Traditionally, workflow modeling is typically done by interviews or questionnaires which stay quite limited for the acquisition of workflow models and their adaptation to changing requirements. In order to build such model, this paper proposes to “reverse the process”. The approach, we propose, is able to acquire workflow model from workflow log, which contains information about execution event...

In studies of complex health conditions, mixtures of discrete outcomes (event time, count, binary, ordered categorical) are commonly collected. For example, studies of skin tumorigenesis record latency time prior to the first tumor, increases in the number of tumors at each week, and the occurrence of internal tumors at the time of death. Motivated by this application, we propose a general unde...

We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erdős-Rényi graphs. For the Erdős-Rényi graph G(n, d/n), our results imply that the smallest and second-largest eigenvalues of the adjacency matrix converge to the edges of the support of the asymptotic eigenvalue distribution provided that d log n. Toget...