Results 71 to 80 of about 17,450 (322)

The Interactive Factors Contributing to Fear of Death

Frontiers in Psychology, 2022
Despite the importance of the topic of death, a limited comprehensive statistical analysis conducted highlighting the complex association between fear of death and various variables. Thus, this study is conducted to account for the possible complexity by
Mahdi Rezapour
doaj   +1 more source

Longitudinal genome‐wide aneuploidy measurements in circulating cell‐free DNA to predict lack of benefit from pembrolizumab in patients with metastatic urothelial cancer

Molecular Oncology, EarlyView.
Many patients with urothelial cancer do not benefit from treatment with pembrolizumab, while at risk of severe side effects. Changes in the levels of circulating tumor DNA early during treatment, measured by a simple and affordable assay that can be easily implemented in the clinic, can be used as a prognostic tool to identify these patients.
Youssra Salhi, Stavros Makrodimitris, Sandra van Wilpe, Iris te Paske, Vanja de Weerd, Corine M. Beaufort, Hans M. Westgeest, Jens Voortman, Maureen J. B. Aarts, Maud Rijnders, Astrid A. M. van der Veldt, Ronald de Wit, Niven Mehra, Saskia M. Wilting, Debbie G. J. Robbrecht   +14 more
wiley   +1 more source

Differential Fault Attacks on Privacy Protocols Friendly Symmetric-Key Primitives: RAIN and HERA

IET Information Security
As the practical applications of fully homomorphic encryption (FHE), secure multi-party computation (MPC) and zero-knowledge (ZK) proof continue to increase, so does the need to design and analyze new symmetric-key primitives that can adapt to these ...
Lin Jiao, Yongqiang Li, Yonglin Hao, Xinxin Gong   +3 more
doaj   +1 more source

Analyzing multiplicative noise effects on Manakov's model via the new extended direct algebraic method

Results in Engineering
This paper investigates the impact of multiplicative noise on the stochastic Manakov's model, which serves as a core framework in nonlinear optics and fibre communication systems.
Muhammad Idrees Afridi, Shabbir Hussain
doaj   +1 more source

Information Gain in Event Space Reflects Chance and Necessity Components of an Event

Information, 2019
Information flow for occurrences in phase space can be assessed through the application of the Lyapunov characteristic exponent (multiplicative ergodic theorem), which is positive for non-linear systems that act as information sources and is negative for
Georg F. Weber
doaj   +1 more source

Long‐term hippocampal alterations and cognitive impairment in a murine model of surgical sepsis

FEBS Open Bio, EarlyView.
Using a mouse model of surgical sepsis, we tested long‐term memory and analyzed the transcriptome of single cells isolated from the hippocampus. Survivor mice showed worse memory, loss of certain brain cell subpopulations, and abnormal immune cell activity—suggesting that post‐sepsis brain alterations may be linked to cognitive deficits.
Dong Seong Cho, Rebecca Schmitt, Aneesha Dasgupta, Alexandra Ducharme, Jason Doles   +4 more
wiley   +1 more source

YIPFα1A expression is regulated by multilayered molecular mechanisms

FEBS Open Bio, EarlyView.
YIPFα1A, a five‐pass Golgi protein, is regulated at multiple layers. (1) Rare‐codon enrichment drives translation‐coupled mRNA decay. (2) A proximal 3′‐UTR element stabilizes mRNA. (3) A distal 3′‐UTR element included by alternate poly(A) site usage represses translation, which can be overridden by the proximal 3′‐UTR element.
Tokio Takaji, Yurika Nakanishi, Nobuhiro Nakamura   +2 more
wiley   +1 more source

The Number of Boolean Functions with Multiplicative Complexity 2 [PDF]

, 2016
Multiplicative complexity is a complexity measure defined as the minimum number of AND gates required to implement a given primitive by a circuit over the basis (AND, XOR, NOT). Implementations of ciphers with a small number of AND gates are preferred in
Meltem Sonmez Turan, Daniel Smith-Tone, Magnus Gausdal Find   +2 more
core  

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs [PDF]

, 2020
We consider two optimization problems in planar graphs. In MAXIMUM WEIGHT INDEPENDENT SET OF OBJECTS we are given a graph G and a family D of objects, each being a connected subgraph of G with a prescribed weight, and the task is to find a maximum-weight
Wiese, Andreas, Pilipczuk, Michal, Van Leeuwen, Erik Jan, Pilipczuk, Michał, Sub Algorithms and Complexity, van Leeuwen, E.J., Algorithms and Complexity, Leeuwen, Erik Jan van   +7 more
core   +1 more source

Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees [PDF]

Logical Methods in Computer Science, 2017
Given a logic presented in a sequent calculus, a natural question is that of equivalence of proofs: to determine whether two given proofs are equated by any denotational semantics, ie any categorical interpretation of the logic compatible with its cut ...
Marc Bagnol
doaj   +1 more source