Results 51 to 60 of about 5,071,272 (326)
Measurement: Sensors, 2021 Aiming at railway products with high complexity of parameter features, a method for identifying key influencing factors of railway product testing based on random forest (RF) and sequential forward selection (SFS) algorithm is proposed to assist the ...
Xiulin Hou +3 more
doaj +1 more source
Pedagogical implications of students’ misconceptions about deductive geometric proof
Acta Academica, 2012 The role of proof in school geometry has been a subject of intense debate throughout the twentieth century and that debate persists even today. This study aims to identify and analyse deductive geometric proof difficulties encountered by Bachelor of ...
Mdutshekelwa Ndlovu, Andile Mji
doaj +3 more sources
, 2020 A biased, incomplete high-level survey of progress in proof complexity over the last two decades. The start of a conversation about where to go next.Non UBCUnreviewedAuthor affiliation: University of ...
Beame, Paul
core +1 more source
Proofs of Proofs of Work with Sublinear Complexity
, 2016 In the setting of blockchain based transaction ledgers we study the problem of “simplified payment verification” (SPV) which refers to the setting of a transaction verifier that wishes to examine the last k blocks of the blockchain (e.g., for the purpose of verification of a certain transaction) using as only advice the genesis block (or some ...
Kiayias, A., Lamprou, N., Stouka, A.-P.
openaire +2 more sources
Why are Proof Complexity Lower Bounds Hard
, 2020 We formalize and study the question of whether there are inherent difficulties to showing lower bounds on propositional proof complexity. We establish the following unconditional result: Propositional proof systems cannot efficiently show that truth ...
Pich, Jan
core +1 more source
Why are Proof Complexity Lower Bounds Hard?
IEEE Annual Symposium on Foundations of Computer Science, 2019 We formalize and study the question of whether there are inherent difficulties to showing lower bounds on propositional proof complexity. We establish the following unconditional result: Propositional proof systems cannot efficiently show that truth ...
J. Pich, R. Santhanam
semanticscholar +1 more source
Organoids in pediatric cancer research
FEBS Letters, EarlyView.Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
Journal of Medical Internet Research, 2020 BackgroundThe language gap between health consumers and health professionals has been long recognized as the main hindrance to effective health information comprehension.
Yu, Biyang +3 more
doaj +1 more source
The Complexity of Propositional Proofs
Bulletin of Symbolic Logic, 2007 AbstractPropositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms.
openaire +3 more sources
Gut microbiome and aging—A dynamic interplay of microbes, metabolites, and the immune system
FEBS Letters, EarlyView.Age‐dependent shifts in microbial communities engender shifts in microbial metabolite profiles. These in turn drive shifts in barrier surface permeability of the gut and brain and induce immune activation. When paired with preexisting age‐related chronic inflammation this increases the risk of neuroinflammation and neurodegenerative diseases.
Aaron Mehl, Eran Blacher
wiley +1 more source