Results 61 to 70 of about 29,432 (243)

Kolmogorov Complexity in Randomness Extraction [PDF]

open access: yesACM Transactions on Computation Theory, 2011
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolmogorov complexity extractor, thus establishing a fundamental equivalence between two forms of extraction studied in the literature: Kolmogorov extraction and ...
John M. Hitchcock   +2 more
openaire   +5 more sources

Can Machine Learning Reduce Unnecessary Surgeries? A Retrospective Analysis Using Threshold Optimization to Prevent Negative Appendectomies in Adults

open access: yesAnnals of Gastroenterological Surgery, EarlyView.
Threshold‐optimized machine learning models using routine clinical and laboratory data in 623 adults undergoing appendectomy. Logistic regression (AUC = 0.765) and random forest (AUC = 0.785) were the best‐performing models for appendicitis detection and complicated appendicitis prediction, respectively.
Ivan Males   +8 more
wiley   +1 more source

An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity

open access: yesEntropy
We study practical approximations of Kolmogorov prefix complexity (K) using IMP2, a high-level programming language. Our focus is on investigating the optimality of the interpreter for this language as the reference machine for the Coding Theorem Method (
Zoe Leyva-Acosta   +2 more
doaj   +1 more source

An Algorithmic Look at Financial Volatility

open access: yesAlgorithms, 2018
In this paper, we attempt to give an algorithmic explanation to volatility clustering, one of the most exploited stylized facts in finance. Our analysis with daily data from five exchanges shows that financial volatilities follow Levin’s universal ...
Lin Ma, Jean-Paul Delahaye
doaj   +1 more source

Explaining the Origin of Negative Poisson's Ratio in Amorphous Networks With Machine Learning

open access: yesAdvanced Intelligent Discovery, EarlyView.
This review summarizes how machine learning (ML) breaks the “vicious cycle” in designing auxetic amorphous networks. By transitioning from traditional “black‐box” optimization to an interpretable “AI‐Physics” closed‐loop paradigm, ML is shown to not only discover highly optimized structures—such as all‐convex polygon networks—but also unveil hidden ...
Shengyu Lu, Xiangying Shen
wiley   +1 more source

Theses and Capstone Projects Plagiarism Checker using Kolmogorov Complexity Algorithm

open access: yesWalailak Journal of Science and Technology, 2019
In education, students attempt to copy previous works and are relying on prepared solutions available on the Internet in order to meet their requirements.
Marco Jr. Nañadiego Del Rosario   +1 more
doaj   +1 more source

Exploiting Ferroelectric and Spintronic Dynamics for Neural Network Computation

open access: yesAdvanced Intelligent Systems, EarlyView.
Ferroelectric and spintronic devices, relying on the control of polarization and magnetization, offer intrinsically fast, durable, energy‐efficient, and low‐latency building blocks for analog in‐memory computing. The hysteretic dynamics of an order parameter are leveraged to provide nonvolatile, multistate memory and nonlinear switching. Brain‐inspired
Dashiell Harrison   +4 more
wiley   +1 more source

Various information and complexity measures for analyzing the laminar-turbulent transition process in mixing layer (Analysis of fluctuating vorticity and turbulent energy dissipation rate)

open access: yesNihon Kikai Gakkai ronbunshu, 2020
In this paper, the laminar-turbulent transition process of a mixing layer downstream of a two-dimensional nozzle exit was analyzed based on various information and complexity measures.
Masashi ICHIMIYA, Ikuo NAKAMURA
doaj   +1 more source

Randomness and intractability in Kolmogorov complexity [PDF]

open access: yesElectron. Colloquium Comput. Complex., 2019
We introduce randomized time-bounded Kolmogorov complexity (rKt), a natural extension of Levin's notion [Leonid A. Levin, 1984] of Kolmogorov complexity. A string w of low rKt complexity can be decompressed from a short representation via a time-bounded algorithm that outputs w with high probability.
openaire   +4 more sources

Genetic Risk and High Burden of Depression and Suicide in the Maya‐Mestizo Population of Yucatán, México

open access: yesAmerican Journal of Medical Genetics Part B: Neuropsychiatric Genetics, EarlyView.
ABSTRACT Major depression and suicide are critical public health concerns, particularly in underrepresented populations with unique genetic and sociocultural contexts. The Maya‐mestizo population presents the highest suicide rates in the country but remains understudied in psychiatric genetics. This study evaluated the association between three genetic
Marta Menjivar   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy