Results 41 to 50 of about 501,341 (265)
Sensitivity and block sensitivity of nested canalyzing function
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
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
Introduction: A palpable breast lump is a common diagnostic problem for clinicians and surgeons. Fine-needle aspiration cytology (FNAC) has many advantages such as less cost, less sample processing time, less pain, less chance of hematoma, and less ...
Pratik Bharatbhai Desai +2 more
doaj +1 more source
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
ABSTRACT Background Type 1 plasminogen deficiency (PLGD‐1) is an ultra‐rare autosomal recessive disorder caused by variants in the PLG gene and affects approximately 1.6 individuals per million. The condition is characterized by decreased plasminogen levels and impaired function, resulting in fibrin‐rich lesions on mucous membranes throughout the body.
Charles Nakar +7 more
wiley +1 more source
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
Decision Tree Complexity versus Block Sensitivity and Degree
Relations between the decision tree complexity and various other complexity measures of Boolean functions is a thriving topic of research in computational complexity. It is known that decision tree complexity is bounded above by the cube of block sensitivity, and the cube of polynomial degree.
Chugh, Rahul +2 more
openaire +5 more sources
ABSTRACT Pediatric radiation therapy presents unique challenges compared to adult treatments, including those of immobilization, potential need for sedation, and the critical importance of accurate, reproducible positioning. Additionally, heightened attention to imaging doses is necessary to minimize long‐term toxicity in survivors.
Parham Alaei +17 more
wiley +1 more source
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
Block sensitivity of weakly symmetric functions
\textit{N. Nisan} [SIAM J. Comput. 20, No. 6, 999--1007 (1991; Zbl 0737.68028)] introduced the concept of block sensitivity of a Boolean function \(f\), denoted by \(\text{bs}(f)\), proved tight bounds for computing \(\text{bs}(f)\) on a CREW PRAM and showed that block sensitivity is polynomially related to many other measures of complexity.
openaire +2 more sources

