Results 71 to 80 of about 3,023,466 (332)
Minimum distance estimation of ARFIMA processes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zevallos, M., Palma M., Wilfredo
openaire +4 more sources
Minimum Distance Distribution of Irregular Generalized LDPC Code Ensembles
In this paper, the minimum distance distribution of irregular generalized LDPC (GLDPC) code ensembles is investigated. Two classes of GLDPC code ensembles are analyzed; in one case, the Tanner graph is regular from the variable node perspective, and in ...
Flanagan, Mark F. +2 more
core +1 more source
This study integrates transcriptomic profiling of matched tumor and healthy tissues from 32 colorectal cancer patients with functional validation in patient‐derived organoids, revealing dysregulated metabolic programs driven by overexpressed xCT (SLC7A11) and SLC3A2, identifying an oncogenic cystine/glutamate transporter signature linked to ...
Marco Strecker +16 more
wiley +1 more source
Resolution of the Wicksell's equation by Minimum Distance Estimation
The estimation of the grain size in granular materials is usually performed by 2D observations. Unfolding the grain size distribution from apparent 2D sizes is commonly referred as the corpuscle problem.
Dorian Depriester, Régis Kubler
doaj +1 more source
Liquid biopsy epigenetics: establishing a molecular profile based on cell‐free DNA
Cell‐free DNA (cfDNA) fragments in plasma from cancer patients carry epigenetic signatures reflecting their cells of origin. These epigenetic features include DNA methylation, nucleosome modifications, and variations in fragmentation. This review describes the biological properties of each feature and explores optimal strategies for harnessing cfDNA ...
Christoffer Trier Maansson +2 more
wiley +1 more source
Minimum Average Distance Triangulations [PDF]
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x and y along edges of T. The length of a path is the sum of the weights of its edges.
openaire +2 more sources
Minimum Distance Estimators for Dynamic Games [PDF]
Summary: We develop a minimum distance estimator for dynamic games of incomplete information. We take a two-step approach, following \textit{V. J. Hotz} and \textit{R. A. Miller} [Rev. Econ. Stud. 60, No. 3, 497--529 (1993; Zbl 0788.90007)], based on the pseudo-model that does not solve the dynamic equilibrium so as to circumvent the potential ...
openaire +4 more sources
Computing Extensions of Linear Codes
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented.
Grassl, Markus
core +1 more source
Intein‐based modular chimeric antigen receptor platform for specific CD19/CD20 co‐targeting
CARtein is a modular CAR platform that uses split inteins to splice antigen‐recognition modules onto a universal signaling backbone, enabling precise, scarless assembly without re‐engineering signaling domains. Deployed here against CD19 and CD20 in B‐cell malignancies, the design supports flexible multi‐antigen targeting to boost T‐cell activation and
Pablo Gonzalez‐Garcia +9 more
wiley +1 more source
In recent years, an increasing number of accidents at ski resorts have raised significant safety concerns. To address these issues, it is essential to understand skiing traffic and the underlying dynamics.
Buchuan Zhang, Andreas Schadschneider
doaj +1 more source

