bluuebunny/crossref_metadata_2025_split huggingface dataset:
Learning needs and perceived barriers and facilitators to end-of-life care: a survey of front-line nurses on acute medical wards
Authors: Reid Julie C , Hoad Neala , Willison Kathleen , Hanmiah Rajendar , Brandt Vegas Daniel , Mitri Mino , Boyle Anne , Weatherston Amanda , Lohin Susan , McInnes Deborah , Rudkowski Jill C , Joyner Michelle , Cook Deborah J 
Published: April 2023

ObjectivesCaring for dying hospitalised patients is a healthcare priority. Our objective was to understand the learning needs of front-line nurses on the general internal medicine (GIM) hospital wards, and perceived barriers to, and facilitators of, optimal end-of-life care.MethodsWe developed an 85-item survey informed by the Theoretical Domains Framework and Capability–Opportunity–Motivation–Behaviour system. We included demographics and two main domains (knowledge and practice; delivering end-of-life care) with seven subsections. Nurses from four GIM wards and the nursing resource team completed this survey. We analysed and compared results overall, by Capability, Opportunity, and Motivation, and by survey domain. We considered items with median scores <4/7 barriers. We conducted an a priori subgroup analysis based on duration of practice (≤5 and >5 years).ResultsOur response rate was 60.5% (144/238). 51% had been practising for >5 years; most respondents were female (93.1%). Nurses had similar scores on the knowledge (mean 76.0%; SD 11.6%) and delivering care (mean 74.5% (8.6%)) domains. Scores for items associated with Capability were higher than those associated with Opportunity (median (first, third quartiles) 78.6% (67.9%, 87.5%) vs 73.9% (66.0%, 81.8%); p=0.04). Nurses practising >5 years had significantly higher scores on all analyses. Barriers included engaging with families having strong emotional reactions, managing goals of care conflicts between patients and families, and staffing challenges on the ward. Additional requested resources included formal training, information binders and more staff. Opportunities for consideration include formalised on-the-job training, access to comprehensive information, including symptom management at the end of life, and debriefing sessions.ConclusionsFront-line nurses reported an interest in learning more about end-of-life care and identified important barriers that are feasible to address. These results will inform specific knowledge translation strategies to build capacity among bedside nurses to enhance end-of-life care practices for dying patients on GIM wards.
RGESolver: a C++ library to perform renormalization group evolution in the Standard Model Effective Theory
Authors: Di Noi Stefano , Silvestrini Luca 
Published: April 2023

AbstractRenormalization group evolution above the electroweak scale is a crucial ingredient in the phenomenology of the Standard Model Effective Theory. The open-source library performs the evolution at leading order for dimension-six operators in the most general flavour scenario (assuming lepton and baryon number conservation). Given its efficiency, can be used to include the effects of renormalization group evolution in extensive phenomenological analyses in the framework of the Standard Model Effective Theory.
Accelerating Fuzzing through Prefix-Guided Execution
Authors: Li Shaohua , Su Zhendong 
Published: April 2023

Coverage-guided fuzzing is one of the most effective approaches for discovering software defects and vulnerabilities. It executes all mutated tests from seed inputs to expose coverage-increasing tests. However, executing all mutated tests incurs significant performance penalties---most of the mutated tests are discarded because they do not increase code coverage. Thus, determining if a test increases code coverage without actually executing it is beneficial, but a paradoxical challenge. In this paper, we introduce the notion of prefix-guided execution (PGE) to tackle this challenge. PGE leverages two key observations: (1) Only a tiny fraction of the mutated tests increase coverage, thus requiring full execution; and (2) whether a test increases coverage may be accurately inferred from its partial execution. PGE monitors the execution of a test and applies early termination when the execution prefix indicates that the test is unlikely to increase coverage.
To demonstrate the potential of PGE, we implement a prototype on top of AFL++, which we call AFL++-PGE. We evaluate AFL++-PGE on MAGMA, a ground-truth benchmark set that consists of 21 programs from nine popular real-world projects. Our results show that, after 48 hours of fuzzing, AFL++-PGE finds more bugs, discovers bugs faster, and achieves higher coverage.
Prefix-guided execution is general and can benefit the AFL-based family of fuzzers.
Proof Automation for Linearizability in Separation Logic
Authors: Mulder Ike , Krebbers Robbert 
Published: April 2023

Recent advances in concurrent separation logic enabled the formal verification of increasingly sophisticated fine-grained (
i.e.
, lock-free) concurrent programs. For such programs, the golden standard of correctness is
linearizability
, which expresses that concurrent executions always behave as some valid sequence of sequential executions. Compositional approaches to linearizability (such as contextual refinement and logical atomicity) make it possible to prove linearizability of whole programs or compound data structures (
e.g.
, a ticket lock) using proofs of linearizability of their individual components (
e.g.
, a counter). While powerful, these approaches are also laborious—state-of-the-art tools such as Iris, FCSL, and Voila all require a form of interactive proof.

This paper develops proof automation for contextual refinement and logical atomicity in Iris. The key ingredient of our proof automation is a collection of proof rules whose application is directed by both the program and the logical state. This gives rise to effective proof search strategies that can prove linearizability of simple examples fully automatically. For more complex examples, we ensure the proof automation cooperates well with interactive proof tactics by minimizing the use of backtracking.
We implement our proof automation in Coq by extending and generalizing Diaframe, a proof automation extension for Iris. While the old version (Diaframe 1.0) was limited to ordinary Hoare triples, the new version (Diaframe 2.0) is extensible in its support for program verification styles: our proof search strategies for contextual refinement and logical atomicity are implemented as modules for Diaframe 2.0. We evaluate our proof automation on a set of existing benchmarks and novel proofs, showing that it provides significant reduction of proof work for both approaches to linearizability.
Regular Expression Matching using Bit Vector Automata
Authors: Le Glaunec Alexis , Kong Lingkun , Mamouras Konstantinos 
Published: April 2023

Regular expressions (regexes) are ubiquitous in modern software. There is a variety of implementation techniques for regex matching, which can be roughly categorized as (1) relying on backtracking search, or (2) being based on finite-state automata. The implementations that use backtracking are often chosen due to their ability to support advanced pattern-matching constructs. Unfortunately, they are known to suffer from severe performance problems. For some regular expressions, the running time for matching can be exponential in the size of the input text. In order to provide stronger guarantees of matching efficiency, automata-based regex matching is the preferred choice. However, even these regex engines may exhibit severe performance degradation for some patterns. The main reason for this is that regexes used in practice are not exclusively built from the classical regular constructs, i.e., concatenation, nondeterministic choice and Kleene's star. They involve additional constructs that provide succinctness and convenience of expression. The most common such construct is bounded repetition (also called counting), which describes the repetition of the pattern a fixed number of times.
In this paper, we propose a new algorithm for the efficient matching of regular expressions that involve bounded repetition. Our algorithms are based on a new model of automata, which we call nondeterministic bit vector automata (NBVA). This model is chosen to be expressively equivalent to nondeterministic counter automata with bounded counters, a very natural model for expressing patterns with bounded repetition. We show that there is a class of regular expressions with bounded repetition that can be matched in time that is independent from the repetition bounds. Our algorithms are general enough to cover the vast majority of challenging bounded repetitions that arise in practice. We provide an implementation of our approach in a regex engine, which we call BVA-Scan. We compare BVA-Scan against state-of-the-art regex engines on several real datasets.
Pushing the Limit of 1-Minimality of Language-Agnostic Program Reduction
Authors: Xu Zhenyang , Tian Yongqiang , Zhang Mengxiao , Zhao Gaosen , Jiang Yu , Sun Chengnian 
Published: April 2023

Program reduction has demonstrated its usefulness in facilitating debugging language implementations in practice, by minimizing bug-triggering programs. There are two categories of program reducers: language-agnostic program reducers (AGRs) and language-specific program reducers (SPRs). AGRs, such as HDD and Perses, are generally applicable to various languages; SPRs are specifically designed for one language with meticulous thoughts and significant engineering efforts, e.g., C-Reduce for reducing C/C++ programs.
Program reduction is an NP-complete problem: finding the globally minimal program is usually infeasible. Thus all existing program reducers resort to producing 1-minimal results, a special type of local minima. However, 1-minimality can still be large and contain excessive bug-irrelevant program elements. This is especially the case for AGR-produced results because of the generic reduction algorithms used in AGRs. An SPR often yields smaller results than AGRs for the language for which the SPR has customized reduction algorithms. But SPRs are not language-agnostic, and implementing a new SPR for a different language requires significant engineering efforts.
This paper proposes Vulcan, a language-agnostic framework to further minimize AGRs-produced results by exploiting the formal syntax of the language to perform aggressive program transformations, in hope of creating reduction opportunities for other reduction algorithms to progress or even directly deleting bugirrelevant elements from the results. Our key insights are two-fold. First, the program transformations in all existing program reducers including SPRs are not diverse enough, which traps these program reducers early in 1-minimality. Second, compared with the original program, the results of AGRs are much smaller, and time-wise it is affordable to perform diverse program transformations that change programs but do not necessarily reduce the sizes of the programs directly. Within the Vulcan framework, we proposed three simple examples of fine-grained program transformations to demonstrate that Vulcan can indeed further push the 1-minimality of AGRs. By performing these program transformations, a 1-minimal program might become a non-1-minimal one that can be further reduced later.
Our extensive evaluations on multilingual benchmarks including C, Rust and SMT-LIBv2 programs strongly demonstrate the effectiveness and generality of Vulcan. Vulcan outperforms the state-of-the-art language-agnostic program reducer Perses in size in all benchmarks: On average, the result of Vulcan contains 33.55%, 21.61%, and 31.34% fewer tokens than that of Perses on C, Rust, and SMT-LIBv2 subjects respectively. Vulcan can produce even smaller results if more reduction time is allocated. Moreover, for the C programs that are reduced by C-Reduce, Vulcan is even able to further minimize them by 10.07%.
Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs
Authors: Goharshady Amir Kafshdar , Hitarth S. , Mohammadi Fatemeh , Motwani Harshit Jitendra 
Published: April 2023

Template-based synthesis, also known as sketching, is a localized approach to program synthesis in which the programmer provides not only a specification, but also a high-level "sketch" of the program. The sketch is basically a partial program that models the general intuition of the programmer, while leaving the low-level details as unimplemented "holes". The role of the synthesis engine is then to fill in these holes such that the completed program satisfies the desired specification. In this work, we focus on template-based synthesis of polynomial imperative programs with real variables, i.e. imperative programs in which all expressions appearing in assignments, conditions and guards are polynomials over program variables. While this problem can be solved in a sound and complete manner by a reduction to the first-order theory of the reals, the resulting formulas will contain a quantifier alternation and are extremely hard for modern SMT solvers, even when considering toy programs with a handful of lines. Moreover, the classical algorithms for quantifier elimination are notoriously unscalable and not at all applicable to this use-case.In contrast, our main contribution is an algorithm, based on several well-known theorems in polyhedral and real algebraic geometry, namely Putinar's Positivstellensatz, the Real Nullstellensatz, Handelman's Theorem and Farkas' Lemma, which sidesteps the quantifier elimination difficulty and reduces the problem directly to Quadratic Programming (QP). Alternatively, one can view our algorithm as an efficient way of eliminating quantifiers in the particular formulas that appear in the synthesis problem. The resulting QP instances can then be handled quite easily by SMT solvers. Notably, our reduction to QP is sound and semi-complete, i.e. it is complete if polynomials of a sufficiently high degree are used in the templates. Thus, we provide the first method for sketching-based synthesis of polynomial programs that does not sacrifice completeness, while being scalable enough to handle meaningful programs. Finally, we provide experimental results over a variety of examples from the literature.
Randomized Testing of Byzantine Fault Tolerant Algorithms
Authors: Winter Levin N. , Buse Florena , de Graaf Daan , von Gleissenthall Klaus , Kulahcioglu Ozkan Burcu 
Published: April 2023

Byzantine fault-tolerant algorithms promise agreement on a correct value, even if a subset of processes can deviate from the algorithm arbitrarily. While these algorithms provide strong guarantees in theory, in practice, protocol bugs and implementation mistakes may still cause them to go wrong. This paper introduces ByzzFuzz, a simple yet effective method for automatically finding errors in implementations of Byzantine fault-tolerant algorithms through randomized testing. ByzzFuzz detects fault-tolerance bugs by injecting randomly generated network and process faults into their executions. To navigate the space of possible process faults, ByzzFuzz introduces small-scope message mutations which mutate the contents of the protocol messages by applying small changes to the original message either in value (e.g., by incrementing the round number) or in time (e.g., by repeating a proposal value from a previous message). We find that small-scope mutations, combined with insights from the testing and fuzzing literature, are effective at uncovering protocol logic and implementation bugs in real-world fault-tolerant systems.We implemented ByzzFuzz and applied it to test the production implementations of two popular blockchain systems, Tendermint and Ripple, and an implementation of the seminal PBFT protocol. ByzzFuzz detected several bugs in the implementation of PBFT, a potential liveness violation in Tendermint, and materialized two theoretically described vulnerabilities in Ripple’s XRP Ledger Consensus Algorithm. Moreover, we discovered a previously unknown fault-tolerance bug in the production implementation of Ripple, which is confirmed by the developers and fixed.
Back to Direct Style: Typed and Tight
Authors: Müller Marius , Schuster Philipp , Brachthäuser Jonathan Immanuel , Ostermann Klaus 
Published: April 2023

Translating programs into continuation-passing style is a well-studied
tool to explicitly deal with the control structure of programs. This is
useful, for example, for compilation.
In a typed setting, there also is a logical interpretation of such a translation
as an embedding of classical logic into intuitionistic logic.
A naturally arising question is whether there is an inverse translation
back to direct style. The answer to this question depends on how the
continuation-passing translation is defined and on the domain of the inverse translation.
In general, translating programs from continuation-passing style back to direct
style requires the use of control operators to account for the use of
continuations in non-trivial ways.
We present two languages, one in direct style and one in continuation-passing
style. Both languages are typed and equipped with an abstract machine semantics.
Moreover, both languages allow for non-trivial control flow.
We further present a translation to continuation-passing style and a translation
back to direct style. We show that both translations are type-preserving and
also preserve semantics in a very precise way giving an operational
correspondence between the two languages.
Moreover, we show that the compositions of the translations are well-behaved.
In particular, they are syntactic one-sided inverses on the full language and full
syntactic inverses when restricted to trivial control flow.
Interethnic Differences in Bladder Cancer Incidence and the Association between Type 2 Diabetes and Bladder Cancer in the Multiethnic Cohort Study
Authors: Bogumil David , Cortessis Victoria K. , Wilkens Lynne R. , Le Marchand Loïc , Haiman Christopher A. , Maskarinec Gertraud , Setiawan Veronica Wendy 
Published: April 2023

Background:
Research on the association between type 2 diabetes (T2D) and bladder cancer (BCA) risk among non-European ancestry populations is sparse to nonexistent, and most prior studies rely on a single baseline assessment of T2D status.

Methods:
We estimated the T2D-BCA association using the Multiethnic Cohort Study of 185,059 men and women in California and Hawaii. Participants were African American, European American, Japanese American, Latin American, and Native Hawaiian, ages 45–75 years at enrollment (1993–1996). T2D was assessed by self-report at baseline, follow-up surveys, and Medicare claims. Cases were identified using Surveillance, Epidemiology and End Results Program cancer registries through 2016. Associations were estimated by race/ethnicity using Cox proportional hazards regression. Adjusted attributable fractions (AAF) and cumulative absolute risk of bladder cancer were estimated across groups.

Results:
Over an average 19.7 years of follow-up 1,890 incident bladder cancer cases were diagnosed. Time-varying T2D was associated with bladder cancer in the multiethnic sample (HR = 1.17; 95% confidence interval, 1.05–1.30); however, the HR did not differ by race/ethnicity (P = 0.85). The AAF was 4.2% in the multiethnic sample and largest among Native Hawaiians (9.8%). Absolute risk of bladder cancer among European Americans without T2D was higher than all other groups with T2D.

Conclusion:
T2D is significantly associated with bladder cancer risk in a multiethnic sample.

Significance:
Those with T2D have higher incidence of bladder cancer, regardless of racial/ethnic group. Reducing T2D prevalence could substantially lower bladder cancer incidence among Native Hawaiians due to T2D being more common in this group. High absolute risk of bladder cancer among European Americans, regardless of T2D status, indicates that elevated bladder cancer risk in this group may be due to factors other than T2D. Future studies must explore reasons for this difference in incidence.
Ultra High-plex Spatial Proteogenomic Investigation of Giant Cell Glioblastoma Multiforme Immune Infiltrates Reveals Distinct Protein and RNA Expression Profiles
Authors: Bonnett Shilah A. , Rosenbloom Alyssa B. , Ong Giang T. , Conner Mark , Rininger Aric B.E. , Newhouse Daniel , New Felicia , Phan Chi Q. , Ilcisin Saskia , Sato Hiromi , Lyssand John S. , Geiss Gary , Beechem Joseph M. 
Published: April 2023

A deeper understanding of complex biological processes, including tumor development and immune response, requires ultra high-plex, spatial interrogation of multiple “omes”. Here we present the development and implementation of a novel spatial proteogenomic (SPG) assay on the GeoMx Digital Spatial Profiler platform with next-generation sequencing readout that enables ultra high-plex digital quantitation of proteins (&gt;100-plex) and RNA (whole transcriptome, &gt;18,000-plex) from a single formalin-fixed paraffin-embedded (FFPE) sample. This study highlighted the high concordance, R &gt; 0.85 and &lt;15% change in sensitivity between the SPG assay and the single-analyte assays on various cell lines and tissues from human and mouse. Furthermore, we demonstrate that the SPG assay was reproducible across multiple users. When used in conjunction with advanced cellular neighborhood segmentation, distinct immune or tumor RNA and protein targets were spatially resolved within individual cell subpopulations in human colorectal cancer and non–small cell lung cancer. We used the SPG assay to interrogate 23 different glioblastoma multiforme (GBM) samples across four pathologies. The study revealed distinct clustering of both RNA and protein based on pathology and anatomic location. The in-depth investigation of giant cell glioblastoma multiforme (gcGBM) revealed distinct protein and RNA expression profiles compared with that of the more common GBM. More importantly, the use of spatial proteogenomics allowed simultaneous interrogation of critical protein posttranslational modifications alongside whole transcriptomic profiles within the same distinct cellular neighborhoods.

Significance:
We describe ultra high-plex spatial proteogenomics; profiling whole transcriptome and high-plex proteomics on a single FFPE tissue section with spatial resolution. Investigation of gcGBM versus GBM revealed distinct protein and RNA expression profiles.
XXVII Congresso Brasileiro de Medicina Física e Reabilitação
Authors: Fisiátrica Acta 
Published: April 2023

O objetivo da Associação Brasileira de Medicina Física e Reabilitação (ABMFR) é o de sempre promover eventos com responsabilidade. Na organização do XXVII Congresso Brasileiro de Medicina Física e Reabilitação e preocupados com a possibilidade de sofrermos uma baixa no nosso público de médicos, profissionais da saúde e seu corpo de palestrantes internacionais e nacionais, entendemos que deveríamos nos organizar em um novo formato, agora virtual. Nosso evento aconteceu de 7 a 10 abril de 2021, através da plataforma virtual. A Comissão Cientifica preparou a melhor programação, contemplando os diversos aspectos da reabilitação, envolvendo profissionais nacionais e internacionais renomados e atuantes na área de Reabilitação, composta por Médicos Fisiatras e de outras especialidades afins, Fisioterapeutas, Terapeutas Ocupacionais, Psicólogos, Assistentes Sociais.
Eduardo de Melo Carvalho Rocha
PresidenteAssociação Brasileira de Medicina Física e Reabilitação
Duas evidências de validade da ESQUADA e níveis de qualidade da dieta dos brasileiros
Authors: Santos Thanise Sabrina Souza , Araújo Pedro Henrique de Moura , Andrade Dalton Francisco de , Louzada Maria Laura da Costa , Assis Maria Alice Altenburg de , Slater Betzabeth 
Published: April 2023

No artigo “ Duas evidências de validade da ESQUADA e níveis de qualidade da dieta dos brasileiros ”, DOI https://doi.org/10.11606/s1518-8787.2021055002397, publicado na Revista de Saúde Pública.2021;55:39, na página 10, a RSP corrige um trecho do último parágrafo da seção resultados.

Onde se lê:

θ(250,50) = 59,09 × θ(0,1) + 250.12

Leia-se:

θ(250,50) = 50 × θ(0,1) + 250.12