Results 91 to 100 of about 2,982,699 (191)

Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs [PDF]

open access: yes2011 IEEE 26th Annual Conference on Computational Complexity, 2011
In this paper, we consider lower bounds on the query complexity for testing CSPs in the bounded-degree model. First, for any ``symmetric'' predicate $P:{0,1}^{k} \to {0,1}$ except \equ where $k\geq 3$, we show that every (randomized) algorithm that distinguishes satisfiable instances of CSP(P) from instances $(|P^{-1}(0)|/2^k- )$-far from ...
openaire   +2 more sources

A Nonuniform Bound to an Independent Test in High Dimensional Data Analysis via Stein’s Method

open access: yesJournal of Probability and Statistics, 2019
The Berry-Esseen bound for the random variable based on the sum of squared sample correlation coefficients and used to test the complete independence in high diemensions is shown by Stein’s method.
Nahathai Rerkruthairat
doaj   +1 more source

How do Macroeconomic Indicators Shape Nonperforming Loans? [PDF]

open access: yesFinancial Markets, Institutions and Risks
This study examines the influence of macroeconomic indicators on nonperforming bank loans. This research focuses on the period from 2010:1Q to 2019:4Q to capture significant trends and fluctuations in the economy. Data for receivables to be liquidated as
Bilgehan Tekin, Mustafa Eraslan
doaj   +1 more source

Evaluating Economic Resilience: Lighting the Nexus Between Turkish Imports and Foreign Exchange Reserves

open access: yesStudies in Business and Economics
This study investigates the relationship between Türkiye’s imports and foreign exchange reserves, aiming to provide detailed information about Türkiye’s economic dynamics by using data from October 2002 to July 2022 and several robust methodologies ...
Tekin Bilgehan
doaj   +1 more source

A One-Sample Test for Normality with Kernel Methods [PDF]

open access: yes, 2015
We propose a new one-sample test for normality in a Reproducing Kernel Hilbert Space (RKHS). Namely, we test the null-hypothesis of belonging to a given family of Gaussian distributions.
Celisse, Alain, Kellner, Jérémie
core   +2 more sources

Enhancing spontaneous biosurfactant production through water steeping of olive mill waste

open access: yesScientific Reports
This study offers novel and valuable insights into the spontaneous production of biosurfactant extracts from olive mill waste (OMW) through a steeping process with water at 37 °C for 15 days, followed by extraction with ethyl acetate or phosphate ...
N. Russo-Martínez   +3 more
doaj   +1 more source

Lower Bounds for Convexity Testing

open access: yes
We consider the problem of testing whether an unknown and arbitrary set $S \subseteq \mathbb{R}^n$ (given as a black-box membership oracle) is convex, versus $\varepsilon$-far from every convex set, under the standard Gaussian distribution. The current state-of-the-art testing algorithms for this problem make $2^{\tilde{O}(\sqrt{n})\cdot \mathrm{poly ...
Chen, Xi   +4 more
openaire   +2 more sources

Assessment of bioavailability of tightly bound tritium in soil of the Semipalatinsk test site

open access: yesEcotoxicology and Environmental Safety
Tightly bound tritium (TBT) in soil is poorly studied in terms of its bioavailability. This paper presents the results of long-term studies (2018 through 2023) on the bioavailability of tightly bound tritium in soil.
Yelena Polivkina   +4 more
doaj   +1 more source

An exact approach for single machine scheduling with quadratic earliness and tardiness penalties [PDF]

open access: yes
In this paper, we consider the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. We propose two different lower bounds, as well as a lower bounding procedure that combines these two bounds.
Jorge M. S. Valente
core  

Improved Uniform Test Error Bounds

open access: yes, 1997
We derive distribution-free uniform test error bounds that improve on VC-type bounds for validation. We show how to use knowledge of test inputs to improve the bounds. The bounds are sharp, but they require intense computation. We introduce a method to trade sharpness for speed of computation. Also, we compute the bounds for several test cases.
openaire   +2 more sources

Home - About - Disclaimer - Privacy