Results 61 to 70 of about 1,849,669 (310)

Preliminary study on fully replacing bauxite with secondary aluminum ash in ceramsite proppants

open access: yesCase Studies in Chemical and Environmental Engineering
This study investigates using secondary aluminum ash, a solid waste, to fully replace bauxite as the main raw material, with kaolin as a binder to prepare ceramsite proppants.
Peipeng Yang   +4 more
doaj   +1 more source

Equalities and inequalities for ranks of products of generalized inverses of two matrices and their applications

open access: yesJournal of Inequalities and Applications, 2016
A complex matrix X is called an { i , … , j } $\{i,\ldots, j\}$ -inverse of the complex matrix A, denoted by A ( i , … , j ) $A^{(i,\ldots, j)}$ , if it satisfies the ith, …, jth equations of the four matrix equations (i) A X A = A $AXA = A$ , (ii) X A X
Yongge Tian
doaj   +1 more source

Miscellaneous equalities for idempotent matrices with applications

open access: yesOpen Mathematics, 2020
This article brings together miscellaneous formulas and facts on matrix expressions that are composed by idempotent matrices in one place with cogent introduction and references for further study.
Tian Yongge
doaj   +1 more source

The Impact of the COVID‐19 Pandemic on Childhood Cancer Survival: A Population‐Based Assessment of Survival Patterns Between 2015 and 2023 in Germany

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Numerous international studies have reported declines in new cancer diagnoses, delayed diagnoses and disruptions in cancer treatment following the implementation of COVID‐19 pandemic public health measures, raising concerns that these effects may ultimately contribute to increased cancer mortality.
Friederike Erdmann   +8 more
wiley   +1 more source

Slice rank and partition rank of the determinant

open access: yesCoRR
The Laplace expansion expresses the $n \times n$ determinant $\det_n$ as a sum of $n$ products. Do shorter expansions exist? In this paper we: - Fully determine the slice rank decompositions of $\det_n$ (where each product must contain a linear factor): In this case, we show that $n$ summands are necessary, and moreover, the only such expansions with $
Amichai Lampert, Guy Moshkovitz
openaire   +5 more sources

Ranking Constraints

open access: yesProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
We need to reason about rankings of objects in a wide variety of domains including information retrieval, sports tournaments, bibliometrics, and statistics. We propose a global constraint therefore for modeling rankings. One important application for rankings is in reasoning about the correlation or uncorrelation between sequences.
Bessiere, Christian   +4 more
openaire   +4 more sources

Referral Patterns and Diagnostic Timeliness in Pediatric Cancer: A Hospital‐Based Study in Indonesia

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Timely diagnosis and treatment are critical for improving survival among children with cancer. In low‐ and middle‐income countries (LMICs), delays are common and may be influenced by fragmented referral pathways and diagnostic limitations.
Nur Melani Sari   +5 more
wiley   +1 more source

TESTS OF RANK

open access: yesEconometric Theory, 2000
This paper considers tests for the rank of a matrix for which a root-T consistent estimator is available. However, in contrast to tests associated with the minimum chi-square and asymptotic least squares principles, the estimator's asymptotic variance matrix is not required to be either full or of known rank.
Robin, Jean-Marc, Smith, Richard
openaire   +6 more sources

Learning-to-Rank with BERT in TF-Ranking

open access: yesCoRR, 2020
This paper describes a machine learning algorithm for document (re)ranking, in which queries and documents are firstly encoded using BERT [1], and on top of that a learning-to-rank (LTR) model constructed with TF-Ranking (TFR) [2] is applied to further optimize the ranking performance.
Shuguang Han   +3 more
openaire   +2 more sources

Determination of the Shortest Hamiltonian Paths in an Arbitrary Graph of Distributed Databases

open access: yesРоссийский технологический журнал, 2019
A method has been developed for finding the shortest Hamiltonian path in an arbitrary graph based on the rank approach, which provides high efficiency and a significant reduction in the error in solving the problem of organizing the process of managing ...
E. G. Andrianova   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy