Results 31 to 40 of about 1,389,504 (295)

All Classical Adversary Methods are Equivalent for Total Functions [PDF]

open access: yes, 2018
We show that all known classical adversary lower bounds on randomized query complexity are equivalent for total functions, and are equal to the fractional block sensitivity fbs(f). That includes the Kolmogorov complexity bound of Laplante and Magniez and
Ambainis, Andris   +4 more
core   +2 more sources

Ultrasonic navigation – a single way for identification of brachial plexus nerves in patient with severe vascular pathology

open access: yesМедицина болю, 2018
The article discusses the successful experience of using ultrasound imaging of the brachial plexus nerves to perform a supraclavicular block of the brachial plexus with an additional block of n. cutaneus brachii medialis and n.
R. P. Chaplinsky   +4 more
doaj   +1 more source

One- and two-level filter-bank convolvers [PDF]

open access: yes, 1995
In a recent paper, it was shown in detail that in the case of orthonormal and biorthogonal filter banks we can convolve two signals by directly convolving the subband signals and combining the results. In this paper, we further generalize the result.
Phoong, See-May, Vaidyanathan, P. P.
core   +1 more source

Design and synthesis study of the thermo-sensitive poly (N-vinylpyrrolidone-b- N, N-diethylacrylamide)

open access: yesDesigned Monomers and Polymers, 2018
The reversible addition fragmentation chain transfer (RAFT) polymerization method was adopted here to prepare a series of thermo-sensitive copolymers, poly (N,N-diethyl- acrylamide-b-N-vinylpyrrolidone).
Xiayun Zhang   +8 more
doaj   +1 more source

Does the pain sensitivity questionnaire correlate with tourniquet pain in patients undergoing ankle surgery?

open access: yesFrontiers in Surgery, 2023
BackgroundTourniquet pain is the most prominent problem in ankle surgery, and there is no proper method to predict it. It was reported that pain sensitivity questionnaires could evaluate the pain sensitivity of subjects.
Qiuyue Fu   +7 more
doaj   +1 more source

Low-Sensitivity Functions from Unambiguous Certificates [PDF]

open access: yes, 2017
We provide new query complexity separations against sensitivity for total Boolean functions: a power $3$ separation between deterministic (and even randomized or quantum) query complexity and sensitivity, and a power $2.22$ separation between certificate
Ben-David, Shalev   +2 more
core   +2 more sources

The Influence of Track Structure Parameters on the Dynamic Response Sensitivity of Heavy Haul Train-LVT System

open access: yesApplied Sciences, 2021
Background: In order to study the applicability of Low Vibration Track (LVT) in heavy-haul railway tunnels, this paper carried out research on the dynamic effects of LVT heavy-haul railway wheels and rails and provided a technical reference for the ...
Zhi-Ping Zeng   +9 more
doaj   +1 more source

Automatic algorithmic driven monitoring of atrioventricular nodal re-entrant tachycardia ablation to improve procedural safety

open access: yesFrontiers in Cardiovascular Medicine, 2023
BackgroundDuring slow pathway modification for atrioventricular nodal reentrant tachycardia, heart block may occur if ablation cannot be stopped in time in response to high risk electrogram features (HREF).ObjectivesTo develop an automatic algorithm to ...
Tsz Kin Tam   +8 more
doaj   +1 more source

Size of Sets with Small Sensitivity: a Generalization of Simon's Lemma

open access: yes, 2016
We study the structure of sets $S\subseteq\{0, 1\}^n$ with small sensitivity. The well-known Simon's lemma says that any $S\subseteq\{0, 1\}^n$ of sensitivity $s$ must be of size at least $2^{n-s}$. This result has been useful for proving lower bounds on
Ambainis, Andris, Vihrovs, Jevgēnijs
core   +1 more source

Sensitivity and block sensitivity of nested canalyzing function

open access: yesCoRR, 2012
Based on a recent characterization of nested canalyzing function (NCF), we obtain the formula of the sensitivity of any NCF. Hence we find that any sensitivity of NCF is between $\frac{n+1}{2}$ and $n$. Both lower and upper bounds are tight. We prove that the block sensitivity, hence the $l$-block sensitivity, is same to the sensitivity.
Yuan Li, John O. Adeyeye
openaire   +2 more sources

Home - About - Disclaimer - Privacy