bluuebunny/crossref_metadata_2025_split huggingface dataset:
Heat Preparation and Knowledge at the World Athletics Race Walking Team Championships Muscat 2022
Authors: Galan-Lopez Natalia , Esh Chris J. , Leal Diogo Vaz , Gandini Silvia , Lucas Ronan , Garrandes Frederic , Bermon Stephane , Adami Paolo Emilio , Kajeniene Alma , Hosokawa Yuri , Chrismas Bryna Catherine Rose , Stevens Christopher J. , Taylor Lee 
Published: June 2023

Purpose: To assess elite racewalkers’ preparation strategies, knowledge, and general practices for competition in the heat and their health status during the World Athletics Race Walking Teams Championships (WRW) Muscat 2022. Methods: Sixty-six elite racewalkers (male: n = 42; mean age = 25.8 y) completed an online survey prior to WRW Muscat 2022. Athletes were grouped by sex (males vs females) and climate (self-reported) they live/trained in (hot vs temperate/cold), with differences/relationships between groups assessed. Relationships between ranking (medalist/top 10 vs nonmedalist/nontop 10) and precompetition use of heat acclimation/acclimatization (HA) were assessed. Results: All surveyed medalists (n = 4) implemented, and top 10 finishers were more likely to report using (P = .049; OR = 0.25; 95% CI, 0.06%–1%), HA before the championships. Forty-three percent of athletes did not complete specific HA training. Females (8% [males 31%]) were less likely to have measured core temperature (P = .049; OR = 0.2; 95% CI, 0.041–0.99) and more likely to not know expected conditions in Muscat (42% vs 14%; P = .016; OR = 4.3; 95% CI, 1%–14%) or what wet bulb globe temperature is (83% vs 55%; P = .024; OR = 4.1; 95% CI, 1%–14%). Conclusions: Athletes who implemented HA before the championships tended to place better than those who did not. Forty-three percent of athletes did not prepare for the expected hot conditions at the WRW Muscat 2022, primarily attributed to challenges in accessing and/or cost of equipment/facilities for HA strategies. Further efforts to bridge the gap between research and practice in this elite sport are needed, particularly in female athletes.
Structural basis of a bi-functional malonyl-CoA reductase (MCR) from the photosynthetic green non-sulfur bacterium
Roseiflexus castenholzii
Authors: Zhang Xin , Xin Jiyu , Wang Zhiguo , Wu Wenping , Liu Yutong , Min Zhenzhen , Xin Yueyong , Liu Bing , He Jun , Zhang Xingwei , Xu Xiaoling 
Published: June 2023

ABSTRACT

Malonyl-CoA reductase (MCR) is a NADPH-dependent bi-functional enzyme that performs alcohol dehydrogenase and aldehyde dehydrogenase (CoA-acylating) activities in the N- and C-terminal fragments, respectively. It catalyzes the two-step reduction of malonyl-CoA to 3-hydroxypropionate (3-HP), a key reaction in the autotrophic CO
2
fixation cycles of
Chloroflexaceae
green non-sulfur bacteria and the archaea
Crenarchaeota
. However, the structural basis underlying substrate selection, coordination, and the subsequent catalytic reactions of full-length MCR is largely unknown. For the first time, we here determined the structure of full-length MCR from the photosynthetic green non-sulfur bacterium
Roseiflexus castenholzii
(
Rfx
MCR) at 3.35 Å resolution. Furthermore, we determined the crystal structures of the N- and C-terminal fragments bound with reaction intermediates NADP
+
and malonate semialdehyde (MSA) at 2.0 Å and 2.3 Å, respectively, and elucidated the catalytic mechanisms using a combination of molecular dynamics simulations and enzymatic analyses. Full-length
Rfx
MCR was a homodimer of two cross-interlocked subunits, each containing four tandemly arranged short-chain dehydrogenase/reductase (SDR) domains. Only the catalytic domains SDR1 and SDR3 incorporated additional secondary structures that changed with NADP
+
–MSA binding. The substrate, malonyl-CoA, was immobilized in the substrate-binding pocket of SDR3 through coordination with Arg1164 and Arg799 of SDR4 and the extra domain, respectively. Malonyl-CoA was successively reduced through protonation by the Tyr743–Arg746 pair in SDR3 and the catalytic triad (Thr165–Tyr178–Lys182) in SDR1 after nucleophilic attack from NADPH hydrides.

IMPORTANCE
The bi-functional MCR catalyzes NADPH-dependent reduction of malonyl-CoA to 3-HP, an important metabolic intermediate and platform chemical, from biomass. The individual MCR-N and MCR-C fragments, which contain the alcohol dehydrogenase and aldehyde dehydrogenase (CoA-acylating) activities, respectively, have previously been structurally investigated and reconstructed into a malonyl-CoA pathway for the biosynthetic production of 3-HP. However, no structural information for full-length MCR has been available to illustrate the catalytic mechanism of this enzyme, which greatly limits our capacity to increase the 3-HP yield of recombinant strains. Here, we report the cryo-electron microscopy structure of full-length MCR for the first time and elucidate the mechanisms underlying substrate selection, coordination, and catalysis in the bi-functional MCR. These findings provide a structural and mechanistic basis for enzyme engineering and biosynthetic applications of the 3-HP carbon fixation pathways.
Equation of State of an Infinitely Dilute Solution of Argon in Water
Authors: Novikov A. A. 
Published: June 2023

Abstract
A new equation of state is proposed for a solution of gas at infinite dilution, based on considering the interaction between a gas and a solvent at the microscopic level. It is used to describe the properties of an infinitely dilute aqueous solution of argon in a wide range of temperatures and pressures, including the supercritical region of water. It is shown that the resulting equation is capable of predicting the properties of an aqueous solution of an inert gas with high accuracy, based on a limited set of data at moderate temperatures.
The adoption of non-pharmaceutical interventions and the role of digital infrastructure during the COVID-19 pandemic in Colombia, Ecuador, and El Salvador
Authors: Gozzi Nicolò , Comini Niccolò , Perra Nicola 
Published: June 2023

AbstractAdherence to the non-pharmaceutical interventions (NPIs) put in place to mitigate the spreading of infectious diseases is a multifaceted problem. Several factors, including socio-demographic and socio-economic attributes, can influence the perceived susceptibility and risk which are known to affect behavior. Furthermore, the adoption of NPIs is dependent upon the barriers, real or perceived, associated with their implementation. Here, we study the determinants of NPIs adherence during the first wave of the COVID-19 Pandemic in Colombia, Ecuador, and El Salvador. Analyses are performed at the level of municipalities and include socio-economic, socio-demographic, and epidemiological indicators. Furthermore, by leveraging a unique dataset comprising tens of millions of internet Speedtest® measurements from Ookla®, we investigate the quality of the digital infrastructure as a possible barrier to adoption. We use mobility changes provided by Meta as a proxy of adherence to NPIs and find a significant correlation between mobility drops and digital infrastructure quality. The relationship remains significant after controlling for several factors. This finding suggests that municipalities with better internet connectivity were able to afford higher mobility reductions. We also find that mobility reductions were more pronounced in larger, denser, and wealthier municipalities.
The ‘
gigantic boulders
’ of the Torino Hill (NW Italy): geohistorical significance and geoheritage value
Authors: Barale Luca 
Published: June 2023

Abstract
Large boulders, up to several metres in diameter and mainly made up of metamorphic rocks, are scattered throughout the Torino Hill in NW Italy. These boulders were originally included in Oligocene–Miocene conglomerate beds and were released by alteration of the host rock at the surface. In the past two centuries, their origin and mechanisms of emplacement in the conglomerate bodies were largely debated by both Italian and foreign geologists. Some of the boulders had been given proper names by the local people and had become the object of legends and rituals. Moreover, in the past, the boulders had an economic value, being used as construction stones or exploited to produce aggregates, lime and millstones. This, together with the progressive urbanization of the area, caused the disappearance of many of the large boulders once present on the Torino Hill. The remaining ones are presently not appreciated and are almost forgotten, even though they represent an invaluable geoheritage and deserve rediscovery and protection.
cuCatch: A Debugging Tool for Efficiently Catching Memory Safety Violations in CUDA Applications
Authors: Tarek Ibn Ziad Mohamed , Damani Sana , Jaleel Aamer , Keckler Stephen W. , Stephenson Mark 
Published: June 2023

CUDA, OpenCL, and OpenACC are the primary means of writing general-purpose software for NVIDIA GPUs, all of which are subject to the same well-documented memory safety vulnerabilities currently plaguing software written in C and C++. One can argue that the GPU execution environment makes software development more error prone. Unlike C and C++, CUDA features multiple, distinct memory spaces to map to the GPU’s unique memory hierarchy, and a typical CUDA program has thousands of concurrently executing threads. Furthermore, the CUDA platform has fewer guardrails than CPU platforms that have been forced to incrementally adjust to a barrage of security attacks. Unfortunately, the peculiarities of the GPU make it difficult to directly port memory safety solutions from the CPU space.
This paper presents cuCatch, a new memory safety error detection tool designed specifically for the CUDA programming model. cuCatch combines optimized compiler instrumentation with driver support to implement a novel algorithm for catching spatial and temporal memory safety errors with low performance overheads. Our experimental results on a wide set of GPU applications show that cuCatch incurs a 19% runtime slowdown on average, which is orders of magnitude faster than state-of-the-art debugging tools on GPUs. Moreover, our quantitative evaluation demonstrates cuCatch’s higher error detection coverage compared to prior memory safety tools. The combination of high error detection coverage and low runtime overheads makes cuCatch an ideal candidate for accelerating memory safety debugging for GPU applications.
HEaaN.MLIR: An Optimizing Compiler for Fast Ring-Based Homomorphic Encryption
Authors: Park Sunjae , Song Woosung , Nam Seunghyeon , Kim Hyeongyu , Shin Junbum , Lee Juneyoung 
Published: June 2023

Homomorphic encryption (HE) is an encryption scheme that provides arithmetic operations on the encrypted data without doing decryption.
For Ring-based HE, an encryption scheme that uses arithmetic operations on a polynomial ring as building blocks, performance improvement of unit HE operations has been achieved by two kinds of efforts.
The first one is through accelerating the building blocks, polynomial operations.
However, it does not facilitate optimizations across polynomial operations such as fusing two polynomial operations.
The second one is implementing highly optimized HE operations in an amalgamated manner.
The written codes have superior performance, but they are hard to maintain.
To resolve these challenges, we propose HEaaN.MLIR, a compiler that performs optimizations across polynomial operations.
Also, we propose Poly and ModArith, compiler intermediate representations (IRs) for integer polynomial arithmetic and modulus arithmetic on integer arrays.
HEaaN.MLIR has compiler optimizations that are motivated by manual optimizations that HE developers do.
These include optimizing modular arithmetic operations, fusing loops, and vectorizing integer arithmetic instructions.
HEaaN.MLIR can parse a program consisting of the Poly and ModArith instructions and generate a high-performance, multithreaded machine code for a CPU.
Our experiment shows that the compiled operations outperform heavily optimized open-source and commercial HE libraries by up to 3.06x in a single thread and 4.55x in multiple threads.
Recursive State Machine Guided Graph Folding for Context-Free Language Reachability
Authors: Lei Yuxiang , Sui Yulei , Tan Shin Hwei , Zhang Qirun 
Published: June 2023

Context-free language reachability (CFL-reachability) is a fundamental framework for program analysis. A large variety of static analyses can be formulated as CFL-reachability problems, which determines whether specific source-sink pairs in an edge-labeled graph are connected by a reachable path, i.e., a path whose edge labels form a string accepted by the given CFL. Computing CFL-reachability is expensive. The fastest algorithm exhibits a slightly subcubic time complexity with respect to the input graph size. Improving the scalability of CFL-reachability is of practical interest, but reducing the time complexity is inherently difficult.
In this paper, we focus on improving the scalability of CFL-reachability from a more practical perspective---reducing the input graph size. Our idea arises from the existence of trivial edges, i.e., edges that do not affect any reachable path in CFL-reachability. We observe that two nodes joined by trivial edges can be folded---by merging the two nodes with all the edges joining them removed---without affecting the CFL-reachability result. By studying the characteristic of the recursive state machines (RSMs), an alternative form of CFLs, we propose an approach to identify foldable node pairs without the need to verify the underlying reachable paths (which is equivalent to solving the CFL-reachability problem). In particular, given a CFL-reachability problem instance with an input graph G and an RSM, based on the correspondence between paths in G and state transitions in RSM, we propose a graph folding principle, which can determine whether two adjacent nodes are foldable by examining only their incoming and outgoing edges.
On top of the graph folding principle, we propose an efficient graph folding algorithm GF. The time complexity of GF is linear with respect to the number of nodes in the input graph. Our evaluations on two clients (alias analysis and value-flow analysis) show that GF significantly accelerates RSM/CFL-reachability by reducing the input graph size. On average, for value-flow analysis, GF reduces 60.96% of nodes and 42.67% of edges of the input graphs, obtaining a speedup of 4.65× and a memory usage reduction of 57.35%. For alias analysis, GF reduces 38.93% of nodes and 35.61% of edges of the input graphs, obtaining a speedup of 3.21× and a memory usage reduction of 65.19%.
Better Together: Unifying Datalog and Equality Saturation
Authors: Zhang Yihong , Wang Yisu Remy , Flatt Oliver , Cao David , Zucker Philip , Rosenthal Eli , Tatlock Zachary , Willsey Max 
Published: June 2023

We present egglog, a fixpoint reasoning system that unifies Datalog and equality saturation (EqSat). Like Datalog, egglog supports efficient incremental execution, cooperating analyses, and lattice-based reasoning. Like EqSat, egglog supports term rewriting, efficient congruence closure, and extraction of optimized terms.
We identify two recent applications -- a unification-based pointer analysis in Datalog and an EqSat-based floating-point term rewriter -- that have been hampered by features missing from Datalog but found in EqSat or vice-versa. We evaluate our system by reimplementing those projects in egglog. The resulting systems in egglog are faster, simpler, and fix bugs found in the original systems.
Feature-Sensitive Coverage for Conformance Testing of Programming Language Implementations
Authors: Park Jihyeok , Youn Dongjun , Lee Kanguk , Ryu Sukyoung 
Published: June 2023

The conformance testing of programming language implementations is crucial to support correct and consistent execution environments. Because manually maintaining conformance tests for real-world programming languages is cumbersome and labor-intensive, researchers have presented various ways to make conformance tests effective and efficient. One such approach is to use graph coverage, one of the most widely-used coverage criteria, to generate tests that reach different parts of a mechanized language specification. Since mechanized specifications use functions or inductive definitions to describe the semantics of language features, traditional graph coverage criteria for software work as they are. However, they may not produce high-quality conformance tests because language implementations often have specialized execution paths for different features, even when their semantics descriptions use the same functions. Traditional graph coverage may not distinguish test requirements of such language features, which degrades the quality of conformance testing. Similarly, it may not distinguish test requirements of different parts of the same language feature when their semantics descriptions use the same functions.
We present feature-sensitive (FS) coverage as a novel coverage criterion to generate high-quality conformance tests for language implementations. It is a general extension of graph coverage, refining conventional test requirements using the innermost enclosing language features. We also introduce feature-call-path-sensitive (FCPS) coverage, a variant of FS coverage, and extend both coverage criteria using the 𝑘-limiting approach. To evaluate the effectiveness of the new coverage criteria for language implementations, we apply them to a mechanized specification of JavaScript. We extend JEST, the state-of-the-art JavaScript conformance test synthesizer using coverage-guided mutational fuzzing, with various FS and FCPS coverage criteria. For the latest JavaScript language specification (ES13, 2022), our tool automatically synthesizes 237,981 conformance tests in 50 hours with five coverage criteria. We evaluated the conformance of eight mainstream JavaScript implementations (four engines and four transpilers) with the synthesized conformance tests and discovered bugs in all of them. The tool detected 143 distinct conformance bugs (42 in engines and 101 in transpilers), 85 of which were confirmed by the developers and 83 of which were newly discovered bugs.
Abstract Interpretation of Fixpoint Iterators with Applications to Neural Networks
Authors: Müller Mark Niklas , Fischer Marc , Staab Robin , Vechev Martin 
Published: June 2023

We present a new abstract interpretation framework for the precise over-approximation of numerical fixpoint iterators.
Our key observation is that unlike in standard abstract interpretation (AI), typically used to over-approximate all reachable program states, in this setting, one only needs to abstract the concrete fixpoints, i.e., the final program states. Our framework targets numerical fixpoint iterators with convergence and uniqueness guarantees in the concrete and is based on two major technical contributions: (i) theoretical insights which allow us to compute sound and precise fixpoint abstractions without using joins, and (ii) a new abstract domain, CH-Zonotope, which admits efficient propagation and inclusion checks while retaining high precision.
We implement our framework in a tool called CRAFT and evaluate it on a novel fixpoint-based neural network architecture (monDEQ) that is particularly challenging to verify. Our extensive evaluation demonstrates that CRAFT exceeds the state-of-the-art performance in terms of speed (two orders of magnitude), scalability (one order of magnitude), and precision (25% higher certified accuracies).
CommCSL: Proving Information Flow Security for Concurrent Programs using Abstract Commutativity
Authors: Eilers Marco , Dardinier Thibault , Müller Peter 
Published: June 2023

Information flow security ensures that the secret data manipulated by a program does not influence its observable output. Proving information flow security is especially challenging for concurrent programs, where operations on secret data may influence the execution time of a thread and, thereby, the interleaving between different threads. Such internal timing channels may affect the observable outcome of a program even if an attacker does not observe execution times. Existing verification techniques for information flow security in concurrent programs attempt to prove that secret data does not influence the relative timing of threads. However, these techniques are often restrictive (for instance because they disallow branching on secret data) and make strong assumptions about the execution platform (ignoring caching, processor instructions with data-dependent runtime, and other common features that affect execution time).
In this paper, we present a novel verification technique for secure information flow in concurrent programs that lifts these restrictions and does not make any assumptions about timing behavior. The key idea is to prove that all mutating operations performed on shared data commute, such that different thread interleavings do not influence its final value. Crucially, commutativity is required only for an abstraction of the shared data that contains the information that will be leaked to a public output. Abstract commutativity is satisfied by many more operations than standard commutativity, which makes our technique widely applicable.
We formalize our technique in CommCSL, a relational concurrent separation logic with support for commutativity-based reasoning, and prove its soundness in Isabelle/HOL. We implemented CommCSL in HyperViper, an automated verifier based on the Viper verification infrastructure, and demonstrate its ability to verify challenging examples.
Substituting Fish Meal with Tubiechong (Eupolyphaga sinensis) By-Product in the Diets of Largemouth Bass (Micropterus salmoides): Effects on Growth, Meat Quality, and Liver Health
Authors: Yue Yuhua , Tong Binbin , Chen Mingshi , Bao Xiaoxue , Qiu Yanming , Yang Ying , Yu Hui , Yu Yingying 
Published: June 2023

A feeding trial was conducted to evaluate the effect of replacing 0% (control), 10% (T10), 20% (T20), 30% (T30), and 40% (T40) fish meal with a Tubiechong (Eupolyphaga sinensis) by-product in largemouth bass (Micropterus salmoides). Triplicate groups of 30 fish (

5.36
±
0.01

g

) were fed two times daily to apparent satiation for 60 days. The experimental results showed that the Tubiechong by-product could improve the growth performance of largemouth bass by increasing the FBW, WGR, and SGR until the replacement ratio was 40%. The quadratic regression analysis showed that the proportion of the Tubiechong by-product was 20.79% and 20.91%, respectively, when WGR and SGR were the best. Concurrently, the meat quality in the replacement groups was higher, specifically, the lightness and white values were higher, and the water loss rates were lower (

P
<
0.05

) than that in the control group. Moreover, the changes of the activities of CAT and GSH in the liver and T-AOC and GSH in serum could reveal the antioxidant capacity improvement of fish by the Tubiechong by-product. In the study, the replacement groups had lower T-CHO and HDL-C in serum (

P
<
0.05

), indicating that the Tubiechong by-product had an active role in improving blood lipid and regulating lipid metabolism. Simultaneously, the replacement groups had a normal structure with central hepatocytes’ nuclei and deviated from the center partly, while most of the hepatocytes were swollen in the control group with nuclear degeneration. The results showed that the Tubiechong by-product had a positive effect on the liver health of fish. Conclusively, the present study indicated that the partial dietary replacement of fish meal using the Tubiechong by-product (for up to 40% replacement level) in the diet of largemouth bass not only caused no adverse effects on fish health but also improved the growth performance, meat quality, antioxidant capacity, and hepatic health and is conducive to supplying nutritious, high-quality, and healthy aquatic products.